%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET008-1 : TPTP v3.4.2. Released v1.0.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 0.0s
% Output   : Assurance 0.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/SET008-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(21,40,0,42,0,0)
% 
% 
% START OF PROOF
% 31 [] member(h(X,Y,Z),X) | member(h(X,Y,Z),Z) | intersection(X,Y,Z).
% 32 [] member(h(X,Y,Z),Y) | member(h(X,Y,Z),Z) | intersection(X,Y,Z).
% 35 [] -difference(X,Y,Z) | -member(U,Z) | -member(U,Y).
% 40 [] difference(b,a,b^da).
% 41 [] -intersection(a,b^da,a^i_b^da).
% 42 [] -member(X,a^i_b^da).
% 380 [hyper:41,31,cut:42] member(h(a,b^da,a^i_b^da),a).
% 911 [hyper:41,32,cut:42] member(h(a,b^da,a^i_b^da),b^da).
% 1390 [hyper:35,911,380,slowcut:40] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    37
%  derived clauses:   3129
%  kept clauses:      326
%  kept size sum:     5531
%  kept mid-nuclei:   794
%  kept new demods:   0
%  forw unit-subs:    408
%  forw double-subs: 586
%  forw overdouble-subs: 804
%  backward subs:     1
%  fast unit cutoff:  86
%  full unit cutoff:  1
%  dbl  unit cutoff:  19
%  real runtime  :  0.10
%  process. runtime:  0.9
% specific non-discr-tree subsumption statistics: 
%  tried:           22456
%  length fails:    3104
%  strength fails:  6058
%  predlist fails:  6077
%  aux str. fails:  22
%  by-lit fails:    39
%  full subs tried: 7154
%  full subs fail:  6293
% 
% ; 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/SET008-1+noeq.in")
% 
%------------------------------------------------------------------------------