TSTP Solution File: ITP010+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ITP010+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:00 EDT 2022
% Result : Theorem 2.36s 2.53s
% Output : Refutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 0
% Number of leaves : 1
% Syntax : Number of clauses : 1 ( 1 unt; 0 nHn; 1 RR)
% Number of literals : 1 ( 0 equ; 0 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 1 ( 0 usr; 1 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(58,axiom,
$false,
file('ITP010+2.p',unknown),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP010+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n025.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:52:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.36/2.53 ----- Otter 3.3f, August 2004 -----
% 2.36/2.53 The process was started by sandbox on n025.cluster.edu,
% 2.36/2.53 Wed Jul 27 02:52:46 2022
% 2.36/2.53 The command was "./otter". The process ID is 27014.
% 2.36/2.53
% 2.36/2.53 set(prolog_style_variables).
% 2.36/2.53 set(auto).
% 2.36/2.53 dependent: set(auto1).
% 2.36/2.53 dependent: set(process_input).
% 2.36/2.53 dependent: clear(print_kept).
% 2.36/2.53 dependent: clear(print_new_demod).
% 2.36/2.53 dependent: clear(print_back_demod).
% 2.36/2.53 dependent: clear(print_back_sub).
% 2.36/2.53 dependent: set(control_memory).
% 2.36/2.53 dependent: assign(max_mem, 12000).
% 2.36/2.53 dependent: assign(pick_given_ratio, 4).
% 2.36/2.53 dependent: assign(stats_level, 1).
% 2.36/2.53 dependent: assign(max_seconds, 10800).
% 2.36/2.53 clear(print_given).
% 2.36/2.53
% 2.36/2.53 formula_list(usable).
% 2.36/2.53 all A (A=A).
% 2.36/2.53 ne(bool).
% 2.36/2.53 ne(ind).
% 2.36/2.53 all A (ne(A)-> (all B (ne(B)->ne(arr(A,B))))).
% 2.36/2.53 all A B F (mem(F,arr(A,B))-> (all X (mem(X,A)->mem(ap(F,X),B)))).
% 2.36/2.53 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> ((p(Q)<->p(R))->Q=R)))).
% 2.36/2.53 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.36/2.53 all A Y X (mem(X,A)->ap(k(A,Y),X)=Y).
% 2.36/2.53 all A X (mem(X,A)->ap(i(A),X)=X).
% 2.36/2.53 mem(c_2Ebool_2ET,bool).
% 2.36/2.53 p(c_2Ebool_2ET).
% 2.36/2.53 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)->mem(c_2Ecardinal_2Ecardle_q(A_27a,A_27b),arr(arr(A_27a,bool),arr(arr(A_27b,bool),bool)))))).
% 2.36/2.53 mem(c_2Ebool_2EF,bool).
% 2.36/2.53 -p(c_2Ebool_2EF).
% 2.36/2.53 mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.36/2.53 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.36/2.53 mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.36/2.53 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.36/2.53 mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.36/2.53 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.36/2.53 mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.36/2.53 all Q (mem(Q,bool)-> (p(ap(c_2Ebool_2E_7E,Q))<-> -p(Q))).
% 2.36/2.53 all A_27a (ne(A_27a)->mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool)))).
% 2.36/2.53 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.36/2.53 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool))).
% 2.36/2.53 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.36/2.53 $T.
% 2.36/2.53 all V0t (mem(V0t,bool)-> ($F->p(V0t))).
% 2.36/2.53 all A_27a (ne(A_27a)-> (all V0t (mem(V0t,bool)-> ((all V1x (mem(V1x,A_27a)->p(V0t)))<->p(V0t))))).
% 2.36/2.53 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.36/2.53 all V0t (mem(V0t,bool)-> (-(-p(V0t))<->p(V0t))).
% 2.36/2.53 -$T<->$F.
% 2.36/2.53 -$F<->$T.
% 2.36/2.53 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)-> (V0x=V0x<->$T)))).
% 2.36/2.53 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.36/2.53 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all V0s (mem(V0s,arr(A_27a,bool))-> (all V1t (mem(V1t,arr(A_27b,bool))->p(ap(ap(c_2Ecardinal_2Ecardle_q(A_27a,A_27b),V0s),V1t))|p(ap(ap(c_2Ecardinal_2Ecardle_q(A_27b,A_27a),V1t),V0s))))))))).
% 2.36/2.53 all V0t (mem(V0t,bool)-> (-(-p(V0t))<->p(V0t))).
% 2.36/2.53 all V0A (mem(V0A,bool)-> (p(V0A)-> -(-p(V0A)))).
% 2.36/2.53 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(-(p(V0A)|p(V1B)))<-> (-p(V0A)-> -(-p(V1B))))))).
% 2.36/2.53 all V0A (mem(V0A,bool)-> (all V1B (mem(V1B,bool)-> (-(-(-p(V0A)|p(V1B)))<-> (p(V0A)-> -(-p(V1B))))))).
% 2.36/2.53 all V0A (mem(V0A,bool)-> (-(-p(V0A))-> -(-p(V0A)))).
% 2.36/2.53 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.36/2.53 all V0p (mem(V0p,bool)-> (all V1q (mem(V1q,bool)-> ((p(V0p)<-> -p(V1q))<-> (p(V0p)|p(V1q))& (-p(V1q)| -p(V0p)))))).
% 2.36/2.53 -(all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all V0s (mem(V0s,arr(A_27a,bool))-> (all V1t (mem(V1t,arr(A_27b,bool))-> (-p(ap(ap(c_2Ecardinal_2Ecardle_q(A_27a,A_27b),V0s),V1t))<-> -p(ap(ap(c_2Ecardinal_2Ecardle_q(A_27a,A_27b),V0s),V1t))))))))))).
% 2.36/2.53 end_of_list.
% 2.36/2.53
% 2.36/2.53 -------> usable clausifies to:
% 2.36/2.53
% 2.36/2.53 list(usable).
% 2.36/2.53 0 [] A=A.
% 2.36/2.53 0 [] ne(bool).
% 2.36/2.53 0 [] ne(ind).
% 2.36/2.53 0 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.36/2.53 0 [] -mem(F,arr(A,B))| -mem(X,A)|mem(ap(F,X),B).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)|p(Q)|p(R)|Q=R.
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)| -p(Q)| -p(R)|Q=R.
% 2.36/2.53 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|mem($f1(A,B,F,G),A)|F=G.
% 2.36/2.53 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.36/2.53 0 [] -mem(X,A)|ap(k(A,Y),X)=Y.
% 2.36/2.53 0 [] -mem(X,A)|ap(i(A),X)=X.
% 2.36/2.53 0 [] mem(c_2Ebool_2ET,bool).
% 2.36/2.53 0 [] p(c_2Ebool_2ET).
% 2.36/2.53 0 [] -ne(A_27a)| -ne(A_27b)|mem(c_2Ecardinal_2Ecardle_q(A_27a,A_27b),arr(arr(A_27a,bool),arr(arr(A_27b,bool),bool))).
% 2.36/2.53 0 [] mem(c_2Ebool_2EF,bool).
% 2.36/2.53 0 [] -p(c_2Ebool_2EF).
% 2.36/2.53 0 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(Q)|p(R).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))|p(Q).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))| -p(R).
% 2.36/2.53 0 [] mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))|p(Q)|p(R).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))| -p(Q).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))| -p(R).
% 2.36/2.53 0 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(Q).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(R).
% 2.36/2.53 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))| -p(Q)| -p(R).
% 2.36/2.53 0 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.36/2.53 0 [] -mem(Q,bool)| -p(ap(c_2Ebool_2E_7E,Q))| -p(Q).
% 2.36/2.53 0 [] -mem(Q,bool)|p(ap(c_2Ebool_2E_7E,Q))|p(Q).
% 2.36/2.53 0 [] -ne(A_27a)|mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))).
% 2.36/2.53 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)| -p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X=Y.
% 2.36/2.53 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)|p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X!=Y.
% 2.36/2.53 0 [] -ne(A_27a)|mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)).
% 2.36/2.53 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),Q))| -mem(X,A)|p(ap(Q,X)).
% 2.36/2.53 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))|mem($f2(A,Q),A).
% 2.36/2.53 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))| -p(ap(Q,$f2(A,Q))).
% 2.36/2.53 0 [] $T.
% 2.36/2.53 0 [] -mem(V0t,bool)| -$F|p(V0t).
% 2.36/2.53 0 [] -ne(A_27a)| -mem(V0t,bool)|mem($f3(A_27a,V0t),A_27a)|p(V0t).
% 2.36/2.53 0 [] -mem(V0t,bool)| -$F|p(V0t)| -$T.
% 2.36/2.53 0 [] -mem(V0t,bool)|$T.
% 2.36/2.53 0 [] $T|$F.
% 2.36/2.53 0 [] -$T| -$F.
% 2.36/2.53 0 [] $F|$T.
% 2.36/2.53 0 [] -$F| -$T.
% 2.36/2.53 0 [] -ne(A_27a)| -mem(V0x,A_27a)|V0x!=V0x|$T.
% 2.36/2.53 0 [] -ne(A_27a)| -mem(V0x,A_27a)|V0x=V0x| -$T.
% 2.36/2.53 0 [] -mem(V0t,bool)|$T|p(V0t).
% 2.36/2.53 0 [] -mem(V0t,bool)|$T| -p(V0t).
% 2.36/2.53 0 [] -mem(V0t,bool)| -$F| -p(V0t).
% 2.36/2.53 0 [] -mem(V0t,bool)| -$F|p(V0t).
% 2.36/2.53 0 [] -ne(A_27a)| -ne(A_27b)| -mem(V0s,arr(A_27a,bool))| -mem(V1t,arr(A_27b,bool))|p(ap(ap(c_2Ecardinal_2Ecardle_q(A_27a,A_27b),V0s),V1t))|p(ap(ap(c_2Ecardinal_2Ecardle_q(A_27b,A_27a),V1t),V0s)).
% 2.36/2.53 0 [] $F.
% 2.36/2.53 end_of_list.
% 2.36/2.53
% 2.36/2.53 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.36/2.53
% 2.36/2.53 This ia a non-Horn set with equality. The strategy will be
% 2.36/2.53 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.36/2.53 deletion, with positive clauses in sos and nonpositive
% 2.36/2.53 clauses in usable.
% 2.36/2.53
% 2.36/2.53 dependent: set(knuth_bendix).
% 2.36/2.53 dependent: set(anl_eq).
% 2.36/2.53 dependent: set(para_from).
% 2.36/2.53 dependent: set(para_into).
% 2.36/2.53 dependent: clear(para_from_right).
% 2.36/2.53 dependent: clear(para_into_right).
% 2.36/2.53 dependent: set(para_from_vars).
% 2.36/2.53 dependent: set(eq_units_both_ways).
% 2.36/2.53 dependent: set(dynamic_demod_all).
% 2.36/2.53 dependent: set(dynamic_demod).
% 2.36/2.53 dependent: set(order_eq).
% 2.36/2.53 dependent: set(back_demod).
% 2.36/2.53 dependent: set(lrpo).
% 2.36/2.53 dependent: set(hyper_res).
% 2.36/2.53 dependent: set(unit_deletion).
% 2.36/2.53 dependent: set(factor).
% 2.36/2.53
% 2.36/2.53 ------------> process usable:
% 2.36/2.53 ** KEPT (pick-wt=8): 1 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.36/2.53 ** KEPT (pick-wt=13): 2 [] -mem(A,arr(B,C))| -mem(D,B)|mem(ap(A,D),C).
% 2.36/2.53 ** KEPT (pick-wt=13): 3 [] -mem(A,bool)| -mem(B,bool)|p(A)|p(B)|A=B.
% 2.36/2.53 ** KEPT (pick-wt=13): 4 [] -mem(A,bool)| -mem(B,bool)| -p(A)| -p(B)|A=B.
% 2.36/2.53 ** 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.36/2.53 ** 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.36/2.53 ** KEPT (pick-wt=10): 7 [] -mem(A,B)|ap(k(B,C),A)=C.
% 2.36/2.53 ** KEPT (pick-wt=9): 8 [] -mem(A,B)|ap(i(B),A)=A.
% 2.36/2.53 ** KEPT (pick-wt=17): 9 [] -ne(A)| -n
% 2.36/2.53 -------- PROOF --------
% 2.36/2.53 e(B)|mem(c_2Ecardinal_2Ecardle_q(A,B),arr(arr(A,bool),arr(arr(B,bool),bool))).
% 2.36/2.53 ** KEPT (pick-wt=2): 10 [] -p(c_2Ebool_2EF).
% 2.36/2.53 ** KEPT (pick-wt=16): 11 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(A)|p(B).
% 2.36/2.53 ** KEPT (pick-wt=14): 12 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))|p(A).
% 2.36/2.53 ** KEPT (pick-wt=14): 13 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Emin_2E_3D_3D_3E,A),B))| -p(B).
% 2.36/2.53 ** KEPT (pick-wt=16): 14 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_5C_2F,A),B))|p(A)|p(B).
% 2.36/2.53 ** KEPT (pick-wt=14): 15 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,A),B))| -p(A).
% 2.36/2.53 ** KEPT (pick-wt=14): 16 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_5C_2F,A),B))| -p(B).
% 2.36/2.53 ** KEPT (pick-wt=14): 17 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(A).
% 2.36/2.53 ** KEPT (pick-wt=14): 18 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(B).
% 2.36/2.53 ** KEPT (pick-wt=16): 19 [] -mem(A,bool)| -mem(B,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,A),B))| -p(A)| -p(B).
% 2.36/2.53 ** KEPT (pick-wt=9): 20 [] -mem(A,bool)| -p(ap(c_2Ebool_2E_7E,A))| -p(A).
% 2.36/2.53 ** KEPT (pick-wt=9): 21 [] -mem(A,bool)|p(ap(c_2Ebool_2E_7E,A))|p(A).
% 2.36/2.53 ** KEPT (pick-wt=10): 22 [] -ne(A)|mem(c_2Emin_2E_3D(A),arr(A,arr(A,bool))).
% 2.36/2.53 ** 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.
% 2.36/2.53 ** 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.
% 2.36/2.53 ** KEPT (pick-wt=10): 25 [] -ne(A)|mem(c_2Ebool_2E_21(A),arr(arr(A,bool),bool)).
% 2.36/2.53 ** 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)).
% 2.36/2.53 ** 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).
% 2.36/2.53 ** 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))).
% 2.36/2.53 ** KEPT (pick-wt=12): 29 [] -ne(A)| -mem(B,bool)|mem($f3(A,B),A)|p(B).
% 2.36/2.53 ** KEPT (pick-wt=8): 31 [copy,30,propositional] -ne(A)| -mem(B,A)|B=B.
% 2.36/2.53 ** KEPT (pick-wt=30): 32 [] -ne(A)| -ne(B)| -mem(C,arr(A,bool))| -mem(D,arr(B,bool))|p(ap(ap(c_2Ecardinal_2Ecardle_q(A,B),C),D))|p(ap(ap(c_2Ecardinal_2Ecardle_q(B,A),D),C)).
% 2.36/2.53
% 2.36/2.53 ------------> process sos:
% 2.36/2.53 ** KEPT (pick-wt=3): 48 [] A=A.
% 2.36/2.53 ** KEPT (pick-wt=2): 49 [] ne(bool).
% 2.36/2.53 ** KEPT (pick-wt=2): 50 [] ne(ind).
% 2.36/2.53 ** KEPT (pick-wt=3): 51 [] mem(c_2Ebool_2ET,bool).
% 2.36/2.53 ** KEPT (pick-wt=2): 52 [] p(c_2Ebool_2ET).
% 2.36/2.53 ** KEPT (pick-wt=3): 53 [] mem(c_2Ebool_2EF,bool).
% 2.36/2.53 ** KEPT (pick-wt=7): 54 [] mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))).
% 2.36/2.53 ** KEPT (pick-wt=7): 55 [] mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))).
% 2.36/2.53 ** KEPT (pick-wt=7): 56 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.36/2.53 ** KEPT (pick-wt=5): 57 [] mem(c_2Ebool_2E_7E,arr(bool,bool)).
% 2.36/2.53 ** KEPT (pick-wt=0): 58 [] $F.
% 2.36/2.53
% 2.36/2.53 -----> EMPTY CLAUSE at 0.00 sec ----> 58 [] $F.
% 2.36/2.53
% 2.36/2.53 Length of proof is -1. Level of proof is -1.
% 2.36/2.53
% 2.36/2.53 ---------------- PROOF ----------------
% 2.36/2.53 % SZS status Theorem
% 2.36/2.53 % SZS output start Refutation
% See solution above
% 2.36/2.53 ------------ end of proof -------------
% 2.36/2.53
% 2.36/2.53
% 2.36/2.53 Search stopped by max_proofs option.
% 2.36/2.53
% 2.36/2.53
% 2.36/2.53 Search stopped by max_proofs option.
% 2.36/2.53
% 2.36/2.53 ============ end of search ============
% 2.36/2.53
% 2.36/2.53 -------------- statistics -------------
% 2.36/2.53 clauses given 0
% 2.36/2.53 clauses generated 26
% 2.36/2.53 clauses kept 56
% 2.36/2.53 clauses forward subsumed 10
% 2.36/2.53 clauses back subsumed 0
% 2.36/2.53 Kbytes malloced 976
% 2.36/2.53
% 2.36/2.53 ----------- times (seconds) -----------
% 2.36/2.53 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.36/2.53 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.36/2.53 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.36/2.53
% 2.36/2.53 That finishes the proof of the theorem.
% 2.36/2.53
% 2.36/2.53 Process 27014 finished Wed Jul 27 02:52:48 2022
% 2.36/2.53 Otter interrupted
% 2.36/2.53 PROOF FOUND
%------------------------------------------------------------------------------