TSTP Solution File: LCL127-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL127-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 : art02.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 20.0s
% Output : Assurance 20.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/LCL127-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 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,14,50,1,17,0,1,37326,4,2191)
%
%
% START OF PROOF
% 15 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 16 [] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(equivalent(Y,U),equivalent(Z,U))))).
% 17 [] -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 20 [hyper:15,16,16] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,U),equivalent(equivalent(equivalent(Y,V),equivalent(Z,V)),U)))).
% 25 [hyper:15,20,16] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(equivalent(equivalent(X,V),equivalent(equivalent(equivalent(Y,W),equivalent(Z,W)),V)),U))).
% 31 [hyper:15,25,16] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,U),equivalent(V,U)),Y)),equivalent(X,equivalent(equivalent(Z,W),equivalent(V,W))))).
% 32 [hyper:15,25,20] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,U),equivalent(V,U)),Y)),equivalent(equivalent(X,W),equivalent(equivalent(equivalent(Z,X1),equivalent(V,X1)),W)))).
% 46 [hyper:15,32,31] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))).
% 50 [hyper:15,46,32] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z))).
% 54 [hyper:15,46,25] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(U,V),equivalent(Y,V)),Z)),equivalent(equivalent(X,W),equivalent(U,W)))).
% 59 [hyper:15,50,16] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,Y),U),equivalent(Z,U)))).
% 60 [hyper:15,50,20] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(equivalent(equivalent(equivalent(X,Y),V),equivalent(Z,V)),U))).
% 65 [hyper:15,59,16] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(equivalent(X,equivalent(equivalent(Y,V),equivalent(Z,V))),U))).
% 104 [hyper:15,60,50] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,Z)),equivalent(equivalent(X,Y),U))).
% 116 [hyper:15,104,32] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 123 [hyper:15,116,16] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 124 [hyper:15,116,20] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))).
% 146 [hyper:15,124,116] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))).
% 157 [hyper:15,146,116] is_a_theorem(equivalent(X,X)).
% 159 [hyper:15,146,123] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),equivalent(equivalent(X,Z),U))).
% 179 [hyper:15,159,16] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(equivalent(Y,U),equivalent(Z,U))))).
% 190 [hyper:15,159,159] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,U),equivalent(Z,equivalent(U,Y))))).
% 214 [hyper:15,179,16] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,V),equivalent(Z,V))),W),equivalent(U,W)))).
% 304 [hyper:15,65,146] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,U),equivalent(Y,U))),equivalent(X,Z))).
% 305 [hyper:15,65,157] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),equivalent(X,equivalent(Y,U)))).
% 327 [hyper:15,304,16] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 349 [hyper:15,327,46] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Y)),Z),equivalent(X,Z))).
% 380 [hyper:15,349,157] is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))).
% 403 [hyper:15,54,327] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),Y)),U),equivalent(X,U))).
% 439 [hyper:15,380,46] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))).
% 1152 [hyper:15,305,16] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,Y)),equivalent(X,equivalent(U,Z)))).
% 1163 [hyper:15,305,439] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,Z))),equivalent(X,Y))).
% 1177 [hyper:15,305,159] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,Z)),equivalent(Y,U)))).
% 1913 [hyper:15,403,305] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)))).
% 9843 [hyper:15,1152,1163] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)).
% 9898 [hyper:15,9843,190] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(X,equivalent(U,equivalent(Z,Y))))).
% 10517 [hyper:15,1177,1913] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,U))),equivalent(equivalent(X,equivalent(U,Z)),Y))).
% 24373 [hyper:15,9898,25] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(equivalent(equivalent(V,W),equivalent(X1,W)),U)),equivalent(X,equivalent(equivalent(V,X1),equivalent(Z,Y))))).
% 26912 [hyper:15,10517,1152] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,Y)),equivalent(Z,U)),X)).
% 35826 [hyper:15,26912,214] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,Y)),equivalent(equivalent(Z,V),equivalent(U,V))),W),equivalent(X,W))).
% 37327 [binary:15.3,17] -is_a_theorem(equivalent(X,equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))) | -is_a_theorem(X).
% 37342 [binary:35826,37327,slowcut:24373] 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 7
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 527
% derived clauses: 318693
% kept clauses: 35628
% kept size sum: 934040
% kept mid-nuclei: 1695
% kept new demods: 0
% forw unit-subs: 199843
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 23
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 22.59
% process. runtime: 22.55
% 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/LCL127-1+noeq.in")
%
%------------------------------------------------------------------------------