TSTP Solution File: ITP006+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ITP006+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:56 EDT 2022
% Result : Unknown 2.59s 2.72s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 02:42:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.30/2.49 ----- Otter 3.3f, August 2004 -----
% 2.30/2.49 The process was started by sandbox2 on n012.cluster.edu,
% 2.30/2.49 Wed Jul 27 02:42:21 2022
% 2.30/2.49 The command was "./otter". The process ID is 6397.
% 2.30/2.49
% 2.30/2.49 set(prolog_style_variables).
% 2.30/2.49 set(auto).
% 2.30/2.49 dependent: set(auto1).
% 2.30/2.49 dependent: set(process_input).
% 2.30/2.49 dependent: clear(print_kept).
% 2.30/2.49 dependent: clear(print_new_demod).
% 2.30/2.49 dependent: clear(print_back_demod).
% 2.30/2.49 dependent: clear(print_back_sub).
% 2.30/2.49 dependent: set(control_memory).
% 2.30/2.49 dependent: assign(max_mem, 12000).
% 2.30/2.49 dependent: assign(pick_given_ratio, 4).
% 2.30/2.49 dependent: assign(stats_level, 1).
% 2.30/2.49 dependent: assign(max_seconds, 10800).
% 2.30/2.49 clear(print_given).
% 2.30/2.49
% 2.30/2.49 formula_list(usable).
% 2.30/2.49 all A (A=A).
% 2.30/2.49 ne(bool).
% 2.30/2.49 ne(ind).
% 2.30/2.49 all A (ne(A)-> (all B (ne(B)->ne(arr(A,B))))).
% 2.30/2.49 all A B F (mem(F,arr(A,B))-> (all X (mem(X,A)->mem(ap(F,X),B)))).
% 2.30/2.49 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> ((p(Q)<->p(R))->Q=R)))).
% 2.30/2.49 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)))).
% 2.30/2.49 all A Y X (mem(X,A)->ap(k(A,Y),X)=Y).
% 2.30/2.49 all A X (mem(X,A)->ap(i(A),X)=X).
% 2.30/2.49 mem(c_2Ebool_2ET,bool).
% 2.30/2.49 p(c_2Ebool_2ET).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool)))))).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool)))))).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool)))))).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool)))))).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool)))))).
% 2.30/2.49 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_3F(A_27a),arr(arr(A_27a,bool),bool))).
% 2.30/2.49 all A (ne(A)-> (all Q (mem(Q,arr(A,bool))-> (p(ap(c_2Ebool_2E_3F(A),Q))<-> (exists X (mem(X,A)&p(ap(Q,X)))))))).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool)))))).
% 2.30/2.49 mem(c_2Ebool_2EF,bool).
% 2.30/2.49 -p(c_2Ebool_2EF).
% 2.30/2.49 mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.30/2.49 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> (p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))<->p(Q)|p(R))))).
% 2.30/2.49 mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.30/2.49 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> (p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))<->p(Q)&p(R))))).
% 2.30/2.49 all A_27a (ne(A_27a)->mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool)))).
% 2.30/2.49 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)))))).
% 2.30/2.49 mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.30/2.49 all Q (mem(Q,bool)-> (p(ap(c_2Ebool_2E_7E,Q))<-> -p(Q))).
% 2.30/2.49 mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.30/2.49 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)))))).
% 2.30/2.49 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool))).
% 2.30/2.49 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)))))))).
% 2.30/2.49 $T.
% 2.30/2.49 all V0t (mem(V0t,bool)-> (p(V0t)<->p(V0t))& ((p(V0t)->$T)<->$T)& (($F->p(V0t))<->$T)& ((p(V0t)->p(V0t))<->$T)& (-p(V0t)<-> -p(V0t))).
% 2.30/2.49 all V0t (mem(V0t,bool)-> (-(-p(V0t))<->p(V0t))).
% 2.30/2.49 -$T<->$F.
% 2.30/2.49 -$F<->$T.
% 2.30/2.49 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)-> (all V1y (mem(V1y,A_27a)-> (V0x=V1y<->V1y=V0x)))))).
% 2.30/2.49 all V0t (mem(V0t,bool)-> (($T<->p(V0t))<->p(V0t))& ((p(V0t)<->$T)<->p(V0t))& (($F<->p(V0t))<-> -p(V0t))& ((p(V0t)<->$F)<-> -p(V0t))).
% 2.30/2.49 all V0t1 (mem(V0t1,bool)-> (all V1t2 (mem(V1t2,bool)-> (all V2t3 (mem(V2t3,bool)-> ((p(V0t1)-> (p(V1t2)->p(V2t3)))<-> (p(V0t1)&p(V1t2)->p(V2t3)))))))).
% 2.30/2.49 all V0x (mem(V0x,bool)-> (all V1x_27 (mem(V1x_27,bool)-> (all V2y (mem(V2y,bool)-> (all V3y_27 (mem(V3y_27,bool)-> ((p(V0x)<->p(V1x_27))& (p(V1x_27)-> (p(V2y)<->p(V3y_27)))-> ((p(V0x)->p(V2y))<-> (p(V1x_27)->p(V3y_27))))))))))).
% 2.30/2.49 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all V0i (mem(V0i,arr(A_27a,A_27b))-> (all V1P (mem(V1P,arr(A_27b,bool))-> (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P))<-> (all V2v (mem(V2v,A_27b)-> (p(ap(V1P,V2v))-> (exists V3fv (mem(V3fv,A_27a)&p(ap(V1P,ap(V0i,V3fv)))))))))& (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))<-> (all V4v (mem(V4v,A_27b)-> (-p(ap(V1P,V4v))-> (exists V5fv (mem(V5fv,A_27a)& -p(ap(V1P,ap(V0i,V5fv)))))))))& (all V6i (mem(V6i,arr(A_27a,A_27b))-> (all V7P (mem(V7P,arr(A_27b,bool))-> (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),V6i),V7P))<-> (all V8fv (mem(V8fv,A_27a)->p(ap(V7P,ap(V6i,V8fv))))))))))& (all V9i (mem(V9i,arr(A_27a,A_27b))-> (all V10P (mem(V10P,arr(A_27b,bool))-> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),V9i),V10P))<-> (all V11fv (mem(V11fv,A_27a)-> -p(ap(V10P,ap(V9i,V11fv))))))))))& (all V12i (mem(V12i,arr(A_27a,A_27b))-> (all V13P (mem(V13P,arr(A_27b,bool))-> (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))<-> (all V14v (mem(V14v,A_27b)-> (p(ap(V13P,V14v))-> (exists V15fv (mem(V15fv,A_27a)&V14v=ap(V12i,V15fv)))))))))))& (all V16i (mem(V16i,arr(A_27a,A_27b))-> (all V17P (mem(V17P,arr(A_27b,bool))-> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))<-> (all V18v (mem(V18v,A_27b)-> (-p(ap(V17P,V18v))-> (exists V19fv (mem(V19fv,A_27a)&V18v=ap(V16i,V19fv)))))))))))))))))).
% 2.30/2.49 all V0t (mem(V0t,bool)-> (-(-p(V0t))<->p(V0t))).
% 2.30/2.49 all V0A (mem(V0A,bool)-> (p(V0A)-> -(-p(V0A)))).
% 2.30/2.49 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(-(p(V0A)|p(V1B)))<-> (-p(V0A)-> -(-p(V1B))))))).
% 2.30/2.49 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(-(-p(V0A)|p(V1B)))<-> (p(V0A)-> -(-p(V1B))))))).
% 2.30/2.49 all V0A (mem(V0A,bool)-> (-(-p(V0A))-> -(-p(V0A)))).
% 2.30/2.49 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> (all V2r (mem(V2r,bool)-> ((p(V0p)<-> (p(V1q)<->p(V2r)))<-> (p(V0p)|p(V1q)|p(V2r))& (p(V0p)| -p(V2r)| -p(V1q))& (p(V1q)| -p(V2r)| -p(V0p))& (p(V2r)| -p(V1q)| -p(V0p)))))))).
% 2.30/2.49 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> (all V2r (mem(V2r,bool)-> ((p(V0p)<->p(V1q)|p(V2r))<-> (p(V0p)| -p(V1q))& (p(V0p)| -p(V2r))& (p(V1q)|p(V2r)| -p(V0p)))))))).
% 2.30/2.49 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> (all V2r (mem(V2r,bool)-> ((p(V0p)<-> (p(V1q)->p(V2r)))<-> (p(V0p)|p(V1q))& (p(V0p)| -p(V2r))& (-p(V1q)|p(V2r)| -p(V0p)))))))).
% 2.30/2.49 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> ((p(V0p)<-> -p(V1q))<-> (p(V0p)|p(V1q))& (-p(V1q)| -p(V0p)))))).
% 2.30/2.49 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> (-(p(V0p)->p(V1q))->p(V0p))))).
% 2.30/2.49 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> (-(p(V0p)->p(V1q))-> -p(V1q))))).
% 2.30/2.49 -(all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all V0i (mem(V0i,arr(A_27b,A_27a))-> (all V1P (mem(V1P,arr(A_27a,bool))-> (all V2Q (mem(V2Q,arr(A_27a,bool))-> ((all V3x (mem(V3x,A_27a)-> (p(ap(V2Q,V3x))->p(ap(V1P,V3x)))))-> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27b,A_27a),V0i),V1P))->p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27b,A_27a),V0i),V2Q)))))))))))))).
% 2.30/2.49 end_of_list.
% 2.30/2.49
% 2.30/2.49 -------> usable clausifies to:
% 2.30/2.49
% 2.30/2.49 list(usable).
% 2.30/2.49 0 [] A=A.
% 2.30/2.49 0 [] ne(bool).
% 2.30/2.49 0 [] ne(ind).
% 2.30/2.49 0 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.30/2.49 0 [] -mem(F,arr(A,B))| -mem(X,A)|mem(ap(F,X),B).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)|p(Q)|p(R)|Q=R.
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)| -p(Q)| -p(R)|Q=R.
% 2.30/2.49 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|mem($f1(A,B,F,G),A)|F=G.
% 2.30/2.49 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.
% 2.30/2.49 0 [] -mem(X,A)|ap(k(A,Y),X)=Y.
% 2.30/2.49 0 [] -mem(X,A)|ap(i(A),X)=X.
% 2.30/2.49 0 [] mem(c_2Ebool_2ET,bool).
% 2.30/2.49 0 [] p(c_2Ebool_2ET).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))).
% 2.30/2.49 0 [] -ne(A_27a)|mem(c_2Ebool_2E_3F(A_27a),arr(arr(A_27a,bool),bool)).
% 2.30/2.49 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),Q))|mem($f2(A,Q),A).
% 2.30/2.49 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),Q))|p(ap(Q,$f2(A,Q))).
% 2.30/2.49 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_3F(A),Q))| -mem(X,A)| -p(ap(Q,X)).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))).
% 2.30/2.49 0 [] mem(c_2Ebool_2EF,bool).
% 2.30/2.49 0 [] -p(c_2Ebool_2EF).
% 2.30/2.49 0 [] mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))|p(Q)|p(R).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))| -p(Q).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))| -p(R).
% 2.30/2.49 0 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(Q).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(R).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))| -p(Q)| -p(R).
% 2.30/2.49 0 [] -ne(A_27a)|mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))).
% 2.30/2.49 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)| -p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X=Y.
% 2.30/2.49 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)|p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X!=Y.
% 2.30/2.49 0 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.30/2.49 0 [] -mem(Q,bool)| -p(ap(c_2Ebool_2E_7E,Q))| -p(Q).
% 2.30/2.49 0 [] -mem(Q,bool)|p(ap(c_2Ebool_2E_7E,Q))|p(Q).
% 2.30/2.49 0 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(Q)|p(R).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))|p(Q).
% 2.30/2.49 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(R).
% 2.30/2.49 0 [] -ne(A_27a)|mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)).
% 2.30/2.49 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),Q))| -mem(X,A)|p(ap(Q,X)).
% 2.30/2.49 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))|mem($f3(A,Q),A).
% 2.30/2.49 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))| -p(ap(Q,$f3(A,Q))).
% 2.30/2.49 0 [] $T.
% 2.30/2.49 0 [] -mem(V0t,bool)| -$F|p(V0t)| -$T.
% 2.30/2.49 0 [] -mem(V0t,bool)|$T.
% 2.30/2.49 0 [] $T|$F.
% 2.30/2.49 0 [] -$T| -$F.
% 2.30/2.49 0 [] $F|$T.
% 2.30/2.49 0 [] -$F| -$T.
% 2.30/2.49 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -mem(V1y,A_27a)|V0x!=V1y|V1y=V0x.
% 2.30/2.49 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -mem(V1y,A_27a)|V0x=V1y|V1y!=V0x.
% 2.30/2.49 0 [] -mem(V0t,bool)|$T|p(V0t).
% 2.30/2.49 0 [] -mem(V0t,bool)|$T| -p(V0t).
% 2.30/2.49 0 [] -mem(V0t,bool)| -$F| -p(V0t).
% 2.30/2.49 0 [] -mem(V0t,bool)| -$F|p(V0t).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P))| -mem(V2v,A_27b)| -p(ap(V1P,V2v))|mem($f4(A_27a,A_27b,V0i,V1P,V2v),A_27a).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P))| -mem(V2v,A_27b)| -p(ap(V1P,V2v))|p(ap(V1P,ap(V0i,$f4(A_27a,A_27b,V0i,V1P,V2v)))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P))|mem($f5(A_27a,A_27b,V0i,V1P),A_27b).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P))|p(ap(V1P,$f5(A_27a,A_27b,V0i,V1P))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P))| -mem(V3fv,A_27a)| -p(ap(V1P,ap(V0i,V3fv))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))| -mem(V4v,A_27b)|p(ap(V1P,V4v))|mem($f6(A_27a,A_27b,V0i,V1P,V4v),A_27a).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))| -mem(V4v,A_27b)|p(ap(V1P,V4v))| -p(ap(V1P,ap(V0i,$f6(A_27a,A_27b,V0i,V1P,V4v)))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))|mem($f7(A_27a,A_27b,V0i,V1P),A_27b).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))| -p(ap(V1P,$f7(A_27a,A_27b,V0i,V1P))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))| -mem(V5fv,A_27a)|p(ap(V1P,ap(V0i,V5fv))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V6i,arr(A_27a,A_27b))| -mem(V7P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),V6i),V7P))| -mem(V8fv,A_27a)|p(ap(V7P,ap(V6i,V8fv))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V6i,arr(A_27a,A_27b))| -mem(V7P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),V6i),V7P))|mem($f8(A_27a,A_27b,V0i,V1P,V6i,V7P),A_27a).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V6i,arr(A_27a,A_27b))| -mem(V7P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),V6i),V7P))| -p(ap(V7P,ap(V6i,$f8(A_27a,A_27b,V0i,V1P,V6i,V7P)))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V9i,arr(A_27a,A_27b))| -mem(V10P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),V9i),V10P))| -mem(V11fv,A_27a)| -p(ap(V10P,ap(V9i,V11fv))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V9i,arr(A_27a,A_27b))| -mem(V10P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),V9i),V10P))|mem($f9(A_27a,A_27b,V0i,V1P,V9i,V10P),A_27a).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V9i,arr(A_27a,A_27b))| -mem(V10P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),V9i),V10P))|p(ap(V10P,ap(V9i,$f9(A_27a,A_27b,V0i,V1P,V9i,V10P)))).
% 2.30/2.49 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V12i,arr(A_27a,A_27b))| -mem(V13P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))| -mem(V14v,A_27b)| -p(ap(V13P,V14v))|mem($f10(A_27a,A_27b,V0i,V1P,V12i,V13P,V14v),A_27a).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V12i,arr(A_27a,A_27b))| -mem(V13P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))| -mem(V14v,A_27b)| -p(ap(V13P,V14v))|V14v=ap(V12i,$f10(A_27a,A_27b,V0i,V1P,V12i,V13P,V14v)).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V12i,arr(A_27a,A_27b))| -mem(V13P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))|mem($f11(A_27a,A_27b,V0i,V1P,V12i,V13P),A_27b).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V12i,arr(A_27a,A_27b))| -mem(V13P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))|p(ap(V13P,$f11(A_27a,A_27b,V0i,V1P,V12i,V13P))).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V12i,arr(A_27a,A_27b))| -mem(V13P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))| -mem(V15fv,A_27a)|$f11(A_27a,A_27b,V0i,V1P,V12i,V13P)!=ap(V12i,V15fv).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V16i,arr(A_27a,A_27b))| -mem(V17P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))| -mem(V18v,A_27b)|p(ap(V17P,V18v))|mem($f12(A_27a,A_27b,V0i,V1P,V16i,V17P,V18v),A_27a).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V16i,arr(A_27a,A_27b))| -mem(V17P,arr(A_27b,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))| -mem(V18v,A_27b)|p(ap(V17P,V18v))|V18v=ap(V16i,$f12(A_27a,A_27b,V0i,V1P,V16i,V17P,V18v)).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V16i,arr(A_27a,A_27b))| -mem(V17P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))|mem($f13(A_27a,A_27b,V0i,V1P,V16i,V17P),A_27b).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V16i,arr(A_27a,A_27b))| -mem(V17P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))| -p(ap(V17P,$f13(A_27a,A_27b,V0i,V1P,V16i,V17P))).
% 2.30/2.50 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0i,arr(A_27a,A_27b))| -mem(V1P,arr(A_27b,bool))| -mem(V16i,arr(A_27a,A_27b))| -mem(V17P,arr(A_27b,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))| -mem(V19fv,A_27a)|$f13(A_27a,A_27b,V0i,V1P,V16i,V17P)!=ap(V16i,V19fv).
% 2.30/2.50 0 [] ne($c5).
% 2.30/2.50 0 [] ne($c4).
% 2.30/2.50 0 [] mem($c3,arr($c4,$c5)).
% 2.30/2.50 0 [] mem($c2,arr($c5,bool)).
% 2.30/2.50 0 [] mem($c1,arr($c5,bool)).
% 2.30/2.50 0 [] -mem(V3x,$c5)| -p(ap($c1,V3x))|p(ap($c2,V3x)).
% 2.30/2.50 0 [] p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT($c4,$c5),$c3),$c2)).
% 2.30/2.50 0 [] -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT($c4,$c5),$c3),$c1)).
% 2.30/2.50 end_of_list.
% 2.30/2.50
% 2.30/2.50 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 2.30/2.50
% 2.30/2.50 This ia a non-Horn set with equality. The strategy will be
% 2.30/2.50 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.30/2.50 deletion, with positive clauses in sos and nonpositive
% 2.30/2.50 clauses in usable.
% 2.30/2.50
% 2.30/2.50 dependent: set(knuth_bendix).
% 2.30/2.50 dependent: set(anl_eq).
% 2.30/2.50 dependent: set(para_from).
% 2.30/2.50 dependent: set(para_into).
% 2.30/2.50 dependent: clear(para_from_right).
% 2.30/2.50 dependent: clear(para_into_right).
% 2.30/2.50 dependent: set(para_from_vars).
% 2.30/2.50 dependent: set(eq_units_both_ways).
% 2.30/2.50 dependent: set(dynamic_demod_all).
% 2.30/2.50 dependent: set(dynamic_demod).
% 2.30/2.50 dependent: set(order_eq).
% 2.30/2.50 dependent: set(back_demod).
% 2.30/2.50 dependent: set(lrpo).
% 2.30/2.50 dependent: set(hyper_res).
% 2.30/2.50 dependent: set(unit_deletion).
% 2.30/2.50 dependent: set(factor).
% 2.30/2.50
% 2.30/2.50 ------------> process usable:
% 2.30/2.50 ** KEPT (pick-wt=8): 1 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.30/2.50 ** KEPT (pick-wt=13): 2 [] -mem(A,arr(B,C))| -mem(D,B)|mem(ap(A,D),C).
% 2.30/2.50 ** KEPT (pick-wt=13): 3 [] -mem(A,bool)| -mem(B,bool)|p(A)|p(B)|A=B.
% 2.30/2.50 ** KEPT (pick-wt=13): 4 [] -mem(A,bool)| -mem(B,bool)| -p(A)| -p(B)|A=B.
% 2.30/2.50 ** KEPT (pick-wt=20): 5 [] -mem(A,arr(B,C))| -mem(D,arr(B,C))|mem($f1(B,C,A,D),B)|A=D.
% 2.30/2.50 ** 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.
% 2.30/2.50 ** KEPT (pick-wt=10): 7 [] -mem(A,B)|ap(k(B,C),A)=C.
% 2.30/2.50 ** KEPT (pick-wt=9): 8 [] -mem(A,B)|ap(i(B),A)=A.
% 2.30/2.50 ** KEPT (pick-wt=17): 9 [] -ne(A)| -ne(B)|mem(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A,B),arr(arr(A,B),arr(arr(B,bool),bool))).
% 2.30/2.50 ** KEPT (pick-wt=17): 10 [] -ne(A)| -ne(B)|mem(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A,B),arr(arr(A,B),arr(arr(B,bool),bool))).
% 2.30/2.50 ** KEPT (pick-wt=17): 11 [] -ne(A)| -ne(B)|mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A,B),arr(arr(A,B),arr(arr(B,bool),bool))).
% 2.30/2.50 ** KEPT (pick-wt=17): 12 [] -ne(A)| -ne(B)|mem(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A,B),arr(arr(A,B),arr(arr(B,bool),bool))).
% 2.30/2.50 ** KEPT (pick-wt=17): 13 [] -ne(A)| -ne(B)|mem(c_2EquantHeuristics_2EGUESS__FORALL(A,B),arr(arr(A,B),arr(arr(B,bool),bool))).
% 2.30/2.50 ** KEPT (pick-wt=10): 14 [] -ne(A)|mem(c_2Ebool_2E_3F(A),arr(arr(A,bool),bool)).
% 2.30/2.50 ** KEPT (pick-wt=17): 15 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),B))|mem($f2(A,B),A).
% 2.30/2.50 ** KEPT (pick-wt=18): 16 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),B))|p(ap(B,$f2(A,B))).
% 2.30/2.50 ** KEPT (pick-wt=19): 17 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_3F(A),B))| -mem(C,A)| -p(ap(B,C)).
% 2.30/2.50 ** KEPT (pick-wt=17): 18 [] -ne(A)| -ne(B)|mem(c_2EquantHeuristics_2EGUESS__EXISTS(A,B),arr(arr(A,B),arr(arr(B,bool),bool))).
% 2.30/2.50 ** KEPT (pick-wt=2): 19 [] -p(c_2Ebool_2EF).
% 2.30/2.50 ** KEPT (pick-wt=16): 20 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_5C_2F,A),B))|p(A)|p(B).
% 2.30/2.50 ** KEPT (pick-wt=14): 21 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,A),B))| -p(A).
% 2.30/2.50 ** KEPT (pick-wt=14): 22 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,A),B))| -p(B).
% 2.30/2.50 ** KEPT (pick-wt=14): 23 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(A).
% 2.52/2.68 ** KEPT (pick-wt=14): 24 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(B).
% 2.52/2.68 ** KEPT (pick-wt=16): 25 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,A),B))| -p(A)| -p(B).
% 2.52/2.68 ** KEPT (pick-wt=10): 26 [] -ne(A)|mem(c_2Emin_2E_3D(A),arr(A,arr(A,bool))).
% 2.52/2.68 ** KEPT (pick-wt=18): 27 [] -ne(A)| -mem(B,A)| -mem(C,A)| -p(ap(ap(c_2Emin_2E_3D(A),B),C))|B=C.
% 2.52/2.68 ** KEPT (pick-wt=18): 28 [] -ne(A)| -mem(B,A)| -mem(C,A)|p(ap(ap(c_2Emin_2E_3D(A),B),C))|B!=C.
% 2.52/2.68 ** KEPT (pick-wt=9): 29 [] -mem(A,bool)| -p(ap(c_2Ebool_2E_7E,A))| -p(A).
% 2.52/2.68 ** KEPT (pick-wt=9): 30 [] -mem(A,bool)|p(ap(c_2Ebool_2E_7E,A))|p(A).
% 2.52/2.68 ** KEPT (pick-wt=16): 31 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(A)|p(B).
% 2.52/2.68 ** KEPT (pick-wt=14): 32 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))|p(A).
% 2.52/2.68 ** KEPT (pick-wt=14): 33 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(B).
% 2.52/2.68 ** KEPT (pick-wt=10): 34 [] -ne(A)|mem(c_2Ebool_2E_21(A),arr(arr(A,bool),bool)).
% 2.52/2.68 ** KEPT (pick-wt=19): 35 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),B))| -mem(C,A)|p(ap(B,C)).
% 2.52/2.68 ** KEPT (pick-wt=17): 36 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))|mem($f3(A,B),A).
% 2.52/2.68 ** KEPT (pick-wt=18): 37 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))| -p(ap(B,$f3(A,B))).
% 2.52/2.68 ** KEPT (pick-wt=14): 38 [] -ne(A)| -mem(B,A)| -mem(C,A)|B!=C|C=B.
% 2.52/2.68 Following clause subsumed by 38 during input processing: 0 [] -ne(A)| -mem(B,A)| -mem(C,A)|B=C|C!=B.
% 2.52/2.68 ** KEPT (pick-wt=37): 39 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A,B),C),D))| -mem(E,B)| -p(ap(D,E))|mem($f4(A,B,C,D,E),A).
% 2.52/2.68 ** KEPT (pick-wt=40): 40 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A,B),C),D))| -mem(E,B)| -p(ap(D,E))|p(ap(D,ap(C,$f4(A,B,C,D,E)))).
% 2.52/2.68 ** KEPT (pick-wt=29): 41 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A,B),C),D))|mem($f5(A,B,C,D),B).
% 2.52/2.68 ** KEPT (pick-wt=30): 42 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A,B),C),D))|p(ap(D,$f5(A,B,C,D))).
% 2.52/2.68 ** KEPT (pick-wt=31): 43 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A,B),C),D))| -mem(E,A)| -p(ap(D,ap(C,E))).
% 2.52/2.68 ** KEPT (pick-wt=37): 44 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A,B),C),D))| -mem(E,B)|p(ap(D,E))|mem($f6(A,B,C,D,E),A).
% 2.52/2.68 ** KEPT (pick-wt=40): 45 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A,B),C),D))| -mem(E,B)|p(ap(D,E))| -p(ap(D,ap(C,$f6(A,B,C,D,E)))).
% 2.52/2.68 ** KEPT (pick-wt=29): 46 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A,B),C),D))|mem($f7(A,B,C,D),B).
% 2.52/2.68 ** KEPT (pick-wt=30): 47 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A,B),C),D))| -p(ap(D,$f7(A,B,C,D))).
% 2.52/2.68 ** KEPT (pick-wt=31): 48 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A,B),C),D))| -mem(E,A)|p(ap(D,ap(C,E))).
% 2.52/2.68 ** KEPT (pick-wt=31): 50 [copy,49,factor_simp,factor_simp] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A,B),C),D))| -mem(E,A)|p(ap(D,ap(C,E))).
% 2.52/2.68 ** KEPT (pick-wt=41): 51 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A,B),E),F))|mem($f8(A,B,C,D,E,F),A).
% 2.52/2.68 ** KEPT (pick-wt=44): 52 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A,B),E),F))| -p(ap(F,ap(E,$f8(A,B,C,D,E,F)))).
% 2.52/2.68 ** KEPT (pick-wt=31): 54 [copy,53,factor_simp,factor_simp] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A,B),C),D))| -mem(E,A)| -p(ap(D,ap(C,E))).
% 2.52/2.68 ** KEPT (pick-wt=41): 55 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A,B),E),F))|mem($f9(A,B,C,D,E,F),A).
% 2.55/2.72 ** KEPT (pick-wt=44): 56 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A,B),E),F))|p(ap(F,ap(E,$f9(A,B,C,D,E,F)))).
% 2.55/2.72 ** KEPT (pick-wt=49): 57 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A,B),E),F))| -mem(G,B)| -p(ap(F,G))|mem($f10(A,B,C,D,E,F,G),A).
% 2.55/2.72 ** KEPT (pick-wt=51): 59 [copy,58,flip.10] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A,B),E),F))| -mem(G,B)| -p(ap(F,G))|ap(E,$f10(A,B,C,D,E,F,G))=G.
% 2.55/2.72 ** KEPT (pick-wt=41): 60 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A,B),E),F))|mem($f11(A,B,C,D,E,F),B).
% 2.55/2.72 ** KEPT (pick-wt=42): 61 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A,B),E),F))|p(ap(F,$f11(A,B,C,D,E,F))).
% 2.55/2.72 ** KEPT (pick-wt=46): 62 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A,B),E),F))| -mem(G,A)|$f11(A,B,C,D,E,F)!=ap(E,G).
% 2.55/2.72 ** KEPT (pick-wt=49): 63 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A,B),E),F))| -mem(G,B)|p(ap(F,G))|mem($f12(A,B,C,D,E,F,G),A).
% 2.55/2.72 ** KEPT (pick-wt=51): 65 [copy,64,flip.10] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))| -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A,B),E),F))| -mem(G,B)|p(ap(F,G))|ap(E,$f12(A,B,C,D,E,F,G))=G.
% 2.55/2.72 ** KEPT (pick-wt=41): 66 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A,B),E),F))|mem($f13(A,B,C,D,E,F),B).
% 2.55/2.72 ** KEPT (pick-wt=42): 67 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A,B),E),F))| -p(ap(F,$f13(A,B,C,D,E,F))).
% 2.55/2.72 ** KEPT (pick-wt=46): 68 [] -ne(A)| -ne(B)| -mem(C,arr(A,B))| -mem(D,arr(B,bool))| -mem(E,arr(A,B))| -mem(F,arr(B,bool))|p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A,B),E),F))| -mem(G,A)|$f13(A,B,C,D,E,F)!=ap(E,G).
% 2.55/2.72 ** KEPT (pick-wt=11): 69 [] -mem(A,$c5)| -p(ap($c1,A))|p(ap($c2,A)).
% 2.55/2.72 ** KEPT (pick-wt=8): 70 [] -p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT($c4,$c5),$c3),$c1)).
% 2.55/2.72
% 2.55/2.72 ------------> process sos:
% 2.55/2.72 ** KEPT (pick-wt=3): 418 [] A=A.
% 2.55/2.72 ** KEPT (pick-wt=2): 419 [] ne(bool).
% 2.55/2.72 ** KEPT (pick-wt=2): 420 [] ne(ind).
% 2.55/2.72 ** KEPT (pick-wt=3): 421 [] mem(c_2Ebool_2ET,bool).
% 2.55/2.72 ** KEPT (pick-wt=2): 422 [] p(c_2Ebool_2ET).
% 2.55/2.72 ** KEPT (pick-wt=3): 423 [] mem(c_2Ebool_2EF,bool).
% 2.55/2.72 ** KEPT (pick-wt=7): 424 [] mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.55/2.72 ** KEPT (pick-wt=7): 425 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.55/2.72 ** KEPT (pick-wt=5): 426 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.55/2.72 ** KEPT (pick-wt=7): 427 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.55/2.72 ** KEPT (pick-wt=2): 428 [] ne($c5).
% 2.55/2.72 ** KEPT (pick-wt=2): 429 [] ne($c4).
% 2.55/2.72 ** KEPT (pick-wt=5): 430 [] mem($c3,arr($c4,$c5)).
% 2.55/2.72 ** KEPT (pick-wt=5): 431 [] mem($c2,arr($c5,bool)).
% 2.55/2.72 ** KEPT (pick-wt=5): 432 [] mem($c1,arr($c5,bool)).
% 2.55/2.72 ** KEPT (pick-wt=8): 433 [] p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT($c4,$c5),$c3),$c2)).
% 2.55/2.72 Following clause subsumed by 418 during input processing: 0 [copy,418,flip.1] A=A.
% 2.55/2.72 418 back subsumes 86.
% 2.55/2.72 418 back subsumes 75.
% 2.55/2.72 418 back subsumes 74.
% 2.55/2.72 418 back subsumes 73.
% 2.55/2.72 418 back subsumes 72.
% 2.55/2.72
% 2.55/2.72 ======= end of input processing =======
% 2.55/2.72
% 2.55/2.72 =========== start of search ===========
% 2.55/2.72
% 2.55/2.72
% 2.55/2.72 Resetting weight limit to 2.
% 2.55/2.72
% 2.55/2.72
% 2.55/2.72 Resetting weight limit to 2.
% 2.55/2.72
% 2.55/2.72 sos_size=15
% 2.55/2.72
% 2.55/2.72 Search stopped because sos empty.
% 2.55/2.72
% 2.55/2.72
% 2.55/2.72 Search stopped because sos empty.
% 2.55/2.72
% 2.55/2.72 ============ end of search ============
% 2.55/2.72
% 2.55/2.72 -------------- statistics -------------
% 2.55/2.72 clauses given 16
% 2.55/2.72 clauses generated 1971
% 2.55/2.72 clauses kept 429
% 2.55/2.72 clauses forward subsumed 514
% 2.55/2.72 clauses back subsumed 5
% 2.55/2.72 Kbytes malloced 4882
% 2.55/2.72
% 2.55/2.72 ----------- times (seconds) -----------
% 2.55/2.72 user CPU time 0.23 (0 hr, 0 min, 0 sec)
% 2.55/2.72 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.55/2.72 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.55/2.72
% 2.55/2.72 Process 6397 finished Wed Jul 27 02:42:23 2022
% 2.55/2.72 Otter interrupted
% 2.55/2.72 PROOF NOT FOUND
%------------------------------------------------------------------------------