Update gems #1255

eugenk · 2015-03-11T09:59:13Z

This updates most gems to their current compatible version. I (mostly) created one commit per gem to make reverting/rebasing easier. If you want to, I will squash most of the commits before merging into staging. Please leave a comment on it.

I have not tested if 5a4e18f is okay. This depends on issue 1253 (see the commit message).

eugenk · 2015-05-05T05:32:02Z

Why is Gemnasium inactive for ontohub?

eugenk · 2015-05-05T08:51:21Z

I did one more round of gem updating. inherited_resources can't be just updated. It needs some error investigation. See #1340.

The new version only adds functionality according to the project's commit messages.

The new version only adds functionality according to the project's changelog.

This gives us the current version of font-awesome. There were some breaking changes, but this commit adjusts the views as well.

Also removes blueprint because it is not used at all.

As soon as #1253 is fixed, this needs to be tested: Visit an ontology graphs page and click on a node. If the Symbols are displayed correctly, this is okay.

It breaks out combinations feature. See #1340.

0robustus1 · 2015-05-27T14:20:48Z

Could you rebase/merge staging? On my system there are red-tests. I do not know if this is related.

eugenk · 2015-05-27T15:45:52Z

Done

ebolloff · 2015-05-28T10:58:32Z

When I run rake I get

Calling hets/prove on "spec/fixtures/ontologies/prove/Simple_Implications.casl"
rake aborted!
JSON::ParserError: 757: unexpected token at '*** Error: no matching translation or prover found
'

eugenk · 2015-05-28T18:49:59Z

I can't reproduce this on my machine. Could you please delete the generated fixtures with

git clean -fdX spec/

and run rake again? Does the error still occur?

0robustus1 · 2015-05-28T19:36:15Z

Yep still occurs (at least one mine). Could we do a comparison of installed hets versions?

mine: version of hets: v0.99, 1430921534

eugenk · 2015-05-28T20:00:19Z

I got the same version

ebolloff · 2015-05-29T11:50:10Z

I still get the error on this branch. My hets version version of hets: v0.99, 1431506945.

eugenk · 2015-05-29T14:25:53Z

Given that your hets server runs, what does this command print?

curl -X POST -H "Content-Type: application/json" -d '{"format":"json"}' http://localhost:8000/prove/file%3A%2F%2F%2Fescaped%2Fpath%2Fto%2Fontohub%2Fspec%2Ffixtures%2Fontologies%2Fprove%2FSimple_Implications.casl/auto

(Note that you need to adjust the escaped path)

0robustus1 · 2015-05-29T14:33:32Z

[{
"node": "CounterSatisfiable",
"goals": [{
 "name": "Ax2",
 "result": "Disproved",
 "details": "",
 "used_prover": { "identifier": "SPASS", "name": "SPASS" },
 "used_translation": "CASL2SoftFOL",
 "tactic_script": {
  "time_limit": 1, "extra_options": [ "-DocProof"] },
 "proof_tree": "",
 "used_time": {
  "seconds": 0, "components": { "hours": 0, "mins": 0, "secs": 0 }
  },
 "used_axioms": [],
 "prover_output":
  "\n--------------------------SPASS-START-----------------------------\nInput Problem:\n1[0:Inp] ||  -> equal(zero,one)**.\n2[0:Inp] ||  -> equal(U,zero)*.\n This is a unit equality problem.\n This is a problem that has, if any, a finite domain model.\n There is a finite domain clause.\n There are no function symbols.\n The conjecture is ground.\n Axiom clauses: 1 Conjecture clauses: 1\n Inferences: ISpR=1 ISpL=1 \n Reductions: RFRew=1 RBRew=1 RFMRR=1 RBMRR=1 RObv=1 RUnC=1 RTaut=1 RFSub=1 RBSub=1 \n Extras    : Input Saturation, Always Selection, No Splitting, Full Reduction,  Ratio: 5, FuncWeight: 1, VarWeight: 1\n Precedence: zero > one\n Ordering  : KBO\nProcessed Problem:\n\nWorked Off Clauses:\n\nUsable Clauses:\n3[0:Rew:1.0,2.0] ||  -> equal(U,one)*.\n\tGiven clause: 3[0:Rew:1.0,2.0] ||  -> equal(U,one)*.\n\tGiven clause: 5[0:SpR:3.0,3.0] ||  -> equal(U,V)*.\nSPASS V 3.7 \nSPASS beiseite: Completion found.\nProblem: Read from stdin. \nSPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 4 clauses.\nSPASS allocated 45932 KBytes.\nSPASS spent\t0:00:00.03 on the problem.\n\t\t0:00:00.01 for the input.\n\t\t0:00:00.01 for the FLOTTER CNF translation.\n\t\t0:00:00.00 for inferences.\n\t\t0:00:00.00 for the backtracking.\n\t\t0:00:00.00 for the reduction.\n\n\n The saturated set of worked-off clauses is :\n5[0:SpR:3.0,3.0] ||  -> equal(U,V)*.\n--------------------------SPASS-STOP------------------------------\n"
 }]
}, {
"node": "Theorem",
"goals": [{
 "name": "Ax1",
 "result": "Proved",
 "details": "",
 "used_prover": { "identifier": "SPASS", "name": "SPASS" },
 "used_translation": "CASL2SoftFOL",
 "tactic_script": {
  "time_limit": 1, "extra_options": [ "-DocProof"] },
 "proof_tree": "",
 "used_time": {
  "seconds": 0, "components": { "hours": 0, "mins": 0, "secs": 0 }
  },
 "used_axioms": [],
 "prover_output":
  "\n--------------------------SPASS-START-----------------------------\nInput Problem:\n1[0:Inp] || equal(skc1,skc1)* -> .\n This is a unit equality problem.\n This is a problem that has, if any, a finite domain model.\n There are no function symbols.\n The conjecture is ground.\n Axiom clauses: 0 Conjecture clauses: 1\n Inferences: IEqR=1 \n Reductions: RFMRR=1 RBMRR=1 RObv=1 RUnC=1 RTaut=1 RFSub=1 RBSub=1 \n Extras    : Input Saturation, Always Selection, No Splitting, Full Reduction,  Ratio: 5, FuncWeight: 1, VarWeight: 1\n Precedence: zero > skc0 > skc1\n Ordering  : KBO\nProcessed Problem:\n\nWorked Off Clauses:\n\nUsable Clauses:\n\nSPASS V 3.7 \nSPASS beiseite: Proof found.\nProblem: Read from stdin. \nSPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 1 clauses.\nSPASS allocated 45930 KBytes.\nSPASS spent\t0:00:00.03 on the problem.\n\t\t0:00:00.01 for the input.\n\t\t0:00:00.01 for the FLOTTER CNF translation.\n\t\t0:00:00.00 for inferences.\n\t\t0:00:00.00 for the backtracking.\n\t\t0:00:00.00 for the reduction.\n\n\nHere is a proof with depth 0, length 2 :\n1[0:Inp] || equal(skc1,skc1)* -> .\n2[0:Obv:1.0] ||  -> .\nFormulae used in the proof : ax1\n\n--------------------------SPASS-STOP------------------------------\n"
 }]
}, {
"node": "Group",
"goals": [{
 "name": "rightunit",
 "result": "Proved",
 "details": "",
 "used_prover": { "identifier": "SPASS", "name": "SPASS" },
 "used_translation": "CASL2SoftFOL",
 "tactic_script": {
  "time_limit": 1, "extra_options": [ "-DocProof"] },
 "proof_tree": "",
 "used_time": {
  "seconds": 0, "components": { "hours": 0, "mins": 0, "secs": 0 }
  },
 "used_axioms": [ "leftunit", "Ax2", "ga_assoc___+__"],
 "prover_output":
  "\n--------------------------SPASS-START-----------------------------\nInput Problem:\n1[0:Inp] ||  -> equal(o__Plus__(U,zero),U)**.\n2[0:Inp] || equal(o__Plus__(zero,skc1),skc1)** -> .\n3[0:Inp] ||  -> equal(o__Plus__(U,minus__(U)),zero)**.\n4[0:Inp] ||  -> equal(o__Plus__(o__Plus__(U,V),W),o__Plus__(U,o__Plus__(V,W)))**.\n This is a unit equality problem.\n This is a problem that has, if any, a non-trivial domain model.\n The conjecture is ground.\n Axiom clauses: 3 Conjecture clauses: 1\n Inferences: IEqR=1 ISpR=1 ISpL=1 \n Reductions: RFRew=1 RBRew=1 RFMRR=1 RBMRR=1 RObv=1 RUnC=1 RTaut=1 RFSub=1 RBSub=1 \n Extras    : Input Saturation, No Selection, No Splitting, Full Reduction,  Ratio: 5, FuncWeight: 1, VarWeight: 1\n Precedence: o__Plus__ > minus__ > skc1 > skc0 > zero\n Ordering  : KBO\nProcessed Problem:\n\nWorked Off Clauses:\n\nUsable Clauses:\n1[0:Inp] ||  -> equal(o__Plus__(U,zero),U)**.\n2[0:Inp] || equal(o__Plus__(zero,skc1),skc1)** -> .\n3[0:Inp] ||  -> equal(o__Plus__(U,minus__(U)),zero)**.\n4[0:Inp] ||  -> equal(o__Plus__(o__Plus__(U,V),W),o__Plus__(U,o__Plus__(V,W)))**.\n\tGiven clause: 1[0:Inp] ||  -> equal(o__Plus__(U,zero),U)**.\n\tGiven clause: 2[0:Inp] || equal(o__Plus__(zero,skc1),skc1)** -> .\n\tGiven clause: 3[0:Inp] ||  -> equal(o__Plus__(U,minus__(U)),zero)**.\n\tGiven clause: 4[0:Inp] ||  -> equal(o__Plus__(o__Plus__(U,V),W),o__Plus__(U,o__Plus__(V,W)))**.\n\tGiven clause: 11[0:SpR:1.0,4.0] ||  -> equal(o__Plus__(U,o__Plus__(zero,V)),o__Plus__(U,V))**.\n\tGiven clause: 21[0:Rew:1.0,20.0] ||  -> equal(o__Plus__(U,minus__(zero)),U)**.\n\tGiven clause: 8[0:SpR:4.0,3.0] ||  -> equal(o__Plus__(U,o__Plus__(V,minus__(o__Plus__(U,V)))),zero)**.\n\tGiven clause: 12[0:SpR:3.0,4.0] ||  -> equal(o__Plus__(U,o__Plus__(minus__(U),V)),o__Plus__(zero,V))**.\n\tGiven clause: 67[0:Rew:1.0,61.0] ||  -> equal(o__Plus__(zero,minus__(minus__(U))),U)**.\nSPASS V 3.7 \nSPASS beiseite: Proof found.\nProblem: Read from stdin. \nSPASS derived 48 clauses, backtracked 0 clauses, performed 0 splits and kept 17 clauses.\nSPASS allocated 46026 KBytes.\nSPASS spent\t0:00:00.14 on the problem.\n\t\t0:00:00.08 for the input.\n\t\t0:00:00.05 for the FLOTTER CNF translation.\n\t\t0:00:00.00 for inferences.\n\t\t0:00:00.00 for the backtracking.\n\t\t0:00:00.00 for the reduction.\n\n\nHere is a proof with depth 3, length 11 :\n1[0:Inp] ||  -> equal(o__Plus__(U,zero),U)**.\n2[0:Inp] || equal(o__Plus__(zero,skc1),skc1)** -> .\n3[0:Inp] ||  -> equal(o__Plus__(U,minus__(U)),zero)**.\n4[0:Inp] ||  -> equal(o__Plus__(o__Plus__(U,V),W),o__Plus__(U,o__Plus__(V,W)))**.\n11[0:SpR:1.0,4.0] ||  -> equal(o__Plus__(U,o__Plus__(zero,V)),o__Plus__(U,V))**.\n12[0:SpR:3.0,4.0] ||  -> equal(o__Plus__(U,o__Plus__(minus__(U),V)),o__Plus__(zero,V))**.\n61[0:SpR:3.0,12.0] ||  -> equal(o__Plus__(zero,minus__(minus__(U))),o__Plus__(U,zero))**.\n67[0:Rew:1.0,61.0] ||  -> equal(o__Plus__(zero,minus__(minus__(U))),U)**.\n77[0:SpR:67.0,11.0] ||  -> equal(o__Plus__(U,minus__(minus__(V))),o__Plus__(U,V))**.\n79[0:Rew:77.0,67.0] ||  -> equal(o__Plus__(zero,U),U)**.\n80[0:UnC:79.0,2.0] ||  -> .\nFormulae used in the proof : leftunit rightunit ax2 ga_assoc___Plus__\n\n--------------------------SPASS-STOP------------------------------\n"
 }, {
 "name": "zero_plus",
 "result": "Proved",
 "details": "",
 "used_prover": { "identifier": "SPASS", "name": "SPASS" },
 "used_translation": "CASL2SoftFOL",
 "tactic_script": {
  "time_limit": 1, "extra_options": [ "-DocProof"] },
 "proof_tree": "",
 "used_time": {
  "seconds": 0, "components": { "hours": 0, "mins": 0, "secs": 0 }
  },
 "used_axioms": [ "rightunit"],
 "prover_output":
  "\n--------------------------SPASS-START-----------------------------\nInput Problem:\n1[0:Inp] ||  -> equal(o__Plus__(zero,U),U)**.\n2[0:Inp] ||  -> equal(o__Plus__(U,zero),U)**.\n3[0:Inp] || equal(o__Plus__(zero,zero),zero)** -> .\n4[0:Inp] ||  -> equal(o__Plus__(U,minus__(U)),zero)**.\n5[0:Inp] ||  -> equal(o__Plus__(o__Plus__(U,V),W),o__Plus__(U,o__Plus__(V,W)))**.\n This is a unit equality problem.\n This is a problem that has, if any, a non-trivial domain model.\n The conjecture is ground.\n Axiom clauses: 4 Conjecture clauses: 1\n Inferences: IEqR=1 ISpR=1 ISpL=1 \n Reductions: RFRew=1 RBRew=1 RFMRR=1 RBMRR=1 RObv=1 RUnC=1 RTaut=1 RFSub=1 RBSub=1 \n Extras    : Input Saturation, No Selection, No Splitting, Full Reduction,  Ratio: 5, FuncWeight: 1, VarWeight: 1\n Precedence: o__Plus__ > minus__ > zero\n Ordering  : KBO\nProcessed Problem:\n\nWorked Off Clauses:\n\nUsable Clauses:\n1[0:Inp] ||  -> equal(o__Plus__(zero,U),U)**.\n2[0:Inp] ||  -> equal(o__Plus__(U,zero),U)**.\n4[0:Inp] ||  -> equal(o__Plus__(U,minus__(U)),zero)**.\n5[0:Inp] ||  -> equal(o__Plus__(o__Plus__(U,V),W),o__Plus__(U,o__Plus__(V,W)))**.\nSPASS V 3.7 \nSPASS beiseite: Proof found.\nProblem: Read from stdin. \nSPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 4 clauses.\nSPASS allocated 45941 KBytes.\nSPASS spent\t0:00:00.05 on the problem.\n\t\t0:00:00.01 for the input.\n\t\t0:00:00.02 for the FLOTTER CNF translation.\n\t\t0:00:00.00 for inferences.\n\t\t0:00:00.00 for the backtracking.\n\t\t0:00:00.00 for the reduction.\n\n\nHere is a proof with depth 0, length 4 :\n1[0:Inp] ||  -> equal(o__Plus__(zero,U),U)**.\n3[0:Inp] || equal(o__Plus__(zero,zero),zero)** -> .\n6[0:Rew:1.0,3.0] || equal(zero,zero)* -> .\n7[0:Obv:6.0] ||  -> .\nFormulae used in the proof : rightunit zero_plus\n\n--------------------------SPASS-STOP------------------------------\n"
 }]
}]

ebolloff · 2015-06-22T14:20:53Z

👍

Update gems

0robustus1 self-assigned this May 4, 2015

eugenk force-pushed the update_gems branch 2 times, most recently from b7eddb2 to 9c7fd4e Compare May 4, 2015 16:24

eugenk added 25 commits May 5, 2015 12:30

Update the bundle.

df94766

Update gem (critical): rest-client.

bf7856d

Update gem (critical): rugged.

9aac2da

Remove gem (unused): js-routes.

2cbae67

Update gem: acts_as_tree

406711d

The new version only adds functionality according to the project's commit messages.

Update gem: devise.

0121868

Update gem: foreigner.

e83c7b6

Update gem: pg.

709723a

Update gem: inherited_resources.

74c5906

Update gem: nokogiri.

6509736

Update gems: rdf, rdf-rdfxml, rdf-n3.

63b62e7

Update gem: rails-erd

bfb5420

The new version only adds functionality according to the project's changelog.

Update gem: secure_headers.

a209f57

Update gems: sidekiq, sidetiq.

1cfa9d1

Add compatibility comments.

262b437

Update gem: better_errors.

895d9e8

Update gems: bootstrap-sass, bootstrap-select-rails.

b53b301

Replace gem: font_awesome by font-awesome-sass

ccb3ac3

This gives us the current version of font-awesome. There were some breaking changes, but this commit adjusts the views as well.

Delete unused file.

13089ce

Update gem: capybara.

d0493a6

Update gem: compass

86e6b0a

Also removes blueprint because it is not used at all.

Update gem: d3_rails.

de14dfe

Update gem: database_cleaner.

fdef93e

Update gem: factory_girl.

a0e1b3f

Update gem: handlebars_assets

002a011

As soon as #1253 is fixed, this needs to be tested: Visit an ontology graphs page and click on a node. If the Symbols are displayed correctly, this is okay.

eugenk added 10 commits May 5, 2015 12:30

Update gem: pry-byebug.

e10842f

Update gem: rest-client.

bcd4674

Add compatibility comment on rspec-its.

589d2bc

Add compatibility comment on sass-rails.

e4bee13

Update gem: secure_headers.

392405b

Add compatibility comment on simple_form.

69afca3

Update gem: simplecov.

e1491cb

Update gem: webmock.

35dc5c4

Update gem: capistrano.

9406ea3

Downgrade gem again: inherited_resources

095324d

It breaks out combinations feature. See #1340.

eugenk force-pushed the update_gems branch from f1642ad to 095324d Compare May 5, 2015 10:30

0robustus1 mentioned this pull request May 29, 2015

staging tests failing on at least one development machine #1358

Closed

tillmo mentioned this pull request Jun 1, 2015

ontologies are "pending" too long #1353

Closed

Merge branch 'staging' into update_gems

b3a33f4

eugenk force-pushed the update_gems branch from 0b844de to b3a33f4 Compare June 8, 2015 08:51

tillmo assigned SGraef and unassigned 0robustus1 Jun 22, 2015

eugenk added a commit that referenced this pull request Jun 23, 2015

Merge pull request #1255 from ontohub/update_gems

1a5800e

Update gems

eugenk merged commit 1a5800e into staging Jun 23, 2015

eugenk deleted the update_gems branch June 23, 2015 04:18

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Update gems #1255

Update gems #1255

eugenk commented Mar 11, 2015

eugenk commented May 5, 2015

eugenk commented May 5, 2015

0robustus1 commented May 27, 2015

eugenk commented May 27, 2015

ebolloff commented May 28, 2015

eugenk commented May 28, 2015

0robustus1 commented May 28, 2015

eugenk commented May 28, 2015

ebolloff commented May 29, 2015

eugenk commented May 29, 2015

0robustus1 commented May 29, 2015

ebolloff commented Jun 22, 2015

Update gems #1255

Update gems #1255

Conversation

eugenk commented Mar 11, 2015

eugenk commented May 5, 2015

eugenk commented May 5, 2015

0robustus1 commented May 27, 2015

eugenk commented May 27, 2015

ebolloff commented May 28, 2015

eugenk commented May 28, 2015

0robustus1 commented May 28, 2015

eugenk commented May 28, 2015

ebolloff commented May 29, 2015

eugenk commented May 29, 2015

0robustus1 commented May 29, 2015

ebolloff commented Jun 22, 2015