TSTP Solution File: LCL109-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL109-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 : art09.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-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 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(6,40,0,12,0,0,141,50,41,147,0,41)
%
%
% START OF PROOF
% 143 [] equal(implies(truth,X),X).
% 144 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 145 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 146 [] equal(implies(implies(not(X),not(Y)),implies(Y,X)),truth).
% 147 [] -equal(implies(implies(implies(a,b),implies(b,a)),implies(b,a)),truth).
% 148 [para:143.1.1,145.1.1.1] equal(implies(X,X),implies(implies(X,truth),truth)).
% 150 [para:145.1.1,145.1.1.1] equal(implies(implies(implies(X,Y),Y),X),implies(implies(X,implies(Y,X)),implies(Y,X))).
% 154 [para:145.1.1,147.1.1] -equal(implies(implies(implies(b,a),implies(a,b)),implies(a,b)),truth).
% 155 [para:143.1.1,146.1.1.2] equal(implies(implies(not(X),not(truth)),X),truth).
% 156 [para:146.1.1,145.1.1.1,demod:143] equal(implies(X,Y),implies(implies(implies(X,Y),implies(not(Y),not(X))),implies(not(Y),not(X)))).
% 166 [para:143.1.1,144.1.1.1,demod:143] equal(implies(X,implies(implies(X,Y),Y)),truth).
% 169 [para:145.1.1,144.1.1.1] equal(implies(implies(implies(X,Y),Y),implies(implies(X,Z),implies(implies(Y,X),Z))),truth).
% 170 [para:145.1.1,144.1.1.2.1] equal(implies(implies(X,implies(Y,Z)),implies(implies(implies(Z,Y),Y),implies(X,Z))),truth).
% 198 [para:166.1.1,143.1.1,demod:143] equal(truth,implies(X,X)).
% 202 [para:148.1.2,166.1.1.2,demod:198] equal(implies(X,truth),truth).
% 205 [para:202.1.1,144.1.1.1,demod:143] equal(implies(X,implies(Y,X)),truth).
% 212 [para:150.1.2,150.1.2.2,demod:198,143,202,205] equal(implies(X,Y),implies(implies(implies(Y,X),X),Y)).
% 214 [para:205.1.1,144.1.1.1,demod:143] equal(implies(implies(implies(X,Y),Z),implies(Y,Z)),truth).
% 216 [para:155.1.1,212.1.2.1,demod:143] equal(implies(not(truth),not(not(truth))),not(not(truth))).
% 226 [para:146.1.1,214.1.1.1,demod:143] equal(implies(not(X),implies(X,Y)),truth).
% 227 [para:155.1.1,214.1.1.1,demod:143] equal(implies(not(truth),X),truth).
% 232 [para:205.1.1,214.1.1.1,demod:143] equal(implies(X,implies(Y,implies(Z,X))),truth).
% 234 [para:227.1.1,145.1.1.1,demod:143] equal(X,implies(implies(X,not(truth)),not(truth))).
% 236 [para:227.1.1,216.1.1] equal(truth,not(not(truth))).
% 248 [para:234.1.2,146.1.1.2,demod:143,236] equal(implies(not(implies(X,not(truth))),X),truth).
% 252 [para:248.1.1,146.1.1.1,demod:143] equal(implies(X,implies(not(X),not(truth))),truth).
% 253 [para:252.1.1,145.1.1.1,demod:155,143] equal(implies(not(X),not(truth)),X).
% 254 [para:253.1.1,145.1.1.1,demod:143,227] equal(implies(X,not(truth)),not(X)).
% 257 [para:253.1.1,144.1.1.2.1,demod:254] equal(implies(implies(X,not(Y)),implies(Y,not(X))),truth).
% 258 [para:253.1.1,144.1.1.2.2,demod:254] equal(implies(implies(not(X),Y),implies(not(Y),X)),truth).
% 260 [para:254.1.1,145.1.1,demod:143,227,254] equal(not(not(X)),X).
% 261 [para:254.1.1,144.1.1.2.1,demod:254] equal(implies(implies(X,Y),implies(not(Y),not(X))),truth).
% 264 [para:156.1.2,150.1.2.2,demod:198,143,202,261] equal(implies(not(X),not(Y)),implies(Y,X)).
% 265 [para:260.1.1,156.1.2.1.2.1,demod:143,260,257] equal(implies(X,not(Y)),implies(Y,not(X))).
% 266 [para:260.1.1,156.1.2.1.2.2,demod:143,260,258] equal(implies(not(X),Y),implies(not(Y),X)).
% 273 [para:264.1.1,145.1.1.1,demod:264] equal(implies(implies(X,Y),not(X)),implies(implies(Y,X),not(Y))).
% 277 [para:264.1.1,166.1.1.2.1] equal(implies(not(X),implies(implies(Y,X),not(Y))),truth).
% 278 [para:264.1.1,150.1.2.1.2,demod:143,226,264] equal(implies(implies(implies(X,Y),not(X)),not(Y)),implies(Y,X)).
% 302 [para:266.1.1,226.1.1] equal(implies(not(implies(X,Y)),X),truth).
% 376 [para:265.1.1,277.1.1.2] equal(implies(not(X),implies(Y,not(implies(Y,X)))),truth).
% 586 [para:145.1.1,273.1.1.1,demod:143,205] equal(implies(implies(implies(X,Y),Y),not(implies(Y,X))),not(X)).
% 664 [para:265.1.1,278.1.1.1] equal(implies(implies(X,not(implies(X,Y))),not(Y)),implies(Y,X)).
% 699 [para:376.1.1,586.1.1.1.1,demod:260,664,143] equal(implies(implies(X,not(implies(X,Y))),not(implies(Y,X))),Y).
% 788 [para:699.1.1,169.1.1.2.2,demod:264,143,302] equal(implies(X,implies(implies(implies(Y,X),implies(X,Y)),Y)),truth).
% 998 [para:788.1.1,170.1.1.1,demod:143,232,slowcut:154] 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: 336
% derived clauses: 119448
% kept clauses: 978
% kept size sum: 14925
% kept mid-nuclei: 0
% kept new demods: 837
% forw unit-subs: 82380
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 27
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.18
% process. runtime: 1.16
% 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-2+eq_r.in")
%
%------------------------------------------------------------------------------