%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET147-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 : art09.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 59.5s
% Output   : Assurance 59.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/SET147-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,0,228,0,0,378157,4,2134,378907,5,2803,378908,1,2806,378908,50,2812,378908,40,2812,379022,0,2813,403209,3,4216,406871,4,4916,420443,5,5614,420444,5,5614,420445,1,5614,420445,50,5617,420445,40,5617,420559,0,5617,452152,3,6173,456217,4,6446)
% 
% 
% START OF PROOF
% 420446 [] equal(X,X).
% 420447 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 420448 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 420449 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 420450 [] subclass(X,universal_class).
% 420451 [] -equal(X,Y) | subclass(X,Y).
% 420453 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 420468 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 420469 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 420559 [] -equal(intersection(universal_class,x),x).
% 420573 [binary:420450,420447.2] member(X,universal_class) | -member(X,Y).
% 420588 [binary:420446,420451] subclass(X,X).
% 420605 [binary:420450,420453] -subclass(universal_class,X) | equal(universal_class,X).
% 420607 [binary:420559,420453.3] -subclass(intersection(universal_class,x),x) | -subclass(x,intersection(universal_class,x)).
% 420626 [binary:420448.2,420607] member(not_subclass_element(intersection(universal_class,x),x),intersection(universal_class,x)) | -subclass(x,intersection(universal_class,x)).
% 420649 [binary:420448,420573.2] member(not_subclass_element(X,Y),universal_class) | subclass(X,Y).
% 421215 [binary:420449,420468.2] -member(not_subclass_element(X,Y),intersection(Z,Y)) | subclass(X,Y).
% 429388 [para:420605.2.1,420626.1.2.1,binarydemod:421215,binarycut:420607,slowcut:420588] -subclass(x,intersection(universal_class,x)).
% 429403 [binary:420448.2,429388] member(not_subclass_element(x,intersection(universal_class,x)),x).
% 429404 [binary:420449.2,429388] -member(not_subclass_element(x,intersection(universal_class,x)),intersection(universal_class,x)).
% 432546 [binary:429388,420649.2] member(not_subclass_element(x,intersection(universal_class,x)),universal_class).
% 456744 [binary:429404,420469,cut:429403,cut:432546] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit 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:    3717
%  derived clauses:   651929
%  kept clauses:      138994
%  kept size sum:     719849
%  kept mid-nuclei:   22613
%  kept new demods:   218
%  forw unit-subs:    137985
%  forw double-subs: 24287
%  forw overdouble-subs: 3488
%  backward subs:     124
%  fast unit cutoff:  1888
%  full unit cutoff:  295
%  dbl  unit cutoff:  122
%  real runtime  :  65.25
%  process. runtime:  64.76
% specific non-discr-tree subsumption statistics: 
%  tried:           193568
%  length fails:    18107
%  strength fails:  33581
%  predlist fails:  108576
%  aux str. fails:  2215
%  by-lit fails:    894
%  full subs tried: 29196
%  full subs fail:  25672
% 
% ; 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/SET147-6+eq_r.in")
% 
%------------------------------------------------------------------------------