TSTP Solution File: KLE039+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE039+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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.78s 2.98s
% Output : Refutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of clauses : 49 ( 31 unt; 0 nHn; 17 RR)
% Number of literals : 71 ( 20 equ; 23 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 : 95 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ le_q(A,B)
| addition(A,B) = B ),
file('KLE039+1.p',unknown),
[] ).
cnf(2,axiom,
( le_q(A,B)
| addition(A,B) != B ),
file('KLE039+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ le_q(addition(multiplication(A,B),C),B)
| le_q(multiplication(star(A),C),B) ),
file('KLE039+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ le_q(addition(multiplication(A,B),C),A)
| le_q(multiplication(C,star(B)),A) ),
file('KLE039+1.p',unknown),
[] ).
cnf(5,axiom,
star(star(dollar_c1)) != star(dollar_c1),
file('KLE039+1.p',unknown),
[] ).
cnf(7,axiom,
addition(A,B) = addition(B,A),
file('KLE039+1.p',unknown),
[] ).
cnf(8,axiom,
addition(A,addition(B,C)) = addition(addition(A,B),C),
file('KLE039+1.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+1.p',unknown),
[] ).
cnf(19,axiom,
multiplication(A,one) = A,
file('KLE039+1.p',unknown),
[] ).
cnf(22,axiom,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
file('KLE039+1.p',unknown),
[] ).
cnf(30,axiom,
le_q(addition(one,multiplication(A,star(A))),star(A)),
file('KLE039+1.p',unknown),
[] ).
cnf(31,axiom,
le_q(addition(one,multiplication(star(A),A)),star(A)),
file('KLE039+1.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(64,plain,
( addition(A,addition(B,C)) = C
| ~ le_q(addition(A,B),C) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,1])]),
[iquote('para_into,9.1.1,1.2.1,flip.1')] ).
cnf(101,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(112,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(188,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(300,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(486,plain,
le_q(A,addition(A,B)),
inference(hyper,[status(thm)],[57,2]),
[iquote('hyper,57,2')] ).
cnf(503,plain,
le_q(A,addition(B,A)),
inference(para_into,[status(thm),theory(equality)],[486,7]),
[iquote('para_into,486.1.2,7.1.1')] ).
cnf(512,plain,
le_q(A,addition(B,addition(C,A))),
inference(para_into,[status(thm),theory(equality)],[503,10]),
[iquote('para_into,503.1.2,9.1.1')] ).
cnf(519,plain,
( le_q(A,addition(B,C))
| ~ le_q(A,C) ),
inference(para_into,[status(thm),theory(equality)],[512,43]),
[iquote('para_into,512.1.2.2,43.1.1')] ).
cnf(522,plain,
le_q(A,addition(B,addition(A,C))),
inference(para_into,[status(thm),theory(equality)],[512,7]),
[iquote('para_into,512.1.2.2,7.1.1')] ).
cnf(523,plain,
( le_q(A,B)
| ~ le_q(addition(C,A),B) ),
inference(para_into,[status(thm),theory(equality)],[512,43]),
[iquote('para_into,512.1.2,43.1.1')] ).
cnf(608,plain,
( le_q(A,B)
| ~ le_q(A,C)
| ~ le_q(C,B) ),
inference(para_into,[status(thm),theory(equality)],[519,43]),
[iquote('para_into,519.1.2,43.1.1')] ).
cnf(614,plain,
le_q(multiplication(star(A),A),star(A)),
inference(hyper,[status(thm)],[523,31]),
[iquote('hyper,523,31')] ).
cnf(615,plain,
le_q(multiplication(A,star(A)),star(A)),
inference(hyper,[status(thm)],[523,30]),
[iquote('hyper,523,30')] ).
cnf(646,plain,
addition(multiplication(star(A),A),star(A)) = star(A),
inference(hyper,[status(thm)],[614,1]),
[iquote('hyper,614,1')] ).
cnf(649,plain,
addition(one,star(A)) = star(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[188]),646]),
[iquote('back_demod,188,demod,646')] ).
cnf(665,plain,
le_q(one,star(A)),
inference(hyper,[status(thm)],[649,2]),
[iquote('hyper,649,2')] ).
cnf(671,plain,
le_q(one,addition(A,star(B))),
inference(para_from,[status(thm),theory(equality)],[649,522]),
[iquote('para_from,649.1.1,522.1.2.2')] ).
cnf(694,plain,
( addition(A,B) = B
| ~ le_q(addition(A,B),B) ),
inference(para_into,[status(thm),theory(equality)],[64,13]),
[iquote('para_into,64.1.1.2,13.1.1')] ).
cnf(740,plain,
le_q(one,addition(star(A),B)),
inference(para_into,[status(thm),theory(equality)],[671,7]),
[iquote('para_into,671.1.2,7.1.1')] ).
cnf(744,plain,
( le_q(one,A)
| ~ le_q(addition(star(B),C),A) ),
inference(para_into,[status(thm),theory(equality)],[740,64]),
[iquote('para_into,740.1.2,64.1.1')] ).
cnf(2014,plain,
( le_q(one,A)
| ~ le_q(B,A)
| ~ le_q(star(C),B) ),
inference(para_into,[status(thm),theory(equality)],[744,1]),
[iquote('para_into,744.2.1,1.2.1')] ).
cnf(2233,plain,
( le_q(multiplication(A,B),multiplication(A,C))
| ~ le_q(B,C) ),
inference(para_from,[status(thm),theory(equality)],[101,486]),
[iquote('para_from,101.1.1,486.1.2')] ).
cnf(3711,plain,
le_q(A,multiplication(A,star(B))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2233,665]),19]),
[iquote('hyper,2233,665,demod,19')] ).
cnf(3723,plain,
le_q(one,multiplication(star(A),star(B))),
inference(hyper,[status(thm)],[3711,2014,38]),
[iquote('hyper,3711,2014,38')] ).
cnf(3734,plain,
le_q(A,star(A)),
inference(hyper,[status(thm)],[3711,608,615]),
[iquote('hyper,3711,608,615')] ).
cnf(3810,plain,
addition(star(A),A) = star(A),
inference(hyper,[status(thm)],[3734,43]),
[iquote('hyper,3734,43')] ).
cnf(4132,plain,
( star(A) = A
| ~ le_q(star(A),A) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3810,694]),3810])]),
[iquote('para_into,3809.1.1,694.1.1,demod,3810,flip.1')] ).
cnf(4221,plain,
le_q(multiplication(star(A),star(A)),star(A)),
inference(hyper,[status(thm)],[300,38,614]),
[iquote('hyper,300,38,614')] ).
cnf(4224,plain,
le_q(star(star(A)),star(A)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[4221,112,3723]),19]),
[iquote('hyper,4221,112,3723,demod,19')] ).
cnf(4228,plain,
star(star(A)) = star(A),
inference(hyper,[status(thm)],[4224,4132]),
[iquote('hyper,4224,4132')] ).
cnf(4230,plain,
$false,
inference(binary,[status(thm)],[4228,5]),
[iquote('binary,4228.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE039+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 06:34:31 EDT 2022
% 0.20/0.34 % CPUTime :
% 1.79/1.97 ----- Otter 3.3f, August 2004 -----
% 1.79/1.97 The process was started by sandbox on n018.cluster.edu,
% 1.79/1.97 Wed Jul 27 06:34:31 2022
% 1.79/1.97 The command was "./otter". The process ID is 7828.
% 1.79/1.97
% 1.79/1.97 set(prolog_style_variables).
% 1.79/1.97 set(auto).
% 1.79/1.97 dependent: set(auto1).
% 1.79/1.97 dependent: set(process_input).
% 1.79/1.97 dependent: clear(print_kept).
% 1.79/1.97 dependent: clear(print_new_demod).
% 1.79/1.97 dependent: clear(print_back_demod).
% 1.79/1.97 dependent: clear(print_back_sub).
% 1.79/1.97 dependent: set(control_memory).
% 1.79/1.97 dependent: assign(max_mem, 12000).
% 1.79/1.97 dependent: assign(pick_given_ratio, 4).
% 1.79/1.97 dependent: assign(stats_level, 1).
% 1.79/1.97 dependent: assign(max_seconds, 10800).
% 1.79/1.97 clear(print_given).
% 1.79/1.97
% 1.79/1.97 formula_list(usable).
% 1.79/1.97 all A (A=A).
% 1.79/1.97 all A B (addition(A,B)=addition(B,A)).
% 1.79/1.97 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.79/1.97 all A (addition(A,zero)=A).
% 1.79/1.97 all A (addition(A,A)=A).
% 1.79/1.97 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.79/1.97 all A (multiplication(A,one)=A).
% 1.79/1.97 all A (multiplication(one,A)=A).
% 1.79/1.97 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.79/1.97 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.79/1.97 all A (multiplication(A,zero)=zero).
% 1.79/1.97 all A (multiplication(zero,A)=zero).
% 1.79/1.97 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.79/1.97 all A le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.79/1.97 all A le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.79/1.97 all A B C (le_q(addition(multiplication(A,B),C),B)->le_q(multiplication(star(A),C),B)).
% 1.79/1.97 all A B C (le_q(addition(multiplication(A,B),C),A)->le_q(multiplication(C,star(B)),A)).
% 1.79/1.97 -(all X0 (star(star(X0))=star(X0))).
% 1.79/1.97 end_of_list.
% 1.79/1.97
% 1.79/1.97 -------> usable clausifies to:
% 1.79/1.97
% 1.79/1.97 list(usable).
% 1.79/1.97 0 [] A=A.
% 1.79/1.97 0 [] addition(A,B)=addition(B,A).
% 1.79/1.97 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.79/1.97 0 [] addition(A,zero)=A.
% 1.79/1.97 0 [] addition(A,A)=A.
% 1.79/1.97 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.79/1.97 0 [] multiplication(A,one)=A.
% 1.79/1.97 0 [] multiplication(one,A)=A.
% 1.79/1.97 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.79/1.97 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.79/1.97 0 [] multiplication(A,zero)=zero.
% 1.79/1.97 0 [] multiplication(zero,A)=zero.
% 1.79/1.97 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.79/1.97 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.79/1.97 0 [] le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.79/1.97 0 [] le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.79/1.97 0 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.79/1.97 0 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.79/1.97 0 [] star(star($c1))!=star($c1).
% 1.79/1.97 end_of_list.
% 1.79/1.97
% 1.79/1.97 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.79/1.97
% 1.79/1.97 This is a Horn set with equality. The strategy will be
% 1.79/1.97 Knuth-Bendix and hyper_res, with positive clauses in
% 1.79/1.97 sos and nonpositive clauses in usable.
% 1.79/1.97
% 1.79/1.97 dependent: set(knuth_bendix).
% 1.79/1.97 dependent: set(anl_eq).
% 1.79/1.97 dependent: set(para_from).
% 1.79/1.97 dependent: set(para_into).
% 1.79/1.97 dependent: clear(para_from_right).
% 1.79/1.97 dependent: clear(para_into_right).
% 1.79/1.97 dependent: set(para_from_vars).
% 1.79/1.97 dependent: set(eq_units_both_ways).
% 1.79/1.97 dependent: set(dynamic_demod_all).
% 1.79/1.97 dependent: set(dynamic_demod).
% 1.79/1.97 dependent: set(order_eq).
% 1.79/1.97 dependent: set(back_demod).
% 1.79/1.97 dependent: set(lrpo).
% 1.79/1.97 dependent: set(hyper_res).
% 1.79/1.97 dependent: clear(order_hyper).
% 1.79/1.97
% 1.79/1.97 ------------> process usable:
% 1.79/1.97 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.79/1.97 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.79/1.97 ** KEPT (pick-wt=13): 3 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.79/1.97 ** KEPT (pick-wt=13): 4 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.79/1.97 ** KEPT (pick-wt=6): 5 [] star(star($c1))!=star($c1).
% 1.79/1.97
% 1.79/1.97 ------------> process sos:
% 1.79/1.97 ** KEPT (pick-wt=3): 6 [] A=A.
% 1.79/1.97 ** KEPT (pick-wt=7): 7 [] addition(A,B)=addition(B,A).
% 1.79/1.97 ** KEPT (pick-wt=11): 9 [copy,8,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.79/1.97 ---> New Demodulator: 10 [new_demod,9] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.79/1.97 ** KEPT (pick-wt=5): 11 [] addition(A,zero)=A.
% 1.79/1.97 ---> New Demodulator: 12 [new_demod,11] addition(A,zero)=A.
% 2.78/2.98 ** KEPT (pick-wt=5): 13 [] addition(A,A)=A.
% 2.78/2.98 ---> New Demodulator: 14 [new_demod,13] addition(A,A)=A.
% 2.78/2.98 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 2.78/2.98 ---> New Demodulator: 17 [new_demod,16] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 2.78/2.98 ** KEPT (pick-wt=5): 18 [] multiplication(A,one)=A.
% 2.78/2.98 ---> New Demodulator: 19 [new_demod,18] multiplication(A,one)=A.
% 2.78/2.98 ** KEPT (pick-wt=5): 20 [] multiplication(one,A)=A.
% 2.78/2.98 ---> New Demodulator: 21 [new_demod,20] multiplication(one,A)=A.
% 2.78/2.98 ** KEPT (pick-wt=13): 22 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 2.78/2.98 ---> New Demodulator: 23 [new_demod,22] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 2.78/2.98 ** KEPT (pick-wt=13): 24 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 2.78/2.98 ---> New Demodulator: 25 [new_demod,24] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 2.78/2.98 ** KEPT (pick-wt=5): 26 [] multiplication(A,zero)=zero.
% 2.78/2.98 ---> New Demodulator: 27 [new_demod,26] multiplication(A,zero)=zero.
% 2.78/2.98 ** KEPT (pick-wt=5): 28 [] multiplication(zero,A)=zero.
% 2.78/2.98 ---> New Demodulator: 29 [new_demod,28] multiplication(zero,A)=zero.
% 2.78/2.98 ** KEPT (pick-wt=9): 30 [] le_q(addition(one,multiplication(A,star(A))),star(A)).
% 2.78/2.98 ** KEPT (pick-wt=9): 31 [] le_q(addition(one,multiplication(star(A),A)),star(A)).
% 2.78/2.98 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 2.78/2.98 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] addition(A,B)=addition(B,A).
% 2.78/2.98 >>>> Starting back demodulation with 10.
% 2.78/2.98 >>>> Starting back demodulation with 12.
% 2.78/2.98 >>>> Starting back demodulation with 14.
% 2.78/2.98 >>>> Starting back demodulation with 17.
% 2.78/2.98 >>>> Starting back demodulation with 19.
% 2.78/2.98 >>>> Starting back demodulation with 21.
% 2.78/2.98 >>>> Starting back demodulation with 23.
% 2.78/2.98 >>>> Starting back demodulation with 25.
% 2.78/2.98 >>>> Starting back demodulation with 27.
% 2.78/2.98 >>>> Starting back demodulation with 29.
% 2.78/2.98
% 2.78/2.98 ======= end of input processing =======
% 2.78/2.98
% 2.78/2.98 =========== start of search ===========
% 2.78/2.98
% 2.78/2.98
% 2.78/2.98 Resetting weight limit to 11.
% 2.78/2.98
% 2.78/2.98
% 2.78/2.98 Resetting weight limit to 11.
% 2.78/2.98
% 2.78/2.98 sos_size=2353
% 2.78/2.98
% 2.78/2.98
% 2.78/2.98 Resetting weight limit to 9.
% 2.78/2.98
% 2.78/2.98
% 2.78/2.98 Resetting weight limit to 9.
% 2.78/2.98
% 2.78/2.98 sos_size=2610
% 2.78/2.98
% 2.78/2.98 -------- PROOF --------
% 2.78/2.98
% 2.78/2.98 ----> UNIT CONFLICT at 1.01 sec ----> 4230 [binary,4228.1,5.1] $F.
% 2.78/2.98
% 2.78/2.98 Length of proof is 36. Level of proof is 16.
% 2.78/2.98
% 2.78/2.98 ---------------- PROOF ----------------
% 2.78/2.98 % SZS status Theorem
% 2.78/2.98 % SZS output start Refutation
% See solution above
% 2.78/2.98 ------------ end of proof -------------
% 2.78/2.98
% 2.78/2.98
% 2.78/2.98 Search stopped by max_proofs option.
% 2.78/2.98
% 2.78/2.98
% 2.78/2.98 Search stopped by max_proofs option.
% 2.78/2.98
% 2.78/2.98 ============ end of search ============
% 2.78/2.98
% 2.78/2.98 -------------- statistics -------------
% 2.78/2.98 clauses given 453
% 2.78/2.98 clauses generated 50572
% 2.78/2.98 clauses kept 4105
% 2.78/2.98 clauses forward subsumed 19013
% 2.78/2.98 clauses back subsumed 960
% 2.78/2.98 Kbytes malloced 5859
% 2.78/2.98
% 2.78/2.98 ----------- times (seconds) -----------
% 2.78/2.98 user CPU time 1.01 (0 hr, 0 min, 1 sec)
% 2.78/2.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.78/2.98 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.78/2.98
% 2.78/2.98 That finishes the proof of the theorem.
% 2.78/2.98
% 2.78/2.98 Process 7828 finished Wed Jul 27 06:34:34 2022
% 2.78/2.98 Otter interrupted
% 2.78/2.98 PROOF FOUND
%------------------------------------------------------------------------------