%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET239-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 : art06.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/SET239-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,466609,4,2115,467149,5,2803,467150,1,2806,467150,50,2812,467150,40,2812,467265,0,2813)
% 
% 
% START OF PROOF
% 467172 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 467179 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 467264 [] member(z,restrict(xr,x,y)).
% 467265 [] -member(z,xr).
% 467503 [binary:467265,467172.2] -member(z,intersection(xr,X)).
% 467732 [para:467179.1.1,467503.1.2,slowcut:467264] 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:    770
%  derived clauses:   569289
%  kept clauses:      77453
%  kept size sum:     3617
%  kept mid-nuclei:   8478
%  kept new demods:   84
%  forw unit-subs:    87519
%  forw double-subs: 11251
%  forw overdouble-subs: 405
%  backward subs:     11
%  fast unit cutoff:  69
%  full unit cutoff:  96
%  dbl  unit cutoff:  0
%  real runtime  :  28.14
%  process. runtime:  28.13
% specific non-discr-tree subsumption statistics: 
%  tried:           3300
%  length fails:    6
%  strength fails:  25
%  predlist fails:  2243
%  aux str. fails:  11
%  by-lit fails:    3
%  full subs tried: 1000
%  full subs fail:  601
% 
% ; 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/SET239-6+eq_r.in")
% 
%------------------------------------------------------------------------------