TSTP Solution File: SET186-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET186-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 : art05.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 287.5s
% Output : Assurance 287.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/SET186-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,2,230,0,2,372744,4,2109,373562,5,2804,373563,1,2806,373563,50,2813,373563,40,2813,373678,0,2814,395213,3,4215,399182,4,4916,412412,5,5615,412413,5,5615,412414,1,5615,412414,50,5618,412414,40,5618,412529,0,5618,439229,3,6172,443152,4,6444,450216,5,6728,450216,5,6729,450217,1,6729,450217,50,6732,450217,40,6732,450332,0,6732,482253,3,7588,486200,4,8008,497207,5,8433,497208,5,8433,497208,1,8433,497208,50,8436,497208,40,8436,497323,0,8436,538112,3,9288,541700,4,9712,549248,5,10137,549249,5,10139,549249,1,10139,549249,50,10141,549249,40,10141,549364,0,10141,660619,3,14492,666375,4,16667,684736,5,18843,684737,1,18845,684737,50,18849,684737,40,18849,684852,0,18849,738200,3,20251,740062,4,20951,776188,5,21650,776189,5,21650,776189,1,21650,776189,50,21651,776189,40,21651,776304,0,21651,891503,3,24552,922720,4,26002,1096671,5,27452,1096672,5,27453,1096673,1,27453,1096673,50,27462,1096673,40,27462,1096788,0,27462,1135631,3,28863)
%
%
% START OF PROOF
% 1096675 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 1096676 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 1096677 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 1096678 [] subclass(X,universal_class).
% 1096695 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 1096698 [] -member(X,complement(Y)) | -member(X,Y).
% 1096699 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 1096787 [] equal(complement(intersection(complement(x),complement(y))),y).
% 1096788 [] -subclass(x,y).
% 1096804 [binary:1096788,1096676.2] member(not_subclass_element(x,y),x).
% 1096806 [binary:1096675,1096804] member(not_subclass_element(x,y),X) | -subclass(x,X).
% 1096810 [binary:1096678,1096806.2] member(not_subclass_element(x,y),universal_class).
% 1097121 [binary:1096810,1096699.2] member(not_subclass_element(x,y),complement(X)) | member(not_subclass_element(x,y),X).
% 1098313 [para:1096787.1.1,1097121.1.2,binarydemod:1096677,cut:1096788] member(not_subclass_element(x,y),intersection(complement(x),complement(y))).
% 1142435 [binary:1096695,1098313] member(not_subclass_element(x,y),complement(x)).
% 1142466 [binary:1096698,1142435,cut:1096804] 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 lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 16481
% derived clauses: 2245515
% kept clauses: 446628
% kept size sum: 958918
% kept mid-nuclei: 274455
% kept new demods: 729
% forw unit-subs: 841818
% forw double-subs: 194381
% forw overdouble-subs: 62809
% backward subs: 1797
% fast unit cutoff: 24661
% full unit cutoff: 2850
% dbl unit cutoff: 549
% real runtime : 296.64
% process. runtime: 293.86
% specific non-discr-tree subsumption statistics:
% tried: 13234730
% length fails: 531721
% strength fails: 1927099
% predlist fails: 8559850
% aux str. fails: 373310
% by-lit fails: 197921
% full subs tried: 1553770
% full subs fail: 1489207
%
% ; 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/SET186-6+eq_r.in")
%
%------------------------------------------------------------------------------