%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL210-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 : 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 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/LCL210-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,22150,4,2106,25361,5,2806,25361,1,2806,25361,50,2806,25361,40,2806,25370,0,2806)
% 
% 
% START OF PROOF
% 2053 [?] ?
% 25364 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 25365 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 25368 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 25369 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 25370 [] -theorem(or(not(not(p)),or(not(or(p,q)),q))).
% 25393 [binary:25368,25365] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 25424 [binary:25364,25369.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 25519 [binary:25370,25393.2] -theorem(or(not(or(p,q)),or(not(not(p)),q))).
% 26044 [binary:25424.2,25519] -theorem(or(not(or(q,p)),or(not(not(p)),q))).
% 26349 [binary:25393.2,26044,cut:2053] 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 5
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7928
%  derived clauses:   839382
%  kept clauses:      11639
%  kept size sum:     223552
%  kept mid-nuclei:   14511
%  kept new demods:   0
%  forw unit-subs:    34507
%  forw double-subs: 235
%  forw overdouble-subs: 109
%  backward subs:     2
%  fast unit cutoff:  4
%  full unit cutoff:  2
%  dbl  unit cutoff:  0
%  real runtime  :  28.68
%  process. runtime:  28.13
% specific non-discr-tree subsumption statistics: 
%  tried:           387
%  length fails:    8
%  strength fails:  50
%  predlist fails:  42
%  aux str. fails:  35
%  by-lit fails:    6
%  full subs tried: 246
%  full subs fail:  137
% 
% ; 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/LCL210-1+noeq.in")
% 
%------------------------------------------------------------------------------