%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL065-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/LCL065-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,0,10,0,0,47,50,0,52,0,0)
% 
% 
% START OF PROOF
% 48 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 49 [] is_a_theorem(implies(X,implies(Y,X))).
% 50 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))).
% 51 [] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 52 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 54 [hyper:48,49,49] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 64 [hyper:48,51,49] is_a_theorem(implies(X,implies(implies(not(Y),not(Z)),implies(Z,Y)))).
% 68 [hyper:48,50,49] is_a_theorem(implies(implies(X,Y),implies(X,X))).
% 71 [hyper:48,50,50] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(X,Y)),implies(implies(X,implies(Y,Z)),implies(X,Z)))).
% 73 [hyper:48,50,49] is_a_theorem(implies(X,implies(implies(Y,implies(Z,U)),implies(implies(Y,Z),implies(Y,U))))).
% 77 [hyper:48,68,slowcut:73] is_a_theorem(implies(X,X)).
% 82 [hyper:48,77,49] is_a_theorem(implies(X,implies(Y,Y))).
% 134 [hyper:48,71,54] is_a_theorem(implies(implies(X,implies(implies(Y,X),Z)),implies(X,Z))).
% 135 [hyper:48,71,82] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 165 [hyper:48,134,64] is_a_theorem(implies(not(X),implies(X,Y))).
% 166 [hyper:48,134,73] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 171 [hyper:48,165,50] is_a_theorem(implies(implies(not(X),X),implies(not(X),Y))).
% 282 [hyper:48,166,51] is_a_theorem(implies(implies(X,implies(not(Y),not(Z))),implies(X,implies(Z,Y)))).
% 652 [hyper:48,282,171] is_a_theorem(implies(implies(not(X),X),implies(Y,X))).
% 665 [hyper:48,652,135,slowcut:52] 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:    182
%  derived clauses:   8992
%  kept clauses:      280
%  kept size sum:     3540
%  kept mid-nuclei:   350
%  kept new demods:   0
%  forw unit-subs:    3769
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     5
%  fast unit cutoff:  0
%  full unit cutoff:  16
%  dbl  unit cutoff:  0
%  real runtime  :  0.6
%  process. runtime:  0.6
% 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/LCL065-1+noeq.in")
% 
%------------------------------------------------------------------------------