0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n031.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 17:30:29 EDT 2021 0.12/0.34 % CPUTime : 0.75/1.03 ============================== Prover9 =============================== 0.75/1.03 Prover9 (32) version 2009-11A, November 2009. 0.75/1.03 Process 26305 was started by sandbox on n031.cluster.edu, 0.75/1.03 Tue Jul 13 17:30:30 2021 0.75/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_26151_n031.cluster.edu". 0.75/1.03 ============================== end of head =========================== 0.75/1.03 0.75/1.03 ============================== INPUT ================================= 0.75/1.03 0.75/1.03 % Reading from file /tmp/Prover9_26151_n031.cluster.edu 0.75/1.03 0.75/1.03 set(prolog_style_variables). 0.75/1.03 set(auto2). 0.75/1.03 % set(auto2) -> set(auto). 0.75/1.03 % set(auto) -> set(auto_inference). 0.75/1.03 % set(auto) -> set(auto_setup). 0.75/1.03 % set(auto_setup) -> set(predicate_elim). 0.75/1.03 % set(auto_setup) -> assign(eq_defs, unfold). 0.75/1.03 % set(auto) -> set(auto_limits). 0.75/1.03 % set(auto_limits) -> assign(max_weight, "100.000"). 0.75/1.03 % set(auto_limits) -> assign(sos_limit, 20000). 0.75/1.03 % set(auto) -> set(auto_denials). 0.75/1.03 % set(auto) -> set(auto_process). 0.75/1.03 % set(auto2) -> assign(new_constants, 1). 0.75/1.03 % set(auto2) -> assign(fold_denial_max, 3). 0.75/1.03 % set(auto2) -> assign(max_weight, "200.000"). 0.75/1.03 % set(auto2) -> assign(max_hours, 1). 0.75/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.75/1.03 % set(auto2) -> assign(max_seconds, 0). 0.75/1.03 % set(auto2) -> assign(max_minutes, 5). 0.75/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.75/1.03 % set(auto2) -> set(sort_initial_sos). 0.75/1.03 % set(auto2) -> assign(sos_limit, -1). 0.75/1.03 % set(auto2) -> assign(lrs_ticks, 3000). 0.75/1.03 % set(auto2) -> assign(max_megs, 400). 0.75/1.03 % set(auto2) -> assign(stats, some). 0.75/1.03 % set(auto2) -> clear(echo_input). 0.75/1.03 % set(auto2) -> set(quiet). 0.75/1.03 % set(auto2) -> clear(print_initial_clauses). 0.75/1.03 % set(auto2) -> clear(print_given). 0.75/1.03 assign(lrs_ticks,-1). 0.75/1.03 assign(sos_limit,10000). 0.75/1.03 assign(order,kbo). 0.75/1.03 set(lex_order_vars). 0.75/1.03 clear(print_given). 0.75/1.03 0.75/1.03 % formulas(sos). % not echoed (49 formulas) 0.75/1.03 0.75/1.03 ============================== end of input ========================== 0.75/1.03 0.75/1.03 % From the command line: assign(max_seconds, 1200). 0.75/1.03 0.75/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.75/1.03 0.75/1.03 % Formulas that are not ordinary clauses: 0.75/1.03 1 (all A all B all C all D (ordered_pair(C,D) = ordered_pair(A,B) -> B = D & A = C)) # label(t33_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 2 (all A all B (-empty(A) & -empty(B) -> -empty(cartesian_product2(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 3 (exists A (epsilon_transitive(A) & ordinal(A) & epsilon_connected(A))) # label(rc1_ordinal1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 4 (all A (epsilon_connected(A) & epsilon_transitive(A) -> ordinal(A))) # label(cc2_ordinal1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 5 (exists A (ordinal(A) & epsilon_connected(A) & epsilon_transitive(A) & -empty(A))) # label(rc3_ordinal1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 6 (exists A (relation(A) & relation_empty_yielding(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 7 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 8 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 9 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 10 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 11 (exists A (relation(A) & one_to_one(A) & function(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 12 (all A (empty(A) -> ordinal(A) & epsilon_connected(A) & epsilon_transitive(A))) # label(cc3_ordinal1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 13 (all A all B -(empty(A) & empty(B) & A != B)) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 14 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 15 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 16 (exists A (relation(A) & -empty(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 17 (all A (ordinal(A) -> epsilon_connected(A) & epsilon_transitive(A))) # label(cc1_ordinal1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 18 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 19 (all A (empty(A) & function(A) & relation(A) -> relation(A) & one_to_one(A) & function(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 20 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 21 (exists A (relation(A) & empty(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 22 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 23 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 24 (all A ((all B all C all D (singleton(B) = C & in(B,A) & D = singleton(B) & in(B,A) -> C = D)) -> (exists B all C ((exists D (in(D,A) & singleton(D) = C & in(D,A))) <-> in(C,B))))) # label(s1_tarski__e16_22__wellord2__1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 25 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 26 (all A (function(A) <-> (all B all C all D (in(ordered_pair(B,D),A) & in(ordered_pair(B,C),A) -> D = C)))) # label(d1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 27 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 28 (all A all B (element(A,B) -> empty(B) | in(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 29 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 30 (all A all B exists C all D ((exists E exists F (ordered_pair(E,F) = D & singleton(E) = F & in(E,A))) & in(D,cartesian_product2(A,B)) <-> in(D,C))) # label(s1_xboole_0__e16_22__wellord2__1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 31 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 32 (all A all B all C all D (in(A,C) & in(B,D) <-> in(ordered_pair(A,B),cartesian_product2(C,D)))) # label(t106_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 33 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 34 (all A ((all B -(in(B,A) & (all C all D B != ordered_pair(C,D)))) <-> relation(A))) # label(d1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 35 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 36 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 37 (exists A (one_to_one(A) & empty(A) & epsilon_transitive(A) & epsilon_connected(A) & ordinal(A) & function(A) & relation(A))) # label(rc2_ordinal1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 38 (exists A (function(A) & relation(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 39 (exists A (relation(A) & function(A) & empty(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 40 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 41 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 42 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 43 -(all A ((all B all C all D (in(B,A) & singleton(B) = D & in(B,A) & singleton(B) = C -> C = D)) -> (exists B (relation(B) & (all C all D (in(ordered_pair(C,D),B) <-> in(C,A) & D = singleton(C) & in(C,A))) & function(B))))) # label(s1_funct_1__e16_22__wellord2__1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.75/1.03 0.75/1.03 ============================== end of process non-clausal formulas === 0.75/1.03 0.75/1.03 ============================== PROCESS INITIAL CLAUSES =============== 0.75/1.03 0.75/1.03 ============================== PREDICATE ELIMINATION ================= 0.75/1.03 44 -relation(A) | -in(ordered_pair(f16(A),f17(A)),A) | -in(f16(A),c12) | singleton(f16(A)) != f17(A) | -function(A) # label(s1_funct_1__e16_22__wellord2__1) # label(negated_conjecture). [clausify(43)]. 0.75/1.03 45 relation(empty_set) # label(fc12_relat_1_AndRHS_AndLHS) # label(axiom). [assumption]. 0.75/1.03 46 relation(c3) # label(rc3_relat_1) # label(axiom). [clausify(6)]. 0.75/1.03 47 relation(c4) # label(rc3_funct_1) # label(axiom). [clausify(11)]. 0.75/1.03 48 relation(c5) # label(rc2_relat_1) # label(axiom). [clausify(16)]. 0.75/1.03 49 relation(c6) # label(rc1_relat_1) # label(axiom). [clausify(21)]. 0.75/1.03 50 relation(empty_set) # label(fc4_relat_1_AndLHS) # label(axiom). [assumption]. 0.75/1.03 51 relation(c9) # label(rc2_ordinal1) # label(axiom). [clausify(37)]. 0.75/1.03 52 relation(c10) # label(rc1_funct_1) # label(axiom). [clausify(38)]. 0.75/1.03 53 relation(c11) # label(rc2_funct_1) # label(axiom). [clausify(39)]. 0.75/1.03 54 in(f13(A),A) | relation(A) # label(d1_relat_1) # label(axiom). [clausify(34)]. 0.75/1.03 Derived: -in(ordered_pair(f16(empty_set),f17(empty_set)),empty_set) | -in(f16(empty_set),c12) | singleton(f16(empty_set)) != f17(empty_set) | -function(empty_set). [resolve(44,a,45,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c3),f17(c3)),c3) | -in(f16(c3),c12) | singleton(f16(c3)) != f17(c3) | -function(c3). [resolve(44,a,46,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c4),f17(c4)),c4) | -in(f16(c4),c12) | singleton(f16(c4)) != f17(c4) | -function(c4). [resolve(44,a,47,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c5),f17(c5)),c5) | -in(f16(c5),c12) | singleton(f16(c5)) != f17(c5) | -function(c5). [resolve(44,a,48,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c6),f17(c6)),c6) | -in(f16(c6),c12) | singleton(f16(c6)) != f17(c6) | -function(c6). [resolve(44,a,49,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c9),f17(c9)),c9) | -in(f16(c9),c12) | singleton(f16(c9)) != f17(c9) | -function(c9). [resolve(44,a,51,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c10),f17(c10)),c10) | -in(f16(c10),c12) | singleton(f16(c10)) != f17(c10) | -function(c10). [resolve(44,a,52,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(c11),f17(c11)),c11) | -in(f16(c11),c12) | singleton(f16(c11)) != f17(c11) | -function(c11). [resolve(44,a,53,a)]. 0.75/1.03 Derived: -in(ordered_pair(f16(A),f17(A)),A) | -in(f16(A),c12) | singleton(f16(A)) != f17(A) | -function(A) | in(f13(A),A). [resolve(44,a,54,b)]. 0.75/1.03 55 -empty(A) | relation(A) # label(cc1_relat_1) # label(axiom). [clausify(9)]. 0.75/1.03 Derived: -empty(A) | -in(ordered_pair(f16(A),f17(A)),A) | -in(f16(A),c12) | singleton(f16(A)) != f17(A) | -function(A). [resolve(55,b,44,a)]. 0.75/1.03 56 -empty(A) | -function(A) | -relation(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(19)]. 0.75/1.03 Derived: -empty(empty_set) | -function(empty_set) | one_to_one(empty_set). [resolve(56,c,45,a)]. 0.75/1.03 Derived: -empty(c3) | -function(c3) | one_to_one(c3). [resolve(56,c,46,a)]. 0.75/1.03 Derived: -empty(c4) | -function(c4) | one_to_one(c4). [resolve(56,c,47,a)]. 0.75/1.03 Derived: -empty(c5) | -function(c5) | one_to_one(c5). [resolve(56,c,48,a)]. 0.75/1.03 Derived: -empty(c6) | -function(c6) | one_to_one(c6). [resolve(56,c,49,a)]. 0.75/1.03 Derived: -empty(c9) | -function(c9) | one_to_one(c9). [resolve(56,c,51,a)]. 0.75/1.03 Derived: -empty(c10) | -function(c10) | one_to_one(c10). [resolve(56,c,52,a)]. 0.75/1.03 Derived: -empty(c11) | -function(c11) | one_to_one(c11). [resolve(56,c,53,a)]. 0.75/1.03 Derived: -empty(A) | -function(A) | one_to_one(A) | in(f13(A),A). [resolve(56,c,54,b)]. 0.75/1.03 Derived: -empty(A) | -function(A) | one_to_one(A) | -empty(A). [resolve(56,c,55,b)]. 0.75/1.03 57 ordered_pair(A,B) != f13(C) | relation(C) # label(d1_relat_1) # label(axiom). [clausify(34)]. 0.75/1.03 Derived: ordered_pair(A,B) != f13(C) | -in(ordered_pair(f16(C),f17(C)),C) | -in(f16(C),c12) | singleton(f16(C)) != f17(C) | -function(C). [resolve(57,b,44,a)]. 0.75/1.03 58 -in(A,B) | ordered_pair(f14(B,A),f15(B,A)) = A | -relation(B) # label(d1_relat_1) # label(axiom). [clausify(34)]. 0.75/1.03 Derived: -in(A,empty_set) | ordered_pair(f14(empty_set,A),f15(empty_set,A)) = A. [resolve(58,c,45,a)]. 0.75/1.03 Derived: -in(A,c3) | ordered_pair(f14(c3,A),f15(c3,A)) = A. [resolve(58,c,46,a)]. 0.75/1.03 Derived: -in(A,c4) | ordered_pair(f14(c4,A),f15(c4,A)) = A. [resolve(58,c,47,a)]. 0.75/1.03 Derived: -in(A,c5) | ordered_pair(f14(c5,A),f15(c5,A)) = A. [resolve(58,c,48,a)]. 0.75/1.04 Derived: -in(A,c6) | ordered_pair(f14(c6,A),f15(c6,A)) = A. [resolve(58,c,49,a)]. 0.75/1.04 Derived: -in(A,c9) | ordered_pair(f14(c9,A),f15(c9,A)) = A. [resolve(58,c,51,a)]. 0.75/1.04 Derived: -in(A,c10) | ordered_pair(f14(c10,A),f15(c10,A)) = A. [resolve(58,c,52,a)]. 0.75/1.04 Derived: -in(A,c11) | ordered_pair(f14(c11,A),f15(c11,A)) = A. [resolve(58,c,53,a)]. 0.75/1.04 Derived: -in(A,B) | ordered_pair(f14(B,A),f15(B,A)) = A | in(f13(B),B). [resolve(58,c,54,b)]. 0.75/1.04 Derived: -in(A,B) | ordered_pair(f14(B,A),f15(B,A)) = A | -empty(B). [resolve(58,c,55,b)]. 0.75/1.04 Derived: -in(A,B) | ordered_pair(f14(B,A),f15(B,A)) = A | ordered_pair(C,D) != f13(B). [resolve(58,c,57,b)]. 0.75/1.04 59 -relation(A) | in(ordered_pair(f16(A),f17(A)),A) | in(f16(A),c12) | -function(A) # label(s1_funct_1__e16_22__wellord2__1) # label(negated_conjecture). [clausify(43)]. 0.75/1.04 Derived: in(ordered_pair(f16(empty_set),f17(empty_set)),empty_set) | in(f16(empty_set),c12) | -function(empty_set). [resolve(59,a,45,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c3),f17(c3)),c3) | in(f16(c3),c12) | -function(c3). [resolve(59,a,46,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c4),f17(c4)),c4) | in(f16(c4),c12) | -function(c4). [resolve(59,a,47,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c5),f17(c5)),c5) | in(f16(c5),c12) | -function(c5). [resolve(59,a,48,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c6),f17(c6)),c6) | in(f16(c6),c12) | -function(c6). [resolve(59,a,49,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c9),f17(c9)),c9) | in(f16(c9),c12) | -function(c9). [resolve(59,a,51,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c10),f17(c10)),c10) | in(f16(c10),c12) | -function(c10). [resolve(59,a,52,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c11),f17(c11)),c11) | in(f16(c11),c12) | -function(c11). [resolve(59,a,53,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(A),f17(A)),A) | in(f16(A),c12) | -function(A) | in(f13(A),A). [resolve(59,a,54,b)]. 0.75/1.04 Derived: in(ordered_pair(f16(A),f17(A)),A) | in(f16(A),c12) | -function(A) | -empty(A). [resolve(59,a,55,b)]. 0.75/1.04 Derived: in(ordered_pair(f16(A),f17(A)),A) | in(f16(A),c12) | -function(A) | ordered_pair(B,C) != f13(A). [resolve(59,a,57,b)]. 0.75/1.04 60 -relation(A) | in(ordered_pair(f16(A),f17(A)),A) | singleton(f16(A)) = f17(A) | -function(A) # label(s1_funct_1__e16_22__wellord2__1) # label(negated_conjecture). [clausify(43)]. 0.75/1.04 Derived: in(ordered_pair(f16(empty_set),f17(empty_set)),empty_set) | singleton(f16(empty_set)) = f17(empty_set) | -function(empty_set). [resolve(60,a,45,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c3),f17(c3)),c3) | singleton(f16(c3)) = f17(c3) | -function(c3). [resolve(60,a,46,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c4),f17(c4)),c4) | singleton(f16(c4)) = f17(c4) | -function(c4). [resolve(60,a,47,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c5),f17(c5)),c5) | singleton(f16(c5)) = f17(c5) | -function(c5). [resolve(60,a,48,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c6),f17(c6)),c6) | singleton(f16(c6)) = f17(c6) | -function(c6). [resolve(60,a,49,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c9),f17(c9)),c9) | singleton(f16(c9)) = f17(c9) | -function(c9). [resolve(60,a,51,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c10),f17(c10)),c10) | singleton(f16(c10)) = f17(c10) | -function(c10). [resolve(60,a,52,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(c11),f17(c11)),c11) | singleton(f16(c11)) = f17(c11) | -function(c11). [resolve(60,a,53,a)]. 0.75/1.04 Derived: in(ordered_pair(f16(A),f17(A)),A) | singleton(f16(A)) = f17(A) | -function(A) | in(f13(A),A). [resolve(60,a,54,b)]. 0.75/1.04 Derived: in(ordered_pair(f16(A),f17(A)),A) | singleton(f16(A)) = f17(A) | -function(A) | -empty(A). [resolve(60,a,55,b)]. 0.75/1.04 Derived: in(ordered_pair(f16(A),f17(A)),A) | singleton(f16(A)) = f17(A) | -function(A) | ordered_pair(B,C) != f13(A). [resolve(60,a,57,b)]. 0.75/1.04 61 -epsilon_connected(A) | -epsilon_transitive(A) | ordinal(A) # label(cc2_ordinal1) # label(axiom). [clausify(4)]. 0.75/1.04 62 epsilon_transitive(c1) # label(rc1_ordinal1) # label(axiom). [clausify(3)]. 0.75/1.04 63 epsilon_transitive(c2) # label(rc3_ordinal1) # label(axiom). [clausify(5)]. 0.75/1.04 64 epsilon_transitive(c9) # label(rc2_ordinal1) # label(axiom). [clausify(37)]. 0.75/1.04 65 -empty(A) | epsilon_transitive(A) # label(cc3_ordinal1) # label(axiom). [clausify(1Alarm clock 119.79/120.05 Prover9 interrupted 119.79/120.05 EOF