TSTP Solution File: BOO073-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO073-1 : TPTP v3.4.2. Released v2.6.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 39.4s
% Output : Assurance 39.4s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/BOO/BOO073-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 9 1)
% (binary-posweight-lex-big-order 30 #f 9 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,15133,3,3020)
%
%
% START OF PROOF
% 5 [] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(X,inverse(add(inverse(Z),inverse(add(Z,U)))))))),Z).
% 6 [] -equal(add(add(a,b),c),add(a,add(b,c))).
% 7 [para:5.1.1,5.1.1.1.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(inverse(add(Z,U)),X)),inverse(add(inverse(Y),inverse(add(Y,V)))))))),Y).
% 8 [para:7.1.1,5.1.1.1.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(Z,X)),inverse(add(inverse(Y),inverse(add(Y,U)))))))),Y).
% 9 [para:5.1.1,7.1.1.1.2] equal(inverse(add(inverse(add(X,inverse(X))),X)),inverse(X)).
% 10 [para:9.1.1,5.1.1.1.1] equal(inverse(add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y)))))))),X).
% 13 [para:10.1.1,5.1.1.1.2.1.2] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(X,Z)))),Z).
% 17 [para:10.1.1,8.1.1.1.2.1.2] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(Z,X)),Y)))),Y).
% 19 [para:10.1.1,10.1.1.1.2.1.2] equal(inverse(add(inverse(X),inverse(add(X,X)))),X).
% 24 [para:13.1.1,7.1.1.1.2] equal(inverse(add(inverse(add(inverse(add(X,Y)),X)),inverse(add(X,Y)))),X).
% 25 [para:13.1.1,7.1.1.1.2.1.1] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(Y,inverse(add(inverse(Z),inverse(add(Z,U)))))))),Z).
% 26 [para:10.1.1,13.1.1.1.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(X),Y)))),Y).
% 29 [para:13.1.1,13.1.1.1.1] equal(inverse(add(X,inverse(add(inverse(add(Y,Z)),inverse(add(Y,X)))))),inverse(add(Y,X))).
% 32 [para:9.1.1,26.1.1.1.2] equal(inverse(add(inverse(add(add(X,inverse(X)),X)),inverse(X))),X).
% 38 [para:26.1.1,13.1.1.1.1] equal(inverse(add(X,inverse(add(Y,inverse(add(inverse(Y),X)))))),inverse(add(inverse(Y),X))).
% 47 [para:32.1.1,13.1.1.1.1] equal(inverse(add(X,inverse(add(add(X,inverse(X)),inverse(X))))),inverse(X)).
% 60 [para:47.1.1,10.1.1.1.2.1.2.1.2,demod:38] equal(inverse(add(inverse(X),inverse(X))),X).
% 62 [para:47.1.1,13.1.1.1.1.1.1] equal(inverse(add(inverse(add(inverse(X),Y)),inverse(add(X,Y)))),Y).
% 65 [para:5.1.1,60.1.1.1.1,demod:5] equal(inverse(add(X,X)),add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,inverse(add(inverse(X),inverse(add(X,U)))))))).
% 70 [para:9.1.1,60.1.1.1.1,demod:60,9] equal(X,add(inverse(add(X,inverse(X))),X)).
% 73 [para:10.1.1,60.1.1.1.1,demod:10] equal(inverse(add(X,X)),add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y)))))))).
% 75 [para:60.1.1,19.1.1.1.2] equal(inverse(add(inverse(inverse(X)),X)),inverse(X)).
% 79 [para:13.1.1,60.1.1.1.1,demod:13] equal(inverse(add(X,X)),add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,X)))).
% 89 [para:60.1.1,60.1.1.1.1,demod:60] equal(inverse(add(X,X)),add(inverse(X),inverse(X))).
% 91 [para:70.1.2,5.1.1.1.1.1,demod:73] equal(inverse(inverse(add(X,X))),X).
% 100 [para:75.1.1,26.1.1.1.2] equal(inverse(add(inverse(add(inverse(X),X)),inverse(X))),X).
% 106 [para:75.1.1,60.1.1.1.1,demod:91,89,75] equal(X,add(inverse(inverse(X)),X)).
% 112 [para:100.1.1,13.1.1.1.1,demod:91,89] equal(inverse(add(X,X)),inverse(X)).
% 118 [para:100.1.1,60.1.1.1.1,demod:112,100] equal(inverse(X),add(inverse(add(inverse(X),X)),inverse(X))).
% 119 [para:75.1.1,100.1.1.1.1.1.1,demod:118,106] equal(inverse(inverse(X)),X).
% 121 [para:100.1.1,89.1.2.1,demod:119,112,89,118] equal(X,add(X,X)).
% 127 [para:121.1.2,13.1.1.1.2.1] equal(inverse(add(inverse(add(inverse(add(X,Y)),X)),inverse(X))),X).
% 128 [para:121.1.2,26.1.1.1.1.1] equal(inverse(add(inverse(X),inverse(add(inverse(X),X)))),X).
% 136 [para:5.1.1,128.1.1.1.1,demod:119,121,65] equal(inverse(add(X,inverse(add(X,inverse(X))))),inverse(X)).
% 142 [para:136.1.1,9.1.1.1.1.1.2,demod:136] equal(inverse(add(inverse(add(add(X,inverse(add(X,inverse(X)))),inverse(X))),add(X,inverse(add(X,inverse(X)))))),inverse(X)).
% 154 [para:62.1.1,19.1.1.1.1,demod:62,121] equal(inverse(X),add(inverse(add(inverse(Y),X)),inverse(add(Y,X)))).
% 169 [para:17.1.1,19.1.1.1.1,demod:17,121] equal(inverse(X),add(inverse(add(Y,X)),inverse(add(inverse(add(Z,Y)),X)))).
% 194 [para:13.1.1,127.1.1.1.1,demod:119] equal(inverse(add(X,add(Y,X))),inverse(add(Y,X))).
% 202 [para:194.1.1,19.1.1.1.1,demod:119,89,194,121] equal(add(X,Y),add(Y,add(X,Y))).
% 226 [para:26.1.1,154.1.2.2,demod:119] equal(add(inverse(X),Y),add(inverse(add(add(X,Y),inverse(add(inverse(X),Y)))),Y)).
% 236 [para:62.1.1,154.1.2.1,demod:119] equal(add(X,Y),add(Y,inverse(add(add(inverse(X),Y),inverse(add(X,Y)))))).
% 246 [para:154.1.2,202.1.2.2,demod:154] equal(inverse(X),add(inverse(add(Y,X)),inverse(X))).
% 256 [para:5.1.1,246.1.2.2,demod:119,121,65] equal(X,add(inverse(add(Y,inverse(X))),X)).
% 258 [para:256.1.2,13.1.1.1.1.1] equal(inverse(add(inverse(X),inverse(add(Y,X)))),X).
% 263 [para:258.1.1,19.1.1.1.1,demod:258,121] equal(inverse(X),add(inverse(X),inverse(add(Y,X)))).
% 272 [para:5.1.1,263.1.2.1,demod:119,121,65] equal(X,add(X,inverse(add(Y,inverse(X))))).
% 289 [para:100.1.1,24.1.1.1.1] equal(inverse(add(X,inverse(add(inverse(X),X)))),inverse(X)).
% 295 [para:24.1.1,263.1.2.2,demod:119] equal(add(X,Y),add(add(X,Y),X)).
% 303 [para:295.1.2,17.1.1.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(Z,add(X,Y))),X)))),X).
% 304 [para:295.1.2,17.1.1.1.2.1.1.1] equal(inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(X,Z)),Y)))),Y).
% 307 [para:295.1.2,256.1.2.1.1] equal(X,add(inverse(add(inverse(X),Y)),X)).
% 309 [para:295.1.2,263.1.2.2.1] equal(inverse(X),add(inverse(X),inverse(add(X,Y)))).
% 310 [para:295.1.2,272.1.2.2.1] equal(X,add(X,inverse(add(inverse(X),Y)))).
% 335 [para:289.1.1,26.1.1.1.2,demod:272,119] equal(inverse(add(inverse(X),X)),inverse(add(X,inverse(X)))).
% 338 [para:335.1.1,19.1.1.1.1,demod:119,89,335,121] equal(add(X,inverse(X)),add(inverse(X),X)).
% 348 [para:47.1.1,29.1.1.1.2.1.1,demod:119,309] equal(inverse(add(X,Y)),inverse(add(Y,X))).
% 356 [para:348.1.1,5.1.1.1.1,demod:119,309] equal(inverse(add(inverse(add(X,inverse(add(Y,Z)))),inverse(add(Y,X)))),X).
% 357 [para:348.1.1,5.1.1.1.2,demod:119,309] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(Z,X)))),Z).
% 363 [para:348.1.1,10.1.1.1.1,demod:121,119,309] equal(inverse(add(inverse(add(X,Y)),inverse(add(Y,X)))),add(Y,X)).
% 365 [para:348.1.1,26.1.1.1.2] equal(inverse(add(inverse(add(X,Y)),inverse(add(Y,inverse(X))))),Y).
% 369 [para:348.1.1,60.1.1.1.2,demod:363] equal(add(X,Y),add(Y,X)).
% 381 [para:348.1.1,62.1.1.1.1] equal(inverse(add(inverse(add(X,inverse(Y))),inverse(add(Y,X)))),X).
% 402 [para:348.1.1,25.1.1.1.2,demod:119,309] equal(inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(Z,Y)))),Z).
% 411 [para:369.1.1,6.1.2] -equal(add(add(a,b),c),add(add(b,c),a)).
% 492 [para:381.1.1,154.1.2.1,demod:119] equal(add(X,Y),add(Y,inverse(add(add(Y,inverse(X)),inverse(add(X,Y)))))).
% 658 [para:5.1.1,363.1.1.1.1,demod:121,304,119,309] equal(inverse(X),add(inverse(add(Y,X)),inverse(add(inverse(add(Y,Z)),X)))).
% 676 [para:258.1.1,169.1.2.1,demod:119] equal(add(X,Y),add(Y,inverse(add(inverse(add(Z,inverse(Y))),inverse(add(X,Y)))))).
% 685 [para:348.1.1,169.1.2.1] equal(inverse(X),add(inverse(add(X,Y)),inverse(add(inverse(add(Z,Y)),X)))).
% 774 [para:356.1.1,19.1.1.1.1,demod:356,121] equal(inverse(X),add(inverse(add(X,inverse(add(Y,Z)))),inverse(add(Y,X)))).
% 788 [para:348.1.1,356.1.1.1.2] equal(inverse(add(inverse(add(X,inverse(add(Y,Z)))),inverse(add(X,Y)))),X).
% 814 [para:357.1.1,19.1.1.1.1,demod:357,121] equal(inverse(X),add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(X,Y)))).
% 1072 [para:357.1.1,658.1.2.2,demod:119] equal(add(X,Y),add(inverse(add(inverse(add(Y,Z)),inverse(add(X,Y)))),X)).
% 1078 [para:402.1.1,658.1.2.2,demod:119] equal(add(X,Y),add(inverse(add(inverse(add(Z,Y)),inverse(add(X,Y)))),X)).
% 2005 [para:788.1.1,685.1.2.2,demod:119] equal(add(X,Y),add(inverse(add(inverse(add(X,Y)),inverse(add(Y,Z)))),X)).
% 2066 [para:402.1.1,814.1.2.1,demod:119] equal(add(X,Y),add(X,inverse(add(inverse(add(X,Y)),inverse(add(Z,Y)))))).
% 7832 [para:303.1.1,676.1.2.2,demod:121] equal(add(inverse(add(X,add(Y,inverse(Y)))),Y),Y).
% 7842 [para:5.1.1,7832.1.1.1.1.2.2,demod:338,121,79,119,309] equal(add(inverse(add(X,add(Y,inverse(Y)))),inverse(Y)),inverse(Y)).
% 7844 [para:7832.1.1,295.1.2.1,demod:7832] equal(X,add(X,inverse(add(Y,add(X,inverse(X)))))).
% 7847 [para:7832.1.1,310.1.2.2.1] equal(add(X,add(Y,inverse(Y))),add(add(X,add(Y,inverse(Y))),inverse(Y))).
% 7850 [para:7832.1.1,365.1.1.1.2.1,demod:7844,338,119] equal(inverse(add(X,inverse(X))),inverse(add(Y,add(X,inverse(X))))).
% 7968 [para:7842.1.1,236.1.2.2.1.1,demod:338,119,309,7850,7847] equal(add(X,add(Y,inverse(Y))),add(Y,inverse(Y))).
% 7973 [para:7968.1.1,307.1.2.1.1] equal(X,add(inverse(add(Y,inverse(Y))),X)).
% 7974 [para:7968.1.1,310.1.2.2.1] equal(X,add(X,inverse(add(Y,inverse(Y))))).
% 8007 [para:7973.1.2,774.1.2.1.1,demod:7974,119] equal(add(X,inverse(X)),add(add(Y,Z),inverse(Y))).
% 8015 [para:7973.1.2,2005.1.2.1.1,demod:119] equal(add(X,inverse(X)),add(add(inverse(X),Y),X)).
% 8017 [para:7973.1.2,2066.1.2.2.1,demod:119] equal(add(X,inverse(X)),add(X,add(Y,inverse(X)))).
% 8348 [para:8007.1.2,788.1.1.1.2.1,demod:119,7974] equal(add(add(X,Y),inverse(add(inverse(X),Z))),add(X,Y)).
% 8490 [para:8015.1.2,788.1.1.1.2.1,demod:119,7974] equal(add(add(inverse(X),Y),inverse(add(X,Z))),add(inverse(X),Y)).
% 8516 [para:8017.1.2,356.1.1.1.2.1,demod:119,7974] equal(add(add(X,inverse(Y)),inverse(add(Y,Z))),add(X,inverse(Y))).
% 9332 [para:142.1.1,236.1.2.2.1.1.1,demod:8490,70,7974] equal(add(X,Y),add(Y,inverse(add(inverse(X),Y)))).
% 9334 [para:142.1.1,492.1.2.2.1.1.2,demod:8516,70,7974] equal(add(X,Y),add(Y,inverse(add(Y,inverse(X))))).
% 9337 [para:142.1.1,226.1.2.1.1.2.1.1,demod:8348,70,121,9334] equal(add(inverse(X),Y),add(inverse(add(X,Y)),Y)).
% 9341 [para:5.1.1,9332.1.2.2,demod:9337,119,309] equal(add(add(inverse(add(X,Y)),Z),inverse(add(X,Z))),add(inverse(X),Z)).
% 9369 [para:356.1.1,9332.1.2.2,demod:9337] equal(add(add(X,inverse(add(Y,Z))),inverse(add(Y,X))),add(inverse(Y),X)).
% 21126 [para:9341.1.1,9369.1.1.1,demod:8490] equal(add(inverse(X),Y),add(inverse(X),add(inverse(add(X,Z)),Y))).
% 21140 [para:7.1.1,21126.1.2.2.1,demod:119] equal(add(add(X,Y),Z),add(add(X,Y),add(Y,Z))).
% 21223 [para:1072.1.2,21126.1.2.2,demod:119] equal(add(add(X,Y),Z),add(add(X,Y),add(Z,X))).
% 21224 [para:1078.1.2,21126.1.2.2,demod:119] equal(add(add(X,Y),Z),add(add(X,Y),add(Z,Y))).
% 21563 [para:21140.1.2,202.1.2.2,demod:21223,21224,21140,slowcut:411] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 9
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 799
% derived clauses: 1528668
% kept clauses: 21555
% kept size sum: 541966
% kept mid-nuclei: 0
% kept new demods: 16405
% forw unit-subs: 1483560
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 182
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 44.46
% process. runtime: 43.85
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/BOO/BOO073-1+eq_r.in")
%
%------------------------------------------------------------------------------