## TSTP Solution File: GRP125-1.003 by Gandalf---c-2.6

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP125-1.003 : TPTP v3.4.2. Released v1.2.0.
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art05.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

%------------------------------------------------------------------------------
%----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/GRP125-1.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(15,40,1,30,0,1)
%
%
% START OF PROOF
% 16 [] group_element(e_1).
% 17 [] group_element(e_2).
% 19 [] -equalish(e_1,e_2).
% 21 [] -equalish(e_2,e_1).
% 24 [] -equalish(e_3,e_2).
% 25 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 26 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 27 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 28 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 29 [] product(X,X,X).
% 30 [] -product(Y,X,U) | -product(X,Y,Z) | product(Z,U,X).
% 34 [hyper:25,17,16] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 36 [hyper:25,17,16] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 87 [hyper:27,34,29,cut:21] product(e_2,e_1,e_3) | product(e_2,e_1,e_1).
% 120 [hyper:27,36,29,cut:19] product(e_1,e_2,e_2) | product(e_1,e_2,e_3).
% 149 [hyper:28,87,29,cut:19] product(e_2,e_1,e_3).
% 192 [hyper:28,120,29,cut:21] product(e_1,e_2,e_3).
% 204 [hyper:30,192,149] product(e_3,e_3,e_2).
% 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:    24
%  derived clauses:   452
%  kept clauses:      24
%  kept size sum:     183
%  kept mid-nuclei:   193
%  kept new demods:   0
%  forw unit-subs:    112
%  forw double-subs: 70
%  forw overdouble-subs: 42
%  backward subs:     6
%  fast unit cutoff:  53
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics:
%  tried:           134
%  length fails:    0
%  strength fails:  60
%  predlist fails:  6
%  aux str. fails:  0
%  by-lit fails:    26
%  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/GRP125-1.003+noeq.in")
%
%------------------------------------------------------------------------------
```