TSTP Solution File: ITP002+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ITP002+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:52 EDT 2022
% Result : Unknown 20.27s 20.43s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ITP002+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.35 % Computer : n021.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Wed Jul 27 02:40:53 EDT 2022
% 0.12/0.35 % CPUTime :
% 2.00/2.19 ----- Otter 3.3f, August 2004 -----
% 2.00/2.19 The process was started by sandbox on n021.cluster.edu,
% 2.00/2.19 Wed Jul 27 02:40:53 2022
% 2.00/2.19 The command was "./otter". The process ID is 10850.
% 2.00/2.19
% 2.00/2.19 set(prolog_style_variables).
% 2.00/2.19 set(auto).
% 2.00/2.19 dependent: set(auto1).
% 2.00/2.19 dependent: set(process_input).
% 2.00/2.19 dependent: clear(print_kept).
% 2.00/2.19 dependent: clear(print_new_demod).
% 2.00/2.19 dependent: clear(print_back_demod).
% 2.00/2.19 dependent: clear(print_back_sub).
% 2.00/2.19 dependent: set(control_memory).
% 2.00/2.19 dependent: assign(max_mem, 12000).
% 2.00/2.19 dependent: assign(pick_given_ratio, 4).
% 2.00/2.19 dependent: assign(stats_level, 1).
% 2.00/2.19 dependent: assign(max_seconds, 10800).
% 2.00/2.19 clear(print_given).
% 2.00/2.19
% 2.00/2.19 formula_list(usable).
% 2.00/2.19 all A (A=A).
% 2.00/2.19 ne(bool).
% 2.00/2.19 ne(ind).
% 2.00/2.19 all A (ne(A)-> (all B (ne(B)->ne(arr(A,B))))).
% 2.00/2.19 all A B F (mem(F,arr(A,B))-> (all X (mem(X,A)->mem(ap(F,X),B)))).
% 2.00/2.19 all Q (mem(Q,bool)-> (all R (mem(R,bool)-> ((p(Q)<->p(R))->Q=R)))).
% 2.00/2.19 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.00/2.19 all A Y X (mem(X,A)->ap(k(A,Y),X)=Y).
% 2.00/2.19 all A X (mem(X,A)->ap(i(A),X)=X).
% 2.00/2.19 mem(c_2Ebool_2EF,bool).
% 2.00/2.19 -p(c_2Ebool_2EF).
% 2.00/2.19 mem(c_2Ebool_2ET,bool).
% 2.00/2.19 p(c_2Ebool_2ET).
% 2.00/2.19 all A0 (ne(A0)->ne(ty_2Eoption_2Eoption(A0))).
% 2.00/2.19 all A_27a (ne(A_27a)->mem(c_2Eoption_2ENONE(A_27a),ty_2Eoption_2Eoption(A_27a))).
% 2.00/2.19 all A_27a (ne(A_27a)->mem(c_2Eoption_2ETHE(A_27a),arr(ty_2Eoption_2Eoption(A_27a),A_27a))).
% 2.00/2.19 all A_27a (ne(A_27a)->mem(c_2Eoption_2ESOME(A_27a),arr(A_27a,ty_2Eoption_2Eoption(A_27a)))).
% 2.00/2.19 all A_27a (ne(A_27a)->mem(c_2Eoption_2EIS__SOME(A_27a),arr(ty_2Eoption_2Eoption(A_27a),bool))).
% 2.00/2.19 mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.00/2.19 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.00/2.19 all A_27a (ne(A_27a)->mem(c_2Ebool_2ECOND(A_27a),arr(bool,arr(A_27a,arr(A_27a,A_27a))))).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all A_27c (ne(A_27c)->mem(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),arr(arr(A_27b,arr(A_27c,A_27a)),arr(ty_2Eoption_2Eoption(A_27b),arr(ty_2Eoption_2Eoption(A_27c),ty_2Eoption_2Eoption(A_27a)))))))))).
% 2.00/2.19 all A_27a (ne(A_27a)->mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool)))).
% 2.00/2.19 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.00/2.19 all A_27a (ne(A_27a)->mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool))).
% 2.00/2.19 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.00/2.19 $T.
% 2.00/2.19 all V0t (mem(V0t,bool)-> (p(V0t)<->p(V0t))& (p(V0t)<->p(V0t))& ($F&p(V0t)<->$F)& (p(V0t)&$F<->$F)& (p(V0t)&p(V0t)<->p(V0t))).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)-> (V0x=V0x<->$T)))).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all V0t1 (mem(V0t1,A_27a)-> (all V1t2 (mem(V1t2,A_27a)->ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2ET),V0t1),V1t2)=V0t1&ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2EF),V0t1),V1t2)=V1t2))))).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)-> (all V1y (mem(V1y,A_27a)-> (ap(c_2Eoption_2ESOME(A_27a),V0x)=ap(c_2Eoption_2ESOME(A_27a),V1y)<->V0x=V1y)))))).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)-> (p(ap(c_2Eoption_2EIS__SOME(A_27a),ap(c_2Eoption_2ESOME(A_27a),V0x)))<->$T)))& (p(ap(c_2Eoption_2EIS__SOME(A_27a),c_2Eoption_2ENONE(A_27a)))<->$F)).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all V0x (mem(V0x,A_27a)->ap(c_2Eoption_2ETHE(A_27a),ap(c_2Eoption_2ESOME(A_27a),V0x))=V0x))).
% 2.00/2.19 all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all A_27c (ne(A_27c)-> (all V0f (mem(V0f,arr(A_27b,arr(A_27c,A_27a)))-> (all V1x (mem(V1x,ty_2Eoption_2Eoption(A_27b))-> (all V2y (mem(V2y,ty_2Eoption_2Eoption(A_27c))->ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),V0f),V1x),V2y)=ap(ap(ap(c_2Ebool_2ECOND(ty_2Eoption_2Eoption(A_27a)),ap(ap(c_2Ebool_2E_2F_5C,ap(c_2Eoption_2EIS__SOME(A_27b),V1x)),ap(c_2Eoption_2EIS__SOME(A_27c),V2y))),ap(c_2Eoption_2ESOME(A_27a),ap(ap(V0f,ap(c_2Eoption_2ETHE(A_27b),V1x)),ap(c_2Eoption_2ETHE(A_27c),V2y)))),c_2Eoption_2ENONE(A_27a))))))))))))).
% 2.00/2.19 -(all A_27a (ne(A_27a)-> (all A_27b (ne(A_27b)-> (all A_27c (ne(A_27c)-> (all V0f (mem(V0f,arr(A_27b,arr(A_27c,A_27a)))-> (all V1x (mem(V1x,A_27b)-> (all V2y (mem(V2y,A_27c)->ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),V0f),ap(c_2Eoption_2ESOME(A_27b),V1x)),ap(c_2Eoption_2ESOME(A_27c),V2y))=ap(c_2Eoption_2ESOME(A_27a),ap(ap(V0f,V1x),V2y))&ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),V0f),ap(c_2Eoption_2ESOME(A_27b),V1x)),c_2Eoption_2ENONE(A_27c))=c_2Eoption_2ENONE(A_27a)&ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),V0f),c_2Eoption_2ENONE(A_27b)),ap(c_2Eoption_2ESOME(A_27c),V2y))=c_2Eoption_2ENONE(A_27a)&ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),V0f),c_2Eoption_2ENONE(A_27b)),c_2Eoption_2ENONE(A_27c))=c_2Eoption_2ENONE(A_27a))))))))))))).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 -------> usable clausifies to:
% 2.00/2.19
% 2.00/2.19 list(usable).
% 2.00/2.19 0 [] A=A.
% 2.00/2.19 0 [] ne(bool).
% 2.00/2.19 0 [] ne(ind).
% 2.00/2.19 0 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.00/2.19 0 [] -mem(F,arr(A,B))| -mem(X,A)|mem(ap(F,X),B).
% 2.00/2.19 0 [] -mem(Q,bool)| -mem(R,bool)|p(Q)|p(R)|Q=R.
% 2.00/2.19 0 [] -mem(Q,bool)| -mem(R,bool)| -p(Q)| -p(R)|Q=R.
% 2.00/2.19 0 [] -mem(F,arr(A,B))| -mem(G,arr(A,B))|mem($f1(A,B,F,G),A)|F=G.
% 2.00/2.19 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.00/2.19 0 [] -mem(X,A)|ap(k(A,Y),X)=Y.
% 2.00/2.19 0 [] -mem(X,A)|ap(i(A),X)=X.
% 2.00/2.19 0 [] mem(c_2Ebool_2EF,bool).
% 2.00/2.19 0 [] -p(c_2Ebool_2EF).
% 2.00/2.19 0 [] mem(c_2Ebool_2ET,bool).
% 2.00/2.19 0 [] p(c_2Ebool_2ET).
% 2.00/2.19 0 [] -ne(A0)|ne(ty_2Eoption_2Eoption(A0)).
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Eoption_2ENONE(A_27a),ty_2Eoption_2Eoption(A_27a)).
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Eoption_2ETHE(A_27a),arr(ty_2Eoption_2Eoption(A_27a),A_27a)).
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Eoption_2ESOME(A_27a),arr(A_27a,ty_2Eoption_2Eoption(A_27a))).
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Eoption_2EIS__SOME(A_27a),arr(ty_2Eoption_2Eoption(A_27a),bool)).
% 2.00/2.19 0 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 2.00/2.19 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(Q).
% 2.00/2.19 0 [] -mem(Q,bool)| -mem(R,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))|p(R).
% 2.00/2.19 0 [] -mem(Q,bool)| -mem(R,bool)|p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))| -p(Q)| -p(R).
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Ebool_2ECOND(A_27a),arr(bool,arr(A_27a,arr(A_27a,A_27a)))).
% 2.00/2.19 0 [] -ne(A_27a)| -ne(A_27b)| -ne(A_27c)|mem(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),arr(arr(A_27b,arr(A_27c,A_27a)),arr(ty_2Eoption_2Eoption(A_27b),arr(ty_2Eoption_2Eoption(A_27c),ty_2Eoption_2Eoption(A_27a))))).
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))).
% 2.00/2.19 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)| -p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X=Y.
% 2.00/2.19 0 [] -ne(A)| -mem(X,A)| -mem(Y,A)|p(ap(ap(c_2Emin_2E_3D(A),X),Y))|X!=Y.
% 2.00/2.19 0 [] -ne(A_27a)|mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)).
% 2.00/2.19 0 [] -ne(A)| -mem(Q,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),Q))| -mem(X,A)|p(ap(Q,X)).
% 2.00/2.19 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))|mem($f2(A,Q),A).
% 2.00/2.19 0 [] -ne(A)| -mem(Q,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),Q))| -p(ap(Q,$f2(A,Q))).
% 2.00/2.19 0 [] $T.
% 2.00/2.19 0 [] -mem(V0t,bool)|p(V0t)| -$F.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)|V0x!=V0x|$T.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)|V0x=V0x| -$T.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0t1,A_27a)| -mem(V1t2,A_27a)|ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2ET),V0t1),V1t2)=V0t1.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0t1,A_27a)| -mem(V1t2,A_27a)|ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2EF),V0t1),V1t2)=V1t2.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -mem(V1y,A_27a)|ap(c_2Eoption_2ESOME(A_27a),V0x)!=ap(c_2Eoption_2ESOME(A_27a),V1y)|V0x=V1y.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -mem(V1y,A_27a)|ap(c_2Eoption_2ESOME(A_27a),V0x)=ap(c_2Eoption_2ESOME(A_27a),V1y)|V0x!=V1y.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)| -p(ap(c_2Eoption_2EIS__SOME(A_27a),ap(c_2Eoption_2ESOME(A_27a),V0x)))|$T.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)|p(ap(c_2Eoption_2EIS__SOME(A_27a),ap(c_2Eoption_2ESOME(A_27a),V0x)))| -$T.
% 2.00/2.19 0 [] -ne(A_27a)| -p(ap(c_2Eoption_2EIS__SOME(A_27a),c_2Eoption_2ENONE(A_27a)))|$F.
% 2.00/2.19 0 [] -ne(A_27a)|p(ap(c_2Eoption_2EIS__SOME(A_27a),c_2Eoption_2ENONE(A_27a)))| -$F.
% 2.00/2.19 0 [] -ne(A_27a)| -mem(V0x,A_27a)|ap(c_2Eoption_2ETHE(A_27a),ap(c_2Eoption_2ESOME(A_27a),V0x))=V0x.
% 2.00/2.19 0 [] -ne(A_27a)| -ne(A_27b)| -ne(A_27c)| -mem(V0f,arr(A_27b,arr(A_27c,A_27a)))| -mem(V1x,ty_2Eoption_2Eoption(A_27b))| -mem(V2y,ty_2Eoption_2Eoption(A_27c))|ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A_27a,A_27b,A_27c),V0f),V1x),V2y)=ap(ap(ap(c_2Ebool_2ECOND(ty_2Eoption_2Eoption(A_27a)),ap(ap(c_2Ebool_2E_2F_5C,ap(c_2Eoption_2EIS__SOME(A_27b),V1x)),ap(c_2Eoption_2EIS__SOME(A_27c),V2y))),ap(c_2Eoption_2ESOME(A_27a),ap(ap(V0f,ap(c_2Eoption_2ETHE(A_27b),V1x)),ap(c_2Eoption_2ETHE(A_27c),V2y)))),c_2Eoption_2ENONE(A_27a)).
% 2.00/2.19 0 [] ne($c6).
% 2.00/2.19 0 [] ne($c5).
% 2.00/2.19 0 [] ne($c4).
% 2.00/2.19 0 [] mem($c3,arr($c5,arr($c4,$c6))).
% 2.00/2.19 0 [] mem($c2,$c5).
% 2.00/2.19 0 [] mem($c1,$c4).
% 2.00/2.19 0 [] ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),ap(c_2Eoption_2ESOME($c5),$c2)),ap(c_2Eoption_2ESOME($c4),$c1))!=ap(c_2Eoption_2ESOME($c6),ap(ap($c3,$c2),$c1))|ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),ap(c_2Eoption_2ESOME($c5),$c2)),c_2Eoption_2ENONE($c4))!=c_2Eoption_2ENONE($c6)|ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),c_2Eoption_2ENONE($c5)),ap(c_2Eoption_2ESOME($c4),$c1))!=c_2Eoption_2ENONE($c6)|ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),c_2Eoption_2ENONE($c5)),c_2Eoption_2ENONE($c4))!=c_2Eoption_2ENONE($c6).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.00/2.19
% 2.00/2.19 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.19 deletion, with positive clauses in sos and nonpositive
% 2.00/2.19 clauses in usable.
% 2.00/2.19
% 2.00/2.19 dependent: set(knuth_bendix).
% 2.00/2.19 dependent: set(anl_eq).
% 2.00/2.19 dependent: set(para_from).
% 2.00/2.19 dependent: set(para_into).
% 2.00/2.19 dependent: clear(para_from_right).
% 2.00/2.19 dependent: clear(para_into_right).
% 2.00/2.19 dependent: set(para_from_vars).
% 2.00/2.19 dependent: set(eq_units_both_ways).
% 2.00/2.19 dependent: set(dynamic_demod_all).
% 2.00/2.19 dependent: set(dynamic_demod).
% 2.00/2.19 dependent: set(order_eq).
% 2.00/2.19 dependent: set(back_demod).
% 2.00/2.19 dependent: set(lrpo).
% 2.00/2.19 dependent: set(hyper_res).
% 2.00/2.19 dependent: set(unit_deletion).
% 2.00/2.19 dependent: set(factor).
% 2.00/2.19
% 2.00/2.19 ------------> process usable:
% 2.00/2.19 ** KEPT (pick-wt=8): 1 [] -ne(A)| -ne(B)|ne(arr(A,B)).
% 2.00/2.19 ** KEPT (pick-wt=13): 2 [] -mem(A,arr(B,C))| -mem(D,B)|mem(ap(A,D),C).
% 2.00/2.19 ** KEPT (pick-wt=13): 3 [] -mem(A,bool)| -mem(B,bool)|p(A)|p(B)|A=B.
% 2.00/2.19 ** KEPT (pick-wt=13): 4 [] -mem(A,bool)| -mem(B,bool)| -p(A)| -p(B)|A=B.
% 2.00/2.19 ** 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.00/2.19 ** 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.00/2.19 ** KEPT (pick-wt=10): 7 [] -mem(A,B)|ap(k(B,C),A)=C.
% 2.00/2.19 ** KEPT (pick-wt=9): 8 [] -mem(A,B)|ap(i(B),A)=A.
% 2.00/2.19 ** KEPT (pick-wt=2): 9 [] -p(c_2Ebool_2EF).
% 2.00/2.19 ** KEPT (pick-wt=5): 10 [] -ne(A)|ne(ty_2Eoption_2Eoption(A)).
% 2.00/2.19 ** KEPT (pick-wt=7): 11 [] -ne(A)|mem(c_2Eoption_2ENONE(A),ty_2Eoption_2Eoption(A)).
% 2.00/2.19 ** KEPT (pick-wt=9): 12 [] -ne(A)|mem(c_2Eoption_2ETHE(A),arr(ty_2Eoption_2Eoption(A),A)).
% 2.00/2.19 ** KEPT (pick-wt=9): 13 [] -ne(A)|mem(c_2Eoption_2ESOME(A),arr(A,ty_2Eoption_2Eoption(A))).
% 2.00/2.19 ** KEPT (pick-wt=9): 14 [] -ne(A)|mem(c_2Eoption_2EIS__SOME(A),arr(ty_2Eoption_2Eoption(A),bool)).
% 2.00/2.19 ** KEPT (pick-wt=14): 15 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(A).
% 2.00/2.19 ** KEPT (pick-wt=14): 16 [] -mem(A,bool)| -mem(B,bool)| -p(ap(ap(c_2Ebool_2E_2F_5C,A),B))|p(B).
% 2.00/2.19 ** 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).
% 2.00/2.19 ** KEPT (pick-wt=12): 18 [] -ne(A)|mem(c_2Ebool_2ECOND(A),arr(bool,arr(A,arr(A,A)))).
% 2.00/2.19 ** KEPT (pick-wt=25): 19 [] -ne(A)| -ne(B)| -ne(C)|mem(c_2Eoption_2EOPTION__MAP2(A,B,C),arr(arr(B,arr(C,A)),arr(ty_2Eoption_2Eoption(B),arr(ty_2Eoption_2Eoption(C),ty_2Eoption_2Eoption(A))))).
% 2.00/2.19 ** KEPT (pick-wt=10): 20 [] -ne(A)|mem(c_2Emin_2E_3D(A),arr(A,arr(A,bool))).
% 2.00/2.19 ** KEPT (pick-wt=18): 21 [] -ne(A)| -mem(B,A)| -mem(C,A)| -p(ap(ap(c_2Emin_2E_3D(A),B),C))|B=C.
% 2.00/2.19 ** KEPT (pick-wt=18): 22 [] -ne(A)| -mem(B,A)| -mem(C,A)|p(ap(ap(c_2Emin_2E_3D(A),B),C))|B!=C.
% 2.00/2.19 ** KEPT (pick-wt=10): 23 [] -ne(A)|mem(c_2Ebool_2E_21(A),arr(arr(A,bool),bool)).
% 2.00/2.19 ** KEPT (pick-wt=19): 24 [] -ne(A)| -mem(B,arr(A,bool))| -p(ap(c_2Ebool_2E_21(A),B))| -mem(C,A)|p(ap(B,C)).
% 2.00/2.19 ** KEPT (pick-wt=17): 25 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))|mem($f2(A,B),A).
% 2.00/2.19 ** KEPT (pick-wt=18): 26 [] -ne(A)| -mem(B,arr(A,bool))|p(ap(c_2Ebool_2E_21(A),B))| -p(ap(B,$f2(A,B))).
% 2.00/2.19 ** KEPT (pick-wt=8): 28 [copy,27,propositional] -ne(A)| -mem(B,A)|B=B.
% 2.00/2.19 ** KEPT (pick-wt=18): 29 [] -ne(A)| -mem(B,A)| -mem(C,A)|ap(ap(ap(c_2Ebool_2ECOND(A),c_2Ebool_2ET),B),C)=B.
% 20.27/20.43 ** KEPT (pick-wt=18): 30 [] -ne(A)| -mem(B,A)| -mem(C,A)|ap(ap(ap(c_2Ebool_2ECOND(A),c_2Ebool_2EF),B),C)=C.
% 20.27/20.43 ** KEPT (pick-wt=20): 31 [] -ne(A)| -mem(B,A)| -mem(C,A)|ap(c_2Eoption_2ESOME(A),B)!=ap(c_2Eoption_2ESOME(A),C)|B=C.
% 20.27/20.43 ** KEPT (pick-wt=20): 32 [] -ne(A)| -mem(B,A)| -mem(C,A)|ap(c_2Eoption_2ESOME(A),B)=ap(c_2Eoption_2ESOME(A),C)|B!=C.
% 20.27/20.43 ** KEPT (pick-wt=13): 34 [copy,33,propositional] -ne(A)| -mem(B,A)|p(ap(c_2Eoption_2EIS__SOME(A),ap(c_2Eoption_2ESOME(A),B))).
% 20.27/20.43 ** KEPT (pick-wt=8): 36 [copy,35,propositional] -ne(A)| -p(ap(c_2Eoption_2EIS__SOME(A),c_2Eoption_2ENONE(A))).
% 20.27/20.43 ** KEPT (pick-wt=14): 37 [] -ne(A)| -mem(B,A)|ap(c_2Eoption_2ETHE(A),ap(c_2Eoption_2ESOME(A),B))=B.
% 20.27/20.43 ** KEPT (pick-wt=65): 38 [] -ne(A)| -ne(B)| -ne(C)| -mem(D,arr(B,arr(C,A)))| -mem(E,ty_2Eoption_2Eoption(B))| -mem(F,ty_2Eoption_2Eoption(C))|ap(ap(ap(c_2Eoption_2EOPTION__MAP2(A,B,C),D),E),F)=ap(ap(ap(c_2Ebool_2ECOND(ty_2Eoption_2Eoption(A)),ap(ap(c_2Ebool_2E_2F_5C,ap(c_2Eoption_2EIS__SOME(B),E)),ap(c_2Eoption_2EIS__SOME(C),F))),ap(c_2Eoption_2ESOME(A),ap(ap(D,ap(c_2Eoption_2ETHE(B),E)),ap(c_2Eoption_2ETHE(C),F)))),c_2Eoption_2ENONE(A)).
% 20.27/20.43 ** KEPT (pick-wt=74): 40 [copy,39,flip.1,flip.4] ap(c_2Eoption_2ESOME($c6),ap(ap($c3,$c2),$c1))!=ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),ap(c_2Eoption_2ESOME($c5),$c2)),ap(c_2Eoption_2ESOME($c4),$c1))|ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),ap(c_2Eoption_2ESOME($c5),$c2)),c_2Eoption_2ENONE($c4))!=c_2Eoption_2ENONE($c6)|ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),c_2Eoption_2ENONE($c5)),ap(c_2Eoption_2ESOME($c4),$c1))!=c_2Eoption_2ENONE($c6)|c_2Eoption_2ENONE($c6)!=ap(ap(ap(c_2Eoption_2EOPTION__MAP2($c6,$c5,$c4),$c3),c_2Eoption_2ENONE($c5)),c_2Eoption_2ENONE($c4)).
% 20.27/20.43
% 20.27/20.43 ------------> process sos:
% 20.27/20.43 ** KEPT (pick-wt=3): 62 [] A=A.
% 20.27/20.43 ** KEPT (pick-wt=2): 63 [] ne(bool).
% 20.27/20.43 ** KEPT (pick-wt=2): 64 [] ne(ind).
% 20.27/20.43 ** KEPT (pick-wt=3): 65 [] mem(c_2Ebool_2EF,bool).
% 20.27/20.43 ** KEPT (pick-wt=3): 66 [] mem(c_2Ebool_2ET,bool).
% 20.27/20.43 ** KEPT (pick-wt=2): 67 [] p(c_2Ebool_2ET).
% 20.27/20.43 ** KEPT (pick-wt=7): 68 [] mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))).
% 20.27/20.43 ** KEPT (pick-wt=2): 69 [] ne($c6).
% 20.27/20.43 ** KEPT (pick-wt=2): 70 [] ne($c5).
% 20.27/20.43 ** KEPT (pick-wt=2): 71 [] ne($c4).
% 20.27/20.43 ** KEPT (pick-wt=7): 72 [] mem($c3,arr($c5,arr($c4,$c6))).
% 20.27/20.43 ** KEPT (pick-wt=3): 73 [] mem($c2,$c5).
% 20.27/20.43 ** KEPT (pick-wt=3): 74 [] mem($c1,$c4).
% 20.27/20.43 Following clause subsumed by 62 during input processing: 0 [copy,62,flip.1] A=A.
% 20.27/20.43 62 back subsumes 54.
% 20.27/20.43 62 back subsumes 45.
% 20.27/20.43 62 back subsumes 44.
% 20.27/20.43 62 back subsumes 43.
% 20.27/20.43 62 back subsumes 42.
% 20.27/20.43 62 back subsumes 28.
% 20.27/20.43
% 20.27/20.43 ======= end of input processing =======
% 20.27/20.43
% 20.27/20.43 =========== start of search ===========
% 20.27/20.43
% 20.27/20.43
% 20.27/20.43 Resetting weight limit to 5.
% 20.27/20.43
% 20.27/20.43
% 20.27/20.43 Resetting weight limit to 5.
% 20.27/20.43
% 20.27/20.43 sos_size=1115
% 20.27/20.43
% 20.27/20.43 Search stopped because sos empty.
% 20.27/20.43
% 20.27/20.43
% 20.27/20.43 Search stopped because sos empty.
% 20.27/20.43
% 20.27/20.43 ============ end of search ============
% 20.27/20.43
% 20.27/20.43 -------------- statistics -------------
% 20.27/20.43 clauses given 1174
% 20.27/20.43 clauses generated 2738097
% 20.27/20.43 clauses kept 1231
% 20.27/20.43 clauses forward subsumed 999
% 20.27/20.43 clauses back subsumed 6
% 20.27/20.43 Kbytes malloced 6835
% 20.27/20.43
% 20.27/20.43 ----------- times (seconds) -----------
% 20.27/20.43 user CPU time 18.23 (0 hr, 0 min, 18 sec)
% 20.27/20.43 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 20.27/20.43 wall-clock time 20 (0 hr, 0 min, 20 sec)
% 20.27/20.43
% 20.27/20.43 Process 10850 finished Wed Jul 27 02:41:13 2022
% 20.27/20.43 Otter interrupted
% 20.27/20.43 PROOF NOT FOUND
%------------------------------------------------------------------------------