TSTP Solution File: SET191-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET191-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 : art10.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 159.5s
% Output : Assurance 159.5s
% 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/SET191-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,376472,4,2107,377297,5,2803,377298,1,2806,377298,50,2812,377298,40,2812,377413,0,2812,398845,3,4215,402837,4,4915,415788,5,5613,415789,5,5614,415790,1,5614,415790,50,5617,415790,40,5617,415905,0,5617,443382,3,6179,447176,4,6443,454323,5,6718,454324,5,6718,454324,1,6718,454324,50,6720,454324,40,6720,454439,0,6721,486687,3,7576,490869,4,7997,501993,5,8422,501995,5,8423,501995,1,8423,501995,50,8426,501995,40,8426,502110,0,8426,546441,3,9277,549730,4,9702,557670,5,10127,557670,5,10128,557670,1,10128,557670,50,10131,557670,40,10131,557785,0,10131,664663,3,14483,670874,4,16657)
%
%
% START OF PROOF
% 502499 [?] ?
% 557672 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 557673 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 557674 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 557675 [] subclass(X,universal_class).
% 557694 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 557695 [] -member(X,complement(Y)) | -member(X,Y).
% 557696 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 557697 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 557784 [] equal(union(complement(x),y),universal_class).
% 557785 [] -subclass(x,y).
% 557786 [binary:557673.2,557785] member(not_subclass_element(x,y),x).
% 557787 [binary:557674.2,557785] -member(not_subclass_element(x,y),y).
% 557794 [binary:557672,557786] member(not_subclass_element(x,y),X) | -subclass(x,X).
% 557800 [binary:557695.2,557786] -member(not_subclass_element(x,y),complement(x)).
% 557807 [binary:557696.3,557787,cut:502499] member(not_subclass_element(x,y),complement(y)).
% 557815 [binary:557696.3,557800,cut:502499] member(not_subclass_element(x,y),complement(complement(x))).
% 557820 [binary:557694.2,557807] member(not_subclass_element(x,y),intersection(X,complement(y))) | -member(not_subclass_element(x,y),X).
% 558338 [binary:557695,557794] -member(not_subclass_element(x,y),X) | -subclass(x,complement(X)).
% 560065 [binary:557815,557820.2] member(not_subclass_element(x,y),intersection(complement(complement(x)),complement(y))).
% 674579 [binary:560065,558338,demod:557784,557697,cut:557675] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit 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: 9381
% derived clauses: 1085145
% kept clauses: 291337
% kept size sum: 0
% kept mid-nuclei: 51226
% kept new demods: 354
% forw unit-subs: 324808
% forw double-subs: 59845
% forw overdouble-subs: 11953
% backward subs: 315
% fast unit cutoff: 4095
% full unit cutoff: 437
% dbl unit cutoff: 391
% real runtime : 169.57
% process. runtime: 168.43
% specific non-discr-tree subsumption statistics:
% tried: 6417933
% length fails: 353529
% strength fails: 642240
% predlist fails: 4111842
% aux str. fails: 162994
% by-lit fails: 155023
% full subs tried: 924457
% full subs fail: 912469
%
% ; 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/SET191-6+eq_r.in")
%
%------------------------------------------------------------------------------