%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL069-1 : 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 : art01.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/LCL069-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(5,40,1,10,0,1)
% 
% 
% START OF PROOF
% 6 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 7 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 8 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 9 [] is_a_theorem(implies(implies(not(X),Y),implies(implies(Z,Y),implies(implies(X,Z),Y)))).
% 10 [] -is_a_theorem(implies(a,implies(not(a),b))).
% 13 [hyper:6,7,7] is_a_theorem(implies(X,implies(Y,X))).
% 29 [hyper:6,8,13] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 60 [hyper:6,9,29] is_a_theorem(implies(implies(X,implies(Y,implies(Z,U))),implies(implies(Z,X),implies(Y,implies(Z,U))))).
% 110 [hyper:6,60,13] is_a_theorem(implies(implies(X,implies(X,Y)),implies(Z,implies(X,Y)))).
% 131 [hyper:6,110,13] is_a_theorem(implies(X,implies(Y,Y))).
% 140 [hyper:6,110,60] is_a_theorem(implies(implies(X,implies(X,implies(X,Y))),implies(Z,implies(X,Y)))).
% 144 [hyper:6,131,slowcut:140] is_a_theorem(implies(X,X)).
% 150 [hyper:6,144,8] is_a_theorem(implies(not(X),implies(X,Y))).
% 163 [hyper:6,150,60] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 278 [hyper:6,163,144,slowcut:10] 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:    69
%  derived clauses:   1851
%  kept clauses:      127
%  kept size sum:     1559
%  kept mid-nuclei:   133
%  kept new demods:   0
%  forw unit-subs:    1005
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  5
%  dbl  unit cutoff:  0
%  real runtime  :  0.3
%  process. runtime:  0.2
% 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/LCL069-1+noeq.in")
% 
%------------------------------------------------------------------------------