%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP123-3.003 : TPTP v3.4.2. Released v1.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art08.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-3.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 11)
% (binary-unit 10 #f 1 11)
% (binary-double 16 #f 1 11)
% (binary 54 #t 1 11)
% (binary-order 27 #f 1 11)
% (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(32,40,1,64,0,1)
% 
% 
% START OF PROOF
% 49 [] group_element(e_1).
% 50 [] group_element(e_2).
% 51 [] group_element(e_3).
% 52 [] -equalish(e_1,e_2).
% 53 [] -equalish(e_1,e_3).
% 54 [] -equalish(e_2,e_1).
% 56 [] -equalish(e_3,e_1).
% 57 [] -equalish(e_3,e_2).
% 58 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 60 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 61 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 62 [] product(X,X,X).
% 63 [] -product(W,Y,X) | -product(W,V,U) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 70 [hyper:58,50,49] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 74 [hyper:58,51,49] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 904 [hyper:60,70,62,cut:54] product(e_2,e_1,e_3) | product(e_2,e_1,e_1).
% 1001 [hyper:61,904,62,cut:52] product(e_2,e_1,e_3).
% 1480 [hyper:60,74,62,cut:56] product(e_3,e_1,e_1) | product(e_3,e_1,e_2).
% 1595 [hyper:61,1480,62,cut:53] product(e_3,e_1,e_2).
% 1628 [hyper:63,1595,1001,62,cut:62] equalish(e_3,e_2).
% 1740 [hyper:57,1628] 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 11
% clause depth limited to 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    50
%  derived clauses:   2637
%  kept clauses:      79
%  kept size sum:     548
%  kept mid-nuclei:   1570
%  kept new demods:   0
%  forw unit-subs:    510
%  forw double-subs: 202
%  forw overdouble-subs: 225
%  backward subs:     18
%  fast unit cutoff:  302
%  full unit cutoff:  0
%  dbl  unit cutoff:  4
%  real runtime  :  0.7
%  process. runtime:  0.6
% specific non-discr-tree subsumption statistics: 
%  tried:           2061
%  length fails:    21
%  strength fails:  441
%  predlist fails:  542
%  aux str. fails:  0
%  by-lit fails:    639
%  full subs tried: 181
%  full subs fail:  146
% 
% ; 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-3.003+noeq.in")
% 
%------------------------------------------------------------------------------