TSTP Solution File: SEU061+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU061+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:43 EDT 2022
% Result : Unknown 8.01s 8.19s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU061+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n005.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:48:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.95/2.16 ----- Otter 3.3f, August 2004 -----
% 1.95/2.16 The process was started by sandbox2 on n005.cluster.edu,
% 1.95/2.16 Wed Jul 27 07:48:35 2022
% 1.95/2.16 The command was "./otter". The process ID is 5258.
% 1.95/2.16
% 1.95/2.16 set(prolog_style_variables).
% 1.95/2.16 set(auto).
% 1.95/2.16 dependent: set(auto1).
% 1.95/2.16 dependent: set(process_input).
% 1.95/2.16 dependent: clear(print_kept).
% 1.95/2.16 dependent: clear(print_new_demod).
% 1.95/2.16 dependent: clear(print_back_demod).
% 1.95/2.16 dependent: clear(print_back_sub).
% 1.95/2.16 dependent: set(control_memory).
% 1.95/2.16 dependent: assign(max_mem, 12000).
% 1.95/2.16 dependent: assign(pick_given_ratio, 4).
% 1.95/2.16 dependent: assign(stats_level, 1).
% 1.95/2.16 dependent: assign(max_seconds, 10800).
% 1.95/2.16 clear(print_given).
% 1.95/2.16
% 1.95/2.16 formula_list(usable).
% 1.95/2.16 all A (A=A).
% 1.95/2.16 all A B (in(A,B)-> -in(B,A)).
% 1.95/2.16 all A (empty(A)->function(A)).
% 1.95/2.16 all A (empty(A)->relation(A)).
% 1.95/2.16 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.95/2.16 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.95/2.16 all A (relation(A)-> (all B C (C=relation_inverse_image(A,B)<-> (all D (in(D,C)<-> (exists E (in(ordered_pair(D,E),A)&in(E,B)))))))).
% 1.95/2.16 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.95/2.16 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.95/2.16 all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 1.95/2.16 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.95/2.16 all A exists B element(B,A).
% 1.95/2.16 empty(empty_set).
% 1.95/2.16 relation(empty_set).
% 1.95/2.16 relation_empty_yielding(empty_set).
% 1.95/2.16 all A (-empty(powerset(A))).
% 1.95/2.16 empty(empty_set).
% 1.95/2.16 all A B (-empty(ordered_pair(A,B))).
% 1.95/2.16 all A (-empty(singleton(A))).
% 1.95/2.16 all A B (-empty(unordered_pair(A,B))).
% 1.95/2.16 empty(empty_set).
% 1.95/2.16 relation(empty_set).
% 1.95/2.16 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 1.95/2.16 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 1.95/2.16 exists A (relation(A)&function(A)).
% 1.95/2.16 exists A (empty(A)&relation(A)).
% 1.95/2.16 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.95/2.16 exists A empty(A).
% 1.95/2.16 exists A (relation(A)&empty(A)&function(A)).
% 1.95/2.16 exists A (-empty(A)&relation(A)).
% 1.95/2.16 all A exists B (element(B,powerset(A))&empty(B)).
% 1.95/2.16 exists A (-empty(A)).
% 1.95/2.16 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.95/2.16 exists A (relation(A)&relation_empty_yielding(A)).
% 1.95/2.16 all A B subset(A,A).
% 1.95/2.16 -(all A B (relation(B)-> (in(A,relation_rng(B))<->relation_inverse_image(B,singleton(A))!=empty_set))).
% 1.95/2.16 all A B (in(A,B)->element(A,B)).
% 1.95/2.16 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.95/2.16 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.95/2.16 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.95/2.16 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.95/2.16 all A (empty(A)->A=empty_set).
% 1.95/2.16 all A B (-(in(A,B)&empty(B))).
% 1.95/2.16 all A B (-(empty(A)&A!=B&empty(B))).
% 1.95/2.16 end_of_list.
% 1.95/2.16
% 1.95/2.16 -------> usable clausifies to:
% 1.95/2.16
% 1.95/2.16 list(usable).
% 1.95/2.16 0 [] A=A.
% 1.95/2.16 0 [] -in(A,B)| -in(B,A).
% 1.95/2.16 0 [] -empty(A)|function(A).
% 1.95/2.16 0 [] -empty(A)|relation(A).
% 1.95/2.16 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.95/2.16 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.95/2.16 0 [] -relation(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(ordered_pair(D,$f1(A,B,C,D)),A).
% 1.95/2.16 0 [] -relation(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in($f1(A,B,C,D),B).
% 1.95/2.16 0 [] -relation(A)|C!=relation_inverse_image(A,B)|in(D,C)| -in(ordered_pair(D,E),A)| -in(E,B).
% 1.95/2.16 0 [] -relation(A)|C=relation_inverse_image(A,B)|in($f3(A,B,C),C)|in(ordered_pair($f3(A,B,C),$f2(A,B,C)),A).
% 1.95/2.16 0 [] -relation(A)|C=relation_inverse_image(A,B)|in($f3(A,B,C),C)|in($f2(A,B,C),B).
% 1.95/2.16 0 [] -relation(A)|C=relation_inverse_image(A,B)| -in($f3(A,B,C),C)| -in(ordered_pair($f3(A,B,C),X1),A)| -in(X1,B).
% 1.95/2.16 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.95/2.16 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.95/2.16 0 [] B=singleton(A)|in($f4(A,B),B)|$f4(A,B)=A.
% 1.95/2.16 0 [] B=singleton(A)| -in($f4(A,B),B)|$f4(A,B)!=A.
% 1.95/2.16 0 [] A!=empty_set| -in(B,A).
% 1.95/2.16 0 [] A=empty_set|in($f5(A),A).
% 1.95/2.16 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f6(A,B,C),C),A).
% 1.95/2.16 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.95/2.16 0 [] -relation(A)|B=relation_rng(A)|in($f8(A,B),B)|in(ordered_pair($f7(A,B),$f8(A,B)),A).
% 1.95/2.16 0 [] -relation(A)|B=relation_rng(A)| -in($f8(A,B),B)| -in(ordered_pair(X2,$f8(A,B)),A).
% 1.95/2.16 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.95/2.16 0 [] element($f9(A),A).
% 1.95/2.16 0 [] empty(empty_set).
% 1.95/2.16 0 [] relation(empty_set).
% 1.95/2.16 0 [] relation_empty_yielding(empty_set).
% 1.95/2.16 0 [] -empty(powerset(A)).
% 1.95/2.16 0 [] empty(empty_set).
% 1.95/2.16 0 [] -empty(ordered_pair(A,B)).
% 1.95/2.16 0 [] -empty(singleton(A)).
% 1.95/2.16 0 [] -empty(unordered_pair(A,B)).
% 1.95/2.16 0 [] empty(empty_set).
% 1.95/2.16 0 [] relation(empty_set).
% 1.95/2.16 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.95/2.16 0 [] -empty(A)|empty(relation_rng(A)).
% 1.95/2.16 0 [] -empty(A)|relation(relation_rng(A)).
% 1.95/2.16 0 [] relation($c1).
% 1.95/2.16 0 [] function($c1).
% 1.95/2.16 0 [] empty($c2).
% 1.95/2.16 0 [] relation($c2).
% 1.95/2.16 0 [] empty(A)|element($f10(A),powerset(A)).
% 1.95/2.16 0 [] empty(A)| -empty($f10(A)).
% 1.95/2.16 0 [] empty($c3).
% 1.95/2.16 0 [] relation($c4).
% 1.95/2.16 0 [] empty($c4).
% 1.95/2.16 0 [] function($c4).
% 1.95/2.16 0 [] -empty($c5).
% 1.95/2.16 0 [] relation($c5).
% 1.95/2.16 0 [] element($f11(A),powerset(A)).
% 1.95/2.16 0 [] empty($f11(A)).
% 1.95/2.16 0 [] -empty($c6).
% 1.95/2.16 0 [] relation($c7).
% 1.95/2.16 0 [] function($c7).
% 1.95/2.16 0 [] one_to_one($c7).
% 1.95/2.16 0 [] relation($c8).
% 1.95/2.16 0 [] relation_empty_yielding($c8).
% 1.95/2.16 0 [] subset(A,A).
% 1.95/2.16 0 [] relation($c9).
% 1.95/2.16 0 [] in($c10,relation_rng($c9))|relation_inverse_image($c9,singleton($c10))!=empty_set.
% 1.95/2.16 0 [] -in($c10,relation_rng($c9))|relation_inverse_image($c9,singleton($c10))=empty_set.
% 1.95/2.16 0 [] -in(A,B)|element(A,B).
% 1.95/2.16 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.95/2.16 0 [] -element(A,powerset(B))|subset(A,B).
% 1.95/2.16 0 [] element(A,powerset(B))| -subset(A,B).
% 1.95/2.16 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.95/2.16 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.95/2.16 0 [] -empty(A)|A=empty_set.
% 1.95/2.16 0 [] -in(A,B)| -empty(B).
% 1.95/2.16 0 [] -empty(A)|A=B| -empty(B).
% 1.95/2.16 end_of_list.
% 1.95/2.16
% 1.95/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.95/2.16
% 1.95/2.16 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.16 deletion, with positive clauses in sos and nonpositive
% 1.95/2.16 clauses in usable.
% 1.95/2.16
% 1.95/2.16 dependent: set(knuth_bendix).
% 1.95/2.16 dependent: set(anl_eq).
% 1.95/2.16 dependent: set(para_from).
% 1.95/2.16 dependent: set(para_into).
% 1.95/2.16 dependent: clear(para_from_right).
% 1.95/2.16 dependent: clear(para_into_right).
% 1.95/2.16 dependent: set(para_from_vars).
% 1.95/2.16 dependent: set(eq_units_both_ways).
% 1.95/2.16 dependent: set(dynamic_demod_all).
% 1.95/2.16 dependent: set(dynamic_demod).
% 1.95/2.16 dependent: set(order_eq).
% 1.95/2.16 dependent: set(back_demod).
% 1.95/2.16 dependent: set(lrpo).
% 1.95/2.16 dependent: set(hyper_res).
% 1.95/2.16 dependent: set(unit_deletion).
% 1.95/2.16 dependent: set(factor).
% 1.95/2.16
% 1.95/2.16 ------------> process usable:
% 1.95/2.16 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.95/2.16 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.95/2.16 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.95/2.16 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.95/2.16 ** KEPT (pick-wt=19): 5 [] -relation(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(ordered_pair(D,$f1(A,C,B,D)),A).
% 1.95/2.16 ** KEPT (pick-wt=17): 6 [] -relation(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in($f1(A,C,B,D),C).
% 1.95/2.16 ** KEPT (pick-wt=18): 7 [] -relation(A)|B!=relation_inverse_image(A,C)|in(D,B)| -in(ordered_pair(D,E),A)| -in(E,C).
% 1.95/2.16 ** KEPT (pick-wt=24): 8 [] -relation(A)|B=relation_inverse_image(A,C)|in($f3(A,C,B),B)|in(ordered_pair($f3(A,C,B),$f2(A,C,B)),A).
% 1.95/2.16 ** KEPT (pick-wt=19): 9 [] -relation(A)|B=relation_inverse_image(A,C)|in($f3(A,C,B),B)|in($f2(A,C,B),C).
% 1.95/2.16 ** KEPT (pick-wt=24): 10 [] -relation(A)|B=relation_inverse_image(A,C)| -in($f3(A,C,B),B)| -in(ordered_pair($f3(A,C,B),D),A)| -in(D,C).
% 1.95/2.16 ** KEPT (pick-wt=10): 11 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.95/2.16 ** KEPT (pick-wt=10): 12 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.95/2.16 ** KEPT (pick-wt=14): 13 [] A=singleton(B)| -in($f4(B,A),A)|$f4(B,A)!=B.
% 1.95/2.16 ** KEPT (pick-wt=6): 14 [] A!=empty_set| -in(B,A).
% 1.95/2.16 ** KEPT (pick-wt=17): 15 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f6(A,B,C),C),A).
% 1.95/2.16 ** KEPT (pick-wt=14): 16 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 1.95/2.16 ** KEPT (pick-wt=20): 17 [] -relation(A)|B=relation_rng(A)|in($f8(A,B),B)|in(ordered_pair($f7(A,B),$f8(A,B)),A).
% 1.95/2.16 ** KEPT (pick-wt=18): 18 [] -relation(A)|B=relation_rng(A)| -in($f8(A,B),B)| -in(ordered_pair(C,$f8(A,B)),A).
% 1.95/2.16 ** KEPT (pick-wt=3): 19 [] -empty(powerset(A)).
% 1.95/2.16 ** KEPT (pick-wt=4): 20 [] -empty(ordered_pair(A,B)).
% 1.95/2.16 ** KEPT (pick-wt=3): 21 [] -empty(singleton(A)).
% 1.95/2.16 ** KEPT (pick-wt=4): 22 [] -empty(unordered_pair(A,B)).
% 1.95/2.16 ** KEPT (pick-wt=7): 23 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 8.01/8.19 ** KEPT (pick-wt=5): 24 [] -empty(A)|empty(relation_rng(A)).
% 8.01/8.19 ** KEPT (pick-wt=5): 25 [] -empty(A)|relation(relation_rng(A)).
% 8.01/8.19 ** KEPT (pick-wt=5): 26 [] empty(A)| -empty($f10(A)).
% 8.01/8.19 ** KEPT (pick-wt=2): 27 [] -empty($c5).
% 8.01/8.19 ** KEPT (pick-wt=2): 28 [] -empty($c6).
% 8.01/8.19 ** KEPT (pick-wt=10): 29 [] in($c10,relation_rng($c9))|relation_inverse_image($c9,singleton($c10))!=empty_set.
% 8.01/8.19 ** KEPT (pick-wt=10): 30 [] -in($c10,relation_rng($c9))|relation_inverse_image($c9,singleton($c10))=empty_set.
% 8.01/8.19 ** KEPT (pick-wt=6): 31 [] -in(A,B)|element(A,B).
% 8.01/8.19 ** KEPT (pick-wt=8): 32 [] -element(A,B)|empty(B)|in(A,B).
% 8.01/8.19 ** KEPT (pick-wt=7): 33 [] -element(A,powerset(B))|subset(A,B).
% 8.01/8.19 ** KEPT (pick-wt=7): 34 [] element(A,powerset(B))| -subset(A,B).
% 8.01/8.19 ** KEPT (pick-wt=10): 35 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 8.01/8.19 ** KEPT (pick-wt=9): 36 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 8.01/8.19 ** KEPT (pick-wt=5): 37 [] -empty(A)|A=empty_set.
% 8.01/8.19 ** KEPT (pick-wt=5): 38 [] -in(A,B)| -empty(B).
% 8.01/8.19 ** KEPT (pick-wt=7): 39 [] -empty(A)|A=B| -empty(B).
% 8.01/8.19
% 8.01/8.19 ------------> process sos:
% 8.01/8.19 ** KEPT (pick-wt=3): 43 [] A=A.
% 8.01/8.19 ** KEPT (pick-wt=7): 44 [] unordered_pair(A,B)=unordered_pair(B,A).
% 8.01/8.19 ** KEPT (pick-wt=14): 45 [] A=singleton(B)|in($f4(B,A),A)|$f4(B,A)=B.
% 8.01/8.19 ** KEPT (pick-wt=7): 46 [] A=empty_set|in($f5(A),A).
% 8.01/8.19 ** KEPT (pick-wt=10): 48 [copy,47,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 8.01/8.19 ---> New Demodulator: 49 [new_demod,48] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 8.01/8.19 ** KEPT (pick-wt=4): 50 [] element($f9(A),A).
% 8.01/8.19 ** KEPT (pick-wt=2): 51 [] empty(empty_set).
% 8.01/8.19 ** KEPT (pick-wt=2): 52 [] relation(empty_set).
% 8.01/8.19 ** KEPT (pick-wt=2): 53 [] relation_empty_yielding(empty_set).
% 8.01/8.19 Following clause subsumed by 51 during input processing: 0 [] empty(empty_set).
% 8.01/8.19 Following clause subsumed by 51 during input processing: 0 [] empty(empty_set).
% 8.01/8.19 Following clause subsumed by 52 during input processing: 0 [] relation(empty_set).
% 8.01/8.19 ** KEPT (pick-wt=2): 54 [] relation($c1).
% 8.01/8.19 ** KEPT (pick-wt=2): 55 [] function($c1).
% 8.01/8.19 ** KEPT (pick-wt=2): 56 [] empty($c2).
% 8.01/8.19 ** KEPT (pick-wt=2): 57 [] relation($c2).
% 8.01/8.19 ** KEPT (pick-wt=7): 58 [] empty(A)|element($f10(A),powerset(A)).
% 8.01/8.19 ** KEPT (pick-wt=2): 59 [] empty($c3).
% 8.01/8.19 ** KEPT (pick-wt=2): 60 [] relation($c4).
% 8.01/8.19 ** KEPT (pick-wt=2): 61 [] empty($c4).
% 8.01/8.19 ** KEPT (pick-wt=2): 62 [] function($c4).
% 8.01/8.19 ** KEPT (pick-wt=2): 63 [] relation($c5).
% 8.01/8.19 ** KEPT (pick-wt=5): 64 [] element($f11(A),powerset(A)).
% 8.01/8.19 ** KEPT (pick-wt=3): 65 [] empty($f11(A)).
% 8.01/8.19 ** KEPT (pick-wt=2): 66 [] relation($c7).
% 8.01/8.19 ** KEPT (pick-wt=2): 67 [] function($c7).
% 8.01/8.19 ** KEPT (pick-wt=2): 68 [] one_to_one($c7).
% 8.01/8.19 ** KEPT (pick-wt=2): 69 [] relation($c8).
% 8.01/8.19 ** KEPT (pick-wt=2): 70 [] relation_empty_yielding($c8).
% 8.01/8.19 ** KEPT (pick-wt=3): 71 [] subset(A,A).
% 8.01/8.19 ** KEPT (pick-wt=2): 72 [] relation($c9).
% 8.01/8.19 Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] A=A.
% 8.01/8.19 43 back subsumes 42.
% 8.01/8.19 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 8.01/8.19 >>>> Starting back demodulation with 49.
% 8.01/8.19
% 8.01/8.19 ======= end of input processing =======
% 8.01/8.19
% 8.01/8.19 =========== start of search ===========
% 8.01/8.19
% 8.01/8.19
% 8.01/8.19 Resetting weight limit to 7.
% 8.01/8.19
% 8.01/8.19
% 8.01/8.19 Resetting weight limit to 7.
% 8.01/8.19
% 8.01/8.19 sos_size=323
% 8.01/8.19
% 8.01/8.19 Search stopped because sos empty.
% 8.01/8.19
% 8.01/8.19
% 8.01/8.19 Search stopped because sos empty.
% 8.01/8.19
% 8.01/8.19 ============ end of search ============
% 8.01/8.19
% 8.01/8.19 -------------- statistics -------------
% 8.01/8.19 clauses given 463
% 8.01/8.19 clauses generated 311773
% 8.01/8.19 clauses kept 586
% 8.01/8.19 clauses forward subsumed 1539
% 8.01/8.19 clauses back subsumed 30
% 8.01/8.19 Kbytes malloced 7812
% 8.01/8.19
% 8.01/8.19 ----------- times (seconds) -----------
% 8.01/8.19 user CPU time 6.03 (0 hr, 0 min, 6 sec)
% 8.01/8.19 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 8.01/8.19 wall-clock time 8 (0 hr, 0 min, 8 sec)
% 8.01/8.19
% 8.01/8.19 Process 5258 finished Wed Jul 27 07:48:43 2022
% 8.01/8.19 Otter interrupted
% 8.01/8.19 PROOF NOT FOUND
%------------------------------------------------------------------------------