%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET503-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 89.4s
% Output : Assurance 89.4s
% 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/SET503-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,550914,4,2125,557249,5,2802,557250,1,2805,557250,50,2812,557250,40,2812,557364,0,2812,586261,3,4213,590524,4,4914,604712,5,5613,604713,5,5613,604715,1,5613,604715,50,5617,604715,40,5617,604829,0,5617,639528,3,6168,643787,4,6443,654224,5,6725,654226,5,6726,654226,1,6726,654226,50,6728,654226,40,6728,654340,0,6728,694698,3,7619,698619,4,8004,707630,5,8429,707630,5,8430,707632,1,8430,707632,50,8433,707632,40,8433,707746,0,8433,746740,3,9284,753108,4,9709)
%
%
% START OF PROOF
% 707634 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 707637 [] subclass(X,universal_class).
% 707638 [] -equal(X,Y) | subclass(X,Y).
% 707639 [] -equal(X,Y) | subclass(Y,X).
% 707641 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 707642 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 707645 [] equal(unordered_pair(X,X),singleton(X)).
% 707654 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 707656 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 707657 [] -member(X,complement(Y)) | -member(X,Y).
% 707658 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 707699 [] member(regular(X),X) | equal(X,null_class).
% 707700 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 707746 [] member(universal_class,x).
% 707747 [binary:707634,707746] -subclass(x,X) | member(universal_class,X).
% 707753 [binary:707657.2,707746] -member(universal_class,complement(x)).
% 707754 [binary:707634.3,707753] -subclass(X,complement(x)) | -member(universal_class,X).
% 707758 [binary:707654.2,707753] -member(universal_class,intersection(complement(x),X)).
% 707765 [binary:707637,707747] member(universal_class,universal_class).
% 707769 [binary:707642.2,707747.2,cut:707637] member(universal_class,unordered_pair(universal_class,X)).
% 707793 [binary:707634,707765] -subclass(universal_class,X) | member(universal_class,X).
% 707965 [para:707645.1.1,707769.1.2] member(universal_class,singleton(universal_class)).
% 707970 [binary:707656.3,707769] member(universal_class,intersection(unordered_pair(universal_class,X),Y)) | -member(universal_class,Y).
% 708242 [binary:707639.2,707754] -equal(complement(x),X) | -member(universal_class,X).
% 708310 [para:707700.1.1,707758.1.2,binarycut:708242] -member(universal_class,null_class).
% 708311 [binary:707634.3,708310] -member(universal_class,X) | -subclass(X,null_class).
% 708996 [binary:707639.2,707793] -equal(X,universal_class) | member(universal_class,X).
% 709700 [binary:707642,708311,cut:707765] -subclass(unordered_pair(universal_class,X),null_class).
% 709720 [binary:707965,708311] -subclass(singleton(universal_class),null_class).
% 709788 [binary:707638.2,709720] -equal(singleton(universal_class),null_class).
% 709809 [binary:707699.2,709788] member(regular(singleton(universal_class)),singleton(universal_class)).
% 709887 [binary:707638.2,709700] -equal(unordered_pair(universal_class,X),null_class).
% 711536 [binary:707657.2,708996.2] -member(universal_class,complement(X)) | -equal(X,universal_class).
% 712428 [para:707645.1.2,709809.1.2] member(regular(singleton(universal_class)),unordered_pair(universal_class,universal_class)).
% 745779 [para:707700.1.1,707970.1.2,cut:708310,cut:709887] -member(universal_class,regular(unordered_pair(universal_class,X))).
% 745944 [para:707645.1.1,745779.1.2.1] -member(universal_class,regular(singleton(universal_class))).
% 745985 [binary:707658.3,745944,cut:707765,binarydemod:711536] -equal(regular(singleton(universal_class)),universal_class).
% 758859 [binary:712428,707641,cut:745985] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6601
% derived clauses: 1108290
% kept clauses: 235012
% kept size sum: 679614
% kept mid-nuclei: 45997
% kept new demods: 510
% forw unit-subs: 297139
% forw double-subs: 45299
% forw overdouble-subs: 7288
% backward subs: 179
% fast unit cutoff: 5353
% full unit cutoff: 2432
% dbl unit cutoff: 317
% real runtime : 98.50
% process. runtime: 97.78
% specific non-discr-tree subsumption statistics:
% tried: 758095
% length fails: 25198
% strength fails: 151410
% predlist fails: 464349
% aux str. fails: 5158
% by-lit fails: 1027
% full subs tried: 109425
% full subs fail: 102102
%
% ; 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/SET503-6+eq_r.in")
%
%------------------------------------------------------------------------------