TSTP Solution File: SET511-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET511-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 : art07.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 80.0s
% Output : Assurance 80.0s
% 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/SET511-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,378157,4,2129,378909,5,2804,378910,1,2804,378910,50,2810,378910,40,2810,379024,0,2810,405254,3,4212,409829,4,4911,425771,5,5611,425772,5,5612,425773,1,5612,425773,50,5616,425773,40,5616,425887,0,5616,456754,3,6169,461225,4,6442,475997,5,6717,475997,5,6718,475997,1,6718,475997,50,6720,475997,40,6720,476111,0,6720,514840,3,7600,519003,4,7997,525362,5,8421,525364,5,8421,525365,1,8421,525365,50,8424,525365,40,8424,525479,0,8424)
%
%
% START OF PROOF
% 525366 [] equal(X,X).
% 525367 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 525370 [] subclass(X,universal_class).
% 525372 [] -equal(X,Y) | subclass(Y,X).
% 525374 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 525378 [] equal(unordered_pair(X,X),singleton(X)).
% 525379 [] equal(unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),ordered_pair(X,Y)).
% 525387 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 525389 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 525390 [] -member(X,complement(Y)) | -member(X,Y).
% 525432 [] member(regular(X),X) | equal(X,null_class).
% 525433 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 525479 [] -equal(unordered_pair(singleton(x),unordered_pair(x,null_class)),ordered_pair(x,universal_class)).
% 525484 [para:525432.2.2,525479.1.1.2.2] -equal(unordered_pair(singleton(x),unordered_pair(x,X)),ordered_pair(x,universal_class)) | member(regular(X),X).
% 525485 [para:525433.2.2,525479.1.1.2.2] -equal(unordered_pair(singleton(x),unordered_pair(x,X)),ordered_pair(x,universal_class)) | equal(intersection(X,regular(X)),null_class).
% 525503 [binary:525379,525484] member(regular(singleton(universal_class)),singleton(universal_class)).
% 525511 [binary:525389.3,525484.2] -equal(unordered_pair(singleton(x),unordered_pair(x,X)),ordered_pair(x,universal_class)) | member(regular(X),intersection(X,Y)) | -member(regular(X),Y).
% 525526 [para:525378.1.2,525503.1.2] member(regular(singleton(universal_class)),unordered_pair(universal_class,universal_class)).
% 525565 [binary:525374,525526] equal(regular(singleton(universal_class)),universal_class).
% 525566 [para:525378.1.1,525526.1.2,demod:525565] member(universal_class,singleton(universal_class)).
% 525575 [binary:525367,525566] -subclass(singleton(universal_class),X) | member(universal_class,X).
% 525633 [binary:525370,525575] member(universal_class,universal_class).
% 525762 [binary:525379,525485,demod:525565] equal(intersection(singleton(universal_class),universal_class),null_class).
% 527781 [para:525762.1.1,525511.2.2,demod:525379,525565,cut:525366,cut:525633] member(universal_class,null_class).
% 527785 [binary:525367,527781] -subclass(null_class,X) | member(universal_class,X).
% 527791 [binary:525390.2,527781] -member(universal_class,complement(null_class)).
% 527801 [binary:525387.2,527791] -member(universal_class,intersection(complement(null_class),X)).
% 527940 [binary:527791,527785.2] -subclass(null_class,complement(null_class)).
% 527952 [binary:525372.2,527940] -equal(complement(null_class),null_class).
% 528058 [para:525433.1.1,527801.1.2,cut:527781,cut:527952] 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: 5417
% derived clauses: 853047
% kept clauses: 184398
% kept size sum: 39858
% kept mid-nuclei: 42054
% kept new demods: 343
% forw unit-subs: 243897
% forw double-subs: 44792
% forw overdouble-subs: 9423
% backward subs: 266
% fast unit cutoff: 4929
% full unit cutoff: 4325
% dbl unit cutoff: 180
% real runtime : 84.40
% process. runtime: 84.37
% specific non-discr-tree subsumption statistics:
% tried: 472691
% length fails: 16633
% strength fails: 70010
% predlist fails: 318943
% aux str. fails: 2421
% by-lit fails: 1353
% full subs tried: 60866
% full subs fail: 51335
%
% ; 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/SET511-6+eq_r.in")
%
%------------------------------------------------------------------------------