%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP046-2 : 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 : art02.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/GRP/GRP046-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 7)
% (binary-unit 28 #f 2 7)
% (binary-double 28 #f 2 7)
% (binary-posweight-order 28 #f 2 7)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(9,40,1,18,0,1)
% 
% 
% START OF PROOF
% 10 [] product(identity,X,X).
% 11 [] product(inverse(X),X,identity).
% 12 [] product(X,Y,multiply(X,Y)).
% 13 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 14 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 15 [] -product(X,Y,Z) | -product(X,U,V) | -product(U,W,Y) | product(V,W,Z).
% 16 [] -product(X,Y,Z) | product(X,Y,U) | -equalish(Z,U).
% 17 [] equalish(a,b).
% 18 [] -equalish(multiply(a,c),multiply(b,c)).
% 32 [hyper:16,10,17] product(identity,a,b).
% 45 [hyper:14,32,10,10] product(identity,b,a).
% 89 [hyper:14,11,45,10] product(inverse(identity),b,a).
% 93 [hyper:14,11,10,10] product(inverse(identity),X,X).
% 250 [hyper:15,12,93,89] product(a,X,multiply(b,X)).
% 526 [hyper:13,250,12,slowcut:18] 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 7
% clause depth limited to 2
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    23
%  derived clauses:   1246
%  kept clauses:      49
%  kept size sum:     315
%  kept mid-nuclei:   455
%  kept new demods:   0
%  forw unit-subs:    467
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           46
%  length fails:    0
%  strength fails:  12
%  predlist fails:  9
%  aux str. fails:  25
%  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/GRP/GRP046-2+noeq.in")
% 
%------------------------------------------------------------------------------