0.02/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.30	% Computer   : n018.cluster.edu
0.10/0.30	% Model      : x86_64 x86_64
0.10/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory     : 8042.1875MB
0.10/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1200
0.10/0.31	% DateTime   : Tue Jul 13 15:44:23 EDT 2021
0.10/0.31	% CPUTime    : 
0.79/1.12	============================== Prover9 ===============================
0.79/1.12	Prover9 (32) version 2009-11A, November 2009.
0.79/1.12	Process 9654 was started by sandbox2 on n018.cluster.edu,
0.79/1.12	Tue Jul 13 15:44:24 2021
0.79/1.12	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_9491_n018.cluster.edu".
0.79/1.12	============================== end of head ===========================
0.79/1.12	
0.79/1.12	============================== INPUT =================================
0.79/1.12	
0.79/1.12	% Reading from file /tmp/Prover9_9491_n018.cluster.edu
0.79/1.12	
0.79/1.12	set(prolog_style_variables).
0.79/1.12	set(auto2).
0.79/1.12	    % set(auto2) -> set(auto).
0.79/1.12	    % set(auto) -> set(auto_inference).
0.79/1.12	    % set(auto) -> set(auto_setup).
0.79/1.12	    % set(auto_setup) -> set(predicate_elim).
0.79/1.12	    % set(auto_setup) -> assign(eq_defs, unfold).
0.79/1.12	    % set(auto) -> set(auto_limits).
0.79/1.12	    % set(auto_limits) -> assign(max_weight, "100.000").
0.79/1.12	    % set(auto_limits) -> assign(sos_limit, 20000).
0.79/1.12	    % set(auto) -> set(auto_denials).
0.79/1.12	    % set(auto) -> set(auto_process).
0.79/1.12	    % set(auto2) -> assign(new_constants, 1).
0.79/1.12	    % set(auto2) -> assign(fold_denial_max, 3).
0.79/1.12	    % set(auto2) -> assign(max_weight, "200.000").
0.79/1.12	    % set(auto2) -> assign(max_hours, 1).
0.79/1.12	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.79/1.12	    % set(auto2) -> assign(max_seconds, 0).
0.79/1.12	    % set(auto2) -> assign(max_minutes, 5).
0.79/1.12	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.79/1.12	    % set(auto2) -> set(sort_initial_sos).
0.79/1.12	    % set(auto2) -> assign(sos_limit, -1).
0.79/1.12	    % set(auto2) -> assign(lrs_ticks, 3000).
0.79/1.12	    % set(auto2) -> assign(max_megs, 400).
0.79/1.12	    % set(auto2) -> assign(stats, some).
0.79/1.12	    % set(auto2) -> clear(echo_input).
0.79/1.12	    % set(auto2) -> set(quiet).
0.79/1.12	    % set(auto2) -> clear(print_initial_clauses).
0.79/1.12	    % set(auto2) -> clear(print_given).
0.79/1.12	assign(lrs_ticks,-1).
0.79/1.12	assign(sos_limit,10000).
0.79/1.12	assign(order,kbo).
0.79/1.12	set(lex_order_vars).
0.79/1.12	clear(print_given).
0.79/1.12	
0.79/1.12	% formulas(sos).  % not echoed (54 formulas)
0.79/1.12	
0.79/1.12	============================== end of input ==========================
0.79/1.12	
0.79/1.12	% From the command line: assign(max_seconds, 1200).
0.79/1.12	
0.79/1.12	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.79/1.12	
0.79/1.12	% Formulas that are not ordinary clauses:
0.79/1.12	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.79/1.12	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.79/1.12	3 (all A (ne(A) -> (all B (ne(B) -> ne(arr(A,B)))))) # label(arr_ne) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	4 (all A all X (mem(X,A) -> ap(i(A),X) = X)) # label(ibeta) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	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.79/1.12	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.79/1.12	7 (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.79/1.12	8 (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].
0.79/1.12	9 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> ((p(V0p) | p(V1q)) & (-p(V0p) | -p(V1q)) <-> (p(V0p) <-> -p(V1q))))))) # label(conj_thm_2Esat_2Edc__neg) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	10 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__EXISTS__POINT) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	11 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (-(p(V0p) -> p(V1q)) -> p(V0p)))))) # label(conj_thm_2Esat_2Epth__ni1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	12 (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.79/1.12	13 (all V0t (mem(V0t,bool) -> (p(V0t) <-> ($T <-> p(V0t))) & (($F <-> p(V0t)) <-> -p(V0t)) & (-p(V0t) <-> ($F <-> p(V0t))) & (p(V0t) <-> (p(V0t) <-> $T)))) # label(conj_thm_2Ebool_2EEQ__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	14 -$T <-> $F # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	15 $T <-> -$F # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	16 (all V0t (mem(V0t,bool) -> (--p(V0t) <-> p(V0t)))) # label(conj_thm_2Ebool_2ENOT__CLAUSES_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	17 (all V0t (mem(V0t,bool) -> (($F -> p(V0t)) <-> $T) & ((p(V0t) -> p(V0t)) <-> $T) & (-p(V0t) <-> -p(V0t)) & ($T <-> (p(V0t) -> $T)) & (p(V0t) <-> p(V0t)))) # label(conj_thm_2Ebool_2EIMP__CLAUSES) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	18 (all A (ne(A) -> (all Q (mem(Q,arr(A,bool)) -> (p(ap(c_2Ebool_2E_3F(A),Q)) <-> (exists X (p(ap(Q,X)) & mem(X,A)))))))) # label(ax_ex_p) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	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.79/1.12	20 $T # label(conj_thm_2Ebool_2ETRUTH) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	21 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__EXISTS__GAP) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	22 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__FORALL) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	23 (all V0x (mem(V0x,bool) -> (all V1x_27 (mem(V1x_27,bool) -> (all V2y (mem(V2y,bool) -> (all V3y_27 (mem(V3y_27,bool) -> ((p(V1x_27) -> (p(V2y) <-> p(V3y_27))) & (p(V1x_27) <-> p(V0x)) -> ((p(V0x) -> p(V2y)) <-> (p(V1x_27) -> p(V3y_27)))))))))))) # label(conj_thm_2Ebool_2EIMP__CONG) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	24 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> ((-p(V2r) | p(V0p)) & (-p(V1q) | p(V2r) | -p(V0p)) & (p(V1q) | p(V0p)) <-> ((p(V1q) -> p(V2r)) <-> p(V0p))))))))) # label(conj_thm_2Esat_2Edc__imp) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	25 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (-(p(V0p) -> p(V1q)) -> -p(V1q)))))) # label(conj_thm_2Esat_2Epth__ni2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	26 (all V0t (mem(V0t,bool) -> (--p(V0t) <-> p(V0t)))) # label(conj_thm_2Esat_2ENOT__NOT) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	27 (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.79/1.12	28 (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.79/1.12	29 (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.79/1.12	30 (all V0p (mem(V0p,bool) -> (all V1q (mem(V1q,bool) -> (all V2r (mem(V2r,bool) -> (((p(V1q) <-> p(V2r)) <-> p(V0p)) <-> (p(V1q) | -p(V2r) | -p(V0p)) & (-p(V0p) | -p(V1q) | p(V2r)) & (p(V0p) | -p(V2r) | -p(V1q)) & (p(V0p) | p(V2r) | p(V1q))))))))) # label(conj_thm_2Esat_2Edc__eq) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	31 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0i (mem(V0i,arr(A_27a,A_27b)) -> (all V1P (mem(V1P,arr(A_27b,bool)) -> (all V16i (mem(V16i,arr(A_27a,A_27b)) -> (all V17P (mem(V17P,arr(A_27b,bool)) -> ((all V18v (mem(V18v,A_27b) -> (-p(ap(V17P,V18v)) -> (exists V19fv (V18v = ap(V16i,V19fv) & mem(V19fv,A_27a)))))) <-> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),V16i),V17P))))))) & (all V12i (mem(V12i,arr(A_27a,A_27b)) -> (all V13P (mem(V13P,arr(A_27b,bool)) -> ((all V14v (mem(V14v,A_27b) -> (p(ap(V13P,V14v)) -> (exists V15fv (V14v = ap(V12i,V15fv) & mem(V15fv,A_27a)))))) <-> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(A_27a,A_27b),V12i),V13P))))))) & (all V9i (mem(V9i,arr(A_27a,A_27b)) -> (all V10P (mem(V10P,arr(A_27b,bool)) -> ((all V11fv (mem(V11fv,A_27a) -> -p(ap(V10P,ap(V9i,V11fv))))) <-> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),V9i),V10P))))))) & (all V6i (mem(V6i,arr(A_27a,A_27b)) -> (all V7P (mem(V7P,arr(A_27b,bool)) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(A_27a,A_27b),V6i),V7P)) <-> (all V8fv (mem(V8fv,A_27a) -> p(ap(V7P,ap(V6i,V8fv)))))))))) & ((all V4v (mem(V4v,A_27b) -> (-p(ap(V1P,V4v)) -> (exists V5fv (mem(V5fv,A_27a) & -p(ap(V1P,ap(V0i,V5fv)))))))) <-> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(A_27a,A_27b),V0i),V1P))) & (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),V0i),V1P)) <-> (all V2v (mem(V2v,A_27b) -> (p(ap(V1P,V2v)) -> (exists V3fv (p(ap(V1P,ap(V0i,V3fv))) & mem(V3fv,A_27a))))))))))))))) # label(conj_thm_2EquantHeuristics_2EGUESS__REWRITES) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	32 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__FORALL__POINT) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	33 (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.79/1.12	34 (all A_27a (ne(A_27a) -> (all V0x (mem(V0x,A_27a) -> (all V1y (mem(V1y,A_27a) -> (V1y = V0x <-> V1y = V0x))))))) # label(conj_thm_2Ebool_2EEQ__SYM__EQ) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	35 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__FORALL__GAP(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__FORALL__GAP) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	36 (all V0A (mem(V0A,bool) -> (p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV__IMP) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	37 (all V0t1 (mem(V0t1,bool) -> (all V1t2 (mem(V1t2,bool) -> (all V2t3 (mem(V2t3,bool) -> ((p(V0t1) & p(V1t2) -> p(V2t3)) <-> (p(V0t1) -> (p(V1t2) -> p(V2t3)))))))))) # label(conj_thm_2Ebool_2EAND__IMP__INTRO) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	38 (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.79/1.12	39 (all V0A (mem(V0A,bool) -> (--p(V0A) -> --p(V0A)))) # label(conj_thm_2Esat_2EAND__INV2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	40 (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.79/1.12	41 (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(V1q) | p(V2r) | -p(V0p)) & (p(V0p) | -p(V2r))))))))) # label(conj_thm_2Esat_2Edc__disj) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	42 (all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> mem(c_2EquantHeuristics_2EGUESS__EXISTS(A_27a,A_27b),arr(arr(A_27a,A_27b),arr(arr(A_27b,bool),bool))))))) # label(mem_c_2EquantHeuristics_2EGUESS__EXISTS) # label(axiom) # label(non_clause).  [assumption].
0.79/1.12	43 (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.79/1.12	44 -(all A_27a (ne(A_27a) -> (all A_27b (ne(A_27b) -> (all V0i (mem(V0i,arr(A_27b,A_27a)) -> (all V1P (mem(V1P,arr(A_27a,bool)) -> (all V2Q (mem(V2Q,arr(A_27a,bool)) -> ((all V3x (mem(V3x,A_27a) -> (p(ap(V2Q,V3x)) -> p(ap(V1P,V3x))))) -> (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(A_27b,A_27a),V0i),V1P)) -> p(ap(ap(c_2EquantHeAlarm clock 
119.58/120.09	Prover9 interrupted
119.58/120.09	EOF