%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET166-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 : art04.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 10.0s
% Output   : Assurance 10.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/SET166-6+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(116,40,1,232,0,1)
% 
% 
% START OF PROOF
% 118 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 121 [] subclass(X,universal_class).
% 140 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 141 [] -member(X,complement(Y)) | -member(X,Y).
% 142 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 143 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 230 [] member(x,union(y,z)).
% 231 [] -member(x,y).
% 232 [] -member(x,z).
% 257 [hyper:118,230,121] member(x,universal_class).
% 325 [hyper:142,257] member(x,complement(X)) | member(x,X).
% 26020 [hyper:231,325] member(x,complement(y)).
% 26021 [hyper:232,325] member(x,complement(z)).
% 27382 [hyper:140,26021,26020] member(x,intersection(complement(y),complement(z))).
% 202067 [hyper:141,27382,demod:143,cut:230] 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
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    484
%  derived clauses:   289679
%  kept clauses:      77005
%  kept size sum:     0
%  kept mid-nuclei:   5648
%  kept new demods:   54
%  forw unit-subs:    77064
%  forw double-subs: 10130
%  forw overdouble-subs: 394
%  backward subs:     1
%  fast unit cutoff:  39
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  10.40
%  process. runtime:  10.39
% specific non-discr-tree subsumption statistics: 
%  tried:           1071
%  length fails:    6
%  strength fails:  21
%  predlist fails:  396
%  aux str. fails:  11
%  by-lit fails:    3
%  full subs tried: 626
%  full subs fail:  238
% 
% ; 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/SET166-6+eq_r.in")
% 
%------------------------------------------------------------------------------