TSTP Solution File: GRP126-3.004 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP126-3.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:11 EDT 2022
% Result : Unsatisfiable 1.73s 1.97s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 32
% Syntax : Number of clauses : 57 ( 28 unt; 21 nHn; 56 RR)
% Number of literals : 127 ( 0 equ; 37 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 : 36 ( 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('GRP126-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('GRP126-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('GRP126-3.004.p',unknown),
[] ).
cnf(5,axiom,
( ~ cycle(A,e_0)
| ~ product(A,e_1,B)
| ~ greater(B,A) ),
file('GRP126-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('GRP126-3.004.p',unknown),
[] ).
cnf(7,axiom,
~ e_qualish(e_1,e_2),
file('GRP126-3.004.p',unknown),
[] ).
cnf(8,axiom,
~ e_qualish(e_1,e_3),
file('GRP126-3.004.p',unknown),
[] ).
cnf(10,axiom,
~ e_qualish(e_2,e_1),
file('GRP126-3.004.p',unknown),
[] ).
cnf(11,axiom,
~ e_qualish(e_2,e_3),
file('GRP126-3.004.p',unknown),
[] ).
cnf(13,axiom,
~ e_qualish(e_3,e_1),
file('GRP126-3.004.p',unknown),
[] ).
cnf(14,axiom,
~ e_qualish(e_3,e_2),
file('GRP126-3.004.p',unknown),
[] ).
cnf(16,axiom,
~ e_qualish(e_4,e_1),
file('GRP126-3.004.p',unknown),
[] ).
cnf(18,axiom,
~ e_qualish(e_4,e_3),
file('GRP126-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('GRP126-3.004.p',unknown),
[] ).
cnf(20,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| e_qualish(C,D) ),
file('GRP126-3.004.p',unknown),
[] ).
cnf(21,axiom,
( ~ product(A,B,C)
| ~ product(A,D,C)
| e_qualish(B,D) ),
file('GRP126-3.004.p',unknown),
[] ).
cnf(22,axiom,
( ~ product(A,B,C)
| ~ product(D,B,C)
| e_qualish(A,D) ),
file('GRP126-3.004.p',unknown),
[] ).
cnf(23,axiom,
( ~ product(A,B,C)
| ~ product(B,A,D)
| product(C,D,B) ),
file('GRP126-3.004.p',unknown),
[] ).
cnf(41,axiom,
next(e_0,e_1),
file('GRP126-3.004.p',unknown),
[] ).
cnf(42,axiom,
next(e_1,e_2),
file('GRP126-3.004.p',unknown),
[] ).
cnf(43,axiom,
next(e_2,e_3),
file('GRP126-3.004.p',unknown),
[] ).
cnf(44,axiom,
next(e_3,e_4),
file('GRP126-3.004.p',unknown),
[] ).
cnf(45,axiom,
greater(e_1,e_0),
file('GRP126-3.004.p',unknown),
[] ).
cnf(46,axiom,
greater(e_2,e_0),
file('GRP126-3.004.p',unknown),
[] ).
cnf(47,axiom,
greater(e_3,e_0),
file('GRP126-3.004.p',unknown),
[] ).
cnf(52,axiom,
greater(e_3,e_2),
file('GRP126-3.004.p',unknown),
[] ).
cnf(53,axiom,
greater(e_4,e_2),
file('GRP126-3.004.p',unknown),
[] ).
cnf(55,axiom,
cycle(e_4,e_0),
file('GRP126-3.004.p',unknown),
[] ).
cnf(56,axiom,
group_element(e_1),
file('GRP126-3.004.p',unknown),
[] ).
cnf(57,axiom,
group_element(e_2),
file('GRP126-3.004.p',unknown),
[] ).
cnf(58,axiom,
group_element(e_3),
file('GRP126-3.004.p',unknown),
[] ).
cnf(60,axiom,
product(A,A,A),
file('GRP126-3.004.p',unknown),
[] ).
cnf(62,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)],[57,19,56]),
[iquote('hyper,57,19,56')] ).
cnf(63,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)],[57,19,56]),
[iquote('hyper,57,19,56')] ).
cnf(64,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)],[57,2]),
[iquote('hyper,57,2')] ).
cnf(66,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)],[58,19,56]),
[iquote('hyper,58,19,56')] ).
cnf(69,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)],[58,2]),
[iquote('hyper,58,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)],[62,21,60]),7]),
[iquote('hyper,62,21,60,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)],[69,3,55,44,46,41]),10]),
[iquote('hyper,69,3,55,44,46,41,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,55,44,47,41]),13]),
[iquote('hyper,93,3,55,44,47,41,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)],[63,22,60]),7]),
[iquote('hyper,63,22,60,unit_del,7')] ).
cnf(114,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,64,55,44,52,47]),
[iquote('hyper,106,4,64,55,44,52,47')] ).
cnf(119,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,60]),10]),
[iquote('hyper,84,22,60,unit_del,10')] ).
cnf(124,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,60]),10]),
[iquote('hyper,107,21,60,unit_del,10')] ).
cnf(153,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)],[114,3,64,43,47,42]),14])])])]),
[iquote('hyper,114,3,64,43,47,42,unit_del,14,factor_simp,factor_simp,factor_simp')] ).
cnf(157,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)],[114,4,106,55,44,52,45])]),
[iquote('hyper,114,4,106,55,44,52,45,factor_simp')] ).
cnf(165,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)],[157,3,153,43,45,42]),7])])]),
[iquote('hyper,157,3,153,43,45,42,unit_del,7,factor_simp,factor_simp')] ).
cnf(170,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)],[66,21,60]),8]),
[iquote('hyper,66,21,60,unit_del,8')] ).
cnf(173,plain,
( cycle(e_2,e_2)
| product(e_2,e_1,e_3) ),
inference(hyper,[status(thm)],[165,5,124,53]),
[iquote('hyper,165,5,124,53')] ).
cnf(178,plain,
product(e_2,e_1,e_3),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[173,6,124,46,43]),18])]),
[iquote('hyper,173,6,124,46,43,unit_del,18,factor_simp')] ).
cnf(180,plain,
( product(e_3,e_3,e_2)
| product(e_1,e_2,e_4) ),
inference(hyper,[status(thm)],[178,23,119]),
[iquote('hyper,178,23,119')] ).
cnf(194,plain,
product(e_1,e_2,e_4),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[180,20,60]),14]),
[iquote('hyper,180,20,60,unit_del,14')] ).
cnf(200,plain,
product(e_4,e_3,e_2),
inference(hyper,[status(thm)],[194,23,178]),
[iquote('hyper,194,23,178')] ).
cnf(206,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[170,22,200]),16]),
[iquote('hyper,170,22,200,unit_del,16')] ).
cnf(210,plain,
product(e_1,e_3,e_4),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[206,22,60]),13]),
[iquote('hyper,206,22,60,unit_del,13')] ).
cnf(214,plain,
e_qualish(e_2,e_3),
inference(hyper,[status(thm)],[210,21,194]),
[iquote('hyper,210,21,194')] ).
cnf(215,plain,
$false,
inference(binary,[status(thm)],[214,11]),
[iquote('binary,214.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP126-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n016.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:28:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.73/1.94 ----- Otter 3.3f, August 2004 -----
% 1.73/1.94 The process was started by sandbox on n016.cluster.edu,
% 1.73/1.94 Wed Jul 27 05:28:07 2022
% 1.73/1.94 The command was "./otter". The process ID is 11115.
% 1.73/1.94
% 1.73/1.94 set(prolog_style_variables).
% 1.73/1.94 set(auto).
% 1.73/1.94 dependent: set(auto1).
% 1.73/1.94 dependent: set(process_input).
% 1.73/1.94 dependent: clear(print_kept).
% 1.73/1.94 dependent: clear(print_new_demod).
% 1.73/1.94 dependent: clear(print_back_demod).
% 1.73/1.94 dependent: clear(print_back_sub).
% 1.73/1.94 dependent: set(control_memory).
% 1.73/1.94 dependent: assign(max_mem, 12000).
% 1.73/1.94 dependent: assign(pick_given_ratio, 4).
% 1.73/1.94 dependent: assign(stats_level, 1).
% 1.73/1.94 dependent: assign(max_seconds, 10800).
% 1.73/1.94 clear(print_given).
% 1.73/1.94
% 1.73/1.94 list(usable).
% 1.73/1.94 0 [] next(e_0,e_1).
% 1.73/1.94 0 [] next(e_1,e_2).
% 1.73/1.94 0 [] next(e_2,e_3).
% 1.73/1.94 0 [] next(e_3,e_4).
% 1.73/1.94 0 [] greater(e_1,e_0).
% 1.73/1.94 0 [] greater(e_2,e_0).
% 1.73/1.94 0 [] greater(e_3,e_0).
% 1.73/1.94 0 [] greater(e_4,e_0).
% 1.73/1.94 0 [] greater(e_2,e_1).
% 1.73/1.94 0 [] greater(e_3,e_1).
% 1.73/1.94 0 [] greater(e_4,e_1).
% 1.73/1.94 0 [] greater(e_3,e_2).
% 1.73/1.94 0 [] greater(e_4,e_2).
% 1.73/1.94 0 [] greater(e_4,e_3).
% 1.73/1.94 0 [] -cycle(X,Y)| -cycle(X,Z)|e_qualish(Y,Z).
% 1.73/1.94 0 [] -group_element(X)|cycle(X,e_0)|cycle(X,e_1)|cycle(X,e_2)|cycle(X,e_3).
% 1.73/1.94 0 [] cycle(e_4,e_0).
% 1.73/1.94 0 [] -cycle(X,Y)| -cycle(W,Z)| -next(X,W)| -greater(Y,e_0)| -next(Z,Z1)|e_qualish(Y,Z1).
% 1.73/1.94 0 [] -cycle(X,Z1)| -cycle(Y,e_0)| -cycle(W,Z2)| -next(Y,W)| -greater(Y,X)| -greater(Z1,Z2).
% 1.73/1.94 0 [] -cycle(X,e_0)| -product(X,e_1,Y)| -greater(Y,X).
% 1.73/1.94 0 [] -cycle(X,Y)| -product(X,e_1,Z)| -greater(Y,e_0)| -next(X,X1)|e_qualish(Z,X1).
% 1.73/1.94 0 [] group_element(e_1).
% 1.73/1.94 0 [] group_element(e_2).
% 1.73/1.94 0 [] group_element(e_3).
% 1.73/1.94 0 [] group_element(e_4).
% 1.73/1.94 0 [] -e_qualish(e_1,e_2).
% 1.73/1.94 0 [] -e_qualish(e_1,e_3).
% 1.73/1.94 0 [] -e_qualish(e_1,e_4).
% 1.73/1.94 0 [] -e_qualish(e_2,e_1).
% 1.73/1.94 0 [] -e_qualish(e_2,e_3).
% 1.73/1.94 0 [] -e_qualish(e_2,e_4).
% 1.73/1.94 0 [] -e_qualish(e_3,e_1).
% 1.73/1.94 0 [] -e_qualish(e_3,e_2).
% 1.73/1.94 0 [] -e_qualish(e_3,e_4).
% 1.73/1.94 0 [] -e_qualish(e_4,e_1).
% 1.73/1.94 0 [] -e_qualish(e_4,e_2).
% 1.73/1.94 0 [] -e_qualish(e_4,e_3).
% 1.73/1.94 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.73/1.94 0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.73/1.94 0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.73/1.94 0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.73/1.94 0 [] product(X,X,X).
% 1.73/1.94 0 [] -product(X,Y,Z1)| -product(Y,X,Z2)|product(Z1,Z2,Y).
% 1.73/1.94 end_of_list.
% 1.73/1.94
% 1.73/1.94 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.73/1.94
% 1.73/1.94 This is a non-Horn set without equality. The strategy will
% 1.73/1.94 be ordered hyper_res, unit deletion, and factoring, with
% 1.73/1.94 satellites in sos and with nuclei in usable.
% 1.73/1.94
% 1.73/1.94 dependent: set(hyper_res).
% 1.73/1.94 dependent: set(factor).
% 1.73/1.94 dependent: set(unit_deletion).
% 1.73/1.94
% 1.73/1.94 ------------> process usable:
% 1.73/1.94 ** KEPT (pick-wt=9): 1 [] -cycle(A,B)| -cycle(A,C)|e_qualish(B,C).
% 1.73/1.94 ** 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.73/1.94 ** 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.73/1.94 ** 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.73/1.94 ** KEPT (pick-wt=10): 5 [] -cycle(A,e_0)| -product(A,e_1,B)| -greater(B,A).
% 1.73/1.94 ** 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.73/1.94 ** KEPT (pick-wt=3): 7 [] -e_qualish(e_1,e_2).
% 1.73/1.94 ** KEPT (pick-wt=3): 8 [] -e_qualish(e_1,e_3).
% 1.73/1.94 ** KEPT (pick-wt=3): 9 [] -e_qualish(e_1,e_4).
% 1.73/1.94 ** KEPT (pick-wt=3): 10 [] -e_qualish(e_2,e_1).
% 1.73/1.94 ** KEPT (pick-wt=3): 11 [] -e_qualish(e_2,e_3).
% 1.73/1.94 ** KEPT (pick-wt=3): 12 [] -e_qualish(e_2,e_4).
% 1.73/1.94 ** KEPT (pick-wt=3): 13 [] -e_qualish(e_3,e_1).
% 1.73/1.94 ** KEPT (pick-wt=3): 14 [] -e_qualish(e_3,e_2).
% 1.73/1.94 ** KEPT (pick-wt=3): 15 [] -e_qualish(e_3,e_4).
% 1.73/1.94 ** KEPT (pick-wt=3): 16 [] -e_qualish(e_4,e_1).
% 1.73/1.94 ** KEPT (pick-wt=3): 17 [] -e_qualish(e_4,e_2).
% 1.73/1.94 ** KEPT (pick-wt=3): 18 [] -e_qualish(e_4,e_3).
% 1.73/1.94 ** 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.73/1.94 ** KEPT (pick-wt=11): 20 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.73/1.94 ** KEPT (pick-wt=11): 21 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.73/1.94 ** KEPT (pick-wt=11): 22 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.73/1.94 ** KEPT (pick-wt=12): 23 [] -product(A,B,C)| -product(B,A,D)|product(C,D,B).
% 1.73/1.97
% 1.73/1.97 ------------> process sos:
% 1.73/1.97 ** KEPT (pick-wt=3): 41 [] next(e_0,e_1).
% 1.73/1.97 ** KEPT (pick-wt=3): 42 [] next(e_1,e_2).
% 1.73/1.97 ** KEPT (pick-wt=3): 43 [] next(e_2,e_3).
% 1.73/1.97 ** KEPT (pick-wt=3): 44 [] next(e_3,e_4).
% 1.73/1.97 ** KEPT (pick-wt=3): 45 [] greater(e_1,e_0).
% 1.73/1.97 ** KEPT (pick-wt=3): 46 [] greater(e_2,e_0).
% 1.73/1.97 ** KEPT (pick-wt=3): 47 [] greater(e_3,e_0).
% 1.73/1.97 ** KEPT (pick-wt=3): 48 [] greater(e_4,e_0).
% 1.73/1.97 ** KEPT (pick-wt=3): 49 [] greater(e_2,e_1).
% 1.73/1.97 ** KEPT (pick-wt=3): 50 [] greater(e_3,e_1).
% 1.73/1.97 ** KEPT (pick-wt=3): 51 [] greater(e_4,e_1).
% 1.73/1.97 ** KEPT (pick-wt=3): 52 [] greater(e_3,e_2).
% 1.73/1.97 ** KEPT (pick-wt=3): 53 [] greater(e_4,e_2).
% 1.73/1.97 ** KEPT (pick-wt=3): 54 [] greater(e_4,e_3).
% 1.73/1.97 ** KEPT (pick-wt=3): 55 [] cycle(e_4,e_0).
% 1.73/1.97 ** KEPT (pick-wt=2): 56 [] group_element(e_1).
% 1.73/1.97 ** KEPT (pick-wt=2): 57 [] group_element(e_2).
% 1.73/1.97 ** KEPT (pick-wt=2): 58 [] group_element(e_3).
% 1.73/1.97 ** KEPT (pick-wt=2): 59 [] group_element(e_4).
% 1.73/1.97 ** KEPT (pick-wt=4): 60 [] product(A,A,A).
% 1.73/1.97
% 1.73/1.97 ======= end of input processing =======
% 1.73/1.97
% 1.73/1.97 =========== start of search ===========
% 1.73/1.97
% 1.73/1.97 -------- PROOF --------
% 1.73/1.97
% 1.73/1.97 ----> UNIT CONFLICT at 0.03 sec ----> 215 [binary,214.1,11.1] $F.
% 1.73/1.97
% 1.73/1.97 Length of proof is 24. Level of proof is 14.
% 1.73/1.97
% 1.73/1.97 ---------------- PROOF ----------------
% 1.73/1.97 % SZS status Unsatisfiable
% 1.73/1.97 % SZS output start Refutation
% See solution above
% 1.73/1.97 ------------ end of proof -------------
% 1.73/1.97
% 1.73/1.97
% 1.73/1.97 Search stopped by max_proofs option.
% 1.73/1.97
% 1.73/1.97
% 1.73/1.97 Search stopped by max_proofs option.
% 1.73/1.97
% 1.73/1.97 ============ end of search ============
% 1.73/1.97
% 1.73/1.97 -------------- statistics -------------
% 1.73/1.97 clauses given 60
% 1.73/1.97 clauses generated 1198
% 1.73/1.97 clauses kept 214
% 1.73/1.97 clauses forward subsumed 1027
% 1.73/1.97 clauses back subsumed 132
% 1.73/1.97 Kbytes malloced 976
% 1.73/1.97
% 1.73/1.97 ----------- times (seconds) -----------
% 1.73/1.97 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.73/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.97 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.73/1.97
% 1.73/1.97 That finishes the proof of the theorem.
% 1.73/1.97
% 1.73/1.97 Process 11115 finished Wed Jul 27 05:28:08 2022
% 1.73/1.97 Otter interrupted
% 1.73/1.97 PROOF FOUND
%------------------------------------------------------------------------------