TSTP Solution File: SEU187+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:15:06 EDT 2022
% Result : Theorem 2.37s 2.59s
% Output : Refutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 9 unt; 8 nHn; 17 RR)
% Number of literals : 53 ( 23 equ; 20 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ relation(A)
| B = relation_dom(A)
| in(dollar_f3(A,B),B)
| in(ordered_pair(dollar_f3(A,B),dollar_f2(A,B)),A) ),
file('SEU187+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ relation(A)
| B = relation_rng(A)
| in(dollar_f6(A,B),B)
| in(ordered_pair(dollar_f5(A,B),dollar_f6(A,B)),A) ),
file('SEU187+1.p',unknown),
[] ).
cnf(21,axiom,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
file('SEU187+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ empty(A)
| A = empty_set ),
file('SEU187+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ in(A,B)
| ~ empty(B) ),
file('SEU187+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ empty(A)
| A = B
| ~ empty(B) ),
file('SEU187+1.p',unknown),
[] ).
cnf(28,axiom,
A = A,
file('SEU187+1.p',unknown),
[] ).
cnf(34,axiom,
empty(empty_set),
file('SEU187+1.p',unknown),
[] ).
cnf(35,axiom,
relation(empty_set),
file('SEU187+1.p',unknown),
[] ).
cnf(36,axiom,
empty(dollar_c1),
file('SEU187+1.p',unknown),
[] ).
cnf(46,plain,
( A = relation_rng(empty_set)
| in(dollar_f6(empty_set,A),A)
| in(ordered_pair(dollar_f5(empty_set,A),dollar_f6(empty_set,A)),empty_set) ),
inference(hyper,[status(thm)],[35,9]),
[iquote('hyper,35,9')] ).
cnf(47,plain,
( A = relation_dom(empty_set)
| in(dollar_f3(empty_set,A),A)
| in(ordered_pair(dollar_f3(empty_set,A),dollar_f2(empty_set,A)),empty_set) ),
inference(hyper,[status(thm)],[35,5]),
[iquote('hyper,35,5')] ).
cnf(54,plain,
empty_set = dollar_c1,
inference(hyper,[status(thm)],[36,24,34]),
[iquote('hyper,36,24,34')] ).
cnf(60,plain,
( A = relation_dom(dollar_c1)
| in(dollar_f3(dollar_c1,A),A)
| in(ordered_pair(dollar_f3(dollar_c1,A),dollar_f2(dollar_c1,A)),dollar_c1) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[47]),54,54,54,54,54]),
[iquote('back_demod,47,demod,54,54,54,54,54')] ).
cnf(61,plain,
( A = relation_rng(dollar_c1)
| in(dollar_f6(dollar_c1,A),A)
| in(ordered_pair(dollar_f5(dollar_c1,A),dollar_f6(dollar_c1,A)),dollar_c1) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[46]),54,54,54,54,54]),
[iquote('back_demod,46,demod,54,54,54,54,54')] ).
cnf(67,plain,
( ~ empty(A)
| A = dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[22]),54]),
[iquote('back_demod,22,demod,54')] ).
cnf(68,plain,
( relation_dom(dollar_c1) != dollar_c1
| relation_rng(dollar_c1) != dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[21]),54,54,54,54]),
[iquote('back_demod,21,demod,54,54,54,54')] ).
cnf(654,plain,
( relation_rng(dollar_c1) != dollar_c1
| ~ empty(relation_dom(dollar_c1)) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[68,67]),28]),
[iquote('para_into,68.1.1,67.2.1,unit_del,28')] ).
cnf(658,plain,
( relation_rng(A) != dollar_c1
| ~ empty(relation_dom(dollar_c1))
| ~ empty(A) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[654,24]),36]),
[iquote('para_into,654.1.1.1,24.2.1,unit_del,36')] ).
cnf(662,plain,
( relation_rng(relation_dom(dollar_c1)) != dollar_c1
| ~ empty(relation_dom(dollar_c1)) ),
inference(factor,[status(thm)],[658]),
[iquote('factor,658.2.3')] ).
cnf(707,plain,
( A = relation_dom(dollar_c1)
| in(dollar_f3(dollar_c1,A),A) ),
inference(hyper,[status(thm)],[60,23,36]),
[iquote('hyper,60,23,36')] ).
cnf(727,plain,
( A = relation_rng(dollar_c1)
| in(dollar_f6(dollar_c1,A),A) ),
inference(hyper,[status(thm)],[61,23,36]),
[iquote('hyper,61,23,36')] ).
cnf(861,plain,
relation_dom(dollar_c1) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[707,23,36])]),
[iquote('hyper,707,23,36,flip.1')] ).
cnf(868,plain,
relation_rng(dollar_c1) != dollar_c1,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[662]),861,861]),36]),
[iquote('back_demod,662,demod,861,861,unit_del,36')] ).
cnf(965,plain,
relation_rng(dollar_c1) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[727,23,36])]),
[iquote('hyper,727,23,36,flip.1')] ).
cnf(967,plain,
$false,
inference(binary,[status(thm)],[965,868]),
[iquote('binary,965.1,868.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 07:54:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.81/2.02 ----- Otter 3.3f, August 2004 -----
% 1.81/2.02 The process was started by sandbox on n008.cluster.edu,
% 1.81/2.02 Wed Jul 27 07:54:53 2022
% 1.81/2.02 The command was "./otter". The process ID is 28913.
% 1.81/2.02
% 1.81/2.02 set(prolog_style_variables).
% 1.81/2.02 set(auto).
% 1.81/2.02 dependent: set(auto1).
% 1.81/2.02 dependent: set(process_input).
% 1.81/2.02 dependent: clear(print_kept).
% 1.81/2.02 dependent: clear(print_new_demod).
% 1.81/2.02 dependent: clear(print_back_demod).
% 1.81/2.02 dependent: clear(print_back_sub).
% 1.81/2.02 dependent: set(control_memory).
% 1.81/2.02 dependent: assign(max_mem, 12000).
% 1.81/2.02 dependent: assign(pick_given_ratio, 4).
% 1.81/2.02 dependent: assign(stats_level, 1).
% 1.81/2.02 dependent: assign(max_seconds, 10800).
% 1.81/2.02 clear(print_given).
% 1.81/2.02
% 1.81/2.02 formula_list(usable).
% 1.81/2.02 all A (A=A).
% 1.81/2.02 all A B (in(A,B)-> -in(B,A)).
% 1.81/2.02 all A (empty(A)->relation(A)).
% 1.81/2.02 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.81/2.02 all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 1.81/2.02 all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 1.81/2.02 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 all A exists B element(B,A).
% 1.81/2.02 empty(empty_set).
% 1.81/2.02 all A B (-empty(ordered_pair(A,B))).
% 1.81/2.02 all A (-empty(singleton(A))).
% 1.81/2.02 all A B (-empty(unordered_pair(A,B))).
% 1.81/2.02 empty(empty_set).
% 1.81/2.02 relation(empty_set).
% 1.81/2.02 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.81/2.02 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 1.81/2.02 exists A (empty(A)&relation(A)).
% 1.81/2.02 exists A empty(A).
% 1.81/2.02 exists A (-empty(A)&relation(A)).
% 1.81/2.02 exists A (-empty(A)).
% 1.81/2.02 all A B (in(A,B)->element(A,B)).
% 1.81/2.02 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.81/2.02 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.81/2.02 -(relation_dom(empty_set)=empty_set&relation_rng(empty_set)=empty_set).
% 1.81/2.02 all A (empty(A)->A=empty_set).
% 1.81/2.02 all A B (-(in(A,B)&empty(B))).
% 1.81/2.02 all A B (-(empty(A)&A!=B&empty(B))).
% 1.81/2.02 end_of_list.
% 1.81/2.02
% 1.81/2.02 -------> usable clausifies to:
% 1.81/2.02
% 1.81/2.02 list(usable).
% 1.81/2.02 0 [] A=A.
% 1.81/2.02 0 [] -in(A,B)| -in(B,A).
% 1.81/2.02 0 [] -empty(A)|relation(A).
% 1.81/2.02 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.81/2.02 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f1(A,B,C)),A).
% 1.81/2.02 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 1.81/2.02 0 [] -relation(A)|B=relation_dom(A)|in($f3(A,B),B)|in(ordered_pair($f3(A,B),$f2(A,B)),A).
% 1.81/2.02 0 [] -relation(A)|B=relation_dom(A)| -in($f3(A,B),B)| -in(ordered_pair($f3(A,B),X1),A).
% 1.81/2.02 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f4(A,B,C),C),A).
% 1.81/2.02 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.81/2.02 0 [] -relation(A)|B=relation_rng(A)|in($f6(A,B),B)|in(ordered_pair($f5(A,B),$f6(A,B)),A).
% 1.81/2.02 0 [] -relation(A)|B=relation_rng(A)| -in($f6(A,B),B)| -in(ordered_pair(X2,$f6(A,B)),A).
% 1.81/2.02 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] $T.
% 1.81/2.02 0 [] element($f7(A),A).
% 1.81/2.02 0 [] empty(empty_set).
% 1.81/2.02 0 [] -empty(ordered_pair(A,B)).
% 1.81/2.02 0 [] -empty(singleton(A)).
% 1.81/2.02 0 [] -empty(unordered_pair(A,B)).
% 1.81/2.02 0 [] empty(empty_set).
% 1.81/2.02 0 [] relation(empty_set).
% 1.81/2.02 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.81/2.02 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.81/2.02 0 [] empty($c1).
% 1.81/2.02 0 [] relation($c1).
% 1.81/2.02 0 [] empty($c2).
% 1.81/2.02 0 [] -empty($c3).
% 1.81/2.02 0 [] relation($c3).
% 1.81/2.02 0 [] -empty($c4).
% 1.81/2.02 0 [] -in(A,B)|element(A,B).
% 1.81/2.02 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.81/2.02 0 [] in($f8(A,B),A)|in($f8(A,B),B)|A=B.
% 1.81/2.02 0 [] -in($f8(A,B),A)| -in($f8(A,B),B)|A=B.
% 1.81/2.02 0 [] relation_dom(empty_set)!=empty_set|relation_rng(empty_set)!=empty_set.
% 1.81/2.02 0 [] -empty(A)|A=empty_set.
% 1.81/2.02 0 [] -in(A,B)| -empty(B).
% 1.81/2.02 0 [] -empty(A)|A=B| -empty(B).
% 1.81/2.02 end_of_list.
% 1.81/2.02
% 1.81/2.02 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.81/2.02
% 1.81/2.02 This ia a non-Horn set with equality. The strategy will be
% 1.81/2.02 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.81/2.02 deletion, with positive clauses in sos and nonpositive
% 1.81/2.02 clauses in usable.
% 1.81/2.02
% 1.81/2.02 dependent: set(knuth_bendix).
% 1.81/2.02 dependent: set(anl_eq).
% 1.81/2.02 dependent: set(para_from).
% 1.81/2.02 dependent: set(para_into).
% 1.81/2.02 dependent: clear(para_from_right).
% 1.81/2.02 dependent: clear(para_into_right).
% 1.81/2.02 dependent: set(para_from_vars).
% 1.81/2.02 dependent: set(eq_units_both_ways).
% 1.81/2.02 dependent: set(dynamic_demod_all).
% 1.81/2.02 dependent: set(dynamic_demod).
% 2.37/2.59 dependent: set(order_eq).
% 2.37/2.59 dependent: set(back_demod).
% 2.37/2.59 dependent: set(lrpo).
% 2.37/2.59 dependent: set(hyper_res).
% 2.37/2.59 dependent: set(unit_deletion).
% 2.37/2.59 dependent: set(factor).
% 2.37/2.59
% 2.37/2.59 ------------> process usable:
% 2.37/2.59 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.37/2.59 ** KEPT (pick-wt=4): 2 [] -empty(A)|relation(A).
% 2.37/2.59 ** KEPT (pick-wt=17): 3 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f1(A,B,C)),A).
% 2.37/2.59 ** KEPT (pick-wt=14): 4 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.37/2.59 ** KEPT (pick-wt=20): 5 [] -relation(A)|B=relation_dom(A)|in($f3(A,B),B)|in(ordered_pair($f3(A,B),$f2(A,B)),A).
% 2.37/2.59 ** KEPT (pick-wt=18): 6 [] -relation(A)|B=relation_dom(A)| -in($f3(A,B),B)| -in(ordered_pair($f3(A,B),C),A).
% 2.37/2.59 ** KEPT (pick-wt=17): 7 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f4(A,B,C),C),A).
% 2.37/2.59 ** KEPT (pick-wt=14): 8 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.37/2.59 ** KEPT (pick-wt=20): 9 [] -relation(A)|B=relation_rng(A)|in($f6(A,B),B)|in(ordered_pair($f5(A,B),$f6(A,B)),A).
% 2.37/2.59 ** KEPT (pick-wt=18): 10 [] -relation(A)|B=relation_rng(A)| -in($f6(A,B),B)| -in(ordered_pair(C,$f6(A,B)),A).
% 2.37/2.59 ** KEPT (pick-wt=4): 11 [] -empty(ordered_pair(A,B)).
% 2.37/2.59 ** KEPT (pick-wt=3): 12 [] -empty(singleton(A)).
% 2.37/2.59 ** KEPT (pick-wt=4): 13 [] -empty(unordered_pair(A,B)).
% 2.37/2.59 ** KEPT (pick-wt=7): 14 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.37/2.59 ** KEPT (pick-wt=7): 15 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.37/2.59 ** KEPT (pick-wt=2): 16 [] -empty($c3).
% 2.37/2.59 ** KEPT (pick-wt=2): 17 [] -empty($c4).
% 2.37/2.59 ** KEPT (pick-wt=6): 18 [] -in(A,B)|element(A,B).
% 2.37/2.59 ** KEPT (pick-wt=8): 19 [] -element(A,B)|empty(B)|in(A,B).
% 2.37/2.59 ** KEPT (pick-wt=13): 20 [] -in($f8(A,B),A)| -in($f8(A,B),B)|A=B.
% 2.37/2.59 ** KEPT (pick-wt=8): 21 [] relation_dom(empty_set)!=empty_set|relation_rng(empty_set)!=empty_set.
% 2.37/2.59 ** KEPT (pick-wt=5): 22 [] -empty(A)|A=empty_set.
% 2.37/2.59 ** KEPT (pick-wt=5): 23 [] -in(A,B)| -empty(B).
% 2.37/2.59 ** KEPT (pick-wt=7): 24 [] -empty(A)|A=B| -empty(B).
% 2.37/2.59
% 2.37/2.59 ------------> process sos:
% 2.37/2.59 ** KEPT (pick-wt=3): 28 [] A=A.
% 2.37/2.59 ** KEPT (pick-wt=7): 29 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.37/2.59 ** KEPT (pick-wt=10): 31 [copy,30,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.37/2.59 ---> New Demodulator: 32 [new_demod,31] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.37/2.59 ** KEPT (pick-wt=4): 33 [] element($f7(A),A).
% 2.37/2.59 ** KEPT (pick-wt=2): 34 [] empty(empty_set).
% 2.37/2.59 Following clause subsumed by 34 during input processing: 0 [] empty(empty_set).
% 2.37/2.59 ** KEPT (pick-wt=2): 35 [] relation(empty_set).
% 2.37/2.59 ** KEPT (pick-wt=2): 36 [] empty($c1).
% 2.37/2.59 ** KEPT (pick-wt=2): 37 [] relation($c1).
% 2.37/2.59 ** KEPT (pick-wt=2): 38 [] empty($c2).
% 2.37/2.59 ** KEPT (pick-wt=2): 39 [] relation($c3).
% 2.37/2.59 ** KEPT (pick-wt=13): 40 [] in($f8(A,B),A)|in($f8(A,B),B)|A=B.
% 2.37/2.59 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] A=A.
% 2.37/2.59 28 back subsumes 27.
% 2.37/2.59 28 back subsumes 26.
% 2.37/2.59 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.37/2.59 >>>> Starting back demodulation with 32.
% 2.37/2.59
% 2.37/2.59 ======= end of input processing =======
% 2.37/2.59
% 2.37/2.59 =========== start of search ===========
% 2.37/2.59
% 2.37/2.59
% 2.37/2.59 Resetting weight limit to 10.
% 2.37/2.59
% 2.37/2.59
% 2.37/2.59 Resetting weight limit to 10.
% 2.37/2.59
% 2.37/2.59 sos_size=572
% 2.37/2.59
% 2.37/2.59
% 2.37/2.59 Resetting weight limit to 9.
% 2.37/2.59
% 2.37/2.59
% 2.37/2.59 Resetting weight limit to 9.
% 2.37/2.59
% 2.37/2.59 sos_size=616
% 2.37/2.59
% 2.37/2.59 -------- PROOF --------
% 2.37/2.59
% 2.37/2.59 ----> UNIT CONFLICT at 0.56 sec ----> 967 [binary,965.1,868.1] $F.
% 2.37/2.59
% 2.37/2.59 Length of proof is 15. Level of proof is 6.
% 2.37/2.59
% 2.37/2.59 ---------------- PROOF ----------------
% 2.37/2.59 % SZS status Theorem
% 2.37/2.59 % SZS output start Refutation
% See solution above
% 2.37/2.59 ------------ end of proof -------------
% 2.37/2.59
% 2.37/2.59
% 2.37/2.59 Search stopped by max_proofs option.
% 2.37/2.59
% 2.37/2.59
% 2.37/2.59 Search stopped by max_proofs option.
% 2.37/2.59
% 2.37/2.59 ============ end of search ============
% 2.37/2.59
% 2.37/2.59 -------------- statistics -------------
% 2.37/2.59 clauses given 233
% 2.37/2.59 clauses generated 26567
% 2.37/2.59 clauses kept 957
% 2.37/2.59 clauses forward subsumed 1851
% 2.37/2.59 clauses back subsumed 45
% 2.37/2.59 Kbytes malloced 5859
% 2.37/2.59
% 2.37/2.59 ----------- times (seconds) -----------
% 2.37/2.59 user CPU time 0.56 (0 hr, 0 min, 0 sec)
% 2.37/2.59 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.37/2.59 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.37/2.59
% 2.37/2.59 That finishes the proof of the theorem.
% 2.37/2.59
% 2.37/2.59 Process 28913 finished Wed Jul 27 07:54:55 2022
% 2.37/2.59 Otter interrupted
% 2.37/2.59 PROOF FOUND
%------------------------------------------------------------------------------