TSTP Solution File: SET504-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET504-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 : art03.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 169.6s
% Output : Assurance 169.6s
% 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/SET504-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,555598,4,2103,556605,5,2803,556606,1,2806,556606,50,2812,556606,40,2812,556720,0,2813,580528,3,4214,583902,4,4915,599705,5,5614,599706,5,5615,599707,1,5615,599707,50,5618,599707,40,5618,599821,0,5618,628117,3,6170,631642,4,6444,640063,5,6719,640064,5,6719,640064,1,6719,640064,50,6722,640064,40,6722,640178,0,6722,674856,3,7575,680145,4,7998,689190,5,8423,689191,5,8424,689191,1,8424,689191,50,8427,689191,40,8427,689305,0,8427,722946,3,9278,727578,4,9703,743311,5,10131,743311,5,10131,743312,1,10132,743312,50,10134,743312,40,10134,743426,0,10135,827150,3,14486,840654,4,16662)
%
%
% START OF PROOF
% 743314 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 743315 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 743317 [] subclass(X,universal_class).
% 743318 [] -equal(X,Y) | subclass(X,Y).
% 743319 [] -equal(X,Y) | subclass(Y,X).
% 743321 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 743322 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 743325 [] equal(unordered_pair(X,X),singleton(X)).
% 743328 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 743329 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 743334 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 743335 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 743336 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 743337 [] -member(X,complement(Y)) | -member(X,Y).
% 743379 [] member(regular(X),X) | equal(X,null_class).
% 743380 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 743426 [] member(ordered_pair(x,universal_class),cross_product(universal_class,universal_class)).
% 743429 [binary:743328,743426] member(universal_class,universal_class).
% 743431 [binary:743329.3,743426] member(ordered_pair(ordered_pair(x,universal_class),X),cross_product(cross_product(universal_class,universal_class),Y)) | -member(X,Y).
% 743456 [binary:743314,743429] -subclass(universal_class,X) | member(universal_class,X).
% 743457 [binary:743322.2,743429] member(universal_class,unordered_pair(universal_class,X)).
% 743670 [para:743325.1.1,743457.1.2] member(universal_class,singleton(universal_class)).
% 743678 [binary:743314,743670] -subclass(singleton(universal_class),X) | member(universal_class,X).
% 743683 [binary:743336.3,743670] member(universal_class,intersection(singleton(universal_class),X)) | -member(universal_class,X).
% 743696 [binary:743314.3,743431.2] member(ordered_pair(ordered_pair(x,universal_class),X),cross_product(cross_product(universal_class,universal_class),Y)) | -member(X,Z) | -subclass(Z,Y).
% 744178 [binary:743319.2,743456] -equal(X,universal_class) | member(universal_class,X).
% 748620 [binary:743318.2,743678] -equal(singleton(universal_class),X) | member(universal_class,X).
% 784949 [binary:743317,743696.3,binarydemod:743328] member(X,universal_class) | -member(X,Y).
% 785687 [binary:743337.2,784949,factor] -member(X,complement(universal_class)).
% 785908 [binary:743315,785687] subclass(complement(universal_class),X).
% 785913 [binary:743335.2,785687] -member(X,intersection(Y,complement(universal_class))).
% 785917 [binary:743379,785687] equal(complement(universal_class),null_class).
% 785933 [binary:748620.2,785687,demod:785917] -equal(singleton(universal_class),null_class).
% 786213 [binary:743314.2,785908,demod:785917,slowcut:785913] -member(X,null_class).
% 786222 [binary:743334.2,786213] -member(X,intersection(null_class,Y)).
% 786534 [binary:743379.2,785933] member(regular(singleton(universal_class)),singleton(universal_class)).
% 786853 [binary:743379,786222] equal(intersection(null_class,X),null_class).
% 790274 [para:743380.2.2,786853.1.1.1,factor] equal(intersection(X,regular(X)),null_class).
% 799129 [para:790274.1.1,743683.1.2,cut:786213] -member(universal_class,regular(singleton(universal_class))).
% 799167 [binary:744178.2,799129] -equal(regular(singleton(universal_class)),universal_class).
% 804244 [para:743325.1.2,786534.1.2] member(regular(singleton(universal_class)),unordered_pair(universal_class,universal_class)).
% 858970 [binary:804244,743321,cut:799167] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit 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: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8664
% derived clauses: 1299427
% kept clauses: 284846
% kept size sum: 0
% kept mid-nuclei: 74673
% kept new demods: 594
% forw unit-subs: 357886
% forw double-subs: 62940
% forw overdouble-subs: 9979
% backward subs: 466
% fast unit cutoff: 8226
% full unit cutoff: 1985
% dbl unit cutoff: 466
% real runtime : 170.56
% process. runtime: 170.2
% specific non-discr-tree subsumption statistics:
% tried: 834475
% length fails: 49568
% strength fails: 116886
% predlist fails: 478237
% aux str. fails: 11305
% by-lit fails: 6812
% full subs tried: 165789
% full subs fail: 155704
%
% ; 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/SET504-6+eq_r.in")
%
%------------------------------------------------------------------------------