TSTP Solution File: LCL155-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL155-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/LCL155-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).
% 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)))).
% 30 [] equal(xor(X,Y),or(and(X,not(Y)),and(not(X),Y))).
% 35 [] equal(not(truth),falsehood).
% 36 [] -equal(xor(x,x),falsehood).
% 37 [para:20.1.1,21.1.1.1,demod:20] equal(implies(X,implies(implies(X,Y),Y)),truth).
% 48 [para:37.1.1,20.1.1,demod:20] equal(truth,implies(X,X)).
% 52 [para:48.1.2,24.1.2] equal(or(X,not(X)),truth).
% 53 [para:52.1.1,26.1.1] equal(truth,or(not(X),X)).
% 55 [para:35.1.1,23.1.1.1.2,demod:20,24] equal(implies(or(X,falsehood),X),truth).
% 62 [para:53.1.2,55.1.1.1,demod:20] equal(not(falsehood),truth).
% 63 [para:62.1.1,24.1.2.1,demod:20] equal(or(falsehood,X),X).
% 86 [para:52.1.1,27.1.2.1,demod:35] equal(and(X,not(X)),falsehood).
% 88 [para:53.1.2,27.1.2.1,demod:35] equal(and(not(X),X),falsehood).
% 124 [para:86.1.1,30.1.2.1,demod:63,88,slowcut:36] 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: 39
% derived clauses: 502
% kept clauses: 86
% kept size sum: 825
% kept mid-nuclei: 0
% kept new demods: 86
% forw unit-subs: 352
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% 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/LCL155-1+eq_r.in")
%
%------------------------------------------------------------------------------