%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET241-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 : art05.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/SET241-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,364255,4,2105,365027,5,2803,365028,1,2806,365028,50,2812,365028,40,2812,365143,0,2812)
% 
% 
% START OF PROOF
% 365044 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 365050 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 365058 [] equal(intersection(cross_product(X,Y),Z),restrict(Z,X,Y)).
% 365142 [] member(ordered_pair(u,v),restrict(xr,x,y)).
% 365143 [] -member(v,y).
% 365256 [binary:365143,365044.2] -member(ordered_pair(X,v),cross_product(Y,y)).
% 365390 [binary:365256,365050.2,demod:365058,slowcut:365142] 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:    740
%  derived clauses:   486407
%  kept clauses:      77243
%  kept size sum:     1834
%  kept mid-nuclei:   8358
%  kept new demods:   80
%  forw unit-subs:    84842
%  forw double-subs: 10133
%  forw overdouble-subs: 321
%  backward subs:     16
%  fast unit cutoff:  59
%  full unit cutoff:  0
%  dbl  unit cutoff:  20
%  real runtime  :  28.12
%  process. runtime:  28.12
% specific non-discr-tree subsumption statistics: 
%  tried:           3428
%  length fails:    4
%  strength fails:  19
%  predlist fails:  2409
%  aux str. fails:  10
%  by-lit fails:    2
%  full subs tried: 974
%  full subs fail:  658
% 
% ; 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/SET241-6+eq_r.in")
% 
%------------------------------------------------------------------------------