TSTP Solution File: SEU117+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:14:48 EDT 2022
% Result : Theorem 1.79s 2.02s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 9 unt; 1 nHn; 10 RR)
% Number of literals : 18 ( 2 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ element(A,B)
| empty(B)
| in(A,B) ),
file('SEU117+1.p',unknown),
[] ).
cnf(9,axiom,
~ empty(finite_subsets(A)),
file('SEU117+1.p',unknown),
[] ).
cnf(22,axiom,
( element(A,powerset(B))
| ~ subset(A,B) ),
file('SEU117+1.p',unknown),
[] ).
cnf(25,axiom,
~ element(dollar_c5,powerset(dollar_c6)),
file('SEU117+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ preboolean(A)
| A != finite_subsets(B)
| ~ in(C,A)
| subset(C,B) ),
file('SEU117+1.p',unknown),
[] ).
cnf(34,axiom,
A = A,
file('SEU117+1.p',unknown),
[] ).
cnf(38,axiom,
preboolean(finite_subsets(A)),
file('SEU117+1.p',unknown),
[] ).
cnf(67,axiom,
element(dollar_c5,finite_subsets(dollar_c6)),
file('SEU117+1.p',unknown),
[] ).
cnf(146,plain,
in(dollar_c5,finite_subsets(dollar_c6)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[67,3]),9]),
[iquote('hyper,67,3,unit_del,9')] ).
cnf(327,plain,
subset(dollar_c5,dollar_c6),
inference(hyper,[status(thm)],[146,26,38,34]),
[iquote('hyper,146,26,38,34')] ).
cnf(339,plain,
element(dollar_c5,powerset(dollar_c6)),
inference(hyper,[status(thm)],[327,22]),
[iquote('hyper,327,22')] ).
cnf(340,plain,
$false,
inference(binary,[status(thm)],[339,25]),
[iquote('binary,339.1,25.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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 07:21:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.79/2.01 ----- Otter 3.3f, August 2004 -----
% 1.79/2.01 The process was started by sandbox on n007.cluster.edu,
% 1.79/2.01 Wed Jul 27 07:21:31 2022
% 1.79/2.01 The command was "./otter". The process ID is 4793.
% 1.79/2.01
% 1.79/2.01 set(prolog_style_variables).
% 1.79/2.01 set(auto).
% 1.79/2.01 dependent: set(auto1).
% 1.79/2.01 dependent: set(process_input).
% 1.79/2.01 dependent: clear(print_kept).
% 1.79/2.01 dependent: clear(print_new_demod).
% 1.79/2.01 dependent: clear(print_back_demod).
% 1.79/2.01 dependent: clear(print_back_sub).
% 1.79/2.01 dependent: set(control_memory).
% 1.79/2.01 dependent: assign(max_mem, 12000).
% 1.79/2.01 dependent: assign(pick_given_ratio, 4).
% 1.79/2.01 dependent: assign(stats_level, 1).
% 1.79/2.01 dependent: assign(max_seconds, 10800).
% 1.79/2.01 clear(print_given).
% 1.79/2.01
% 1.79/2.01 formula_list(usable).
% 1.79/2.01 all A (A=A).
% 1.79/2.01 empty(empty_set).
% 1.79/2.01 all A (cup_closed(A)&diff_closed(A)->preboolean(A)).
% 1.79/2.01 all A (empty(A)->finite(A)).
% 1.79/2.01 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.79/2.01 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.79/2.01 all A (empty(A)->A=empty_set).
% 1.79/2.01 all A B (-(empty(A)&A!=B&empty(B))).
% 1.79/2.01 all A B subset(A,A).
% 1.79/2.01 all A B (in(A,B)-> -in(B,A)).
% 1.79/2.01 all A exists B element(B,A).
% 1.79/2.01 all A preboolean(finite_subsets(A)).
% 1.79/2.01 all A (-empty(powerset(A))&cup_closed(powerset(A))&diff_closed(powerset(A))&preboolean(powerset(A))).
% 1.79/2.01 all A (-empty(finite_subsets(A))&cup_closed(finite_subsets(A))&diff_closed(finite_subsets(A))&preboolean(finite_subsets(A))).
% 1.79/2.01 all A (preboolean(A)->cup_closed(A)&diff_closed(A)).
% 1.79/2.01 all A B (element(B,finite_subsets(A))->finite(B)).
% 1.79/2.01 exists A (-empty(A)&cup_closed(A)&cap_closed(A)&diff_closed(A)&preboolean(A)).
% 1.79/2.01 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.79/2.01 exists A (-empty(A)&finite(A)).
% 1.79/2.01 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 1.79/2.01 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.79/2.01 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.79/2.01 all A (-empty(powerset(A))).
% 1.79/2.01 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.79/2.01 all A exists B (element(B,powerset(A))&empty(B)).
% 1.79/2.01 exists A empty(A).
% 1.79/2.01 exists A (-empty(A)).
% 1.79/2.01 all A B (in(A,B)->element(A,B)).
% 1.79/2.01 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.79/2.01 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.79/2.01 all A B (-(in(A,B)&empty(B))).
% 1.79/2.01 -(all A B (element(B,finite_subsets(A))->element(B,powerset(A)))).
% 1.79/2.01 all A B (preboolean(B)-> (B=finite_subsets(A)<-> (all C (in(C,B)<->subset(C,A)&finite(C))))).
% 1.79/2.01 end_of_list.
% 1.79/2.01
% 1.79/2.01 -------> usable clausifies to:
% 1.79/2.01
% 1.79/2.01 list(usable).
% 1.79/2.01 0 [] A=A.
% 1.79/2.01 0 [] empty(empty_set).
% 1.79/2.01 0 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.79/2.01 0 [] -empty(A)|finite(A).
% 1.79/2.01 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.79/2.01 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.79/2.01 0 [] -empty(A)|A=empty_set.
% 1.79/2.01 0 [] -empty(A)|A=B| -empty(B).
% 1.79/2.01 0 [] subset(A,A).
% 1.79/2.01 0 [] -in(A,B)| -in(B,A).
% 1.79/2.01 0 [] element($f1(A),A).
% 1.79/2.01 0 [] preboolean(finite_subsets(A)).
% 1.79/2.01 0 [] -empty(powerset(A)).
% 1.79/2.01 0 [] cup_closed(powerset(A)).
% 1.79/2.01 0 [] diff_closed(powerset(A)).
% 1.79/2.01 0 [] preboolean(powerset(A)).
% 1.79/2.01 0 [] -empty(finite_subsets(A)).
% 1.79/2.01 0 [] cup_closed(finite_subsets(A)).
% 1.79/2.01 0 [] diff_closed(finite_subsets(A)).
% 1.79/2.01 0 [] preboolean(finite_subsets(A)).
% 1.79/2.01 0 [] -preboolean(A)|cup_closed(A).
% 1.79/2.01 0 [] -preboolean(A)|diff_closed(A).
% 1.79/2.01 0 [] -element(B,finite_subsets(A))|finite(B).
% 1.79/2.01 0 [] -empty($c1).
% 1.79/2.01 0 [] cup_closed($c1).
% 1.79/2.01 0 [] cap_closed($c1).
% 1.79/2.01 0 [] diff_closed($c1).
% 1.79/2.01 0 [] preboolean($c1).
% 1.79/2.01 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.79/2.01 0 [] -empty($c2).
% 1.79/2.01 0 [] finite($c2).
% 1.79/2.01 0 [] element($f2(A),powerset(A)).
% 1.79/2.01 0 [] empty($f2(A)).
% 1.79/2.01 0 [] relation($f2(A)).
% 1.79/2.01 0 [] function($f2(A)).
% 1.79/2.01 0 [] one_to_one($f2(A)).
% 1.79/2.01 0 [] epsilon_transitive($f2(A)).
% 1.79/2.01 0 [] epsilon_connected($f2(A)).
% 1.79/2.01 0 [] ordinal($f2(A)).
% 1.79/2.01 0 [] natural($f2(A)).
% 1.79/2.01 0 [] finite($f2(A)).
% 1.79/2.01 0 [] empty(A)|element($f3(A),powerset(A)).
% 1.79/2.01 0 [] empty(A)| -empty($f3(A)).
% 1.79/2.01 0 [] empty(A)|finite($f3(A)).
% 1.79/2.01 0 [] empty(A)|element($f4(A),powerset(A)).
% 1.79/2.01 0 [] empty(A)| -empty($f4(A)).
% 1.79/2.01 0 [] empty(A)|finite($f4(A)).
% 1.79/2.01 0 [] -empty(powerset(A)).
% 1.79/2.01 0 [] empty(A)|element($f5(A),powerset(A)).
% 1.79/2.01 0 [] empty(A)| -empty($f5(A)).
% 1.79/2.01 0 [] element($f6(A),powerset(A)).
% 1.79/2.01 0 [] empty($f6(A)).
% 1.79/2.01 0 [] empty($c3).
% 1.79/2.01 0 [] -empty($c4).
% 1.79/2.01 0 [] -in(A,B)|element(A,B).
% 1.79/2.01 0 [] -element(A,powerset(B))|subset(A,B).
% 1.79/2.01 0 [] element(A,powerset(B))| -subset(A,B).
% 1.79/2.01 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.79/2.01 0 [] -in(A,B)| -empty(B).
% 1.79/2.01 0 [] element($c5,finite_subsets($c6)).
% 1.79/2.01 0 [] -element($c5,powerset($c6)).
% 1.79/2.01 0 [] -preboolean(B)|B!=finite_subsets(A)| -in(C,B)|subset(C,A).
% 1.79/2.01 0 [] -preboolean(B)|B!=finite_subsets(A)| -in(C,B)|finite(C).
% 1.79/2.01 0 [] -preboolean(B)|B!=finite_subsets(A)|in(C,B)| -subset(C,A)| -finite(C).
% 1.79/2.01 0 [] -preboolean(B)|B=finite_subsets(A)|in($f7(A,B),B)|subset($f7(A,B),A).
% 1.79/2.01 0 [] -preboolean(B)|B=finite_subsets(A)|in($f7(A,B),B)|finite($f7(A,B)).
% 1.79/2.01 0 [] -preboolean(B)|B=finite_subsets(A)| -in($f7(A,B),B)| -subset($f7(A,B),A)| -finite($f7(A,B)).
% 1.79/2.01 end_of_list.
% 1.79/2.01
% 1.79/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.79/2.01
% 1.79/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.79/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/2.01 deletion, with positive clauses in sos and nonpositive
% 1.79/2.01 clauses in usable.
% 1.79/2.01
% 1.79/2.01 dependent: set(knuth_bendix).
% 1.79/2.01 dependent: set(anl_eq).
% 1.79/2.01 dependent: set(para_from).
% 1.79/2.01 dependent: set(para_into).
% 1.79/2.01 dependent: clear(para_from_right).
% 1.79/2.01 dependent: clear(para_into_right).
% 1.79/2.01 dependent: set(para_from_vars).
% 1.79/2.01 dependent: set(eq_units_both_ways).
% 1.79/2.01 dependent: set(dynamic_demod_all).
% 1.79/2.01 dependent: set(dynamic_demod).
% 1.79/2.01 dependent: set(order_eq).
% 1.79/2.01 dependent: set(back_demod).
% 1.79/2.01 dependent: set(lrpo).
% 1.79/2.01 dependent: set(hyper_res).
% 1.79/2.01 dependent: set(unit_deletion).
% 1.79/2.01 dependent: set(factor).
% 1.79/2.01
% 1.79/2.01 ------------> process usable:
% 1.79/2.01 ** KEPT (pick-wt=6): 1 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.79/2.01 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.79/2.01 ** KEPT (pick-wt=8): 3 [] -element(A,B)|empty(B)|in(A,B).
% 1.79/2.01 ** KEPT (pick-wt=9): 4 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.79/2.01 ** KEPT (pick-wt=5): 5 [] -empty(A)|A=empty_set.
% 1.79/2.01 ** KEPT (pick-wt=7): 6 [] -empty(A)|A=B| -empty(B).
% 1.79/2.01 ** KEPT (pick-wt=6): 7 [] -in(A,B)| -in(B,A).
% 1.79/2.01 ** KEPT (pick-wt=3): 8 [] -empty(powerset(A)).
% 1.79/2.01 ** KEPT (pick-wt=3): 9 [] -empty(finite_subsets(A)).
% 1.79/2.01 ** KEPT (pick-wt=4): 10 [] -preboolean(A)|cup_closed(A).
% 1.79/2.01 ** KEPT (pick-wt=4): 11 [] -preboolean(A)|diff_closed(A).
% 1.79/2.01 ** KEPT (pick-wt=6): 12 [] -element(A,finite_subsets(B))|finite(A).
% 1.79/2.01 ** KEPT (pick-wt=2): 13 [] -empty($c1).
% 1.79/2.01 ** KEPT (pick-wt=8): 14 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.79/2.01 ** KEPT (pick-wt=2): 15 [] -empty($c2).
% 1.79/2.01 ** KEPT (pick-wt=5): 16 [] empty(A)| -empty($f3(A)).
% 1.79/2.01 ** KEPT (pick-wt=5): 17 [] empty(A)| -empty($f4(A)).
% 1.79/2.01 Following clause subsumed by 8 during input processing: 0 [] -empty(powerset(A)).
% 1.79/2.01 ** KEPT (pick-wt=5): 18 [] empty(A)| -empty($f5(A)).
% 1.79/2.01 ** KEPT (pick-wt=2): 19 [] -empty($c4).
% 1.79/2.01 ** KEPT (pick-wt=6): 20 [] -in(A,B)|element(A,B).
% 1.79/2.01 ** KEPT (pick-wt=7): 21 [] -element(A,powerset(B))|subset(A,B).
% 1.79/2.01 ** KEPT (pick-wt=7): 22 [] element(A,powerset(B))| -subset(A,B).
% 1.79/2.01 ** KEPT (pick-wt=10): 23 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.79/2.01 ** KEPT (pick-wt=5): 24 [] -in(A,B)| -empty(B).
% 1.79/2.01 ** KEPT (pick-wt=4): 25 [] -element($c5,powerset($c6)).
% 1.79/2.01 ** KEPT (pick-wt=12): 26 [] -preboolean(A)|A!=finite_subsets(B)| -in(C,A)|subset(C,B).
% 1.79/2.01 ** KEPT (pick-wt=11): 27 [] -preboolean(A)|A!=finite_subsets(B)| -in(C,A)|finite(C).
% 1.79/2.01 ** KEPT (pick-wt=14): 28 [] -preboolean(A)|A!=finite_subsets(B)|in(C,A)| -subset(C,B)| -finite(C).
% 1.79/2.01 ** KEPT (pick-wt=16): 29 [] -preboolean(A)|A=finite_subsets(B)|in($f7(B,A),A)|subset($f7(B,A),B).
% 1.79/2.01 ** KEPT (pick-wt=15): 30 [] -preboolean(A)|A=finite_subsets(B)|in($f7(B,A),A)|finite($f7(B,A)).
% 1.79/2.01 ** KEPT (pick-wt=20): 31 [] -preboolean(A)|A=finite_subsets(B)| -in($f7(B,A),A)| -subset($f7(B,A),B)| -finite($f7(B,A)).
% 1.79/2.01
% 1.79/2.01 ------------> process sos:
% 1.79/2.01 ** KEPT (pick-wt=3): 34 [] A=A.
% 1.79/2.01 ** KEPT (pick-wt=2): 35 [] empty(empty_set).
% 1.79/2.01 ** KEPT (pick-wt=3): 36 [] subset(A,A).
% 1.79/2.01 ** KEPT (pick-wt=4): 37 [] element($f1(A),A).
% 1.79/2.01 ** KEPT (pick-wt=3): 38 [] preboolean(finite_subsets(A)).
% 1.79/2.01 ** KEPT (pick-wt=3): 39 [] cup_closed(powerset(A)).
% 1.79/2.01 ** KEPT (pick-wt=3): 40 [] diff_closed(powerset(A)).
% 1.79/2.01 ** KEPT (pick-wt=3): 41 [] preboolean(powerset(A)).
% 1.79/2.01 ** KEPT (pick-wt=3): 42 [] cup_closed(finite_subsets(A)).
% 1.79/2.01 ** KEPT (pick-wt=3): 43 [] diff_closed(finite_subsets(A)).
% 1.79/2.01 Following clause subsumed by 38 during input processing: 0 [] preboolean(finite_subsets(A)).
% 1.79/2.02 ** KEPT (pick-wt=2): 44 [] cup_closed($c1).
% 1.79/2.02 ** KEPT (pick-wt=2): 45 [] cap_closed($c1).
% 1.79/2.02 ** KEPT (pick-wt=2): 46 [] diff_closed($c1).
% 1.79/2.02 ** KEPT (pick-wt=2): 47 [] preboolean($c1).
% 1.79/2.02 ** KEPT (pick-wt=2): 48 [] finite($c2).
% 1.79/2.02 ** KEPT (pick-wt=5): 49 [] element($f2(A),powerset(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 50 [] empty($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 51 [] relation($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 52 [] function($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 53 [] one_to_one($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 54 [] epsilon_transitive($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 55 [] epsilon_connected($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 56 [] ordinal($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 57 [] natural($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 58 [] finite($f2(A)).
% 1.79/2.02 ** KEPT (pick-wt=7): 59 [] empty(A)|element($f3(A),powerset(A)).
% 1.79/2.02 ** KEPT (pick-wt=5): 60 [] empty(A)|finite($f3(A)).
% 1.79/2.02 ** KEPT (pick-wt=7): 61 [] empty(A)|element($f4(A),powerset(A)).
% 1.79/2.02 ** KEPT (pick-wt=5): 62 [] empty(A)|finite($f4(A)).
% 1.79/2.02 ** KEPT (pick-wt=7): 63 [] empty(A)|element($f5(A),powerset(A)).
% 1.79/2.02 ** KEPT (pick-wt=5): 64 [] element($f6(A),powerset(A)).
% 1.79/2.02 ** KEPT (pick-wt=3): 65 [] empty($f6(A)).
% 1.79/2.02 ** KEPT (pick-wt=2): 66 [] empty($c3).
% 1.79/2.02 ** KEPT (pick-wt=4): 67 [] element($c5,finite_subsets($c6)).
% 1.79/2.02 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A.
% 1.79/2.02 34 back subsumes 32.
% 1.79/2.02
% 1.79/2.02 ======= end of input processing =======
% 1.79/2.02
% 1.79/2.02 =========== start of search ===========
% 1.79/2.02
% 1.79/2.02 -------- PROOF --------
% 1.79/2.02
% 1.79/2.02 ----> UNIT CONFLICT at 0.01 sec ----> 340 [binary,339.1,25.1] $F.
% 1.79/2.02
% 1.79/2.02 Length of proof is 3. Level of proof is 3.
% 1.79/2.02
% 1.79/2.02 ---------------- PROOF ----------------
% 1.79/2.02 % SZS status Theorem
% 1.79/2.02 % SZS output start Refutation
% See solution above
% 1.79/2.02 ------------ end of proof -------------
% 1.79/2.02
% 1.79/2.02
% 1.79/2.02 Search stopped by max_proofs option.
% 1.79/2.02
% 1.79/2.02
% 1.79/2.02 Search stopped by max_proofs option.
% 1.79/2.02
% 1.79/2.02 ============ end of search ============
% 1.79/2.02
% 1.79/2.02 -------------- statistics -------------
% 1.79/2.02 clauses given 55
% 1.79/2.02 clauses generated 515
% 1.79/2.02 clauses kept 336
% 1.79/2.02 clauses forward subsumed 263
% 1.79/2.02 clauses back subsumed 8
% 1.79/2.02 Kbytes malloced 1953
% 1.79/2.02
% 1.79/2.02 ----------- times (seconds) -----------
% 1.79/2.02 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.79/2.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/2.02 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.79/2.02
% 1.79/2.02 That finishes the proof of the theorem.
% 1.79/2.02
% 1.79/2.02 Process 4793 finished Wed Jul 27 07:21:32 2022
% 1.79/2.02 Otter interrupted
% 1.79/2.02 PROOF FOUND
%------------------------------------------------------------------------------