%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP130-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 : art01.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/GRP130-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).
% 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).
% 25 [] -equalish(e_1,e_3).
% 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).
% 34 [] -product(Z,U,X) | -product(X,Y,Z) | product(X,U,Y).
% 35 [] -product(U,Y,X) | -product(X,Y,Z) | product(X,Z,U).
% 36 [] -product(X,Z,U) | -product(X,Y,Z) | product(U,Y,X).
% 41 [hyper:20,21,21] product(e_1,e_1,e_1) | product(e_1,e_2,e_1) | product(e_1,e_3,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).
% 447 [hyper:35,41,41] product(e_1,e_1,e_1) | product(e_1,e_3,e_1).
% 495 [hyper:35,447,447] product(e_1,e_1,e_1).
% 561 [hyper:32,47,495,cut:24] product(e_3,e_2,e_1) | product(e_2,e_2,e_1).
% 852 [hyper:31,50,495,cut:24] product(e_2,e_1,e_2) | product(e_3,e_1,e_2).
% 889 [hyper:34,852,852] product(e_2,e_1,e_1) | product(e_3,e_1,e_2).
% 963 [hyper:31,889,852,cut:26] product(e_3,e_1,e_2).
% 990 [hyper:36,963,561] product(e_1,e_1,e_3) | product(e_2,e_2,e_1).
% 995 [hyper:32,963,48,cut:26] product(e_2,e_2,e_2) | product(e_1,e_2,e_2).
% 1141 [hyper:31,990,495,cut:25] product(e_2,e_2,e_1).
% 1187 [hyper:34,995,1141] product(e_2,e_2,e_2).
% 1199 [hyper:31,1187,1141,cut:24] 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: 51
% derived clauses: 2945
% kept clauses: 127
% kept size sum: 1386
% kept mid-nuclei: 1000
% kept new demods: 0
% forw unit-subs: 668
% forw double-subs: 493
% forw overdouble-subs: 564
% backward subs: 40
% fast unit cutoff: 307
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 1929
% length fails: 72
% strength fails: 266
% predlist fails: 288
% aux str. fails: 0
% by-lit fails: 557
% 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/GRP130-4.003+noeq.in")
%
%------------------------------------------------------------------------------