TSTP Solution File: SET473-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET473-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 69.5s
% Output : Assurance 69.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/SET473-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(115,40,1,230,0,1,353497,4,2105,354339,5,2804,354340,1,2804,354340,50,2811,354340,40,2811,354455,0,2811,379786,3,4214,382592,4,4915,396769,5,5612,396770,5,5613,396771,1,5613,396771,50,5616,396771,40,5616,396886,0,5616,421553,3,6177,424812,4,6442,430473,5,6717,430474,5,6718,430475,1,6718,430475,50,6720,430475,40,6720,430590,0,6720)
%
%
% START OF PROOF
% 399580 [?] ?
% 430477 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 430478 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 430481 [] -equal(X,Y) | subclass(X,Y).
% 430482 [] -equal(X,Y) | subclass(Y,X).
% 430483 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 430490 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 430493 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 430497 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 430498 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 430504 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 430506 [] -equal(restrict(X,singleton(Y),universal_class),null_class) | -member(Y,domain_of(X)).
% 430542 [] member(regular(X),X) | equal(X,null_class).
% 430589 [] equal(y,null_class).
% 430590 [] -equal(domain_of(restrict(x,y,y)),y).
% 430599 [para:430589.1.1,430590.1.1.1.3] -equal(domain_of(restrict(x,y,null_class)),y).
% 430623 [para:430589.1.1,430599.1.2] -equal(domain_of(restrict(x,y,null_class)),null_class).
% 430626 [binary:430589,430481] subclass(y,null_class).
% 430631 [binary:430477.2,430626,cut:399580] -member(X,y).
% 430632 [para:430589.1.1,430631.1.2] -member(X,null_class).
% 430635 [binary:430478,430631] subclass(y,X).
% 430641 [binary:430478,430632] subclass(null_class,X).
% 430653 [binary:430478.2,430483.2] member(not_subclass_element(X,Y),X) | -subclass(Y,X) | equal(X,Y).
% 430665 [binary:430635,430483] -subclass(X,y) | equal(X,y).
% 430761 [binary:430631,430490.2] -member(ordered_pair(X,Y),cross_product(y,Z)).
% 430948 [binary:430631,430497.2] -member(X,intersection(y,Y)).
% 430989 [binary:430632,430498.2] -member(X,intersection(Y,null_class)).
% 431018 [binary:430478,430989] subclass(intersection(X,null_class),Y).
% 431268 [para:430504.1.1,430948.1.2] -member(X,restrict(y,Y,Z)).
% 432041 [binary:430482.2,430665] -equal(y,X) | equal(X,y).
% 432066 [binary:431018,430665] equal(intersection(X,null_class),y).
% 434017 [para:432041.2.2,431268.1.2.1] -member(X,restrict(Y,Z,U)) | -equal(y,Y).
% 438138 [binary:430506,430653.3,cut:430641,binarydemod:434017] -member(X,domain_of(Y)) | -equal(y,Y).
% 438179 [binary:430623,430653.3,cut:430641,binarydemod:438138] -equal(y,restrict(x,y,null_class)).
% 452719 [para:430493.1.1,430761.1.1,factor] -member(X,cross_product(y,Y)).
% 452741 [binary:430542,452719] equal(cross_product(y,X),null_class).
% 452779 [para:452741.1.1,430504.1.1.2,demod:432066,slowcut:438179] 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
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4655
% derived clauses: 674362
% kept clauses: 153761
% kept size sum: 860396
% kept mid-nuclei: 28043
% kept new demods: 313
% forw unit-subs: 166780
% forw double-subs: 27246
% forw overdouble-subs: 3365
% backward subs: 220
% fast unit cutoff: 1627
% full unit cutoff: 174
% dbl unit cutoff: 202
% real runtime : 71.1
% process. runtime: 70.46
% specific non-discr-tree subsumption statistics:
% tried: 107022
% length fails: 8340
% strength fails: 11944
% predlist fails: 63572
% aux str. fails: 1184
% by-lit fails: 134
% full subs tried: 21096
% full subs fail: 17724
%
% ; 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/SET473-6+eq_r.in")
%
%------------------------------------------------------------------------------