TSTP Solution File: LCL146-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL146-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 : art10.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/LCL146-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 3)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,1,20,0,1)
%
%
% START OF PROOF
% 12 [] equal(implies(truth,X),X).
% 13 [] equal(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),truth).
% 14 [] equal(implies(implies(X,Y),Y),implies(implies(Y,X),X)).
% 15 [] equal(implies(implies(not(X),not(Y)),implies(Y,X)),truth).
% 16 [] equal(big_^v(X,Y),implies(implies(X,Y),Y)).
% 17 [] equal(big_hat(X,Y),not(big_^v(not(X),not(Y)))).
% 18 [] equal(implies(X,Y),truth) | -ordered(X,Y).
% 19 [] -equal(implies(X,Y),truth) | ordered(X,Y).
% 20 [] -equal(not(big_hat(x,y)),big_^v(not(x),not(y))).
% 24 [para:12.1.1,16.1.2.1] equal(big_^v(truth,X),implies(X,X)).
% 32 [para:12.1.1,13.1.1.1,demod:16,12,binarydemod:19] ordered(X,big_^v(X,Y)).
% 36 [para:13.1.1,16.1.2.1,demod:12] equal(big_^v(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),implies(implies(Y,Z),implies(X,Z))).
% 39 [para:16.1.2,13.1.1.2.1] equal(implies(implies(X,implies(Y,Z)),implies(big_^v(Y,Z),implies(X,Z))),truth).
% 65 [para:24.1.1,32.1.2] ordered(truth,implies(X,X)).
% 66 [binary:18.2,65,demod:12] equal(implies(X,X),truth).
% 73 [para:12.1.1,14.1.1.1,demod:16,66] equal(truth,big_^v(X,truth)).
% 85 [para:73.1.2,32.1.2] ordered(X,truth).
% 86 [binary:18.2,85] equal(implies(X,truth),truth).
% 87 [para:86.1.1,13.1.1.1,demod:12] equal(implies(X,implies(Y,X)),truth).
% 90 [para:12.1.1,15.1.1.2] equal(implies(implies(not(X),not(truth)),X),truth).
% 104 [para:15.1.1,14.1.1.1,demod:16,12] equal(implies(X,Y),big_^v(implies(X,Y),implies(not(Y),not(X)))).
% 131 [para:87.1.1,13.1.1.1,demod:12,binarydemod:19] ordered(implies(implies(X,Y),Z),implies(Y,Z)).
% 181 [para:15.1.1,131.1.1] ordered(truth,implies(not(X),implies(X,Y))).
% 186 [binary:18.2,181,demod:12] equal(implies(not(X),implies(X,Y)),truth).
% 187 [binary:18.2,181,demod:12,binarydemod:19] ordered(not(X),implies(X,Y)).
% 193 [para:12.1.1,187.1.2] ordered(not(truth),X).
% 199 [binary:18.2,193] equal(implies(not(truth),X),truth).
% 203 [para:199.1.1,14.1.1.1,demod:16,12] equal(X,big_^v(X,not(truth))).
% 335 [para:186.1.1,39.1.1.1,demod:12,binarydemod:19] ordered(big_^v(X,Y),implies(not(X),Y)).
% 343 [para:203.1.2,335.1.1] ordered(X,implies(not(X),not(truth))).
% 345 [binary:18.2,343] equal(implies(X,implies(not(X),not(truth))),truth).
% 1106 [para:90.1.1,14.1.1.1,demod:345,12] equal(X,implies(not(X),not(truth))).
% 1118 [para:1106.1.2,16.1.2.1,demod:203] equal(not(X),implies(X,not(truth))).
% 1119 [para:17.1.2,1106.1.2.1,demod:1118] equal(big_^v(not(X),not(Y)),not(big_hat(X,Y))).
% 1179 [para:1118.1.2,36.1.1.2.1,demod:104,1118] equal(implies(X,Y),implies(not(Y),not(X))).
% 1871 [para:1179.1.2,16.1.2.1,demod:1119] equal(not(big_hat(X,Y)),implies(implies(Y,X),not(Y))).
% 1878 [para:1179.1.2,14.1.1.1,demod:1179,1871] equal(not(big_hat(X,Y)),not(big_hat(Y,X))).
% 2653 [para:1878.1.1,20.1.1,demod:1119,cut:1878] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 363
% derived clauses: 32515
% kept clauses: 2630
% kept size sum: 36785
% kept mid-nuclei: 0
% kept new demods: 1093
% forw unit-subs: 29882
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 43
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.37
% process. runtime: 0.37
% 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/LCL146-1+eq_r.in")
%
%------------------------------------------------------------------------------