%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET261-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 : art01.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 49.6s
% Output   : Assurance 49.6s
% 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/SET261-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,364644,4,2115,391180,5,2803,391181,1,2806,391181,50,2812,391181,40,2812,391295,0,2813,416593,3,4215,420260,4,4914,435548,5,5614,435549,5,5614,435550,1,5614,435550,50,5617,435550,40,5617,435664,0,5617)
% 
% 
% START OF PROOF
% 435551 [] equal(X,X).
% 435552 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 435555 [] subclass(X,universal_class).
% 435572 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 435575 [] -member(X,complement(Y)) | -member(X,Y).
% 435579 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 435581 [] -equal(restrict(X,singleton(Y),universal_class),null_class) | -member(Y,domain_of(X)).
% 435617 [] member(regular(X),X) | equal(X,null_class).
% 435664 [] -equal(domain_of(null_class),null_class).
% 435678 [binary:435555,435552.2] member(X,universal_class) | -member(X,Y).
% 436115 [binary:435678,435575.2,factor] -member(X,complement(universal_class)).
% 436244 [binary:436115,435572.2] -member(X,intersection(complement(universal_class),Y)).
% 438231 [binary:435664,435617.2] member(regular(domain_of(null_class)),domain_of(null_class)).
% 438276 [binary:436115,435617] equal(complement(universal_class),null_class).
% 438315 [binary:436244,435617,demod:438276] equal(intersection(null_class,X),null_class).
% 438729 [para:438315.1.1,435579.1.1] equal(null_class,restrict(null_class,X,Y)).
% 438839 [binary:435581.2,438231,demod:438729,cut:435551] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double 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: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2554
%  derived clauses:   612995
%  kept clauses:      108710
%  kept size sum:     349213
%  kept mid-nuclei:   23726
%  kept new demods:   187
%  forw unit-subs:    136417
%  forw double-subs: 13193
%  forw overdouble-subs: 537
%  backward subs:     76
%  fast unit cutoff:  564
%  full unit cutoff:  7
%  dbl  unit cutoff:  57
%  real runtime  :  56.77
%  process. runtime:  56.35
% specific non-discr-tree subsumption statistics: 
%  tried:           27334
%  length fails:    1661
%  strength fails:  288
%  predlist fails:  18098
%  aux str. fails:  133
%  by-lit fails:    25
%  full subs tried: 7069
%  full subs fail:  6530
% 
% ; 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/SET261-6+eq_r.in")
% 
%------------------------------------------------------------------------------