%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET019-4 : 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 : art05.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/SET019-4+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 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (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(145,40,2,290,0,2,264734,4,2501)
% 
% 
% START OF PROOF
% 149 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 150 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 213 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 288 [] subset(b,a).
% 289 [] subset(a,b).
% 290 [] -equal(a,b).
% 4071 [hyper:213,149,288,factor:cut:290] member(f1(a,b),a).
% 4078 [hyper:213,149,289,factor:cut:290] member(f1(a,b),b).
% 279873 [binary:150.3,290,cut:4071,cut:4078] 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 15
% clause depth limited to 4
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    151
%  derived clauses:   1543251
%  kept clauses:      77013
%  kept size sum:     0
%  kept mid-nuclei:   42577
%  kept new demods:   12
%  forw unit-subs:    11504
%  forw double-subs: 108676
%  forw overdouble-subs: 119706
%  backward subs:     4
%  fast unit cutoff:  4451
%  full unit cutoff:  79
%  dbl  unit cutoff:  3
%  real runtime  :  27.31
%  process. runtime:  27.28
% specific non-discr-tree subsumption statistics: 
%  tried:           2687667
%  length fails:    193368
%  strength fails:  893311
%  predlist fails:  899395
%  aux str. fails:  6874
%  by-lit fails:    44155
%  full subs tried: 611151
%  full subs fail:  503074
% 
% ; 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/SET019-4+eq_r.in")
% 
%------------------------------------------------------------------------------