%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL064-2 : 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 : art08.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/LCL064-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,40,50,0,44,0,0)
% 
% 
% START OF PROOF
% 41 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 42 [] is_a_theorem(implies(X,implies(Y,X))).
% 43 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))).
% 44 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 46 [hyper:41,42,42] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 57 [hyper:41,43,43] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(X,Y)),implies(implies(X,implies(Y,Z)),implies(X,Z)))).
% 59 [hyper:41,43,42] is_a_theorem(implies(X,implies(implies(Y,implies(Z,U)),implies(implies(Y,Z),implies(Y,U))))).
% 87 [hyper:41,57,46] is_a_theorem(implies(implies(X,implies(implies(Y,X),Z)),implies(X,Z))).
% 141 [hyper:41,87,59] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 183 [hyper:41,141,43] is_a_theorem(implies(implies(implies(X,Y),implies(Z,X)),implies(implies(X,Y),implies(Z,Y)))).
% 497 [hyper:41,183,46] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 532 [hyper:41,497,183,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:    119
%  derived clauses:   8963
%  kept clauses:      281
%  kept size sum:     4310
%  kept mid-nuclei:   233
%  kept new demods:   0
%  forw unit-subs:    3715
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     6
%  fast unit cutoff:  0
%  full unit cutoff:  2
%  dbl  unit cutoff:  0
%  real runtime  :  0.6
%  process. runtime:  0.5
% 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/LCL064-2+noeq.in")
% 
%------------------------------------------------------------------------------