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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET103-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 : art06.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 49.5s
% Output   : Assurance 49.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/SET103-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(94,40,0,188,0,0,340839,4,1881,341584,5,2502,341585,1,2505,341585,50,2511,341585,40,2511,341679,0,2511,353382,3,2963,355182,4,3188,359851,5,3412,359853,5,3412,359854,1,3412,359854,50,3413,359854,40,3413,359948,0,3413,388004,3,3864,391963,4,4089,403098,5,4314,403099,5,4314,403101,1,4314,403101,50,4316,403101,40,4316,403195,0,4316,438914,3,5075,442736,4,5443,448424,5,5817,448425,5,5818,448426,1,5818,448426,50,5820,448426,40,5820,448520,0,5820)
% 
% 
% START OF PROOF
% 448428 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 448431 [] subclass(X,universal_class).
% 448435 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 448439 [] equal(unordered_pair(X,X),singleton(X)).
% 448440 [] equal(unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),ordered_pair(X,Y)).
% 448493 [] member(regular(X),X) | equal(X,null_class).
% 448519 [] -equal(unordered_pair(singleton(x),unordered_pair(x,null_class)),ordered_pair(x,y)).
% 448520 [] -member(y,universal_class).
% 448521 [binary:448428.3,448520,cut:448431] -member(y,X).
% 448547 [para:448493.2.2,448519.1.1.2.2] -equal(unordered_pair(singleton(x),unordered_pair(x,X)),ordered_pair(x,y)) | member(regular(X),X).
% 449373 [binary:448440,448547] member(regular(singleton(y)),singleton(y)).
% 449394 [para:448439.1.2,449373.1.2] member(regular(singleton(y)),unordered_pair(y,y)).
% 449442 [binary:448435,449394] equal(regular(singleton(y)),y).
% 449443 [para:448439.1.1,449394.1.2,demod:449442,cut:448521] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos 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: 15
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4614
%  derived clauses:   718213
%  kept clauses:      160057
%  kept size sum:     11228
%  kept mid-nuclei:   27252
%  kept new demods:   300
%  forw unit-subs:    209288
%  forw double-subs: 41244
%  forw overdouble-subs: 9040
%  backward subs:     180
%  fast unit cutoff:  3857
%  full unit cutoff:  3235
%  dbl  unit cutoff:  218
%  real runtime  :  58.76
%  process. runtime:  58.23
% specific non-discr-tree subsumption statistics: 
%  tried:           422526
%  length fails:    16155
%  strength fails:  62283
%  predlist fails:  289156
%  aux str. fails:  2489
%  by-lit fails:    874
%  full subs tried: 50174
%  full subs fail:  41015
% 
% ; 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/SET103-6+eq_r.in")
% 
%------------------------------------------------------------------------------