TSTP Solution File: SET257-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET257-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 268.7s
% Output : Assurance 268.7s
% 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/SET257-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,370463,4,2102,371243,5,2802,371244,1,2805,371244,50,2811,371244,40,2811,371358,0,2811,395647,3,4214,399510,4,4914,412020,5,5612,412021,5,5612,412022,1,5612,412022,50,5615,412022,40,5615,412136,0,5615,442068,3,6167,445725,4,6441,458277,5,6716,458278,5,6717,458278,1,6717,458278,50,6719,458278,40,6719,458392,0,6719,496698,3,7612,500552,4,7995,506798,5,8420,506798,5,8421,506799,1,8421,506799,50,8423,506799,40,8423,506913,0,8424,551441,3,9275,556387,4,9701,556596,5,10125,556597,5,10125,556597,1,10125,556597,50,10128,556597,40,10128,556711,0,10128,655733,3,14479,659531,4,16655,663584,5,18830,663585,1,18830,663585,50,18833,663585,40,18833,663699,0,18833,720031,3,20234,721072,4,20934,763420,1,21634,763420,50,21635,763420,40,21635,763534,0,21636,892747,3,24554,924344,4,25987,1064942,5,27437,1064944,1,27439,1064944,50,27447,1064944,40,27447,1065058,0,27447)
%
%
% START OF PROOF
% 1064947 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 1064948 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 1064952 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 1064967 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 1064968 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 1065058 [] -equal(intersection(cross_product(x,y),cross_product(x,y)),cross_product(x,y)).
% 1065060 [input:1064968,factor] member(X,intersection(Y,Y)) | -member(X,Y).
% 1065212 [binary:1064947,1064967] member(not_subclass_element(intersection(X,Y),Z),Y) | subclass(intersection(X,Y),Z).
% 1065224 [binary:1064947,1065060.2] member(not_subclass_element(X,Y),intersection(X,X)) | subclass(X,Y).
% 1075211 [binary:1064948,1065212] subclass(intersection(X,Y),Y).
% 1075846 [binary:1064948,1065224] subclass(X,intersection(X,X)).
% 1075935 [binary:1064952,1075846,cut:1075211,slowcut:1065058] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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: 16040
% derived clauses: 1953488
% kept clauses: 430205
% kept size sum: 334737
% kept mid-nuclei: 218810
% kept new demods: 729
% forw unit-subs: 615663
% forw double-subs: 184820
% forw overdouble-subs: 76583
% backward subs: 2042
% fast unit cutoff: 26588
% full unit cutoff: 6029
% dbl unit cutoff: 433
% real runtime : 277.62
% process. runtime: 276.6
% specific non-discr-tree subsumption statistics:
% tried: 38263261
% length fails: 1275106
% strength fails: 3501677
% predlist fails: 23473080
% aux str. fails: 839173
% by-lit fails: 660925
% full subs tried: 8194111
% full subs fail: 8114136
%
% ; 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/SET257-6+eq_r.in")
%
%------------------------------------------------------------------------------