%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP123-6.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 : art09.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-6.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(20,40,0,40,0,0)
% 
% 
% START OF PROOF
% 21 [] group_element(e_1).
% 22 [] group_element(e_2).
% 23 [] group_element(e_3).
% 24 [] -equalish(e_1,e_2).
% 25 [] -equalish(e_1,e_3).
% 26 [] -equalish(e_2,e_1).
% 28 [] -equalish(e_3,e_1).
% 30 [] product1(X,Y,e_2) | product1(X,Y,e_3) | product1(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 32 [] -product1(X,U,Z) | -product1(X,Y,Z) | equalish(Y,U).
% 33 [] -product1(U,Y,Z) | -product1(X,Y,Z) | equalish(X,U).
% 34 [] product1(X,X,X).
% 36 [] -product2(X,Y,U) | -product2(X,Y,Z) | equalish(Z,U).
% 39 [] product2(X,X,X).
% 40 [] -product1(Z,Y,U) | -product1(X,Y,Z) | product2(U,X,Y).
% 46 [hyper:30,22,21] product1(e_2,e_1,e_1) | product1(e_2,e_1,e_2) | product1(e_2,e_1,e_3).
% 54 [hyper:30,23,21] product1(e_3,e_1,e_1) | product1(e_3,e_1,e_2) | product1(e_3,e_1,e_3).
% 133 [hyper:32,46,34,cut:26] product1(e_2,e_1,e_3) | product1(e_2,e_1,e_1).
% 165 [hyper:33,133,34,cut:24] product1(e_2,e_1,e_3).
% 397 [hyper:32,54,34,cut:28] product1(e_3,e_1,e_1) | product1(e_3,e_1,e_2).
% 428 [hyper:33,397,34,cut:25] product1(e_3,e_1,e_2).
% 477 [hyper:40,428,165] product2(e_2,e_2,e_1).
% 495 [hyper:36,477,39,cut:26] 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:    38
%  derived clauses:   939
%  kept clauses:      54
%  kept size sum:     511
%  kept mid-nuclei:   380
%  kept new demods:   0
%  forw unit-subs:    242
%  forw double-subs: 134
%  forw overdouble-subs: 108
%  backward subs:     17
%  fast unit cutoff:  110
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           320
%  length fails:    0
%  strength fails:  136
%  predlist fails:  26
%  aux str. fails:  0
%  by-lit fails:    46
%  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/GRP123-6.003+noeq.in")
% 
%------------------------------------------------------------------------------