0.03/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer   : n031.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 960
0.10/0.31	% DateTime   : Thu Jul  2 11:32:18 EDT 2020
0.16/0.31	% CPUTime    : 
0.78/1.12	============================== Prover9 ===============================
0.78/1.12	Prover9 (32) version 2009-11A, November 2009.
0.78/1.12	Process 7196 was started by sandbox2 on n031.cluster.edu,
0.78/1.12	Thu Jul  2 11:32:18 2020
0.78/1.12	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7043_n031.cluster.edu".
0.78/1.12	============================== end of head ===========================
0.78/1.12	
0.78/1.12	============================== INPUT =================================
0.78/1.12	
0.78/1.12	% Reading from file /tmp/Prover9_7043_n031.cluster.edu
0.78/1.12	
0.78/1.12	set(prolog_style_variables).
0.78/1.12	set(auto2).
0.78/1.12	    % set(auto2) -> set(auto).
0.78/1.12	    % set(auto) -> set(auto_inference).
0.78/1.12	    % set(auto) -> set(auto_setup).
0.78/1.12	    % set(auto_setup) -> set(predicate_elim).
0.78/1.12	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/1.12	    % set(auto) -> set(auto_limits).
0.78/1.12	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/1.12	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/1.12	    % set(auto) -> set(auto_denials).
0.78/1.12	    % set(auto) -> set(auto_process).
0.78/1.12	    % set(auto2) -> assign(new_constants, 1).
0.78/1.12	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/1.12	    % set(auto2) -> assign(max_weight, "200.000").
0.78/1.12	    % set(auto2) -> assign(max_hours, 1).
0.78/1.12	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/1.12	    % set(auto2) -> assign(max_seconds, 0).
0.78/1.12	    % set(auto2) -> assign(max_minutes, 5).
0.78/1.12	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/1.12	    % set(auto2) -> set(sort_initial_sos).
0.78/1.12	    % set(auto2) -> assign(sos_limit, -1).
0.78/1.12	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/1.12	    % set(auto2) -> assign(max_megs, 400).
0.78/1.12	    % set(auto2) -> assign(stats, some).
0.78/1.12	    % set(auto2) -> clear(echo_input).
0.78/1.12	    % set(auto2) -> set(quiet).
0.78/1.12	    % set(auto2) -> clear(print_initial_clauses).
0.78/1.12	    % set(auto2) -> clear(print_given).
0.78/1.12	assign(lrs_ticks,-1).
0.78/1.12	assign(sos_limit,10000).
0.78/1.12	assign(order,kbo).
0.78/1.12	set(lex_order_vars).
0.78/1.12	clear(print_given).
0.78/1.12	
0.78/1.12	% formulas(sos).  % not echoed (42 formulas)
0.78/1.12	
0.78/1.12	============================== end of input ==========================
0.78/1.12	
0.78/1.12	% From the command line: assign(max_seconds, 960).
0.78/1.12	
0.78/1.12	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/1.12	
0.78/1.12	% Formulas that are not ordinary clauses:
0.78/1.12	1 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	2 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	3 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	4 (all A (-empty(singleton(A)) & finite(singleton(A)))) # label(fc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	5 (all A all B (relation(A) & relation(B) -> relation(set_difference(A,B)))) # label(fc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	6 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	7 (all A all B (element(B,powerset(powerset(succ(A)))) & ordinal(A) -> ((all C all D all E (C = D & (exists G (set_difference(G,singleton(A)) = E & in(G,B))) & C = E & (exists F (set_difference(F,singleton(A)) = D & in(F,B))) -> E = D)) -> (exists C all D ((exists E (in(E,powerset(A)) & (exists H (D = set_difference(H,singleton(A)) & in(H,B))) & E = D)) <-> in(D,C)))))) # label(s1_tarski__e4_27_3_1__finset_1__1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	8 (all A (empty(A) -> ordinal(A) & epsilon_connected(A) & epsilon_transitive(A))) # label(cc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	9 (all A -empty(succ(A))) # label(fc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	10 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	11 (exists A (relation(A) & one_to_one(A) & function(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	12 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	13 (exists A (epsilon_connected(A) & ordinal(A) & natural(A) & epsilon_transitive(A) & -empty(A))) # label(rc1_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	14 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	15 (all A (relation(A) & empty(A) & function(A) -> function(A) & one_to_one(A) & relation(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	16 (exists A (relation(A) & function(A) & epsilon_transitive(A) & ordinal(A) & epsilon_connected(A) & empty(A) & one_to_one(A))) # label(rc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	17 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B) & finite(B))))) # label(rc3_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	18 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	19 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	20 (exists A (finite(A) & -empty(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	21 (all A (ordinal(A) -> (all B (element(B,A) -> ordinal(B) & epsilon_connected(B) & epsilon_transitive(B))))) # label(cc1_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	22 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	23 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	24 (all A (empty(A) & ordinal(A) -> epsilon_transitive(A) & epsilon_connected(A) & ordinal(A) & natural(A))) # label(cc2_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	25 (all A (ordinal(A) -> epsilon_connected(A) & epsilon_transitive(A))) # label(cc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	26 (all A exists B (element(B,powerset(A)) & empty(B) & function(B) & epsilon_transitive(B) & finite(B) & natural(B) & ordinal(B) & epsilon_connected(B) & one_to_one(B) & relation(B))) # label(rc2_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	27 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	28 $T # label(dt_k1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	29 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	30 (all A exists B (empty(B) & element(B,powerset(A)))) # label(rc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	31 (all A all B (finite(A) -> finite(set_difference(A,B)))) # label(fc12_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	32 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	33 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	34 (all A (ordinal(A) -> -empty(succ(A)) & ordinal(succ(A)) & epsilon_connected(succ(A)) & epsilon_transitive(succ(A)))) # label(fc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	35 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	36 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	37 (exists A (ordinal(A) & epsilon_connected(A) & epsilon_transitive(A))) # label(rc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	38 (exists A (relation(A) & empty(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	39 (all A (natural(A) & ordinal(A) -> -empty(succ(A)) & ordinal(succ(A)) & natural(succ(A)) & epsilon_connected(succ(A)) & epsilon_transitive(succ(A)))) # label(fc2_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	40 (all A (epsilon_connected(A) & epsilon_transitive(A) -> ordinal(A))) # label(cc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	41 (exists A (epsilon_transitive(A) & ordinal(A) & epsilon_connected(A) & -empty(A))) # label(rc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.12	42 -(all A all B (ordinal(A) & element(B,powerset(powerset(succ(A)))) -> (exists C all D ((exists E (in(E,B) & set_difference(E,singleton(A)) = D)) & in(D,powerset(A)) <-> in(D,C))))) # label(s1_xboole_0__e4_27_3_1__fAlarm clock 
119.74/120.02	Prover9 interrupted
119.74/120.03	EOF