TSTP Solution File: LCL159-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL159-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.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 0.0s
% Output : Assurance 0.0s
% 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/LCL/LCL159-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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(18,40,1,36,0,1)
%
%
% START OF PROOF
% 20 [] equal(implies(truth,X),X).
% 21 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 22 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 23 [] equal(implies(implies(not(X),not(Y)),implies(Y,X)),truth).
% 24 [] equal(or(X,Y),implies(not(X),Y)).
% 26 [] equal(or(X,Y),or(Y,X)).
% 27 [] equal(and(X,Y),not(or(not(X),not(Y)))).
% 29 [] equal(and(X,Y),and(Y,X)).
% 30 [] equal(xor(X,Y),or(and(X,not(Y)),and(not(X),Y))).
% 35 [] equal(not(truth),falsehood).
% 36 [] -equal(xor(x,xor(truth,y)),xor(xor(x,truth),y)).
% 41 [para:35.1.1,24.1.2.1] equal(or(truth,X),implies(falsehood,X)).
% 45 [para:20.1.1,21.1.1.1,demod:20] equal(implies(X,implies(implies(X,Y),Y)),truth).
% 49 [para:41.1.1,26.1.1] equal(implies(falsehood,X),or(X,truth)).
% 50 [para:45.1.1,20.1.1,demod:20] equal(truth,implies(X,X)).
% 52 [para:50.1.2,24.1.2] equal(or(X,not(X)),truth).
% 54 [para:52.1.1,26.1.1] equal(truth,or(not(X),X)).
% 55 [para:20.1.1,22.1.1.1,demod:50] equal(truth,implies(implies(X,truth),truth)).
% 64 [para:55.1.2,45.1.1.2] equal(implies(X,truth),truth).
% 65 [para:64.1.1,24.1.2,demod:49] equal(implies(falsehood,X),truth).
% 66 [para:64.1.1,21.1.1.1,demod:20] equal(implies(X,implies(Y,X)),truth).
% 70 [para:65.1.1,22.1.1.1,demod:20] equal(X,implies(implies(X,falsehood),falsehood)).
% 71 [para:35.1.1,23.1.1.1.2,demod:20,24] equal(implies(or(X,falsehood),X),truth).
% 72 [para:24.1.2,23.1.1.1] equal(implies(or(X,not(Y)),implies(Y,X)),truth).
% 74 [para:24.1.2,66.1.1.2] equal(implies(X,or(Y,X)),truth).
% 78 [para:26.1.1,74.1.1.2] equal(implies(X,or(X,Y)),truth).
% 87 [para:24.1.2,70.1.2.1] equal(not(X),implies(or(X,falsehood),falsehood)).
% 94 [para:71.1.1,22.1.1.1,demod:78,20] equal(X,or(X,falsehood)).
% 95 [para:54.1.2,71.1.1.1,demod:20] equal(not(falsehood),truth).
% 102 [para:95.1.1,24.1.2.1,demod:20] equal(or(falsehood,X),X).
% 105 [para:35.1.1,27.1.2.1.1,demod:102] equal(and(truth,X),not(not(X))).
% 110 [para:95.1.1,27.1.2.1.1,demod:35,65,41] equal(and(falsehood,X),falsehood).
% 111 [para:95.1.1,27.1.2.1.2,demod:35,65,49] equal(and(X,falsehood),falsehood).
% 121 [para:30.1.2,26.1.1] equal(xor(X,Y),or(and(not(X),Y),and(X,not(Y)))).
% 174 [para:26.1.1,87.1.2.1,demod:102] equal(not(X),implies(X,falsehood)).
% 176 [para:87.1.2,21.1.1.2.1,demod:24,174,94] equal(implies(implies(X,Y),or(Y,not(X))),truth).
% 177 [para:174.1.2,24.1.2,demod:105,94] equal(X,and(truth,X)).
% 178 [para:177.1.2,29.1.1] equal(X,and(X,truth)).
% 179 [para:177.1.2,30.1.2.1,demod:94,110,35] equal(xor(truth,X),not(X)).
% 180 [para:178.1.2,30.1.2.2,demod:102,111,35] equal(xor(X,truth),not(X)).
% 190 [para:179.1.1,36.1.1.2,demod:180] -equal(xor(x,not(y)),xor(not(x),y)).
% 237 [para:72.1.1,22.1.1.1,demod:176,20] equal(implies(X,Y),or(Y,not(X))).
% 240 [para:237.1.2,26.1.1] equal(implies(X,Y),or(not(X),Y)).
% 243 [para:237.1.2,27.1.2.1] equal(and(X,Y),not(implies(Y,not(X)))).
% 261 [para:105.1.2,243.1.2.1.2,demod:177] equal(and(not(X),Y),not(implies(Y,X))).
% 285 [para:261.1.1,30.1.2.1,demod:240,177,105,24] equal(xor(not(X),Y),implies(or(Y,X),and(X,Y))).
% 957 [para:105.1.2,121.1.2.2.2,demod:285,240,177,24,261,slowcut:190] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 207
% derived clauses: 19657
% kept clauses: 919
% kept size sum: 12362
% kept mid-nuclei: 0
% kept new demods: 389
% forw unit-subs: 15938
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.22
% process. runtime: 0.21
% 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/LCL/LCL159-1+eq_r.in")
%
%------------------------------------------------------------------------------