TSTP Solution File: SET188-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET188-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 : art09.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 79.6s
% Output : Assurance 79.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/SET188-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,1,230,0,1,376480,4,2128,377271,5,2803,377272,1,2806,377272,50,2813,377272,40,2813,377387,0,2813,399592,3,4216,402900,4,4916,415655,5,5614,415656,5,5614,415657,1,5614,415657,50,5618,415657,40,5618,415772,0,5618,442998,3,6172,446928,4,6444,453936,5,6719,453937,5,6719,453937,1,6719,453937,50,6721,453937,40,6721,454052,0,6721,485048,3,7572,489399,4,7997,500493,5,8422,500494,5,8423,500494,1,8423,500494,50,8426,500494,40,8426,500609,0,8426)
%
%
% START OF PROOF
% 500496 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 500497 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 500498 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 500499 [] subclass(X,universal_class).
% 500501 [] -equal(X,Y) | subclass(Y,X).
% 500516 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 500518 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 500519 [] -member(X,complement(Y)) | -member(X,Y).
% 500520 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 500562 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 500608 [] equal(intersection(complement(y),x),null_class).
% 500609 [] -subclass(x,y).
% 500610 [binary:500497.2,500609] member(not_subclass_element(x,y),x).
% 500611 [binary:500498.2,500609] -member(not_subclass_element(x,y),y).
% 500618 [binary:500496,500610] member(not_subclass_element(x,y),X) | -subclass(x,X).
% 500622 [binary:500518.2,500610] member(not_subclass_element(x,y),intersection(X,x)) | -member(not_subclass_element(x,y),X).
% 500629 [binary:500516.2,500611] -member(not_subclass_element(x,y),intersection(y,X)).
% 500633 [para:500608.1.1,500516.1.2] member(X,complement(y)) | -member(X,null_class).
% 500914 [binary:500519,500633] -member(X,null_class) | -member(X,y).
% 500984 [binary:500496.3,500914.2,factor] -subclass(null_class,y) | -member(X,null_class).
% 501153 [binary:500499,500618.2] member(not_subclass_element(x,y),universal_class).
% 501507 [binary:500501.2,500984] -equal(y,null_class) | -member(X,null_class).
% 502015 [para:500562.1.1,500629.1.2,binarycut:501507] -member(not_subclass_element(x,y),null_class).
% 502140 [binary:500520.3,500611,cut:501153] member(not_subclass_element(x,y),complement(y)).
% 502158 [binary:500622.2,502140,demod:500608,cut:502015] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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: 5325
% derived clauses: 748489
% kept clauses: 168450
% kept size sum: 17116
% kept mid-nuclei: 39220
% kept new demods: 333
% forw unit-subs: 190113
% forw double-subs: 34974
% forw overdouble-subs: 4022
% backward subs: 147
% fast unit cutoff: 2219
% full unit cutoff: 240
% dbl unit cutoff: 322
% real runtime : 84.82
% process. runtime: 84.31
% specific non-discr-tree subsumption statistics:
% tried: 301987
% length fails: 32485
% strength fails: 27864
% predlist fails: 176817
% aux str. fails: 4631
% by-lit fails: 2031
% full subs tried: 56555
% full subs fail: 52524
%
% ; 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/SET188-6+eq_r.in")
%
%------------------------------------------------------------------------------