0.03/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.29	% Computer   : n005.cluster.edu
0.09/0.29	% Model      : x86_64 x86_64
0.09/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory     : 8042.1875MB
0.09/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1200
0.09/0.29	% DateTime   : Tue Jul 13 15:51:18 EDT 2021
0.14/0.29	% CPUTime    : 
0.71/1.03	============================== Prover9 ===============================
0.71/1.03	Prover9 (32) version 2009-11A, November 2009.
0.71/1.03	Process 11395 was started by sandbox2 on n005.cluster.edu,
0.71/1.03	Tue Jul 13 15:51:19 2021
0.71/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_11242_n005.cluster.edu".
0.71/1.03	============================== end of head ===========================
0.71/1.03	
0.71/1.03	============================== INPUT =================================
0.71/1.03	
0.71/1.03	% Reading from file /tmp/Prover9_11242_n005.cluster.edu
0.71/1.03	
0.71/1.03	set(prolog_style_variables).
0.71/1.03	set(auto2).
0.71/1.03	    % set(auto2) -> set(auto).
0.71/1.03	    % set(auto) -> set(auto_inference).
0.71/1.03	    % set(auto) -> set(auto_setup).
0.71/1.03	    % set(auto_setup) -> set(predicate_elim).
0.71/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.71/1.03	    % set(auto) -> set(auto_limits).
0.71/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.71/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.71/1.03	    % set(auto) -> set(auto_denials).
0.71/1.03	    % set(auto) -> set(auto_process).
0.71/1.03	    % set(auto2) -> assign(new_constants, 1).
0.71/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.71/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.71/1.03	    % set(auto2) -> assign(max_hours, 1).
0.71/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.71/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.71/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.71/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.71/1.03	    % set(auto2) -> set(sort_initial_sos).
0.71/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.71/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.71/1.03	    % set(auto2) -> assign(max_megs, 400).
0.71/1.03	    % set(auto2) -> assign(stats, some).
0.71/1.03	    % set(auto2) -> clear(echo_input).
0.71/1.03	    % set(auto2) -> set(quiet).
0.71/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.71/1.03	    % set(auto2) -> clear(print_given).
0.71/1.03	assign(lrs_ticks,-1).
0.71/1.03	assign(sos_limit,10000).
0.71/1.03	assign(order,kbo).
0.71/1.03	set(lex_order_vars).
0.71/1.03	clear(print_given).
0.71/1.03	
0.71/1.03	% formulas(sos).  % not echoed (65 formulas)
0.71/1.03	
0.71/1.03	============================== end of input ==========================
0.71/1.03	
0.71/1.03	% From the command line: assign(max_seconds, 1200).
0.71/1.03	
0.71/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.71/1.03	
0.71/1.03	% Formulas that are not ordinary clauses:
0.71/1.03	1 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(R) <-> p(Q)) -> Q = R))))) # label(boolext) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	2 (all A all B all F (mem(F,arr(A,B)) -> (all G (mem(G,arr(A,B)) -> ((all X (mem(X,A) -> ap(G,X) = ap(F,X))) -> F = G))))) # label(funcext) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	3 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	4 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	5 (all A all B all F (mem(F,arr(A,B)) -> (all X (mem(X,A) -> mem(ap(F,X),B))))) # label(ap_tp) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	6 (all A all Y all X (mem(X,A) -> ap(k(A,Y),X) = Y)) # label(kbeta) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	7 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> ((-p(V1q) <-> p(V0p)) <-> (-p(V1q) | -p(V0p)) & (p(V1q) | p(V0p))))))) # label(conj_thm_2Esat_2Edc__neg) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	8 (all A0 (ne(A0) -> (all A1 (ne(A1) -> ne(ty_2Epair_2Eprod(A0,A1)))))) # label(ne_ty_2Epair_2Eprod) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	9 (all A_27a (ne(A_27a) -> (all V0Q (mem(V0Q,bool) -> (all V1P (mem(V1P,arr(A_27a,bool)) -> ((all V3x (mem(V3x,A_27a) -> p(ap(V1P,V3x)))) | p(V0Q) <-> (all V2x (mem(V2x,A_27a) -> p(V0Q) | p(ap(V1P,V2x))))))))))) # label(conj_thm_2Ebool_2ELEFT__FORALL__OR__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	10 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,bool) -> (all V1Q (mem(V1Q,arr(A_27a,bool)) -> ((exists V3x (mem(V3x,A_27a) & (p(V0P) | p(ap(V1Q,V3x))))) <-> p(V0P) | (exists V2x (p(ap(V1Q,V2x)) & mem(V2x,A_27a)))))))))) # label(conj_thm_2Ebool_2ERIGHT__OR__EXISTS__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	11 (all V0t (mem(V0t,bool) -> (-p(V0t) -> -p(V0t)))) # label(conj_thm_2Ebool_2EIMP__F) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	12 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((-p(V1q) | -p(V0p) | p(V2r)) & (p(V0p) | -p(V2r)) & (p(V0p) | p(V1q)) <-> (p(V0p) <-> (p(V1q) -> p(V2r)))))))))) # label(conj_thm_2Esat_2Edc__imp) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	13 (all A (ne(A) -> (all X (mem(X,A) -> (all Y (mem(Y,A) -> (Y = X <-> p(ap(ap(c_2Emin_2E_3D(A),X),Y))))))))) # label(ax_eq_p) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	14 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> (all V1y (mem(V1y,A_27a) -> (V0x = V1y <-> V0x = V1y))))))) # label(conj_thm_2Ebool_2EEQ__SYM__EQ) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	15 (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)) -> ((exists V3g (p(ap(ap(ap(c_2Epred__set_2EBIJ(A_27b,A_27a),V3g),V1t),V0s)) & mem(V3g,arr(A_27b,A_27a)))) <-> (exists V2f (p(ap(ap(ap(c_2Epred__set_2EBIJ(A_27a,A_27b),V2f),V0s),V1t)) & mem(V2f,arr(A_27a,A_27b))))))))))))) # label(conj_thm_2Epred__set_2EBIJ__SYM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	16 (exists V0f (mem(V0f,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum)) & p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),V0f),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))) # label(conj_thm_2Eutil__prob_2ENUM__2D__BIJ) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	17 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(ap(ap(c_2Ebool_2E_2F_5C,Q),R)) <-> p(R) & p(Q)))))) # label(ax_and_p) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	18 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,bool) -> (all V1Q (mem(V1Q,arr(A_27a,bool)) -> ((exists V2x (mem(V2x,A_27a) & p(ap(V1Q,V2x)) & p(V0P))) <-> p(V0P) & (exists V3x (p(ap(V1Q,V3x)) & mem(V3x,A_27a)))))))))) # label(conj_thm_2Ebool_2ERIGHT__EXISTS__AND__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	19 (all V0A (mem(V0A,bool) -> (p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV__IMP) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	20 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V1q) | p(V2r) | p(V0p)) & (-p(V2r) | -p(V1q) | p(V0p)) & (p(V1q) | -p(V0p) | -p(V2r)) & (p(V2r) | -p(V1q) | -p(V0p)) <-> ((p(V1q) <-> p(V2r)) <-> p(V0p))))))))) # label(conj_thm_2Esat_2Edc__eq) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	21 (all V0t (mem(V0t,bool) -> (-p(V0t) -> -p(V0t)))) # label(conj_thm_2Ebool_2EF__IMP) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	22 (all V0A (mem(V0A,bool) -> (--p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV2) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	23 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2E_3F(A_27a),arr(arr(A_27a,bool),bool)))) # label(mem_c_2Ebool_2E_3F) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	24 (all A_27a (ne(A_27a) -> mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))))) # label(mem_c_2Emin_2E_3D) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	25 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V2r) & p(V1q) <-> p(V0p)) <-> (p(V2r) | -p(V0p)) & (p(V1q) | -p(V0p)) & (-p(V2r) | -p(V1q) | p(V0p))))))))) # label(conj_thm_2Esat_2Edc__conj) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	26 (all Q (mem(Q,bool) -> (-p(Q) <-> p(ap(c_2Ebool_2E_7E,Q))))) # label(ax_neg_p) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	27 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Epred__set_2EBIJ(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27a,bool),arr(arr(A_27b,bool),bool)))))))) # label(mem_c_2Epred__set_2EBIJ) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	28 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(Q) | p(R) <-> p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))))))) # label(ax_or_p) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	29 $T <-> -$F # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	30 -$T <-> $F # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	31 (all V0t (mem(V0t,bool) -> (--p(V0t) <-> p(V0t)))) # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	32 (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))))))))) # label(conj_thm_2Esat_2Edc__disj) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	33 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (--(p(V0A) | p(V1B)) <-> (-p(V0A) -> --p(V1B))))))) # label(conj_thm_2Esat_2EOR__DUAL2) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	34 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (p(V1B) | p(V0A) <-> p(V0A) | p(V1B)))))) # label(conj_thm_2Ebool_2EDISJ__SYM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	35 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,bool) -> (all V1Q (mem(V1Q,arr(A_27a,bool)) -> ((all V3x (mem(V3x,A_27a) -> p(ap(V1Q,V3x)) & p(V0P))) <-> (all V2x (mem(V2x,A_27a) -> p(ap(V1Q,V2x)))) & p(V0P)))))))) # label(conj_thm_2Ebool_2ERIGHT__AND__FORALL__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	36 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,arr(A_27a,bool)) -> (all V1Q (mem(V1Q,bool) -> ((exists V3x (mem(V3x,A_27a) & (p(ap(V0P,V3x)) | p(V1Q)))) <-> p(V1Q) | (exists V2x (mem(V2x,A_27a) & p(ap(V0P,V2x))))))))))) # label(conj_thm_2Ebool_2ELEFT__OR__EXISTS__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	37 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0P (mem(V0P,arr(A_27a,arr(A_27b,bool))) -> ((all V1x (mem(V1x,A_27a) -> (exists V2y (mem(V2y,A_27b) & p(ap(ap(V0P,V1x),V2y)))))) <-> (exists V3f (mem(V3f,arr(A_27a,A_27b)) & (all V4x (mem(V4x,A_27a) -> p(ap(ap(V0P,V4x),ap(V3f,V4x)))))))))))))) # label(conj_thm_2Ebool_2ESKOLEM__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	38 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2Epred__set_2ECROSS(A_27a,A_27b),arr(arr(A_27a,bool),arr(arr(A_27b,bool),arr(ty_2Epair_2Eprod(A_27a,A_27b),bool)))))))) # label(mem_c_2Epred__set_2ECROSS) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	39 (all A_27a (ne(A_27a) -> mem(c_2Epred__set_2EUNIV(A_27a),arr(A_27a,bool)))) # label(mem_c_2Epred__set_2EUNIV) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	40 (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))))))) # label(ax_imp_p) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	41 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,arr(A_27a,bool)) -> ((all V2x (mem(V2x,A_27a) -> -p(ap(V0P,V2x)))) <-> -(exists V1x (mem(V1x,A_27a) & p(ap(V0P,V1x))))))))) # label(conj_thm_2Ebool_2ENOT__EXISTS__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	42 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	43 (all V0t (mem(V0t,bool) -> (-p(V0t) <-> (p(V0t) <-> $F)) & (-p(V0t) <-> ($F <-> p(V0t))) & ((p(V0t) <-> $T) <-> p(V0t)) & ((p(V0t) <-> $T) <-> p(V0t)))) # label(conj_thm_2Ebool_2EEQ__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	44 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,bool) -> (all V1Q (mem(V1Q,arr(A_27a,bool)) -> (p(V0P) | (all V3x (mem(V3x,A_27a) -> p(ap(V1Q,V3x)))) <-> (all V2x (mem(V2x,A_27a) -> p(V0P) | p(ap(V1Q,V2x))))))))))) # label(conj_thm_2Ebool_2ERIGHT__FORALL__OR__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	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))))))))) # label(ax_all_p) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	46 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,arr(A_27a,bool)) -> (all V1Q (mem(V1Q,bool) -> ((exists V3x (mem(V3x,A_27a) & p(ap(V0P,V3x)))) & p(V1Q) <-> (exists V2x (mem(V2x,A_27a) & p(ap(V0P,V2x)) & p(V1Q)))))))))) # label(conj_thm_2Ebool_2ELEFT__EXISTS__AND__THM) # label(axiom) # label(non_clause).  [assumption].
0.71/1.03	47 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (--(-p(V0A) | p(V1B)) <-> (p(V0Alarm clock 
119.31/120.11	Prover9 interrupted
119.31/120.11	EOF