0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n008.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 17:46:38 EDT 2019
0.13/0.34	% CPUTime    : 
0.76/1.06	============================== Prover9 ===============================
0.76/1.06	Prover9 (32) version 2009-11A, November 2009.
0.76/1.06	Process 17357 was started by sandbox2 on n008.cluster.edu,
0.76/1.06	Thu Aug 29 17:46:39 2019
0.76/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_17204_n008.cluster.edu".
0.76/1.06	============================== end of head ===========================
0.76/1.06	
0.76/1.06	============================== INPUT =================================
0.76/1.06	
0.76/1.06	% Reading from file /tmp/Prover9_17204_n008.cluster.edu
0.76/1.06	
0.76/1.06	set(prolog_style_variables).
0.76/1.06	set(auto2).
0.76/1.06	    % set(auto2) -> set(auto).
0.76/1.06	    % set(auto) -> set(auto_inference).
0.76/1.06	    % set(auto) -> set(auto_setup).
0.76/1.06	    % set(auto_setup) -> set(predicate_elim).
0.76/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.76/1.06	    % set(auto) -> set(auto_limits).
0.76/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.76/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.76/1.06	    % set(auto) -> set(auto_denials).
0.76/1.06	    % set(auto) -> set(auto_process).
0.76/1.06	    % set(auto2) -> assign(new_constants, 1).
0.76/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.76/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.76/1.06	    % set(auto2) -> assign(max_hours, 1).
0.76/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.76/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.76/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.76/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.76/1.06	    % set(auto2) -> set(sort_initial_sos).
0.76/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.76/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.76/1.06	    % set(auto2) -> assign(max_megs, 400).
0.76/1.06	    % set(auto2) -> assign(stats, some).
0.76/1.06	    % set(auto2) -> clear(echo_input).
0.76/1.06	    % set(auto2) -> set(quiet).
0.76/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.76/1.06	    % set(auto2) -> clear(print_given).
0.76/1.06	assign(lrs_ticks,-1).
0.76/1.06	assign(sos_limit,10000).
0.76/1.06	assign(order,kbo).
0.76/1.06	set(lex_order_vars).
0.76/1.06	clear(print_given).
0.76/1.06	
0.76/1.06	% formulas(sos).  % not echoed (82 formulas)
0.76/1.06	
0.76/1.06	============================== end of input ==========================
0.76/1.06	
0.76/1.06	% From the command line: assign(max_seconds, 180).
0.76/1.06	
0.76/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.76/1.06	
0.76/1.06	% Formulas that are not ordinary clauses:
0.76/1.06	1 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	2 (all A all B (relation(B) & relation(A) -> relation(set_union2(A,B)))) # label(fc2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	3 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	4 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	5 (exists A (relation(A) & function(A) & relation_non_empty(A))) # label(rc5_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	6 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	7 (all A all B ((all C (in(C,B) <-> A = C)) <-> B = singleton(A))) # label(d1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	8 (exists A (element(A,positive_rationals) & empty(A) & epsilon_transitive(A) & natural(A) & ordinal(A) & epsilon_connected(A))) # label(rc3_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	9 (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.76/1.06	10 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	11 (exists A (relation_empty_yielding(A) & relation(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	12 (exists A (epsilon_transitive(A) & epsilon_connected(A) & natural(A) & ordinal(A) & -empty(A))) # label(rc1_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	13 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	14 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	15 (all A (empty(A) -> finite(A))) # label(cc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	16 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	17 (all A all B -(B != A & empty(B) & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	18 (all A all B set_union2(B,A) = set_union2(A,B)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	19 (all A all B all C ((all D (in(D,C) <-> in(D,B) | in(D,A))) <-> C = set_union2(A,B))) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	20 (all A (-((all B -((all C (in(C,empty_set) -> subset(B,C))) & in(B,empty_set))) & empty_set != empty_set) & (all D all E (in(D,A) & -(empty_set != E & (all F -(in(F,E) & (all G (in(G,E) -> subset(F,G)))))) & subset(E,A) -> -(set_union2(E,singleton(D)) != empty_set & (all H -(in(H,set_union2(E,singleton(D))) & (all I (in(I,set_union2(E,singleton(D))) -> subset(H,I)))))))) & finite(A) -> -((all J -(in(J,A) & (all K (in(K,A) -> subset(J,K))))) & A != empty_set))) # label(s2_finset_1__e6_46__finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	21 (all A all B inclusion_comparable(A,A)) # label(reflexivity_r3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	22 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	23 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	24 (all A exists B (element(B,powerset(A)) & empty(B) & epsilon_transitive(B) & ordinal(B) & finite(B) & natural(B) & epsilon_connected(B) & one_to_one(B) & function(B) & relation(B))) # label(rc2_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	25 (all A all B (finite(A) & finite(B) -> finite(set_union2(A,B)))) # label(fc9_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	26 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	27 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	28 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	29 (all A (ordinal(A) -> epsilon_transitive(A) & epsilon_connected(A))) # label(cc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	30 (all A ((all B all C (in(B,A) & in(C,A) -> inclusion_comparable(B,C))) <-> inclusion_linear(A))) # label(d9_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	31 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	32 (exists A (relation(A) & function(A) & relation_empty_yielding(A))) # label(rc4_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	33 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	34 (all A (empty(A) -> epsilon_transitive(A) & ordinal(A) & epsilon_connected(A))) # label(cc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	35 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	36 (exists A (function(A) & ordinal_yielding(A) & transfinite_sequence(A) & relation(A))) # label(rc2_ordinal2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	37 (all A (empty(A) & function(A) & relation(A) -> function(A) & one_to_one(A) & relation(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	38 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	39 (exists A (relation(A) & empty(A) & function(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	40 (exists A (-empty(A) & finite(A))) # label(rc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	41 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	42 (all A all B all C -(in(A,B) & empty(C) & element(B,powerset(C)))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	43 (all A (element(A,positive_rationals) -> (ordinal(A) -> natural(A) & ordinal(A) & epsilon_connected(A) & epsilon_transitive(A)))) # label(cc4_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	44 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	45 (exists A (relation(A) & function_yielding(A) & function(A))) # label(rc1_funcop_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	46 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	47 (exists A (epsilon_connected(A) & being_limit_ordinal(A) & ordinal(A) & epsilon_transitive(A))) # label(rc1_ordinal2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	48 (all A all B (subset(B,A) | subset(A,B) <-> inclusion_comparable(A,B))) # label(d9_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	49 (all A exists B (empty(B) & element(B,powerset(A)))) # label(rc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	50 (all A (-empty(singleton(A)) & finite(singleton(A)))) # label(fc1_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	51 (exists A (epsilon_connected(A) & ordinal(A) & epsilon_transitive(A) & -empty(A) & element(A,positive_rationals))) # label(rc2_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	52 (all A (epsilon_transitive(A) & epsilon_connected(A) -> ordinal(A))) # label(cc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	53 (all A (finite(A) -> (all B (element(B,powerset(A)) -> finite(B))))) # label(cc2_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	54 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & finite(B) & -empty(B))))) # label(rc4_finset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	55 (exists A (epsilon_transitive(A) & epsilon_connected(A) & ordinal(A))) # label(rc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	56 (all A (-empty(A) -> (exists B (-empty(B) & element(B,powerset(A)))))) # label(rc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	57 (exists A (relation(A) & function(A) & empty(A) & epsilon_transitive(A) & ordinal(A) & epsilon_connected(A) & one_to_one(A))) # label(rc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	58 (all A all B (inclusion_comparable(A,B) -> inclusion_comparable(B,A))) # label(symmetry_r3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	59 (all A all B all C (in(A,B) & element(B,powerset(C)) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	60 (all A A = set_union2(A,empty_set)) # label(t1_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	61 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	62 (exists A (relation(A) & one_to_one(A) & function(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	63 (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.76/1.07	64 (exists A (epsilon_connected(A) & ordinal(A) & epsilon_transitive(A) & -empty(A))) # label(rc3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	65 (all A (empty(A) & ordinal(A) -> epsilon_transitive(A) & epsilon_connected(A) & natural(A) & ordinal(A))) # label(cc2_arytm_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	66 (exists A (relation(A) & function(A) & transfinite_sequence(A))) # label(rc4_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	67 -(all A -(empty_set != A & inclusion_linear(A) & (all B -(in(B,A) & (all C (in(C,A) -> subset(B,C))))) & finite(A))) # label(t30_finset_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.76/1.07	
0.76/1.07	============================== end of process non-clausal formulas ===
0.76/1.07	
0.76/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.76/1.07	
0.76/1.07	============================== PREDICATE ELIMINATION =================
0.76/1.07	68 -empty(A) | -function(A) | -relation(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom).  [clausify(37)].
0.81/1.08	69 function(c1) # label(rc5_funct_1) # label(axiom).  [clausify(5)].
0.81/1.08	70 function(empty_set) # label(fc2_ordinal1_AndRHS_AndLHS) # label(axiom).  [assumption].
0.81/1.08	71 function(f10(A)) # label(rc2_finset_1) # label(axiom).  [clausify(24)].
0.81/1.08	72 function(c8) # label(rc1_funct_1) # label(axiom).  [clausify(27)].
0.81/1.08	73 function(c9) # label(rc4_funct_1) # label(axiom).  [clausify(32)].
0.81/1.08	74 function(c11) # label(rc2_ordinal2) # label(axiom).  [clausify(36)].
0.81/1.08	Derived: -empty(c1) | -relation(c1) | one_to_one(c1).  [resolve(68,b,69,a)].
0.81/1.08	Derived: -empty(empty_set) | -relation(empty_set) | one_to_one(empty_set).  [resolve(68,b,70,a)].
0.81/1.08	Derived: -empty(f10(A)) | -relation(f10(A)) | one_to_one(f10(A)).  [resolve(68,b,71,a)].
0.81/1.08	Derived: -empty(c8) | -relation(c8) | one_to_one(c8).  [resolve(68,b,72,a)].
0.81/1.08	Derived: -empty(c9) | -relation(c9) | one_to_one(c9).  [resolve(68,b,73,a)].
0.81/1.08	Derived: -empty(c11) | -relation(c11) | one_to_one(c11).  [resolve(68,b,74,a)].
0.81/1.08	75 -empty(A) | function(A) # label(cc1_funct_1) # label(axiom).  [clausify(38)].
0.81/1.08	Derived: -empty(A) | -empty(A) | -relation(A) | one_to_one(A).  [resolve(75,b,68,b)].
0.81/1.08	76 function(c12) # label(rc2_funct_1) # label(axiom).  [clausify(39)].
0.81/1.08	77 function(c14) # label(rc1_funcop_1) # label(axiom).  [clausify(45)].
0.81/1.08	78 function(c18) # label(rc2_ordinal1) # label(axiom).  [clausify(57)].
0.81/1.08	79 function(c19) # label(rc3_funct_1) # label(axiom).  [clausify(62)].
0.81/1.08	80 function(c21) # label(rc4_ordinal1) # label(axiom).  [clausify(66)].
0.81/1.08	81 -epsilon_transitive(A) | -epsilon_connected(A) | ordinal(A) # label(cc2_ordinal1) # label(axiom).  [clausify(52)].
0.81/1.08	82 epsilon_transitive(empty_set) # label(fc2_ordinal1_AndRHS_AndRHS_AndRHS_AndLHS) # label(axiom).  [assumption].
0.81/1.08	83 epsilon_transitive(c2) # label(rc3_arytm_3) # label(axiom).  [clausify(8)].
0.81/1.08	84 -ordinal(A) | -element(B,A) | epsilon_transitive(B) # label(cc1_arytm_3) # label(axiom).  [clausify(9)].
0.81/1.08	85 epsilon_transitive(c4) # label(rc1_arytm_3) # label(axiom).  [clausify(12)].
0.81/1.08	86 epsilon_transitive(f10(A)) # label(rc2_finset_1) # label(axiom).  [clausify(24)].
0.81/1.08	87 -ordinal(A) | epsilon_transitive(A) # label(cc1_ordinal1) # label(axiom).  [clausify(29)].
0.81/1.08	88 -empty(A) | epsilon_transitive(A) # label(cc3_ordinal1) # label(axiom).  [clausify(34)].
0.81/1.08	89 -element(A,positive_rationals) | -ordinal(A) | epsilon_transitive(A) # label(cc4_arytm_3) # label(axiom).  [clausify(43)].
0.81/1.08	90 epsilon_transitive(c15) # label(rc1_ordinal2) # label(axiom).  [clausify(47)].
0.81/1.08	91 epsilon_transitive(c16) # label(rc2_arytm_3) # label(axiom).  [clausify(51)].
0.81/1.08	Derived: -epsilon_connected(empty_set) | ordinal(empty_set).  [resolve(81,a,82,a)].
0.81/1.08	Derived: -epsilon_connected(c2) | ordinal(c2).  [resolve(81,a,83,a)].
0.81/1.08	Derived: -epsilon_connected(A) | ordinal(A) | -ordinal(B) | -element(A,B).  [resolve(81,a,84,c)].
0.81/1.08	Derived: -epsilon_connected(c4) | ordinal(c4).  [resolve(81,a,85,a)].
0.81/1.08	Derived: -epsilon_connected(f10(A)) | ordinal(f10(A)).  [resolve(81,a,86,a)].
0.81/1.08	Derived: -epsilon_connected(A) | ordinal(A) | -empty(A).  [resolve(81,a,88,b)].
0.81/1.08	Derived: -epsilon_connected(c15) | ordinal(c15).  [resolve(81,a,90,a)].
0.81/1.08	Derived: -epsilon_connected(c16) | ordinal(c16).  [resolve(81,a,91,a)].
0.81/1.08	92 epsilon_transitive(c17) # label(rc1_ordinal1) # label(axiom).  [clausify(55)].
0.81/1.08	93 epsilon_transitive(c18) # label(rc2_ordinal1) # label(axiom).  [clausify(57)].
0.81/1.08	94 epsilon_transitive(c20) # label(rc3_ordinal1) # label(axiom).  [clausify(64)].
0.81/1.08	Derived: -epsilon_connected(c20) | ordinal(c20).  [resolve(94,a,81,a)].
0.81/1.08	95 -empty(A) | -ordinal(A) | epsilon_transitive(A) # label(cc2_arytm_3) # label(axiom).  [clausify(65)].
0.81/1.08	96 -in(A,B) | -in(C,B) | inclusion_comparable(A,C) | -inclusion_linear(B) # label(d9_ordinal1) # label(axiom).  [clausify(30)].
0.81/1.08	97 in(f11(A),A) | inclusion_linear(A) # label(d9_ordinal1) # label(axiom).  [clausify(30)].
0.81/1.08	98 in(f12(A),A) | inclusion_linear(A) # label(d9_ordinal1) # label(axiom).  [clausify(30)].
0.81/1.08	99 -inclusion_comparable(f11(A),f12(A)) | inclusion_linear(A) # label(d9_ordinal1) # label(axiom).  [clausify(30)].
0.81/1.08	Derived: -in(A,B) | -in(C,B) | inclusion_comparCputime limit exceeded (core dumped)
180.01/180.28	EOF