TSTP Solution File: NUM840+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:04 EDT 2022
% Result : Theorem 2.02s 2.20s
% Output : Refutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 11 unt; 8 nHn; 18 RR)
% Number of literals : 43 ( 21 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ less(vd328,vd329),
file('NUM840+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ less(A,B)
| less(vplus(A,C),vplus(B,C)) ),
file('NUM840+2.p',unknown),
[] ).
cnf(8,axiom,
( ~ less(A,B)
| greater(B,A) ),
file('NUM840+2.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(A,B)
| less(B,A) ),
file('NUM840+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ greater(A,B)
| ~ less(A,B) ),
file('NUM840+2.p',unknown),
[] ).
cnf(12,axiom,
( A != B
| ~ greater(A,B) ),
file('NUM840+2.p',unknown),
[] ).
cnf(20,axiom,
( A != vplus(B,C)
| B != vplus(A,D) ),
file('NUM840+2.p',unknown),
[] ).
cnf(25,plain,
vplus(A,B) != A,
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[20])]),
[iquote('factor,20.1.2,flip.1')] ).
cnf(27,axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('NUM840+2.p',unknown),
[] ).
cnf(28,axiom,
( A = B
| greater(A,B)
| less(A,B) ),
file('NUM840+2.p',unknown),
[] ).
cnf(29,axiom,
( A = B
| A = vplus(B,dollar_f3(A,B))
| B = vplus(A,dollar_f4(A,B)) ),
file('NUM840+2.p',unknown),
[] ).
cnf(30,plain,
( A = B
| vplus(B,dollar_f3(A,B)) = A
| vplus(A,dollar_f4(A,B)) = B ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[29])])]),
[iquote('copy,29,flip.2,flip.3')] ).
cnf(31,axiom,
vplus(A,B) = vplus(B,A),
file('NUM840+2.p',unknown),
[] ).
cnf(39,axiom,
vplus(vplus(A,B),C) = vplus(A,vplus(B,C)),
file('NUM840+2.p',unknown),
[] ).
cnf(58,plain,
greater(vplus(vd329,vd330),vplus(vd328,vd330)),
inference(hyper,[status(thm)],[27,8]),
[iquote('hyper,27,8')] ).
cnf(71,plain,
( A = B
| greater(A,B)
| less(vplus(A,C),vplus(B,C)) ),
inference(hyper,[status(thm)],[28,5]),
[iquote('hyper,28,5')] ).
cnf(72,plain,
( vd329 = vd328
| greater(vd328,vd329) ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,1])]),
[iquote('hyper,28,1,flip.1')] ).
cnf(111,plain,
( vd329 = vd328
| less(vd329,vd328) ),
inference(hyper,[status(thm)],[72,9]),
[iquote('hyper,72,9')] ).
cnf(318,plain,
greater(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(para_into,[status(thm),theory(equality)],[58,31]),
[iquote('para_into,58.1.1,31.1.1')] ).
cnf(354,plain,
vplus(A,vplus(B,C)) != vplus(A,B),
inference(para_from,[status(thm),theory(equality)],[39,25]),
[iquote('para_from,38.1.1,25.1.1')] ).
cnf(468,plain,
greater(vplus(vd330,vd329),vplus(vd330,vd328)),
inference(para_into,[status(thm),theory(equality)],[318,31]),
[iquote('para_into,318.1.2,31.1.1')] ).
cnf(790,plain,
( vplus(vd330,vplus(vd328,dollar_f3(vplus(vd330,vd329),vplus(vd330,vd328)))) = vplus(vd330,vd329)
| vplus(vd330,vplus(vd329,dollar_f4(vplus(vd330,vd329),vplus(vd330,vd328)))) = vplus(vd330,vd328) ),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[468,12,30]),39,39]),
[iquote('hyper,468,12,30,demod,39,39')] ).
cnf(1010,plain,
( vd329 = vd328
| greater(vd329,vd328) ),
inference(hyper,[status(thm)],[71,11,58]),
[iquote('hyper,71,11,58')] ).
cnf(1016,plain,
vd329 = vd328,
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1010,11,111])]),
[iquote('hyper,1010,11,111,factor_simp')] ).
cnf(1028,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[790]),1016,1016,1016,1016]),354,354]),
[iquote('back_demod,790,demod,1016,1016,1016,1016,unit_del,354,354')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 09:34:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.82/2.01 ----- Otter 3.3f, August 2004 -----
% 1.82/2.01 The process was started by sandbox2 on n022.cluster.edu,
% 1.82/2.01 Wed Jul 27 09:34:20 2022
% 1.82/2.01 The command was "./otter". The process ID is 24956.
% 1.82/2.01
% 1.82/2.01 set(prolog_style_variables).
% 1.82/2.01 set(auto).
% 1.82/2.01 dependent: set(auto1).
% 1.82/2.01 dependent: set(process_input).
% 1.82/2.01 dependent: clear(print_kept).
% 1.82/2.01 dependent: clear(print_new_demod).
% 1.82/2.01 dependent: clear(print_back_demod).
% 1.82/2.01 dependent: clear(print_back_sub).
% 1.82/2.01 dependent: set(control_memory).
% 1.82/2.01 dependent: assign(max_mem, 12000).
% 1.82/2.01 dependent: assign(pick_given_ratio, 4).
% 1.82/2.01 dependent: assign(stats_level, 1).
% 1.82/2.01 dependent: assign(max_seconds, 10800).
% 1.82/2.01 clear(print_given).
% 1.82/2.01
% 1.82/2.01 formula_list(usable).
% 1.82/2.01 all A (A=A).
% 1.82/2.01 -less(vd328,vd329).
% 1.82/2.01 less(vplus(vd328,vd330),vplus(vd329,vd330)).
% 1.82/2.01 vplus(vd328,vd330)=vplus(vd329,vd330)->vd328=vd329.
% 1.82/2.01 greater(vplus(vd328,vd330),vplus(vd329,vd330))->greater(vd328,vd329).
% 1.82/2.01 all Vd301 Vd302 Vd303 (less(Vd301,Vd302)->less(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 1.82/2.01 all Vd301 Vd302 Vd303 (Vd301=Vd302->vplus(Vd301,Vd303)=vplus(Vd302,Vd303)).
% 1.82/2.01 all Vd301 Vd302 Vd303 (greater(Vd301,Vd302)->greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 1.82/2.01 all Vd226 Vd227 (less(Vd226,Vd227)->greater(Vd227,Vd226)).
% 1.82/2.01 all Vd208 Vd209 (greater(Vd208,Vd209)->less(Vd209,Vd208)).
% 1.82/2.01 all Vd203 Vd204 (Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204)).
% 1.82/2.01 all Vd203 Vd204 (Vd203!=Vd204| -less(Vd203,Vd204)).
% 1.82/2.01 all Vd203 Vd204 (-greater(Vd203,Vd204)| -less(Vd203,Vd204)).
% 1.82/2.01 all Vd203 Vd204 (Vd203!=Vd204| -greater(Vd203,Vd204)).
% 1.82/2.01 all Vd198 Vd199 (less(Vd199,Vd198)<-> (exists Vd201 (Vd198=vplus(Vd199,Vd201)))).
% 1.82/2.01 all Vd193 Vd194 (greater(Vd194,Vd193)<-> (exists Vd196 (Vd194=vplus(Vd193,Vd196)))).
% 1.82/2.01 all Vd120 Vd121 (Vd120=Vd121| (exists Vd123 (Vd120=vplus(Vd121,Vd123)))| (exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.82/2.01 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.82/2.01 all Vd120 Vd121 (-(exists Vd123 (Vd120=vplus(Vd121,Vd123)))| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.82/2.01 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd123 (Vd120=vplus(Vd121,Vd123)))).
% 1.82/2.01 all Vd104 Vd105 (Vd104!=Vd105-> (all Vd107 (vplus(Vd107,Vd104)!=vplus(Vd107,Vd105)))).
% 1.82/2.01 all Vd92 Vd93 (Vd93!=vplus(Vd92,Vd93)).
% 1.82/2.01 all Vd78 Vd79 (vplus(Vd79,Vd78)=vplus(Vd78,Vd79)).
% 1.82/2.01 all Vd68 Vd69 (vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69))).
% 1.82/2.01 all Vd59 (vplus(v1,Vd59)=vsucc(Vd59)).
% 1.82/2.01 all Vd46 Vd47 Vd48 (vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48))).
% 1.82/2.01 all Vd42 Vd43 (vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43))&vplus(Vd42,v1)=vsucc(Vd42)).
% 1.82/2.01 end_of_list.
% 1.82/2.01
% 1.82/2.01 -------> usable clausifies to:
% 1.82/2.01
% 1.82/2.01 list(usable).
% 1.82/2.01 0 [] A=A.
% 1.82/2.01 0 [] -less(vd328,vd329).
% 1.82/2.01 0 [] less(vplus(vd328,vd330),vplus(vd329,vd330)).
% 1.82/2.01 0 [] vplus(vd328,vd330)!=vplus(vd329,vd330)|vd328=vd329.
% 1.82/2.01 0 [] -greater(vplus(vd328,vd330),vplus(vd329,vd330))|greater(vd328,vd329).
% 1.82/2.01 0 [] -less(Vd301,Vd302)|less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 1.82/2.01 0 [] Vd301!=Vd302|vplus(Vd301,Vd303)=vplus(Vd302,Vd303).
% 1.82/2.01 0 [] -greater(Vd301,Vd302)|greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 1.82/2.01 0 [] -less(Vd226,Vd227)|greater(Vd227,Vd226).
% 1.82/2.01 0 [] -greater(Vd208,Vd209)|less(Vd209,Vd208).
% 1.82/2.01 0 [] Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204).
% 1.82/2.01 0 [] Vd203!=Vd204| -less(Vd203,Vd204).
% 1.82/2.01 0 [] -greater(Vd203,Vd204)| -less(Vd203,Vd204).
% 1.82/2.01 0 [] Vd203!=Vd204| -greater(Vd203,Vd204).
% 1.82/2.01 0 [] -less(Vd199,Vd198)|Vd198=vplus(Vd199,$f1(Vd198,Vd199)).
% 1.82/2.01 0 [] less(Vd199,Vd198)|Vd198!=vplus(Vd199,Vd201).
% 1.82/2.01 0 [] -greater(Vd194,Vd193)|Vd194=vplus(Vd193,$f2(Vd193,Vd194)).
% 1.82/2.01 0 [] greater(Vd194,Vd193)|Vd194!=vplus(Vd193,Vd196).
% 1.82/2.01 0 [] Vd120=Vd121|Vd120=vplus(Vd121,$f3(Vd120,Vd121))|Vd121=vplus(Vd120,$f4(Vd120,Vd121)).
% 1.82/2.01 0 [] Vd120!=Vd121|Vd121!=vplus(Vd120,Vd125).
% 1.82/2.01 0 [] Vd120!=vplus(Vd121,Vd123)|Vd121!=vplus(Vd120,Vd125).
% 1.82/2.01 0 [] Vd120!=Vd121|Vd120!=vplus(Vd121,Vd123).
% 1.82/2.01 0 [] Vd104=Vd105|vplus(Vd107,Vd104)!=vplus(Vd107,Vd105).
% 1.82/2.01 0 [] Vd93!=vplus(Vd92,Vd93).
% 1.82/2.01 0 [] vplus(Vd79,Vd78)=vplus(Vd78,Vd79).
% 1.82/2.01 0 [] vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69)).
% 1.82/2.01 0 [] vplus(v1,Vd59)=vsucc(Vd59).
% 1.82/2.01 0 [] vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48)).
% 1.82/2.01 0 [] vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43)).
% 1.82/2.01 0 [] vplus(Vd42,v1)=vsucc(Vd42).
% 1.82/2.01 end_of_list.
% 1.82/2.01
% 1.82/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.02/2.20
% 2.02/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.20 deletion, with positive clauses in sos and nonpositive
% 2.02/2.20 clauses in usable.
% 2.02/2.20
% 2.02/2.20 dependent: set(knuth_bendix).
% 2.02/2.20 dependent: set(anl_eq).
% 2.02/2.20 dependent: set(para_from).
% 2.02/2.20 dependent: set(para_into).
% 2.02/2.20 dependent: clear(para_from_right).
% 2.02/2.20 dependent: clear(para_into_right).
% 2.02/2.20 dependent: set(para_from_vars).
% 2.02/2.20 dependent: set(eq_units_both_ways).
% 2.02/2.20 dependent: set(dynamic_demod_all).
% 2.02/2.20 dependent: set(dynamic_demod).
% 2.02/2.20 dependent: set(order_eq).
% 2.02/2.20 dependent: set(back_demod).
% 2.02/2.20 dependent: set(lrpo).
% 2.02/2.20 dependent: set(hyper_res).
% 2.02/2.20 dependent: set(unit_deletion).
% 2.02/2.20 dependent: set(factor).
% 2.02/2.20
% 2.02/2.20 ------------> process usable:
% 2.02/2.20 ** KEPT (pick-wt=3): 1 [] -less(vd328,vd329).
% 2.02/2.20 ** KEPT (pick-wt=10): 3 [copy,2,flip.1,flip.2] vplus(vd329,vd330)!=vplus(vd328,vd330)|vd329=vd328.
% 2.02/2.20 ** KEPT (pick-wt=10): 4 [] -greater(vplus(vd328,vd330),vplus(vd329,vd330))|greater(vd328,vd329).
% 2.02/2.20 ** KEPT (pick-wt=10): 5 [] -less(A,B)|less(vplus(A,C),vplus(B,C)).
% 2.02/2.20 ** KEPT (pick-wt=10): 6 [] A!=B|vplus(A,C)=vplus(B,C).
% 2.02/2.20 ** KEPT (pick-wt=10): 7 [] -greater(A,B)|greater(vplus(A,C),vplus(B,C)).
% 2.02/2.20 ** KEPT (pick-wt=6): 8 [] -less(A,B)|greater(B,A).
% 2.02/2.20 ** KEPT (pick-wt=6): 9 [] -greater(A,B)|less(B,A).
% 2.02/2.20 ** KEPT (pick-wt=6): 10 [] A!=B| -less(A,B).
% 2.02/2.20 ** KEPT (pick-wt=6): 11 [] -greater(A,B)| -less(A,B).
% 2.02/2.20 ** KEPT (pick-wt=6): 12 [] A!=B| -greater(A,B).
% 2.02/2.20 ** KEPT (pick-wt=10): 14 [copy,13,flip.2] -less(A,B)|vplus(A,$f1(B,A))=B.
% 2.02/2.20 ** KEPT (pick-wt=8): 15 [] less(A,B)|B!=vplus(A,C).
% 2.02/2.20 ** KEPT (pick-wt=10): 17 [copy,16,flip.2] -greater(A,B)|vplus(B,$f2(B,A))=A.
% 2.02/2.20 ** KEPT (pick-wt=8): 18 [] greater(A,B)|A!=vplus(B,C).
% 2.02/2.20 ** KEPT (pick-wt=8): 19 [] A!=B|B!=vplus(A,C).
% 2.02/2.20 ** KEPT (pick-wt=10): 20 [] A!=vplus(B,C)|B!=vplus(A,D).
% 2.02/2.20 ** KEPT (pick-wt=8): 21 [] A!=B|A!=vplus(B,C).
% 2.02/2.20 ** KEPT (pick-wt=10): 22 [] A=B|vplus(C,A)!=vplus(C,B).
% 2.02/2.20 ** KEPT (pick-wt=5): 24 [copy,23,flip.1] vplus(A,B)!=B.
% 2.02/2.20
% 2.02/2.20 ------------> process sos:
% 2.02/2.20 ** KEPT (pick-wt=3): 26 [] A=A.
% 2.02/2.20 ** KEPT (pick-wt=7): 27 [] less(vplus(vd328,vd330),vplus(vd329,vd330)).
% 2.02/2.20 ** KEPT (pick-wt=9): 28 [] A=B|greater(A,B)|less(A,B).
% 2.02/2.20 ** KEPT (pick-wt=17): 30 [copy,29,flip.2,flip.3] A=B|vplus(B,$f3(A,B))=A|vplus(A,$f4(A,B))=B.
% 2.02/2.20 ** KEPT (pick-wt=7): 31 [] vplus(A,B)=vplus(B,A).
% 2.02/2.20 ** KEPT (pick-wt=9): 33 [copy,32,flip.1] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.02/2.20 ---> New Demodulator: 34 [new_demod,33] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.02/2.20 ** KEPT (pick-wt=6): 36 [copy,35,flip.1] vsucc(A)=vplus(v1,A).
% 2.02/2.20 ---> New Demodulator: 37 [new_demod,36] vsucc(A)=vplus(v1,A).
% 2.02/2.20 ** KEPT (pick-wt=11): 38 [] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.02/2.20 ---> New Demodulator: 39 [new_demod,38] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.02/2.20 ** KEPT (pick-wt=11): 41 [copy,40,demod,37,37] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.02/2.20 Following clause subsumed by 31 during input processing: 0 [demod,37] vplus(A,v1)=vplus(v1,A).
% 2.02/2.20 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] A=A.
% 2.02/2.20 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] vplus(A,B)=vplus(B,A).
% 2.02/2.20 >>>> Starting back demodulation with 34.
% 2.02/2.20 >>>> Starting back demodulation with 37.
% 2.02/2.20 >> back demodulating 33 with 37.
% 2.02/2.20 >>>> Starting back demodulation with 39.
% 2.02/2.20 ** KEPT (pick-wt=11): 42 [copy,41,flip.1] vplus(v1,vplus(A,B))=vplus(A,vplus(v1,B)).
% 2.02/2.20 Following clause subsumed by 41 during input processing: 0 [copy,42,flip.1] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.02/2.20
% 2.02/2.20 ======= end of input processing =======
% 2.02/2.20
% 2.02/2.20 =========== start of search ===========
% 2.02/2.20
% 2.02/2.20
% 2.02/2.20 Resetting weight limit to 9.
% 2.02/2.20
% 2.02/2.20
% 2.02/2.20 Resetting weight limit to 9.
% 2.02/2.20
% 2.02/2.20 sos_size=742
% 2.02/2.20
% 2.02/2.20
% 2.02/2.20 Resetting weight limit to 8.
% 2.02/2.20
% 2.02/2.20
% 2.02/2.20 Resetting weight limit to 8.
% 2.02/2.20
% 2.02/2.20 sos_size=800
% 2.02/2.20
% 2.02/2.20 -------- PROOF --------
% 2.02/2.20
% 2.02/2.20 -----> EMPTY CLAUSE at 0.19 sec ----> 1028 [back_demod,790,demod,1016,1016,1016,1016,unit_del,354,354] $F.
% 2.02/2.20
% 2.02/2.20 Length of proof is 12. Level of proof is 4.
% 2.02/2.20
% 2.02/2.20 ---------------- PROOF ----------------
% 2.02/2.20 % SZS status Theorem
% 2.02/2.20 % SZS output start Refutation
% See solution above
% 2.02/2.20 ------------ end of proof -------------
% 2.02/2.20
% 2.02/2.20
% 2.02/2.20 Search stopped by max_proofs option.
% 2.02/2.20
% 2.02/2.20
% 2.02/2.20 Search stopped by max_proofs option.
% 2.02/2.20
% 2.02/2.20 ============ end of search ============
% 2.02/2.20
% 2.02/2.20 -------------- statistics -------------
% 2.02/2.20 clauses given 122
% 2.02/2.20 clauses generated 5458
% 2.02/2.20 clauses kept 980
% 2.02/2.20 clauses forward subsumed 966
% 2.02/2.20 clauses back subsumed 15
% 2.02/2.20 Kbytes malloced 4882
% 2.02/2.20
% 2.02/2.20 ----------- times (seconds) -----------
% 2.02/2.20 user CPU time 0.19 (0 hr, 0 min, 0 sec)
% 2.02/2.20 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.02/2.20 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.02/2.20
% 2.02/2.20 That finishes the proof of the theorem.
% 2.02/2.20
% 2.02/2.20 Process 24956 finished Wed Jul 27 09:34:22 2022
% 2.02/2.20 Otter interrupted
% 2.02/2.20 PROOF FOUND
%------------------------------------------------------------------------------