TSTP Solution File: SET515-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET515-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 : art08.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 90.0s
% Output : Assurance 90.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/SET515-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,0,228,0,0,498885,4,2106,499301,5,2803,499302,1,2805,499302,50,2812,499302,40,2812,499416,0,2812,524967,3,4221,528408,4,4913,540643,5,5613,540644,5,5614,540645,1,5614,540645,50,5617,540645,40,5617,540759,0,5617,574289,3,6174,577259,4,6444,584271,5,6718,584271,5,6718,584272,1,6718,584272,50,6721,584272,40,6721,584386,0,6721,618669,3,7572,623107,4,7998,633377,5,8422,633378,5,8423,633378,1,8423,633378,50,8426,633378,40,8426,633492,0,8426,674851,3,9278,680742,4,9702)
%
%
% START OF PROOF
% 633380 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 633383 [] subclass(X,universal_class).
% 633384 [] -equal(X,Y) | subclass(X,Y).
% 633385 [] -equal(X,Y) | subclass(Y,X).
% 633387 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 633388 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 633391 [] equal(unordered_pair(X,X),singleton(X)).
% 633400 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 633402 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 633403 [] -member(X,complement(Y)) | -member(X,Y).
% 633445 [] member(regular(X),X) | equal(X,null_class).
% 633446 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 633492 [] member(x,x).
% 633493 [binary:633380,633492] -subclass(x,X) | member(x,X).
% 633499 [binary:633403.2,633492] -member(x,complement(x)).
% 633500 [binary:633380.3,633499] -subclass(X,complement(x)) | -member(x,X).
% 633504 [binary:633400.2,633499] -member(x,intersection(complement(x),X)).
% 633511 [binary:633383,633493] member(x,universal_class).
% 633513 [binary:633385.2,633493] -equal(X,x) | member(x,X).
% 633515 [binary:633388.2,633493.2,cut:633383] member(x,unordered_pair(x,X)).
% 633711 [para:633391.1.1,633515.1.2] member(x,singleton(x)).
% 633716 [binary:633402.3,633515] member(x,intersection(unordered_pair(x,X),Y)) | -member(x,Y).
% 633978 [binary:633385.2,633500] -equal(complement(x),X) | -member(x,X).
% 634057 [para:633446.1.1,633504.1.2,binarycut:633978] -member(x,null_class).
% 634058 [binary:633380.3,634057] -member(x,X) | -subclass(X,null_class).
% 635324 [binary:633388,634058,cut:633511] -subclass(unordered_pair(x,X),null_class).
% 635344 [binary:633711,634058] -subclass(singleton(x),null_class).
% 635409 [binary:633384.2,635344] -equal(singleton(x),null_class).
% 635430 [binary:633445.2,635409] member(regular(singleton(x)),singleton(x)).
% 635514 [binary:633384.2,635324] -equal(unordered_pair(x,X),null_class).
% 638024 [para:633391.1.2,635430.1.2] member(regular(singleton(x)),unordered_pair(x,x)).
% 672903 [para:633446.1.1,633716.1.2,cut:634057,cut:635514] -member(x,regular(unordered_pair(x,X))).
% 673085 [para:633391.1.1,672903.1.2.1] -member(x,regular(singleton(x))).
% 673137 [binary:633513.2,673085] -equal(regular(singleton(x)),x).
% 686218 [binary:638024,633387,cut:673137] 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: 6298
% derived clauses: 983183
% kept clauses: 225658
% kept size sum: 713085
% kept mid-nuclei: 43405
% kept new demods: 478
% forw unit-subs: 244495
% forw double-subs: 42528
% forw overdouble-subs: 7328
% backward subs: 185
% fast unit cutoff: 3826
% full unit cutoff: 287
% dbl unit cutoff: 345
% real runtime : 97.54
% process. runtime: 97.51
% specific non-discr-tree subsumption statistics:
% tried: 362704
% length fails: 19212
% strength fails: 50804
% predlist fails: 215964
% aux str. fails: 4070
% by-lit fails: 1051
% full subs tried: 69912
% full subs fail: 62518
%
% ; 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/SET515-6+eq_r.in")
%
%------------------------------------------------------------------------------