%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET009-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 : 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 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/SET009-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(16,40,1,32,0,1)
% 
% 
% START OF PROOF
% 17 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 18 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 19 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 23 [] -difference(X,Y,Z) | -member(U,Z) | member(U,X).
% 24 [] -difference(X,Y,Z) | -member(U,Z) | -member(U,Y).
% 25 [] -difference(X,Y,Z) | -member(U,X) | member(U,Z) | member(U,Y).
% 29 [] subset(d,a).
% 30 [] difference(b,a,b^da).
% 31 [] difference(b,d,b^dd).
% 32 [] -subset(b^da,b^dd).
% 48 [hyper:32,18] member(member_of_1_not_of_2(b^da,b^dd),b^da).
% 79 [hyper:23,48,30] member(member_of_1_not_of_2(b^da,b^dd),b).
% 102 [hyper:25,79,31] member(member_of_1_not_of_2(b^da,b^dd),d) | member(member_of_1_not_of_2(b^da,b^dd),b^dd).
% 5360 [hyper:19,102,cut:32] member(member_of_1_not_of_2(b^da,b^dd),d).
% 5523 [hyper:17,5360,29] member(member_of_1_not_of_2(b^da,b^dd),a).
% 5662 [hyper:24,5523,48,slowcut:30] 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:    81
%  derived clauses:   17471
%  kept clauses:      1544
%  kept size sum:     24833
%  kept mid-nuclei:   3510
%  kept new demods:   0
%  forw unit-subs:    2464
%  forw double-subs: 4807
%  forw overdouble-subs: 4921
%  backward subs:     7
%  fast unit cutoff:  257
%  full unit cutoff:  21
%  dbl  unit cutoff:  39
%  real runtime  :  0.45
%  process. runtime:  0.45
% specific non-discr-tree subsumption statistics: 
%  tried:           157154
%  length fails:    33872
%  strength fails:  70543
%  predlist fails:  20196
%  aux str. fails:  596
%  by-lit fails:    311
%  full subs tried: 30727
%  full subs fail:  25998
% 
% ; 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/SET009-1+noeq.in")
% 
%------------------------------------------------------------------------------