%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET167-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 40.0s
% Output   : Assurance 40.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/SET167-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(115,40,1,230,0,1,539620,4,2107,540254,5,2803,540255,1,2806,540255,50,2812,540255,40,2812,540370,0,2812)
% 
% 
% START OF PROOF
% 540257 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 540260 [] subclass(X,universal_class).
% 540277 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 540280 [] -member(X,complement(Y)) | -member(X,Y).
% 540281 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 540282 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 540369 [] member(x,y).
% 540370 [] -member(x,union(y,z)).
% 540383 [binary:540369,540257] -subclass(y,X) | member(x,X).
% 540399 [binary:540260,540383] member(x,universal_class).
% 540564 [binary:540369,540280.2] -member(x,complement(y)).
% 540624 [binary:540564,540277.2] -member(x,intersection(complement(y),X)).
% 541081 [binary:540281.3,540624,cut:540399] member(x,complement(intersection(complement(y),X))).
% 563032 [para:540282.1.1,541081.1.2,slowcut:540370] 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 9
% clause depth limited to 6
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1957
%  derived clauses:   680783
%  kept clauses:      99425
%  kept size sum:     245216
%  kept mid-nuclei:   8815
%  kept new demods:   123
%  forw unit-subs:    103158
%  forw double-subs: 13103
%  forw overdouble-subs: 464
%  backward subs:     41
%  fast unit cutoff:  281
%  full unit cutoff:  1
%  dbl  unit cutoff:  22
%  real runtime  :  41.42
%  process. runtime:  41.42
% specific non-discr-tree subsumption statistics: 
%  tried:           17631
%  length fails:    1336
%  strength fails:  30
%  predlist fails:  11666
%  aux str. fails:  107
%  by-lit fails:    3
%  full subs tried: 4441
%  full subs fail:  3983
% 
% ; 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/SET167-6+eq_r.in")
% 
%------------------------------------------------------------------------------