%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET260-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 : art02.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 100.1s
% Output : Assurance 100.1s
% 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/SET260-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(116,40,2,232,0,2,548096,4,2104,550419,5,2804,550420,1,2804,550420,50,2830,550420,40,2830,550536,0,2830,575605,3,4233,579048,4,4933,594831,5,5631,594831,5,5631,594832,1,5631,594832,50,5635,594832,40,5635,594948,0,5635,620498,3,6186,623589,4,6462,631058,5,6736,631059,5,6737,631061,1,6737,631061,50,6739,631061,40,6739,631177,0,6739,658874,3,7590,662349,4,8015,671943,5,8440,671944,5,8440,671944,1,8440,671944,50,8443,671944,40,8443,672060,0,8443,700064,3,9297,704251,4,9719)
%
%
% START OF PROOF
% 631312 [?] ?
% 633801 [?] ?
% 671946 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 671947 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 671950 [] -equal(X,Y) | subclass(X,Y).
% 671951 [] -equal(X,Y) | subclass(Y,X).
% 671954 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 671957 [] equal(unordered_pair(X,X),singleton(X)).
% 671959 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 671960 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 671961 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 671966 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 671968 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 671974 [] equal(intersection(cross_product(X,Y),Z),restrict(Z,X,Y)).
% 671976 [] equal(restrict(X,singleton(Y),universal_class),null_class) | member(Y,domain_of(X)) | -member(Y,universal_class).
% 672011 [] member(regular(X),X) | equal(X,null_class).
% 672012 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 672058 [] member(ordered_pair(x,y),xr).
% 672059 [] member(ordered_pair(x,y),cross_product(universal_class,universal_class)).
% 672060 [] -member(x,domain_of(xr)).
% 672065 [binary:671966.2,672060] -member(x,intersection(domain_of(xr),X)).
% 672068 [binary:671976.2,672060,cut:631312] equal(restrict(xr,singleton(x),universal_class),null_class).
% 672087 [binary:671968.2,672058] member(ordered_pair(x,y),intersection(X,xr)) | -member(ordered_pair(x,y),X).
% 672090 [binary:671946.3,672065] -subclass(X,intersection(domain_of(xr),Y)) | -member(x,X).
% 672094 [binary:671966.2,672065] -member(x,intersection(intersection(domain_of(xr),X),Y)).
% 672111 [binary:671959,672059] member(x,universal_class).
% 672112 [binary:671960,672059] member(y,universal_class).
% 672124 [binary:671946,672111] -subclass(universal_class,X) | member(x,X).
% 672125 [binary:671954.2,672111] member(x,unordered_pair(x,X)).
% 672143 [binary:671961.2,672112] member(ordered_pair(X,y),cross_product(Y,universal_class)) | -member(X,Y).
% 672146 [binary:671968.2,672112] member(y,intersection(X,universal_class)) | -member(y,X).
% 672298 [para:671957.1.1,672125.1.2] member(x,singleton(x)).
% 672679 [binary:671950.2,672124] -equal(universal_class,X) | member(x,X).
% 674042 [binary:671946,672087] -member(ordered_pair(x,y),X) | member(ordered_pair(x,y),Y) | -subclass(intersection(X,xr),Y).
% 674253 [binary:671951.2,672090] -equal(intersection(domain_of(xr),X),Y) | -member(x,Y).
% 674426 [para:672012.1.1,672094.1.2,binarycut:674253] -member(x,null_class).
% 674447 [binary:672679.2,674426] -equal(universal_class,null_class).
% 674463 [binary:672012.2,674447] equal(intersection(universal_class,regular(universal_class)),null_class).
% 677185 [binary:672298,672143.2] member(ordered_pair(x,y),cross_product(singleton(x),universal_class)).
% 677614 [binary:672112,672146.2] member(y,intersection(universal_class,universal_class)).
% 679363 [para:674463.1.1,671966.1.2] -member(X,null_class) | member(X,universal_class).
% 679415 [binary:671961.2,679363.2,factor:cut:633801] -member(X,null_class).
% 679427 [binary:671947,679415] subclass(null_class,X).
% 679431 [binary:671966.2,679415] -member(X,intersection(null_class,Y)).
% 679573 [binary:672011,679431] equal(intersection(null_class,X),null_class).
% 679800 [para:672012.2.2,679573.1.1.1,factor] equal(intersection(X,regular(X)),null_class).
% 681414 [para:679800.1.1,671968.1.2,cut:679415] -member(X,regular(Y)) | -member(X,Y).
% 701037 [binary:677614,681414.2] -member(y,regular(intersection(universal_class,universal_class))).
% 702363 [binary:671960.2,701037] -member(ordered_pair(X,y),cross_product(Y,regular(intersection(universal_class,universal_class)))).
% 715677 [binary:677185,674042,demod:672068,671974,cut:679427,slowcut:702363] 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6159
% derived clauses: 1033216
% kept clauses: 194221
% kept size sum: 0
% kept mid-nuclei: 53082
% kept new demods: 350
% forw unit-subs: 264639
% forw double-subs: 37014
% forw overdouble-subs: 4139
% backward subs: 207
% fast unit cutoff: 2823
% full unit cutoff: 276
% dbl unit cutoff: 241
% real runtime : 101.48
% process. runtime: 101.43
% specific non-discr-tree subsumption statistics:
% tried: 160880
% length fails: 11600
% strength fails: 16960
% predlist fails: 98429
% aux str. fails: 1443
% by-lit fails: 508
% full subs tried: 30804
% full subs fail: 26670
%
% ; 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/SET260-6+eq_r.in")
%
%------------------------------------------------------------------------------