%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG003-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 : art08.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/RNG003-1+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,1,42,0,1)
% 
% 
% START OF PROOF
% 23 [] sum(additive_identity,X,X).
% 27 [] sum(additive_inverse(X),X,additive_identity).
% 29 [] -sum(X,Y,Z) | -sum(U,V,X) | -sum(V,Y,W) | sum(U,W,Z).
% 30 [] -sum(X,Y,Z) | -sum(X,U,V) | -sum(U,W,Y) | sum(V,W,Z).
% 31 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 38 [] -sum(X,Y,Z) | -sum(X,Y,U) | equal(U,Z).
% 40 [] sum(a,c,d).
% 41 [] sum(b,c,d).
% 42 [] -equal(a,b).
% 101 [hyper:31,40] sum(c,a,d).
% 135 [hyper:31,41] sum(c,b,d).
% 221 [hyper:29,27,23,101] sum(additive_inverse(c),d,a).
% 544 [hyper:30,221,27,135] sum(additive_identity,b,a).
% 655 [hyper:38,544,23,cut: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:    17
%  derived clauses:   1028
%  kept clauses:      38
%  kept size sum:     254
%  kept mid-nuclei:   574
%  kept new demods:   2
%  forw unit-subs:    303
%  forw double-subs: 9
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           338
%  length fails:    0
%  strength fails:  137
%  predlist fails:  163
%  aux str. fails:  38
%  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/RNG003-1+eq_r.in")
% 
%------------------------------------------------------------------------------