%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG006-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/RNG006-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(26,40,1,52,0,1)
% 
% 
% START OF PROOF
% 30 [] product(X,Y,multiply(X,Y)).
% 36 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 40 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 44 [] -product(X,Y,Z) | -product(X,Y,U) | equal(U,Z).
% 45 [] product(X,additive_inverse(Y),additive_inverse(Z)) | -product(X,Y,Z).
% 48 [] sum(b,additive_inverse(c),b^s_^ic).
% 49 [] product(a,b,a^pb).
% 50 [] product(a,c,a^pc).
% 51 [] sum(a^pb,additive_inverse(a^pc),a^pb_^s_^ia^pc).
% 52 [] -product(a,b^s_^ic,a^pb_^s_^ia^pc).
% 219 [hyper:45,50] product(a,additive_inverse(c),additive_inverse(a^pc)).
% 245 [hyper:36,48] sum(additive_inverse(c),b,b^s_^ic).
% 369 [hyper:36,51] sum(additive_inverse(a^pc),a^pb,a^pb_^s_^ia^pc).
% 603 [hyper:44,30,49] equal(a^pb,multiply(a,b)).
% 8622 [hyper:40,219,245,30,369,demod:603,cut:52] 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:    60
%  derived clauses:   23367
%  kept clauses:      316
%  kept size sum:     2239
%  kept mid-nuclei:   8245
%  kept new demods:   12
%  forw unit-subs:    9697
%  forw double-subs: 63
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  5
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.22
%  process. runtime:  0.22
% specific non-discr-tree subsumption statistics: 
%  tried:           3865
%  length fails:    0
%  strength fails:  1619
%  predlist fails:  1961
%  aux str. fails:  284
%  by-lit fails:    0
%  full subs tried: 1
%  full subs fail:  1
% 
% ; 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/RNG006-1+eq_r.in")
% 
%------------------------------------------------------------------------------