TSTP Solution File: ITP008+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ITP008+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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 12:58:58 EDT 2022
% Result : Unknown 23.98s 24.25s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP008+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.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 02:36:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.78/2.02 ----- Otter 3.3f, August 2004 -----
% 1.78/2.02 The process was started by sandbox on n010.cluster.edu,
% 1.78/2.02 Wed Jul 27 02:36:55 2022
% 1.78/2.02 The command was "./otter". The process ID is 3786.
% 1.78/2.02
% 1.78/2.02 set(prolog_style_variables).
% 1.78/2.02 set(auto).
% 1.78/2.02 dependent: set(auto1).
% 1.78/2.02 dependent: set(process_input).
% 1.78/2.02 dependent: clear(print_kept).
% 1.78/2.02 dependent: clear(print_new_demod).
% 1.78/2.02 dependent: clear(print_back_demod).
% 1.78/2.02 dependent: clear(print_back_sub).
% 1.78/2.02 dependent: set(control_memory).
% 1.78/2.02 dependent: assign(max_mem, 12000).
% 1.78/2.02 dependent: assign(pick_given_ratio, 4).
% 1.78/2.02 dependent: assign(stats_level, 1).
% 1.78/2.02 dependent: assign(max_seconds, 10800).
% 1.78/2.02 clear(print_given).
% 1.78/2.02
% 1.78/2.02 formula_list(usable).
% 1.78/2.02 all A (A=A).
% 1.78/2.02 ne(bool).
% 1.78/2.02 ne(ind).
% 1.78/2.02 all A (ne(A)-> (all B (ne(B)->ne(arr(A,B))))).
% 1.78/2.02 all A B F (mem(F,arr(A,B))-> (all X (mem(X,A)->mem(ap(F,X),B)))).
% 1.78/2.02 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> ((p(Q)<->p(R))->Q=R)))).
% 1.78/2.02 all A B F (mem(F,arr(A,B))-> (all G (mem(G,arr(A,B))-> ((all X (mem(X,A)->ap(F,X)=ap(G,X)))->F=G)))).
% 1.78/2.02 all A Y X (mem(X,A)->ap(k(A,Y),X)=Y).
% 1.78/2.02 all A X (mem(X,A)->ap(i(A),X)=X).
% 1.78/2.02 all A0 (ne(A0)-> (all A1 (ne(A1)->ne(ty_2Epair_2Eprod(A0,A1))))).
% 1.78/2.02 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2Epair_2E_2C(A_27a,A_27b),arr(A_27a,arr(A_27b,ty_2Epair_2Eprod(A_27a,A_27b))))))).
% 1.78/2.02 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all A_27c (ne(A_27c)->mem(c_2Epair_2ECURRY(A_27a,A_27b,A_27c),arr(arr(ty_2Epair_2Eprod(A_27a,A_27b),A_27c),arr(A_27a,arr(A_27b,A_27c))))))))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Erelation_2EWF(A_27a),arr(arr(A_27a,arr(A_27a,bool)),bool))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool)))).
% 1.78/2.02 all A (ne(A)-> (all X (mem(X,A)-> (all Y (mem(Y,A)-> (p(ap(ap(c_2Emin_2E_3D(A),X),Y))<->X=Y)))))).
% 1.78/2.02 all A0 (ne(A0)->ne(ty_2Ewellorder_2Ewellorder(A0))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Ewellorder_2Ewellorder__REP(A_27a),arr(ty_2Ewellorder_2Ewellorder(A_27a),arr(ty_2Epair_2Eprod(A_27a,A_27a),bool)))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Eset__relation_2Estrict(A_27a),arr(arr(ty_2Epair_2Eprod(A_27a,A_27a),bool),arr(ty_2Epair_2Eprod(A_27a,A_27a),bool)))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Ebool_2EIN(A_27a),arr(A_27a,arr(arr(A_27a,bool),bool)))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Ewellorder_2Ewellfounded(A_27a),arr(arr(ty_2Epair_2Eprod(A_27a,A_27a),bool),bool))).
% 1.78/2.02 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool))).
% 1.78/2.02 all A (ne(A)-> (all Q (mem(Q,arr(A,bool))-> (p(ap(c_2Ebool_2E_21(A),Q))<-> (all X (mem(X,A)->p(ap(Q,X)))))))).
% 1.78/2.02 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all V0t (mem(V0t,arr(A_27a,A_27b))->f31(A_27b,A_27a,V0t)=V0t))))).
% 1.78/2.02 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all A_27c (ne(A_27c)-> (all V0f (mem(V0f,arr(ty_2Epair_2Eprod(A_27a,A_27b),A_27c))-> (all V1x (mem(V1x,A_27a)-> (all V2y (mem(V2y,A_27b)->ap(ap(ap(c_2Epair_2ECURRY(A_27a,A_27b,A_27c),V0f),V1x),V2y)=ap(V0f,ap(ap(c_2Epair_2E_2C(A_27a,A_27b),V1x),V2y))))))))))))).
% 1.78/2.02 all A_27a (ne(A_27a)-> (all V0R (mem(V0R,arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))-> (p(ap(c_2Ewellorder_2Ewellfounded(A_27a),V0R))<->p(ap(c_2Erelation_2EWF(A_27a),ap(c_2Epair_2ECURRY(A_27a,A_27a,bool),V0R))))))).
% 1.78/2.02 all A_27a (ne(A_27a)-> (all V0w (mem(V0w,ty_2Ewellorder_2Ewellorder(A_27a))->p(ap(c_2Ewellorder_2Ewellfounded(A_27a),f1018(A_27a,V0w)))))).
% 1.78/2.02 -(all A_27a (ne(A_27a)-> (all V0w (mem(V0w,ty_2Ewellorder_2Ewellorder(A_27a))->p(ap(c_2Erelation_2EWF(A_27a),f1020(A_27a,V0w))))))).
% 1.78/2.02 end_of_list.
% 1.78/2.02
% 1.78/2.02 -------> usable clausifies to:
% 1.78/2.02
% 1.78/2.02 list(usable).
% 1.78/2.02 0 [] A=A.
% 1.78/2.02 0 [] ne(bool).
% 1.78/2.02 0 [] ne(ind).
% 1.78/2.02 0 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 1.78/2.02 0 [] -mem(F,arr(A,B))| -mem(X,A)|mem(ap(F,X),B).
% 1.78/2.02 0 [] -mem(Q,bool)| -mem(R,bool)|p(Q)|p(R)|Q=R.
% 1.78/2.02 0 [] -mem(Q,bool)| -mem(R,bool)| -p(Q)| -p(R)|Q=R.
% 1.78/2.02 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|mem($f1(A,B,F,G),A)|F=G.
% 1.78/2.02 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|ap(F,$f1(A,B,F,G))!=ap(G,$f1(A,B,F,G))|F=G.
% 1.78/2.02 0 [] -mem(X,A)|ap(k(A,Y),X)=Y.
% 1.78/2.02 0 [] -mem(X,A)|ap(i(A),X)=X.
% 1.78/2.02 0 [] -ne(A0)| -ne(A1)|ne(ty_2Epair_2Eprod(A0,A1)).
% 1.78/2.02 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2Epair_2E_2C(A_27a,A_27b),arr(A_27a,arr(A_27b,ty_2Epair_2Eprod(A_27a,A_27b)))).
% 1.78/2.02 0 [] -ne(A_27a)| -ne(A_27b)| -ne(A_27c)|mem(c_2Epair_2ECURRY(A_27a,A_27b,A_27c),arr(arr(ty_2Epair_2Eprod(A_27a,A_27b),A_27c),arr(A_27a,arr(A_27b,A_27c)))).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Erelation_2EWF(A_27a),arr(arr(A_27a,arr(A_27a,bool)),bool)).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))).
% 1.78/2.02 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)| -p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X=Y.
% 1.78/2.02 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)|p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X!=Y.
% 1.78/2.02 0 [] -ne(A0)|ne(ty_2Ewellorder_2Ewellorder(A0)).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Ewellorder_2Ewellorder__REP(A_27a),arr(ty_2Ewellorder_2Ewellorder(A_27a),arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Eset__relation_2Estrict(A_27a),arr(arr(ty_2Epair_2Eprod(A_27a,A_27a),bool),arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Ebool_2EIN(A_27a),arr(A_27a,arr(arr(A_27a,bool),bool))).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Ewellorder_2Ewellfounded(A_27a),arr(arr(ty_2Epair_2Eprod(A_27a,A_27a),bool),bool)).
% 1.78/2.02 0 [] -ne(A_27a)|mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)).
% 1.78/2.02 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),Q))| -mem(X,A)|p(ap(Q,X)).
% 1.78/2.02 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))|mem($f2(A,Q),A).
% 1.78/2.02 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))| -p(ap(Q,$f2(A,Q))).
% 1.78/2.02 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0t,arr(A_27a,A_27b))|f31(A_27b,A_27a,V0t)=V0t.
% 1.78/2.02 0 [] -ne(A_27a)| -ne(A_27b)| -ne(A_27c)| -mem(V0f,arr(ty_2Epair_2Eprod(A_27a,A_27b),A_27c))| -mem(V1x,A_27a)| -mem(V2y,A_27b)|ap(ap(ap(c_2Epair_2ECURRY(A_27a,A_27b,A_27c),V0f),V1x),V2y)=ap(V0f,ap(ap(c_2Epair_2E_2C(A_27a,A_27b),V1x),V2y)).
% 1.78/2.02 0 [] -ne(A_27a)| -mem(V0R,arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))| -p(ap(c_2Ewellorder_2Ewellfounded(A_27a),V0R))|p(ap(c_2Erelation_2EWF(A_27a),ap(c_2Epair_2ECURRY(A_27a,A_27a,bool),V0R))).
% 1.78/2.02 0 [] -ne(A_27a)| -mem(V0R,arr(ty_2Epair_2Eprod(A_27a,A_27a),bool))|p(ap(c_2Ewellorder_2Ewellfounded(A_27a),V0R))| -p(ap(c_2Erelation_2EWF(A_27a),ap(c_2Epair_2ECURRY(A_27a,A_27a,bool),V0R))).
% 1.78/2.02 0 [] -ne(A_27a)| -mem(V0w,ty_2Ewellorder_2Ewellorder(A_27a))|p(ap(c_2Ewellorder_2Ewellfounded(A_27a),f1018(A_27a,V0w))).
% 1.78/2.02 0 [] ne($c2).
% 1.78/2.02 0 [] mem($c1,ty_2Ewellorder_2Ewellorder($c2)).
% 1.78/2.02 0 [] -p(ap(c_2Erelation_2EWF($c2),f1020($c2,$c1))).
% 1.78/2.02 end_of_list.
% 1.78/2.02
% 1.78/2.02 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.78/2.02
% 1.78/2.02 This ia a non-Horn set with equality. The strategy will be
% 1.78/2.02 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.78/2.02 deletion, with positive clauses in sos and nonpositive
% 1.78/2.02 clauses in usable.
% 1.78/2.02
% 1.78/2.02 dependent: set(knuth_bendix).
% 1.78/2.02 dependent: set(anl_eq).
% 1.78/2.02 dependent: set(para_from).
% 1.78/2.02 dependent: set(para_into).
% 1.78/2.02 dependent: clear(para_from_right).
% 1.78/2.02 dependent: clear(para_into_right).
% 1.78/2.02 dependent: set(para_from_vars).
% 1.78/2.02 dependent: set(eq_units_both_ways).
% 1.78/2.02 dependent: set(dynamic_demod_all).
% 1.78/2.02 dependent: set(dynamic_demod).
% 1.78/2.02 dependent: set(order_eq).
% 1.78/2.02 dependent: set(back_demod).
% 1.78/2.02 dependent: set(lrpo).
% 1.78/2.02 dependent: set(hyper_res).
% 1.78/2.02 dependent: set(unit_deletion).
% 1.78/2.02 dependent: set(factor).
% 1.78/2.02
% 1.78/2.02 ------------> process usable:
% 1.78/2.02 ** KEPT (pick-wt=8): 1 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 1.78/2.02 ** KEPT (pick-wt=13): 2 [] -mem(A,arr(B,C))| -mem(D,B)|mem(ap(A,D),C).
% 1.78/2.02 ** KEPT (pick-wt=13): 3 [] -mem(A,bool)| -mem(B,bool)|p(A)|p(B)|A=B.
% 1.78/2.02 ** KEPT (pick-wt=13): 4 [] -mem(A,bool)| -mem(B,bool)| -p(A)| -p(B)|A=B.
% 1.78/2.02 ** KEPT (pick-wt=20): 5 [] -mem(A,arr(B,C))| -mem(D,arr(B,C))|mem($f1(B,C,A,D),B)|A=D.
% 1.78/2.02 ** KEPT (pick-wt=28): 6 [] -mem(A,arr(B,C))| -mem(D,arr(B,C))|ap(A,$f1(B,C,A,D))!=ap(D,$f1(B,C,A,D))|A=D.
% 1.78/2.02 ** KEPT (pick-wt=10): 7 [] -mem(A,B)|ap(k(B,C),A)=C.
% 1.78/2.02 ** KEPT (pick-wt=9): 8 [] -mem(A,B)|ap(i(B),A)=A.
% 1.78/2.02 ** KEPT (pick-wt=8): 9 [] -ne(A)| -ne(B)|ne(ty_2Epair_2Eprod(A,B)).
% 1.78/2.02 ** KEPT (pick-wt=15): 10 [] -ne(A)| -ne(B)|mem(c_2Epair_2E_2C(A,B),arr(A,arr(B,ty_2Epair_2Eprod(A,B)))).
% 1.78/2.02 ** KEPT (pick-wt=22): 11 [] -ne(A)| -ne(B)| -ne(C)|mem(c_2Epair_2ECURRY(A,B,C),arr(arr(ty_2Epair_2Eprod(A,B),C),arr(A,arr(B,C)))).
% 1.78/2.02 ** KEPT (pick-wt=12): 12 [] -ne(A)|mem(c_2Erelation_2EWF(A),arr(arr(A,arr(A,bool)),bool)).
% 1.78/2.02 ** KEPT (pick-wt=10): 13 [] -ne(A)|mem(c_2Emin_2E_3D(A),arr(A,arr(A,bool))).
% 1.78/2.02 ** KEPT (pick-wt=18): 14 [] -ne(A)| -mem(B,A)| -mem(C,A)| -p(ap(ap(c_2Emin_2E_3D(A),B),C))|B=C.
% 1.78/2.02 ** KEPT (pick-wt=18): 15 [] -ne(A)| -mem(B,A)| -mem(C,A)|p(ap(ap(c_2Emin_2E_3D(A),B),C))|B!=C.
% 23.98/24.25 ** KEPT (pick-wt=5): 16 [] -ne(A)|ne(ty_2Ewellorder_2Ewellorder(A)).
% 23.98/24.25 ** KEPT (pick-wt=13): 17 [] -ne(A)|mem(c_2Ewellorder_2Ewellorder__REP(A),arr(ty_2Ewellorder_2Ewellorder(A),arr(ty_2Epair_2Eprod(A,A),bool))).
% 23.98/24.25 ** KEPT (pick-wt=16): 18 [] -ne(A)|mem(c_2Eset__relation_2Estrict(A),arr(arr(ty_2Epair_2Eprod(A,A),bool),arr(ty_2Epair_2Eprod(A,A),bool))).
% 23.98/24.25 ** KEPT (pick-wt=12): 19 [] -ne(A)|mem(c_2Ebool_2EIN(A),arr(A,arr(arr(A,bool),bool))).
% 23.98/24.25 ** KEPT (pick-wt=12): 20 [] -ne(A)|mem(c_2Ewellorder_2Ewellfounded(A),arr(arr(ty_2Epair_2Eprod(A,A),bool),bool)).
% 23.98/24.25 ** KEPT (pick-wt=10): 21 [] -ne(A)|mem(c_2Ebool_2E_21(A),arr(arr(A,bool),bool)).
% 23.98/24.25 ** KEPT (pick-wt=19): 22 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),B))| -mem(C,A)|p(ap(B,C)).
% 23.98/24.25 ** KEPT (pick-wt=17): 23 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))|mem($f2(A,B),A).
% 23.98/24.25 ** KEPT (pick-wt=18): 24 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))| -p(ap(B,$f2(A,B))).
% 23.98/24.25 ** KEPT (pick-wt=15): 25 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))|f31(B,A,C)=C.
% 23.98/24.25 ** KEPT (pick-wt=39): 26 [] -ne(A)| -ne(B)| -ne(C)| -mem(D,arr(ty_2Epair_2Eprod(A,B),C))| -mem(E,A)| -mem(F,B)|ap(ap(ap(c_2Epair_2ECURRY(A,B,C),D),E),F)=ap(D,ap(ap(c_2Epair_2E_2C(A,B),E),F)).
% 23.98/24.25 ** KEPT (pick-wt=24): 27 [] -ne(A)| -mem(B,arr(ty_2Epair_2Eprod(A,A),bool))| -p(ap(c_2Ewellorder_2Ewellfounded(A),B))|p(ap(c_2Erelation_2EWF(A),ap(c_2Epair_2ECURRY(A,A,bool),B))).
% 23.98/24.25 ** KEPT (pick-wt=24): 28 [] -ne(A)| -mem(B,arr(ty_2Epair_2Eprod(A,A),bool))|p(ap(c_2Ewellorder_2Ewellfounded(A),B))| -p(ap(c_2Erelation_2EWF(A),ap(c_2Epair_2ECURRY(A,A,bool),B))).
% 23.98/24.25 ** KEPT (pick-wt=13): 29 [] -ne(A)| -mem(B,ty_2Ewellorder_2Ewellorder(A))|p(ap(c_2Ewellorder_2Ewellfounded(A),f1018(A,B))).
% 23.98/24.25 ** KEPT (pick-wt=7): 30 [] -p(ap(c_2Erelation_2EWF($c2),f1020($c2,$c1))).
% 23.98/24.25
% 23.98/24.25 ------------> process sos:
% 23.98/24.25 ** KEPT (pick-wt=3): 51 [] A=A.
% 23.98/24.25 ** KEPT (pick-wt=2): 52 [] ne(bool).
% 23.98/24.25 ** KEPT (pick-wt=2): 53 [] ne(ind).
% 23.98/24.25 ** KEPT (pick-wt=2): 54 [] ne($c2).
% 23.98/24.25 ** KEPT (pick-wt=4): 55 [] mem($c1,ty_2Ewellorder_2Ewellorder($c2)).
% 23.98/24.25 Following clause subsumed by 51 during input processing: 0 [copy,51,flip.1] A=A.
% 23.98/24.25 51 back subsumes 41.
% 23.98/24.25 51 back subsumes 35.
% 23.98/24.25 51 back subsumes 34.
% 23.98/24.25 51 back subsumes 33.
% 23.98/24.25 51 back subsumes 32.
% 23.98/24.25
% 23.98/24.25 ======= end of input processing =======
% 23.98/24.25
% 23.98/24.25 =========== start of search ===========
% 23.98/24.25
% 23.98/24.25
% 23.98/24.25 Resetting weight limit to 5.
% 23.98/24.25
% 23.98/24.25
% 23.98/24.25 Resetting weight limit to 5.
% 23.98/24.25
% 23.98/24.25 sos_size=932
% 23.98/24.25
% 23.98/24.25 Search stopped because sos empty.
% 23.98/24.25
% 23.98/24.25
% 23.98/24.25 Search stopped because sos empty.
% 23.98/24.25
% 23.98/24.25 ============ end of search ============
% 23.98/24.25
% 23.98/24.25 -------------- statistics -------------
% 23.98/24.25 clauses given 963
% 23.98/24.25 clauses generated 4220232
% 23.98/24.25 clauses kept 1013
% 23.98/24.25 clauses forward subsumed 675
% 23.98/24.25 clauses back subsumed 5
% 23.98/24.25 Kbytes malloced 6835
% 23.98/24.25
% 23.98/24.25 ----------- times (seconds) -----------
% 23.98/24.25 user CPU time 22.23 (0 hr, 0 min, 22 sec)
% 23.98/24.25 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 23.98/24.25 wall-clock time 24 (0 hr, 0 min, 24 sec)
% 23.98/24.25
% 23.98/24.25 Process 3786 finished Wed Jul 27 02:37:19 2022
% 23.98/24.25 Otter interrupted
% 23.98/24.25 PROOF NOT FOUND
%------------------------------------------------------------------------------