TSTP Solution File: SET150-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET150-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 109.6s
% Output : Assurance 109.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/SET150-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,2,228,0,2,372347,4,2126,373028,5,2803,373029,1,2806,373029,50,2813,373029,40,2813,373143,0,2813,397708,3,4216,401766,4,4917,414255,5,5614,414256,5,5614,414257,1,5614,414257,50,5617,414257,40,5617,414371,0,5617,445169,3,6169,449290,4,6443,464714,5,6718,464714,5,6718,464715,1,6718,464715,50,6721,464715,40,6721,464829,0,6721,500314,3,7586,505186,4,7997,511680,5,8422,511681,5,8423,511681,1,8423,511681,50,8426,511681,40,8426,511795,0,8426,556214,3,9278,560963,4,9702,561309,5,10127,561309,1,10128,561309,50,10130,561309,40,10130,561423,0,10130)
%
%
% START OF PROOF
% 561311 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 561312 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 561313 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 561314 [] subclass(X,universal_class).
% 561317 [] -subclass(X,Y) | -subclass(Y,X) | equal(Y,X).
% 561334 [] -member(X,complement(Y)) | -member(X,Y).
% 561335 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 561423 [] -equal(complement(complement(x)),x).
% 561424 [binary:561317.3,561423] -subclass(complement(complement(x)),x) | -subclass(x,complement(complement(x))).
% 561428 [binary:561312.2,561424] member(not_subclass_element(complement(complement(x)),x),complement(complement(x))) | -subclass(x,complement(complement(x))).
% 561430 [binary:561313.2,561424] -member(not_subclass_element(complement(complement(x)),x),x) | -subclass(x,complement(complement(x))).
% 561662 [binary:561311,561428] -subclass(x,complement(complement(x))) | member(not_subclass_element(complement(complement(x)),x),X) | -subclass(complement(complement(x)),X).
% 561670 [binary:561334,561428] -member(not_subclass_element(complement(complement(x)),x),complement(x)) | -subclass(x,complement(complement(x))).
% 561922 [binary:561335.3,561430,binarycut:561670] -member(not_subclass_element(complement(complement(x)),x),universal_class) | -subclass(x,complement(complement(x))).
% 615081 [binary:561314,561662.3,binarycut:561922] -subclass(x,complement(complement(x))).
% 615140 [binary:561312.2,615081] member(not_subclass_element(x,complement(complement(x))),x).
% 615141 [binary:561313.2,615081] -member(not_subclass_element(x,complement(complement(x))),complement(complement(x))).
% 615323 [binary:561334.2,615140] -member(not_subclass_element(x,complement(complement(x))),complement(x)).
% 615595 [binary:561335.3,615323,cut:615141] -member(not_subclass_element(x,complement(complement(x))),universal_class).
% 615655 [binary:561311.3,615595,cut:561314,slowcut:615140] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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: 7575
% derived clauses: 1029540
% kept clauses: 271140
% kept size sum: 0
% kept mid-nuclei: 39558
% kept new demods: 345
% forw unit-subs: 309634
% forw double-subs: 69877
% forw overdouble-subs: 16862
% backward subs: 569
% fast unit cutoff: 3809
% full unit cutoff: 4483
% dbl unit cutoff: 332
% real runtime : 114.15
% process. runtime: 113.70
% specific non-discr-tree subsumption statistics:
% tried: 6870637
% length fails: 668581
% strength fails: 1377028
% predlist fails: 3120158
% aux str. fails: 268012
% by-lit fails: 223013
% full subs tried: 1113580
% full subs fail: 1095733
%
% ; 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/SET150-6+eq_r.in")
%
%------------------------------------------------------------------------------