TSTP Solution File: LCL116-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL116-2 : 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/LCL116-2+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(6,40,0,12,0,0)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(implies(truth,X),X).
% 9 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 10 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 11 [] equal(implies(implies(not(X),not(Y)),implies(Y,X)),truth).
% 12 [] -equal(implies(not(a),implies(b,not(implies(b,a)))),truth).
% 13 [para:8.1.1,10.1.1.1] equal(implies(X,X),implies(implies(X,truth),truth)).
% 15 [para:10.1.1,10.1.1.1] equal(implies(implies(implies(X,Y),Y),X),implies(implies(X,implies(Y,X)),implies(Y,X))).
% 19 [para:8.1.1,11.1.1.2] equal(implies(implies(not(X),not(truth)),X),truth).
% 20 [para:11.1.1,10.1.1.1,demod:8] equal(implies(X,Y),implies(implies(implies(X,Y),implies(not(Y),not(X))),implies(not(Y),not(X)))).
% 25 [para:19.1.1,10.1.1] equal(truth,implies(implies(not(truth),not(not(truth))),not(not(truth)))).
% 30 [para:8.1.1,9.1.1.1,demod:8] equal(implies(X,implies(implies(X,Y),Y)),truth).
% 62 [para:30.1.1,8.1.1,demod:8] equal(truth,implies(X,X)).
% 66 [para:13.1.2,30.1.1.2,demod:62] equal(implies(X,truth),truth).
% 69 [para:66.1.1,9.1.1.1,demod:8] equal(implies(X,implies(Y,X)),truth).
% 78 [para:69.1.1,9.1.1.1,demod:8] equal(implies(implies(implies(X,Y),Z),implies(Y,Z)),truth).
% 91 [para:19.1.1,78.1.1.1,demod:8] equal(implies(not(truth),X),truth).
% 98 [para:91.1.1,10.1.1.1,demod:8] equal(X,implies(implies(X,not(truth)),not(truth))).
% 99 [para:91.1.1,25.1.2.1,demod:8] equal(truth,not(not(truth))).
% 112 [para:98.1.2,11.1.1.2,demod:8,99] equal(implies(not(implies(X,not(truth))),X),truth).
% 116 [para:112.1.1,11.1.1.1,demod:8] equal(implies(X,implies(not(X),not(truth))),truth).
% 117 [para:116.1.1,10.1.1.1,demod:19,8] equal(implies(not(X),not(truth)),X).
% 118 [para:117.1.1,10.1.1.1,demod:8,91] equal(implies(X,not(truth)),not(X)).
% 121 [para:117.1.1,9.1.1.2.1,demod:118] equal(implies(implies(X,not(Y)),implies(Y,not(X))),truth).
% 124 [para:118.1.1,10.1.1,demod:8,91,118] equal(not(not(X)),X).
% 125 [para:118.1.1,9.1.1.2.1,demod:118] equal(implies(implies(X,Y),implies(not(Y),not(X))),truth).
% 128 [para:20.1.2,15.1.2.2,demod:62,8,66,125] equal(implies(not(X),not(Y)),implies(Y,X)).
% 129 [para:124.1.1,20.1.2.1.2.1,demod:8,124,121] equal(implies(X,not(Y)),implies(Y,not(X))).
% 141 [para:128.1.1,30.1.1.2.1] equal(implies(not(X),implies(implies(Y,X),not(Y))),truth).
% 150 [para:129.1.1,12.1.1.2,demod:141,cut:7] 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: 1726
% kept clauses: 137
% kept size sum: 1707
% kept mid-nuclei: 0
% kept new demods: 127
% forw unit-subs: 1541
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.2
% 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/LCL116-2+eq_r.in")
%
%------------------------------------------------------------------------------