0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n027.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   : 1200
0.12/0.34	% DateTime   : Tue Jul 13 15:39:10 EDT 2021
0.12/0.34	% CPUTime    : 
0.78/1.06	============================== Prover9 ===============================
0.78/1.06	Prover9 (32) version 2009-11A, November 2009.
0.78/1.06	Process 19167 was started by sandbox on n027.cluster.edu,
0.78/1.06	Tue Jul 13 15:39:11 2021
0.78/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_19013_n027.cluster.edu".
0.78/1.06	============================== end of head ===========================
0.78/1.06	
0.78/1.06	============================== INPUT =================================
0.78/1.06	
0.78/1.06	% Reading from file /tmp/Prover9_19013_n027.cluster.edu
0.78/1.06	
0.78/1.06	set(prolog_style_variables).
0.78/1.06	set(auto2).
0.78/1.06	    % set(auto2) -> set(auto).
0.78/1.06	    % set(auto) -> set(auto_inference).
0.78/1.06	    % set(auto) -> set(auto_setup).
0.78/1.06	    % set(auto_setup) -> set(predicate_elim).
0.78/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/1.06	    % set(auto) -> set(auto_limits).
0.78/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/1.06	    % set(auto) -> set(auto_denials).
0.78/1.06	    % set(auto) -> set(auto_process).
0.78/1.06	    % set(auto2) -> assign(new_constants, 1).
0.78/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.78/1.06	    % set(auto2) -> assign(max_hours, 1).
0.78/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.78/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.78/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/1.06	    % set(auto2) -> set(sort_initial_sos).
0.78/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.78/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/1.06	    % set(auto2) -> assign(max_megs, 400).
0.78/1.06	    % set(auto2) -> assign(stats, some).
0.78/1.06	    % set(auto2) -> clear(echo_input).
0.78/1.06	    % set(auto2) -> set(quiet).
0.78/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.78/1.06	    % set(auto2) -> clear(print_given).
0.78/1.06	assign(lrs_ticks,-1).
0.78/1.06	assign(sos_limit,10000).
0.78/1.06	assign(order,kbo).
0.78/1.06	set(lex_order_vars).
0.78/1.06	clear(print_given).
0.78/1.06	
0.78/1.06	% formulas(sos).  % not echoed (59 formulas)
0.78/1.06	
0.78/1.06	============================== end of input ==========================
0.78/1.06	
0.78/1.06	% From the command line: assign(max_seconds, 1200).
0.78/1.06	
0.78/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/1.06	
0.78/1.06	% Formulas that are not ordinary clauses:
0.78/1.06	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.78/1.06	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.78/1.06	3 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	4 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	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.78/1.06	7 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V0p) <-> (p(V1q) -> p(V2r))) <-> (p(V0p) | -p(V2r)) & (-p(V1q) | -p(V0p) | p(V2r)) & (p(V0p) | p(V1q))))))))) # label(conj_thm_2Esat_2Edc__imp) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	8 (all V0A (mem(V0A,bool) -> (p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV__IMP) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	9 (all V0A (mem(V0A,bool) -> (--p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV2) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	10 (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.78/1.06	11 (all V0t (mem(V0t,bool) -> (-p(V0t) -> -p(V0t)))) # label(conj_thm_2Ebool_2EF__IMP) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	12 (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))))))))) # label(ax_ex_p) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	13 (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))))))))) # label(conj_thm_2Ebool_2ENOT__FORALL__THM) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	14 (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.78/1.06	15 (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(V1q) | p(V0p)) <-> (p(V0p) <-> p(V2r) | p(V1q))))))))) # label(conj_thm_2Esat_2Edc__disj) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	16 (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.78/1.06	17 (all V0p (mem(V0p,ty_2Einteger_2Eint) -> (all V1q (mem(V1q,ty_2Einteger_2Eint) -> (all V2r (mem(V2r,ty_2Einteger_2Eint) -> (p(ap(ap(c_2Einteger_2Eint__divides,V0p),V1q)) -> (p(ap(ap(c_2Einteger_2Eint__divides,V0p),V2r)) <-> p(ap(ap(c_2Einteger_2Eint__divides,V0p),ap(ap(c_2Einteger_2Eint__add,V2r),V1q))))))))))) # label(conj_thm_2Einteger_2EINT__DIVIDES__RADD) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	18 (all V0t (mem(V0t,bool) -> (--p(V0t) <-> p(V0t)))) # label(conj_thm_2Esat_2ENOT__NOT) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	19 (all V0x (mem(V0x,ty_2Einteger_2Eint) -> (all V1y (mem(V1y,ty_2Einteger_2Eint) -> ap(ap(c_2Einteger_2Eint__add,V0x),ap(c_2Einteger_2Eint__neg,V1y)) = ap(ap(c_2Einteger_2Eint__sub,V0x),V1y))))) # label(ax_thm_2Einteger_2Eint__sub) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	20 (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.78/1.06	21 (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(V2r)) & (-p(V0p) | p(V1q)) & (p(V2r) | -p(V0p))))))))) # label(conj_thm_2Esat_2Edc__conj) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	22 (all V0t (mem(V0t,bool) -> (-p(V0t) -> -p(V0t)))) # label(conj_thm_2Ebool_2EIMP__F) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	23 (all V0t (mem(V0t,bool) -> ($T <-> (p(V0t) -> $T)) & ($T <-> ($F -> p(V0t))) & ((p(V0t) -> p(V0t)) <-> $T) & (-p(V0t) <-> -p(V0t)) & (p(V0t) <-> p(V0t)))) # label(conj_thm_2Ebool_2EIMP__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	24 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((p(V0p) <-> (p(V2r) <-> p(V1q))) <-> (p(V0p) | p(V1q) | p(V2r)) & (-p(V2r) | -p(V1q) | p(V0p)) & (p(V1q) | -p(V2r) | -p(V0p)) & (p(V2r) | -p(V0p) | -p(V1q))))))))) # label(conj_thm_2Esat_2Edc__eq) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	25 (all V0t (mem(V0t,bool) -> (p(V0t) <-> --p(V0t)))) # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	26 $F <-> -$T # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	27 -$F <-> $T # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	28 (all A (ne(A) -> (all Q (mem(Q,arr(A,bool)) -> ((all X (mem(X,A) -> p(ap(Q,X)))) <-> p(ap(c_2Ebool_2E_21(A),Q))))))) # label(ax_all_p) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	29 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	30 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> ((-p(V0p) | -p(V1q)) & (p(V1q) | p(V0p)) <-> (-p(V1q) <-> p(V0p))))))) # label(conj_thm_2Esat_2Edc__neg) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	31 (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.78/1.06	32 (all Q (mem(Q,bool) -> (p(ap(c_2Ebool_2E_7E,Q)) <-> -p(Q)))) # label(ax_neg_p) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	33 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (-p(V1B) & -p(V0A) <-> -(p(V1B) | p(V0A))) & (-(p(V1B) & p(V0A)) <-> -p(V1B) | -p(V0A)))))) # label(conj_thm_2Ebool_2EDE__MORGAN__THM) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	34 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (all V2C (mem(V2C,bool) -> (p(V1B) | p(V2C) | p(V0A) <-> p(V2C) | p(V1B) | p(V0A)))))))) # label(conj_thm_2Ebool_2EDISJ__ASSOC) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	35 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> ((p(Q) -> p(R)) <-> p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))))))) # label(ax_imp_p) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	36 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(Q) & p(R) <-> p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))))))) # label(ax_and_p) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	37 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (p(V0A) | p(V1B) <-> p(V0A) | p(V1B)))))) # label(conj_thm_2Ebool_2EDISJ__SYM) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	38 (all V0t (mem(V0t,bool) -> (($T <-> p(V0t)) <-> p(V0t)) & (-p(V0t) <-> ($F <-> p(V0t))) & (-p(V0t) <-> ($F <-> p(V0t))) & ((p(V0t) <-> $T) <-> p(V0t)))) # label(conj_thm_2Ebool_2EEQ__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	39 (all A_27a (ne(A_27a) -> (all V0P (mem(V0P,arr(A_27a,bool)) -> (all V1Q (mem(V1Q,arr(A_27a,bool)) -> ((all V2x (mem(V2x,A_27a) -> p(ap(V0P,V2x)) & p(ap(V1Q,V2x)))) <-> (all V4x (mem(V4x,A_27a) -> p(ap(V1Q,V4x)))) & (all V3x (mem(V3x,A_27a) -> p(ap(V0P,V3x))))))))))) # label(conj_thm_2Ebool_2EFORALL__AND__THM) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	40 (all V0p (mem(V0p,ty_2Einteger_2Eint) -> (all V1q (mem(V1q,ty_2Einteger_2Eint) -> (p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,V0p)),V1q)) <-> p(ap(ap(c_2Einteger_2Eint__divides,V0p),V1q))) & (p(ap(ap(c_2Einteger_2Eint__divides,V0p),V1q)) <-> p(ap(ap(c_2Einteger_2Eint__divides,V0p),ap(c_2Einteger_2Eint__neg,V1q)))))))) # label(conj_thm_2Einteger_2EINT__DIVIDES__NEG) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	41 (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.78/1.07	42 (all Q (mem(Q,bool) -> (all R (mem(R,bool) -> (p(R) | p(Q) <-> p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))))))) # label(ax_or_p) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	43 (all V0A (mem(V0A,bool) -> (all V1B (mem(V1B,bool) -> (--(p(V1B) | -p(V0A)) <-> (p(V0A) -> --p(V1B))))))) # label(conj_thm_2Esat_2EOR__DUAL3) # label(axiom) # label(non_clause).  [assumption].
0.78/1.07	44 -(all V0p (mem(V0p,ty_2Einteger_2Eint) -> (all V1q (mem(V1q,ty_2Einteger_2Eint) -> (all V2r (mem(V2r,ty_2Einteger_2Eint) -> (p(ap(ap(c_2Einteger_2Eint__divides,V0p),V1q)) -> (p(ap(ap(c_2Einteger_2Eint__divides,V0p),V2r)) <-> p(ap(ap(c_2Einteger_2Eint__divides,V0p),ap(ap(c_2Einteger_2Eint__sub,V2r),V1q))))))))))) # label(conj_thm_2Einteger_2EINT__DIVIDES__RSUB) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.07	
0.78/1.07	============================== end of process non-clausal formulas ===
0.78/1.07	
0.78/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.78/1.07	
0.78/1.07	============================== PREDICATE ELIMINATION =================
0.78/1.07	
0.78/1.07	============================== end predicate elimination =============
0.78/1.07	
0.78/1.07	Auto_denials:  (non-Horn, no changes).
0.78/1.07	
0.78/1.07	Term ordering decisions:
0.78/1.07	Function symbol KB weights:  bool=1. ty_2Einteger_2Eint=1. c_2Einteger_2Eint__divides=1. c_2Einteger_2Eint__neg=1. c_2Ebool_2E_2F_5C=1. c_2Ebool_2E_5C_2F=1. c_2Einteger_2Eint__add=1. c_2Emin_2E_3D_3D_3E=1. c_2Einteger_2Eint__sub=1. c_2Ebool_2ET=1. c_2Ebool_2E_7E=1. c_2Ebool_2EF=1. ind=1. c1=1. c2=1. c3=1. ap=1. arr=1. k=1. f2=1. f3=1. f4=1. f5=1. c_2Ebool_2E_21=1. c_2Ebool_2E_3F=1. c_2Emin_2E_3D=1. i=1. f6=1. f7=1. f8=1. f1=1.
0.78/1.07	
0.78/1.07	============================== end of process initial clauses ========
0.78/1.07	
0.78/1.07	============================== CLAUSES FOR SEARCH ====================
0.78/1.07	
0.78/1.07	============================== end of clauses for search =============
0.78/1.07	
0.78/1.07	============================== SEARCH ======================Alarm clock 
119.53/120.07	Prover9 interrupted
119.53/120.07	EOF