TSTP Solution File: SET137-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET137-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 : art07.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 198.4s
% Output : Assurance 198.4s
% 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/SET137-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(97,40,0,194,0,1,469585,4,1896,469984,5,2504,469985,1,2506,469985,50,2513,469985,40,2513,470082,0,2513,484127,3,2965,486099,4,3197,499348,5,3414,499349,5,3414,499350,1,3414,499350,50,3416,499350,40,3416,499447,0,3416,522766,3,3868,526283,4,4102,532915,5,4317,532916,5,4317,532917,1,4317,532917,50,4319,532917,40,4319,533014,0,4319,560244,3,5088,563570,4,5446,575447,5,5820,575448,5,5820,575448,1,5820,575448,50,5823,575448,40,5823,575545,0,5823,606779,3,6574,612608,4,6953,621907,5,7324,621908,5,7324,621908,1,7324,621908,50,7328,621908,40,7328,622005,0,7328,687619,3,9832,695766,4,11080,720867,5,12329,720868,5,12330,720869,1,12330,720869,50,12336,720869,40,12336,720966,0,12336,766662,3,13587,768083,4,14213,802717,5,14837,802717,1,14837,802717,50,14841,802717,40,14841,802814,0,14841,1064919,3,19894)
%
%
% START OF PROOF
% 746567 [?] ?
% 746770 [?] ?
% 802719 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 802720 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 802722 [] subclass(X,universal_class).
% 802724 [] -equal(X,Y) | subclass(Y,X).
% 802725 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 802727 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 802730 [] equal(unordered_pair(X,X),singleton(X)).
% 802734 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 802739 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 802742 [] -member(X,complement(Y)) | -member(X,Y).
% 802743 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 802744 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 802784 [] member(regular(X),X) | equal(X,null_class).
% 802785 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 802810 [] equal(union(singleton(X),Y),set_builder(X,Y)).
% 802811 [] member(u,x).
% 802814 [] equal(set_builder(u,set_builder(v,set_builder(w,null_class))),null_class).
% 802822 [binary:802811,802719] -subclass(x,X) | member(u,X).
% 802836 [binary:802722,802822] member(u,universal_class).
% 802867 [binary:802836,802727.2] member(u,unordered_pair(u,X)).
% 802881 [para:802730.1.1,802867.1.2] member(u,singleton(u)).
% 802928 [binary:802720,802734.2] member(ordered_pair(X,not_subclass_element(Y,Z)),cross_product(U,Y)) | -member(X,U) | subclass(Y,Z).
% 803015 [binary:802724,802784.2] member(regular(X),X) | subclass(null_class,X).
% 803116 [binary:802836,802743.2] member(u,complement(X)) | member(u,X).
% 803442 [binary:802742,803116.2] member(u,complement(complement(X))) | -member(u,X).
% 803444 [binary:802739,803116.2] member(u,complement(intersection(X,Y))) | member(u,X).
% 810256 [binary:803015,802928.2,factor:cut:746770] subclass(null_class,X).
% 810608 [binary:802725,810256] -subclass(X,null_class) | equal(X,null_class).
% 810615 [para:802785.2.2,810608.1.2,factor:cut:746567] equal(intersection(X,regular(X)),null_class).
% 810619 [para:810615.1.1,802739.1.2] -member(X,null_class) | member(X,Y).
% 810625 [binary:803116.2,810619,factor] member(u,complement(null_class)).
% 811032 [binary:802742,810625] -member(u,null_class).
% 883382 [binary:802881,803442.2] member(u,complement(complement(singleton(u)))).
% 883502 [binary:802742,883382] -member(u,complement(singleton(u))).
% 964559 [binary:883502,803444.2] member(u,complement(intersection(complement(singleton(u)),X))).
% 1070413 [para:802744.1.1,964559.1.2,demod:802810] member(u,set_builder(u,X)).
% 1070528 [para:802814.1.1,1070413.1.2,cut:811032] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not 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
% seconds given: 101
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13039
% derived clauses: 1971163
% kept clauses: 373338
% kept size sum: 0
% kept mid-nuclei: 107655
% kept new demods: 950
% forw unit-subs: 693148
% forw double-subs: 153324
% forw overdouble-subs: 54468
% backward subs: 1174
% fast unit cutoff: 21021
% full unit cutoff: 2192
% dbl unit cutoff: 564
% real runtime : 204.23
% process. runtime: 202.49
% specific non-discr-tree subsumption statistics:
% tried: 5592915
% length fails: 78871
% strength fails: 1437494
% predlist fails: 3476228
% aux str. fails: 59041
% by-lit fails: 15456
% full subs tried: 513062
% full subs fail: 456999
%
% ; 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/SET137-6+eq_r.in")
%
%------------------------------------------------------------------------------