%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL182-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 : art09.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/LCL182-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,0,18,0,0,836,50,4,845,0,4,22183,4,2105)
% 
% 
% START OF PROOF
% 837 [] axiom(or(not(or(X,X)),X)).
% 838 [] axiom(or(not(X),or(Y,X))).
% 839 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 840 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 841 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 842 [] -axiom(X) | theorem(X).
% 843 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 844 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 845 [] -theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))).
% 847 [hyper:842,837] theorem(or(not(or(X,X)),X)).
% 914 [hyper:843,841,847] theorem(or(not(or(X,or(Y,Y))),or(X,Y))).
% 1210 [hyper:844,914,841] theorem(or(not(or(not(X),Y)),or(not(or(Y,X)),Y))).
% 1729 [hyper:844,1210,839] theorem(or(not(or(X,not(Y))),or(not(or(X,Y)),X))).
% 2053 [hyper:844,1729,838] theorem(or(not(not(X)),or(not(or(Y,X)),Y))).
% 22227 [binary:843.3,845] -axiom(or(not(X),or(not(or(not(p),q)),or(not(not(q)),not(p))))) | -theorem(X).
% 22228 [binary:840,22227,cut:2053] 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:    6992
%  derived clauses:   84993
%  kept clauses:      8305
%  kept size sum:     169496
%  kept mid-nuclei:   13889
%  kept new demods:   0
%  forw unit-subs:    31771
%  forw double-subs: 4
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  21.62
%  process. runtime:  21.8
% 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/LCL182-1+noeq.in")
% 
%------------------------------------------------------------------------------