%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET411-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 : art08.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.9s
% Output   : Assurance 19.9s
% 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/SET411-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,2,230,0,2,381432,4,2106,387430,5,2803,387431,1,2806,387431,50,2812,387431,40,2812,387546,0,2812)
% 
% 
% START OF PROOF
% 387433 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 387436 [] subclass(X,universal_class).
% 387451 [] -member(ordered_pair(X,Y),element_relation) | member(X,Y).
% 387454 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 387536 [] equal(intersection(complement(compose(element_relation,complement(identity_relation))),element_relation),singleton_relation).
% 387545 [] member(ordered_pair(x,y),singleton_relation).
% 387546 [] -member(x,universal_class).
% 387559 [binary:387546,387433.3,cut:387436] -member(x,X).
% 387751 [binary:387559,387451.2] -member(ordered_pair(x,X),element_relation).
% 390370 [para:387536.1.1,387454.1.2] -member(X,singleton_relation) | member(X,element_relation).
% 390423 [binary:387545,390370,cut:387751] 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:    1103
%  derived clauses:   515060
%  kept clauses:      79796
%  kept size sum:     28329
%  kept mid-nuclei:   8498
%  kept new demods:   108
%  forw unit-subs:    85866
%  forw double-subs: 10493
%  forw overdouble-subs: 337
%  backward subs:     33
%  fast unit cutoff:  120
%  full unit cutoff:  0
%  dbl  unit cutoff:  28
%  real runtime  :  28.74
%  process. runtime:  28.28
% specific non-discr-tree subsumption statistics: 
%  tried:           3707
%  length fails:    10
%  strength fails:  21
%  predlist fails:  2578
%  aux str. fails:  12
%  by-lit fails:    2
%  full subs tried: 1074
%  full subs fail:  742
% 
% ; 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/SET411-6+eq_r.in")
% 
%------------------------------------------------------------------------------