TSTP Solution File: KRS110+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:01:10 EDT 2022
% Result : Unsatisfiable 1.58s 1.79s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(25,axiom,
( ~ cUnsatisfiable(A)
| rs(A,dollar_f1(A)) ),
file('KRS110+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ cUnsatisfiable(A)
| ca_Ax2(dollar_f1(A)) ),
file('KRS110+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ cUnsatisfiable(A)
| ~ rs(A,B)
| cpxcomp(B) ),
file('KRS110+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ cp(A)
| ~ ra_Px1(A,B) ),
file('KRS110+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ cpxcomp(A)
| ra_Px1(A,dollar_f4(A)) ),
file('KRS110+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ ca_Ax2(A)
| cp(A) ),
file('KRS110+1.p',unknown),
[] ).
cnf(56,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('KRS110+1.p',unknown),
[] ).
cnf(57,plain,
ca_Ax2(dollar_f1(i2003_11_14_17_21_12565)),
inference(hyper,[status(thm)],[56,26]),
[iquote('hyper,56,26')] ).
cnf(58,plain,
rs(i2003_11_14_17_21_12565,dollar_f1(i2003_11_14_17_21_12565)),
inference(hyper,[status(thm)],[56,25]),
[iquote('hyper,56,25')] ).
cnf(64,plain,
cp(dollar_f1(i2003_11_14_17_21_12565)),
inference(hyper,[status(thm)],[57,33]),
[iquote('hyper,57,33')] ).
cnf(80,plain,
cpxcomp(dollar_f1(i2003_11_14_17_21_12565)),
inference(hyper,[status(thm)],[58,27,56]),
[iquote('hyper,58,27,56')] ).
cnf(90,plain,
ra_Px1(dollar_f1(i2003_11_14_17_21_12565),dollar_f4(dollar_f1(i2003_11_14_17_21_12565))),
inference(hyper,[status(thm)],[80,31]),
[iquote('hyper,80,31')] ).
cnf(175,plain,
$false,
inference(hyper,[status(thm)],[90,30,64]),
[iquote('hyper,90,30,64')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 03:46:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.58/1.79 ----- Otter 3.3f, August 2004 -----
% 1.58/1.79 The process was started by sandbox on n016.cluster.edu,
% 1.58/1.79 Wed Jul 27 03:46:22 2022
% 1.58/1.79 The command was "./otter". The process ID is 17103.
% 1.58/1.79
% 1.58/1.79 set(prolog_style_variables).
% 1.58/1.79 set(auto).
% 1.58/1.79 dependent: set(auto1).
% 1.58/1.79 dependent: set(process_input).
% 1.58/1.79 dependent: clear(print_kept).
% 1.58/1.79 dependent: clear(print_new_demod).
% 1.58/1.79 dependent: clear(print_back_demod).
% 1.58/1.79 dependent: clear(print_back_sub).
% 1.58/1.79 dependent: set(control_memory).
% 1.58/1.79 dependent: assign(max_mem, 12000).
% 1.58/1.79 dependent: assign(pick_given_ratio, 4).
% 1.58/1.79 dependent: assign(stats_level, 1).
% 1.58/1.79 dependent: assign(max_seconds, 10800).
% 1.58/1.79 clear(print_given).
% 1.58/1.79
% 1.58/1.79 formula_list(usable).
% 1.58/1.79 all A (A=A).
% 1.58/1.79 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.58/1.79 all A B (A=B&ca_Ax2(A)->ca_Ax2(B)).
% 1.58/1.79 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.58/1.79 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.58/1.79 all A B (A=B&cp(A)->cp(B)).
% 1.58/1.79 all A B (A=B&cpxcomp(A)->cpxcomp(B)).
% 1.58/1.79 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 1.58/1.79 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 1.58/1.79 all A B C (A=B&rf(A,C)->rf(B,C)).
% 1.58/1.79 all A B C (A=B&rf(C,A)->rf(C,B)).
% 1.58/1.79 all A B C (A=B&rf1(A,C)->rf1(B,C)).
% 1.58/1.79 all A B C (A=B&rf1(C,A)->rf1(C,B)).
% 1.58/1.79 all A B C (A=B&rinvF(A,C)->rinvF(B,C)).
% 1.58/1.79 all A B C (A=B&rinvF(C,A)->rinvF(C,B)).
% 1.58/1.79 all A B C (A=B&rinvF1(A,C)->rinvF1(B,C)).
% 1.58/1.79 all A B C (A=B&rinvF1(C,A)->rinvF1(C,B)).
% 1.58/1.79 all A B C (A=B&rinvS(A,C)->rinvS(B,C)).
% 1.58/1.79 all A B C (A=B&rinvS(C,A)->rinvS(C,B)).
% 1.58/1.79 all A B C (A=B&rs(A,C)->rs(B,C)).
% 1.58/1.79 all A B C (A=B&rs(C,A)->rs(C,B)).
% 1.58/1.79 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.58/1.79 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.58/1.79 all X (cowlThing(X)& -cowlNothing(X)).
% 1.58/1.79 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.58/1.79 all X (cUnsatisfiable(X)<-> (exists Y (rs(X,Y)&ca_Ax2(Y)))& (all Y (rs(X,Y)->cpxcomp(Y)))).
% 1.58/1.79 all X (cp(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.58/1.79 all X (cpxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.58/1.79 all X (ca_Ax2(X)<->cp(X)& (exists Y (rinvS(X,Y)&cp(Y)))).
% 1.58/1.79 all X Y Z (rf(X,Y)&rf(X,Z)->Y=Z).
% 1.58/1.79 all X Y Z (rf1(X,Y)&rf1(X,Z)->Y=Z).
% 1.58/1.79 all X Y (rinvF(X,Y)<->rf(Y,X)).
% 1.58/1.79 all X Y (rinvF1(X,Y)<->rf1(Y,X)).
% 1.58/1.79 all X Y (rinvS(X,Y)<->rs(Y,X)).
% 1.58/1.79 all X Y Z (rs(X,Y)&rs(X,Z)->Y=Z).
% 1.58/1.79 cUnsatisfiable(i2003_11_14_17_21_12565).
% 1.58/1.79 all X Y (rs(X,Y)->rf(X,Y)).
% 1.58/1.79 all X Y (rs(X,Y)->rf1(X,Y)).
% 1.58/1.79 end_of_list.
% 1.58/1.79
% 1.58/1.79 -------> usable clausifies to:
% 1.58/1.79
% 1.58/1.79 list(usable).
% 1.58/1.79 0 [] A=A.
% 1.58/1.79 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.58/1.79 0 [] A!=B| -ca_Ax2(A)|ca_Ax2(B).
% 1.58/1.79 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.58/1.79 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.58/1.79 0 [] A!=B| -cp(A)|cp(B).
% 1.58/1.79 0 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 1.58/1.79 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.58/1.79 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.58/1.79 0 [] A!=B| -rf(A,C)|rf(B,C).
% 1.58/1.79 0 [] A!=B| -rf(C,A)|rf(C,B).
% 1.58/1.79 0 [] A!=B| -rf1(A,C)|rf1(B,C).
% 1.58/1.79 0 [] A!=B| -rf1(C,A)|rf1(C,B).
% 1.58/1.79 0 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.58/1.79 0 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.58/1.79 0 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 1.58/1.79 0 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 1.58/1.79 0 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 1.58/1.79 0 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 1.58/1.79 0 [] A!=B| -rs(A,C)|rs(B,C).
% 1.58/1.79 0 [] A!=B| -rs(C,A)|rs(C,B).
% 1.58/1.79 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.58/1.79 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.58/1.79 0 [] cowlThing(X).
% 1.58/1.79 0 [] -cowlNothing(X).
% 1.58/1.79 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.58/1.79 0 [] xsd_string(X)|xsd_integer(X).
% 1.58/1.79 0 [] -cUnsatisfiable(X)|rs(X,$f1(X)).
% 1.58/1.79 0 [] -cUnsatisfiable(X)|ca_Ax2($f1(X)).
% 1.58/1.79 0 [] -cUnsatisfiable(X)| -rs(X,Y)|cpxcomp(Y).
% 1.58/1.79 0 [] cUnsatisfiable(X)| -rs(X,X1)| -ca_Ax2(X1)|rs(X,$f2(X)).
% 1.58/1.79 0 [] cUnsatisfiable(X)| -rs(X,X1)| -ca_Ax2(X1)| -cpxcomp($f2(X)).
% 1.58/1.79 0 [] -cp(X)| -ra_Px1(X,Y).
% 1.58/1.79 0 [] cp(X)|ra_Px1(X,$f3(X)).
% 1.58/1.79 0 [] -cpxcomp(X)|ra_Px1(X,$f4(X)).
% 1.58/1.79 0 [] cpxcomp(X)| -ra_Px1(X,Y0).
% 1.58/1.79 0 [] -ca_Ax2(X)|cp(X).
% 1.58/1.79 0 [] -ca_Ax2(X)|rinvS(X,$f5(X)).
% 1.58/1.79 0 [] -ca_Ax2(X)|cp($f5(X)).
% 1.58/1.79 0 [] ca_Ax2(X)| -cp(X)| -rinvS(X,Y)| -cp(Y).
% 1.58/1.79 0 [] -rf(X,Y)| -rf(X,Z)|Y=Z.
% 1.58/1.79 0 [] -rf1(X,Y)| -rf1(X,Z)|Y=Z.
% 1.58/1.79 0 [] -rinvF(X,Y)|rf(Y,X).
% 1.58/1.79 0 [] rinvF(X,Y)| -rf(Y,X).
% 1.58/1.79 0 [] -rinvF1(X,Y)|rf1(Y,X).
% 1.58/1.79 0 [] rinvF1(X,Y)| -rf1(Y,X).
% 1.58/1.79 0 [] -rinvS(X,Y)|rs(Y,X).
% 1.58/1.79 0 [] rinvS(X,Y)| -rs(Y,X).
% 1.58/1.79 0 [] -rs(X,Y)| -rs(X,Z)|Y=Z.
% 1.58/1.79 0 [] cUnsatisfiable(i2003_11_14_17_21_12565).
% 1.58/1.79 0 [] -rs(X,Y)|rf(X,Y).
% 1.58/1.79 0 [] -rs(X,Y)|rf1(X,Y).
% 1.58/1.79 end_of_list.
% 1.58/1.79
% 1.58/1.79 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.58/1.79
% 1.58/1.79 This ia a non-Horn set with equality. The strategy will be
% 1.58/1.79 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.58/1.79 deletion, with positive clauses in sos and nonpositive
% 1.58/1.79 clauses in usable.
% 1.58/1.79
% 1.58/1.79 dependent: set(knuth_bendix).
% 1.58/1.79 dependent: set(anl_eq).
% 1.58/1.79 dependent: set(para_from).
% 1.58/1.79 dependent: set(para_into).
% 1.58/1.79 dependent: clear(para_from_right).
% 1.58/1.79 dependent: clear(para_into_right).
% 1.58/1.79 dependent: set(para_from_vars).
% 1.58/1.79 dependent: set(eq_units_both_ways).
% 1.58/1.79 dependent: set(dynamic_demod_all).
% 1.58/1.79 dependent: set(dynamic_demod).
% 1.58/1.79 dependent: set(order_eq).
% 1.58/1.79 dependent: set(back_demod).
% 1.58/1.79 dependent: set(lrpo).
% 1.58/1.79 dependent: set(hyper_res).
% 1.58/1.79 dependent: set(unit_deletion).
% 1.58/1.79 dependent: set(factor).
% 1.58/1.79
% 1.58/1.79 ------------> process usable:
% 1.58/1.79 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.58/1.79 ** KEPT (pick-wt=7): 2 [] A!=B| -ca_Ax2(A)|ca_Ax2(B).
% 1.58/1.79 ** KEPT (pick-wt=7): 3 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.58/1.79 ** KEPT (pick-wt=7): 4 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.58/1.79 ** KEPT (pick-wt=7): 5 [] A!=B| -cp(A)|cp(B).
% 1.58/1.79 ** KEPT (pick-wt=7): 6 [] A!=B| -cpxcomp(A)|cpxcomp(B).
% 1.58/1.79 ** KEPT (pick-wt=9): 7 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 8 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.58/1.79 ** KEPT (pick-wt=9): 9 [] A!=B| -rf(A,C)|rf(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 10 [] A!=B| -rf(C,A)|rf(C,B).
% 1.58/1.79 ** KEPT (pick-wt=9): 11 [] A!=B| -rf1(A,C)|rf1(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 12 [] A!=B| -rf1(C,A)|rf1(C,B).
% 1.58/1.79 ** KEPT (pick-wt=9): 13 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 14 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.58/1.79 ** KEPT (pick-wt=9): 15 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 16 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 1.58/1.79 ** KEPT (pick-wt=9): 17 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 18 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 1.58/1.79 ** KEPT (pick-wt=9): 19 [] A!=B| -rs(A,C)|rs(B,C).
% 1.58/1.79 ** KEPT (pick-wt=9): 20 [] A!=B| -rs(C,A)|rs(C,B).
% 1.58/1.79 ** KEPT (pick-wt=7): 21 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.58/1.79 ** KEPT (pick-wt=7): 22 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.58/1.79 ** KEPT (pick-wt=2): 23 [] -cowlNothing(A).
% 1.58/1.79 ** KEPT (pick-wt=4): 24 [] -xsd_string(A)| -xsd_integer(A).
% 1.58/1.79 ** KEPT (pick-wt=6): 25 [] -cUnsatisfiable(A)|rs(A,$f1(A)).
% 1.58/1.79 ** KEPT (pick-wt=5): 26 [] -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 1.58/1.79 ** KEPT (pick-wt=7): 27 [] -cUnsatisfiable(A)| -rs(A,B)|cpxcomp(B).
% 1.58/1.79 ** KEPT (pick-wt=11): 28 [] cUnsatisfiable(A)| -rs(A,B)| -ca_Ax2(B)|rs(A,$f2(A)).
% 1.58/1.79 ** KEPT (pick-wt=10): 29 [] cUnsatisfiable(A)| -rs(A,B)| -ca_Ax2(B)| -cpxcomp($f2(A)).
% 1.58/1.79 ** KEPT (pick-wt=5): 30 [] -cp(A)| -ra_Px1(A,B).
% 1.58/1.79 ** KEPT (pick-wt=6): 31 [] -cpxcomp(A)|ra_Px1(A,$f4(A)).
% 1.58/1.79 ** KEPT (pick-wt=5): 32 [] cpxcomp(A)| -ra_Px1(A,B).
% 1.58/1.79 ** KEPT (pick-wt=4): 33 [] -ca_Ax2(A)|cp(A).
% 1.58/1.79 ** KEPT (pick-wt=6): 34 [] -ca_Ax2(A)|rinvS(A,$f5(A)).
% 1.58/1.79 ** KEPT (pick-wt=5): 35 [] -ca_Ax2(A)|cp($f5(A)).
% 1.58/1.79 ** KEPT (pick-wt=9): 36 [] ca_Ax2(A)| -cp(A)| -rinvS(A,B)| -cp(B).
% 1.58/1.79 ** KEPT (pick-wt=9): 37 [] -rf(A,B)| -rf(A,C)|B=C.
% 1.58/1.79 ** KEPT (pick-wt=9): 38 [] -rf1(A,B)| -rf1(A,C)|B=C.
% 1.58/1.79 ** KEPT (pick-wt=6): 39 [] -rinvF(A,B)|rf(B,A).
% 1.58/1.79 ** KEPT (pick-wt=6): 40 [] rinvF(A,B)| -rf(B,A).
% 1.58/1.79 ** KEPT (pick-wt=6): 41 [] -rinvF1(A,B)|rf1(B,A).
% 1.58/1.79 ** KEPT (pick-wt=6): 42 [] rinvF1(A,B)| -rf1(B,A).
% 1.58/1.79 ** KEPT (pick-wt=6): 43 [] -rinvS(A,B)|rs(B,A).
% 1.58/1.79 ** KEPT (pick-wt=6): 44 [] rinvS(A,B)| -rs(B,A).
% 1.58/1.79 ** KEPT (pick-wt=9): 45 [] -rs(A,B)| -rs(A,C)|B=C.
% 1.58/1.79 ** KEPT (pick-wt=6): 46 [] -rs(A,B)|rf(A,B).
% 1.58/1.79 ** KEPT (pick-wt=6): 47 [] -rs(A,B)|rf1(A,B).
% 1.58/1.79 23 back subsumes 3.
% 1.58/1.79
% 1.58/1.79 ------------> process sos:
% 1.58/1.79 ** KEPT (pick-wt=3): 52 [] A=A.
% 1.58/1.79 ** KEPT (pick-wt=2): 53 [] cowlThing(A).
% 1.58/1.79 ** KEPT (pick-wt=4): 54 [] xsd_string(A)|xsd_integer(A).
% 1.58/1.79 ** KEPT (pick-wt=6): 55 [] cp(A)|ra_Px1(A,$f3(A)).
% 1.58/1.79 ** KEPT (pick-wt=2): 56 [] cUnsatisfiable(i2003_11_14_17_21_12565).
% 1.58/1.79 Following clause subsumed by 52 during input processing: 0 [copy,52,flip.1] A=A.
% 1.58/1.79 52 back subsumes 51.
% 1.58/1.79 52 back subsumes 50.
% 1.58/1.79 52 back subsumes 49.
% 1.58/1.79 53 back subsumes 4.
% 1.58/1.79
% 1.58/1.79 ======= end of input processing =======
% 1.58/1.79
% 1.58/1.79 =========== start of search ===========
% 1.58/1.79
% 1.58/1.79 -------- PROOF --------
% 1.58/1.79
% 1.58/1.79 -----> EMPTY CLAUSE at 0.01 sec ----> 175 [hyper,90,30,64] $F.
% 1.58/1.79
% 1.58/1.79 Length of proof is 5. Level of proof is 3.
% 1.58/1.79
% 1.58/1.79 ---------------- PROOF ----------------
% 1.58/1.79 % SZS status Theorem
% 1.58/1.79 % SZS output start Refutation
% See solution above
% 1.58/1.79 ------------ end of proof -------------
% 1.58/1.79
% 1.58/1.79
% 1.58/1.79 Search stopped by max_proofs option.
% 1.58/1.79
% 1.58/1.79
% 1.58/1.79 Search stopped by max_proofs option.
% 1.58/1.79
% 1.58/1.79 ============ end of search ============
% 1.58/1.79
% 1.58/1.79 -------------- statistics -------------
% 1.58/1.79 clauses given 18
% 1.58/1.79 clauses generated 273
% 1.58/1.79 clauses kept 174
% 1.58/1.79 clauses forward subsumed 151
% 1.58/1.79 clauses back subsumed 5
% 1.58/1.79 Kbytes malloced 976
% 1.58/1.79
% 1.58/1.79 ----------- times (seconds) -----------
% 1.58/1.79 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.58/1.79 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.79 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.58/1.79
% 1.58/1.79 That finishes the proof of the theorem.
% 1.58/1.79
% 1.58/1.79 Process 17103 finished Wed Jul 27 03:46:23 2022
% 1.58/1.79 Otter interrupted
% 1.58/1.79 PROOF FOUND
%------------------------------------------------------------------------------