%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG040-1 : 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 : art07.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/RNG040-1+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 2 9)
% (binary-unit 9 #f 2 9)
% (binary-double 9 #f 2 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 9)
% (binary-order 25 #f 2 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(28,40,1,56,0,1)
% 
% 
% START OF PROOF
% 43 [] -product(X,Y,Z) | -product(U,Y,V) | -product(W,Y,X1) | -sum(U,W,X) | sum(V,X1,Z).
% 52 [] sum(b,c,d).
% 53 [] product(d,a,additive_identity).
% 54 [] product(b,a,l).
% 55 [] product(c,a,n).
% 56 [] -sum(l,n,additive_identity).
% 838 [hyper:43,55,52,54,53,cut:56] 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: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    10
%  derived clauses:   1091
%  kept clauses:      15
%  kept size sum:     102
%  kept mid-nuclei:   765
%  kept new demods:   0
%  forw unit-subs:    197
%  forw double-subs: 23
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.4
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           393
%  length fails:    0
%  strength fails:  300
%  predlist fails:  93
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/RNG040-1+eq_r.in")
% 
%------------------------------------------------------------------------------