TSTP Solution File: SET195-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET195-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 89.3s
% Output : Assurance 89.3s
% 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/SET195-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(114,40,1,228,0,1,381874,4,2117,387866,5,2804,387867,1,2804,387867,50,2811,387867,40,2811,387981,0,2811,414474,3,4241,417951,4,4912,435403,5,5612,435403,5,5613,435404,1,5613,435404,50,5616,435404,40,5616,435518,0,5616,465021,3,6178,467972,4,6443,474143,5,6717,474144,5,6717,474144,1,6717,474144,50,6720,474144,40,6720,474258,0,6720,505323,3,7583,508510,4,7997,517411,5,8421,517412,5,8421,517412,1,8421,517412,50,8424,517412,40,8424,517526,0,8424,561724,3,9275,565719,4,9700)
%
%
% START OF PROOF
% 517414 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 517415 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 517416 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 517417 [] subclass(X,universal_class).
% 517418 [] -equal(X,Y) | subclass(X,Y).
% 517435 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 517437 [] -member(X,complement(Y)) | -member(X,Y).
% 517438 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 517439 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 517526 [] -subclass(y,union(x,y)).
% 517527 [binary:517415.2,517526] member(not_subclass_element(y,union(x,y)),y).
% 517528 [binary:517416.2,517526] -member(not_subclass_element(y,union(x,y)),union(x,y)).
% 517535 [binary:517414,517527] member(not_subclass_element(y,union(x,y)),X) | -subclass(y,X).
% 517541 [binary:517437.2,517527] -member(not_subclass_element(y,union(x,y)),complement(y)).
% 517547 [binary:517435.2,517541] -member(not_subclass_element(y,union(x,y)),intersection(X,complement(y))).
% 517549 [binary:517414.3,517528] -member(not_subclass_element(y,union(x,y)),X) | -subclass(X,union(x,y)).
% 518073 [binary:517417,517535.2] member(not_subclass_element(y,union(x,y)),universal_class).
% 519223 [binary:517438.3,517547,cut:518073] member(not_subclass_element(y,union(x,y)),complement(intersection(X,complement(y)))).
% 519392 [binary:517418.2,517549.2] -member(not_subclass_element(y,union(x,y)),X) | -equal(X,union(x,y)).
% 569406 [binary:519223,519392,slowcut:517439] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6079
% derived clauses: 861680
% kept clauses: 216127
% kept size sum: 794180
% kept mid-nuclei: 44562
% kept new demods: 307
% forw unit-subs: 215273
% forw double-subs: 41701
% forw overdouble-subs: 6642
% backward subs: 175
% fast unit cutoff: 3308
% full unit cutoff: 292
% dbl unit cutoff: 348
% real runtime : 99.38
% process. runtime: 98.65
% specific non-discr-tree subsumption statistics:
% tried: 4264344
% length fails: 623656
% strength fails: 667220
% predlist fails: 2001086
% aux str. fails: 128290
% by-lit fails: 131483
% full subs tried: 668173
% full subs fail: 661427
%
% ; 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/SET195-6+eq_r.in")
%
%------------------------------------------------------------------------------