TSTP Solution File: GRP128-4.003 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP128-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 : art10.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/GRP128-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,0,36,0,0)
% 
% 
% START OF PROOF
% 19 [] product(e_2,X,Y) | product(e_3,X,Y) | product(e_1,X,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).
% 32 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 33 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 34 [] -product(U,X,Z) | -product(X,Y,Z) | product(U,Y,X).
% 35 [] -product(X,Z,U) | -product(X,Y,Z) | product(Z,Y,U).
% 38 [hyper:19,21,21] product(e_1,e_1,e_1) | product(e_2,e_1,e_1) | product(e_3,e_1,e_1).
% 47 [hyper:19,22,21] product(e_1,e_2,e_1) | product(e_2,e_2,e_1) | product(e_3,e_2,e_1).
% 48 [hyper:19,22,22] product(e_1,e_2,e_2) | product(e_2,e_2,e_2) | product(e_3,e_2,e_2).
% 50 [hyper:19,22,21] product(e_2,e_1,e_2) | product(e_3,e_1,e_2) | product(e_1,e_1,e_2).
% 94 [hyper:35,38,38] product(e_1,e_1,e_1) | product(e_3,e_1,e_1).
% 133 [hyper:35,94,94] product(e_1,e_1,e_1).
% 193 [hyper:32,47,133,cut:24] product(e_3,e_2,e_1) | product(e_2,e_2,e_1).
% 237 [hyper:34,193,193] product(e_2,e_2,e_2) | product(e_3,e_2,e_1).
% 343 [hyper:31,237,193,cut:24] product(e_3,e_2,e_1).
% 368 [hyper:35,48,48] product(e_2,e_2,e_2) | product(e_3,e_2,e_2).
% 431 [hyper:35,368,368] product(e_2,e_2,e_2).
% 482 [hyper:31,50,133,cut:24] product(e_2,e_1,e_2) | product(e_3,e_1,e_2).
% 521 [hyper:32,482,431,cut:26] product(e_3,e_1,e_2).
% 589 [hyper:35,521,343] product(e_1,e_2,e_2).
% 623 [hyper:33,589,431,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:    39
%  derived clauses:   1154
%  kept clauses:      58
%  kept size sum:     551
%  kept mid-nuclei:   506
%  kept new demods:   0
%  forw unit-subs:    221
%  forw double-subs: 176
%  forw overdouble-subs: 74
%  backward subs:     18
%  fast unit cutoff:  22
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           379
%  length fails:    0
%  strength fails:  121
%  predlist fails:  34
%  aux str. fails:  0
%  by-lit fails:    143
%  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/GRP128-4.003+noeq.in")
% 
%------------------------------------------------------------------------------