%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG001-4 : 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 0.0s
% Output   : Assurance 0.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-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 58 #f 2 9)
% (binary-posweight-order 29 #f 2 9)
% (binary-unit 29 #f 2 9)
% (binary-double 29 #f 2 9)
% (binary 29 #t 2 9)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(21,40,0,42,0,0)
% 
% 
% START OF PROOF
% 23 [] sum(additive_identity,X,X).
% 24 [] sum(X,additive_identity,X).
% 25 [] product(X,Y,multiply(X,Y)).
% 34 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 40 [] -sum(X,Y,Z) | -sum(X,U,Z) | equal(U,Y).
% 42 [] -product(a,additive_identity,additive_identity).
% 144 [hyper:34,25,25,25,23] sum(multiply(X,additive_identity),multiply(X,Y),multiply(X,Y)).
% 4611 [hyper:40,144,24] equal(additive_identity,multiply(X,additive_identity)).
% 4656 [para:4611.1.2,25.1.3,slowcut:42] 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 2
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    45
%  derived clauses:   33540
%  kept clauses:      41
%  kept size sum:     286
%  kept mid-nuclei:   4563
%  kept new demods:   4
%  forw unit-subs:    20212
%  forw double-subs: 128
%  forw overdouble-subs: 0
%  backward subs:     8
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.23
%  process. runtime:  0.23
% specific non-discr-tree subsumption statistics: 
%  tried:           1160
%  length fails:    0
%  strength fails:  278
%  predlist fails:  680
%  aux str. fails:  168
%  by-lit fails:    0
%  full subs tried: 34
%  full subs fail:  34
% 
% ; 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-4+eq_r.in")
% 
%------------------------------------------------------------------------------