TSTP Solution File: SEU180+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:04 EDT 2022
% Result : Theorem 1.96s 2.12s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 28 ( 7 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( A != set_union2(B,C)
| in(D,A)
| ~ in(D,C) ),
file('SEU180+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ relation(A)
| B != relation_dom(A)
| in(C,B)
| ~ in(ordered_pair(C,D),A) ),
file('SEU180+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ relation(A)
| B != relation_rng(A)
| in(C,B)
| ~ in(ordered_pair(D,C),A) ),
file('SEU180+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ relation(A)
| relation_field(A) = set_union2(relation_dom(A),relation_rng(A)) ),
file('SEU180+1.p',unknown),
[] ).
cnf(16,plain,
( ~ relation(A)
| set_union2(relation_dom(A),relation_rng(A)) = relation_field(A) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.2')] ).
cnf(26,axiom,
( ~ in(dollar_c6,relation_field(dollar_c4))
| ~ in(dollar_c5,relation_field(dollar_c4)) ),
file('SEU180+1.p',unknown),
[] ).
cnf(38,axiom,
set_union2(A,B) = set_union2(B,A),
file('SEU180+1.p',unknown),
[] ).
cnf(46,axiom,
set_union2(A,A) = A,
file('SEU180+1.p',unknown),
[] ).
cnf(52,axiom,
relation(dollar_c4),
file('SEU180+1.p',unknown),
[] ).
cnf(53,axiom,
in(ordered_pair(dollar_c6,dollar_c5),dollar_c4),
file('SEU180+1.p',unknown),
[] ).
cnf(184,plain,
in(dollar_c5,relation_rng(dollar_c4)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[53,12,52,46]),46]),
[iquote('hyper,53,12,52,45,demod,46')] ).
cnf(185,plain,
in(dollar_c6,relation_dom(dollar_c4)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[53,8,52,46]),46]),
[iquote('hyper,53,8,52,45,demod,46')] ).
cnf(648,plain,
in(dollar_c5,set_union2(A,relation_rng(dollar_c4))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[184,4,46]),46]),
[iquote('hyper,184,4,45,demod,46')] ).
cnf(656,plain,
in(dollar_c6,set_union2(relation_dom(dollar_c4),A)),
inference(hyper,[status(thm)],[185,4,38]),
[iquote('hyper,185,4,38')] ).
cnf(753,plain,
in(dollar_c5,relation_field(dollar_c4)),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[648,16]),52]),
[iquote('para_into,648.1.2,16.2.1,unit_del,52')] ).
cnf(776,plain,
in(dollar_c6,relation_field(dollar_c4)),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[656,16]),52]),
[iquote('para_into,656.1.2,16.2.1,unit_del,52')] ).
cnf(777,plain,
$false,
inference(hyper,[status(thm)],[776,26,753]),
[iquote('hyper,776,26,753')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n029.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 07:47:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.81/2.01 ----- Otter 3.3f, August 2004 -----
% 1.81/2.01 The process was started by sandbox on n029.cluster.edu,
% 1.81/2.01 Wed Jul 27 07:47:44 2022
% 1.81/2.01 The command was "./otter". The process ID is 2386.
% 1.81/2.01
% 1.81/2.01 set(prolog_style_variables).
% 1.81/2.01 set(auto).
% 1.81/2.01 dependent: set(auto1).
% 1.81/2.01 dependent: set(process_input).
% 1.81/2.01 dependent: clear(print_kept).
% 1.81/2.01 dependent: clear(print_new_demod).
% 1.81/2.01 dependent: clear(print_back_demod).
% 1.81/2.01 dependent: clear(print_back_sub).
% 1.81/2.01 dependent: set(control_memory).
% 1.81/2.01 dependent: assign(max_mem, 12000).
% 1.81/2.01 dependent: assign(pick_given_ratio, 4).
% 1.81/2.01 dependent: assign(stats_level, 1).
% 1.81/2.01 dependent: assign(max_seconds, 10800).
% 1.81/2.01 clear(print_given).
% 1.81/2.01
% 1.81/2.01 formula_list(usable).
% 1.81/2.01 all A (A=A).
% 1.81/2.01 all A B (in(A,B)-> -in(B,A)).
% 1.81/2.01 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.81/2.01 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.81/2.01 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.81/2.01 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.01 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.01 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.81/2.01 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 $T.
% 1.81/2.01 all A exists B element(B,A).
% 1.81/2.01 empty(empty_set).
% 1.81/2.01 all A B (-empty(ordered_pair(A,B))).
% 1.81/2.01 all A B (relation(A)&relation(B)->relation(set_union2(A,B))).
% 1.81/2.01 all A (-empty(singleton(A))).
% 1.81/2.01 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.81/2.01 all A B (-empty(unordered_pair(A,B))).
% 1.81/2.01 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.81/2.01 all A B (set_union2(A,A)=A).
% 1.81/2.01 exists A (empty(A)&relation(A)).
% 1.81/2.01 exists A empty(A).
% 1.81/2.01 exists A (-empty(A)).
% 1.81/2.01 all A (set_union2(A,empty_set)=A).
% 1.81/2.01 all A B (in(A,B)->element(A,B)).
% 1.81/2.01 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.81/2.01 -(all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_field(C))&in(B,relation_field(C))))).
% 1.81/2.01 all A (empty(A)->A=empty_set).
% 1.81/2.01 all A B (-(in(A,B)&empty(B))).
% 1.81/2.01 all A B (-(empty(A)&A!=B&empty(B))).
% 1.81/2.01 end_of_list.
% 1.81/2.01
% 1.81/2.01 -------> usable clausifies to:
% 1.81/2.01
% 1.81/2.01 list(usable).
% 1.81/2.01 0 [] A=A.
% 1.81/2.01 0 [] -in(A,B)| -in(B,A).
% 1.81/2.01 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.81/2.01 0 [] set_union2(A,B)=set_union2(B,A).
% 1.81/2.01 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.81/2.01 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.81/2.01 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.81/2.01 0 [] C=set_union2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A)|in($f1(A,B,C),B).
% 1.81/2.01 0 [] C=set_union2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A).
% 1.81/2.01 0 [] C=set_union2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),B).
% 1.81/2.01 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f2(A,B,C)),A).
% 1.81/2.01 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 1.81/2.01 0 [] -relation(A)|B=relation_dom(A)|in($f4(A,B),B)|in(ordered_pair($f4(A,B),$f3(A,B)),A).
% 1.81/2.01 0 [] -relation(A)|B=relation_dom(A)| -in($f4(A,B),B)| -in(ordered_pair($f4(A,B),X1),A).
% 1.81/2.01 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f5(A,B,C),C),A).
% 1.81/2.01 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.81/2.01 0 [] -relation(A)|B=relation_rng(A)|in($f7(A,B),B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 1.81/2.01 0 [] -relation(A)|B=relation_rng(A)| -in($f7(A,B),B)| -in(ordered_pair(X2,$f7(A,B)),A).
% 1.81/2.01 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.81/2.01 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] $T.
% 1.81/2.01 0 [] element($f8(A),A).
% 1.81/2.01 0 [] empty(empty_set).
% 1.81/2.01 0 [] -empty(ordered_pair(A,B)).
% 1.81/2.01 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 1.81/2.01 0 [] -empty(singleton(A)).
% 1.81/2.01 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.81/2.01 0 [] -empty(unordered_pair(A,B)).
% 1.81/2.01 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.81/2.01 0 [] set_union2(A,A)=A.
% 1.81/2.01 0 [] empty($c1).
% 1.81/2.01 0 [] relation($c1).
% 1.81/2.01 0 [] empty($c2).
% 1.81/2.01 0 [] -empty($c3).
% 1.81/2.01 0 [] set_union2(A,empty_set)=A.
% 1.81/2.01 0 [] -in(A,B)|element(A,B).
% 1.81/2.01 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.81/2.01 0 [] relation($c4).
% 1.81/2.01 0 [] in(ordered_pair($c6,$c5),$c4).
% 1.81/2.01 0 [] -in($c6,relation_field($c4))| -in($c5,relation_field($c4)).
% 1.81/2.01 0 [] -empty(A)|A=empty_set.
% 1.81/2.01 0 [] -in(A,B)| -empty(B).
% 1.81/2.01 0 [] -empty(A)|A=B| -empty(B).
% 1.81/2.01 end_of_list.
% 1.81/2.01
% 1.81/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.81/2.01
% 1.81/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.81/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.81/2.01 deletion, with positive clauses in sos and nonpositive
% 1.81/2.01 clauses in usable.
% 1.81/2.01
% 1.81/2.01 dependent: set(knuth_bendix).
% 1.81/2.01 dependent: set(anl_eq).
% 1.81/2.01 dependent: set(para_from).
% 1.81/2.01 dependent: set(para_into).
% 1.81/2.01 dependent: clear(para_from_right).
% 1.81/2.01 dependent: clear(para_into_right).
% 1.81/2.01 dependent: set(para_from_vars).
% 1.81/2.01 dependent: set(eq_units_both_ways).
% 1.81/2.01 dependent: set(dynamic_demod_all).
% 1.81/2.01 dependent: set(dynamic_demod).
% 1.81/2.01 dependent: set(order_eq).
% 1.81/2.01 dependent: set(back_demod).
% 1.81/2.01 dependent: set(lrpo).
% 1.81/2.01 dependent: set(hyper_res).
% 1.81/2.01 dependent: set(unit_deletion).
% 1.81/2.01 dependent: set(factor).
% 1.81/2.01
% 1.81/2.01 ------------> process usable:
% 1.81/2.01 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.81/2.01 ** KEPT (pick-wt=14): 2 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.81/2.01 ** KEPT (pick-wt=11): 3 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.81/2.01 ** KEPT (pick-wt=11): 4 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.81/2.01 ** KEPT (pick-wt=17): 5 [] A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),B).
% 1.81/2.01 ** KEPT (pick-wt=17): 6 [] A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),C).
% 1.81/2.01 ** KEPT (pick-wt=17): 7 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f2(A,B,C)),A).
% 1.81/2.01 ** KEPT (pick-wt=14): 8 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 1.81/2.01 ** KEPT (pick-wt=20): 9 [] -relation(A)|B=relation_dom(A)|in($f4(A,B),B)|in(ordered_pair($f4(A,B),$f3(A,B)),A).
% 1.81/2.01 ** KEPT (pick-wt=18): 10 [] -relation(A)|B=relation_dom(A)| -in($f4(A,B),B)| -in(ordered_pair($f4(A,B),C),A).
% 1.81/2.01 ** KEPT (pick-wt=17): 11 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f5(A,B,C),C),A).
% 1.81/2.01 ** KEPT (pick-wt=14): 12 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.81/2.01 ** KEPT (pick-wt=20): 13 [] -relation(A)|B=relation_rng(A)|in($f7(A,B),B)|in(ordered_pair($f6(A,B),$f7(A,B)),A).
% 1.81/2.01 ** KEPT (pick-wt=18): 14 [] -relation(A)|B=relation_rng(A)| -in($f7(A,B),B)| -in(ordered_pair(C,$f7(A,B)),A).
% 1.81/2.01 ** KEPT (pick-wt=10): 16 [copy,15,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 1.81/2.01 ** KEPT (pick-wt=4): 17 [] -empty(ordered_pair(A,B)).
% 1.81/2.01 ** KEPT (pick-wt=8): 18 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 1.81/2.01 ** KEPT (pick-wt=3): 19 [] -empty(singleton(A)).
% 1.81/2.01 ** KEPT (pick-wt=6): 20 [] empty(A)| -empty(set_union2(A,B)).
% 1.81/2.01 ** KEPT (pick-wt=4): 21 [] -empty(unordered_pair(A,B)).
% 1.81/2.01 ** KEPT (pick-wt=6): 22 [] empty(A)| -empty(set_union2(B,A)).
% 1.81/2.01 ** KEPT (pick-wt=2): 23 [] -empty($c3).
% 1.81/2.01 ** KEPT (pick-wt=6): 24 [] -in(A,B)|element(A,B).
% 1.81/2.01 ** KEPT (pick-wt=8): 25 [] -element(A,B)|empty(B)|in(A,B).
% 1.81/2.01 ** KEPT (pick-wt=8): 26 [] -in($c6,relation_field($c4))| -in($c5,relation_field($c4)).
% 1.81/2.01 ** KEPT (pick-wt=5): 27 [] -empty(A)|A=empty_set.
% 1.81/2.01 ** KEPT (pick-wt=5): 28 [] -in(A,B)| -empty(B).
% 1.81/2.01 ** KEPT (pick-wt=7): 29 [] -empty(A)|A=B| -empty(B).
% 1.81/2.01
% 1.81/2.01 ------------> process sos:
% 1.81/2.01 ** KEPT (pick-wt=3): 36 [] A=A.
% 1.81/2.01 ** KEPT (pick-wt=7): 37 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.81/2.01 ** KEPT (pick-wt=7): 38 [] set_union2(A,B)=set_union2(B,A).
% 1.81/2.01 ** KEPT (pick-wt=23): 39 [] A=set_union2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),B)|in($f1(B,C,A),C).
% 1.81/2.01 ** KEPT (pick-wt=10): 41 [copy,40,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.81/2.01 ---> New Demodulator: 42 [new_demod,41] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.81/2.01 ** KEPT (pick-wt=4): 43 [] element($f8(A),A).
% 1.81/2.01 ** KEPT (pick-wt=2): 44 [] empty(empty_set).
% 1.81/2.01 ** KEPT (pick-wt=5): 45 [] set_union2(A,A)=A.
% 1.81/2.01 ---> New Demodulator: 46 [new_demod,45] set_union2(A,A)=A.
% 1.81/2.01 ** KEPT (pick-wt=2): 47 [] empty($c1).
% 1.81/2.01 ** KEPT (pick-wt=2): 48 [] relation($c1).
% 1.81/2.01 ** KEPT (pick-wt=2): 49 [] empty($c2).
% 1.81/2.01 ** KEPT (pick-wt=5): 50 [] set_union2(A,empty_set)=A.
% 1.81/2.01 ---> New Demodulator: 51 [new_demod,50] set_union2(A,empty_set)=A.
% 1.81/2.01 ** KEPT (pick-wt=2): 52 [] relation($c4).
% 1.81/2.01 ** KEPT (pick-wt=5): 53 [] in(ordered_pair($c6,$c5),$c4).
% 1.81/2.01 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] A=A.
% 1.81/2.01 36 back subsumes 35.
% 1.81/2.01 Following clause subsumed by 37 during input processing: 0 [copy,37,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 1.96/2.12 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.96/2.12 >>>> Starting back demodulation with 42.
% 1.96/2.12 >>>> Starting back demodulation with 46.
% 1.96/2.12 >> back demodulating 34 with 46.
% 1.96/2.12 >> back demodulating 31 with 46.
% 1.96/2.12 >>>> Starting back demodulation with 51.
% 1.96/2.12
% 1.96/2.12 ======= end of input processing =======
% 1.96/2.12
% 1.96/2.12 =========== start of search ===========
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Resetting weight limit to 10.
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Resetting weight limit to 10.
% 1.96/2.12
% 1.96/2.12 sos_size=568
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Resetting weight limit to 6.
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Resetting weight limit to 6.
% 1.96/2.12
% 1.96/2.12 sos_size=618
% 1.96/2.12
% 1.96/2.12 -------- PROOF --------
% 1.96/2.12
% 1.96/2.12 -----> EMPTY CLAUSE at 0.12 sec ----> 777 [hyper,776,26,753] $F.
% 1.96/2.12
% 1.96/2.12 Length of proof is 7. Level of proof is 3.
% 1.96/2.12
% 1.96/2.12 ---------------- PROOF ----------------
% 1.96/2.12 % SZS status Theorem
% 1.96/2.12 % SZS output start Refutation
% See solution above
% 1.96/2.12 ------------ end of proof -------------
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Search stopped by max_proofs option.
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Search stopped by max_proofs option.
% 1.96/2.12
% 1.96/2.12 ============ end of search ============
% 1.96/2.12
% 1.96/2.12 -------------- statistics -------------
% 1.96/2.12 clauses given 40
% 1.96/2.12 clauses generated 2554
% 1.96/2.12 clauses kept 762
% 1.96/2.12 clauses forward subsumed 830
% 1.96/2.12 clauses back subsumed 11
% 1.96/2.12 Kbytes malloced 4882
% 1.96/2.12
% 1.96/2.12 ----------- times (seconds) -----------
% 1.96/2.12 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 1.96/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.96/2.12
% 1.96/2.12 That finishes the proof of the theorem.
% 1.96/2.12
% 1.96/2.12 Process 2386 finished Wed Jul 27 07:47:46 2022
% 1.96/2.12 Otter interrupted
% 1.96/2.12 PROOF FOUND
%------------------------------------------------------------------------------