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

% Computer : art02.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 0.0s
% Output   : Assurance 0.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/SET/SET061-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(93,40,2,186,0,2)
% 
% 
% START OF PROOF
% 95 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 98 [] subclass(X,universal_class).
% 100 [] -equal(X,Y) | subclass(Y,X).
% 118 [] -member(X,complement(Y)) | -member(X,Y).
% 160 [] member(regular(X),X) | equal(X,null_class).
% 186 [] member(z,null_class).
% 205 [hyper:95,186,98] member(z,universal_class).
% 19026 [hyper:100,160] member(regular(X),X) | subclass(null_class,X).
% 24484 [hyper:95,19026,186] member(regular(X),X) | member(z,X).
% 25466 [hyper:118,24484,205] member(regular(complement(universal_class)),complement(universal_class)).
% 26149 [hyper:95,25466,98] member(regular(complement(universal_class)),universal_class).
% 26454 [hyper:118,25466,cut:26149] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 6
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    214
%  derived clauses:   51234
%  kept clauses:      24074
%  kept size sum:     295095
%  kept mid-nuclei:   2152
%  kept new demods:   32
%  forw unit-subs:    22494
%  forw double-subs: 2374
%  forw overdouble-subs: 80
%  backward subs:     1
%  fast unit cutoff:  19
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  1.33
%  process. runtime:  1.33
% specific non-discr-tree subsumption statistics: 
%  tried:           265
%  length fails:    2
%  strength fails:  2
%  predlist fails:  129
%  aux str. fails:  4
%  by-lit fails:    0
%  full subs tried: 128
%  full subs fail:  48
% 
% ; 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/SET/SET061-6+eq_r.in")
% 
%------------------------------------------------------------------------------