%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET235-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 : art07.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 20.0s
% Output   : Assurance 20.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/SET235-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,372356,4,2110,373174,5,2802,373175,1,2805,373175,50,2811,373175,40,2811,373291,0,2811)
% 
% 
% START OF PROOF
% 373177 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 373178 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 373193 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 373289 [] subclass(x,cross_product(universal_class,universal_class)).
% 373290 [] -member(ordered_pair(first(not_subclass_element(x,y)),second(not_subclass_element(x,y))),x).
% 373291 [] -subclass(x,y).
% 373304 [binary:373289,373177.2] member(X,cross_product(universal_class,universal_class)) | -member(X,x).
% 373314 [binary:373291,373178.2] member(not_subclass_element(x,y),x).
% 373343 [binary:373314,373304.2] member(not_subclass_element(x,y),cross_product(universal_class,universal_class)).
% 373480 [para:373193.1.1,373290.1.1,cut:373314,slowcut:373343] 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:    733
%  derived clauses:   480702
%  kept clauses:      77203
%  kept size sum:     1428
%  kept mid-nuclei:   8615
%  kept new demods:   80
%  forw unit-subs:    86434
%  forw double-subs: 10261
%  forw overdouble-subs: 333
%  backward subs:     8
%  fast unit cutoff:  175
%  full unit cutoff:  31
%  dbl  unit cutoff:  120
%  real runtime  :  28.12
%  process. runtime:  28.11
% specific non-discr-tree subsumption statistics: 
%  tried:           5774
%  length fails:    12
%  strength fails:  19
%  predlist fails:  3415
%  aux str. fails:  10
%  by-lit fails:    20
%  full subs tried: 2288
%  full subs fail:  1960
% 
% ; 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/SET235-6+eq_r.in")
% 
%------------------------------------------------------------------------------