%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL223-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art06.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 20.0s
% Output   : Assurance 20.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/LCL223-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 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(9,40,0,18,0,0,22992,4,2176,29161,1,2901,29161,50,2902,29161,40,2902,29170,0,2902)
% 
% 
% START OF PROOF
% 20533 [?] ?
% 29165 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 29168 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 29170 [] -theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))).
% 29195 [binary:29168,29165] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 29469 [binary:29170,29195.2,cut:20533] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 7
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7222
%  derived clauses:   89269
%  kept clauses:      14116
%  kept size sum:     262544
%  kept mid-nuclei:   15030
%  kept new demods:   0
%  forw unit-subs:    32097
%  forw double-subs: 38
%  forw overdouble-subs: 10
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  29.39
%  process. runtime:  29.4
% specific non-discr-tree subsumption statistics: 
%  tried:           33
%  length fails:    4
%  strength fails:  1
%  predlist fails:  0
%  aux str. fails:  2
%  by-lit fails:    0
%  full subs tried: 26
%  full subs fail:  16
% 
% ; 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/LCL223-1+noeq.in")
% 
%------------------------------------------------------------------------------