TSTP Solution File: RNG001-5 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG001-5 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.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 10.0s
% Output   : Assurance 10.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/RNG/RNG001-5+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 9)
% (binary-unit 28 #f 2 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 9)
% (binary 28 #t 2 9)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(30,40,0,60,0,0,94516,50,476,94546,0,476)
% 
% 
% START OF PROOF
% 94528 [] -product(X,Y,Z) | product(X,Y,U) | -equalish(Z,U).
% 94529 [] sum(additive_identity,X,X).
% 94530 [] sum(X,additive_identity,X).
% 94531 [] product(X,Y,multiply(X,Y)).
% 94534 [] sum(X,additive_inverse(X),additive_identity).
% 94535 [] -sum(U,Y,V) | -sum(W,X,U) | -sum(X,Y,Z) | sum(W,Z,V).
% 94540 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 94544 [] -sum(X,Y,U) | -sum(X,Y,Z) | equalish(Z,U).
% 94546 [] -product(a,additive_identity,additive_identity).
% 94954 [hyper:94540,94531,94531,94531,94529] sum(multiply(X,additive_identity),multiply(X,Y),multiply(X,Y)).
% 133703 [hyper:94535,94954,94534,94534] sum(multiply(X,additive_identity),additive_identity,additive_identity).
% 135727 [hyper:94544,133703,94530] equalish(multiply(X,additive_identity),additive_identity).
% 136313 [hyper:94528,135727,94531,slowcut:94546] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation 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 3
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    282
%  derived clauses:   1246265
%  kept clauses:      5227
%  kept size sum:     59503
%  kept mid-nuclei:   130942
%  kept new demods:   0
%  forw unit-subs:    498399
%  forw double-subs: 177
%  forw overdouble-subs: 0
%  backward subs:     51
%  fast unit cutoff:  0
%  full unit cutoff:  8
%  dbl  unit cutoff:  0
%  real runtime  :  10.88
%  process. runtime:  10.87
% specific non-discr-tree subsumption statistics: 
%  tried:           28579
%  length fails:    0
%  strength fails:  156
%  predlist fails:  25930
%  aux str. fails:  1100
%  by-lit fails:    0
%  full subs tried: 1393
%  full subs fail:  1393
% 
% ; 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/RNG/RNG001-5+noeq.in")
% 
%------------------------------------------------------------------------------