%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP031-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 : art03.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-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(7,40,0,14,0,0,4245,50,15,4252,0,15)
% 
% 
% START OF PROOF
% 4248 [] -product(X,Y,Z) | -product(U,V,X) | -product(V,Y,W) | product(U,W,Z).
% 4249 [] -product(X,Y,Z) | -product(X,U,V) | -product(U,W,Y) | product(V,W,Z).
% 4250 [] product(X,inverse(X),identity).
% 4251 [] product(X,identity,X).
% 4252 [] -product(X,a,identity).
% 4286 [hyper:4249,4250,4250,4251] product(identity,inverse(inverse(X)),X).
% 4574 [hyper:4248,4286,4250,4251,slowcut:4252] 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:    55
%  derived clauses:   23509
%  kept clauses:      124
%  kept size sum:     884
%  kept mid-nuclei:   4423
%  kept new demods:   0
%  forw unit-subs:    8879
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     6
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.16
%  process. runtime:  0.15
% specific non-discr-tree subsumption statistics: 
%  tried:           171
%  length fails:    0
%  strength fails:  8
%  predlist fails:  13
%  aux str. fails:  92
%  by-lit fails:    0
%  full subs tried: 58
%  full subs fail:  58
% 
% ; 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-2+noeq.in")
% 
%------------------------------------------------------------------------------