%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP031-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 : art10.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/GRP031-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 7)
% (binary-posweight-order 28 #f 2 7)
% (binary-unit 28 #f 2 7)
% (hyper 188 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 114 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary 22 #t)
% (binary-unit 58 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(8,40,1,16,0,1,319,50,1,327,0,1)
% 
% 
% START OF PROOF
% 323 [] -product(X,Y,Z) | -product(U,V,X) | -product(V,Y,W) | product(U,W,Z).
% 324 [] -product(X,Y,Z) | -product(X,U,V) | -product(U,W,Y) | product(V,W,Z).
% 325 [] product(identity,X,X).
% 326 [] product(inverse(X),X,identity).
% 327 [] -product(a,X,identity).
% 347 [hyper:323,326,325,326] product(inverse(inverse(X)),identity,X).
% 504 [hyper:324,347,326,325,slowcut:327] 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 3
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    24
%  derived clauses:   1296
%  kept clauses:      27
%  kept size sum:     182
%  kept mid-nuclei:   448
%  kept new demods:   6
%  forw unit-subs:    437
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           67
%  length fails:    0
%  strength fails:  25
%  predlist fails:  12
%  aux str. fails:  26
%  by-lit fails:    0
%  full subs tried: 4
%  full subs fail:  4
% 
% ; 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/GRP031-1+eq_r.in")
% 
%------------------------------------------------------------------------------