0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n014.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 16:05:04 EDT 2021
0.12/0.34	% CPUTime    : 
0.77/1.05	============================== Prover9 ===============================
0.77/1.05	Prover9 (32) version 2009-11A, November 2009.
0.77/1.05	Process 25553 was started by sandbox2 on n014.cluster.edu,
0.77/1.05	Tue Jul 13 16:05:05 2021
0.77/1.05	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_25399_n014.cluster.edu".
0.77/1.05	============================== end of head ===========================
0.77/1.05	
0.77/1.05	============================== INPUT =================================
0.77/1.05	
0.77/1.05	% Reading from file /tmp/Prover9_25399_n014.cluster.edu
0.77/1.05	
0.77/1.05	set(prolog_style_variables).
0.77/1.05	set(auto2).
0.77/1.05	    % set(auto2) -> set(auto).
0.77/1.05	    % set(auto) -> set(auto_inference).
0.77/1.05	    % set(auto) -> set(auto_setup).
0.77/1.05	    % set(auto_setup) -> set(predicate_elim).
0.77/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.05	    % set(auto) -> set(auto_limits).
0.77/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.05	    % set(auto) -> set(auto_denials).
0.77/1.05	    % set(auto) -> set(auto_process).
0.77/1.05	    % set(auto2) -> assign(new_constants, 1).
0.77/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.05	    % set(auto2) -> assign(max_hours, 1).
0.77/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.05	    % set(auto2) -> set(sort_initial_sos).
0.77/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.05	    % set(auto2) -> assign(max_megs, 400).
0.77/1.05	    % set(auto2) -> assign(stats, some).
0.77/1.05	    % set(auto2) -> clear(echo_input).
0.77/1.05	    % set(auto2) -> set(quiet).
0.77/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.05	    % set(auto2) -> clear(print_given).
0.77/1.05	assign(lrs_ticks,-1).
0.77/1.05	assign(sos_limit,10000).
0.77/1.05	assign(order,kbo).
0.77/1.05	set(lex_order_vars).
0.77/1.05	clear(print_given).
0.77/1.05	
0.77/1.05	% formulas(sos).  % not echoed (74 formulas)
0.77/1.05	
0.77/1.05	============================== end of input ==========================
0.77/1.05	
0.77/1.05	% From the command line: assign(max_seconds, 1200).
0.77/1.05	
0.77/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.05	
0.77/1.05	% Formulas that are not ordinary clauses:
0.77/1.05	1 (all A all B (v1_finset_1(B) & v1_finset_1(A) -> v1_finset_1(k2_zfmisc_1(A,B)))) # label(fc14_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	2 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	3 (all A all B all C all D all E (-v1_xboole_0(B) & v1_funct_2(E,B,C) & m1_relset_1(E,B,C) & v1_funct_1(E) & m1_relset_1(D,A,B) & v1_funct_2(D,A,B) & v1_funct_1(D) -> k5_relat_1(D,E) = k7_funct_2(A,B,C,D,E))) # label(redefinition_k7_funct_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	4 (all A (v2_membered(A) -> (all B (m1_subset_1(B,A) -> v1_xreal_0(B) & v1_xcmplx_0(B))))) # label(cc11_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	5 (all A (v5_membered(A) -> v4_membered(A))) # label(cc1_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	6 (all A (v2_membered(A) -> v1_membered(A))) # label(cc4_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	7 (all A all B (v1_relat_1(A) & v1_funct_1(B) & v1_relat_1(B) & v1_funct_1(A) -> v1_funct_1(k5_relat_1(A,B)) & v1_relat_1(k5_relat_1(A,B)))) # label(fc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	8 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> v1_relat_1(C))) # label(cc1_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	9 (all A (v3_membered(A) -> (all B (m1_subset_1(B,A) -> v1_rat_1(B) & v1_xreal_0(B) & v1_xcmplx_0(B))))) # label(cc12_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	10 (all A (l1_struct_0(A) & -v3_struct_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) & -v1_xboole_0(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	11 (all A all B all C all D (l1_struct_0(B) & v1_funct_1(C) & v1_funct_2(C,u1_struct_0(A),u1_struct_0(B)) & m1_relset_1(C,u1_struct_0(A),u1_struct_0(B)) & l1_struct_0(A) -> m1_subset_1(k4_pre_topc(A,B,C,D),k1_zfmisc_1(u1_struct_0(B))))) # label(dt_k4_pre_topc) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	12 (all A (v5_membered(A) -> (all B (m1_subset_1(B,k1_zfmisc_1(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B) & v5_membered(B) & v4_membered(B))))) # label(cc20_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	13 (all A (v3_membered(A) -> v2_membered(A))) # label(cc3_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	14 (all A (v1_finset_1(A) -> (all B (m1_subset_1(B,k1_zfmisc_1(A)) -> v1_finset_1(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	15 (all A (v4_membered(A) -> v3_membered(A))) # label(cc2_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	16 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	17 (all A all B all C all D (v1_funct_1(C) & m1_relset_1(C,u1_struct_0(A),u1_struct_0(B)) & v1_funct_2(C,u1_struct_0(A),u1_struct_0(B)) & l1_struct_0(B) & l1_struct_0(A) -> k9_relat_1(C,D) = k4_pre_topc(A,B,C,D))) # label(redefinition_k4_pre_topc) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	18 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	19 (all A (-v3_struct_0(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & l1_orders_2(B) -> (all C (v1_funct_1(C) & v1_funct_2(C,u1_struct_0(A),u1_struct_0(B)) & m2_relset_1(C,u1_struct_0(A),u1_struct_0(B)) -> ((all D (m1_subset_1(D,k1_zfmisc_1(u1_struct_0(A))) & v1_finset_1(D) -> r4_waybel_0(A,B,C,D))) <-> v4_waybel34(C,A,B)))))))) # label(d15_waybel34) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	20 (all A (v1_relat_1(A) & v1_xboole_0(A) & v1_funct_1(A) -> v1_relat_1(A) & v2_funct_1(A) & v1_funct_1(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	21 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	22 (all A all B all C -(r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) & v1_xboole_0(C))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	23 (all A all B all C (m2_relset_1(C,A,B) <-> m1_relset_1(C,A,B))) # label(redefinition_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	24 (all A (-v3_struct_0(A) & l1_struct_0(A) -> -v1_xboole_0(u1_struct_0(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	25 (all A all B (r1_tarski(A,B) <-> m1_subset_1(A,k1_zfmisc_1(B)))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	26 (all A (-v3_struct_0(A) & l1_orders_2(A) -> (all B (-v3_struct_0(B) & l1_orders_2(B) -> (all C (-v3_struct_0(C) & l1_orders_2(C) -> (all D (m1_subset_1(D,k1_zfmisc_1(u1_struct_0(A))) -> (all E (v1_funct_1(E) & v1_funct_2(E,u1_struct_0(A),u1_struct_0(B)) & m2_relset_1(E,u1_struct_0(A),u1_struct_0(B)) -> (all F (v1_funct_1(F) & m2_relset_1(F,u1_struct_0(B),u1_struct_0(C)) & v1_funct_2(F,u1_struct_0(B),u1_struct_0(C)) -> (r4_waybel_0(A,B,E,D) & r4_waybel_0(B,C,F,k4_pre_topc(A,B,E,D)) -> r4_waybel_0(A,C,k7_funct_2(u1_struct_0(A),u1_struct_0(B),u1_struct_0(C),E,F),D)))))))))))))) # label(t62_waybel34) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	27 (exists A (v1_relat_1(A) & v1_xboole_0(A) & v1_funct_1(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	28 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	29 (all A (v3_membered(A) -> (all B (m1_subset_1(B,k1_zfmisc_1(A)) -> v1_membered(B) & v3_membered(B) & v2_membered(B))))) # label(cc18_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	30 (all A (v1_xboole_0(A) -> k1_xboole_0 = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	31 (all A (v4_membered(A) -> (all B (m1_subset_1(B,k1_zfmisc_1(A)) -> v2_membered(B) & v3_membered(B) & v4_membered(B) & v1_membered(B))))) # label(cc19_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	32 (all A (v1_membered(A) -> (all B (m1_subset_1(B,A) -> v1_xcmplx_0(B))))) # label(cc10_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	33 (all A all B all C (m1_subset_1(B,k1_zfmisc_1(C)) & r2_hidden(A,B) -> m1_subset_1(A,C))) # label(t4_subset) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	34 (exists A l1_orders_2(A)) # label(existence_l1_orders_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	35 (all A (v1_xboole_0(A) -> v3_membered(A) & v5_membered(A) & v4_membered(A) & v2_membered(A) & v1_membered(A))) # label(cc15_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	36 (all A (v4_membered(A) -> (all B (m1_subset_1(B,A) -> v1_xreal_0(B) & v1_rat_1(B) & v1_int_1(B) & v1_xcmplx_0(B))))) # label(cc13_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	37 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	38 (exists A (v1_membered(A) & v2_membered(A) & v4_membered(A) & v5_membered(A) & v3_membered(A) & -v1_xboole_0(A))) # label(rc1_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	39 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	40 (exists A (v1_relat_1(A) & v1_funct_1(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	41 (all A all B all C (m2_relset_1(C,A,B) -> m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))))) # label(dt_m2_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	42 (exists A l1_struct_0(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	43 (all A all B all C all D (-v1_xboole_0(A) & m1_relset_1(C,A,B) & -v1_xboole_0(D) & m1_subset_1(D,k1_zfmisc_1(A)) & v1_funct_2(C,A,B) & v1_funct_1(C) & -v1_xboole_0(B) -> -v1_xboole_0(k9_relat_1(C,D)))) # label(fc1_waybel_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	44 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	45 (all A (v1_xboole_0(A) -> v1_finset_1(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	46 (all A all B (v1_funct_1(A) & v1_finset_1(B) & v1_relat_1(A) -> v1_finset_1(k9_relat_1(A,B)))) # label(fc13_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	47 (all A all B (m1_subset_1(A,B) -> r2_hidden(A,B) | v1_xboole_0(B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	48 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	49 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	50 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	51 (all A (l1_orders_2(A) -> l1_struct_0(A))) # label(dt_l1_orders_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	52 (all A all B -(v1_xboole_0(A) & v1_xboole_0(B) & A != B)) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	53 (all A all B all C all D all E (v1_funct_1(E) & m1_relset_1(E,B,C) & v1_funct_2(E,B,C) & m1_relset_1(D,A,B) & v1_funct_2(D,A,B) & v1_funct_1(D) & -v1_xboole_0(B) -> v1_funct_1(k7_funct_2(A,B,C,D,E)) & m2_relset_1(k7_funct_2(A,B,C,D,E),A,C) & v1_funct_2(k7_funct_2(A,B,C,D,E),A,C))) # label(dt_k7_funct_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	54 (exists A (-v3_struct_0(A) & l1_struct_0(A))) # label(rc3_struct_0) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	55 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	56 (all A (v5_membered(A) -> (all B (m1_subset_1(B,A) -> v1_xreal_0(B) & v1_int_1(B) & v1_rat_1(B) & v4_ordinal2(B) & v1_xcmplx_0(B))))) # label(cc14_membered) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	57 (exists A (v1_finset_1(A) & -v1_xboole_0(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	58 (all A (-v1_xboole_0(A) -> (exists B (v1_finset_1(B) & -v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)))))) # label(rc3_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	59 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k5_relat_1(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	60 (all A (v1_membered(A) -> (all B (m1_subset_1(B,k1_zfmisc_1(A)) -> v1_membered(B))))) # label(cc16_memberedAlarm clock 
119.69/120.08	Prover9 interrupted
119.69/120.08	EOF