TSTP Solution File: LCL006-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL006-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 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/LCL006-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 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(4,40,0,8,0,0,18,50,0,22,0,0)
%
%
% START OF PROOF
% 19 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 20 [] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 21 [] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(X,equivalent(Y,Z)))).
% 22 [] -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))).
% 29 [hyper:19,21,20] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,X)))).
% 30 [hyper:19,21,21] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(X,equivalent(Y,Z))))).
% 32 [hyper:19,21,20] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,Y),Z))).
% 36 [hyper:19,29,20] is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(Z,Y))))).
% 38 [hyper:19,29,20] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),Y)).
% 42 [hyper:19,38,29] is_a_theorem(equivalent(X,X)).
% 44 [hyper:19,38,21] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))).
% 49 [hyper:19,42,29] is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))).
% 55 [hyper:19,44,20] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),X)).
% 70 [hyper:19,49,42] is_a_theorem(equivalent(equivalent(X,X),equivalent(Y,Y))).
% 85 [hyper:19,30,20] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),X)))).
% 86 [hyper:19,30,38] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Y,Z)),equivalent(Z,X)))).
% 92 [hyper:19,55,30] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,Z),Z),equivalent(Y,X)))).
% 136 [hyper:19,32,21] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),X),equivalent(Y,Z))).
% 173 [hyper:19,36,70] is_a_theorem(equivalent(equivalent(equivalent(X,X),equivalent(Y,Y)),equivalent(equivalent(Z,U),equivalent(U,Z)))).
% 225 [hyper:19,92,42] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),equivalent(X,equivalent(Z,Z)))).
% 383 [hyper:19,225,21] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,equivalent(X,equivalent(Z,Z))))).
% 539 [hyper:19,383,21] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,U)))).
% 768 [hyper:19,173,32] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,X),equivalent(Y,Y)),equivalent(Z,U)),equivalent(U,Z))).
% 1087 [hyper:19,539,85] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,Y),X)),equivalent(U,U))).
% 1245 [hyper:19,768,85] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),equivalent(U,U))),equivalent(Y,X))).
% 1429 [hyper:19,1245,1087] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Z,equivalent(Y,X)))).
% 1432 [hyper:19,1429,21] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(X,Y)))).
% 1436 [hyper:19,1429,30] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,X))),equivalent(Z,Y))).
% 1437 [hyper:19,1429,32] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(Y,Z),X))).
% 1445 [hyper:19,1429,136] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,X),Y)))).
% 1540 [hyper:19,1429,1429] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(Z,Y)))).
% 1563 [hyper:19,1432,86] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,equivalent(Z,equivalent(Z,X))))).
% 1624 [hyper:19,1432,20] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,equivalent(Z,X)))).
% 1747 [hyper:19,1437,20] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(Z,X),Y))).
% 1995 [hyper:19,1540,1429] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(Y,X),Z))).
% 2080 [hyper:19,1563,29] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),equivalent(Z,equivalent(Z,Y)))).
% 2740 [hyper:19,1624,1432] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(Z,X)),Z))).
% 2865 [hyper:19,1747,1436] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(X,Z)))).
% 2966 [hyper:19,1995,1445] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X)))).
% 3026 [hyper:19,2080,32] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(X,Y)),Z),equivalent(Z,Y))).
% 3293 [hyper:19,2865,1436] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(Y,X)))).
% 3541 [hyper:19,3026,2740] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,X)),Z),Y)).
% 4136 [hyper:19,3293,2966] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(X,equivalent(Z,Y)))).
% 4290 [hyper:19,4136,3541,slowcut:22] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation 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 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 783
% derived clauses: 347298
% kept clauses: 3071
% kept size sum: 52792
% kept mid-nuclei: 1203
% kept new demods: 0
% forw unit-subs: 159498
% 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 : 2.42
% process. runtime: 2.39
% 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/LCL006-1+noeq.in")
%
%------------------------------------------------------------------------------