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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET479-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 : art10.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 20.0s
% Output   : Assurance 20.0s
% 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/SET479-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,0,230,0,0,438195,4,2107)
% 
% 
% START OF PROOF
% 117 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 131 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 214 [] subclass(domain_relation,cross_product(universal_class,universal_class)).
% 216 [] member(ordered_pair(X,domain_of(X)),domain_relation) | -member(X,universal_class).
% 229 [] member(x,universal_class).
% 230 [] -member(domain_of(x),universal_class).
% 272 [hyper:216,229] member(ordered_pair(x,domain_of(x)),domain_relation).
% 5582 [hyper:117,272,214] member(ordered_pair(x,domain_of(x)),cross_product(universal_class,universal_class)).
% 439062 [binary:131.2,230,slowcut:5582] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 6
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    668
%  derived clauses:   557042
%  kept clauses:      77017
%  kept size sum:     0
%  kept mid-nuclei:   8562
%  kept new demods:   54
%  forw unit-subs:    83611
%  forw double-subs: 12226
%  forw overdouble-subs: 469
%  backward subs:     10
%  fast unit cutoff:  64
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  25.52
%  process. runtime:  25.50
% specific non-discr-tree subsumption statistics: 
%  tried:           2021
%  length fails:    6
%  strength fails:  21
%  predlist fails:  1003
%  aux str. fails:  17
%  by-lit fails:    7
%  full subs tried: 950
%  full subs fail:  492
% 
% ; 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/SET479-6+eq_r.in")
% 
%------------------------------------------------------------------------------