%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL205-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 : 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 19.5s
% Output   : Assurance 19.5s
% 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/LCL205-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 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(9,40,1,18,0,1,21760,4,2177,25040,5,2902,25040,1,2902,25040,50,2902,25040,40,2902,25049,0,2902)
% 
% 
% START OF PROOF
% 25041 [] axiom(or(not(or(X,X)),X)).
% 25042 [] axiom(or(not(X),or(Y,X))).
% 25043 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 25044 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 25046 [] -axiom(X) | theorem(X).
% 25047 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 25048 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 25049 [] -theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))).
% 25052 [binary:25046,25042] theorem(or(not(X),or(Y,X))).
% 25056 [binary:25041,25047] -theorem(or(X,X)) | theorem(X).
% 25057 [binary:25042,25047] theorem(or(X,Y)) | -theorem(Y).
% 25059 [binary:25052,25047.2] -axiom(or(not(or(not(X),or(Y,X))),Z)) | theorem(Z).
% 25060 [binary:25043,25047] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 25073 [binary:25047,25044] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 25097 [binary:25042,25048.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(Y),Z)).
% 25176 [binary:25044,25059] theorem(or(X,or(not(Y),Y))).
% 25185 [binary:25056,25176] theorem(or(not(X),X)).
% 25193 [binary:25060,25185] theorem(or(X,not(X))).
% 25575 [binary:25193,25097] theorem(or(not(X),not(not(or(Y,X))))).
% 25903 [binary:25060,25575] theorem(or(not(not(or(X,Y))),not(Y))).
% 26041 [binary:25057.2,25903] theorem(or(X,or(not(not(or(Y,Z))),not(Z)))).
% 28301 [binary:25073,26041,slowcut:25049] 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 6
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7820
%  derived clauses:   774688
%  kept clauses:      13777
%  kept size sum:     266484
%  kept mid-nuclei:   14265
%  kept new demods:   0
%  forw unit-subs:    34922
%  forw double-subs: 332
%  forw overdouble-subs: 135
%  backward subs:     4
%  fast unit cutoff:  1
%  full unit cutoff:  4
%  dbl  unit cutoff:  0
%  real runtime  :  29.80
%  process. runtime:  29.29
% specific non-discr-tree subsumption statistics: 
%  tried:           1006
%  length fails:    41
%  strength fails:  254
%  predlist fails:  197
%  aux str. fails:  20
%  by-lit fails:    5
%  full subs tried: 476
%  full subs fail:  341
% 
% ; 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/LCL205-1+noeq.in")
% 
%------------------------------------------------------------------------------