TSTP Solution File: LCL015-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL015-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 : 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 19.7s
% Output : Assurance 19.7s
% 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/LCL015-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,9,50,1,12,0,1,17,50,1,20,0,2,31,50,2,34,0,2,58,50,2,61,0,2,45032,4,2113)
%
%
% START OF PROOF
% 59 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 60 [] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Y,Z),X)))).
% 61 [] -is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b)))).
% 64 [hyper:59,60,60] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(equivalent(Z,Y),U)),X),equivalent(U,Z)))).
% 69 [hyper:59,64,60] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,X),Z)),equivalent(equivalent(U,V),equivalent(W,equivalent(equivalent(V,W),U)))),equivalent(Z,Y))).
% 70 [hyper:59,64,64] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,X),Z)),equivalent(U,equivalent(equivalent(equivalent(V,equivalent(equivalent(W,V),X1)),U),equivalent(X1,W)))),equivalent(Z,Y))).
% 87 [hyper:59,70,60] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,equivalent(Z,X))),Z),Y)).
% 91 [hyper:59,87,60] is_a_theorem(equivalent(X,equivalent(equivalent(Y,X),equivalent(equivalent(Z,equivalent(Y,equivalent(U,Z))),U)))).
% 92 [hyper:59,87,64] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,X),Z)),equivalent(equivalent(equivalent(U,equivalent(V,equivalent(W,U))),W),V)),equivalent(Z,Y))).
% 97 [hyper:59,91,60] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,equivalent(equivalent(Z,U),Y)))),equivalent(equivalent(V,equivalent(X,equivalent(W,V))),W))).
% 118 [hyper:59,92,87] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(U,equivalent(equivalent(Z,U),Y))),equivalent(V,X))),V)).
% 128 [hyper:59,118,91] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(U,equivalent(equivalent(Z,U),Y)),X)))).
% 144 [hyper:59,128,60] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),equivalent(equivalent(U,equivalent(equivalent(Z,U),Y)),V)),X),V))).
% 160 [hyper:59,97,60] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,equivalent(Z,equivalent(U,Y))),U),Z),equivalent(V,X))),V)).
% 161 [hyper:59,97,128] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,equivalent(equivalent(Y,Z),U))),U),equivalent(V,X))),V)).
% 173 [hyper:59,160,91] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,equivalent(U,Y))),U),equivalent(Z,X)))).
% 191 [hyper:59,173,69] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,equivalent(Y,X)))),Z)).
% 200 [hyper:59,191,91] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(equivalent(Y,Z),Z),X)))).
% 227 [hyper:59,200,60] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(equivalent(equivalent(Y,Z),Z),U)),X),U))).
% 320 [hyper:59,161,64] is_a_theorem(equivalent(equivalent(X,equivalent(Y,X)),Y)).
% 324 [hyper:59,161,227] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))).
% 327 [hyper:59,320,64] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,X),Z)),equivalent(Z,Y))).
% 334 [hyper:59,320,227] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,Y),Y),Z)),Z)).
% 377 [hyper:59,324,320] is_a_theorem(equivalent(X,X)).
% 387 [hyper:59,377,60] is_a_theorem(equivalent(X,equivalent(equivalent(Y,X),Y))).
% 438 [hyper:59,387,60] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),Y),X),Z))).
% 725 [hyper:59,327,173] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(X,equivalent(Y,Z))))).
% 826 [hyper:59,334,128] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,X),equivalent(Z,Y))),Z)).
% 827 [hyper:59,334,200] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Y),Z),Z),X)).
% 1412 [hyper:59,438,320] is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),Y)).
% 9102 [hyper:59,826,1412] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 9305 [hyper:59,9102,725] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,X))),equivalent(Y,Z))).
% 9308 [hyper:59,9102,826] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(Z,Y),equivalent(X,Z))))).
% 9448 [hyper:59,827,9102] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(X,Y),Y),Z),Z))).
% 20216 [hyper:59,9305,144] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,equivalent(equivalent(Y,Z),X)),U)),equivalent(equivalent(V,equivalent(W,equivalent(X1,V))),equivalent(W,X1))),U)).
% 20862 [hyper:59,9308,327] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,X)),Y)).
% 44125 [hyper:59,20862,9448] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,X)),Y),U),U),V),V)).
% 45033 [binary:59.3,61] -is_a_theorem(equivalent(X,equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b))))) | -is_a_theorem(X).
% 45129 [binary:44125,45033,slowcut:20216] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 9
% seconds given: 29
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 407
% derived clauses: 163293
% kept clauses: 43088
% kept size sum: 0
% kept mid-nuclei: 1496
% kept new demods: 0
% forw unit-subs: 95551
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 26.31
% process. runtime: 25.81
% 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/LCL015-1+noeq.in")
%
%------------------------------------------------------------------------------