TSTP Solution File: SET183-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET183-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 59.2s
% Output : Assurance 59.2s
% 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/SET183-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(115,40,0,230,0,0,364712,4,2106,365610,5,2802,365611,1,2804,365611,50,2811,365611,40,2811,365726,0,2811,389434,3,4212,393273,4,4912,407030,5,5612,407031,5,5612,407032,1,5612,407032,50,5615,407032,40,5615,407147,0,5615,436285,3,6167,440499,4,6441)
%
%
% START OF PROOF
% 407034 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 407035 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 407036 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 407040 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 407054 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 407056 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 407146 [] subclass(x,y).
% 407147 [] -equal(intersection(x,y),x).
% 407160 [binary:407146,407034.2] -member(X,x) | member(X,y).
% 407183 [binary:407035,407160] member(not_subclass_element(x,X),y) | subclass(x,X).
% 407201 [binary:407147,407040.3] -subclass(intersection(x,y),x) | -subclass(x,intersection(x,y)).
% 407663 [binary:407036,407054.2] -member(not_subclass_element(X,Y),intersection(Y,Z)) | subclass(X,Y).
% 415173 [binary:407035.2,407201,binarydemod:407663,binarycut:407201] -subclass(x,intersection(x,y)).
% 415204 [binary:407035.2,415173] member(not_subclass_element(x,intersection(x,y)),x).
% 415206 [binary:407036.2,415173] -member(not_subclass_element(x,intersection(x,y)),intersection(x,y)).
% 415229 [binary:407183.2,415173] member(not_subclass_element(x,intersection(x,y)),y).
% 441007 [binary:415206,407056,cut:415229,cut:415204] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not 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
% clause length limited to 9
% clause depth limited to 6
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3696
% derived clauses: 630602
% kept clauses: 136448
% kept size sum: 665221
% kept mid-nuclei: 22672
% kept new demods: 211
% forw unit-subs: 139197
% forw double-subs: 25939
% forw overdouble-subs: 3627
% backward subs: 120
% fast unit cutoff: 1906
% full unit cutoff: 388
% dbl unit cutoff: 259
% real runtime : 65.58
% process. runtime: 64.64
% specific non-discr-tree subsumption statistics:
% tried: 111582
% length fails: 7398
% strength fails: 14477
% predlist fails: 67000
% aux str. fails: 911
% by-lit fails: 191
% full subs tried: 21039
% full subs fail: 17438
%
% ; 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/SET183-6+eq_r.in")
%
%------------------------------------------------------------------------------