TSTP Solution File: SET205-6 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET205-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 59.5s
% Output   : Assurance 59.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/SET205-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,0,228,0,0,338282,4,2129,348989,5,2802,348990,1,2805,348990,50,2811,348990,40,2811,349104,0,2812,373426,3,4214,376380,4,4914,389356,5,5613,389357,5,5614,389358,1,5614,389358,50,5616,389358,40,5616,389472,0,5617,418976,3,6168,421823,4,6443)
% 
% 
% START OF PROOF
% 389360 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 389361 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 389363 [] subclass(X,universal_class).
% 389366 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 389374 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 389376 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 389383 [] -member(X,complement(Y)) | -member(X,Y).
% 389425 [] member(regular(X),X) | equal(X,null_class).
% 389472 [] -equal(cross_product(x,null_class),null_class).
% 389486 [binary:389363,389360.2] member(X,universal_class) | -member(X,Y).
% 389520 [binary:389472,389366.3] -subclass(cross_product(x,null_class),null_class) | -subclass(null_class,cross_product(x,null_class)).
% 389831 [para:389376.1.1,389374.1.1,factor] -member(X,cross_product(Y,Z)) | member(second(X),Z).
% 390317 [binary:389486,389383.2,factor] -member(X,complement(universal_class)).
% 390369 [binary:389361,390317] subclass(complement(universal_class),X).
% 392113 [binary:390317,389425] equal(complement(universal_class),null_class).
% 392198 [para:392113.1.1,389383.1.2,binarycut:389486] -member(X,null_class).
% 392200 [para:392113.1.1,390369.1.1] subclass(null_class,X).
% 392228 [binary:389520.2,392200] -subclass(cross_product(x,null_class),null_class).
% 392392 [binary:389361.2,392228] member(not_subclass_element(cross_product(x,null_class),null_class),cross_product(x,null_class)).
% 425664 [binary:392392,389831,cut:392198] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not 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
% clause length limited to 9
% clause depth limited to 6
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    3621
%  derived clauses:   656537
%  kept clauses:      137564
%  kept size sum:     684392
%  kept mid-nuclei:   25211
%  kept new demods:   224
%  forw unit-subs:    168007
%  forw double-subs: 23434
%  forw overdouble-subs: 3007
%  backward subs:     105
%  fast unit cutoff:  1702
%  full unit cutoff:  158
%  dbl  unit cutoff:  104
%  real runtime  :  66.31
%  process. runtime:  65.77
% specific non-discr-tree subsumption statistics: 
%  tried:           450255
%  length fails:    59067
%  strength fails:  63956
%  predlist fails:  247777
%  aux str. fails:  5016
%  by-lit fails:    6923
%  full subs tried: 65205
%  full subs fail:  62196
% 
% ; 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/SET205-6+eq_r.in")
% 
%------------------------------------------------------------------------------