%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG008-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:12:02 EDT 2022
% Result : Unsatisfiable 2.90s 3.08s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 21
% Syntax : Number of clauses : 62 ( 49 unt; 0 nHn; 32 RR)
% Number of literals : 99 ( 16 equ; 38 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 110 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ sum(A,B,C)
| ~ sum(B,D,E)
| ~ sum(C,D,F)
| sum(A,E,F) ),
file('RNG008-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ sum(A,B,C)
| ~ sum(B,D,E)
| ~ sum(A,E,F)
| sum(C,D,F) ),
file('RNG008-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ sum(A,B,C)
| sum(B,A,C) ),
file('RNG008-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(C,D,F)
| product(A,E,F) ),
file('RNG008-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(A,E,F)
| product(C,D,F) ),
file('RNG008-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ product(A,F,G)
| sum(C,E,G) ),
file('RNG008-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ sum(C,E,G)
| product(A,F,G) ),
file('RNG008-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ product(F,B,G)
| sum(C,E,G) ),
file('RNG008-2.p',unknown),
[] ).
cnf(9,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ sum(C,E,G)
| product(F,B,G) ),
file('RNG008-2.p',unknown),
[] ).
cnf(11,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('RNG008-2.p',unknown),
[] ).
cnf(12,axiom,
( ~ sum(A,B,C)
| ~ sum(A,D,C)
| B = D ),
file('RNG008-2.p',unknown),
[] ).
cnf(13,axiom,
( ~ sum(A,B,C)
| ~ sum(D,B,C)
| A = D ),
file('RNG008-2.p',unknown),
[] ).
cnf(14,axiom,
~ product(b,a,c),
file('RNG008-2.p',unknown),
[] ).
cnf(16,axiom,
sum(additive_identity,A,A),
file('RNG008-2.p',unknown),
[] ).
cnf(17,axiom,
sum(A,additive_identity,A),
file('RNG008-2.p',unknown),
[] ).
cnf(18,axiom,
product(A,B,multiply(A,B)),
file('RNG008-2.p',unknown),
[] ).
cnf(19,axiom,
sum(A,B,add(A,B)),
file('RNG008-2.p',unknown),
[] ).
cnf(20,axiom,
sum(additive_inverse(A),A,additive_identity),
file('RNG008-2.p',unknown),
[] ).
cnf(21,axiom,
sum(A,additive_inverse(A),additive_identity),
file('RNG008-2.p',unknown),
[] ).
cnf(22,axiom,
product(A,A,A),
file('RNG008-2.p',unknown),
[] ).
cnf(23,axiom,
product(a,b,c),
file('RNG008-2.p',unknown),
[] ).
cnf(32,plain,
product(c,b,c),
inference(hyper,[status(thm)],[23,5,23,22]),
[iquote('hyper,23,5,23,22')] ).
cnf(33,plain,
product(a,c,c),
inference(hyper,[status(thm)],[23,4,22,23]),
[iquote('hyper,23,4,22,23')] ).
cnf(49,plain,
multiply(A,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[18,11,22])]),
[iquote('hyper,18,11,22,flip.1')] ).
cnf(51,plain,
sum(A,multiply(additive_identity,A),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[18,8,22,18,17]),49]),
[iquote('hyper,18,8,22,18,17,demod,49')] ).
cnf(57,plain,
sum(A,multiply(A,additive_identity),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[18,6,22,18,17]),49]),
[iquote('hyper,18,6,22,18,17,demod,49')] ).
cnf(65,plain,
product(multiply(A,a),b,multiply(A,c)),
inference(hyper,[status(thm)],[18,5,18,23]),
[iquote('hyper,18,5,18,23')] ).
cnf(80,plain,
( product(A,B,C)
| ~ product(D,E,multiply(A,B))
| ~ product(D,E,C) ),
inference(para_into,[status(thm),theory(equality)],[18,11]),
[iquote('para_into,18.1.3,11.3.1')] ).
cnf(103,plain,
product(multiply(c,a),c,c),
inference(hyper,[status(thm)],[33,5,18,22]),
[iquote('hyper,33,5,18,22')] ).
cnf(106,plain,
product(A,c,multiply(multiply(A,a),c)),
inference(hyper,[status(thm)],[33,4,18,18]),
[iquote('hyper,33,4,18,18')] ).
cnf(151,plain,
add(A,additive_identity) = A,
inference(hyper,[status(thm)],[19,13,17]),
[iquote('hyper,19,13,17')] ).
cnf(153,plain,
add(additive_identity,A) = A,
inference(hyper,[status(thm)],[19,12,16]),
[iquote('hyper,19,12,16')] ).
cnf(162,plain,
product(add(c,b),b,add(c,b)),
inference(hyper,[status(thm)],[19,9,32,22,19]),
[iquote('hyper,19,9,32,22,19')] ).
cnf(217,plain,
product(a,add(c,a),add(c,a)),
inference(hyper,[status(thm)],[19,7,33,22,19]),
[iquote('hyper,19,7,33,22,19')] ).
cnf(274,plain,
sum(A,B,add(B,A)),
inference(hyper,[status(thm)],[19,3]),
[iquote('hyper,19,3')] ).
cnf(276,plain,
sum(add(A,additive_inverse(B)),B,A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[19,2,19,20]),151]),
[iquote('hyper,19,2,19,20,demod,151')] ).
cnf(279,plain,
sum(additive_inverse(A),add(A,B),B),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[19,1,20,19]),153]),
[iquote('hyper,19,1,20,19,demod,153')] ).
cnf(287,plain,
additive_inverse(additive_inverse(A)) = A,
inference(hyper,[status(thm)],[21,13,20]),
[iquote('hyper,21,13,20')] ).
cnf(299,plain,
sum(A,multiply(additive_inverse(A),A),multiply(additive_identity,A)),
inference(hyper,[status(thm)],[21,8,22,18,18]),
[iquote('hyper,21,8,22,18,18')] ).
cnf(320,plain,
sum(A,add(additive_inverse(A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[21,1,19,19]),153]),
[iquote('hyper,21,1,19,19,demod,153')] ).
cnf(419,plain,
multiply(additive_identity,A) = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[51,12,17])]),
[iquote('hyper,51,12,17,flip.1')] ).
cnf(423,plain,
sum(A,multiply(additive_inverse(A),A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[299]),419]),
[iquote('back_demod,299,demod,419')] ).
cnf(494,plain,
multiply(A,additive_identity) = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[57,12,17])]),
[iquote('hyper,57,12,17,flip.1')] ).
cnf(495,plain,
product(A,additive_identity,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[57,9,18,18,57]),494]),
[iquote('hyper,57,9,18,18,57,demod,494')] ).
cnf(719,plain,
multiply(multiply(c,a),c) = c,
inference(hyper,[status(thm)],[103,11,18]),
[iquote('hyper,103,11,18')] ).
cnf(1711,plain,
multiply(additive_inverse(A),A) = additive_inverse(A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[423,12,320]),151])]),
[iquote('hyper,423,12,320,demod,151,flip.1')] ).
cnf(1713,plain,
multiply(A,additive_inverse(A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[423,12,279]),151,287])]),
[iquote('hyper,423,12,279,demod,151,287,flip.1')] ).
cnf(1719,plain,
sum(A,A,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[423,6,22,18,495]),1711,1713]),
[iquote('hyper,423,6,22,18,495,demod,1711,1713')] ).
cnf(1723,plain,
additive_inverse(A) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1719,13,320]),151])]),
[iquote('hyper,1719,13,320,demod,151,flip.1')] ).
cnf(1763,plain,
sum(add(A,B),B,A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1719,2,19,276]),1723,151]),
[iquote('hyper,1719,2,19,276,demod,1723,151')] ).
cnf(1778,plain,
sum(A,add(A,B),B),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1719,1,19,320]),1723,153]),
[iquote('hyper,1719,1,19,320,demod,1723,153')] ).
cnf(3316,plain,
product(multiply(b,c),a,multiply(b,a)),
inference(hyper,[status(thm)],[65,5,18,22]),
[iquote('hyper,65,5,18,22')] ).
cnf(3331,plain,
product(add(c,b),c,additive_identity),
inference(hyper,[status(thm)],[162,7,22,1763,1719]),
[iquote('hyper,162,7,22,1763,1719')] ).
cnf(3334,plain,
product(b,c,c),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[3331,9,106,1778,274]),719,153]),
[iquote('hyper,3331,9,106,1778,274,demod,719,153')] ).
cnf(3392,plain,
multiply(multiply(b,a),c) = c,
inference(hyper,[status(thm)],[3334,11,106]),
[iquote('hyper,3334,11,106')] ).
cnf(3402,plain,
multiply(b,c) = c,
inference(hyper,[status(thm)],[3334,11,18]),
[iquote('hyper,3334,11,18')] ).
cnf(3447,plain,
product(c,a,multiply(b,a)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3316]),3402]),
[iquote('back_demod,3316,demod,3402')] ).
cnf(3487,plain,
multiply(c,a) = multiply(b,a),
inference(hyper,[status(thm)],[3447,11,18]),
[iquote('hyper,3447,11,18')] ).
cnf(3534,plain,
product(c,add(c,a),additive_identity),
inference(hyper,[status(thm)],[217,9,22,1763,1719]),
[iquote('hyper,217,9,22,1763,1719')] ).
cnf(3544,plain,
product(c,a,c),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[3534,7,106,1778,274]),3487,3392,153]),
[iquote('hyper,3534,7,106,1778,274,demod,3487,3392,153')] ).
cnf(3578,plain,
product(b,a,c),
inference(hyper,[status(thm)],[3544,80,3447]),
[iquote('hyper,3544,80,3447')] ).
cnf(3579,plain,
$false,
inference(binary,[status(thm)],[3578,14]),
[iquote('binary,3578.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG008-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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 02:12:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.57/2.17 ----- Otter 3.3f, August 2004 -----
% 1.57/2.17 The process was started by sandbox2 on n020.cluster.edu,
% 1.57/2.17 Wed Jul 27 02:12:53 2022
% 1.57/2.17 The command was "./otter". The process ID is 971.
% 1.57/2.17
% 1.57/2.17 set(prolog_style_variables).
% 1.57/2.17 set(auto).
% 1.57/2.17 dependent: set(auto1).
% 1.57/2.17 dependent: set(process_input).
% 1.57/2.17 dependent: clear(print_kept).
% 1.57/2.17 dependent: clear(print_new_demod).
% 1.57/2.17 dependent: clear(print_back_demod).
% 1.57/2.17 dependent: clear(print_back_sub).
% 1.57/2.17 dependent: set(control_memory).
% 1.57/2.17 dependent: assign(max_mem, 12000).
% 1.57/2.17 dependent: assign(pick_given_ratio, 4).
% 1.57/2.17 dependent: assign(stats_level, 1).
% 1.57/2.17 dependent: assign(max_seconds, 10800).
% 1.57/2.17 clear(print_given).
% 1.57/2.17
% 1.57/2.17 list(usable).
% 1.57/2.17 0 [] A=A.
% 1.57/2.17 0 [] sum(additive_identity,X,X).
% 1.57/2.17 0 [] sum(X,additive_identity,X).
% 1.57/2.17 0 [] product(X,Y,multiply(X,Y)).
% 1.57/2.17 0 [] sum(X,Y,add(X,Y)).
% 1.57/2.17 0 [] sum(additive_inverse(X),X,additive_identity).
% 1.57/2.17 0 [] sum(X,additive_inverse(X),additive_identity).
% 1.57/2.17 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.57/2.17 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.57/2.17 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.57/2.17 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.57/2.17 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.57/2.17 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.57/2.17 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.57/2.17 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.57/2.17 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.57/2.17 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.57/2.17 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.57/2.17 0 [] -sum(X,Y,Z)| -sum(X,W,Z)|Y=W.
% 1.57/2.17 0 [] -sum(X,Y,Z)| -sum(W,Y,Z)|X=W.
% 1.57/2.17 0 [] product(X,X,X).
% 1.57/2.17 0 [] product(a,b,c).
% 1.57/2.17 0 [] -product(b,a,c).
% 1.57/2.17 end_of_list.
% 1.57/2.17
% 1.57/2.17 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.57/2.17
% 1.57/2.17 This is a Horn set with equality. The strategy will be
% 1.57/2.17 Knuth-Bendix and hyper_res, with positive clauses in
% 1.57/2.17 sos and nonpositive clauses in usable.
% 1.57/2.17
% 1.57/2.17 dependent: set(knuth_bendix).
% 1.57/2.17 dependent: set(anl_eq).
% 1.57/2.17 dependent: set(para_from).
% 1.57/2.17 dependent: set(para_into).
% 1.57/2.17 dependent: clear(para_from_right).
% 1.57/2.17 dependent: clear(para_into_right).
% 1.57/2.17 dependent: set(para_from_vars).
% 1.57/2.17 dependent: set(eq_units_both_ways).
% 1.57/2.17 dependent: set(dynamic_demod_all).
% 1.57/2.17 dependent: set(dynamic_demod).
% 1.57/2.17 dependent: set(order_eq).
% 1.57/2.17 dependent: set(back_demod).
% 1.57/2.17 dependent: set(lrpo).
% 1.57/2.17 dependent: set(hyper_res).
% 1.57/2.17 dependent: clear(order_hyper).
% 1.57/2.17
% 1.57/2.17 ------------> process usable:
% 1.57/2.17 ** KEPT (pick-wt=16): 1 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.57/2.17 ** KEPT (pick-wt=16): 2 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.57/2.17 ** KEPT (pick-wt=8): 3 [] -sum(A,B,C)|sum(B,A,C).
% 1.57/2.17 ** KEPT (pick-wt=16): 4 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.57/2.17 ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.57/2.17 ** KEPT (pick-wt=20): 6 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.57/2.17 ** KEPT (pick-wt=20): 7 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.57/2.17 ** KEPT (pick-wt=20): 8 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.57/2.17 ** KEPT (pick-wt=20): 9 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.57/2.17 ** KEPT (pick-wt=11): 10 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.57/2.17 ** KEPT (pick-wt=11): 11 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.57/2.17 ** KEPT (pick-wt=11): 12 [] -sum(A,B,C)| -sum(A,D,C)|B=D.
% 1.57/2.17 ** KEPT (pick-wt=11): 13 [] -sum(A,B,C)| -sum(D,B,C)|A=D.
% 1.57/2.17 ** KEPT (pick-wt=4): 14 [] -product(b,a,c).
% 1.57/2.17
% 1.57/2.17 ------------> process sos:
% 1.57/2.17 ** KEPT (pick-wt=3): 15 [] A=A.
% 1.57/2.17 ** KEPT (pick-wt=4): 16 [] sum(additive_identity,A,A).
% 1.57/2.17 ** KEPT (pick-wt=4): 17 [] sum(A,additive_identity,A).
% 1.57/2.17 ** KEPT (pick-wt=6): 18 [] product(A,B,multiply(A,B)).
% 1.57/2.17 ** KEPT (pick-wt=6): 19 [] sum(A,B,add(A,B)).
% 1.57/2.17 ** KEPT (pick-wt=5): 20 [] sum(additive_inverse(A),A,additive_identity).
% 1.57/2.17 ** KEPT (pick-wt=5): 21 [] sum(A,additive_inverse(A),additive_identity).
% 1.57/2.17 ** KEPT (pick-wt=4): 22 [] product(A,A,A).
% 1.57/2.17 ** KEPT (pick-wt=4): 23 [] product(a,b,c).
% 1.57/2.17 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 2.90/3.08
% 2.90/3.08 ======= end of input processing =======
% 2.90/3.08
% 2.90/3.08 =========== start of search ===========
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Resetting weight limit to 8.
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Resetting weight limit to 8.
% 2.90/3.08
% 2.90/3.08 sos_size=2019
% 2.90/3.08
% 2.90/3.08 -------- PROOF --------
% 2.90/3.08
% 2.90/3.08 ----> UNIT CONFLICT at 0.91 sec ----> 3579 [binary,3578.1,14.1] $F.
% 2.90/3.08
% 2.90/3.08 Length of proof is 40. Level of proof is 15.
% 2.90/3.08
% 2.90/3.08 ---------------- PROOF ----------------
% 2.90/3.08 % SZS status Unsatisfiable
% 2.90/3.08 % SZS output start Refutation
% See solution above
% 2.90/3.08 ------------ end of proof -------------
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Search stopped by max_proofs option.
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Search stopped by max_proofs option.
% 2.90/3.08
% 2.90/3.08 ============ end of search ============
% 2.90/3.08
% 2.90/3.08 -------------- statistics -------------
% 2.90/3.08 clauses given 152
% 2.90/3.08 clauses generated 196014
% 2.90/3.08 clauses kept 3512
% 2.90/3.08 clauses forward subsumed 73648
% 2.90/3.08 clauses back subsumed 86
% 2.90/3.08 Kbytes malloced 4882
% 2.90/3.08
% 2.90/3.08 ----------- times (seconds) -----------
% 2.90/3.08 user CPU time 0.91 (0 hr, 0 min, 0 sec)
% 2.90/3.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.90/3.08 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.90/3.08
% 2.90/3.08 That finishes the proof of the theorem.
% 2.90/3.08
% 2.90/3.08 Process 971 finished Wed Jul 27 02:12:56 2022
% 2.90/3.08 Otter interrupted
% 2.90/3.08 PROOF FOUND
%------------------------------------------------------------------------------