%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL083-2 : TPTP v3.4.2. Bugfixed v1.2.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/LCL083-2+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,22,50,0,26,0,0,90,50,0,94,0,0)
%
%
% START OF PROOF
% 91 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 92 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))).
% 93 [] is_a_theorem(implies(X,X)).
% 94 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 98 [hyper:91,92,93] is_a_theorem(implies(implies(implies(X,Y),X),implies(Z,X))).
% 99 [hyper:91,92,92] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),implies(Y,U)),implies(V,implies(Y,U)))).
% 104 [hyper:91,98,98] is_a_theorem(implies(X,implies(Y,Y))).
% 106 [hyper:91,98,92] is_a_theorem(implies(implies(implies(X,Y),implies(Y,Z)),implies(U,implies(Y,Z)))).
% 110 [hyper:91,99,98] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 117 [hyper:91,104,92] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 120 [hyper:91,110,slowcut:117] is_a_theorem(implies(X,implies(Y,X))).
% 141 [hyper:91,106,92] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(U,Y)),implies(V,implies(U,Y)))).
% 147 [hyper:91,117,120] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),implies(U,Z)))).
% 199 [hyper:91,147,92] is_a_theorem(implies(implies(implies(implies(implies(X,X),Y),implies(Z,Y)),U),implies(V,U))).
% 211 [hyper:91,141,92] is_a_theorem(implies(X,implies(implies(implies(implies(Y,Z),U),Z),implies(Y,Z)))).
% 214 [hyper:91,141,120] is_a_theorem(implies(X,implies(implies(implies(Y,implies(Z,U)),implies(V,Z)),implies(W,implies(V,Z))))).
% 218 [hyper:91,211,slowcut:214] is_a_theorem(implies(implies(implies(implies(X,Y),Z),Y),implies(X,Y))).
% 221 [hyper:91,218,92] is_a_theorem(implies(implies(implies(X,Y),implies(implies(X,Y),Z)),implies(U,implies(implies(X,Y),Z)))).
% 299 [hyper:91,221,98] is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))).
% 313 [hyper:91,221,199] is_a_theorem(implies(X,implies(Y,implies(implies(implies(Z,Z),U),U)))).
% 317 [hyper:91,299,slowcut:94,slowcut:313] 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 6
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 97
% derived clauses: 3802
% kept clauses: 112
% kept size sum: 1580
% kept mid-nuclei: 177
% kept new demods: 0
% forw unit-subs: 2553
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 0
% full unit cutoff: 7
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.3
% 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/LCL083-2+noeq.in")
%
%------------------------------------------------------------------------------