%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL080-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/LCL080-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(5,40,1,10,0,1,39,50,1,44,0,1)
%
%
% START OF PROOF
% 40 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 41 [] is_a_theorem(implies(X,implies(Y,X))).
% 42 [] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 43 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 44 [] -is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))).
% 60 [hyper:40,43,41] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 63 [hyper:40,43,43] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 71 [hyper:40,60,43] is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,Y)))).
% 104 [hyper:40,71,43] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(X,U))).
% 129 [hyper:40,63,42] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 133 [hyper:40,63,63] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 140 [hyper:40,129,43] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(X,implies(X,Y)),Z))).
% 141 [hyper:40,129,63] is_a_theorem(implies(implies(implies(X,Y),X),implies(implies(X,Y),Y))).
% 199 [hyper:40,141,60] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 208 [hyper:40,199,43] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 274 [hyper:40,208,63] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 275 [hyper:40,208,104] is_a_theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 280 [hyper:40,275,63] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(V,implies(implies(Z,X),U)))).
% 345 [hyper:40,274,42] is_a_theorem(implies(implies(X,implies(implies(Y,Z),Y)),implies(X,Y))).
% 359 [hyper:40,274,275] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(X,implies(Y,implies(U,Z))))).
% 449 [hyper:40,133,199] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 472 [hyper:40,140,43] is_a_theorem(implies(implies(X,implies(X,Y)),implies(implies(Y,Z),implies(X,Z)))).
% 966 [hyper:40,472,449] is_a_theorem(implies(implies(X,Y),implies(implies(Z,implies(Z,X)),implies(Z,Y)))).
% 1132 [hyper:40,280,345] is_a_theorem(implies(X,implies(implies(implies(Y,Z),U),implies(implies(U,Y),Y)))).
% 1230 [hyper:40,966,274] is_a_theorem(implies(implies(X,implies(X,implies(Y,Z))),implies(X,implies(implies(U,Y),implies(U,Z))))).
% 1239 [hyper:40,1132,slowcut:1230] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),X))).
% 1267 [hyper:40,1239,359,slowcut:44] 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: 254
% derived clauses: 45805
% kept clauses: 729
% kept size sum: 11720
% kept mid-nuclei: 518
% kept new demods: 0
% forw unit-subs: 20328
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 0
% full unit cutoff: 1
% dbl unit cutoff: 0
% real runtime : 0.27
% process. runtime: 0.27
% 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/LCL080-1+noeq.in")
%
%------------------------------------------------------------------------------