TSTP Solution File: LCL109-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL109-6 : 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 : 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 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/LCL109-6+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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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(15,40,0,30,0,0)
%
%
% START OF PROOF
% 16 [] equal(X,X).
% 17 [] equal(not(X),xor(X,truth)).
% 18 [] equal(xor(X,falsehood),X).
% 19 [] equal(xor(X,X),falsehood).
% 20 [] equal(and_star(X,truth),X).
% 21 [] equal(and_star(X,falsehood),falsehood).
% 22 [] equal(and_star(xor(truth,X),X),falsehood).
% 23 [] equal(xor(X,xor(truth,Y)),xor(not(X),Y)).
% 24 [] equal(and_star(not(and_star(xor(truth,X),Y)),Y),and_star(not(and_star(xor(truth,Y),X)),X)).
% 25 [] equal(xor(X,Y),xor(Y,X)).
% 26 [] equal(and_star(and_star(X,Y),Z),and_star(X,and_star(Y,Z))).
% 27 [] equal(and_star(X,Y),and_star(Y,X)).
% 28 [] equal(not(truth),falsehood).
% 29 [] equal(implies(X,Y),xor(truth,and_star(X,xor(truth,Y)))).
% 30 [] -equal(implies(implies(implies(a,b),implies(b,a)),implies(b,a)),truth).
% 31 [para:25.1.1,18.1.1] equal(xor(falsehood,X),X).
% 32 [para:25.1.1,17.1.2] equal(not(X),xor(truth,X)).
% 33 [para:31.1.1,17.1.2] equal(not(falsehood),truth).
% 35 [para:27.1.1,20.1.1] equal(and_star(truth,X),X).
% 36 [para:27.1.1,21.1.1] equal(and_star(falsehood,X),falsehood).
% 39 [para:19.1.1,23.1.1.2,demod:17,18] equal(X,not(not(X))).
% 44 [para:24.1.1,27.1.1,demod:32] equal(and_star(not(and_star(not(X),Y)),Y),and_star(X,not(and_star(not(Y),X)))).
% 46 [para:27.1.1,24.1.1.1.1,demod:32] equal(and_star(not(and_star(X,not(Y))),X),and_star(not(and_star(not(X),Y)),Y)).
% 50 [para:22.1.1,26.1.1.1,demod:32,36] equal(falsehood,and_star(not(X),and_star(X,Y))).
% 51 [para:26.1.1,27.1.1] equal(and_star(X,and_star(Y,Z)),and_star(Z,and_star(X,Y))).
% 64 [para:19.1.1,29.1.2.2.2,demod:33,32,21] equal(implies(X,truth),truth).
% 65 [para:29.1.2,25.1.1,demod:17,32] equal(implies(X,Y),not(and_star(X,not(Y)))).
% 67 [para:22.1.1,29.1.2.2,demod:33,39,32] equal(implies(X,X),truth).
% 68 [para:27.1.1,29.1.2.2,demod:32] equal(implies(X,Y),not(and_star(not(Y),X))).
% 91 [para:65.1.2,39.1.2.1] equal(and_star(X,not(Y)),not(implies(X,Y))).
% 95 [para:26.1.1,65.1.2.1,demod:39,91] equal(implies(and_star(X,Y),Z),implies(X,implies(Y,Z))).
% 98 [para:68.1.2,39.1.2.1] equal(and_star(not(X),Y),not(implies(Y,X))).
% 101 [para:50.1.2,68.1.2.1,demod:33,95] equal(implies(X,implies(Y,X)),truth).
% 102 [para:68.1.2,65.1.2] equal(implies(not(X),Y),implies(not(Y),X)).
% 109 [para:44.1.1,26.1.1.1,demod:26,39,98] equal(and_star(X,and_star(implies(X,Y),Z)),and_star(implies(Y,X),and_star(Y,Z))).
% 146 [para:102.1.1,101.1.1.2] equal(implies(X,implies(not(X),Y)),truth).
% 150 [para:24.1.1,46.1.1.1.1,demod:35,33,28,146,98,39,32] equal(and_star(implies(X,and_star(Y,X)),implies(not(Y),X)),Y).
% 220 [para:51.1.1,68.1.2.1,demod:39,91,98,95] equal(implies(X,implies(Y,Z)),implies(Y,implies(X,Z))).
% 474 [para:220.1.1,30.1.1.1] -equal(implies(implies(b,implies(implies(a,b),a)),implies(b,a)),truth).
% 1347 [para:150.1.1,109.1.1.2,demod:35,26,64,67,95] equal(and_star(X,Y),and_star(Y,and_star(X,implies(not(Y),X)))).
% 1371 [para:1347.1.2,68.1.2.1,demod:91,95,39] equal(implies(X,implies(implies(Y,X),Y)),implies(X,Y)).
% 1398 [para:1371.1.1,474.1.1.1,demod:67,cut:16] 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 5
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 204
% derived clauses: 37717
% kept clauses: 1367
% kept size sum: 22257
% kept mid-nuclei: 0
% kept new demods: 799
% forw unit-subs: 29221
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.62
% process. runtime: 0.62
% 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/LCL109-6+eq_r.in")
%
%------------------------------------------------------------------------------