%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : NUM190-1 : 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 : art03.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/NUM/NUM190-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(160,40,3,320,0,3)
% 
% 
% START OF PROOF
% 162 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 165 [] subclass(X,universal_class).
% 167 [] -equal(X,Y) | subclass(Y,X).
% 185 [] -member(X,complement(Y)) | -member(X,Y).
% 208 [] member(null_class,X) | -inductive(X).
% 211 [] inductive(omega).
% 213 [] member(omega,universal_class).
% 227 [] member(regular(X),X) | equal(X,null_class).
% 320 [] equal(omega,null_class).
% 364 [para:320.1.1,211.1.1] inductive(null_class).
% 365 [hyper:208,364] member(null_class,null_class).
% 391 [para:320.1.1,213.1.1] member(null_class,universal_class).
% 23869 [hyper:167,227] member(regular(X),X) | subclass(null_class,X).
% 34710 [hyper:162,23869,365] member(regular(X),X) | member(null_class,X).
% 38248 [hyper:185,34710,391] member(regular(complement(universal_class)),complement(universal_class)).
% 39606 [hyper:162,38248,165] member(regular(complement(universal_class)),universal_class).
% 39995 [hyper:185,38248,cut:39606] 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: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    339
%  derived clauses:   97901
%  kept clauses:      34479
%  kept size sum:     424870
%  kept mid-nuclei:   5117
%  kept new demods:   75
%  forw unit-subs:    53451
%  forw double-subs: 4557
%  forw overdouble-subs: 156
%  backward subs:     36
%  fast unit cutoff:  174
%  full unit cutoff:  8
%  dbl  unit cutoff:  1
%  real runtime  :  4.36
%  process. runtime:  4.34
% specific non-discr-tree subsumption statistics: 
%  tried:           1410
%  length fails:    6
%  strength fails:  355
%  predlist fails:  248
%  aux str. fails:  65
%  by-lit fails:    226
%  full subs tried: 433
%  full subs fail:  278
% 
% ; 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/NUM/NUM190-1+eq_r.in")
% 
%------------------------------------------------------------------------------