%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET019-3 : 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-3+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(148,40,2,296,0,2,416059,4,2336)
% 
% 
% START OF PROOF
% 152 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 153 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 216 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 294 [] subset(b,a).
% 295 [] subset(a,b).
% 296 [] -equal(a,b).
% 13326 [hyper:216,152,294,factor:cut:296] member(f1(a,b),a).
% 13333 [hyper:216,152,295,factor:cut:296] member(f1(a,b),b).
% 465080 [binary:153.3,296,cut:13326,cut:13333] 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:    137
%  derived clauses:   1231225
%  kept clauses:      73646
%  kept size sum:     0
%  kept mid-nuclei:   51450
%  kept new demods:   11
%  forw unit-subs:    6792
%  forw double-subs: 5489
%  forw overdouble-subs: 21659
%  backward subs:     0
%  fast unit cutoff:  1573
%  full unit cutoff:  1904
%  dbl  unit cutoff:  0
%  real runtime  :  25.0
%  process. runtime:  24.99
% specific non-discr-tree subsumption statistics: 
%  tried:           1407937
%  length fails:    15574
%  strength fails:  229944
%  predlist fails:  335313
%  aux str. fails:  43463
%  by-lit fails:    44630
%  full subs tried: 719440
%  full subs fail:  697514
% 
% ; 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-3+eq_r.in")
% 
%------------------------------------------------------------------------------