%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET553-6 : 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 : art06.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 39.5s
% Output   : Assurance 39.5s
% 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/SET553-6+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 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (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(114,40,1,228,0,1,381853,4,2126,387967,5,2803,387968,1,2806,387968,50,2813,387968,40,2813,388082,0,2813)
% 
% 
% START OF PROOF
% 387971 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 387972 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 387990 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 388046 [] equal(intersection(domain_of(X),diagonalise(compose(inverse(element_relation),X))),cantor(X)).
% 388082 [] -subclass(cantor(x),domain_of(x)).
% 388105 [binary:388082,387971.2] member(not_subclass_element(cantor(x),domain_of(x)),cantor(x)).
% 388113 [binary:388082,387972.2] -member(not_subclass_element(cantor(x),domain_of(x)),domain_of(x)).
% 388336 [binary:388113,387990.2] -member(not_subclass_element(cantor(x),domain_of(x)),intersection(domain_of(x),X)).
% 410435 [para:388046.1.1,388336.1.2,cut:388105] 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 9
% clause depth limited to 6
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1904
%  derived clauses:   549402
%  kept clauses:      99110
%  kept size sum:     248260
%  kept mid-nuclei:   8525
%  kept new demods:   125
%  forw unit-subs:    97308
%  forw double-subs: 11671
%  forw overdouble-subs: 373
%  backward subs:     35
%  fast unit cutoff:  272
%  full unit cutoff:  0
%  dbl  unit cutoff:  47
%  real runtime  :  40.98
%  process. runtime:  40.51
% specific non-discr-tree subsumption statistics: 
%  tried:           17743
%  length fails:    1049
%  strength fails:  24
%  predlist fails:  11752
%  aux str. fails:  125
%  by-lit fails:    2
%  full subs tried: 4751
%  full subs fail:  4383
% 
% ; 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/SET553-6+eq_r.in")
% 
%------------------------------------------------------------------------------