%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL191-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 : art04.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 39.6s
% Output   : Assurance 39.6s
% 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/LCL191-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(9,40,1,18,0,1,836,50,5,845,0,5,22279,4,2106,25690,5,2808,25690,1,2808,25690,50,2809,25690,40,2809,25699,0,2809,31020,3,3360,32265,4,3635,32695,1,3910,32695,50,3910,32695,40,3910,32704,0,3910)
% 
% 
% START OF PROOF
% 13505 [?] ?
% 32696 [] axiom(or(not(or(X,X)),X)).
% 32697 [] axiom(or(not(X),or(Y,X))).
% 32698 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 32699 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 32702 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 32704 [] -theorem(or(not(or(p,or(q,r))),or(or(p,q),r))).
% 32712 [binary:32696,32702] -theorem(or(X,X)) | theorem(X).
% 32713 [binary:32697,32702] theorem(or(X,Y)) | -theorem(Y).
% 32715 [binary:32698,32702] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 32737 [binary:32702,32699] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 32917 [binary:32713.2,32715.2] theorem(or(X,or(Y,Z))) | -theorem(or(Z,Y)).
% 35818 [binary:32737,32917] theorem(or(X,or(Y,Z))) | -theorem(or(Z,X)).
% 38252 [binary:32712,35818] -theorem(or(X,or(Y,X))) | theorem(or(Y,X)).
% 42459 [binary:32737.2,38252] -theorem(or(X,or(Y,Y))) | theorem(or(X,Y)).
% 42957 [binary:32704,42459.2,cut:13505] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double 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 5
% seconds given: 17
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    13213
%  derived clauses:   1413547
%  kept clauses:      27403
%  kept size sum:     472865
%  kept mid-nuclei:   14488
%  kept new demods:   0
%  forw unit-subs:    59625
%  forw double-subs: 7270
%  forw overdouble-subs: 1787
%  backward subs:     2
%  fast unit cutoff:  3
%  full unit cutoff:  3
%  dbl  unit cutoff:  0
%  real runtime  :  40.94
%  process. runtime:  40.41
% specific non-discr-tree subsumption statistics: 
%  tried:           27773
%  length fails:    1368
%  strength fails:  109
%  predlist fails:  11763
%  aux str. fails:  116
%  by-lit fails:    25
%  full subs tried: 13677
%  full subs fail:  11890
% 
% ; 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/LCL191-1+noeq.in")
% 
%------------------------------------------------------------------------------