TSTP Solution File: ITP023+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ITP023+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:59:12 EDT 2022
% Result : Unknown 8.89s 9.15s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : ITP023+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n029.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 02:51:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.20/2.45 ----- Otter 3.3f, August 2004 -----
% 2.20/2.45 The process was started by sandbox2 on n029.cluster.edu,
% 2.20/2.45 Wed Jul 27 02:51:59 2022
% 2.20/2.45 The command was "./otter". The process ID is 25681.
% 2.20/2.45
% 2.20/2.45 set(prolog_style_variables).
% 2.20/2.45 set(auto).
% 2.20/2.45 dependent: set(auto1).
% 2.20/2.45 dependent: set(process_input).
% 2.20/2.45 dependent: clear(print_kept).
% 2.20/2.45 dependent: clear(print_new_demod).
% 2.20/2.45 dependent: clear(print_back_demod).
% 2.20/2.45 dependent: clear(print_back_sub).
% 2.20/2.45 dependent: set(control_memory).
% 2.20/2.45 dependent: assign(max_mem, 12000).
% 2.20/2.45 dependent: assign(pick_given_ratio, 4).
% 2.20/2.45 dependent: assign(stats_level, 1).
% 2.20/2.45 dependent: assign(max_seconds, 10800).
% 2.20/2.45 clear(print_given).
% 2.20/2.45
% 2.20/2.45 formula_list(usable).
% 2.20/2.45 all A (A=A).
% 2.20/2.45 ne(bool).
% 2.20/2.45 ne(ind).
% 2.20/2.45 all A (ne(A)-> (all B (ne(B)->ne(arr(A,B))))).
% 2.20/2.45 all A B F (mem(F,arr(A,B))-> (all X (mem(X,A)->mem(ap(F,X),B)))).
% 2.20/2.45 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> ((p(Q)<->p(R))->Q=R)))).
% 2.20/2.45 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.20/2.45 all A Y X (mem(X,A)->ap(k(A,Y),X)=Y).
% 2.20/2.45 all A X (mem(X,A)->ap(i(A),X)=X).
% 2.20/2.45 mem(c_2Ebool_2ET,bool).
% 2.20/2.45 p(c_2Ebool_2ET).
% 2.20/2.45 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_3F(A_27a),arr(arr(A_27a,bool),bool))).
% 2.20/2.45 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.20/2.45 ne(ty_2Erealax_2Ereal).
% 2.20/2.45 all A0 (ne(A0)-> (all A1 (ne(A1)->ne(ty_2Epair_2Eprod(A0,A1))))).
% 2.20/2.45 mem(c_2Ereal__topology_2Eball,arr(ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),arr(ty_2Erealax_2Ereal,bool))).
% 2.20/2.45 all A_27a (ne(A_27a)->mem(c_2Epred__set_2ESUBSET(A_27a),arr(arr(A_27a,bool),arr(arr(A_27a,bool),bool)))).
% 2.20/2.45 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))))))).
% 2.20/2.45 mem(c_2Ereal__topology_2Ecball,arr(ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),arr(ty_2Erealax_2Ereal,bool))).
% 2.20/2.45 mem(c_2Ereal__topology_2Ebounded__def,arr(arr(ty_2Erealax_2Ereal,bool),bool)).
% 2.20/2.45 mem(c_2Ebool_2EF,bool).
% 2.20/2.45 -p(c_2Ebool_2EF).
% 2.20/2.45 mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.20/2.45 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.20/2.45 mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.20/2.45 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.20/2.45 mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.20/2.45 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.20/2.45 mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.20/2.45 all Q (mem(Q,bool)-> (p(ap(c_2Ebool_2E_7E,Q))<-> -p(Q))).
% 2.20/2.45 all A_27a (ne(A_27a)->mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool)))).
% 2.20/2.45 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.20/2.45 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool))).
% 2.20/2.45 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.20/2.45 $T.
% 2.20/2.45 all V0t1 (mem(V0t1,bool)-> (all V1t2 (mem(V1t2,bool)-> ((p(V0t1)->p(V1t2))-> ((p(V1t2)->p(V0t1))-> (p(V0t1)<->p(V1t2))))))).
% 2.20/2.45 all V0t (mem(V0t,bool)-> (-p(V0t)-> -p(V0t))).
% 2.20/2.45 all V0t (mem(V0t,bool)-> (-p(V0t)-> -p(V0t))).
% 2.20/2.45 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.20/2.45 all V0t (mem(V0t,bool)-> (-(-p(V0t))<->p(V0t))).
% 2.20/2.45 -$T<->$F.
% 2.20/2.45 -$F<->$T.
% 2.20/2.45 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)-> (all V1y (mem(V1y,A_27a)-> (V0x=V1y<->V1y=V0x)))))).
% 2.20/2.45 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.20/2.45 all A_27a (ne(A_27a)-> (all V0P (mem(V0P,arr(A_27a,bool))-> (-(all V1x (mem(V1x,A_27a)->p(ap(V0P,V1x))))<-> (exists V2x (mem(V2x,A_27a)& -p(ap(V0P,V2x)))))))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (all V2C (mem(V2C,bool)-> (p(V0A)|p(V1B)|p(V2C)<->p(V0A)|p(V1B)|p(V2C))))))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (p(V0A)|p(V1B)<->p(V1B)|p(V0A))))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(p(V0A)&p(V1B))<-> -p(V0A)| -p(V1B))& (-(p(V0A)|p(V1B))<-> -p(V0A)& -p(V1B))))).
% 2.20/2.45 all V0x (mem(V0x,ty_2Erealax_2Ereal)-> (all V1e (mem(V1e,ty_2Erealax_2Ereal)->p(ap(ap(c_2Epred__set_2ESUBSET(ty_2Erealax_2Ereal),ap(c_2Ereal__topology_2Eball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e))),ap(c_2Ereal__topology_2Ecball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e))))))).
% 2.20/2.45 all V0s (mem(V0s,arr(ty_2Erealax_2Ereal,bool))-> (all V1t (mem(V1t,arr(ty_2Erealax_2Ereal,bool))-> (p(ap(c_2Ereal__topology_2Ebounded__def,V1t))&p(ap(ap(c_2Epred__set_2ESUBSET(ty_2Erealax_2Ereal),V0s),V1t))->p(ap(c_2Ereal__topology_2Ebounded__def,V0s)))))).
% 2.20/2.45 all V0x (mem(V0x,ty_2Erealax_2Ereal)-> (all V1e (mem(V1e,ty_2Erealax_2Ereal)->p(ap(c_2Ereal__topology_2Ebounded__def,ap(c_2Ereal__topology_2Ecball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e))))))).
% 2.20/2.45 all V0t (mem(V0t,bool)-> (-(-p(V0t))<->p(V0t))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (p(V0A)-> -(-p(V0A)))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(-(p(V0A)|p(V1B)))<-> (-p(V0A)-> -(-p(V1B))))))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(-(-p(V0A)|p(V1B)))<-> (p(V0A)-> -(-p(V1B))))))).
% 2.20/2.45 all V0A (mem(V0A,bool)-> (-(-p(V0A))-> -(-p(V0A)))).
% 2.20/2.45 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.20/2.45 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(V1q)| -p(V0p))& (p(V2r)| -p(V0p)))))))).
% 2.20/2.45 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.20/2.45 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.20/2.45 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> ((p(V0p)<-> -p(V1q))<-> (p(V0p)|p(V1q))& (-p(V1q)| -p(V0p)))))).
% 2.20/2.45 -(all V0x (mem(V0x,ty_2Erealax_2Ereal)-> (all V1e (mem(V1e,ty_2Erealax_2Ereal)->p(ap(c_2Ereal__topology_2Ebounded__def,ap(c_2Ereal__topology_2Eball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e)))))))).
% 2.20/2.45 end_of_list.
% 2.20/2.45
% 2.20/2.45 -------> usable clausifies to:
% 2.20/2.45
% 2.20/2.45 list(usable).
% 2.20/2.45 0 [] A=A.
% 2.20/2.45 0 [] ne(bool).
% 2.20/2.45 0 [] ne(ind).
% 2.20/2.45 0 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.20/2.45 0 [] -mem(F,arr(A,B))| -mem(X,A)|mem(ap(F,X),B).
% 2.20/2.45 0 [] -mem(Q,bool)| -mem(R,bool)|p(Q)|p(R)|Q=R.
% 2.20/2.45 0 [] -mem(Q,bool)| -mem(R,bool)| -p(Q)| -p(R)|Q=R.
% 2.20/2.45 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|mem($f1(A,B,F,G),A)|F=G.
% 2.20/2.45 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.20/2.45 0 [] -mem(X,A)|ap(k(A,Y),X)=Y.
% 2.20/2.45 0 [] -mem(X,A)|ap(i(A),X)=X.
% 2.20/2.45 0 [] mem(c_2Ebool_2ET,bool).
% 2.20/2.45 0 [] p(c_2Ebool_2ET).
% 2.20/2.45 0 [] -ne(A_27a)|mem(c_2Ebool_2E_3F(A_27a),arr(arr(A_27a,bool),bool)).
% 2.20/2.45 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),Q))|mem($f2(A,Q),A).
% 2.20/2.45 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),Q))|p(ap(Q,$f2(A,Q))).
% 2.20/2.45 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_3F(A),Q))| -mem(X,A)| -p(ap(Q,X)).
% 2.20/2.45 0 [] ne(ty_2Erealax_2Ereal).
% 2.20/2.45 0 [] -ne(A0)| -ne(A1)|ne(ty_2Epair_2Eprod(A0,A1)).
% 2.20/2.45 0 [] mem(c_2Ereal__topology_2Eball,arr(ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),arr(ty_2Erealax_2Ereal,bool))).
% 2.20/2.45 0 [] -ne(A_27a)|mem(c_2Epred__set_2ESUBSET(A_27a),arr(arr(A_27a,bool),arr(arr(A_27a,bool),bool))).
% 2.20/2.45 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)))).
% 2.20/2.45 0 [] mem(c_2Ereal__topology_2Ecball,arr(ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),arr(ty_2Erealax_2Ereal,bool))).
% 2.20/2.45 0 [] mem(c_2Ereal__topology_2Ebounded__def,arr(arr(ty_2Erealax_2Ereal,bool),bool)).
% 2.20/2.45 0 [] mem(c_2Ebool_2EF,bool).
% 2.20/2.45 0 [] -p(c_2Ebool_2EF).
% 2.20/2.45 0 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.20/2.45 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(Q)|p(R).
% 2.20/2.45 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))|p(Q).
% 2.20/2.45 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(R).
% 2.20/2.45 0 [] mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.20/2.46 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))|p(Q)|p(R).
% 2.20/2.46 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))| -p(Q).
% 2.20/2.46 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))| -p(R).
% 2.20/2.46 0 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.20/2.46 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(Q).
% 2.20/2.46 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(R).
% 2.20/2.46 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))| -p(Q)| -p(R).
% 2.20/2.46 0 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.20/2.46 0 [] -mem(Q,bool)| -p(ap(c_2Ebool_2E_7E,Q))| -p(Q).
% 2.20/2.46 0 [] -mem(Q,bool)|p(ap(c_2Ebool_2E_7E,Q))|p(Q).
% 2.20/2.46 0 [] -ne(A_27a)|mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))).
% 2.20/2.46 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)| -p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X=Y.
% 2.20/2.46 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)|p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X!=Y.
% 2.20/2.46 0 [] -ne(A_27a)|mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)).
% 2.20/2.46 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),Q))| -mem(X,A)|p(ap(Q,X)).
% 2.20/2.46 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))|mem($f3(A,Q),A).
% 2.20/2.46 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))| -p(ap(Q,$f3(A,Q))).
% 2.20/2.46 0 [] $T.
% 2.20/2.46 0 [] -mem(V0t,bool)| -$F|p(V0t)| -$T.
% 2.20/2.46 0 [] -mem(V0t,bool)|$T.
% 2.20/2.46 0 [] $T|$F.
% 2.20/2.46 0 [] -$T| -$F.
% 2.20/2.46 0 [] $F|$T.
% 2.20/2.46 0 [] -$F| -$T.
% 2.20/2.46 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -mem(V1y,A_27a)|V0x!=V1y|V1y=V0x.
% 2.20/2.46 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -mem(V1y,A_27a)|V0x=V1y|V1y!=V0x.
% 2.20/2.46 0 [] -mem(V0t,bool)|$T|p(V0t).
% 2.20/2.46 0 [] -mem(V0t,bool)|$T| -p(V0t).
% 2.20/2.46 0 [] -mem(V0t,bool)| -$F| -p(V0t).
% 2.20/2.46 0 [] -mem(V0t,bool)| -$F|p(V0t).
% 2.20/2.46 0 [] -ne(A_27a)| -mem(V0P,arr(A_27a,bool))| -mem(V1x,A_27a)|p(ap(V0P,V1x))|mem($f4(A_27a,V0P),A_27a).
% 2.20/2.46 0 [] -ne(A_27a)| -mem(V0P,arr(A_27a,bool))| -mem(V1x,A_27a)|p(ap(V0P,V1x))| -p(ap(V0P,$f4(A_27a,V0P))).
% 2.20/2.46 0 [] -ne(A_27a)| -mem(V0P,arr(A_27a,bool))|mem($f5(A_27a,V0P),A_27a)| -mem(V2x,A_27a)|p(ap(V0P,V2x)).
% 2.20/2.46 0 [] -ne(A_27a)| -mem(V0P,arr(A_27a,bool))| -p(ap(V0P,$f5(A_27a,V0P)))| -mem(V2x,A_27a)|p(ap(V0P,V2x)).
% 2.20/2.46 0 [] -mem(V0x,ty_2Erealax_2Ereal)| -mem(V1e,ty_2Erealax_2Ereal)|p(ap(ap(c_2Epred__set_2ESUBSET(ty_2Erealax_2Ereal),ap(c_2Ereal__topology_2Eball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e))),ap(c_2Ereal__topology_2Ecball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e)))).
% 2.20/2.46 0 [] -mem(V0s,arr(ty_2Erealax_2Ereal,bool))| -mem(V1t,arr(ty_2Erealax_2Ereal,bool))| -p(ap(c_2Ereal__topology_2Ebounded__def,V1t))| -p(ap(ap(c_2Epred__set_2ESUBSET(ty_2Erealax_2Ereal),V0s),V1t))|p(ap(c_2Ereal__topology_2Ebounded__def,V0s)).
% 2.20/2.46 0 [] -mem(V0x,ty_2Erealax_2Ereal)| -mem(V1e,ty_2Erealax_2Ereal)|p(ap(c_2Ereal__topology_2Ebounded__def,ap(c_2Ereal__topology_2Ecball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),V0x),V1e)))).
% 2.20/2.46 0 [] mem($c2,ty_2Erealax_2Ereal).
% 2.20/2.46 0 [] mem($c1,ty_2Erealax_2Ereal).
% 2.20/2.46 0 [] -p(ap(c_2Ereal__topology_2Ebounded__def,ap(c_2Ereal__topology_2Eball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),$c2),$c1)))).
% 2.20/2.46 end_of_list.
% 2.20/2.46
% 2.20/2.46 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.20/2.46
% 2.20/2.46 This ia a non-Horn set with equality. The strategy will be
% 2.20/2.46 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.20/2.46 deletion, with positive clauses in sos and nonpositive
% 2.20/2.46 clauses in usable.
% 2.20/2.46
% 2.20/2.46 dependent: set(knuth_bendix).
% 2.20/2.46 dependent: set(anl_eq).
% 2.20/2.46 dependent: set(para_from).
% 2.20/2.46 dependent: set(para_into).
% 2.20/2.46 dependent: clear(para_from_right).
% 2.20/2.46 dependent: clear(para_into_right).
% 2.20/2.46 dependent: set(para_from_vars).
% 2.20/2.46 dependent: set(eq_units_both_ways).
% 2.20/2.46 dependent: set(dynamic_demod_all).
% 2.20/2.46 dependent: set(dynamic_demod).
% 2.20/2.46 dependent: set(order_eq).
% 2.20/2.46 dependent: set(back_demod).
% 2.20/2.46 dependent: set(lrpo).
% 2.20/2.46 dependent: set(hyper_res).
% 2.20/2.46 dependent: set(unit_deletion).
% 2.20/2.46 dependent: set(factor).
% 2.20/2.46
% 2.20/2.46 ------------> process usable:
% 2.20/2.46 ** KEPT (pick-wt=8): 1 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.20/2.46 ** KEPT (pick-wt=13): 2 [] -mem(A,arr(B,C))| -mem(D,B)|mem(ap(A,D),C).
% 2.20/2.46 ** KEPT (pick-wt=13): 3 [] -mem(A,bool)| -mem(B,bool)|p(A)|p(B)|A=B.
% 2.20/2.46 ** KEPT (pick-wt=13): 4 [] -mem(A,bool)| -mem(B,bool)| -p(A)| -p(B)|A=B.
% 2.20/2.46 ** 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.20/2.46 ** 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.20/2.46 ** KEPT (pick-wt=10): 7 [] -mem(A,B)|ap(k(B,C),A)=C.
% 2.20/2.46 ** KEPT (pick-wt=9): 8 [] -mem(A,B)|ap(i(B),A)=A.
% 2.20/2.46 ** KEPT (pick-wt=10): 9 [] -ne(A)|mem(c_2Ebool_2E_3F(A),arr(arr(A,bool),bool)).
% 2.20/2.46 ** KEPT (pick-wt=17): 10 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),B))|mem($f2(A,B),A).
% 2.20/2.46 ** KEPT (pick-wt=18): 11 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_3F(A),B))|p(ap(B,$f2(A,B))).
% 2.20/2.46 ** KEPT (pick-wt=19): 12 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_3F(A),B))| -mem(C,A)| -p(ap(B,C)).
% 2.20/2.46 ** KEPT (pick-wt=8): 13 [] -ne(A)| -ne(B)|ne(ty_2Epair_2Eprod(A,B)).
% 2.20/2.46 ** KEPT (pick-wt=14): 14 [] -ne(A)|mem(c_2Epred__set_2ESUBSET(A),arr(arr(A,bool),arr(arr(A,bool),bool))).
% 2.20/2.46 ** KEPT (pick-wt=15): 15 [] -ne(A)| -ne(B)|mem(c_2Epair_2E_2C(A,B),arr(A,arr(B,ty_2Epair_2Eprod(A,B)))).
% 2.20/2.46 ** KEPT (pick-wt=2): 16 [] -p(c_2Ebool_2EF).
% 2.20/2.46 ** KEPT (pick-wt=16): 17 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(A)|p(B).
% 2.20/2.46 ** KEPT (pick-wt=14): 18 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))|p(A).
% 2.20/2.46 ** KEPT (pick-wt=14): 19 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(B).
% 2.20/2.46 ** 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.20/2.46 ** KEPT (pick-wt=14): 21 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,A),B))| -p(A).
% 2.20/2.46 ** KEPT (pick-wt=14): 22 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,A),B))| -p(B).
% 2.20/2.46 ** KEPT (pick-wt=14): 23 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(A).
% 2.20/2.46 ** KEPT (pick-wt=14): 24 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(B).
% 2.20/2.46 ** 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.20/2.46 ** KEPT (pick-wt=9): 26 [] -mem(A,bool)| -p(ap(c_2Ebool_2E_7E,A))| -p(A).
% 2.20/2.46 ** KEPT (pick-wt=9): 27 [] -mem(A,bool)|p(ap(c_2Ebool_2E_7E,A))|p(A).
% 2.20/2.46 ** KEPT (pick-wt=10): 28 [] -ne(A)|mem(c_2Emin_2E_3D(A),arr(A,arr(A,bool))).
% 2.20/2.46 ** KEPT (pick-wt=18): 29 [] -ne(A)| -mem(B,A)| -mem(C,A)| -p(ap(ap(c_2Emin_2E_3D(A),B),C))|B=C.
% 2.20/2.46 ** KEPT (pick-wt=18): 30 [] -ne(A)| -mem(B,A)| -mem(C,A)|p(ap(ap(c_2Emin_2E_3D(A),B),C))|B!=C.
% 2.20/2.46 ** KEPT (pick-wt=10): 31 [] -ne(A)|mem(c_2Ebool_2E_21(A),arr(arr(A,bool),bool)).
% 2.20/2.46 ** KEPT (pick-wt=19): 32 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),B))| -mem(C,A)|p(ap(B,C)).
% 2.20/2.46 ** KEPT (pick-wt=17): 33 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))|mem($f3(A,B),A).
% 2.20/2.46 ** KEPT (pick-wt=18): 34 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))| -p(ap(B,$f3(A,B))).
% 2.20/2.46 ** KEPT (pick-wt=14): 35 [] -ne(A)| -mem(B,A)| -mem(C,A)|B!=C|C=B.
% 2.20/2.46 Following clause subsumed by 35 during input processing: 0 [] -ne(A)| -mem(B,A)| -mem(C,A)|B=C|C!=B.
% 2.20/2.46 ** KEPT (pick-wt=19): 36 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,A)|p(ap(B,C))|mem($f4(A,B),A).
% 2.20/2.46 ** KEPT (pick-wt=20): 37 [] -ne(A)| -mem(B,arr(A,bool))| -mem(C,A)|p(ap(B,C))| -p(ap(B,$f4(A,B))).
% 2.20/2.46 ** KEPT (pick-wt=19): 38 [] -ne(A)| -mem(B,arr(A,bool))|mem($f5(A,B),A)| -mem(C,A)|p(ap(B,C)).
% 2.20/2.46 ** KEPT (pick-wt=20): 39 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(B,$f5(A,B)))| -mem(C,A)|p(ap(B,C)).
% 2.20/2.46 ** KEPT (pick-wt=29): 40 [] -mem(A,ty_2Erealax_2Ereal)| -mem(B,ty_2Erealax_2Ereal)|p(ap(ap(c_2Epred__set_2ESUBSET(ty_2Erealax_2Ereal),ap(c_2Ereal__topology_2Eball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),A),B))),ap(c_2Ereal__topology_2Ecball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),A),B)))).
% 2.20/2.46 ** KEPT (pick-wt=25): 41 [] -mem(A,arr(ty_2Erealax_2Ereal,bool))| -mem(B,arr(ty_2Erealax_2Ereal,bool))| -p(ap(c_2Ereal__topology_2Ebounded__def,B))| -p(ap(ap(c_2Epred__set_2ESUBSET(ty_2Erealax_2Ereal),A),B))|p(ap(c_2Ereal__topology_2Ebounded__def,A)).
% 2.20/2.46 ** KEPT (pick-wt=18): 42 [] -mem(A,ty_2Erealax_2Ereal)| -mem(B,ty_2Erealax_2Ereal)|p(ap(c_2Ereal__topology_2Ebounded__def,ap(c_2Ereal__topology_2Ecball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),A),B)))).
% 2.20/2.46 ** KEPT (pick-wt=12): 43 [] -p(ap(c_2Ereal__topology_2Ebounded__def,ap(c_2Ereal__topology_2Eball,ap(ap(c_2Epair_2E_2C(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),$c2),$c1)))).
% 8.89/9.15
% 8.89/9.15 ------------> process sos:
% 8.89/9.15 ** KEPT (pick-wt=3): 61 [] A=A.
% 8.89/9.15 ** KEPT (pick-wt=2): 62 [] ne(bool).
% 8.89/9.15 ** KEPT (pick-wt=2): 63 [] ne(ind).
% 8.89/9.15 ** KEPT (pick-wt=3): 64 [] mem(c_2Ebool_2ET,bool).
% 8.89/9.15 ** KEPT (pick-wt=2): 65 [] p(c_2Ebool_2ET).
% 8.89/9.15 ** KEPT (pick-wt=2): 66 [] ne(ty_2Erealax_2Ereal).
% 8.89/9.15 ** KEPT (pick-wt=9): 67 [] mem(c_2Ereal__topology_2Eball,arr(ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),arr(ty_2Erealax_2Ereal,bool))).
% 8.89/9.15 ** KEPT (pick-wt=9): 68 [] mem(c_2Ereal__topology_2Ecball,arr(ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal),arr(ty_2Erealax_2Ereal,bool))).
% 8.89/9.15 ** KEPT (pick-wt=7): 69 [] mem(c_2Ereal__topology_2Ebounded__def,arr(arr(ty_2Erealax_2Ereal,bool),bool)).
% 8.89/9.15 ** KEPT (pick-wt=3): 70 [] mem(c_2Ebool_2EF,bool).
% 8.89/9.15 ** KEPT (pick-wt=7): 71 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 8.89/9.15 ** KEPT (pick-wt=7): 72 [] mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 8.89/9.15 ** KEPT (pick-wt=7): 73 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 8.89/9.15 ** KEPT (pick-wt=5): 74 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 8.89/9.15 ** KEPT (pick-wt=3): 75 [] mem($c2,ty_2Erealax_2Ereal).
% 8.89/9.15 ** KEPT (pick-wt=3): 76 [] mem($c1,ty_2Erealax_2Ereal).
% 8.89/9.15 Following clause subsumed by 61 during input processing: 0 [copy,61,flip.1] A=A.
% 8.89/9.15 61 back subsumes 57.
% 8.89/9.15 61 back subsumes 48.
% 8.89/9.15 61 back subsumes 47.
% 8.89/9.15 61 back subsumes 46.
% 8.89/9.15 61 back subsumes 45.
% 8.89/9.15
% 8.89/9.15 ======= end of input processing =======
% 8.89/9.15
% 8.89/9.15 =========== start of search ===========
% 8.89/9.15
% 8.89/9.15
% 8.89/9.15 Resetting weight limit to 6.
% 8.89/9.15
% 8.89/9.15
% 8.89/9.15 Resetting weight limit to 6.
% 8.89/9.15
% 8.89/9.15 sos_size=1449
% 8.89/9.15
% 8.89/9.15 Search stopped because sos empty.
% 8.89/9.15
% 8.89/9.15
% 8.89/9.15 Search stopped because sos empty.
% 8.89/9.15
% 8.89/9.15 ============ end of search ============
% 8.89/9.15
% 8.89/9.15 -------------- statistics -------------
% 8.89/9.15 clauses given 1534
% 8.89/9.15 clauses generated 1286765
% 8.89/9.15 clauses kept 1594
% 8.89/9.15 clauses forward subsumed 981
% 8.89/9.15 clauses back subsumed 5
% 8.89/9.15 Kbytes malloced 6835
% 8.89/9.15
% 8.89/9.15 ----------- times (seconds) -----------
% 8.89/9.15 user CPU time 6.69 (0 hr, 0 min, 6 sec)
% 8.89/9.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 8.89/9.15 wall-clock time 9 (0 hr, 0 min, 9 sec)
% 8.89/9.15
% 8.89/9.15 Process 25681 finished Wed Jul 27 02:52:08 2022
% 8.89/9.15 Otter interrupted
% 8.89/9.15 PROOF NOT FOUND
%------------------------------------------------------------------------------