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