TSTP Solution File: BOO008-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : BOO008-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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 12:47:32 EDT 2022
% Result : Unsatisfiable 2.50s 2.70s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 55 ( 46 unt; 0 nHn; 38 RR)
% Number of literals : 81 ( 14 equ; 28 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 : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 72 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ sum(A,B,C)
| sum(B,A,C) ),
file('BOO008-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ product(A,B,C)
| product(B,A,C) ),
file('BOO008-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ product(A,F,G)
| sum(C,E,G) ),
file('BOO008-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ sum(C,E,G)
| product(A,F,G) ),
file('BOO008-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ sum(C,E,G)
| product(F,B,G) ),
file('BOO008-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ sum(A,B,C)
| ~ sum(A,D,E)
| ~ product(B,D,F)
| ~ sum(A,F,G)
| product(C,E,G) ),
file('BOO008-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ sum(A,B,C)
| ~ sum(D,B,E)
| ~ product(A,D,F)
| ~ sum(F,B,G)
| product(C,E,G) ),
file('BOO008-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| C = D ),
file('BOO008-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('BOO008-1.p',unknown),
[] ).
cnf(13,axiom,
x__plus_y_plus_z != x_plus_y__plus_z,
file('BOO008-1.p',unknown),
[] ).
cnf(14,plain,
x_plus_y__plus_z != x__plus_y_plus_z,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
[iquote('copy,13,flip.1')] ).
cnf(16,axiom,
sum(A,B,add(A,B)),
file('BOO008-1.p',unknown),
[] ).
cnf(17,axiom,
product(A,B,multiply(A,B)),
file('BOO008-1.p',unknown),
[] ).
cnf(18,axiom,
sum(additive_identity,A,A),
file('BOO008-1.p',unknown),
[] ).
cnf(20,axiom,
product(multiplicative_identity,A,A),
file('BOO008-1.p',unknown),
[] ).
cnf(21,axiom,
product(A,multiplicative_identity,A),
file('BOO008-1.p',unknown),
[] ).
cnf(22,axiom,
sum(inverse(A),A,multiplicative_identity),
file('BOO008-1.p',unknown),
[] ).
cnf(26,axiom,
sum(y,z,y_plus_z),
file('BOO008-1.p',unknown),
[] ).
cnf(27,axiom,
sum(x,y_plus_z,x__plus_y_plus_z),
file('BOO008-1.p',unknown),
[] ).
cnf(28,axiom,
sum(x,y,x_plus_y),
file('BOO008-1.p',unknown),
[] ).
cnf(29,axiom,
sum(x_plus_y,z,x_plus_y__plus_z),
file('BOO008-1.p',unknown),
[] ).
cnf(41,plain,
add(additive_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,11,18])]),
[iquote('hyper,16,11,18,flip.1')] ).
cnf(43,plain,
product(A,add(multiplicative_identity,A),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,9,18,16,21]),41]),
[iquote('hyper,16,9,18,16,21,demod,41')] ).
cnf(56,plain,
sum(A,B,add(B,A)),
inference(hyper,[status(thm)],[16,1]),
[iquote('hyper,16,1')] ).
cnf(65,plain,
sum(z,y,y_plus_z),
inference(hyper,[status(thm)],[26,1]),
[iquote('hyper,26,1')] ).
cnf(78,plain,
sum(y_plus_z,x,x__plus_y_plus_z),
inference(hyper,[status(thm)],[27,1]),
[iquote('hyper,27,1')] ).
cnf(91,plain,
sum(y,x,x_plus_y),
inference(hyper,[status(thm)],[28,1]),
[iquote('hyper,28,1')] ).
cnf(104,plain,
sum(z,x_plus_y,x_plus_y__plus_z),
inference(hyper,[status(thm)],[29,1]),
[iquote('hyper,29,1')] ).
cnf(112,plain,
multiply(A,multiplicative_identity) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,12,21])]),
[iquote('hyper,17,12,21,flip.1')] ).
cnf(289,plain,
sum(A,A,multiply(A,add(multiplicative_identity,multiplicative_identity))),
inference(hyper,[status(thm)],[17,3,21,21,16]),
[iquote('hyper,17,3,21,21,16')] ).
cnf(301,plain,
product(A,B,multiply(B,A)),
inference(hyper,[status(thm)],[17,2]),
[iquote('hyper,17,2')] ).
cnf(305,plain,
add(z,y) = y_plus_z,
inference(hyper,[status(thm)],[65,11,16]),
[iquote('hyper,65,11,16')] ).
cnf(349,plain,
add(y_plus_z,x) = x__plus_y_plus_z,
inference(hyper,[status(thm)],[78,11,16]),
[iquote('hyper,78,11,16')] ).
cnf(437,plain,
add(z,x_plus_y) = x_plus_y__plus_z,
inference(hyper,[status(thm)],[104,11,16]),
[iquote('hyper,104,11,16')] ).
cnf(467,plain,
product(x_plus_y__plus_z,y_plus_z,add(z,multiply(x_plus_y,y))),
inference(hyper,[status(thm)],[104,7,65,17,16]),
[iquote('hyper,104,7,65,17,16')] ).
cnf(507,plain,
product(multiplicative_identity,add(multiplicative_identity,A),multiplicative_identity),
inference(hyper,[status(thm)],[22,9,22,16,21]),
[iquote('hyper,22,9,22,16,21')] ).
cnf(947,plain,
add(multiplicative_identity,multiplicative_identity) = multiplicative_identity,
inference(hyper,[status(thm)],[43,12,20]),
[iquote('hyper,43,12,20')] ).
cnf(1087,plain,
sum(A,A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[289]),947,112]),
[iquote('back_demod,289,demod,947,112')] ).
cnf(2176,plain,
sum(multiply(A,B),A,multiply(A,add(multiplicative_identity,B))),
inference(hyper,[status(thm)],[56,3,17,21,17]),
[iquote('hyper,56,3,17,21,17')] ).
cnf(2306,plain,
add(multiplicative_identity,A) = multiplicative_identity,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[507,12,301]),112]),
[iquote('hyper,507,12,301,demod,112')] ).
cnf(2309,plain,
sum(multiply(A,B),A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2176]),2306,112]),
[iquote('back_demod,2176,demod,2306,112')] ).
cnf(2329,plain,
product(x,x_plus_y,x),
inference(hyper,[status(thm)],[2309,9,1087,91,17]),
[iquote('hyper,2309,9,1087,91,17')] ).
cnf(2331,plain,
product(y,y_plus_z,y),
inference(hyper,[status(thm)],[2309,9,1087,65,17]),
[iquote('hyper,2309,9,1087,65,17')] ).
cnf(2334,plain,
product(y,x_plus_y,y),
inference(hyper,[status(thm)],[2309,9,1087,28,17]),
[iquote('hyper,2309,9,1087,28,17')] ).
cnf(2336,plain,
product(z,y_plus_z,z),
inference(hyper,[status(thm)],[2309,9,1087,26,17]),
[iquote('hyper,2309,9,1087,26,17')] ).
cnf(2422,plain,
product(x,x_plus_y__plus_z,x),
inference(hyper,[status(thm)],[2329,4,17,104,2309]),
[iquote('hyper,2329,4,17,104,2309')] ).
cnf(2464,plain,
product(x_plus_y,x__plus_y_plus_z,x_plus_y),
inference(hyper,[status(thm)],[2331,9,91,78,91]),
[iquote('hyper,2331,9,91,78,91')] ).
cnf(2523,plain,
multiply(x_plus_y,y) = y,
inference(hyper,[status(thm)],[2334,12,301]),
[iquote('hyper,2334,12,301')] ).
cnf(2552,plain,
product(x_plus_y__plus_z,y_plus_z,y_plus_z),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[467]),2523,305]),
[iquote('back_demod,467,demod,2523,305')] ).
cnf(2604,plain,
product(z,x__plus_y_plus_z,z),
inference(hyper,[status(thm)],[2336,4,17,27,2309]),
[iquote('hyper,2336,4,17,27,2309')] ).
cnf(2659,plain,
multiply(x,x_plus_y__plus_z) = x,
inference(hyper,[status(thm)],[2422,12,17]),
[iquote('hyper,2422,12,17')] ).
cnf(2703,plain,
product(x_plus_y__plus_z,x__plus_y_plus_z,x__plus_y_plus_z),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2552,4,301,27,56]),2659,349]),
[iquote('hyper,2552,4,301,27,56,demod,2659,349')] ).
cnf(2716,plain,
product(x_plus_y__plus_z,x__plus_y_plus_z,x_plus_y__plus_z),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2604,6,2464,56,56]),437,437]),
[iquote('hyper,2604,6,2464,56,56,demod,437,437')] ).
cnf(2749,plain,
x_plus_y__plus_z = x__plus_y_plus_z,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2716,12,2703])]),
[iquote('hyper,2716,12,2703,flip.1')] ).
cnf(2751,plain,
$false,
inference(binary,[status(thm)],[2749,14]),
[iquote('binary,2749.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : BOO008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 02:30:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.82/2.01 ----- Otter 3.3f, August 2004 -----
% 1.82/2.01 The process was started by sandbox on n004.cluster.edu,
% 1.82/2.01 Wed Jul 27 02:30:51 2022
% 1.82/2.01 The command was "./otter". The process ID is 3150.
% 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 list(usable).
% 1.82/2.01 0 [] A=A.
% 1.82/2.01 0 [] sum(X,Y,add(X,Y)).
% 1.82/2.01 0 [] product(X,Y,multiply(X,Y)).
% 1.82/2.01 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.82/2.01 0 [] -product(X,Y,Z)|product(Y,X,Z).
% 1.82/2.01 0 [] sum(additive_identity,X,X).
% 1.82/2.01 0 [] sum(X,additive_identity,X).
% 1.82/2.01 0 [] product(multiplicative_identity,X,X).
% 1.82/2.01 0 [] product(X,multiplicative_identity,X).
% 1.82/2.01 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.82/2.01 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.82/2.01 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.82/2.01 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.82/2.01 0 [] -sum(X,Y,V1)| -sum(X,Z,V2)| -product(Y,Z,V3)| -sum(X,V3,V4)|product(V1,V2,V4).
% 1.82/2.01 0 [] -sum(X,Y,V1)| -sum(X,Z,V2)| -product(Y,Z,V3)| -product(V1,V2,V4)|sum(X,V3,V4).
% 1.82/2.01 0 [] -sum(Y,X,V1)| -sum(Z,X,V2)| -product(Y,Z,V3)| -sum(V3,X,V4)|product(V1,V2,V4).
% 1.82/2.01 0 [] -sum(Y,X,V1)| -sum(Z,X,V2)| -product(Y,Z,V3)| -product(V1,V2,V4)|sum(V3,X,V4).
% 1.82/2.01 0 [] sum(inverse(X),X,multiplicative_identity).
% 1.82/2.01 0 [] sum(X,inverse(X),multiplicative_identity).
% 1.82/2.01 0 [] product(inverse(X),X,additive_identity).
% 1.82/2.01 0 [] product(X,inverse(X),additive_identity).
% 1.82/2.01 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.82/2.01 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.82/2.01 0 [] sum(y,z,y_plus_z).
% 1.82/2.01 0 [] sum(x,y_plus_z,x__plus_y_plus_z).
% 1.82/2.01 0 [] sum(x,y,x_plus_y).
% 1.82/2.01 0 [] sum(x_plus_y,z,x_plus_y__plus_z).
% 1.82/2.01 0 [] x__plus_y_plus_z!=x_plus_y__plus_z.
% 1.82/2.01 end_of_list.
% 1.82/2.01
% 1.82/2.01 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.82/2.01
% 1.82/2.01 This is a Horn set with equality. The strategy will be
% 1.82/2.01 Knuth-Bendix and hyper_res, with positive clauses in
% 1.82/2.01 sos and nonpositive clauses in usable.
% 1.82/2.01
% 1.82/2.01 dependent: set(knuth_bendix).
% 1.82/2.01 dependent: set(anl_eq).
% 1.82/2.01 dependent: set(para_from).
% 1.82/2.01 dependent: set(para_into).
% 1.82/2.01 dependent: clear(para_from_right).
% 1.82/2.01 dependent: clear(para_into_right).
% 1.82/2.01 dependent: set(para_from_vars).
% 1.82/2.01 dependent: set(eq_units_both_ways).
% 1.82/2.01 dependent: set(dynamic_demod_all).
% 1.82/2.01 dependent: set(dynamic_demod).
% 1.82/2.01 dependent: set(order_eq).
% 1.82/2.01 dependent: set(back_demod).
% 1.82/2.01 dependent: set(lrpo).
% 1.82/2.01 dependent: set(hyper_res).
% 1.82/2.01 dependent: clear(order_hyper).
% 1.82/2.01
% 1.82/2.01 ------------> process usable:
% 1.82/2.01 ** KEPT (pick-wt=8): 1 [] -sum(A,B,C)|sum(B,A,C).
% 1.82/2.01 ** KEPT (pick-wt=8): 2 [] -product(A,B,C)|product(B,A,C).
% 1.82/2.01 ** KEPT (pick-wt=20): 3 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 4 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 5 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 6 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 7 [] -sum(A,B,C)| -sum(A,D,E)| -product(B,D,F)| -sum(A,F,G)|product(C,E,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 8 [] -sum(A,B,C)| -sum(A,D,E)| -product(B,D,F)| -product(C,E,G)|sum(A,F,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 9 [] -sum(A,B,C)| -sum(D,B,E)| -product(A,D,F)| -sum(F,B,G)|product(C,E,G).
% 1.82/2.01 ** KEPT (pick-wt=20): 10 [] -sum(A,B,C)| -sum(D,B,E)| -product(A,D,F)| -product(C,E,G)|sum(F,B,G).
% 1.82/2.01 ** KEPT (pick-wt=11): 11 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.82/2.01 ** KEPT (pick-wt=11): 12 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.82/2.01 ** KEPT (pick-wt=3): 14 [copy,13,flip.1] x_plus_y__plus_z!=x__plus_y_plus_z.
% 1.82/2.01
% 1.82/2.01 ------------> process sos:
% 1.82/2.01 ** KEPT (pick-wt=3): 15 [] A=A.
% 1.82/2.01 ** KEPT (pick-wt=6): 16 [] sum(A,B,add(A,B)).
% 1.82/2.01 ** KEPT (pick-wt=6): 17 [] product(A,B,multiply(A,B)).
% 1.82/2.01 ** KEPT (pick-wt=4): 18 [] sum(additive_identity,A,A).
% 2.50/2.70 ** KEPT (pick-wt=4): 19 [] sum(A,additive_identity,A).
% 2.50/2.70 ** KEPT (pick-wt=4): 20 [] product(multiplicative_identity,A,A).
% 2.50/2.70 ** KEPT (pick-wt=4): 21 [] product(A,multiplicative_identity,A).
% 2.50/2.70 ** KEPT (pick-wt=5): 22 [] sum(inverse(A),A,multiplicative_identity).
% 2.50/2.70 ** KEPT (pick-wt=5): 23 [] sum(A,inverse(A),multiplicative_identity).
% 2.50/2.70 ** KEPT (pick-wt=5): 24 [] product(inverse(A),A,additive_identity).
% 2.50/2.70 ** KEPT (pick-wt=5): 25 [] product(A,inverse(A),additive_identity).
% 2.50/2.70 ** KEPT (pick-wt=4): 26 [] sum(y,z,y_plus_z).
% 2.50/2.70 ** KEPT (pick-wt=4): 27 [] sum(x,y_plus_z,x__plus_y_plus_z).
% 2.50/2.70 ** KEPT (pick-wt=4): 28 [] sum(x,y,x_plus_y).
% 2.50/2.70 ** KEPT (pick-wt=4): 29 [] sum(x_plus_y,z,x_plus_y__plus_z).
% 2.50/2.70 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 2.50/2.70
% 2.50/2.70 ======= end of input processing =======
% 2.50/2.70
% 2.50/2.70 =========== start of search ===========
% 2.50/2.70
% 2.50/2.70
% 2.50/2.70 Resetting weight limit to 7.
% 2.50/2.70
% 2.50/2.70
% 2.50/2.70 Resetting weight limit to 7.
% 2.50/2.70
% 2.50/2.70 sos_size=2011
% 2.50/2.70
% 2.50/2.70
% 2.50/2.70 Resetting weight limit to 5.
% 2.50/2.70
% 2.50/2.70
% 2.50/2.70 Resetting weight limit to 5.
% 2.50/2.70
% 2.50/2.70 sos_size=907
% 2.50/2.70
% 2.50/2.70 -------- PROOF --------
% 2.50/2.70
% 2.50/2.70 ----> UNIT CONFLICT at 0.69 sec ----> 2751 [binary,2749.1,14.1] $F.
% 2.50/2.70
% 2.50/2.70 Length of proof is 34. Level of proof is 9.
% 2.50/2.70
% 2.50/2.70 ---------------- PROOF ----------------
% 2.50/2.70 % SZS status Unsatisfiable
% 2.50/2.70 % SZS output start Refutation
% See solution above
% 2.50/2.70 ------------ end of proof -------------
% 2.50/2.70
% 2.50/2.70
% 2.50/2.70 Search stopped by max_proofs option.
% 2.50/2.70
% 2.50/2.70
% 2.50/2.70 Search stopped by max_proofs option.
% 2.50/2.70
% 2.50/2.70 ============ end of search ============
% 2.50/2.70
% 2.50/2.70 -------------- statistics -------------
% 2.50/2.70 clauses given 182
% 2.50/2.70 clauses generated 176065
% 2.50/2.70 clauses kept 2622
% 2.50/2.70 clauses forward subsumed 106615
% 2.50/2.70 clauses back subsumed 180
% 2.50/2.70 Kbytes malloced 4882
% 2.50/2.70
% 2.50/2.70 ----------- times (seconds) -----------
% 2.50/2.70 user CPU time 0.69 (0 hr, 0 min, 0 sec)
% 2.50/2.70 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.50/2.70 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.50/2.70
% 2.50/2.70 That finishes the proof of the theorem.
% 2.50/2.70
% 2.50/2.70 Process 3150 finished Wed Jul 27 02:30:53 2022
% 2.50/2.70 Otter interrupted
% 2.50/2.70 PROOF FOUND
%------------------------------------------------------------------------------