%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP123-4.003 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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/GRP123-4.003+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 1 9)
% (binary-unit 10 #f 1 9)
% (binary-double 16 #f 1 9)
% (binary 54 #t 1 9)
% (binary-order 27 #f 1 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(18,40,1,36,0,1)
% 
% 
% START OF PROOF
% 20 [] product(X,e_2,Y) | product(X,e_3,Y) | product(X,e_1,Y) | -group_element(X) | -group_element(Y).
% 21 [] group_element(e_1).
% 22 [] group_element(e_2).
% 24 [] -equalish(e_1,e_2).
% 26 [] -equalish(e_2,e_1).
% 31 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 33 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 34 [] product(X,X,X).
% 35 [] -product(W,Y,X) | -product(W,V,U) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 48 [hyper:20,22,21] product(e_2,e_1,e_1) | product(e_2,e_2,e_1) | product(e_2,e_3,e_1).
% 50 [hyper:20,22,21] product(e_1,e_2,e_2) | product(e_1,e_3,e_2) | product(e_1,e_1,e_2).
% 474 [hyper:31,48,34,cut:26] product(e_2,e_3,e_1) | product(e_2,e_1,e_1).
% 603 [hyper:33,474,34,cut:24] product(e_2,e_3,e_1).
% 708 [hyper:31,50,34,cut:24] product(e_1,e_2,e_2) | product(e_1,e_3,e_2).
% 849 [hyper:33,708,34,cut:26] product(e_1,e_3,e_2).
% 1047 [hyper:35,849,603,34,cut:34] equalish(e_1,e_2).
% 1286 [hyper:24,1047] 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 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    34
%  derived clauses:   2613
%  kept clauses:      85
%  kept size sum:     641
%  kept mid-nuclei:   1144
%  kept new demods:   0
%  forw unit-subs:    639
%  forw double-subs: 418
%  forw overdouble-subs: 250
%  backward subs:     19
%  fast unit cutoff:  191
%  full unit cutoff:  0
%  dbl  unit cutoff:  2
%  real runtime  :  0.7
%  process. runtime:  0.6
% specific non-discr-tree subsumption statistics: 
%  tried:           1988
%  length fails:    10
%  strength fails:  337
%  predlist fails:  492
%  aux str. fails:  0
%  by-lit fails:    612
%  full subs tried: 270
%  full subs fail:  229
% 
% ; 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/GRP123-4.003+noeq.in")
% 
%------------------------------------------------------------------------------