TSTP Solution File: GRP130-3.003 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:29 EDT 2022
% Result : Unsatisfiable 2.06s 2.25s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 27
% Syntax : Number of clauses : 68 ( 26 unt; 32 nHn; 68 RR)
% Number of literals : 149 ( 0 equ; 41 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ group_element(A)
| cycle(A,e_0)
| cycle(A,e_1)
| cycle(A,e_2) ),
file('GRP130-3.003.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('GRP130-3.003.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('GRP130-3.003.p',unknown),
[] ).
cnf(5,axiom,
( ~ cycle(A,e_0)
| ~ product(A,e_1,B)
| ~ greater(B,A) ),
file('GRP130-3.003.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('GRP130-3.003.p',unknown),
[] ).
cnf(7,axiom,
~ e_qualish(e_1,e_2),
file('GRP130-3.003.p',unknown),
[] ).
cnf(8,axiom,
~ e_qualish(e_1,e_3),
file('GRP130-3.003.p',unknown),
[] ).
cnf(9,axiom,
~ e_qualish(e_2,e_1),
file('GRP130-3.003.p',unknown),
[] ).
cnf(10,axiom,
~ e_qualish(e_2,e_3),
file('GRP130-3.003.p',unknown),
[] ).
cnf(11,axiom,
~ e_qualish(e_3,e_1),
file('GRP130-3.003.p',unknown),
[] ).
cnf(12,axiom,
~ e_qualish(e_3,e_2),
file('GRP130-3.003.p',unknown),
[] ).
cnf(13,axiom,
( ~ group_element(A)
| ~ group_element(B)
| product(A,B,e_1)
| product(A,B,e_2)
| product(A,B,e_3) ),
file('GRP130-3.003.p',unknown),
[] ).
cnf(14,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| e_qualish(C,D) ),
file('GRP130-3.003.p',unknown),
[] ).
cnf(15,axiom,
( ~ product(A,B,C)
| ~ product(A,D,C)
| e_qualish(B,D) ),
file('GRP130-3.003.p',unknown),
[] ).
cnf(16,axiom,
( ~ product(A,B,C)
| ~ product(D,B,C)
| e_qualish(A,D) ),
file('GRP130-3.003.p',unknown),
[] ).
cnf(17,axiom,
( ~ product(A,B,C)
| ~ product(A,C,D)
| product(D,B,A) ),
file('GRP130-3.003.p',unknown),
[] ).
cnf(20,plain,
( ~ cycle(A,B)
| ~ cycle(C,A)
| ~ next(A,C)
| ~ greater(B,e_0)
| e_qualish(B,C) ),
inference(factor,[status(thm)],[3]),
[iquote('factor,3.3.5')] ).
cnf(25,plain,
( ~ group_element(A)
| product(A,A,e_1)
| product(A,A,e_2)
| product(A,A,e_3) ),
inference(factor,[status(thm)],[13]),
[iquote('factor,13.1.2')] ).
cnf(29,plain,
( ~ product(A,B,B)
| product(B,B,A) ),
inference(factor,[status(thm)],[17]),
[iquote('factor,17.1.2')] ).
cnf(35,axiom,
next(e_0,e_1),
file('GRP130-3.003.p',unknown),
[] ).
cnf(36,axiom,
next(e_1,e_2),
file('GRP130-3.003.p',unknown),
[] ).
cnf(37,axiom,
next(e_2,e_3),
file('GRP130-3.003.p',unknown),
[] ).
cnf(38,axiom,
greater(e_1,e_0),
file('GRP130-3.003.p',unknown),
[] ).
cnf(39,axiom,
greater(e_2,e_0),
file('GRP130-3.003.p',unknown),
[] ).
cnf(41,axiom,
greater(e_2,e_1),
file('GRP130-3.003.p',unknown),
[] ).
cnf(42,axiom,
greater(e_3,e_1),
file('GRP130-3.003.p',unknown),
[] ).
cnf(44,axiom,
cycle(e_3,e_0),
file('GRP130-3.003.p',unknown),
[] ).
cnf(45,axiom,
group_element(e_1),
file('GRP130-3.003.p',unknown),
[] ).
cnf(46,axiom,
group_element(e_2),
file('GRP130-3.003.p',unknown),
[] ).
cnf(47,axiom,
group_element(e_3),
file('GRP130-3.003.p',unknown),
[] ).
cnf(48,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2)
| product(e_1,e_1,e_3) ),
inference(hyper,[status(thm)],[45,25]),
[iquote('hyper,45,25')] ).
cnf(49,plain,
( cycle(e_1,e_0)
| cycle(e_1,e_1)
| cycle(e_1,e_2) ),
inference(hyper,[status(thm)],[45,2]),
[iquote('hyper,45,2')] ).
cnf(50,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(hyper,[status(thm)],[46,25]),
[iquote('hyper,46,25')] ).
cnf(51,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(hyper,[status(thm)],[46,13,45]),
[iquote('hyper,46,13,45')] ).
cnf(52,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(hyper,[status(thm)],[46,13,45]),
[iquote('hyper,46,13,45')] ).
cnf(53,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_1)
| cycle(e_2,e_2) ),
inference(hyper,[status(thm)],[46,2]),
[iquote('hyper,46,2')] ).
cnf(56,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(hyper,[status(thm)],[47,13,45]),
[iquote('hyper,47,13,45')] ).
cnf(58,plain,
( product(e_3,e_1,e_1)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_3) ),
inference(hyper,[status(thm)],[47,13,45]),
[iquote('hyper,47,13,45')] ).
cnf(80,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_1) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[53,3,44,37,39,35]),9]),
[iquote('hyper,53,3,44,37,39,35,unit_del,9')] ).
cnf(81,plain,
( cycle(e_2,e_1)
| cycle(e_1,e_0)
| cycle(e_1,e_1) ),
inference(hyper,[status(thm)],[80,4,49,44,37,41,39]),
[iquote('hyper,80,4,49,44,37,41,39')] ).
cnf(96,plain,
( cycle(e_2,e_1)
| cycle(e_1,e_0) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[81,4,80,44,37,41,38])]),
[iquote('hyper,81,4,80,44,37,41,38,factor_simp')] ).
cnf(97,plain,
( cycle(e_1,e_0)
| cycle(e_1,e_2) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[96,20,49,36,38]),7])]),
[iquote('hyper,96,20,49,36,38,unit_del,7,factor_simp')] ).
cnf(101,plain,
( cycle(e_1,e_2)
| product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(hyper,[status(thm)],[97,5,48,42]),
[iquote('hyper,97,5,48,42')] ).
cnf(123,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| product(e_1,e_1,e_2) ),
inference(hyper,[status(thm)],[52,29]),
[iquote('hyper,52,29')] ).
cnf(128,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| cycle(e_1,e_0) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[52,6,96,38,37]),8]),
[iquote('hyper,52,6,96,38,37,unit_del,8')] ).
cnf(179,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[101,6,48,39,36]),12])])]),
[iquote('hyper,101,6,48,39,36,unit_del,12,factor_simp,factor_simp')] ).
cnf(188,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[179,17,51])]),
[iquote('hyper,179,17,51,factor_simp')] ).
cnf(342,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[123,5,128,41])])]),
[iquote('hyper,123,5,128,41,factor_simp,factor_simp')] ).
cnf(350,plain,
( product(e_2,e_1,e_3)
| product(e_1,e_1,e_1) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[342,16,179]),7]),
[iquote('hyper,342,16,179,unit_del,7')] ).
cnf(528,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[188,15,51]),9])])]),
[iquote('hyper,188,15,51,unit_del,9,factor_simp,factor_simp')] ).
cnf(532,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_2,e_3) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[188,15,179]),7])]),
[iquote('hyper,188,15,179,unit_del,7,factor_simp')] ).
cnf(536,plain,
( product(e_1,e_2,e_3)
| product(e_2,e_2,e_1) ),
inference(hyper,[status(thm)],[528,29]),
[iquote('hyper,528,29')] ).
cnf(575,plain,
( product(e_1,e_1,e_1)
| product(e_3,e_1,e_1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[532,17,179])]),
[iquote('hyper,532,17,179,factor_simp')] ).
cnf(599,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[536,16,50]),9])]),
[iquote('hyper,536,16,50,unit_del,9,factor_simp')] ).
cnf(630,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_3) ),
inference(hyper,[status(thm)],[575,29]),
[iquote('hyper,575,29')] ).
cnf(642,plain,
( product(e_2,e_2,e_2)
| product(e_2,e_1,e_3) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[599,17,342])]),
[iquote('hyper,599,17,342,factor_simp')] ).
cnf(671,plain,
product(e_1,e_1,e_1),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[630,16,350]),9])]),
[iquote('hyper,630,16,350,unit_del,9,factor_simp')] ).
cnf(673,plain,
( product(e_3,e_1,e_2)
| product(e_3,e_1,e_3) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[671,16,58]),11]),
[iquote('hyper,671,16,58,unit_del,11')] ).
cnf(674,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[671,15,56]),11]),
[iquote('hyper,671,15,56,unit_del,11')] ).
cnf(688,plain,
product(e_2,e_1,e_3),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[642,15,342]),7])]),
[iquote('hyper,642,15,342,unit_del,7,factor_simp')] ).
cnf(690,plain,
( product(e_2,e_2,e_2)
| product(e_3,e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[642,17,599])]),
[iquote('hyper,642,17,599,factor_simp')] ).
cnf(720,plain,
product(e_3,e_1,e_2),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[673,16,688]),10]),
[iquote('hyper,673,16,688,unit_del,10')] ).
cnf(743,plain,
product(e_2,e_2,e_2),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[690,15,720]),7]),
[iquote('hyper,690,15,720,unit_del,7')] ).
cnf(744,plain,
product(e_1,e_2,e_3),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[743,16,528]),7]),
[iquote('hyper,743,16,528,unit_del,7')] ).
cnf(753,plain,
product(e_1,e_3,e_2),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[744,15,674]),12]),
[iquote('hyper,744,15,674,unit_del,12')] ).
cnf(754,plain,
product(e_2,e_2,e_1),
inference(hyper,[status(thm)],[753,17,744]),
[iquote('hyper,753,17,744')] ).
cnf(758,plain,
e_qualish(e_2,e_1),
inference(hyper,[status(thm)],[754,14,743]),
[iquote('hyper,754,14,743')] ).
cnf(759,plain,
$false,
inference(binary,[status(thm)],[758,9]),
[iquote('binary,758.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:08:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.91/2.10 ----- Otter 3.3f, August 2004 -----
% 1.91/2.10 The process was started by sandbox on n013.cluster.edu,
% 1.91/2.10 Wed Jul 27 05:08:15 2022
% 1.91/2.10 The command was "./otter". The process ID is 24234.
% 1.91/2.10
% 1.91/2.10 set(prolog_style_variables).
% 1.91/2.10 set(auto).
% 1.91/2.10 dependent: set(auto1).
% 1.91/2.10 dependent: set(process_input).
% 1.91/2.10 dependent: clear(print_kept).
% 1.91/2.10 dependent: clear(print_new_demod).
% 1.91/2.10 dependent: clear(print_back_demod).
% 1.91/2.10 dependent: clear(print_back_sub).
% 1.91/2.10 dependent: set(control_memory).
% 1.91/2.10 dependent: assign(max_mem, 12000).
% 1.91/2.10 dependent: assign(pick_given_ratio, 4).
% 1.91/2.10 dependent: assign(stats_level, 1).
% 1.91/2.10 dependent: assign(max_seconds, 10800).
% 1.91/2.10 clear(print_given).
% 1.91/2.10
% 1.91/2.10 list(usable).
% 1.91/2.10 0 [] next(e_0,e_1).
% 1.91/2.10 0 [] next(e_1,e_2).
% 1.91/2.10 0 [] next(e_2,e_3).
% 1.91/2.10 0 [] greater(e_1,e_0).
% 1.91/2.10 0 [] greater(e_2,e_0).
% 1.91/2.10 0 [] greater(e_3,e_0).
% 1.91/2.10 0 [] greater(e_2,e_1).
% 1.91/2.10 0 [] greater(e_3,e_1).
% 1.91/2.10 0 [] greater(e_3,e_2).
% 1.91/2.10 0 [] -cycle(X,Y)| -cycle(X,Z)|e_qualish(Y,Z).
% 1.91/2.10 0 [] -group_element(X)|cycle(X,e_0)|cycle(X,e_1)|cycle(X,e_2).
% 1.91/2.10 0 [] cycle(e_3,e_0).
% 1.91/2.10 0 [] -cycle(X,Y)| -cycle(W,Z)| -next(X,W)| -greater(Y,e_0)| -next(Z,Z1)|e_qualish(Y,Z1).
% 1.91/2.10 0 [] -cycle(X,Z1)| -cycle(Y,e_0)| -cycle(W,Z2)| -next(Y,W)| -greater(Y,X)| -greater(Z1,Z2).
% 1.91/2.10 0 [] -cycle(X,e_0)| -product(X,e_1,Y)| -greater(Y,X).
% 1.91/2.10 0 [] -cycle(X,Y)| -product(X,e_1,Z)| -greater(Y,e_0)| -next(X,X1)|e_qualish(Z,X1).
% 1.91/2.10 0 [] group_element(e_1).
% 1.91/2.10 0 [] group_element(e_2).
% 1.91/2.10 0 [] group_element(e_3).
% 1.91/2.10 0 [] -e_qualish(e_1,e_2).
% 1.91/2.10 0 [] -e_qualish(e_1,e_3).
% 1.91/2.10 0 [] -e_qualish(e_2,e_1).
% 1.91/2.10 0 [] -e_qualish(e_2,e_3).
% 1.91/2.10 0 [] -e_qualish(e_3,e_1).
% 1.91/2.10 0 [] -e_qualish(e_3,e_2).
% 1.91/2.10 0 [] -group_element(X)| -group_element(Y)|product(X,Y,e_1)|product(X,Y,e_2)|product(X,Y,e_3).
% 1.91/2.10 0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.91/2.10 0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.91/2.10 0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.91/2.10 0 [] -product(X,Y,Z1)| -product(X,Z1,Z2)|product(Z2,Y,X).
% 1.91/2.10 end_of_list.
% 1.91/2.10
% 1.91/2.10 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.91/2.10
% 1.91/2.10 This is a non-Horn set without equality. The strategy will
% 1.91/2.10 be ordered hyper_res, unit deletion, and factoring, with
% 1.91/2.10 satellites in sos and with nuclei in usable.
% 1.91/2.10
% 1.91/2.10 dependent: set(hyper_res).
% 1.91/2.10 dependent: set(factor).
% 1.91/2.10 dependent: set(unit_deletion).
% 1.91/2.10
% 1.91/2.10 ------------> process usable:
% 1.91/2.10 ** KEPT (pick-wt=9): 1 [] -cycle(A,B)| -cycle(A,C)|e_qualish(B,C).
% 1.91/2.10 ** KEPT (pick-wt=11): 2 [] -group_element(A)|cycle(A,e_0)|cycle(A,e_1)|cycle(A,e_2).
% 1.91/2.10 ** 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.91/2.10 ** 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.91/2.10 ** KEPT (pick-wt=10): 5 [] -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 1.91/2.10 ** 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.91/2.10 ** KEPT (pick-wt=3): 7 [] -e_qualish(e_1,e_2).
% 1.91/2.10 ** KEPT (pick-wt=3): 8 [] -e_qualish(e_1,e_3).
% 1.91/2.10 ** KEPT (pick-wt=3): 9 [] -e_qualish(e_2,e_1).
% 1.91/2.10 ** KEPT (pick-wt=3): 10 [] -e_qualish(e_2,e_3).
% 1.91/2.10 ** KEPT (pick-wt=3): 11 [] -e_qualish(e_3,e_1).
% 1.91/2.10 ** KEPT (pick-wt=3): 12 [] -e_qualish(e_3,e_2).
% 1.91/2.10 ** KEPT (pick-wt=16): 13 [] -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 1.91/2.10 ** KEPT (pick-wt=11): 14 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.91/2.10 ** KEPT (pick-wt=11): 15 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.91/2.10 ** KEPT (pick-wt=11): 16 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.91/2.10 ** KEPT (pick-wt=12): 17 [] -product(A,B,C)| -product(A,C,D)|product(D,B,A).
% 1.91/2.10
% 1.91/2.10 ------------> process sos:
% 1.91/2.10 ** KEPT (pick-wt=3): 35 [] next(e_0,e_1).
% 1.91/2.10 ** KEPT (pick-wt=3): 36 [] next(e_1,e_2).
% 1.91/2.10 ** KEPT (pick-wt=3): 37 [] next(e_2,e_3).
% 1.91/2.10 ** KEPT (pick-wt=3): 38 [] greater(e_1,e_0).
% 1.91/2.10 ** KEPT (pick-wt=3): 39 [] greater(e_2,e_0).
% 1.91/2.10 ** KEPT (pick-wt=3): 40 [] greater(e_3,e_0).
% 1.91/2.10 ** KEPT (pick-wt=3): 41 [] greater(e_2,e_1).
% 1.91/2.10 ** KEPT (pick-wt=3): 42 [] greater(e_3,e_1).
% 1.91/2.10 ** KEPT (pick-wt=3): 43 [] greater(e_3,e_2).
% 1.91/2.10 ** KEPT (pick-wt=3): 44 [] cycle(e_3,e_0).
% 1.91/2.10 ** KEPT (pick-wt=2): 45 [] group_element(e_1).
% 1.91/2.10 ** KEPT (pick-wt=2): 46 [] group_element(e_2).
% 1.91/2.10 ** KEPT (pick-wt=2): 47 [] group_element(e_3).
% 1.91/2.10
% 1.91/2.10 ======= end of input processing =======
% 2.06/2.25
% 2.06/2.25 =========== start of search ===========
% 2.06/2.25
% 2.06/2.25 -------- PROOF --------
% 2.06/2.25
% 2.06/2.25 ----> UNIT CONFLICT at 0.15 sec ----> 759 [binary,758.1,9.1] $F.
% 2.06/2.25
% 2.06/2.25 Length of proof is 40. Level of proof is 19.
% 2.06/2.25
% 2.06/2.25 ---------------- PROOF ----------------
% 2.06/2.25 % SZS status Unsatisfiable
% 2.06/2.25 % SZS output start Refutation
% See solution above
% 2.06/2.26 ------------ end of proof -------------
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Search stopped by max_proofs option.
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Search stopped by max_proofs option.
% 2.06/2.26
% 2.06/2.26 ============ end of search ============
% 2.06/2.26
% 2.06/2.26 -------------- statistics -------------
% 2.06/2.26 clauses given 174
% 2.06/2.26 clauses generated 5506
% 2.06/2.26 clauses kept 758
% 2.06/2.26 clauses forward subsumed 4778
% 2.06/2.26 clauses back subsumed 668
% 2.06/2.26 Kbytes malloced 976
% 2.06/2.26
% 2.06/2.26 ----------- times (seconds) -----------
% 2.06/2.26 user CPU time 0.15 (0 hr, 0 min, 0 sec)
% 2.06/2.26 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.06/2.26 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.06/2.26
% 2.06/2.26 That finishes the proof of the theorem.
% 2.06/2.26
% 2.06/2.26 Process 24234 finished Wed Jul 27 05:08:17 2022
% 2.06/2.26 Otter interrupted
% 2.06/2.26 PROOF FOUND
%------------------------------------------------------------------------------