TSTP Solution File: SET347-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET347-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 89.5s
% Output : Assurance 89.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/SET347-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,2,228,0,2,364627,4,2122,391066,5,2803,391067,1,2805,391067,50,2812,391067,40,2812,391181,0,2812,417074,3,4213,421274,4,4914,436721,5,5613,436722,5,5614,436723,1,5614,436723,50,5617,436723,40,5617,436837,0,5617,468370,3,6168,472100,4,6470,477010,5,6718,477010,5,6718,477011,1,6718,477011,50,6721,477011,40,6721,477125,0,6721,509125,3,7578,512686,4,7997,521141,5,8422,521142,5,8422,521143,1,8422,521143,50,8425,521143,40,8425,521257,0,8425)
%
%
% START OF PROOF
% 521144 [] equal(X,X).
% 521145 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 521146 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 521148 [] subclass(X,universal_class).
% 521149 [] -equal(X,Y) | subclass(X,Y).
% 521150 [] -equal(X,Y) | subclass(Y,X).
% 521151 [] -subclass(X,Y) | -subclass(Y,X) | equal(Y,X).
% 521159 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 521161 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 521165 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 521166 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 521168 [] -member(X,complement(Y)) | -member(X,Y).
% 521169 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 521172 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 521174 [] -equal(restrict(X,singleton(Y),universal_class),null_class) | -member(Y,domain_of(X)).
% 521197 [] equal(domain_of(restrict(element_relation,universal_class,X)),sum_class(X)).
% 521210 [] member(regular(X),X) | equal(X,null_class).
% 521211 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 521257 [] -equal(sum_class(null_class),null_class).
% 521258 [binary:521151.3,521257] -subclass(sum_class(null_class),null_class) | -subclass(null_class,sum_class(null_class)).
% 521263 [binary:521210.2,521257] member(regular(sum_class(null_class)),sum_class(null_class)).
% 521266 [binary:521211.2,521257] equal(intersection(sum_class(null_class),regular(sum_class(null_class))),null_class).
% 521271 [binary:521145,521263] member(regular(sum_class(null_class)),X) | -subclass(sum_class(null_class),X).
% 521368 [binary:521149.2,521258.2] -subclass(sum_class(null_class),null_class) | -equal(null_class,sum_class(null_class)).
% 521412 [binary:521149,521266,demod:521266] subclass(null_class,null_class).
% 521423 [para:521210.2.2,521412.1.1] member(regular(X),X) | subclass(X,null_class).
% 521424 [para:521210.2.2,521412.1.2] member(regular(X),X) | subclass(null_class,X).
% 521430 [binary:521145,521423] member(regular(X),Y) | subclass(X,null_class) | -subclass(X,Y).
% 521440 [binary:521165,521423] member(regular(intersection(X,Y)),X) | subclass(intersection(X,Y),null_class).
% 521444 [binary:521168,521423] -member(regular(complement(X)),X) | subclass(complement(X),null_class).
% 522292 [binary:521148,521271.2] member(regular(sum_class(null_class)),universal_class).
% 522333 [binary:521145,522292] member(regular(sum_class(null_class)),X) | -subclass(universal_class,X).
% 522339 [binary:521168.2,522292] -member(regular(sum_class(null_class)),complement(universal_class)).
% 522409 [binary:521165.2,522339] -member(regular(sum_class(null_class)),intersection(complement(universal_class),X)).
% 523536 [binary:521168.2,522333] -member(regular(sum_class(null_class)),complement(X)) | -subclass(universal_class,X).
% 523758 [binary:521150.2,521368] -equal(null_class,sum_class(null_class)).
% 524035 [binary:521169.3,522409,cut:522292,binarydemod:523536] -subclass(universal_class,intersection(complement(universal_class),X)).
% 524070 [para:521211.1.1,524035.1.2] equal(complement(universal_class),null_class) | -subclass(universal_class,null_class).
% 524161 [para:524070.1.1,522339.1.2,binarycut:522333] -subclass(universal_class,null_class).
% 524188 [binary:521149.2,524161] -equal(universal_class,null_class).
% 524199 [binary:521211.2,524188] equal(intersection(universal_class,regular(universal_class)),null_class).
% 524526 [para:524199.1.1,521165.1.2] -member(X,null_class) | member(X,universal_class).
% 524550 [binary:521168.2,524526.2] -member(X,complement(universal_class)) | -member(X,null_class).
% 525643 [binary:521145.3,524550,factor] -subclass(null_class,complement(universal_class)) | -member(X,null_class).
% 525678 [binary:521424,524550,binarycut:525643] -member(regular(complement(universal_class)),null_class).
% 525686 [binary:521145.3,525678] -member(regular(complement(universal_class)),X) | -subclass(X,null_class).
% 527032 [binary:521146,525643.2] -subclass(null_class,complement(universal_class)) | subclass(null_class,X).
% 527226 [binary:521150.2,527032] -equal(complement(universal_class),null_class) | subclass(null_class,X).
% 533225 [binary:521210,525686,binarydemod:527226] -subclass(complement(universal_class),null_class) | subclass(null_class,X).
% 533275 [binary:525643,533225.2] -subclass(complement(universal_class),null_class) | -member(X,null_class).
% 539212 [binary:521148,521430.3] member(regular(X),universal_class) | subclass(X,null_class).
% 541221 [binary:533225,521444.2,binarydemod:533275,539212] -member(X,null_class) | subclass(null_class,Y).
% 541354 [binary:521146,541221,factor] subclass(null_class,X).
% 541400 [binary:525643,541354] -member(X,null_class).
% 541403 [binary:521159.2,541400] -member(ordered_pair(X,Y),cross_product(Z,null_class)).
% 541406 [binary:521166.2,541400] -member(X,intersection(Y,null_class)).
% 541424 [binary:521440,541400] subclass(intersection(null_class,X),null_class).
% 541426 [binary:521151,541424,cut:541354] equal(null_class,intersection(null_class,X)).
% 541446 [binary:521210,541406] equal(intersection(X,null_class),null_class).
% 541474 [para:541426.1.2,521172.1.1] equal(null_class,restrict(null_class,X,Y)).
% 542995 [para:541474.1.2,521174.1.1,cut:521144] -member(X,domain_of(null_class)).
% 543018 [binary:521210,542995] equal(domain_of(null_class),null_class).
% 552520 [para:521161.1.1,541403.1.1,factor] -member(X,cross_product(Y,null_class)).
% 552570 [binary:521210,552520] equal(cross_product(X,null_class),null_class).
% 552589 [para:552570.1.1,521172.1.1.2,demod:541446] equal(null_class,restrict(X,Y,null_class)).
% 552652 [para:552589.1.2,521197.1.1.1,demod:543018,cut:523758] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6218
% derived clauses: 862475
% kept clauses: 205721
% kept size sum: 460037
% kept mid-nuclei: 37212
% kept new demods: 363
% forw unit-subs: 224289
% forw double-subs: 49334
% forw overdouble-subs: 11596
% backward subs: 535
% fast unit cutoff: 5613
% full unit cutoff: 584
% dbl unit cutoff: 195
% real runtime : 91.84
% process. runtime: 91.25
% specific non-discr-tree subsumption statistics:
% tried: 632859
% length fails: 33058
% strength fails: 65081
% predlist fails: 414910
% aux str. fails: 8624
% by-lit fails: 7419
% full subs tried: 99374
% full subs fail: 87711
%
% ; 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/SET347-6+eq_r.in")
%
%------------------------------------------------------------------------------