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

% Computer : art07.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/LCL238-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,21768,4,2177)
% 
% 
% START OF PROOF
% 10 [] axiom(or(not(or(X,X)),X)).
% 11 [] axiom(or(not(X),or(Y,X))).
% 12 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 15 [] -axiom(X) | theorem(X).
% 16 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 17 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 18 [] -theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))).
% 20 [hyper:15,10] theorem(or(not(or(X,X)),X)).
% 30 [hyper:17,20,11] theorem(or(not(X),X)).
% 43 [hyper:16,12,30] theorem(or(X,not(X))).
% 53 [hyper:17,43,12] theorem(or(not(or(X,Y)),not(not(or(Y,X))))).
% 21769 [binary:17.3,18] -axiom(or(not(not(or(not(p),not(q)))),X)) | -theorem(or(not(X),not(or(not(q),not(p))))).
% 21772 [binary:17.3,21769.2] -axiom(or(not(not(or(not(p),not(q)))),X)) | -theorem(or(not(Y),not(or(not(q),not(p))))) | -axiom(or(not(X),Y)).
% 21796 [binary:10,21772.3] -axiom(or(not(not(or(not(p),not(q)))),or(X,X))) | -theorem(or(not(X),not(or(not(q),not(p))))).
% 21808 [binary:16.3,21796.2] -axiom(or(not(X),or(not(Y),not(or(not(q),not(p)))))) | -axiom(or(not(not(or(not(p),not(q)))),or(Y,Y))) | -theorem(X).
% 22346 [binary:12,21808] -axiom(or(not(not(or(not(p),not(q)))),or(X,X))) | -theorem(or(not(or(not(q),not(p))),not(X))).
% 22347 [binary:11,22346,cut:53] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 6
% seconds given: 29
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    6948
%  derived clauses:   151587
%  kept clauses:      8594
%  kept size sum:     181862
%  kept mid-nuclei:   13691
%  kept new demods:   0
%  forw unit-subs:    31410
%  forw double-subs: 57
%  forw overdouble-subs: 48
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  8
%  dbl  unit cutoff:  0
%  real runtime  :  22.71
%  process. runtime:  22.69
% specific non-discr-tree subsumption statistics: 
%  tried:           607
%  length fails:    21
%  strength fails:  167
%  predlist fails:  167
%  aux str. fails:  0
%  by-lit fails:    1
%  full subs tried: 249
%  full subs fail:  201
% 
% ; 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/LCL238-1+noeq.in")
% 
%------------------------------------------------------------------------------