%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET014-4 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.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 10.0s
% Output   : Assurance 10.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/SET014-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 4 5)
% (binary-unit 9 #f 4 5)
% (binary-double 9 #f 4 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 5)
% (binary-order 25 #f 4 5)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(19,40,1,38,0,1,51151,4,1983)
% 
% 
% START OF PROOF
% 28 [] -member(X,complement(Y)) | -member(X,Y).
% 30 [?] ?
% 87 [?] ?
% 49967 [?] ?
% 51203 [binary:49967,28.2,demod:30,cut:87] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 4
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    640
%  derived clauses:   221630
%  kept clauses:      39334
%  kept size sum:     841796
%  kept mid-nuclei:   4158
%  kept new demods:   59
%  forw unit-subs:    21807
%  forw double-subs: 69814
%  forw overdouble-subs: 67910
%  backward subs:     36
%  fast unit cutoff:  18578
%  full unit cutoff:  2463
%  dbl  unit cutoff:  570
%  real runtime  :  19.85
%  process. runtime:  19.82
% specific non-discr-tree subsumption statistics: 
%  tried:           8359516
%  length fails:    367429
%  strength fails:  1729004
%  predlist fails:  2834021
%  aux str. fails:  994083
%  by-lit fails:    159973
%  full subs tried: 2098490
%  full subs fail:  2029708
% 
% ; 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/SET014-4+eq_r.in")
% 
%------------------------------------------------------------------------------