%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET027-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 : art04.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 19.3s
% Output   : Assurance 19.3s
% 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/SET027-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,1,290,0,1,208270,4,2209,229566,5,2802,229567,1,2802,229567,50,2806,229567,40,2806,229712,0,2806)
% 
% 
% START OF PROOF
% 229635 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 229636 [] member(f17(X,Y),X) | subset(X,Y).
% 229637 [] -member(f17(X,Y),Y) | subset(X,Y).
% 229710 [] subset(a,b).
% 229711 [] subset(b,c).
% 229712 [] -subset(a,c).
% 231920 [binary:229710,229635] -member(X,a) | member(X,b).
% 231921 [binary:229711,229635] -member(X,b) | member(X,c).
% 232061 [binary:229712,229636.2] member(f17(a,c),a).
% 232117 [binary:229712,229637.2] -member(f17(a,c),c).
% 232587 [binary:232061,231920] member(f17(a,c),b).
% 232984 [binary:232117,231921.2,cut:232587] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 15
% clause depth limited to 4
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    542
%  derived clauses:   1253389
%  kept clauses:      80074
%  kept size sum:     36665
%  kept mid-nuclei:   37474
%  kept new demods:   23
%  forw unit-subs:    8253
%  forw double-subs: 89163
%  forw overdouble-subs: 120829
%  backward subs:     6
%  fast unit cutoff:  4093
%  full unit cutoff:  87
%  dbl  unit cutoff:  3
%  real runtime  :  28.84
%  process. runtime:  28.21
% specific non-discr-tree subsumption statistics: 
%  tried:           2427893
%  length fails:    186425
%  strength fails:  763621
%  predlist fails:  808253
%  aux str. fails:  7325
%  by-lit fails:    38821
%  full subs tried: 587868
%  full subs fail:  471469
% 
% ; 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/SET027-4+eq_r.in")
% 
%------------------------------------------------------------------------------