TSTP Solution File: GRP124-3.004 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP124-3.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:08 EDT 2022
% Result : Unsatisfiable 1.75s 1.94s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 30
% Syntax : Number of clauses : 58 ( 26 unt; 24 nHn; 57 RR)
% Number of literals : 137 ( 0 equ; 39 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 : 37 ( 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('GRP124-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('GRP124-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('GRP124-3.004.p',unknown),
[] ).
cnf(5,axiom,
( ~ cycle(A,e_0)
| ~ product(A,e_1,B)
| ~ greater(B,A) ),
file('GRP124-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('GRP124-3.004.p',unknown),
[] ).
cnf(7,axiom,
~ e_qualish(e_1,e_2),
file('GRP124-3.004.p',unknown),
[] ).
cnf(8,axiom,
~ e_qualish(e_1,e_3),
file('GRP124-3.004.p',unknown),
[] ).
cnf(10,axiom,
~ e_qualish(e_2,e_1),
file('GRP124-3.004.p',unknown),
[] ).
cnf(11,axiom,
~ e_qualish(e_2,e_3),
file('GRP124-3.004.p',unknown),
[] ).
cnf(13,axiom,
~ e_qualish(e_3,e_1),
file('GRP124-3.004.p',unknown),
[] ).
cnf(14,axiom,
~ e_qualish(e_3,e_2),
file('GRP124-3.004.p',unknown),
[] ).
cnf(18,axiom,
~ e_qualish(e_4,e_3),
file('GRP124-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('GRP124-3.004.p',unknown),
[] ).
cnf(21,axiom,
( ~ product(A,B,C)
| ~ product(A,D,C)
| e_qualish(B,D) ),
file('GRP124-3.004.p',unknown),
[] ).
cnf(22,axiom,
( ~ product(A,B,C)
| ~ product(D,B,C)
| e_qualish(A,D) ),
file('GRP124-3.004.p',unknown),
[] ).
cnf(24,axiom,
( ~ product(A,B,C)
| ~ product(D,E,C)
| ~ product(F,A,B)
| ~ product(F,D,E)
| e_qualish(B,E) ),
file('GRP124-3.004.p',unknown),
[] ).
cnf(43,plain,
( ~ product(A,B,C)
| ~ product(C,C,C)
| ~ product(C,A,B)
| e_qualish(B,C) ),
inference(factor,[status(thm)],[24]),
[iquote('factor,24.2.4')] ).
cnf(49,axiom,
next(e_0,e_1),
file('GRP124-3.004.p',unknown),
[] ).
cnf(50,axiom,
next(e_1,e_2),
file('GRP124-3.004.p',unknown),
[] ).
cnf(51,axiom,
next(e_2,e_3),
file('GRP124-3.004.p',unknown),
[] ).
cnf(52,axiom,
next(e_3,e_4),
file('GRP124-3.004.p',unknown),
[] ).
cnf(53,axiom,
greater(e_1,e_0),
file('GRP124-3.004.p',unknown),
[] ).
cnf(54,axiom,
greater(e_2,e_0),
file('GRP124-3.004.p',unknown),
[] ).
cnf(55,axiom,
greater(e_3,e_0),
file('GRP124-3.004.p',unknown),
[] ).
cnf(60,axiom,
greater(e_3,e_2),
file('GRP124-3.004.p',unknown),
[] ).
cnf(61,axiom,
greater(e_4,e_2),
file('GRP124-3.004.p',unknown),
[] ).
cnf(63,axiom,
cycle(e_4,e_0),
file('GRP124-3.004.p',unknown),
[] ).
cnf(64,axiom,
group_element(e_1),
file('GRP124-3.004.p',unknown),
[] ).
cnf(65,axiom,
group_element(e_2),
file('GRP124-3.004.p',unknown),
[] ).
cnf(66,axiom,
group_element(e_3),
file('GRP124-3.004.p',unknown),
[] ).
cnf(68,axiom,
product(A,A,A),
file('GRP124-3.004.p',unknown),
[] ).
cnf(70,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)],[65,19,64]),
[iquote('hyper,65,19,64')] ).
cnf(71,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)],[65,19,64]),
[iquote('hyper,65,19,64')] ).
cnf(72,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)],[65,2]),
[iquote('hyper,65,2')] ).
cnf(73,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)],[66,19,65]),
[iquote('hyper,66,19,65')] ).
cnf(74,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)],[66,19,64]),
[iquote('hyper,66,19,64')] ).
cnf(77,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)],[66,2]),
[iquote('hyper,66,2')] ).
cnf(92,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)],[70,21,68]),7]),
[iquote('hyper,70,21,68,unit_del,7')] ).
cnf(101,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)],[77,3,63,52,54,49]),10]),
[iquote('hyper,77,3,63,52,54,49,unit_del,10')] ).
cnf(114,plain,
( cycle(e_3,e_0)
| cycle(e_3,e_1) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[101,3,63,52,55,49]),13]),
[iquote('hyper,101,3,63,52,55,49,unit_del,13')] ).
cnf(115,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)],[71,22,68]),7]),
[iquote('hyper,71,22,68,unit_del,7')] ).
cnf(122,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)],[114,4,72,63,52,60,55]),
[iquote('hyper,114,4,72,63,52,60,55')] ).
cnf(127,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[92,22,68]),10]),
[iquote('hyper,92,22,68,unit_del,10')] ).
cnf(128,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[115,21,68]),10]),
[iquote('hyper,115,21,68,unit_del,10')] ).
cnf(135,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)],[73,21,68]),11]),
[iquote('hyper,73,21,68,unit_del,11')] ).
cnf(142,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)],[122,3,72,51,55,50]),14])])])]),
[iquote('hyper,122,3,72,51,55,50,unit_del,14,factor_simp,factor_simp,factor_simp')] ).
cnf(146,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)],[122,4,114,63,52,60,53])]),
[iquote('hyper,122,4,114,63,52,60,53,factor_simp')] ).
cnf(154,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)],[146,3,142,51,53,50]),7])])]),
[iquote('hyper,146,3,142,51,53,50,unit_del,7,factor_simp,factor_simp')] ).
cnf(159,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)],[74,21,68]),8]),
[iquote('hyper,74,21,68,unit_del,8')] ).
cnf(163,plain,
( cycle(e_2,e_2)
| product(e_2,e_1,e_3) ),
inference(hyper,[status(thm)],[154,5,128,61]),
[iquote('hyper,154,5,128,61')] ).
cnf(168,plain,
product(e_2,e_1,e_3),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[163,6,128,54,51]),18])]),
[iquote('hyper,163,6,128,54,51,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)],[135,22,68]),14]),
[iquote('hyper,135,22,68,unit_del,14')] ).
cnf(178,plain,
( product(e_2,e_3,e_4)
| product(e_1,e_2,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[177,43,68,127]),13]),
[iquote('hyper,177,43,68,127,unit_del,13')] ).
cnf(184,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[159,43,68,168]),14]),
[iquote('hyper,159,43,68,168,unit_del,14')] ).
cnf(190,plain,
product(e_1,e_3,e_4),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[184,22,68]),13]),
[iquote('hyper,184,22,68,unit_del,13')] ).
cnf(195,plain,
product(e_1,e_2,e_4),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[190,22,178]),10]),
[iquote('hyper,190,22,178,unit_del,10')] ).
cnf(202,plain,
e_qualish(e_3,e_2),
inference(hyper,[status(thm)],[195,21,190]),
[iquote('hyper,195,21,190')] ).
cnf(203,plain,
$false,
inference(binary,[status(thm)],[202,14]),
[iquote('binary,202.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP124-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 05:07:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox on n018.cluster.edu,
% 1.68/1.89 Wed Jul 27 05:07:46 2022
% 1.68/1.89 The command was "./otter". The process ID is 26053.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] next(e_0,e_1).
% 1.68/1.89 0 [] next(e_1,e_2).
% 1.68/1.89 0 [] next(e_2,e_3).
% 1.68/1.89 0 [] next(e_3,e_4).
% 1.68/1.89 0 [] greater(e_1,e_0).
% 1.68/1.89 0 [] greater(e_2,e_0).
% 1.68/1.89 0 [] greater(e_3,e_0).
% 1.68/1.89 0 [] greater(e_4,e_0).
% 1.68/1.89 0 [] greater(e_2,e_1).
% 1.68/1.89 0 [] greater(e_3,e_1).
% 1.68/1.89 0 [] greater(e_4,e_1).
% 1.68/1.89 0 [] greater(e_3,e_2).
% 1.68/1.89 0 [] greater(e_4,e_2).
% 1.68/1.89 0 [] greater(e_4,e_3).
% 1.68/1.89 0 [] -cycle(X,Y)| -cycle(X,Z)|e_qualish(Y,Z).
% 1.68/1.89 0 [] -group_element(X)|cycle(X,e_0)|cycle(X,e_1)|cycle(X,e_2)|cycle(X,e_3).
% 1.68/1.89 0 [] cycle(e_4,e_0).
% 1.68/1.89 0 [] -cycle(X,Y)| -cycle(W,Z)| -next(X,W)| -greater(Y,e_0)| -next(Z,Z1)|e_qualish(Y,Z1).
% 1.68/1.89 0 [] -cycle(X,Z1)| -cycle(Y,e_0)| -cycle(W,Z2)| -next(Y,W)| -greater(Y,X)| -greater(Z1,Z2).
% 1.68/1.89 0 [] -cycle(X,e_0)| -product(X,e_1,Y)| -greater(Y,X).
% 1.68/1.89 0 [] -cycle(X,Y)| -product(X,e_1,Z)| -greater(Y,e_0)| -next(X,X1)|e_qualish(Z,X1).
% 1.68/1.89 0 [] group_element(e_1).
% 1.68/1.89 0 [] group_element(e_2).
% 1.68/1.89 0 [] group_element(e_3).
% 1.68/1.89 0 [] group_element(e_4).
% 1.68/1.89 0 [] -e_qualish(e_1,e_2).
% 1.68/1.89 0 [] -e_qualish(e_1,e_3).
% 1.68/1.89 0 [] -e_qualish(e_1,e_4).
% 1.68/1.89 0 [] -e_qualish(e_2,e_1).
% 1.68/1.89 0 [] -e_qualish(e_2,e_3).
% 1.68/1.89 0 [] -e_qualish(e_2,e_4).
% 1.68/1.89 0 [] -e_qualish(e_3,e_1).
% 1.68/1.89 0 [] -e_qualish(e_3,e_2).
% 1.68/1.89 0 [] -e_qualish(e_3,e_4).
% 1.68/1.89 0 [] -e_qualish(e_4,e_1).
% 1.68/1.89 0 [] -e_qualish(e_4,e_2).
% 1.68/1.89 0 [] -e_qualish(e_4,e_3).
% 1.68/1.89 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.68/1.89 0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.68/1.89 0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.68/1.89 0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.68/1.89 0 [] product(X,X,X).
% 1.68/1.89 0 [] -product(X1,Y1,Z1)| -product(X2,Y2,Z1)| -product(Z2,X1,Y1)| -product(Z2,X2,Y2)|e_qualish(X1,X2).
% 1.68/1.89 0 [] -product(X1,Y1,Z1)| -product(X2,Y2,Z1)| -product(Z2,X1,Y1)| -product(Z2,X2,Y2)|e_qualish(Y1,Y2).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.68/1.89
% 1.68/1.89 This is a non-Horn set without equality. The strategy will
% 1.68/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.68/1.89 satellites in sos and with nuclei in usable.
% 1.68/1.89
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: set(factor).
% 1.68/1.89 dependent: set(unit_deletion).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=9): 1 [] -cycle(A,B)| -cycle(A,C)|e_qualish(B,C).
% 1.68/1.89 ** 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.68/1.89 ** 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.68/1.89 ** 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.68/1.89 ** KEPT (pick-wt=10): 5 [] -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 1.68/1.89 ** 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.68/1.89 ** KEPT (pick-wt=3): 7 [] -e_qualish(e_1,e_2).
% 1.68/1.89 ** KEPT (pick-wt=3): 8 [] -e_qualish(e_1,e_3).
% 1.68/1.89 ** KEPT (pick-wt=3): 9 [] -e_qualish(e_1,e_4).
% 1.68/1.89 ** KEPT (pick-wt=3): 10 [] -e_qualish(e_2,e_1).
% 1.68/1.89 ** KEPT (pick-wt=3): 11 [] -e_qualish(e_2,e_3).
% 1.68/1.89 ** KEPT (pick-wt=3): 12 [] -e_qualish(e_2,e_4).
% 1.68/1.89 ** KEPT (pick-wt=3): 13 [] -e_qualish(e_3,e_1).
% 1.68/1.89 ** KEPT (pick-wt=3): 14 [] -e_qualish(e_3,e_2).
% 1.68/1.89 ** KEPT (pick-wt=3): 15 [] -e_qualish(e_3,e_4).
% 1.68/1.89 ** KEPT (pick-wt=3): 16 [] -e_qualish(e_4,e_1).
% 1.68/1.89 ** KEPT (pick-wt=3): 17 [] -e_qualish(e_4,e_2).
% 1.68/1.89 ** KEPT (pick-wt=3): 18 [] -e_qualish(e_4,e_3).
% 1.68/1.89 ** 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.68/1.89 ** KEPT (pick-wt=11): 20 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.68/1.89 ** KEPT (pick-wt=11): 21 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.75/1.94 ** KEPT (pick-wt=11): 22 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.75/1.94 ** KEPT (pick-wt=19): 23 [] -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|e_qualish(A,D).
% 1.75/1.94 ** KEPT (pick-wt=19): 24 [] -product(A,B,C)| -product(D,E,C)| -product(F,A,B)| -product(F,D,E)|e_qualish(B,E).
% 1.75/1.94
% 1.75/1.94 ------------> process sos:
% 1.75/1.94 ** KEPT (pick-wt=3): 49 [] next(e_0,e_1).
% 1.75/1.94 ** KEPT (pick-wt=3): 50 [] next(e_1,e_2).
% 1.75/1.94 ** KEPT (pick-wt=3): 51 [] next(e_2,e_3).
% 1.75/1.94 ** KEPT (pick-wt=3): 52 [] next(e_3,e_4).
% 1.75/1.94 ** KEPT (pick-wt=3): 53 [] greater(e_1,e_0).
% 1.75/1.94 ** KEPT (pick-wt=3): 54 [] greater(e_2,e_0).
% 1.75/1.94 ** KEPT (pick-wt=3): 55 [] greater(e_3,e_0).
% 1.75/1.94 ** KEPT (pick-wt=3): 56 [] greater(e_4,e_0).
% 1.75/1.94 ** KEPT (pick-wt=3): 57 [] greater(e_2,e_1).
% 1.75/1.94 ** KEPT (pick-wt=3): 58 [] greater(e_3,e_1).
% 1.75/1.94 ** KEPT (pick-wt=3): 59 [] greater(e_4,e_1).
% 1.75/1.94 ** KEPT (pick-wt=3): 60 [] greater(e_3,e_2).
% 1.75/1.94 ** KEPT (pick-wt=3): 61 [] greater(e_4,e_2).
% 1.75/1.94 ** KEPT (pick-wt=3): 62 [] greater(e_4,e_3).
% 1.75/1.94 ** KEPT (pick-wt=3): 63 [] cycle(e_4,e_0).
% 1.75/1.94 ** KEPT (pick-wt=2): 64 [] group_element(e_1).
% 1.75/1.94 ** KEPT (pick-wt=2): 65 [] group_element(e_2).
% 1.75/1.94 ** KEPT (pick-wt=2): 66 [] group_element(e_3).
% 1.75/1.94 ** KEPT (pick-wt=2): 67 [] group_element(e_4).
% 1.75/1.94 ** KEPT (pick-wt=4): 68 [] product(A,A,A).
% 1.75/1.94
% 1.75/1.94 ======= end of input processing =======
% 1.75/1.94
% 1.75/1.94 =========== start of search ===========
% 1.75/1.94
% 1.75/1.94 -------- PROOF --------
% 1.75/1.94
% 1.75/1.94 ----> UNIT CONFLICT at 0.05 sec ----> 203 [binary,202.1,14.1] $F.
% 1.75/1.94
% 1.75/1.94 Length of proof is 27. Level of proof is 12.
% 1.75/1.94
% 1.75/1.94 ---------------- PROOF ----------------
% 1.75/1.94 % SZS status Unsatisfiable
% 1.75/1.94 % SZS output start Refutation
% See solution above
% 1.75/1.94 ------------ end of proof -------------
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94 ============ end of search ============
% 1.75/1.94
% 1.75/1.94 -------------- statistics -------------
% 1.75/1.94 clauses given 57
% 1.75/1.94 clauses generated 1457
% 1.75/1.94 clauses kept 202
% 1.75/1.94 clauses forward subsumed 1299
% 1.75/1.94 clauses back subsumed 113
% 1.75/1.94 Kbytes malloced 976
% 1.75/1.94
% 1.75/1.94 ----------- times (seconds) -----------
% 1.75/1.94 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.75/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.94 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.94
% 1.75/1.94 That finishes the proof of the theorem.
% 1.75/1.94
% 1.75/1.94 Process 26053 finished Wed Jul 27 05:07:47 2022
% 1.75/1.94 Otter interrupted
% 1.75/1.94 PROOF FOUND
%------------------------------------------------------------------------------