0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.30 % Computer : n015.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.30 % CPULimit : 960 0.10/0.30 % DateTime : Thu Jul 2 13:57:15 EDT 2020 0.10/0.30 % CPUTime : 0.83/1.14 ============================== Prover9 =============================== 0.83/1.14 Prover9 (32) version 2009-11A, November 2009. 0.83/1.14 Process 18580 was started by sandbox2 on n015.cluster.edu, 0.83/1.14 Thu Jul 2 13:57:16 2020 0.83/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_18426_n015.cluster.edu". 0.83/1.14 ============================== end of head =========================== 0.83/1.14 0.83/1.14 ============================== INPUT ================================= 0.83/1.14 0.83/1.14 % Reading from file /tmp/Prover9_18426_n015.cluster.edu 0.83/1.14 0.83/1.14 set(prolog_style_variables). 0.83/1.14 set(auto2). 0.83/1.14 % set(auto2) -> set(auto). 0.83/1.14 % set(auto) -> set(auto_inference). 0.83/1.14 % set(auto) -> set(auto_setup). 0.83/1.14 % set(auto_setup) -> set(predicate_elim). 0.83/1.14 % set(auto_setup) -> assign(eq_defs, unfold). 0.83/1.14 % set(auto) -> set(auto_limits). 0.83/1.14 % set(auto_limits) -> assign(max_weight, "100.000"). 0.83/1.14 % set(auto_limits) -> assign(sos_limit, 20000). 0.83/1.14 % set(auto) -> set(auto_denials). 0.83/1.14 % set(auto) -> set(auto_process). 0.83/1.14 % set(auto2) -> assign(new_constants, 1). 0.83/1.14 % set(auto2) -> assign(fold_denial_max, 3). 0.83/1.14 % set(auto2) -> assign(max_weight, "200.000"). 0.83/1.14 % set(auto2) -> assign(max_hours, 1). 0.83/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.83/1.14 % set(auto2) -> assign(max_seconds, 0). 0.83/1.14 % set(auto2) -> assign(max_minutes, 5). 0.83/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.83/1.14 % set(auto2) -> set(sort_initial_sos). 0.83/1.14 % set(auto2) -> assign(sos_limit, -1). 0.83/1.14 % set(auto2) -> assign(lrs_ticks, 3000). 0.83/1.14 % set(auto2) -> assign(max_megs, 400). 0.83/1.14 % set(auto2) -> assign(stats, some). 0.83/1.14 % set(auto2) -> clear(echo_input). 0.83/1.14 % set(auto2) -> set(quiet). 0.83/1.14 % set(auto2) -> clear(print_initial_clauses). 0.83/1.14 % set(auto2) -> clear(print_given). 0.83/1.14 assign(lrs_ticks,-1). 0.83/1.14 assign(sos_limit,10000). 0.83/1.14 assign(order,kbo). 0.83/1.14 set(lex_order_vars). 0.83/1.14 clear(print_given). 0.83/1.14 0.83/1.14 % formulas(sos). % not echoed (79 formulas) 0.83/1.14 0.83/1.14 ============================== end of input ========================== 0.83/1.14 0.83/1.14 % From the command line: assign(max_seconds, 960). 0.83/1.14 0.83/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.83/1.14 0.83/1.14 % Formulas that are not ordinary clauses: 0.83/1.14 1 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 2 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k3_xboole_0(A,B)))) # label(fc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 3 (all A all B all C (m1_relset_1(C,A,B) -> k6_relset_1(A,B,C) = k4_relat_1(C))) # label(redefinition_k6_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 4 (all A all B all C (v1_relat_1(C) -> r1_tarski(k9_relat_1(C,k3_xboole_0(A,B)),k3_xboole_0(k9_relat_1(C,A),k9_relat_1(C,B))))) # label(t154_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 5 (all A (-v1_xboole_0(A) -> (exists B (-v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 6 (exists A (v1_relat_1(A) & v1_xboole_0(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 7 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 8 (all A all B all C (m1_relset_1(C,A,B) -> m2_relset_1(k6_relset_1(A,B,C),B,A))) # label(dt_k6_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 9 (all A all B k3_xboole_0(A,B) = k3_xboole_0(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 10 (all A all B all C (v1_relat_1(C) -> (r1_tarski(A,B) -> r1_tarski(k9_relat_1(C,A),k9_relat_1(C,B))))) # label(t156_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 11 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) & m1_subset_1(B,k1_zfmisc_1(A)) -> B = k5_subset_1(A,B,B))) # label(idempotence_k5_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 12 (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.83/1.14 13 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 14 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 15 (exists A (v1_relat_1(A) & -v1_xboole_0(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 16 (all A (v1_xboole_0(A) -> v1_relat_1(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 17 (all A (v1_relat_1(A) -> k4_relat_1(k4_relat_1(A)) = A)) # label(involutiveness_k4_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 18 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 19 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 20 (all A (v1_xboole_0(A) -> v1_relat_1(k4_relat_1(A)) & v1_xboole_0(k4_relat_1(A)))) # label(fc11_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 21 (all A all B ((all C (r2_hidden(C,A) -> r2_hidden(C,B))) <-> r1_tarski(A,B))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 22 (all A all B all C ((all D (r2_hidden(D,B) & r2_hidden(D,A) <-> r2_hidden(D,C))) <-> C = k3_xboole_0(A,B))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 23 (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.83/1.15 24 (all A all B (m1_subset_1(A,k1_zfmisc_1(B)) <-> r1_tarski(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 25 (all A (v1_relat_1(A) -> v1_relat_1(k4_relat_1(A)))) # label(dt_k4_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 26 (all A all B all C (m1_subset_1(B,k1_zfmisc_1(A)) & m1_subset_1(C,k1_zfmisc_1(A)) -> k3_xboole_0(B,C) = k5_subset_1(A,B,C))) # label(redefinition_k5_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 27 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 28 (all A all B (v1_relat_1(B) -> (all C (v1_relat_1(C) -> k9_relat_1(C,k9_relat_1(B,A)) = k9_relat_1(k5_relat_1(B,C),A))))) # label(t159_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 29 (all A k3_xboole_0(A,k1_xboole_0) = k1_xboole_0) # label(t2_boole) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 30 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> (all D k9_relat_1(C,k3_xboole_0(D,k1_funct_5(C))) = k9_relat_1(C,D)))) # label(t47_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 31 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) & m1_subset_1(B,k1_zfmisc_1(A)) -> k5_subset_1(A,B,C) = k5_subset_1(A,C,B))) # label(commutativity_k5_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 32 (all A (v1_relat_1(A) -> k1_relat_1(A) = k1_funct_5(A) & k2_relat_1(A) = k2_funct_5(A))) # label(t21_funct_5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 33 (all A all B all C (m1_relset_1(C,A,B) -> k1_relat_1(C) = k4_relset_1(A,B,C))) # label(redefinition_k4_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 34 (all A all B (v1_relat_1(B) & v1_xboole_0(A) -> v1_xboole_0(k5_relat_1(B,A)) & v1_relat_1(k5_relat_1(B,A)))) # label(fc10_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 35 (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.83/1.15 36 $T # label(dt_k2_funct_5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 37 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 38 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 39 (all A all B all C -(v1_xboole_0(C) & m1_subset_1(B,k1_zfmisc_1(C)) & r2_hidden(A,B))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 40 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 41 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 42 (all A all B v1_relat_1(k2_zfmisc_1(A,B))) # label(fc1_sysrel) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 43 (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.83/1.15 44 (all A all B (B = A <-> r1_tarski(B,A) & r1_tarski(A,B))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 45 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 46 (all A all B all C (r1_tarski(A,B) & r1_tarski(B,C) -> r1_tarski(A,C))) # label(t1_xboole_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 47 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 48 (all A exists B (v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 49 (all A all B A = k3_xboole_0(A,A)) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 50 (all A all B (-v1_xboole_0(B) & -v1_xboole_0(A) -> -v1_xboole_0(k2_zfmisc_1(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 51 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 52 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 53 (all A all B all C (m1_relset_1(C,A,B) -> m1_subset_1(k4_relset_1(A,B,C),k1_zfmisc_1(A)))) # label(dt_k4_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 54 (all A all B all C (m1_relset_1(C,A,B) -> k6_relset_1(A,B,k6_relset_1(A,B,C)) = C)) # label(involutiveness_k6_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 55 (all A all B (v1_xboole_0(A) & v1_relat_1(B) -> v1_relat_1(k5_relat_1(A,B)) & v1_xboole_0(k5_relat_1(A,B)))) # label(fc9_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 56 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 57 (all A (-v1_xboole_0(A) & v1_relat_1(A) -> -v1_xboole_0(k2_relat_1(A)))) # label(fc6_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 58 (all A all B -(v1_xboole_0(B) & r2_hidden(A,B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 59 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 60 (exists A (v1_relat_1(A) & v3_relat_1(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 61 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) & m1_subset_1(B,k1_zfmisc_1(A)) -> m1_subset_1(k5_subset_1(A,B,C),k1_zfmisc_1(A)))) # label(dt_k5_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 62 (all A (v1_xboole_0(A) -> v1_xboole_0(k2_relat_1(A)) & v1_relat_1(k2_relat_1(A)))) # label(fc8_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 63 (all A all B all C all D all E (m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(A,B))) & m1_subset_1(E,k1_zfmisc_1(k2_zfmisc_1(B,C))) -> k9_relset_2(A,B,C,D,E) = k5_relat_1(D,E))) # label(redefinition_k9_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 64 (all A all B -(B != A & v1_xboole_0(B) & v1_xboole_0(A))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 65 (all A all B all C all D (m1_relset_1(C,A,B) -> m1_subset_1(k10_relset_1(A,B,C,D),k1_zfmisc_1(B)))) # label(dt_k10_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 66 (all A all B all C all D all E (m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(A,B))) & m1_subset_1(E,k1_zfmisc_1(k2_zfmisc_1(B,C))) -> m2_relset_1(k9_relset_2(A,B,C,D,E),A,C))) # label(dt_k9_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 67 (all A all B (v1_relat_1(B) & v1_relat_1(A) -> v1_relat_1(k5_relat_1(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 68 (all A all B all C (m2_relset_1(C,B,A) -> k10_relset_1(A,B,k6_relset_1(B,A,C),A) = k1_funct_5(C) & k2_funct_5(C) = k10_relset_1(B,A,C,B))) # label(t51_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 69 (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.83/1.15 70 $T # label(dt_k1_funct_5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 71 (all A all B all C all D (m1_relset_1(C,A,B) -> k9_relat_1(C,D) = k10_relset_1(A,B,C,D))) # label(redefinition_k10_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 72 (all A (v1_relat_1(A) & -v1_xboole_0(A) -> -v1_xboole_0(k1_relat_1(A)))) # label(fc5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 73 (all A (v1_xboole_0(A) -> v1_xboole_0(k1_relat_1(A)) & v1_relat_1(k1_relat_1(A)))) # label(fc7_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.15 74 -(all A all B all C (m2_relset_1(C,A,B) -> k10_relset_1(A,B,C,A) = k10_relset_1(B,B,k9_relset_2(B,A,B,k6_relset_1(A,B,C),C),B))) # label(t58_relset_2) # label(negated_conjecture) # label(non_clause). [assumption]. 0.83/1.15 0.83/1.15 ============================== end of process non-clausal formulas === 0.83/1.15 0.83/1.15 ============================== PROCESS INITIAL CLAUSES =============== 0.83/1.15 0.83/1.15 ============================== PREDICATE ELIMINATION ================= 0.83/1.15 75 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(35)]. 0.83/1.15 76 m2_relset_1(c6,c4,c5) # label(t58_relset_2) # label(negated_conjecture). [clausify(74)]. 0.83/1.15 77 m2_relset_1(f3(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(13)]. 0.83/1.15 Derived: m1_relset_1(c6,c4,c5). [resolve(75,a,76,a)]. 0.83/1.15 Derived: m1_relset_1(f3(A,B),A,B). [resolve(75,a,77,a)]. 0.83/1.15 78 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(35)]. 0.83/1.15 79 -m2_relset_1(A,B,C) | m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) # label(dt_m2_relset_1) # label(axiom). [clausify(43)]. 0.83/1.15 Derived: m1_subset_1(c6,k1_zfmisc_1(k2_zfmisc_1(c4,c5))). [resolve(79,a,76,a)]. 0.83/1.15 Derived: m1_subset_1(f3(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(79,a,77,a)]. 0.83/1.15 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(79,a,78,a)]. 0.83/1.15 80 -m1_relset_1(A,B,C) | m2_relset_1(k6_relset_1(B,C,A),C,B) # label(dt_k6_relset_1) # label(axiom). [clausify(8)]. 0.83/1.15 Derived: -m1_relset_1(A,B,C) | m1_relset_1(k6_relset_1(B,C,A),C,B). [resolve(80,b,75,a)]. 0.83/1.15 Derived: -m1_relset_1(A,B,C) | m1_subset_1(k6_relset_1(B,C,A),k1_zfmisc_1(k2_zfmisc_1(C,B))). [resolve(80,b,79,a)]. 0.83/1.15 81 -m2_relset_1(A,B,C) | k10_relset_1(B,C,A,B) = k2_funct_5(A) # label(t51_relset_2) # label(axiom). [clausify(68)]. 0.83/1.15 Derived: k10_relset_1(c4,c5,c6,c4) = k2_funct_5(c6). [resolve(81,a,76,a)]. 0.83/1.15 Derived: k10_relset_1(A,B,f3(A,B),A) = k2_funct_5(f3(A,B)). [resolve(81,a,77,a)]. 0.83/1.15 Derived: k10_relset_1(A,B,C,A) = k2_funct_5(C) | -m1_relset_1(C,A,B). [resolve(81,a,78,a)]. 0.83/1.15 Derived: k10_relset_1(A,B,k6_relset_1(B,A,C),A) = k2_funct_5(k6_relset_1(B,A,C)) | -m1_relset_1(C,B,A). [resolve(81,a,80,b)]. 0.83/1.15 82 -m2_relset_1(A,B,C) | k10_relset_1(C,B,k6_relset_1(B,C,A),C) = k1_funct_5(A) # label(t51_relset_2) # label(axiom). [clausify(68)]. 0.83/1.15 Derived: k10_relset_1(c5,c4,k6_relset_1(c4,c5,c6),c5) = k1_funct_5(c6). [resolve(82,a,76,a)]. 0.83/1.15 Derived: k10_relset_1(A,B,k6_relset_1(B,A,f3(B,A)),A) = k1_funct_5(f3(B,A)). [resolve(82,a,77,a)]. 0.83/1.15 Derived: k10_relset_1(A,B,k6_relset_1(B,A,C),A) = k1_funct_5(C) | -m1_relset_1(C,B,A). [resolve(82,a,78,a)]. 0.83/1.15 Derived: k10_relset_1(A,B,k6_relset_1(B,A,k6_relset_1(A,B,C)),A) = k1_funct_5(k6_relset_1(A,B,C)) | -m1_relset_1(C,A,B). [resolve(82,a,80,b)]. 0.83/1.15 83 -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(C,E))) | m2_relset_1(k9_relset_2(B,C,E,A,D),B,E) # label(dt_k9_relset_2) # label(axiom). [clausify(66)]. 0.83/1.15 Derived: -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(C,E))) | m1_relset_1(k9_relset_2(B,C,E,A,D),B,E). [resolve(83,c,75,a)]. 0.83/1.15 Derived: -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(C,E))) | m1_subset_1(k9_relset_2(B,C,E,A,D),k1_zfmisc_1(k2_zfmisc_1(B,E))). [resolve(83,c,79,a)]. 0.83/1.15 Derived: -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(C,E))) | k10_relset_1(B,E,k9_relset_2(B,C,E,A,D),B) = k2_funct_5(k9_relset_2(B,C,E,A,D)). [resolve(83,c,81,a)]. 0.83/1.15 Derived: -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) |Alarm clock 119.71/120.03 Prover9 interrupted 119.71/120.03 EOF