TSTP Solution File: LCL121-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL121-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 : art05.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/LCL121-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,0,6,0,0,9,50,0,12,0,0)
%
%
% START OF PROOF
% 10 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 11 [] is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))))).
% 12 [] -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)))).
% 15 [hyper:10,11,11] is_a_theorem(equivalent(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U))))),equivalent(equivalent(V,W),equivalent(equivalent(V,X1),equivalent(W,X1))))).
% 19 [hyper:10,15,cut:11] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))).
% 22 [hyper:10,19,19] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))).
% 34 [hyper:10,22,19] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))).
% 44 [hyper:10,34,15] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),V),equivalent(equivalent(X,equivalent(Y,U)),V))).
% 45 [hyper:10,34,34] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z))).
% 56 [hyper:10,45,22] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,Z)),equivalent(equivalent(X,Y),U))).
% 59 [hyper:10,56,15] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),equivalent(X,equivalent(Y,U)))).
% 60 [hyper:10,56,34] is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))).
% 71 [hyper:10,60,22] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))).
% 78 [hyper:10,71,60] is_a_theorem(equivalent(X,X)).
% 81 [hyper:10,71,19] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),equivalent(equivalent(X,Z),U))).
% 92 [hyper:10,59,22] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,U))),equivalent(equivalent(X,U),Z))).
% 105 [hyper:10,81,59] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,Z)),equivalent(Y,U)))).
% 106 [hyper:10,81,81] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,U),equivalent(Z,equivalent(U,Y))))).
% 237 [hyper:10,105,34] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))).
% 290 [hyper:10,237,78] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 327 [hyper:10,290,22] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),Y)),X)).
% 328 [hyper:10,290,92] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),Z),X)).
% 1128 [hyper:10,106,328] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),U),equivalent(X,equivalent(U,Z)))).
% 1255 [hyper:10,44,327] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)).
% 1289 [hyper:10,1255,19] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),U),equivalent(X,U))).
% 13688 [hyper:10,1289,1128,slowcut:12] 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 7
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 324
% derived clauses: 119878
% kept clauses: 12632
% kept size sum: 310352
% kept mid-nuclei: 1043
% kept new demods: 0
% forw unit-subs: 85851
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 11
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 5.0
% process. runtime: 4.98
% 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/LCL121-1+noeq.in")
%
%------------------------------------------------------------------------------