TSTP Solution File: SET981+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET981+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:38 EDT 2022
% Result : Unknown 20.63s 20.82s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET981+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 10:43:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.77/1.98 ----- Otter 3.3f, August 2004 -----
% 1.77/1.98 The process was started by sandbox on n003.cluster.edu,
% 1.77/1.98 Wed Jul 27 10:43:26 2022
% 1.77/1.98 The command was "./otter". The process ID is 30062.
% 1.77/1.98
% 1.77/1.98 set(prolog_style_variables).
% 1.77/1.98 set(auto).
% 1.77/1.98 dependent: set(auto1).
% 1.77/1.98 dependent: set(process_input).
% 1.77/1.98 dependent: clear(print_kept).
% 1.77/1.98 dependent: clear(print_new_demod).
% 1.77/1.98 dependent: clear(print_back_demod).
% 1.77/1.98 dependent: clear(print_back_sub).
% 1.77/1.98 dependent: set(control_memory).
% 1.77/1.98 dependent: assign(max_mem, 12000).
% 1.77/1.98 dependent: assign(pick_given_ratio, 4).
% 1.77/1.98 dependent: assign(stats_level, 1).
% 1.77/1.98 dependent: assign(max_seconds, 10800).
% 1.77/1.98 clear(print_given).
% 1.77/1.98
% 1.77/1.98 formula_list(usable).
% 1.77/1.98 all A (A=A).
% 1.77/1.98 all A B (in(A,B)-> -in(B,A)).
% 1.77/1.98 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.77/1.98 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.77/1.98 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.77/1.98 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.77/1.98 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.77/1.98 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.77/1.98 all A B C (C=cartesian_product2(A,B)<-> (all D (in(D,C)<-> (exists E F (in(E,A)&in(F,B)&D=ordered_pair(E,F)))))).
% 1.77/1.98 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.77/1.98 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 1.77/1.98 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.77/1.98 empty(empty_set).
% 1.77/1.98 all A B (-empty(ordered_pair(A,B))).
% 1.77/1.98 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.77/1.98 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.77/1.98 all A B (set_union2(A,A)=A).
% 1.77/1.98 all A B (in(A,B)->subset(A,union(B))).
% 1.77/1.98 exists A empty(A).
% 1.77/1.98 exists A (-empty(A)).
% 1.77/1.98 all A B subset(A,A).
% 1.77/1.98 all A exists B all C (in(C,B)<->in(C,union(A))& (exists D (C=D& (exists E (in(E,D)&in(E,A)))))).
% 1.77/1.98 all A B C (-(in(A,cartesian_product2(B,C))& (all D E (ordered_pair(D,E)!=A)))).
% 1.77/1.98 -(all A B (subset(A,cartesian_product2(A,B))|subset(A,cartesian_product2(B,A))->A=empty_set)).
% 1.77/1.98 all A B (set_union2(A,B)=empty_set->A=empty_set).
% 1.77/1.98 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))).
% 1.77/1.98 end_of_list.
% 1.77/1.98
% 1.77/1.98 -------> usable clausifies to:
% 1.77/1.98
% 1.77/1.98 list(usable).
% 1.77/1.98 0 [] A=A.
% 1.77/1.98 0 [] -in(A,B)| -in(B,A).
% 1.77/1.98 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.77/1.98 0 [] set_union2(A,B)=set_union2(B,A).
% 1.77/1.98 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.77/1.98 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.77/1.98 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.77/1.98 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.77/1.98 0 [] A!=empty_set| -in(B,A).
% 1.77/1.98 0 [] A=empty_set|in($f2(A),A).
% 1.77/1.98 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.77/1.98 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.77/1.98 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.77/1.98 0 [] C=unordered_pair(A,B)|in($f3(A,B,C),C)|$f3(A,B,C)=A|$f3(A,B,C)=B.
% 1.77/1.98 0 [] C=unordered_pair(A,B)| -in($f3(A,B,C),C)|$f3(A,B,C)!=A.
% 1.77/1.98 0 [] C=unordered_pair(A,B)| -in($f3(A,B,C),C)|$f3(A,B,C)!=B.
% 1.77/1.98 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.77/1.98 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.77/1.98 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.77/1.98 0 [] C=set_union2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A)|in($f4(A,B,C),B).
% 1.77/1.98 0 [] C=set_union2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A).
% 1.77/1.98 0 [] C=set_union2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),B).
% 1.77/1.98 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f6(A,B,C,D),A).
% 1.77/1.98 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f5(A,B,C,D),B).
% 1.77/1.98 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f6(A,B,C,D),$f5(A,B,C,D)).
% 1.77/1.98 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 1.77/1.98 0 [] C=cartesian_product2(A,B)|in($f9(A,B,C),C)|in($f8(A,B,C),A).
% 1.77/1.98 0 [] C=cartesian_product2(A,B)|in($f9(A,B,C),C)|in($f7(A,B,C),B).
% 1.77/1.98 0 [] C=cartesian_product2(A,B)|in($f9(A,B,C),C)|$f9(A,B,C)=ordered_pair($f8(A,B,C),$f7(A,B,C)).
% 1.77/1.98 0 [] C=cartesian_product2(A,B)| -in($f9(A,B,C),C)| -in(X1,A)| -in(X2,B)|$f9(A,B,C)!=ordered_pair(X1,X2).
% 1.77/1.98 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.77/1.98 0 [] subset(A,B)|in($f10(A,B),A).
% 1.77/1.98 0 [] subset(A,B)| -in($f10(A,B),B).
% 1.77/1.98 0 [] B!=union(A)| -in(C,B)|in(C,$f11(A,B,C)).
% 1.77/1.98 0 [] B!=union(A)| -in(C,B)|in($f11(A,B,C),A).
% 1.77/1.98 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 1.77/1.98 0 [] B=union(A)|in($f13(A,B),B)|in($f13(A,B),$f12(A,B)).
% 1.77/1.98 0 [] B=union(A)|in($f13(A,B),B)|in($f12(A,B),A).
% 1.77/1.98 0 [] B=union(A)| -in($f13(A,B),B)| -in($f13(A,B),X3)| -in(X3,A).
% 1.77/1.98 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.77/1.98 0 [] empty(empty_set).
% 1.77/1.98 0 [] -empty(ordered_pair(A,B)).
% 1.77/1.98 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.77/1.98 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.77/1.98 0 [] set_union2(A,A)=A.
% 1.77/1.98 0 [] -in(A,B)|subset(A,union(B)).
% 1.77/1.98 0 [] empty($c1).
% 1.77/1.98 0 [] -empty($c2).
% 1.77/1.98 0 [] subset(A,A).
% 1.77/1.98 0 [] -in(C,$f16(A))|in(C,union(A)).
% 1.77/1.98 0 [] -in(C,$f16(A))|C=$f15(A,C).
% 1.77/1.98 0 [] -in(C,$f16(A))|in($f14(A,C),$f15(A,C)).
% 1.77/1.98 0 [] -in(C,$f16(A))|in($f14(A,C),A).
% 1.77/1.98 0 [] in(C,$f16(A))| -in(C,union(A))|C!=D| -in(E,D)| -in(E,A).
% 1.77/1.98 0 [] -in(A,cartesian_product2(B,C))|ordered_pair($f18(A,B,C),$f17(A,B,C))=A.
% 1.77/1.98 0 [] subset($c4,cartesian_product2($c4,$c3))|subset($c4,cartesian_product2($c3,$c4)).
% 1.77/1.98 0 [] $c4!=empty_set.
% 1.77/1.98 0 [] set_union2(A,B)!=empty_set|A=empty_set.
% 1.77/1.98 0 [] -in(A,B)|in($f19(A,B),B).
% 1.77/1.98 0 [] -in(A,B)| -in(D,B)| -in(D,$f19(A,B)).
% 1.77/1.98 end_of_list.
% 1.77/1.98
% 1.77/1.98 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.77/1.98
% 1.77/1.98 This ia a non-Horn set with equality. The strategy will be
% 1.77/1.98 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.98 deletion, with positive clauses in sos and nonpositive
% 1.77/1.98 clauses in usable.
% 1.77/1.98
% 1.77/1.98 dependent: set(knuth_bendix).
% 1.77/1.98 dependent: set(anl_eq).
% 1.77/1.98 dependent: set(para_from).
% 1.77/1.98 dependent: set(para_into).
% 1.77/1.98 dependent: clear(para_from_right).
% 1.77/1.98 dependent: clear(para_into_right).
% 1.77/1.98 dependent: set(para_from_vars).
% 1.77/1.98 dependent: set(eq_units_both_ways).
% 1.77/1.98 dependent: set(dynamic_demod_all).
% 1.77/1.98 dependent: set(dynamic_demod).
% 1.77/1.98 dependent: set(order_eq).
% 1.77/1.98 dependent: set(back_demod).
% 1.77/1.98 dependent: set(lrpo).
% 1.77/1.98 dependent: set(hyper_res).
% 1.77/1.98 dependent: set(unit_deletion).
% 1.77/1.98 dependent: set(factor).
% 1.77/1.98
% 1.77/1.98 ------------> process usable:
% 1.77/1.98 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.77/1.98 ** KEPT (pick-wt=10): 2 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.77/1.98 ** KEPT (pick-wt=10): 3 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.77/1.98 ** KEPT (pick-wt=14): 4 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 1.77/1.98 ** KEPT (pick-wt=6): 5 [] A!=empty_set| -in(B,A).
% 1.77/1.98 ** KEPT (pick-wt=14): 6 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 1.77/1.98 ** KEPT (pick-wt=11): 7 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 1.77/1.98 ** KEPT (pick-wt=11): 8 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 1.77/1.98 ** KEPT (pick-wt=17): 9 [] A=unordered_pair(B,C)| -in($f3(B,C,A),A)|$f3(B,C,A)!=B.
% 1.77/1.98 ** KEPT (pick-wt=17): 10 [] A=unordered_pair(B,C)| -in($f3(B,C,A),A)|$f3(B,C,A)!=C.
% 1.77/1.98 ** KEPT (pick-wt=14): 11 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.77/1.98 ** KEPT (pick-wt=11): 12 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.77/1.98 ** KEPT (pick-wt=11): 13 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.77/1.98 ** KEPT (pick-wt=17): 14 [] A=set_union2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B).
% 1.77/1.98 ** KEPT (pick-wt=17): 15 [] A=set_union2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),C).
% 1.77/1.98 ** KEPT (pick-wt=15): 16 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f6(B,C,A,D),B).
% 1.77/1.98 ** KEPT (pick-wt=15): 17 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f5(B,C,A,D),C).
% 1.77/1.98 ** KEPT (pick-wt=21): 19 [copy,18,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f6(B,C,A,D),$f5(B,C,A,D))=D.
% 1.77/1.98 ** KEPT (pick-wt=19): 20 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 1.77/1.98 ** KEPT (pick-wt=25): 21 [] A=cartesian_product2(B,C)| -in($f9(B,C,A),A)| -in(D,B)| -in(E,C)|$f9(B,C,A)!=ordered_pair(D,E).
% 1.77/1.98 ** KEPT (pick-wt=9): 22 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.77/1.98 ** KEPT (pick-wt=8): 23 [] subset(A,B)| -in($f10(A,B),B).
% 1.77/1.98 ** KEPT (pick-wt=13): 24 [] A!=union(B)| -in(C,A)|in(C,$f11(B,A,C)).
% 1.77/1.98 ** KEPT (pick-wt=13): 25 [] A!=union(B)| -in(C,A)|in($f11(B,A,C),B).
% 1.77/1.98 ** KEPT (pick-wt=13): 26 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 1.77/1.98 ** KEPT (pick-wt=17): 27 [] A=union(B)| -in($f13(B,A),A)| -in($f13(B,A),C)| -in(C,B).
% 1.77/1.98 ** KEPT (pick-wt=4): 28 [] -empty(ordered_pair(A,B)).
% 1.77/1.98 ** KEPT (pick-wt=6): 29 [] empty(A)| -empty(set_union2(A,B)).
% 1.77/1.98 ** KEPT (pick-wt=6): 30 [] empty(A)| -empty(set_union2(B,A)).
% 1.77/1.98 ** KEPT (pick-wt=7): 31 [] -in(A,B)|subset(A,union(B)).
% 1.77/1.98 ** KEPT (pick-wt=2): 32 [] -empty($c2).
% 1.77/1.98 ** KEPT (pick-wt=8): 33 [] -in(A,$f16(B))|in(A,union(B)).
% 1.77/1.98 ** KEPT (pick-wt=9): 35 [copy,34,flip.2] -in(A,$f16(B))|$f15(B,A)=A.
% 1.77/1.98 ** KEPT (pick-wt=11): 36 [] -in(A,$f16(B))|in($f14(B,A),$f15(B,A)).
% 20.63/20.82 ** KEPT (pick-wt=9): 37 [] -in(A,$f16(B))|in($f14(B,A),B).
% 20.63/20.82 ** KEPT (pick-wt=17): 38 [] in(A,$f16(B))| -in(A,union(B))|A!=C| -in(D,C)| -in(D,B).
% 20.63/20.82 ** KEPT (pick-wt=16): 39 [] -in(A,cartesian_product2(B,C))|ordered_pair($f18(A,B,C),$f17(A,B,C))=A.
% 20.63/20.82 ** KEPT (pick-wt=3): 41 [copy,40,flip.1] empty_set!=$c4.
% 20.63/20.82 ** KEPT (pick-wt=8): 42 [] set_union2(A,B)!=empty_set|A=empty_set.
% 20.63/20.82 ** KEPT (pick-wt=8): 43 [] -in(A,B)|in($f19(A,B),B).
% 20.63/20.82 ** KEPT (pick-wt=11): 44 [] -in(A,B)| -in(C,B)| -in(C,$f19(A,B)).
% 20.63/20.82
% 20.63/20.82 ------------> process sos:
% 20.63/20.82 ** KEPT (pick-wt=3): 59 [] A=A.
% 20.63/20.82 ** KEPT (pick-wt=7): 60 [] unordered_pair(A,B)=unordered_pair(B,A).
% 20.63/20.82 ** KEPT (pick-wt=7): 61 [] set_union2(A,B)=set_union2(B,A).
% 20.63/20.82 ** KEPT (pick-wt=14): 62 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 20.63/20.82 ** KEPT (pick-wt=7): 63 [] A=empty_set|in($f2(A),A).
% 20.63/20.82 ** KEPT (pick-wt=23): 64 [] A=unordered_pair(B,C)|in($f3(B,C,A),A)|$f3(B,C,A)=B|$f3(B,C,A)=C.
% 20.63/20.82 ** KEPT (pick-wt=23): 65 [] A=set_union2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B)|in($f4(B,C,A),C).
% 20.63/20.82 ** KEPT (pick-wt=17): 66 [] A=cartesian_product2(B,C)|in($f9(B,C,A),A)|in($f8(B,C,A),B).
% 20.63/20.82 ** KEPT (pick-wt=17): 67 [] A=cartesian_product2(B,C)|in($f9(B,C,A),A)|in($f7(B,C,A),C).
% 20.63/20.82 ** KEPT (pick-wt=25): 69 [copy,68,flip.3] A=cartesian_product2(B,C)|in($f9(B,C,A),A)|ordered_pair($f8(B,C,A),$f7(B,C,A))=$f9(B,C,A).
% 20.63/20.82 ** KEPT (pick-wt=8): 70 [] subset(A,B)|in($f10(A,B),A).
% 20.63/20.82 ** KEPT (pick-wt=16): 71 [] A=union(B)|in($f13(B,A),A)|in($f13(B,A),$f12(B,A)).
% 20.63/20.82 ** KEPT (pick-wt=14): 72 [] A=union(B)|in($f13(B,A),A)|in($f12(B,A),B).
% 20.63/20.82 ** KEPT (pick-wt=10): 74 [copy,73,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 20.63/20.82 ---> New Demodulator: 75 [new_demod,74] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 20.63/20.82 ** KEPT (pick-wt=2): 76 [] empty(empty_set).
% 20.63/20.82 ** KEPT (pick-wt=5): 77 [] set_union2(A,A)=A.
% 20.63/20.82 ---> New Demodulator: 78 [new_demod,77] set_union2(A,A)=A.
% 20.63/20.82 ** KEPT (pick-wt=2): 79 [] empty($c1).
% 20.63/20.82 ** KEPT (pick-wt=3): 80 [] subset(A,A).
% 20.63/20.82 ** KEPT (pick-wt=10): 81 [] subset($c4,cartesian_product2($c4,$c3))|subset($c4,cartesian_product2($c3,$c4)).
% 20.63/20.82 Following clause subsumed by 59 during input processing: 0 [copy,59,flip.1] A=A.
% 20.63/20.82 Following clause subsumed by 60 during input processing: 0 [copy,60,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 20.63/20.82 Following clause subsumed by 61 during input processing: 0 [copy,61,flip.1] set_union2(A,B)=set_union2(B,A).
% 20.63/20.82 >>>> Starting back demodulation with 75.
% 20.63/20.82 >>>> Starting back demodulation with 78.
% 20.63/20.82 >> back demodulating 47 with 78.
% 20.63/20.82
% 20.63/20.82 ======= end of input processing =======
% 20.63/20.82
% 20.63/20.82 =========== start of search ===========
% 20.63/20.82
% 20.63/20.82
% 20.63/20.82 Resetting weight limit to 8.
% 20.63/20.82
% 20.63/20.82
% 20.63/20.82 Resetting weight limit to 8.
% 20.63/20.82
% 20.63/20.82 sos_size=415
% 20.63/20.82
% 20.63/20.82 Search stopped because sos empty.
% 20.63/20.82
% 20.63/20.82
% 20.63/20.82 Search stopped because sos empty.
% 20.63/20.82
% 20.63/20.82 ============ end of search ============
% 20.63/20.82
% 20.63/20.82 -------------- statistics -------------
% 20.63/20.82 clauses given 583
% 20.63/20.82 clauses generated 1367407
% 20.63/20.82 clauses kept 652
% 20.63/20.82 clauses forward subsumed 2144
% 20.63/20.82 clauses back subsumed 13
% 20.63/20.82 Kbytes malloced 8789
% 20.63/20.82
% 20.63/20.82 ----------- times (seconds) -----------
% 20.63/20.82 user CPU time 18.84 (0 hr, 0 min, 18 sec)
% 20.63/20.82 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 20.63/20.82 wall-clock time 21 (0 hr, 0 min, 21 sec)
% 20.63/20.82
% 20.63/20.82 Process 30062 finished Wed Jul 27 10:43:47 2022
% 20.63/20.82 Otter interrupted
% 20.63/20.82 PROOF NOT FOUND
%------------------------------------------------------------------------------