0.06/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n022.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit : 960
0.12/0.33	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 05:45:31 EDT 2022
0.12/0.34	% CPUTime  : 
0.43/1.03	============================== Prover9 ===============================
0.43/1.03	Prover9 (32) version 2009-11A, November 2009.
0.43/1.03	Process 23423 was started by sandbox2 on n022.cluster.edu,
0.43/1.03	Tue Aug  9 05:45:32 2022
0.43/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_23270_n022.cluster.edu".
0.43/1.03	============================== end of head ===========================
0.43/1.03	
0.43/1.03	============================== INPUT =================================
0.43/1.03	
0.43/1.03	% Reading from file /tmp/Prover9_23270_n022.cluster.edu
0.43/1.03	
0.43/1.03	set(prolog_style_variables).
0.43/1.03	set(auto2).
0.43/1.03	    % set(auto2) -> set(auto).
0.43/1.03	    % set(auto) -> set(auto_inference).
0.43/1.03	    % set(auto) -> set(auto_setup).
0.43/1.03	    % set(auto_setup) -> set(predicate_elim).
0.43/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.03	    % set(auto) -> set(auto_limits).
0.43/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.03	    % set(auto) -> set(auto_denials).
0.43/1.03	    % set(auto) -> set(auto_process).
0.43/1.03	    % set(auto2) -> assign(new_constants, 1).
0.43/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.03	    % set(auto2) -> assign(max_hours, 1).
0.43/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.03	    % set(auto2) -> set(sort_initial_sos).
0.43/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.03	    % set(auto2) -> assign(max_megs, 400).
0.43/1.03	    % set(auto2) -> assign(stats, some).
0.43/1.03	    % set(auto2) -> clear(echo_input).
0.43/1.03	    % set(auto2) -> set(quiet).
0.43/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.03	    % set(auto2) -> clear(print_given).
0.43/1.03	assign(lrs_ticks,-1).
0.43/1.03	assign(sos_limit,10000).
0.43/1.03	assign(order,kbo).
0.43/1.03	set(lex_order_vars).
0.43/1.03	clear(print_given).
0.43/1.03	
0.43/1.03	% formulas(sos).  % not echoed (58 formulas)
0.43/1.03	
0.43/1.03	============================== end of input ==========================
0.43/1.03	
0.43/1.03	% From the command line: assign(max_seconds, 960).
0.43/1.03	
0.43/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.03	
0.43/1.03	% Formulas that are not ordinary clauses:
0.43/1.03	1 (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.43/1.03	2 (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.43/1.03	3 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	4 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	5 (all A all Y all X (mem(X,A) -> Y = ap(k(A,Y),X))) # label(kbeta) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	6 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(Q) <-> p(R)) -> R = Q))))) # label(boolext) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	7 (all V0t (mem(V0t,bool) -> (-p(V0t) -> -p(V0t)))) # label(conj_thm_2Ebool_2EF__IMP) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	8 (all A (ne(A) -> (all X (mem(X,A) -> (all Y (mem(Y,A) -> (p(ap(ap(c_2Emin_2E_3D(A),X),Y)) <-> Y = X))))))) # label(ax_eq_p) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	9 (all V0x (mem(V0x,ty_2Eextreal_2Eextreal) -> (all V1y (mem(V1y,ty_2Eextreal_2Eextreal) -> (all V2z (mem(V2z,ty_2Eextreal_2Eextreal) -> (p(ap(ap(c_2Eextreal_2Eextreal__le,V0x),V1y)) & p(ap(ap(c_2Eextreal_2Eextreal__le,V1y),V2z)) -> p(ap(ap(c_2Eextreal_2Eextreal__le,V0x),V2z))))))))) # label(conj_thm_2Eextreal_2Ele__trans) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	10 (all V0t (mem(V0t,bool) -> (-p(V0t) -> -p(V0t)))) # label(conj_thm_2Ebool_2EIMP__F) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	11 (all V0A (mem(V0A,bool) -> (p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV__IMP) # label(axiom) # label(non_clause).  [assumption].
0.43/1.03	12 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> (all V1y (mem(V1y,A_27a) -> (V0x = V1y <-> V1y = V0x))))))) # label(conj_thm_2Ebool_2EEQ__SYM__EQ) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	13 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V1q) | p(V2r) | p(V0p)) & (p(V0p) | -p(V1q) | -p(V2r)) & (p(V1q) | -p(V2r) | -p(V0p)) & (-p(V0p) | -p(V1q) | p(V2r)) <-> (p(V0p) <-> (p(V1q) <-> p(V2r)))))))))) # label(conj_thm_2Esat_2Edc__eq) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	14 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> ((p(V0t1) -> p(V1t2)) -> ((p(V1t2) -> p(V0t1)) -> (p(V0t1) <-> p(V1t2)))))))) # label(conj_thm_2Ebool_2EIMP__ANTISYM__AX) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	15 (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.43/1.04	16 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((-p(V2r) | -p(V1q) | p(V0p)) & (-p(V0p) | p(V1q)) & (-p(V0p) | p(V2r)) <-> (p(V2r) & p(V1q) <-> p(V0p))))))))) # label(conj_thm_2Esat_2Edc__conj) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	17 (all A_27a (ne(A_27a) -> (all V0t1 (mem(V0t1,A_27a) -> (all V1t2 (mem(V1t2,A_27a) -> V1t2 = ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2EF),V0t1),V1t2) & ap(ap(ap(c_2Ebool_2ECOND(A_27a),c_2Ebool_2ET),V0t1),V1t2) = V0t1)))))) # label(conj_thm_2Ebool_2ECOND__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	18 (all V0t (mem(V0t,bool) -> -p(V0t) | p(V0t))) # label(conj_thm_2Ebool_2EEXCLUDED__MIDDLE) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	19 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)))) # label(mem_c_2Ebool_2E_21) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	20 (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.43/1.04	21 (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.43/1.04	22 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(ap(ap(c_2Ebool_2E_2F_5C,Q),R)) <-> p(Q) & p(R)))))) # label(ax_and_p) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	23 (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.43/1.04	24 (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.43/1.04	25 (all V0x (mem(V0x,ty_2Eextreal_2Eextreal) -> (all V1y (mem(V1y,ty_2Eextreal_2Eextreal) -> ap(ap(ap(c_2Ebool_2ECOND(ty_2Eextreal_2Eextreal),ap(ap(c_2Eextreal_2Eextreal__le,V0x),V1y)),V1y),V0x) = ap(ap(c_2Eextreal_2Eextreal__max,V0x),V1y))))) # label(ax_thm_2Eextreal_2Eextreal__max__def) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	26 (all V0t (mem(V0t,bool) -> (p(V0t) <-> --p(V0t)))) # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	27 -$T <-> $F # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	28 -$F <-> $T # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	29 (all A_27a (ne(A_27a) -> mem(c_2Ebool_2ECOND(A_27a),arr(bool,arr(A_27a,arr(A_27a,A_27a)))))) # label(mem_c_2Ebool_2ECOND) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	30 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V0p) <-> (p(V1q) -> p(V2r))) <-> (p(V1q) | p(V0p)) & (p(V0p) | -p(V2r)) & (-p(V0p) | p(V2r) | -p(V1q))))))))) # label(conj_thm_2Esat_2Edc__imp) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	31 (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.43/1.04	32 (all V0t (mem(V0t,bool) -> (--p(V0t) <-> p(V0t)))) # label(conj_thm_2Esat_2ENOT__NOT) # label(axiom) # label(non_clause).  [assumption].
0.43/1.04	33 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (--(-p(V0A) | p(V1B)) <-> (p(V0A) -> --p(V1B))))))) # label(conj_thm_2Esat_2EOR__DUAL3) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	34 (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].
1.32/1.58	35 (all V0t (mem(V0t,bool) -> (($T <-> p(V0t)) <-> p(V0t)) & (p(V0t) <-> (p(V0t) <-> $T)) & (($F <-> p(V0t)) <-> -p(V0t)) & (($F <-> p(V0t)) <-> -p(V0t)))) # label(conj_thm_2Ebool_2EEQ__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	36 (all V0t (mem(V0t,bool) -> (p(V0t) <-> p(V0t)) & (-p(V0t) <-> -p(V0t)) & ((p(V0t) -> p(V0t)) <-> $T) & (($F -> p(V0t)) <-> $T) & ($T <-> (p(V0t) -> $T)))) # label(conj_thm_2Ebool_2EIMP__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	37 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((-p(V1q) | p(V0p)) & (p(V2r) | -p(V0p) | p(V1q)) & (-p(V2r) | p(V0p)) <-> (p(V0p) <-> p(V2r) | p(V1q))))))))) # label(conj_thm_2Esat_2Edc__disj) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	38 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (-p(V0A) | -p(V1B) <-> -(p(V1B) & p(V0A))) & (-(p(V0A) | p(V1B)) <-> -p(V0A) & -p(V1B)))))) # label(conj_thm_2Ebool_2EDE__MORGAN__THM) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	39 (all V0A (mem(V0A,bool) -> (--p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV2) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	40 (all V0t (mem(V0t,bool) -> ($F -> p(V0t)))) # label(conj_thm_2Ebool_2EFALSITY) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	41 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (p(V0A) | p(V1B) <-> p(V1B) | p(V0A)))))) # label(conj_thm_2Ebool_2EDISJ__SYM) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	42 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (all V2C (mem(V2C,bool) -> (p(V0A) | p(V1B) | p(V2C) <-> p(V1B) | p(V2C) | p(V0A)))))))) # label(conj_thm_2Ebool_2EDISJ__ASSOC) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	43 (all V0x (mem(V0x,ty_2Eextreal_2Eextreal) -> (all V1y (mem(V1y,ty_2Eextreal_2Eextreal) -> p(ap(ap(c_2Eextreal_2Eextreal__le,V0x),V1y)) | p(ap(ap(c_2Eextreal_2Eextreal__le,V1y),V0x)))))) # label(conj_thm_2Eextreal_2Ele__total) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	44 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause).  [assumption].
1.32/1.58	45 -(all V0z (mem(V0z,ty_2Eextreal_2Eextreal) -> (all V1x (mem(V1x,ty_2Eextreal_2Eextreal) -> (all V2y (mem(V2y,ty_2Eextreal_2Eextreal) -> (p(ap(ap(c_2Eextreal_2Eextreal__le,ap(ap(c_2Eextreal_2Eextreal__max,V1x),V2y)),V0z)) <-> p(ap(ap(c_2Eextreal_2Eextreal__le,V2y),V0z)) & p(ap(ap(c_2Eextreal_2Eextreal__le,V1x),V0z))))))))) # label(conj_thm_2Eextreal_2Emax__le) # label(negated_conjecture) # label(non_clause).  [assumption].
1.32/1.58	
1.32/1.58	============================== end of process non-clausal formulas ===
1.32/1.58	
1.32/1.58	============================== PROCESS INITIAL CLAUSES ===============
1.32/1.58	
1.32/1.58	============================== PREDICATE ELIMINATION =================
1.32/1.58	
1.32/1.58	============================== end predicate elimination =============
1.32/1.58	
1.32/1.58	Auto_denials:  (non-Horn, no changes).
1.32/1.58	
1.32/1.58	Term ordering decisions:
1.32/1.58	Function symbol KB weights:  bool=1. ty_2Eextreal_2Eextreal=1. c_2Eextreal_2Eextreal__le=1. c_2Ebool_2E_2F_5C=1. c_2Ebool_2E_5C_2F=1. c_2Eextreal_2Eextreal__max=1. c_2Emin_2E_3D_3D_3E=1. c_2Ebool_2ET=1. c_2Ebool_2EF=1. c_2Ebool_2E_7E=1. ind=1. c1=1. c2=1. c3=1. ap=1. arr=1. k=1. f2=1. c_2Ebool_2ECOND=1. c_2Ebool_2E_21=1. c_2Emin_2E_3D=1. i=1. f1=1.
1.32/1.58	
1.32/1.58	============================== end of process initial clauses ========
1.32/1.58	
1.32/1.58	============================== CLAUSES FOR SEARCH ====================
1.32/1.58	
1.32/1.58	============================== end of clauses for search =============
1.32/1.58	
1.32/1.58	============================== SEARCH ================================
1.32/1.58	
1.32/1.58	% Starting search at 0.02 seconds.
1.32/1.58	
1.32/1.58	Low Water (keep): wt=34.000, iters=3340
1.32/1.58	
1.32/1.58	Low Water (keep): wt=26.000, iters=3343
1.32/1.58	
1.32/1.58	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 66 (0.00 of 0.56 sec).
1.32/1.58	
1.32/1.58	Low WatAlarm clock 
119.80/120.07	Prover9 interrupted
119.80/120.07	EOF