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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET468-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 69.5s
% Output   : Assurance 69.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/SET468-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,2,230,0,3,387073,4,2110,407895,5,2805,407896,1,2805,407896,50,2811,407896,40,2811,408011,0,2812,429533,3,4213,433301,4,4913,446900,5,5613,446902,1,5613,446902,50,5616,446902,40,5616,447017,0,5616,472511,3,6167,475066,4,6445,481016,5,6717,481017,5,6717,481019,1,6717,481019,50,6719,481019,40,6719,481134,0,6719)
% 
% 
% START OF PROOF
% 449658 [?] ?
% 481021 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 481022 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 481025 [] -equal(X,Y) | subclass(X,Y).
% 481034 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 481037 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 481133 [] equal(x,null_class).
% 481134 [] -subclass(cross_product(x,x),identity_relation).
% 481143 [para:481133.1.1,481134.1.1.2] -subclass(cross_product(x,null_class),identity_relation).
% 481167 [binary:481022.2,481143] member(not_subclass_element(cross_product(x,null_class),identity_relation),cross_product(x,null_class)).
% 481178 [binary:481133,481025] subclass(x,null_class).
% 481184 [binary:481021.2,481178,cut:449658] -member(X,x).
% 481317 [binary:481184,481034.2] -member(ordered_pair(X,Y),cross_product(x,Z)).
% 487441 [para:481133.1.1,481167.1.1.1.1] member(not_subclass_element(cross_product(null_class,null_class),identity_relation),cross_product(x,null_class)).
% 501064 [para:481037.1.1,481317.1.1,factor:slowcut:487441] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not 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: 17
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4628
%  derived clauses:   693525
%  kept clauses:      149011
%  kept size sum:     806425
%  kept mid-nuclei:   27874
%  kept new demods:   328
%  forw unit-subs:    154250
%  forw double-subs: 24533
%  forw overdouble-subs: 2766
%  backward subs:     188
%  fast unit cutoff:  1644
%  full unit cutoff:  155
%  dbl  unit cutoff:  167
%  real runtime  :  70.51
%  process. runtime:  69.96
% specific non-discr-tree subsumption statistics: 
%  tried:           96049
%  length fails:    7958
%  strength fails:  11250
%  predlist fails:  56464
%  aux str. fails:  934
%  by-lit fails:    121
%  full subs tried: 18830
%  full subs fail:  16064
% 
% ; 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/SET468-6+eq_r.in")
% 
%------------------------------------------------------------------------------