TSTP Solution File: SET505-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET505-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 : art05.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.6s
% Output : Assurance 89.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/SET505-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,528199,4,2103,529215,5,2804,529216,1,2804,529216,50,2810,529216,40,2810,529330,0,2811,553719,3,4213,556861,4,4912,572632,5,5612,572633,5,5613,572634,1,5613,572634,50,5616,572634,40,5616,572748,0,5616,601558,3,6167,604509,4,6442,615577,5,6717,615579,5,6718,615579,1,6718,615579,50,6720,615579,40,6720,615693,0,6720,650769,3,7586,655951,4,8025,665998,5,8421,665999,5,8421,666000,1,8421,666000,50,8425,666000,40,8425,666114,0,8425,699496,3,9279,704029,4,9730)
%
%
% START OF PROOF
% 666002 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 666006 [] -equal(X,Y) | subclass(X,Y).
% 666007 [] -equal(X,Y) | subclass(Y,X).
% 666009 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 666010 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 666013 [] equal(unordered_pair(X,X),singleton(X)).
% 666015 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 666022 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 666024 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 666025 [] -member(X,complement(Y)) | -member(X,Y).
% 666026 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 666067 [] member(regular(X),X) | equal(X,null_class).
% 666068 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 666114 [] member(ordered_pair(universal_class,y),cross_product(universal_class,universal_class)).
% 666116 [binary:666015,666114] member(universal_class,universal_class).
% 666129 [binary:666002,666116] -subclass(universal_class,X) | member(universal_class,X).
% 666130 [binary:666010.2,666116] member(universal_class,unordered_pair(universal_class,X)).
% 666137 [binary:666025.2,666116] -member(universal_class,complement(universal_class)).
% 666161 [binary:666002.3,666137] -subclass(X,complement(universal_class)) | -member(universal_class,X).
% 666165 [binary:666022.2,666137] -member(universal_class,intersection(complement(universal_class),X)).
% 666277 [para:666013.1.1,666130.1.2] member(universal_class,singleton(universal_class)).
% 666343 [binary:666002,666277] -subclass(singleton(universal_class),X) | member(universal_class,X).
% 666348 [binary:666024.3,666277] member(universal_class,intersection(singleton(universal_class),X)) | -member(universal_class,X).
% 666745 [binary:666007.2,666129] -equal(X,universal_class) | member(universal_class,X).
% 667851 [binary:666025.2,666745.2] -member(universal_class,complement(X)) | -equal(X,universal_class).
% 669008 [binary:666007.2,666161] -equal(complement(universal_class),X) | -member(universal_class,X).
% 670649 [binary:666006.2,666343] -equal(singleton(universal_class),X) | member(universal_class,X).
% 695068 [para:666068.1.1,666165.1.2,binarycut:669008] -member(universal_class,null_class).
% 695075 [binary:666026.3,695068,cut:666116] member(universal_class,complement(null_class)).
% 695092 [binary:670649.2,695068] -equal(singleton(universal_class),null_class).
% 695178 [binary:666025,695075] -member(universal_class,null_class).
% 695339 [binary:666067.2,695092] member(regular(singleton(universal_class)),singleton(universal_class)).
% 697956 [para:666068.1.1,666348.1.2,cut:695178,cut:695092] -member(universal_class,regular(singleton(universal_class))).
% 698145 [binary:666026.3,697956,cut:666116,binarydemod:667851] -equal(regular(singleton(universal_class)),universal_class).
% 698941 [para:666013.1.2,695339.1.2] member(regular(singleton(universal_class)),unordered_pair(universal_class,universal_class)).
% 712489 [binary:698941,666009,cut:698145] 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
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6390
% derived clauses: 1039422
% kept clauses: 211226
% kept size sum: 630933
% kept mid-nuclei: 51686
% kept new demods: 476
% forw unit-subs: 268058
% forw double-subs: 46983
% forw overdouble-subs: 7948
% backward subs: 259
% fast unit cutoff: 5151
% full unit cutoff: 2593
% dbl unit cutoff: 295
% real runtime : 98.37
% process. runtime: 97.85
% specific non-discr-tree subsumption statistics:
% tried: 661445
% length fails: 40287
% strength fails: 105240
% predlist fails: 393759
% aux str. fails: 7241
% by-lit fails: 2575
% full subs tried: 109860
% full subs fail: 101854
%
% ; 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/SET505-6+eq_r.in")
%
%------------------------------------------------------------------------------