TSTP Solution File: ITP004+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ITP004+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:54 EDT 2022
% Result : Unknown 12.14s 12.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ITP004+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.14 % Command : otter-tptp-script %s
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 02:43:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.85/2.05 ----- Otter 3.3f, August 2004 -----
% 1.85/2.05 The process was started by sandbox on n012.cluster.edu,
% 1.85/2.05 Wed Jul 27 02:43:36 2022
% 1.85/2.05 The command was "./otter". The process ID is 13181.
% 1.85/2.05
% 1.85/2.05 set(prolog_style_variables).
% 1.85/2.05 set(auto).
% 1.85/2.05 dependent: set(auto1).
% 1.85/2.05 dependent: set(process_input).
% 1.85/2.05 dependent: clear(print_kept).
% 1.85/2.05 dependent: clear(print_new_demod).
% 1.85/2.05 dependent: clear(print_back_demod).
% 1.85/2.05 dependent: clear(print_back_sub).
% 1.85/2.05 dependent: set(control_memory).
% 1.85/2.05 dependent: assign(max_mem, 12000).
% 1.85/2.05 dependent: assign(pick_given_ratio, 4).
% 1.85/2.05 dependent: assign(stats_level, 1).
% 1.85/2.05 dependent: assign(max_seconds, 10800).
% 1.85/2.05 clear(print_given).
% 1.85/2.05
% 1.85/2.05 formula_list(usable).
% 1.85/2.05 all A (A=A).
% 1.85/2.05 ne(bool).
% 1.85/2.05 ne(ind).
% 1.85/2.05 all A (ne(A)-> (all B (ne(B)->ne(arr(A,B))))).
% 1.85/2.05 all A B F (mem(F,arr(A,B))-> (all X (mem(X,A)->mem(ap(F,X),B)))).
% 1.85/2.05 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> ((p(Q)<->p(R))->Q=R)))).
% 1.85/2.05 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.85/2.05 all A Y X (mem(X,A)->ap(k(A,Y),X)=Y).
% 1.85/2.05 all A X (mem(X,A)->ap(i(A),X)=X).
% 1.85/2.05 mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 1.85/2.05 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> (p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))<-> (p(Q)->p(R)))))).
% 1.85/2.05 all A_27a (ne(A_27a)->mem(c_2Epred__set_2ESUBSET(A_27a),arr(arr(A_27a,bool),arr(arr(A_27a,bool),bool)))).
% 1.85/2.05 mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 1.85/2.05 all Q (mem(Q,bool)-> (p(ap(c_2Ebool_2E_7E,Q))<-> -p(Q))).
% 1.85/2.05 mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 1.85/2.05 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> (p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))<->p(Q)&p(R))))).
% 1.85/2.05 all A_27a (ne(A_27a)->mem(c_2Ebool_2EIN(A_27a),arr(A_27a,arr(arr(A_27a,bool),bool)))).
% 1.85/2.05 all A_27a (ne(A_27a)->mem(c_2Epred__set_2ECHOICE(A_27a),arr(arr(A_27a,bool),A_27a))).
% 1.85/2.05 all A_27a (ne(A_27a)->mem(c_2Epred__set_2EDELETE(A_27a),arr(arr(A_27a,bool),arr(A_27a,arr(A_27a,bool))))).
% 1.85/2.05 all A_27a (ne(A_27a)->mem(c_2Epred__set_2EREST(A_27a),arr(arr(A_27a,bool),arr(A_27a,bool)))).
% 1.85/2.05 all A_27a (ne(A_27a)->mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool)))).
% 1.85/2.05 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.85/2.05 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool))).
% 1.85/2.05 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.85/2.05 all A_27a (ne(A_27a)-> (all V0s (mem(V0s,arr(A_27a,bool))-> (all V1t (mem(V1t,arr(A_27a,bool))-> (p(ap(ap(c_2Epred__set_2ESUBSET(A_27a),V0s),V1t))<-> (all V2x (mem(V2x,A_27a)-> (p(ap(ap(c_2Ebool_2EIN(A_27a),V2x),V0s))->p(ap(ap(c_2Ebool_2EIN(A_27a),V2x),V1t))))))))))).
% 1.85/2.05 all A_27a (ne(A_27a)-> (all V0s (mem(V0s,arr(A_27a,bool))-> (all V1x (mem(V1x,A_27a)-> (all V2y (mem(V2y,A_27a)-> (p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),ap(ap(c_2Epred__set_2EDELETE(A_27a),V0s),V2y)))<->p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),V0s))&V1x!=V2y)))))))).
% 1.85/2.05 all A_27a (ne(A_27a)-> (all V0s (mem(V0s,arr(A_27a,bool))->ap(c_2Epred__set_2EREST(A_27a),V0s)=ap(ap(c_2Epred__set_2EDELETE(A_27a),V0s),ap(c_2Epred__set_2ECHOICE(A_27a),V0s))))).
% 1.85/2.05 -(all A_27a (ne(A_27a)-> (all V0s (mem(V0s,arr(A_27a,bool))->p(ap(ap(c_2Epred__set_2ESUBSET(A_27a),ap(c_2Epred__set_2EREST(A_27a),V0s)),V0s)))))).
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 -------> usable clausifies to:
% 1.85/2.05
% 1.85/2.05 list(usable).
% 1.85/2.05 0 [] A=A.
% 1.85/2.05 0 [] ne(bool).
% 1.85/2.05 0 [] ne(ind).
% 1.85/2.05 0 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 1.85/2.05 0 [] -mem(F,arr(A,B))| -mem(X,A)|mem(ap(F,X),B).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)|p(Q)|p(R)|Q=R.
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)| -p(Q)| -p(R)|Q=R.
% 1.85/2.05 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|mem($f1(A,B,F,G),A)|F=G.
% 1.85/2.05 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.85/2.05 0 [] -mem(X,A)|ap(k(A,Y),X)=Y.
% 1.85/2.05 0 [] -mem(X,A)|ap(i(A),X)=X.
% 1.85/2.05 0 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(Q)|p(R).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))|p(Q).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(R).
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Epred__set_2ESUBSET(A_27a),arr(arr(A_27a,bool),arr(arr(A_27a,bool),bool))).
% 1.85/2.05 0 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 1.85/2.05 0 [] -mem(Q,bool)| -p(ap(c_2Ebool_2E_7E,Q))| -p(Q).
% 1.85/2.05 0 [] -mem(Q,bool)|p(ap(c_2Ebool_2E_7E,Q))|p(Q).
% 1.85/2.05 0 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(Q).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(R).
% 1.85/2.05 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))| -p(Q)| -p(R).
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Ebool_2EIN(A_27a),arr(A_27a,arr(arr(A_27a,bool),bool))).
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Epred__set_2ECHOICE(A_27a),arr(arr(A_27a,bool),A_27a)).
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Epred__set_2EDELETE(A_27a),arr(arr(A_27a,bool),arr(A_27a,arr(A_27a,bool)))).
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Epred__set_2EREST(A_27a),arr(arr(A_27a,bool),arr(A_27a,bool))).
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))).
% 1.85/2.05 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)| -p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X=Y.
% 1.85/2.05 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)|p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X!=Y.
% 1.85/2.05 0 [] -ne(A_27a)|mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)).
% 1.85/2.05 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),Q))| -mem(X,A)|p(ap(Q,X)).
% 1.85/2.05 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))|mem($f2(A,Q),A).
% 1.85/2.05 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))| -p(ap(Q,$f2(A,Q))).
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1t,arr(A_27a,bool))| -p(ap(ap(c_2Epred__set_2ESUBSET(A_27a),V0s),V1t))| -mem(V2x,A_27a)| -p(ap(ap(c_2Ebool_2EIN(A_27a),V2x),V0s))|p(ap(ap(c_2Ebool_2EIN(A_27a),V2x),V1t)).
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1t,arr(A_27a,bool))|p(ap(ap(c_2Epred__set_2ESUBSET(A_27a),V0s),V1t))|mem($f3(A_27a,V0s,V1t),A_27a).
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1t,arr(A_27a,bool))|p(ap(ap(c_2Epred__set_2ESUBSET(A_27a),V0s),V1t))|p(ap(ap(c_2Ebool_2EIN(A_27a),$f3(A_27a,V0s,V1t)),V0s)).
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1t,arr(A_27a,bool))|p(ap(ap(c_2Epred__set_2ESUBSET(A_27a),V0s),V1t))| -p(ap(ap(c_2Ebool_2EIN(A_27a),$f3(A_27a,V0s,V1t)),V1t)).
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1x,A_27a)| -mem(V2y,A_27a)| -p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),ap(ap(c_2Epred__set_2EDELETE(A_27a),V0s),V2y)))|p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),V0s)).
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1x,A_27a)| -mem(V2y,A_27a)| -p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),ap(ap(c_2Epred__set_2EDELETE(A_27a),V0s),V2y)))|V1x!=V2y.
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))| -mem(V1x,A_27a)| -mem(V2y,A_27a)|p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),ap(ap(c_2Epred__set_2EDELETE(A_27a),V0s),V2y)))| -p(ap(ap(c_2Ebool_2EIN(A_27a),V1x),V0s))|V1x=V2y.
% 1.85/2.05 0 [] -ne(A_27a)| -mem(V0s,arr(A_27a,bool))|ap(c_2Epred__set_2EREST(A_27a),V0s)=ap(ap(c_2Epred__set_2EDELETE(A_27a),V0s),ap(c_2Epred__set_2ECHOICE(A_27a),V0s)).
% 1.85/2.05 0 [] ne($c2).
% 1.85/2.05 0 [] mem($c1,arr($c2,bool)).
% 1.85/2.05 0 [] -p(ap(ap(c_2Epred__set_2ESUBSET($c2),ap(c_2Epred__set_2EREST($c2),$c1)),$c1)).
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.85/2.05
% 1.85/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.85/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.85/2.05 deletion, with positive clauses in sos and nonpositive
% 1.85/2.05 clauses in usable.
% 1.85/2.05
% 1.85/2.05 dependent: set(knuth_bendix).
% 1.85/2.05 dependent: set(anl_eq).
% 1.85/2.05 dependent: set(para_from).
% 1.85/2.05 dependent: set(para_into).
% 1.85/2.05 dependent: clear(para_from_right).
% 1.85/2.05 dependent: clear(para_into_right).
% 1.85/2.05 dependent: set(para_from_vars).
% 1.85/2.05 dependent: set(eq_units_both_ways).
% 1.85/2.05 dependent: set(dynamic_demod_all).
% 1.85/2.05 dependent: set(dynamic_demod).
% 1.85/2.05 dependent: set(order_eq).
% 1.85/2.05 dependent: set(back_demod).
% 1.85/2.05 dependent: set(lrpo).
% 1.85/2.05 dependent: set(hyper_res).
% 1.85/2.05 dependent: set(unit_deletion).
% 1.85/2.05 dependent: set(factor).
% 1.85/2.05
% 1.85/2.05 ------------> process usable:
% 1.85/2.05 ** KEPT (pick-wt=8): 1 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=13): 2 [] -mem(A,arr(B,C))| -mem(D,B)|mem(ap(A,D),C).
% 1.85/2.05 ** KEPT (pick-wt=13): 3 [] -mem(A,bool)| -mem(B,bool)|p(A)|p(B)|A=B.
% 1.85/2.05 ** KEPT (pick-wt=13): 4 [] -mem(A,bool)| -mem(B,bool)| -p(A)| -p(B)|A=B.
% 1.85/2.05 ** 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.85/2.05 ** 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.85/2.05 ** KEPT (pick-wt=10): 7 [] -mem(A,B)|ap(k(B,C),A)=C.
% 1.85/2.05 ** KEPT (pick-wt=9): 8 [] -mem(A,B)|ap(i(B),A)=A.
% 1.85/2.05 ** KEPT (pick-wt=16): 9 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(A)|p(B).
% 1.85/2.05 ** KEPT (pick-wt=14): 10 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))|p(A).
% 1.85/2.05 ** KEPT (pick-wt=14): 11 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(B).
% 1.85/2.05 ** KEPT (pick-wt=14): 12 [] -ne(A)|mem(c_2Epred__set_2ESUBSET(A),arr(arr(A,bool),arr(arr(A,bool),bool))).
% 1.85/2.05 ** KEPT (pick-wt=9): 13 [] -mem(A,bool)| -p(ap(c_2Ebool_2E_7E,A))| -p(A).
% 1.85/2.05 ** KEPT (pick-wt=9): 14 [] -mem(A,bool)|p(ap(c_2Ebool_2E_7E,A))|p(A).
% 1.85/2.05 ** KEPT (pick-wt=14): 15 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(A).
% 1.85/2.05 ** KEPT (pick-wt=14): 16 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(B).
% 1.85/2.05 ** KEPT (pick-wt=16): 17 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,A),B))| -p(A)| -p(B).
% 1.85/2.05 ** KEPT (pick-wt=12): 18 [] -ne(A)|mem(c_2Ebool_2EIN(A),arr(A,arr(arr(A,bool),bool))).
% 1.85/2.05 ** KEPT (pick-wt=10): 19 [] -ne(A)|mem(c_2Epred__set_2ECHOICE(A),arr(arr(A,bool),A)).
% 1.85/2.05 ** KEPT (pick-wt=14): 20 [] -ne(A)|mem(c_2Epred__set_2EDELETE(A),arr(arr(A,bool),arr(A,arr(A,bool)))).
% 1.85/2.05 ** KEPT (pick-wt=12): 21 [] -ne(A)|mem(c_2Epred__set_2EREST(A),arr(arr(A,bool),arr(A,bool))).
% 1.85/2.05 ** KEPT (pick-wt=10): 22 [] -ne(A)|mem(c_2Emin_2E_3D(A),arr(A,arr(A,bool))).
% 1.85/2.05 ** KEPT (pick-wt=18): 23 [] -ne(A)| -mem(B,A)| -mem(C,A)| -p(ap(ap(c_2Emin_2E_3D(A),B),C))|B=C.
% 1.85/2.05 ** KEPT (pick-wt=18): 24 [] -ne(A)| -mem(B,A)| -mem(C,A)|p(ap(ap(c_2Emin_2E_3D(A),B),C))|B!=C.
% 1.85/2.05 ** KEPT (pick-wt=10): 25 [] -ne(A)|mem(c_2Ebool_2E_21(A),arr(arr(A,bool),bool)).
% 1.85/2.05 ** KEPT (pick-wt=19): 26 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),B))| -mem(C,A)|p(ap(B,C)).
% 1.85/2.05 ** KEPT (pick-wt=17): 27 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))|mem($f2(A,B),A).
% 1.85/2.05 ** KEPT (pick-wt=18): 28 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))| -p(ap(B,$f2(A,B))).
% 1.85/2.05 ** KEPT (pick-wt=36): 29 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,arr(A,bool))| -p(ap(ap(c_2Epred__set_2ESUBSET(A),B),C))| -mem(D,A)| -p(ap(ap(c_2Ebool_2EIN(A),D),B))|p(ap(ap(c_2Ebool_2EIN(A),D),C)).
% 1.85/2.05 ** KEPT (pick-wt=25): 30 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,arr(A,bool))|p(ap(ap(c_2Epred__set_2ESUBSET(A),B),C))|mem($f3(A,B,C),A).
% 1.85/2.05 ** KEPT (pick-wt=29): 31 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,arr(A,bool))|p(ap(ap(c_2Epred__set_2ESUBSET(A),B),C))|p(ap(ap(c_2Ebool_2EIN(A),$f3(A,B,C)),B)).
% 1.85/2.05 ** KEPT (pick-wt=29): 32 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,arr(A,bool))|p(ap(ap(c_2Epred__set_2ESUBSET(A),B),C))| -p(ap(ap(c_2Ebool_2EIN(A),$f3(A,B,C)),C)).
% 1.85/2.05 ** KEPT (pick-wt=32): 33 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,A)| -mem(D,A)| -p(ap(ap(c_2Ebool_2EIN(A),C),ap(ap(c_2Epred__set_2EDELETE(A),B),D)))|p(ap(ap(c_2Ebool_2EIN(A),C),B)).
% 1.85/2.05 ** KEPT (pick-wt=28): 34 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,A)| -mem(D,A)| -p(ap(ap(c_2Ebool_2EIN(A),C),ap(ap(c_2Epred__set_2EDELETE(A),B),D)))|C!=D.
% 1.85/2.05 ** KEPT (pick-wt=35): 35 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,A)| -mem(D,A)|p(ap(ap(c_2Ebool_2EIN(A),C),ap(ap(c_2Epred__set_2EDELETE(A),B),D)))| -p(ap(ap(c_2Ebool_2EIN(A),C),B))|C=D.
% 1.85/2.05 ** KEPT (pick-wt=21): 36 [] -ne(A)| -mem(B,arr(A,bool))|ap(c_2Epred__set_2EREST(A),B)=ap(ap(c_2Epred__set_2EDELETE(A),B),ap(c_2Epred__set_2ECHOICE(A),B)).
% 1.85/2.05 ** KEPT (pick-wt=10): 37 [] -p(ap(ap(c_2Epred__set_2ESUBSET($c2),ap(c_2Epred__set_2EREST($c2),$c1)),$c1)).
% 1.85/2.05
% 1.85/2.05 ------------> process sos:
% 1.85/2.05 ** KEPT (pick-wt=3): 55 [] A=A.
% 1.85/2.05 ** KEPT (pick-wt=2): 56 [] ne(bool).
% 1.85/2.05 ** KEPT (pick-wt=2): 57 [] ne(ind).
% 1.85/2.05 ** KEPT (pick-wt=7): 58 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 1.85/2.05 ** KEPT (pick-wt=5): 59 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 1.85/2.05 ** KEPT (pick-wt=7): 60 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 1.85/2.05 ** KEPT (pick-wt=2): 61 [] ne($c2).
% 1.85/2.05 ** KEPT (pick-wt=5): 62 [] mem($c1,arr($c2,bool)).
% 1.85/2.05 Following clause subsumed by 55 during input processing: 0 [copy,55,flip.1] A=A.
% 1.85/2.05 55 back subsumes 54.
% 1.85/2.05 55 back subsumes 47.
% 1.85/2.05 55 back subsumes 42.
% 1.85/2.05 55 back subsumes 41.
% 1.85/2.05 55 back subsumes 40.
% 1.85/2.05 55 back subsumes 39.
% 1.85/2.05
% 1.85/2.05 ======= end of input processing =======
% 1.85/2.05
% 1.85/2.05 =========== start of search ===========
% 12.14/12.32
% 12.14/12.32
% 12.14/12.32 Resetting weight limit to 8.
% 12.14/12.32
% 12.14/12.32
% 12.14/12.32 Resetting weight limit to 8.
% 12.14/12.32
% 12.14/12.32 sos_size=1558
% 12.14/12.32
% 12.14/12.32 Search stopped because sos empty.
% 12.14/12.32
% 12.14/12.32
% 12.14/12.32 Search stopped because sos empty.
% 12.14/12.32
% 12.14/12.32 ============ end of search ============
% 12.14/12.32
% 12.14/12.32 -------------- statistics -------------
% 12.14/12.32 clauses given 1851
% 12.14/12.32 clauses generated 818639
% 12.14/12.32 clauses kept 1906
% 12.14/12.32 clauses forward subsumed 1278
% 12.14/12.32 clauses back subsumed 10
% 12.14/12.32 Kbytes malloced 6835
% 12.14/12.32
% 12.14/12.32 ----------- times (seconds) -----------
% 12.14/12.32 user CPU time 10.28 (0 hr, 0 min, 10 sec)
% 12.14/12.32 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 12.14/12.32 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.14/12.32
% 12.14/12.32 Process 13181 finished Wed Jul 27 02:43:48 2022
% 12.14/12.32 Otter interrupted
% 12.14/12.32 PROOF NOT FOUND
%------------------------------------------------------------------------------