TSTP Solution File: NUN054+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUN054+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:10:25 EDT 2022
% Result : Theorem 5.52s 5.71s
% Output : Refutation 5.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of clauses : 39 ( 23 unt; 10 nHn; 8 RR)
% Number of literals : 61 ( 23 equ; 14 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ r1(A)
| A = dollar_c1 ),
file('NUN054+2.p',unknown),
[] ).
cnf(2,axiom,
( A != dollar_c1
| r1(A) ),
file('NUN054+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ r3(A,B,C)
| C = dollar_f2(A,B) ),
file('NUN054+2.p',unknown),
[] ).
cnf(6,axiom,
( A != dollar_f2(B,C)
| r3(B,C,A) ),
file('NUN054+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ r1(A)
| A != B
| ~ r2(C,B) ),
file('NUN054+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ r1(A)
| ~ r3(A,B,C)
| ~ r1(D)
| ~ r2(D,B)
| C != E
| ~ r1(F)
| ~ r2(F,E) ),
file('NUN054+2.p',unknown),
[] ).
cnf(19,axiom,
A = A,
file('NUN054+2.p',unknown),
[] ).
cnf(20,axiom,
r2(A,dollar_f4(B,A)),
file('NUN054+2.p',unknown),
[] ).
cnf(21,axiom,
r3(A,dollar_f4(A,B),dollar_f5(A,B)),
file('NUN054+2.p',unknown),
[] ).
cnf(22,axiom,
dollar_f5(A,B) = dollar_f7(A,B),
file('NUN054+2.p',unknown),
[] ).
cnf(24,plain,
dollar_f7(A,B) = dollar_f5(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.1')] ).
cnf(25,axiom,
r2(dollar_f6(A,B),dollar_f7(A,B)),
file('NUN054+2.p',unknown),
[] ).
cnf(26,plain,
r2(dollar_f6(A,B),dollar_f5(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[25]),24]),
[iquote('copy,25,demod,24')] ).
cnf(27,axiom,
r3(A,B,dollar_f6(A,B)),
file('NUN054+2.p',unknown),
[] ).
cnf(34,axiom,
r1(dollar_f12(A)),
file('NUN054+2.p',unknown),
[] ).
cnf(35,axiom,
r3(A,dollar_f12(A),dollar_f13(A)),
file('NUN054+2.p',unknown),
[] ).
cnf(37,axiom,
dollar_f13(A) = A,
file('NUN054+2.p',unknown),
[] ).
cnf(43,axiom,
( r1(dollar_f17(A))
| r2(dollar_f19(A),dollar_f18(A)) ),
file('NUN054+2.p',unknown),
[] ).
cnf(44,axiom,
( r1(dollar_f17(A))
| A = dollar_f18(A) ),
file('NUN054+2.p',unknown),
[] ).
cnf(45,plain,
( r1(dollar_f17(A))
| dollar_f18(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[44])]),
[iquote('copy,44,flip.2')] ).
cnf(46,axiom,
( A = dollar_f17(A)
| r2(dollar_f19(A),dollar_f18(A)) ),
file('NUN054+2.p',unknown),
[] ).
cnf(47,plain,
( dollar_f17(A) = A
| r2(dollar_f19(A),dollar_f18(A)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[46])]),
[iquote('copy,46,flip.1')] ).
cnf(48,axiom,
( A = dollar_f17(A)
| A = dollar_f18(A) ),
file('NUN054+2.p',unknown),
[] ).
cnf(49,plain,
( dollar_f17(A) = A
| dollar_f18(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[48])])]),
[iquote('copy,48,flip.1,flip.2')] ).
cnf(51,plain,
r3(A,dollar_f12(A),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[35]),37]),
[iquote('back_demod,35,demod,37')] ).
cnf(54,plain,
r3(A,B,dollar_f2(A,B)),
inference(hyper,[status(thm)],[19,6]),
[iquote('hyper,19,6')] ).
cnf(56,plain,
r1(dollar_c1),
inference(hyper,[status(thm)],[19,2]),
[iquote('hyper,19,2')] ).
cnf(62,plain,
dollar_f12(A) = dollar_c1,
inference(hyper,[status(thm)],[34,1]),
[iquote('hyper,34,1')] ).
cnf(63,plain,
r3(A,dollar_c1,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[51]),62]),
[iquote('back_demod,51,demod,62')] ).
cnf(90,plain,
dollar_f2(A,dollar_c1) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[63,5])]),
[iquote('hyper,63,5,flip.1')] ).
cnf(96,plain,
dollar_f5(A,B) = dollar_f2(A,dollar_f4(A,B)),
inference(hyper,[status(thm)],[21,5]),
[iquote('hyper,21,5')] ).
cnf(97,plain,
r2(dollar_f6(A,B),dollar_f2(A,dollar_f4(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[26]),96]),
[iquote('back_demod,26,demod,96')] ).
cnf(111,plain,
dollar_f6(A,B) = dollar_f2(A,B),
inference(hyper,[status(thm)],[27,5]),
[iquote('hyper,27,5')] ).
cnf(112,plain,
r2(dollar_f2(A,B),dollar_f2(A,dollar_f4(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[97]),111]),
[iquote('back_demod,97,demod,111')] ).
cnf(300,plain,
( r1(A)
| r2(dollar_f19(A),dollar_f18(A)) ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[47,43])]),
[iquote('para_from,47.1.1,43.1.1,factor_simp')] ).
cnf(364,plain,
( r1(A)
| dollar_f18(A) = A ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[49,45])]),
[iquote('para_from,49.1.1,45.1.1,factor_simp')] ).
cnf(531,plain,
( r1(A)
| r2(dollar_f19(A),A) ),
inference(factor_simp,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[300,364])]),
[iquote('para_into,300.2.2,364.2.1,factor_simp')] ).
cnf(2538,plain,
r2(dollar_f19(A),A),
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[112,11,531,54,56,20,19,531]),90,90])]),
[iquote('hyper,112,11,531,54,56,20,19,531,demod,90,90,factor_simp')] ).
cnf(2552,plain,
$false,
inference(hyper,[status(thm)],[2538,10,56,19]),
[iquote('hyper,2538,10,56,19')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUN054+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:47:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.19 ----- Otter 3.3f, August 2004 -----
% 1.99/2.19 The process was started by sandbox2 on n025.cluster.edu,
% 1.99/2.19 Wed Jul 27 02:47:15 2022
% 1.99/2.19 The command was "./otter". The process ID is 9936.
% 1.99/2.19
% 1.99/2.19 set(prolog_style_variables).
% 1.99/2.19 set(auto).
% 1.99/2.19 dependent: set(auto1).
% 1.99/2.19 dependent: set(process_input).
% 1.99/2.19 dependent: clear(print_kept).
% 1.99/2.19 dependent: clear(print_new_demod).
% 1.99/2.19 dependent: clear(print_back_demod).
% 1.99/2.19 dependent: clear(print_back_sub).
% 1.99/2.19 dependent: set(control_memory).
% 1.99/2.19 dependent: assign(max_mem, 12000).
% 1.99/2.19 dependent: assign(pick_given_ratio, 4).
% 1.99/2.19 dependent: assign(stats_level, 1).
% 1.99/2.19 dependent: assign(max_seconds, 10800).
% 1.99/2.19 clear(print_given).
% 1.99/2.19
% 1.99/2.19 formula_list(usable).
% 1.99/2.19 all A (A=A).
% 1.99/2.19 exists Y24 all X19 (-r1(X19)&X19!=Y24|r1(X19)&X19=Y24).
% 1.99/2.19 all X11 exists Y21 all X12 (-r2(X11,X12)&X12!=Y21|r2(X11,X12)&X12=Y21).
% 1.99/2.19 all X13 X14 exists Y22 all X15 (-r3(X13,X14,X15)&X15!=Y22|r3(X13,X14,X15)&X15=Y22).
% 1.99/2.19 all X16 X17 exists Y23 all X18 (-r4(X16,X17,X18)&X18!=Y23|r4(X16,X17,X18)&X18=Y23).
% 1.99/2.19 all X1 X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15)&r3(X1,Y15,Y5)))&Y5=Y4))& (exists Y7 (r2(Y7,Y4)&r3(X1,X8,Y7)))).
% 1.99/2.19 all X2 X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14)&r4(X2,Y14,Y3)))&Y3=Y2))& (exists Y6 (r3(Y6,X2,Y2)&r4(X2,X9,Y6)))).
% 1.99/2.19 all X3 X10 ((all Y12 ((all Y13 (-r2(X3,Y13)|Y13!=Y12))| -r2(X10,Y12)))|X3=X10).
% 1.99/2.19 all X4 exists Y9 ((exists Y16 (r1(Y16)&r3(X4,Y16,Y9)))&Y9=X4).
% 1.99/2.19 all X5 exists Y8 ((exists Y17 (r1(Y17)&r4(X5,Y17,Y8)))& (exists Y18 (r1(Y18)&Y8=Y18))).
% 1.99/2.19 all X6 ((exists Y19 (r1(Y19)&X6=Y19))| (exists Y1 Y11 (r2(Y1,Y11)&X6=Y11))).
% 1.99/2.19 all X7 Y10 ((all Y20 (-r1(Y20)|Y20!=Y10))| -r2(X7,Y10)).
% 1.99/2.19 -(exists Y1 ((exists Y2 ((exists Y4 (r1(Y4)&r3(Y4,Y2,Y1)))& (exists Y5 (r1(Y5)&r2(Y5,Y2)))))& (exists Y3 (Y1=Y3& (exists Y6 (r1(Y6)&r2(Y6,Y3))))))).
% 1.99/2.19 end_of_list.
% 1.99/2.19
% 1.99/2.19 -------> usable clausifies to:
% 1.99/2.19
% 1.99/2.19 list(usable).
% 1.99/2.19 0 [] A=A.
% 1.99/2.19 0 [] -r1(X19)|X19=$c1.
% 1.99/2.19 0 [] X19!=$c1|r1(X19).
% 1.99/2.19 0 [] -r2(X11,X12)|X12=$f1(X11).
% 1.99/2.19 0 [] X12!=$f1(X11)|r2(X11,X12).
% 1.99/2.19 0 [] -r3(X13,X14,X15)|X15=$f2(X13,X14).
% 1.99/2.19 0 [] X15!=$f2(X13,X14)|r3(X13,X14,X15).
% 1.99/2.19 0 [] -r4(X16,X17,X18)|X18=$f3(X16,X17).
% 1.99/2.19 0 [] X18!=$f3(X16,X17)|r4(X16,X17,X18).
% 1.99/2.19 0 [] r2(X8,$f4(X1,X8)).
% 1.99/2.19 0 [] r3(X1,$f4(X1,X8),$f5(X1,X8)).
% 1.99/2.19 0 [] $f5(X1,X8)=$f7(X1,X8).
% 1.99/2.19 0 [] r2($f6(X1,X8),$f7(X1,X8)).
% 1.99/2.19 0 [] r3(X1,X8,$f6(X1,X8)).
% 1.99/2.19 0 [] r2(X9,$f8(X2,X9)).
% 1.99/2.19 0 [] r4(X2,$f8(X2,X9),$f9(X2,X9)).
% 1.99/2.19 0 [] $f9(X2,X9)=$f11(X2,X9).
% 1.99/2.19 0 [] r3($f10(X2,X9),X2,$f11(X2,X9)).
% 1.99/2.19 0 [] r4(X2,X9,$f10(X2,X9)).
% 1.99/2.19 0 [] -r2(X3,Y13)|Y13!=Y12| -r2(X10,Y12)|X3=X10.
% 1.99/2.19 0 [] r1($f12(X4)).
% 1.99/2.19 0 [] r3(X4,$f12(X4),$f13(X4)).
% 1.99/2.19 0 [] $f13(X4)=X4.
% 1.99/2.19 0 [] r1($f14(X5)).
% 1.99/2.19 0 [] r4(X5,$f14(X5),$f16(X5)).
% 1.99/2.19 0 [] r1($f15(X5)).
% 1.99/2.19 0 [] $f16(X5)=$f15(X5).
% 1.99/2.19 0 [] r1($f17(X6))|r2($f19(X6),$f18(X6)).
% 1.99/2.19 0 [] r1($f17(X6))|X6=$f18(X6).
% 1.99/2.19 0 [] X6=$f17(X6)|r2($f19(X6),$f18(X6)).
% 1.99/2.19 0 [] X6=$f17(X6)|X6=$f18(X6).
% 1.99/2.19 0 [] -r1(Y20)|Y20!=Y10| -r2(X7,Y10).
% 1.99/2.19 0 [] -r1(Y4)| -r3(Y4,Y2,Y1)| -r1(Y5)| -r2(Y5,Y2)|Y1!=Y3| -r1(Y6)| -r2(Y6,Y3).
% 1.99/2.19 end_of_list.
% 1.99/2.19
% 1.99/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.99/2.19
% 1.99/2.19 This ia a non-Horn set with equality. The strategy will be
% 1.99/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.99/2.19 deletion, with positive clauses in sos and nonpositive
% 1.99/2.19 clauses in usable.
% 1.99/2.19
% 1.99/2.19 dependent: set(knuth_bendix).
% 1.99/2.19 dependent: set(anl_eq).
% 1.99/2.19 dependent: set(para_from).
% 1.99/2.19 dependent: set(para_into).
% 1.99/2.19 dependent: clear(para_from_right).
% 1.99/2.19 dependent: clear(para_into_right).
% 1.99/2.19 dependent: set(para_from_vars).
% 1.99/2.19 dependent: set(eq_units_both_ways).
% 1.99/2.19 dependent: set(dynamic_demod_all).
% 1.99/2.19 dependent: set(dynamic_demod).
% 1.99/2.19 dependent: set(order_eq).
% 1.99/2.19 dependent: set(back_demod).
% 1.99/2.19 dependent: set(lrpo).
% 1.99/2.19 dependent: set(hyper_res).
% 1.99/2.19 dependent: set(unit_deletion).
% 1.99/2.19 dependent: set(factor).
% 1.99/2.19
% 1.99/2.19 ------------> process usable:
% 1.99/2.19 ** KEPT (pick-wt=5): 1 [] -r1(A)|A=$c1.
% 1.99/2.19 ** KEPT (pick-wt=5): 2 [] A!=$c1|r1(A).
% 1.99/2.19 ** KEPT (pick-wt=7): 3 [] -r2(A,B)|B=$f1(A).
% 1.99/2.19 ** KEPT (pick-wt=7): 4 [] A!=$f1(B)|r2(B,A).
% 1.99/2.19 ** KEPT (pick-wt=9): 5 [] -r3(A,B,C)|C=$f2(A,B).
% 1.99/2.19 ** KEPT (pick-wt=9): 6 [] A!=$f2(B,C)|r3(B,C,A).
% 1.99/2.19 ** KEPT (pick-wt=9): 7 [] -r4(A,B,C)|C=$f3(A,B).
% 1.99/2.19 ** KEPT (pick-wt=9): 8 [] A!=$f3(B,C)|r4(B,C,A).
% 1.99/2.19 ** KEPT (pick-wt=12): 9 [] -r2(A,B)|B!=C| -r2(D,C)|A=D.
% 1.99/2.19 ** KEPT (pick-wt=8): 10 [] -r1(A)|A!=B| -r2(C,B).
% 5.52/5.70 ** KEPT (pick-wt=19): 11 [] -r1(A)| -r3(A,B,C)| -r1(D)| -r2(D,B)|C!=E| -r1(F)| -r2(F,E).
% 5.52/5.70
% 5.52/5.70 ------------> process sos:
% 5.52/5.70 ** KEPT (pick-wt=3): 19 [] A=A.
% 5.52/5.70 ** KEPT (pick-wt=5): 20 [] r2(A,$f4(B,A)).
% 5.52/5.70 ** KEPT (pick-wt=8): 21 [] r3(A,$f4(A,B),$f5(A,B)).
% 5.52/5.70 ** KEPT (pick-wt=7): 23 [copy,22,flip.1] $f7(A,B)=$f5(A,B).
% 5.52/5.70 ---> New Demodulator: 24 [new_demod,23] $f7(A,B)=$f5(A,B).
% 5.52/5.70 ** KEPT (pick-wt=7): 26 [copy,25,demod,24] r2($f6(A,B),$f5(A,B)).
% 5.52/5.70 ** KEPT (pick-wt=6): 27 [] r3(A,B,$f6(A,B)).
% 5.52/5.70 ** KEPT (pick-wt=5): 28 [] r2(A,$f8(B,A)).
% 5.52/5.70 ** KEPT (pick-wt=8): 29 [] r4(A,$f8(A,B),$f9(A,B)).
% 5.52/5.70 ** KEPT (pick-wt=7): 30 [] $f9(A,B)=$f11(A,B).
% 5.52/5.70 ---> New Demodulator: 31 [new_demod,30] $f9(A,B)=$f11(A,B).
% 5.52/5.70 ** KEPT (pick-wt=8): 32 [] r3($f10(A,B),A,$f11(A,B)).
% 5.52/5.70 ** KEPT (pick-wt=6): 33 [] r4(A,B,$f10(A,B)).
% 5.52/5.70 ** KEPT (pick-wt=3): 34 [] r1($f12(A)).
% 5.52/5.70 ** KEPT (pick-wt=6): 35 [] r3(A,$f12(A),$f13(A)).
% 5.52/5.70 ** KEPT (pick-wt=4): 36 [] $f13(A)=A.
% 5.52/5.70 ---> New Demodulator: 37 [new_demod,36] $f13(A)=A.
% 5.52/5.70 ** KEPT (pick-wt=3): 38 [] r1($f14(A)).
% 5.52/5.70 ** KEPT (pick-wt=6): 39 [] r4(A,$f14(A),$f16(A)).
% 5.52/5.70 ** KEPT (pick-wt=3): 40 [] r1($f15(A)).
% 5.52/5.70 ** KEPT (pick-wt=5): 41 [] $f16(A)=$f15(A).
% 5.52/5.70 ---> New Demodulator: 42 [new_demod,41] $f16(A)=$f15(A).
% 5.52/5.70 ** KEPT (pick-wt=8): 43 [] r1($f17(A))|r2($f19(A),$f18(A)).
% 5.52/5.70 ** KEPT (pick-wt=7): 45 [copy,44,flip.2] r1($f17(A))|$f18(A)=A.
% 5.52/5.70 ** KEPT (pick-wt=9): 47 [copy,46,flip.1] $f17(A)=A|r2($f19(A),$f18(A)).
% 5.52/5.70 ** KEPT (pick-wt=8): 49 [copy,48,flip.1,flip.2] $f17(A)=A|$f18(A)=A.
% 5.52/5.70 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 5.52/5.70 19 back subsumes 12.
% 5.52/5.70 >>>> Starting back demodulation with 24.
% 5.52/5.70 >>>> Starting back demodulation with 31.
% 5.52/5.70 >> back demodulating 29 with 31.
% 5.52/5.70 >>>> Starting back demodulation with 37.
% 5.52/5.70 >> back demodulating 35 with 37.
% 5.52/5.70 >>>> Starting back demodulation with 42.
% 5.52/5.70 >> back demodulating 39 with 42.
% 5.52/5.70
% 5.52/5.70 ======= end of input processing =======
% 5.52/5.70
% 5.52/5.70 =========== start of search ===========
% 5.52/5.70
% 5.52/5.70
% 5.52/5.70 Resetting weight limit to 8.
% 5.52/5.70
% 5.52/5.70
% 5.52/5.70 Resetting weight limit to 8.
% 5.52/5.70
% 5.52/5.70 sos_size=1946
% 5.52/5.70
% 5.52/5.70 -------- PROOF --------
% 5.52/5.70
% 5.52/5.70 -----> EMPTY CLAUSE at 3.51 sec ----> 2552 [hyper,2538,10,56,19] $F.
% 5.52/5.71
% 5.52/5.71 Length of proof is 19. Level of proof is 5.
% 5.52/5.71
% 5.52/5.71 ---------------- PROOF ----------------
% 5.52/5.71 % SZS status Theorem
% 5.52/5.71 % SZS output start Refutation
% See solution above
% 5.52/5.71 ------------ end of proof -------------
% 5.52/5.71
% 5.52/5.71
% 5.52/5.71 Search stopped by max_proofs option.
% 5.52/5.71
% 5.52/5.71
% 5.52/5.71 Search stopped by max_proofs option.
% 5.52/5.71
% 5.52/5.71 ============ end of search ============
% 5.52/5.71
% 5.52/5.71 -------------- statistics -------------
% 5.52/5.71 clauses given 152
% 5.52/5.71 clauses generated 46487
% 5.52/5.71 clauses kept 2500
% 5.52/5.71 clauses forward subsumed 12860
% 5.52/5.71 clauses back subsumed 971
% 5.52/5.71 Kbytes malloced 4882
% 5.52/5.71
% 5.52/5.71 ----------- times (seconds) -----------
% 5.52/5.71 user CPU time 3.51 (0 hr, 0 min, 3 sec)
% 5.52/5.71 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 5.52/5.71 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 5.52/5.71
% 5.52/5.71 That finishes the proof of the theorem.
% 5.52/5.71
% 5.52/5.71 Process 9936 finished Wed Jul 27 02:47:20 2022
% 5.52/5.71 Otter interrupted
% 5.52/5.71 PROOF FOUND
%------------------------------------------------------------------------------