%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP127-3.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 12:56:12 EDT 2022
% Result : Unsatisfiable 1.72s 1.95s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 30
% Syntax : Number of clauses : 59 ( 28 unt; 24 nHn; 58 RR)
% Number of literals : 133 ( 0 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ group_element(A)
| cycle(A,e_0)
| cycle(A,e_1)
| cycle(A,e_2)
| cycle(A,e_3) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(3,axiom,
( ~ cycle(A,B)
| ~ cycle(C,D)
| ~ next(A,C)
| ~ greater(B,e_0)
| ~ next(D,E)
| e_qualish(B,E) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(4,axiom,
( ~ cycle(A,B)
| ~ cycle(C,e_0)
| ~ cycle(D,E)
| ~ next(C,D)
| ~ greater(C,A)
| ~ greater(B,E) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(5,axiom,
( ~ cycle(A,e_0)
| ~ product(A,e_1,B)
| ~ greater(B,A) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(6,axiom,
( ~ cycle(A,B)
| ~ product(A,e_1,C)
| ~ greater(B,e_0)
| ~ next(A,D)
| e_qualish(C,D) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(7,axiom,
~ e_qualish(e_1,e_2),
file('GRP127-3.004.p',unknown),
[] ).
cnf(8,axiom,
~ e_qualish(e_1,e_3),
file('GRP127-3.004.p',unknown),
[] ).
cnf(10,axiom,
~ e_qualish(e_2,e_1),
file('GRP127-3.004.p',unknown),
[] ).
cnf(11,axiom,
~ e_qualish(e_2,e_3),
file('GRP127-3.004.p',unknown),
[] ).
cnf(13,axiom,
~ e_qualish(e_3,e_1),
file('GRP127-3.004.p',unknown),
[] ).
cnf(14,axiom,
~ e_qualish(e_3,e_2),
file('GRP127-3.004.p',unknown),
[] ).
cnf(18,axiom,
~ e_qualish(e_4,e_3),
file('GRP127-3.004.p',unknown),
[] ).
cnf(19,axiom,
( ~ group_element(A)
| ~ group_element(B)
| product(A,B,e_1)
| product(A,B,e_2)
| product(A,B,e_3)
| product(A,B,e_4) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(21,axiom,
( ~ product(A,B,C)
| ~ product(A,D,C)
| e_qualish(B,D) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(22,axiom,
( ~ product(A,B,C)
| ~ product(D,B,C)
| e_qualish(A,D) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(23,axiom,
( ~ product(A,B,C)
| ~ product(C,A,D)
| product(D,A,B) ),
file('GRP127-3.004.p',unknown),
[] ).
cnf(40,axiom,
next(e_0,e_1),
file('GRP127-3.004.p',unknown),
[] ).
cnf(41,axiom,
next(e_1,e_2),
file('GRP127-3.004.p',unknown),
[] ).
cnf(42,axiom,
next(e_2,e_3),
file('GRP127-3.004.p',unknown),
[] ).
cnf(43,axiom,
next(e_3,e_4),
file('GRP127-3.004.p',unknown),
[] ).
cnf(44,axiom,
greater(e_1,e_0),
file('GRP127-3.004.p',unknown),
[] ).
cnf(45,axiom,
greater(e_2,e_0),
file('GRP127-3.004.p',unknown),
[] ).
cnf(46,axiom,
greater(e_3,e_0),
file('GRP127-3.004.p',unknown),
[] ).
cnf(51,axiom,
greater(e_3,e_2),
file('GRP127-3.004.p',unknown),
[] ).
cnf(52,axiom,
greater(e_4,e_2),
file('GRP127-3.004.p',unknown),
[] ).
cnf(54,axiom,
cycle(e_4,e_0),
file('GRP127-3.004.p',unknown),
[] ).
cnf(55,axiom,
group_element(e_1),
file('GRP127-3.004.p',unknown),
[] ).
cnf(56,axiom,
group_element(e_2),
file('GRP127-3.004.p',unknown),
[] ).
cnf(57,axiom,
group_element(e_3),
file('GRP127-3.004.p',unknown),
[] ).
cnf(59,axiom,
product(A,A,A),
file('GRP127-3.004.p',unknown),
[] ).
cnf(61,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3)
| product(e_1,e_2,e_4) ),
inference(hyper,[status(thm)],[56,19,55]),
[iquote('hyper,56,19,55')] ).
cnf(62,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference(hyper,[status(thm)],[56,19,55]),
[iquote('hyper,56,19,55')] ).
cnf(63,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_1)
| cycle(e_2,e_2)
| cycle(e_2,e_3) ),
inference(hyper,[status(thm)],[56,2]),
[iquote('hyper,56,2')] ).
cnf(64,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3)
| product(e_2,e_3,e_4) ),
inference(hyper,[status(thm)],[57,19,56]),
[iquote('hyper,57,19,56')] ).
cnf(65,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(hyper,[status(thm)],[57,19,55]),
[iquote('hyper,57,19,55')] ).
cnf(68,plain,
( cycle(e_3,e_0)
| cycle(e_3,e_1)
| cycle(e_3,e_2)
| cycle(e_3,e_3) ),
inference(hyper,[status(thm)],[57,2]),
[iquote('hyper,57,2')] ).
cnf(84,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_3)
| product(e_1,e_2,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[61,21,59]),7]),
[iquote('hyper,61,21,59,unit_del,7')] ).
cnf(93,plain,
( cycle(e_3,e_0)
| cycle(e_3,e_1)
| cycle(e_3,e_3) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[68,3,54,43,45,40]),10]),
[iquote('hyper,68,3,54,43,45,40,unit_del,10')] ).
cnf(106,plain,
( cycle(e_3,e_0)
| cycle(e_3,e_1) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[93,3,54,43,46,40]),13]),
[iquote('hyper,93,3,54,43,46,40,unit_del,13')] ).
cnf(107,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[62,22,59]),7]),
[iquote('hyper,62,22,59,unit_del,7')] ).
cnf(115,plain,
( cycle(e_3,e_1)
| cycle(e_2,e_0)
| cycle(e_2,e_1)
| cycle(e_2,e_2) ),
inference(hyper,[status(thm)],[106,4,63,54,43,51,46]),
[iquote('hyper,106,4,63,54,43,51,46')] ).
cnf(120,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[84,22,59]),10]),
[iquote('hyper,84,22,59,unit_del,10')] ).
cnf(122,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[107,21,59]),10]),
[iquote('hyper,107,21,59,unit_del,10')] ).
cnf(131,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3)
| product(e_2,e_3,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[64,21,59]),11]),
[iquote('hyper,64,21,59,unit_del,11')] ).
cnf(138,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_1)
| cycle(e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[115,3,63,42,46,41]),14])])])]),
[iquote('hyper,115,3,63,42,46,41,unit_del,14,factor_simp,factor_simp,factor_simp')] ).
cnf(142,plain,
( cycle(e_3,e_1)
| cycle(e_2,e_0)
| cycle(e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[115,4,106,54,43,51,44])]),
[iquote('hyper,115,4,106,54,43,51,44,factor_simp')] ).
cnf(150,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[142,3,138,42,44,41]),7])])]),
[iquote('hyper,142,3,138,42,44,41,unit_del,7,factor_simp,factor_simp')] ).
cnf(156,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[65,21,59]),8]),
[iquote('hyper,65,21,59,unit_del,8')] ).
cnf(161,plain,
( cycle(e_2,e_2)
| product(e_2,e_1,e_3) ),
inference(hyper,[status(thm)],[150,5,122,52]),
[iquote('hyper,150,5,122,52')] ).
cnf(166,plain,
product(e_2,e_1,e_3),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[161,6,122,45,42]),18])]),
[iquote('hyper,161,6,122,45,42,unit_del,18,factor_simp')] ).
cnf(177,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[131,22,59]),14]),
[iquote('hyper,131,22,59,unit_del,14')] ).
cnf(191,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[156,22,59]),13]),
[iquote('hyper,156,22,59,unit_del,13')] ).
cnf(194,plain,
( product(e_1,e_3,e_4)
| product(e_3,e_1,e_3) ),
inference(hyper,[status(thm)],[191,23,166]),
[iquote('hyper,191,23,166')] ).
cnf(201,plain,
product(e_1,e_3,e_4),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[194,22,166]),11]),
[iquote('hyper,194,22,166,unit_del,11')] ).
cnf(202,plain,
product(e_2,e_3,e_1),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[201,22,177]),10]),
[iquote('hyper,201,22,177,unit_del,10')] ).
cnf(203,plain,
product(e_1,e_2,e_3),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[201,21,120]),11]),
[iquote('hyper,201,21,120,unit_del,11')] ).
cnf(208,plain,
product(e_3,e_2,e_3),
inference(hyper,[status(thm)],[203,23,202]),
[iquote('hyper,203,23,202')] ).
cnf(211,plain,
e_qualish(e_1,e_3),
inference(hyper,[status(thm)],[208,22,203]),
[iquote('hyper,208,22,203')] ).
cnf(212,plain,
$false,
inference(binary,[status(thm)],[211,8]),
[iquote('binary,211.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP127-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 05:01:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.72/1.93 ----- Otter 3.3f, August 2004 -----
% 1.72/1.93 The process was started by sandbox on n010.cluster.edu,
% 1.72/1.93 Wed Jul 27 05:01:10 2022
% 1.72/1.93 The command was "./otter". The process ID is 796.
% 1.72/1.93
% 1.72/1.93 set(prolog_style_variables).
% 1.72/1.93 set(auto).
% 1.72/1.93 dependent: set(auto1).
% 1.72/1.93 dependent: set(process_input).
% 1.72/1.93 dependent: clear(print_kept).
% 1.72/1.93 dependent: clear(print_new_demod).
% 1.72/1.93 dependent: clear(print_back_demod).
% 1.72/1.93 dependent: clear(print_back_sub).
% 1.72/1.93 dependent: set(control_memory).
% 1.72/1.93 dependent: assign(max_mem, 12000).
% 1.72/1.93 dependent: assign(pick_given_ratio, 4).
% 1.72/1.93 dependent: assign(stats_level, 1).
% 1.72/1.93 dependent: assign(max_seconds, 10800).
% 1.72/1.93 clear(print_given).
% 1.72/1.93
% 1.72/1.93 list(usable).
% 1.72/1.93 0 [] next(e_0,e_1).
% 1.72/1.93 0 [] next(e_1,e_2).
% 1.72/1.93 0 [] next(e_2,e_3).
% 1.72/1.93 0 [] next(e_3,e_4).
% 1.72/1.93 0 [] greater(e_1,e_0).
% 1.72/1.93 0 [] greater(e_2,e_0).
% 1.72/1.93 0 [] greater(e_3,e_0).
% 1.72/1.93 0 [] greater(e_4,e_0).
% 1.72/1.93 0 [] greater(e_2,e_1).
% 1.72/1.93 0 [] greater(e_3,e_1).
% 1.72/1.93 0 [] greater(e_4,e_1).
% 1.72/1.93 0 [] greater(e_3,e_2).
% 1.72/1.93 0 [] greater(e_4,e_2).
% 1.72/1.93 0 [] greater(e_4,e_3).
% 1.72/1.93 0 [] -cycle(X,Y)| -cycle(X,Z)|e_qualish(Y,Z).
% 1.72/1.93 0 [] -group_element(X)|cycle(X,e_0)|cycle(X,e_1)|cycle(X,e_2)|cycle(X,e_3).
% 1.72/1.93 0 [] cycle(e_4,e_0).
% 1.72/1.93 0 [] -cycle(X,Y)| -cycle(W,Z)| -next(X,W)| -greater(Y,e_0)| -next(Z,Z1)|e_qualish(Y,Z1).
% 1.72/1.93 0 [] -cycle(X,Z1)| -cycle(Y,e_0)| -cycle(W,Z2)| -next(Y,W)| -greater(Y,X)| -greater(Z1,Z2).
% 1.72/1.93 0 [] -cycle(X,e_0)| -product(X,e_1,Y)| -greater(Y,X).
% 1.72/1.93 0 [] -cycle(X,Y)| -product(X,e_1,Z)| -greater(Y,e_0)| -next(X,X1)|e_qualish(Z,X1).
% 1.72/1.93 0 [] group_element(e_1).
% 1.72/1.93 0 [] group_element(e_2).
% 1.72/1.93 0 [] group_element(e_3).
% 1.72/1.93 0 [] group_element(e_4).
% 1.72/1.93 0 [] -e_qualish(e_1,e_2).
% 1.72/1.93 0 [] -e_qualish(e_1,e_3).
% 1.72/1.93 0 [] -e_qualish(e_1,e_4).
% 1.72/1.93 0 [] -e_qualish(e_2,e_1).
% 1.72/1.93 0 [] -e_qualish(e_2,e_3).
% 1.72/1.93 0 [] -e_qualish(e_2,e_4).
% 1.72/1.93 0 [] -e_qualish(e_3,e_1).
% 1.72/1.93 0 [] -e_qualish(e_3,e_2).
% 1.72/1.93 0 [] -e_qualish(e_3,e_4).
% 1.72/1.93 0 [] -e_qualish(e_4,e_1).
% 1.72/1.93 0 [] -e_qualish(e_4,e_2).
% 1.72/1.93 0 [] -e_qualish(e_4,e_3).
% 1.72/1.93 0 [] -group_element(X)| -group_element(Y)|product(X,Y,e_1)|product(X,Y,e_2)|product(X,Y,e_3)|product(X,Y,e_4).
% 1.72/1.93 0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.72/1.93 0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.72/1.93 0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.72/1.93 0 [] product(X,X,X).
% 1.72/1.93 0 [] -product(Y,X,Z1)| -product(Z1,Y,Z2)|product(Z2,Y,X).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.72/1.93
% 1.72/1.93 This is a non-Horn set without equality. The strategy will
% 1.72/1.93 be ordered hyper_res, unit deletion, and factoring, with
% 1.72/1.93 satellites in sos and with nuclei in usable.
% 1.72/1.93
% 1.72/1.93 dependent: set(hyper_res).
% 1.72/1.93 dependent: set(factor).
% 1.72/1.93 dependent: set(unit_deletion).
% 1.72/1.93
% 1.72/1.93 ------------> process usable:
% 1.72/1.93 ** KEPT (pick-wt=9): 1 [] -cycle(A,B)| -cycle(A,C)|e_qualish(B,C).
% 1.72/1.93 ** KEPT (pick-wt=14): 2 [] -group_element(A)|cycle(A,e_0)|cycle(A,e_1)|cycle(A,e_2)|cycle(A,e_3).
% 1.72/1.93 ** KEPT (pick-wt=18): 3 [] -cycle(A,B)| -cycle(C,D)| -next(A,C)| -greater(B,e_0)| -next(D,E)|e_qualish(B,E).
% 1.72/1.93 ** KEPT (pick-wt=18): 4 [] -cycle(A,B)| -cycle(C,e_0)| -cycle(D,E)| -next(C,D)| -greater(C,A)| -greater(B,E).
% 1.72/1.93 ** KEPT (pick-wt=10): 5 [] -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 1.72/1.93 ** KEPT (pick-wt=16): 6 [] -cycle(A,B)| -product(A,e_1,C)| -greater(B,e_0)| -next(A,D)|e_qualish(C,D).
% 1.72/1.93 ** KEPT (pick-wt=3): 7 [] -e_qualish(e_1,e_2).
% 1.72/1.93 ** KEPT (pick-wt=3): 8 [] -e_qualish(e_1,e_3).
% 1.72/1.93 ** KEPT (pick-wt=3): 9 [] -e_qualish(e_1,e_4).
% 1.72/1.93 ** KEPT (pick-wt=3): 10 [] -e_qualish(e_2,e_1).
% 1.72/1.93 ** KEPT (pick-wt=3): 11 [] -e_qualish(e_2,e_3).
% 1.72/1.93 ** KEPT (pick-wt=3): 12 [] -e_qualish(e_2,e_4).
% 1.72/1.93 ** KEPT (pick-wt=3): 13 [] -e_qualish(e_3,e_1).
% 1.72/1.93 ** KEPT (pick-wt=3): 14 [] -e_qualish(e_3,e_2).
% 1.72/1.93 ** KEPT (pick-wt=3): 15 [] -e_qualish(e_3,e_4).
% 1.72/1.93 ** KEPT (pick-wt=3): 16 [] -e_qualish(e_4,e_1).
% 1.72/1.93 ** KEPT (pick-wt=3): 17 [] -e_qualish(e_4,e_2).
% 1.72/1.93 ** KEPT (pick-wt=3): 18 [] -e_qualish(e_4,e_3).
% 1.72/1.93 ** KEPT (pick-wt=20): 19 [] -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3)|product(A,B,e_4).
% 1.72/1.93 ** KEPT (pick-wt=11): 20 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.72/1.93 ** KEPT (pick-wt=11): 21 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.72/1.93 ** KEPT (pick-wt=11): 22 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.72/1.93 ** KEPT (pick-wt=12): 23 [] -product(A,B,C)| -product(C,A,D)|product(D,A,B).
% 1.72/1.95
% 1.72/1.95 ------------> process sos:
% 1.72/1.95 ** KEPT (pick-wt=3): 40 [] next(e_0,e_1).
% 1.72/1.95 ** KEPT (pick-wt=3): 41 [] next(e_1,e_2).
% 1.72/1.95 ** KEPT (pick-wt=3): 42 [] next(e_2,e_3).
% 1.72/1.95 ** KEPT (pick-wt=3): 43 [] next(e_3,e_4).
% 1.72/1.95 ** KEPT (pick-wt=3): 44 [] greater(e_1,e_0).
% 1.72/1.95 ** KEPT (pick-wt=3): 45 [] greater(e_2,e_0).
% 1.72/1.95 ** KEPT (pick-wt=3): 46 [] greater(e_3,e_0).
% 1.72/1.95 ** KEPT (pick-wt=3): 47 [] greater(e_4,e_0).
% 1.72/1.95 ** KEPT (pick-wt=3): 48 [] greater(e_2,e_1).
% 1.72/1.95 ** KEPT (pick-wt=3): 49 [] greater(e_3,e_1).
% 1.72/1.95 ** KEPT (pick-wt=3): 50 [] greater(e_4,e_1).
% 1.72/1.95 ** KEPT (pick-wt=3): 51 [] greater(e_3,e_2).
% 1.72/1.95 ** KEPT (pick-wt=3): 52 [] greater(e_4,e_2).
% 1.72/1.95 ** KEPT (pick-wt=3): 53 [] greater(e_4,e_3).
% 1.72/1.95 ** KEPT (pick-wt=3): 54 [] cycle(e_4,e_0).
% 1.72/1.95 ** KEPT (pick-wt=2): 55 [] group_element(e_1).
% 1.72/1.95 ** KEPT (pick-wt=2): 56 [] group_element(e_2).
% 1.72/1.95 ** KEPT (pick-wt=2): 57 [] group_element(e_3).
% 1.72/1.95 ** KEPT (pick-wt=2): 58 [] group_element(e_4).
% 1.72/1.95 ** KEPT (pick-wt=4): 59 [] product(A,A,A).
% 1.72/1.95
% 1.72/1.95 ======= end of input processing =======
% 1.72/1.95
% 1.72/1.95 =========== start of search ===========
% 1.72/1.95
% 1.72/1.95 -------- PROOF --------
% 1.72/1.95
% 1.72/1.95 ----> UNIT CONFLICT at 0.02 sec ----> 212 [binary,211.1,8.1] $F.
% 1.72/1.95
% 1.72/1.95 Length of proof is 28. Level of proof is 13.
% 1.72/1.95
% 1.72/1.95 ---------------- PROOF ----------------
% 1.72/1.95 % SZS status Unsatisfiable
% 1.72/1.95 % SZS output start Refutation
% See solution above
% 1.72/1.95 ------------ end of proof -------------
% 1.72/1.95
% 1.72/1.95
% 1.72/1.95 Search stopped by max_proofs option.
% 1.72/1.95
% 1.72/1.95
% 1.72/1.95 Search stopped by max_proofs option.
% 1.72/1.95
% 1.72/1.95 ============ end of search ============
% 1.72/1.95
% 1.72/1.95 -------------- statistics -------------
% 1.72/1.95 clauses given 59
% 1.72/1.95 clauses generated 1169
% 1.72/1.95 clauses kept 211
% 1.72/1.95 clauses forward subsumed 1000
% 1.72/1.95 clauses back subsumed 131
% 1.72/1.95 Kbytes malloced 976
% 1.72/1.95
% 1.72/1.95 ----------- times (seconds) -----------
% 1.72/1.95 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.72/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.95 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.95
% 1.72/1.95 That finishes the proof of the theorem.
% 1.72/1.95
% 1.72/1.95 Process 796 finished Wed Jul 27 05:01:11 2022
% 1.72/1.95 Otter interrupted
% 1.72/1.95 PROOF FOUND
%------------------------------------------------------------------------------