TSTP Solution File: LCL164-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL164-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 : art08.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/LCL164-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 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).
% 22 [] equal(and_star(xor(truth,X),X),falsehood).
% 23 [] equal(xor(X,xor(truth,Y)),xor(not(X),Y)).
% 25 [] equal(xor(X,Y),xor(Y,X)).
% 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(not(x),not(y)),implies(y,x)),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).
% 39 [para:19.1.1,23.1.1.2,demod:17,18] equal(X,not(not(X))).
% 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))).
% 71 [para:23.1.1,29.1.2.2.2,demod:31,28,32] equal(implies(X,not(Y)),not(and_star(X,Y))).
% 98 [para:68.1.2,39.1.2.1] equal(and_star(not(X),Y),not(implies(Y,X))).
% 124 [para:71.1.1,30.1.1.1,demod:67,39,98,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: 43
% derived clauses: 935
% kept clauses: 93
% kept size sum: 1066
% kept mid-nuclei: 0
% kept new demods: 59
% forw unit-subs: 787
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% 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/LCL164-1+eq_r.in")
%
%------------------------------------------------------------------------------