%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE039+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 13:00:35 EDT 2022
% Result : Theorem 2.65s 2.91s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 28 unt; 0 nHn; 13 RR)
% Number of literals : 66 ( 15 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ le_q(A,B)
| addition(A,B) = B ),
file('KLE039+2.p',unknown),
[] ).
cnf(2,axiom,
( le_q(A,B)
| addition(A,B) != B ),
file('KLE039+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ le_q(addition(multiplication(A,B),C),B)
| le_q(multiplication(star(A),C),B) ),
file('KLE039+2.p',unknown),
[] ).
cnf(4,axiom,
( ~ le_q(addition(multiplication(A,B),C),A)
| le_q(multiplication(C,star(B)),A) ),
file('KLE039+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ le_q(star(star(dollar_c1)),star(dollar_c1))
| ~ le_q(star(dollar_c1),star(star(dollar_c1))) ),
file('KLE039+2.p',unknown),
[] ).
cnf(7,axiom,
addition(A,B) = addition(B,A),
file('KLE039+2.p',unknown),
[] ).
cnf(8,axiom,
addition(A,addition(B,C)) = addition(addition(A,B),C),
file('KLE039+2.p',unknown),
[] ).
cnf(10,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(13,axiom,
addition(A,A) = A,
file('KLE039+2.p',unknown),
[] ).
cnf(19,axiom,
multiplication(A,one) = A,
file('KLE039+2.p',unknown),
[] ).
cnf(22,axiom,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
file('KLE039+2.p',unknown),
[] ).
cnf(30,axiom,
le_q(addition(one,multiplication(A,star(A))),star(A)),
file('KLE039+2.p',unknown),
[] ).
cnf(31,axiom,
le_q(addition(one,multiplication(star(A),A)),star(A)),
file('KLE039+2.p',unknown),
[] ).
cnf(38,plain,
le_q(A,A),
inference(hyper,[status(thm)],[13,2]),
[iquote('hyper,13,2')] ).
cnf(43,plain,
( addition(A,B) = A
| ~ le_q(B,A) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,1])]),
[iquote('para_into,7.1.1,1.2.1,flip.1')] ).
cnf(44,plain,
( ~ le_q(addition(A,multiplication(B,C)),B)
| le_q(multiplication(A,star(C)),B) ),
inference(para_from,[status(thm),theory(equality)],[7,4]),
[iquote('para_from,7.1.1,4.1.1')] ).
cnf(57,plain,
addition(A,addition(A,B)) = addition(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,13])]),
[iquote('para_into,9.1.1.1,13.1.1,flip.1')] ).
cnf(60,plain,
( addition(A,addition(B,C)) = addition(B,C)
| ~ le_q(A,B) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,1])]),
[iquote('para_into,9.1.1.1,1.2.1,flip.1')] ).
cnf(111,plain,
( addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,C)
| ~ le_q(B,C) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[22,1])]),
[iquote('para_into,22.1.1.2,1.2.1,flip.1')] ).
cnf(121,plain,
( ~ le_q(multiplication(A,B),B)
| le_q(multiplication(star(A),C),B)
| ~ le_q(C,multiplication(A,B)) ),
inference(para_from,[status(thm),theory(equality)],[43,3]),
[iquote('para_from,43.1.1,3.1.1')] ).
cnf(176,plain,
addition(one,addition(multiplication(star(A),A),star(A))) = star(A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[31,1]),10]),
[iquote('hyper,31,1,demod,10')] ).
cnf(261,plain,
( ~ le_q(A,B)
| le_q(multiplication(A,star(C)),B)
| ~ le_q(multiplication(B,C),A) ),
inference(para_into,[status(thm),theory(equality)],[44,43]),
[iquote('para_into,44.1.1,43.1.1')] ).
cnf(462,plain,
le_q(A,addition(A,B)),
inference(hyper,[status(thm)],[57,2]),
[iquote('hyper,57,2')] ).
cnf(478,plain,
le_q(A,addition(B,A)),
inference(para_into,[status(thm),theory(equality)],[462,7]),
[iquote('para_into,462.1.2,7.1.1')] ).
cnf(488,plain,
le_q(A,addition(B,addition(C,A))),
inference(para_into,[status(thm),theory(equality)],[478,10]),
[iquote('para_into,478.1.2,9.1.1')] ).
cnf(495,plain,
( le_q(A,addition(B,C))
| ~ le_q(A,C) ),
inference(para_into,[status(thm),theory(equality)],[488,43]),
[iquote('para_into,488.1.2.2,43.1.1')] ).
cnf(498,plain,
le_q(A,addition(B,addition(A,C))),
inference(para_into,[status(thm),theory(equality)],[488,7]),
[iquote('para_into,488.1.2.2,7.1.1')] ).
cnf(499,plain,
( le_q(A,B)
| ~ le_q(addition(C,A),B) ),
inference(para_into,[status(thm),theory(equality)],[488,43]),
[iquote('para_into,488.1.2,43.1.1')] ).
cnf(537,plain,
( le_q(A,B)
| ~ le_q(A,C)
| ~ le_q(C,B) ),
inference(para_into,[status(thm),theory(equality)],[495,43]),
[iquote('para_into,495.1.2,43.1.1')] ).
cnf(543,plain,
le_q(multiplication(star(A),A),star(A)),
inference(hyper,[status(thm)],[499,31]),
[iquote('hyper,499,31')] ).
cnf(544,plain,
le_q(multiplication(A,star(A)),star(A)),
inference(hyper,[status(thm)],[499,30]),
[iquote('hyper,499,30')] ).
cnf(575,plain,
addition(multiplication(star(A),A),star(A)) = star(A),
inference(hyper,[status(thm)],[543,1]),
[iquote('hyper,543,1')] ).
cnf(576,plain,
addition(one,star(A)) = star(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[176]),575]),
[iquote('back_demod,176,demod,575')] ).
cnf(590,plain,
le_q(one,star(A)),
inference(hyper,[status(thm)],[576,2]),
[iquote('hyper,576,2')] ).
cnf(596,plain,
le_q(one,addition(A,star(B))),
inference(para_from,[status(thm),theory(equality)],[576,498]),
[iquote('para_from,576.1.1,498.1.2.2')] ).
cnf(649,plain,
le_q(one,addition(star(A),B)),
inference(para_into,[status(thm),theory(equality)],[596,7]),
[iquote('para_into,596.1.2,7.1.1')] ).
cnf(653,plain,
( le_q(one,addition(A,B))
| ~ le_q(star(C),A) ),
inference(para_into,[status(thm),theory(equality)],[649,60]),
[iquote('para_into,649.1.2,60.1.1')] ).
cnf(1791,plain,
( le_q(one,A)
| ~ le_q(star(B),C)
| ~ le_q(C,A) ),
inference(para_into,[status(thm),theory(equality)],[653,1]),
[iquote('para_into,653.1.2,1.2.1')] ).
cnf(2280,plain,
( le_q(multiplication(A,B),multiplication(A,C))
| ~ le_q(B,C) ),
inference(para_from,[status(thm),theory(equality)],[111,462]),
[iquote('para_from,111.1.1,462.1.2')] ).
cnf(3470,plain,
le_q(A,multiplication(A,star(B))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2280,590]),19]),
[iquote('hyper,2280,590,demod,19')] ).
cnf(3478,plain,
le_q(one,multiplication(star(A),star(B))),
inference(hyper,[status(thm)],[3470,1791,38]),
[iquote('hyper,3470,1791,38')] ).
cnf(3494,plain,
le_q(A,star(A)),
inference(hyper,[status(thm)],[3470,537,544]),
[iquote('hyper,3470,537,544')] ).
cnf(3986,plain,
le_q(multiplication(star(A),star(A)),star(A)),
inference(hyper,[status(thm)],[261,38,543]),
[iquote('hyper,261,38,543')] ).
cnf(3989,plain,
le_q(star(star(A)),star(A)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[3986,121,3478]),19]),
[iquote('hyper,3986,121,3478,demod,19')] ).
cnf(3995,plain,
$false,
inference(hyper,[status(thm)],[3989,5,3494]),
[iquote('hyper,3989,5,3494')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE039+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 06:12:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.71/1.91 ----- Otter 3.3f, August 2004 -----
% 1.71/1.91 The process was started by sandbox on n007.cluster.edu,
% 1.71/1.91 Wed Jul 27 06:12:16 2022
% 1.71/1.91 The command was "./otter". The process ID is 32268.
% 1.71/1.91
% 1.71/1.91 set(prolog_style_variables).
% 1.71/1.91 set(auto).
% 1.71/1.91 dependent: set(auto1).
% 1.71/1.91 dependent: set(process_input).
% 1.71/1.91 dependent: clear(print_kept).
% 1.71/1.91 dependent: clear(print_new_demod).
% 1.71/1.91 dependent: clear(print_back_demod).
% 1.71/1.91 dependent: clear(print_back_sub).
% 1.71/1.91 dependent: set(control_memory).
% 1.71/1.91 dependent: assign(max_mem, 12000).
% 1.71/1.91 dependent: assign(pick_given_ratio, 4).
% 1.71/1.91 dependent: assign(stats_level, 1).
% 1.71/1.91 dependent: assign(max_seconds, 10800).
% 1.71/1.91 clear(print_given).
% 1.71/1.91
% 1.71/1.91 formula_list(usable).
% 1.71/1.91 all A (A=A).
% 1.71/1.91 all A B (addition(A,B)=addition(B,A)).
% 1.71/1.91 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.71/1.91 all A (addition(A,zero)=A).
% 1.71/1.91 all A (addition(A,A)=A).
% 1.71/1.91 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.71/1.91 all A (multiplication(A,one)=A).
% 1.71/1.91 all A (multiplication(one,A)=A).
% 1.71/1.91 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.71/1.91 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.71/1.91 all A (multiplication(A,zero)=zero).
% 1.71/1.91 all A (multiplication(zero,A)=zero).
% 1.71/1.91 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.71/1.91 all A le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.71/1.91 all A le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.71/1.91 all A B C (le_q(addition(multiplication(A,B),C),B)->le_q(multiplication(star(A),C),B)).
% 1.71/1.91 all A B C (le_q(addition(multiplication(A,B),C),A)->le_q(multiplication(C,star(B)),A)).
% 1.71/1.91 -(all X0 (le_q(star(star(X0)),star(X0))&le_q(star(X0),star(star(X0))))).
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 -------> usable clausifies to:
% 1.71/1.91
% 1.71/1.91 list(usable).
% 1.71/1.91 0 [] A=A.
% 1.71/1.91 0 [] addition(A,B)=addition(B,A).
% 1.71/1.91 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.71/1.91 0 [] addition(A,zero)=A.
% 1.71/1.91 0 [] addition(A,A)=A.
% 1.71/1.91 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.71/1.91 0 [] multiplication(A,one)=A.
% 1.71/1.91 0 [] multiplication(one,A)=A.
% 1.71/1.91 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.71/1.91 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.71/1.91 0 [] multiplication(A,zero)=zero.
% 1.71/1.91 0 [] multiplication(zero,A)=zero.
% 1.71/1.91 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.71/1.91 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.71/1.91 0 [] le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.71/1.91 0 [] le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.71/1.91 0 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.71/1.91 0 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.71/1.91 0 [] -le_q(star(star($c1)),star($c1))| -le_q(star($c1),star(star($c1))).
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.71/1.91
% 1.71/1.91 This is a Horn set with equality. The strategy will be
% 1.71/1.91 Knuth-Bendix and hyper_res, with positive clauses in
% 1.71/1.91 sos and nonpositive clauses in usable.
% 1.71/1.91
% 1.71/1.91 dependent: set(knuth_bendix).
% 1.71/1.91 dependent: set(anl_eq).
% 1.71/1.91 dependent: set(para_from).
% 1.71/1.91 dependent: set(para_into).
% 1.71/1.91 dependent: clear(para_from_right).
% 1.71/1.91 dependent: clear(para_into_right).
% 1.71/1.91 dependent: set(para_from_vars).
% 1.71/1.91 dependent: set(eq_units_both_ways).
% 1.71/1.91 dependent: set(dynamic_demod_all).
% 1.71/1.91 dependent: set(dynamic_demod).
% 1.71/1.91 dependent: set(order_eq).
% 1.71/1.91 dependent: set(back_demod).
% 1.71/1.91 dependent: set(lrpo).
% 1.71/1.91 dependent: set(hyper_res).
% 1.71/1.91 dependent: clear(order_hyper).
% 1.71/1.91
% 1.71/1.91 ------------> process usable:
% 1.71/1.91 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.71/1.91 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.71/1.91 ** KEPT (pick-wt=13): 3 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.71/1.91 ** KEPT (pick-wt=13): 4 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.71/1.91 ** KEPT (pick-wt=12): 5 [] -le_q(star(star($c1)),star($c1))| -le_q(star($c1),star(star($c1))).
% 1.71/1.91
% 1.71/1.91 ------------> process sos:
% 1.71/1.91 ** KEPT (pick-wt=3): 6 [] A=A.
% 1.71/1.91 ** KEPT (pick-wt=7): 7 [] addition(A,B)=addition(B,A).
% 1.71/1.91 ** KEPT (pick-wt=11): 9 [copy,8,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.71/1.91 ---> New Demodulator: 10 [new_demod,9] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 2.65/2.91 ** KEPT (pick-wt=5): 11 [] addition(A,zero)=A.
% 2.65/2.91 ---> New Demodulator: 12 [new_demod,11] addition(A,zero)=A.
% 2.65/2.91 ** KEPT (pick-wt=5): 13 [] addition(A,A)=A.
% 2.65/2.91 ---> New Demodulator: 14 [new_demod,13] addition(A,A)=A.
% 2.65/2.91 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 2.65/2.91 ---> New Demodulator: 17 [new_demod,16] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 2.65/2.91 ** KEPT (pick-wt=5): 18 [] multiplication(A,one)=A.
% 2.65/2.91 ---> New Demodulator: 19 [new_demod,18] multiplication(A,one)=A.
% 2.65/2.91 ** KEPT (pick-wt=5): 20 [] multiplication(one,A)=A.
% 2.65/2.91 ---> New Demodulator: 21 [new_demod,20] multiplication(one,A)=A.
% 2.65/2.91 ** KEPT (pick-wt=13): 22 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 2.65/2.91 ---> New Demodulator: 23 [new_demod,22] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 2.65/2.91 ** KEPT (pick-wt=13): 24 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 2.65/2.91 ---> New Demodulator: 25 [new_demod,24] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 2.65/2.91 ** KEPT (pick-wt=5): 26 [] multiplication(A,zero)=zero.
% 2.65/2.91 ---> New Demodulator: 27 [new_demod,26] multiplication(A,zero)=zero.
% 2.65/2.91 ** KEPT (pick-wt=5): 28 [] multiplication(zero,A)=zero.
% 2.65/2.91 ---> New Demodulator: 29 [new_demod,28] multiplication(zero,A)=zero.
% 2.65/2.91 ** KEPT (pick-wt=9): 30 [] le_q(addition(one,multiplication(A,star(A))),star(A)).
% 2.65/2.91 ** KEPT (pick-wt=9): 31 [] le_q(addition(one,multiplication(star(A),A)),star(A)).
% 2.65/2.91 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 2.65/2.91 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] addition(A,B)=addition(B,A).
% 2.65/2.91 >>>> Starting back demodulation with 10.
% 2.65/2.91 >>>> Starting back demodulation with 12.
% 2.65/2.91 >>>> Starting back demodulation with 14.
% 2.65/2.91 >>>> Starting back demodulation with 17.
% 2.65/2.91 >>>> Starting back demodulation with 19.
% 2.65/2.91 >>>> Starting back demodulation with 21.
% 2.65/2.91 >>>> Starting back demodulation with 23.
% 2.65/2.91 >>>> Starting back demodulation with 25.
% 2.65/2.91 >>>> Starting back demodulation with 27.
% 2.65/2.91 >>>> Starting back demodulation with 29.
% 2.65/2.91
% 2.65/2.91 ======= end of input processing =======
% 2.65/2.91
% 2.65/2.91 =========== start of search ===========
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Resetting weight limit to 11.
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Resetting weight limit to 11.
% 2.65/2.91
% 2.65/2.91 sos_size=2235
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Resetting weight limit to 10.
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Resetting weight limit to 10.
% 2.65/2.91
% 2.65/2.91 sos_size=2306
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Resetting weight limit to 9.
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Resetting weight limit to 9.
% 2.65/2.91
% 2.65/2.91 sos_size=2498
% 2.65/2.91
% 2.65/2.91 -------- PROOF --------
% 2.65/2.91
% 2.65/2.91 -----> EMPTY CLAUSE at 0.99 sec ----> 3995 [hyper,3989,5,3494] $F.
% 2.65/2.91
% 2.65/2.91 Length of proof is 32. Level of proof is 15.
% 2.65/2.91
% 2.65/2.91 ---------------- PROOF ----------------
% 2.65/2.91 % SZS status Theorem
% 2.65/2.91 % SZS output start Refutation
% See solution above
% 2.65/2.91 ------------ end of proof -------------
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Search stopped by max_proofs option.
% 2.65/2.91
% 2.65/2.91
% 2.65/2.91 Search stopped by max_proofs option.
% 2.65/2.91
% 2.65/2.91 ============ end of search ============
% 2.65/2.91
% 2.65/2.91 -------------- statistics -------------
% 2.65/2.91 clauses given 443
% 2.65/2.91 clauses generated 51367
% 2.65/2.91 clauses kept 3874
% 2.65/2.91 clauses forward subsumed 18335
% 2.65/2.91 clauses back subsumed 846
% 2.65/2.91 Kbytes malloced 5859
% 2.65/2.91
% 2.65/2.91 ----------- times (seconds) -----------
% 2.65/2.91 user CPU time 0.99 (0 hr, 0 min, 0 sec)
% 2.65/2.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.65/2.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.65/2.91
% 2.65/2.91 That finishes the proof of the theorem.
% 2.65/2.91
% 2.65/2.91 Process 32268 finished Wed Jul 27 06:12:18 2022
% 2.65/2.91 Otter interrupted
% 2.65/2.91 PROOF FOUND
%------------------------------------------------------------------------------