%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET012-1 : 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 : art10.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/SET012-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 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 16 #f 3 5)
% (binary 54 #t 3 5)
% (binary-order 27 #f 3 5)
% (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(22,40,0,44,0,0)
% 
% 
% START OF PROOF
% 25 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 26 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 27 [] member(X,complement(Y)) | member(X,Y).
% 28 [] -member(X,complement(Y)) | -member(X,Y).
% 37 [] -subset(Y,X) | -subset(X,Y) | equal_sets(Y,X).
% 44 [] -equal_sets(complement(complement(a)),a).
% 56 [hyper:26,27] member(member_of_1_not_of_2(X,Y),complement(Y)) | subset(X,Y).
% 92 [hyper:28,25,27] member(member_of_1_not_of_2(X,Y),complement(complement(X))) | subset(X,Y).
% 317 [hyper:28,56,25] subset(complement(complement(X)),X).
% 5880 [hyper:26,92] subset(X,complement(complement(X))).
% 6134 [hyper:37,5880,cut:317,slowcut:44] 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 5
% clause depth limited to 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    121
%  derived clauses:   21577
%  kept clauses:      3298
%  kept size sum:     62372
%  kept mid-nuclei:   726
%  kept new demods:   0
%  forw unit-subs:    2768
%  forw double-subs: 1916
%  forw overdouble-subs: 4489
%  backward subs:     5
%  fast unit cutoff:  40
%  full unit cutoff:  15
%  dbl  unit cutoff:  342
%  real runtime  :  0.59
%  process. runtime:  0.57
% specific non-discr-tree subsumption statistics: 
%  tried:           94833
%  length fails:    8181
%  strength fails:  24013
%  predlist fails:  7066
%  aux str. fails:  895
%  by-lit fails:    1895
%  full subs tried: 52181
%  full subs fail:  47579
% 
% ; 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/SET012-1+noeq.in")
% 
%------------------------------------------------------------------------------