0.05/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.34 % Computer : n027.cluster.edu 0.10/0.34 % Model : x86_64 x86_64 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.34 % Memory : 8042.1875MB 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.34 % CPULimit : 1440 0.10/0.34 % WCLimit : 180 0.10/0.34 % DateTime : Mon Jul 3 08:33:31 EDT 2023 0.10/0.35 % CPUTime : 0.78/1.16 ============================== Prover9 =============================== 0.78/1.16 Prover9 (32) version 2009-11A, November 2009. 0.78/1.16 Process 31874 was started by sandbox on n027.cluster.edu, 0.78/1.16 Mon Jul 3 08:33:32 2023 0.78/1.16 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_31720_n027.cluster.edu". 0.78/1.16 ============================== end of head =========================== 0.78/1.16 0.78/1.16 ============================== INPUT ================================= 0.78/1.16 0.78/1.16 % Reading from file /tmp/Prover9_31720_n027.cluster.edu 0.78/1.16 0.78/1.16 set(prolog_style_variables). 0.78/1.16 set(auto2). 0.78/1.16 % set(auto2) -> set(auto). 0.78/1.16 % set(auto) -> set(auto_inference). 0.78/1.16 % set(auto) -> set(auto_setup). 0.78/1.16 % set(auto_setup) -> set(predicate_elim). 0.78/1.16 % set(auto_setup) -> assign(eq_defs, unfold). 0.78/1.16 % set(auto) -> set(auto_limits). 0.78/1.16 % set(auto_limits) -> assign(max_weight, "100.000"). 0.78/1.16 % set(auto_limits) -> assign(sos_limit, 20000). 0.78/1.16 % set(auto) -> set(auto_denials). 0.78/1.16 % set(auto) -> set(auto_process). 0.78/1.16 % set(auto2) -> assign(new_constants, 1). 0.78/1.16 % set(auto2) -> assign(fold_denial_max, 3). 0.78/1.16 % set(auto2) -> assign(max_weight, "200.000"). 0.78/1.16 % set(auto2) -> assign(max_hours, 1). 0.78/1.16 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.78/1.16 % set(auto2) -> assign(max_seconds, 0). 0.78/1.16 % set(auto2) -> assign(max_minutes, 5). 0.78/1.16 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.78/1.16 % set(auto2) -> set(sort_initial_sos). 0.78/1.16 % set(auto2) -> assign(sos_limit, -1). 0.78/1.16 % set(auto2) -> assign(lrs_ticks, 3000). 0.78/1.16 % set(auto2) -> assign(max_megs, 400). 0.78/1.16 % set(auto2) -> assign(stats, some). 0.78/1.16 % set(auto2) -> clear(echo_input). 0.78/1.16 % set(auto2) -> set(quiet). 0.78/1.16 % set(auto2) -> clear(print_initial_clauses). 0.78/1.16 % set(auto2) -> clear(print_given). 0.78/1.16 assign(lrs_ticks,-1). 0.78/1.16 assign(sos_limit,10000). 0.78/1.16 assign(order,kbo). 0.78/1.16 set(lex_order_vars). 0.78/1.16 clear(print_given). 0.78/1.16 0.78/1.16 % formulas(sos). % not echoed (60 formulas) 0.78/1.16 0.78/1.16 ============================== end of input ========================== 0.78/1.16 0.78/1.16 % From the command line: assign(max_seconds, 1440). 0.78/1.16 0.78/1.16 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.78/1.16 0.78/1.16 % Formulas that are not ordinary clauses: 0.78/1.16 1 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 2 (all A (v1_xboole_0(A) -> v1_relat_1(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 3 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 4 (all A all B all C -(m1_subset_1(B,k1_zfmisc_1(C)) & v1_xboole_0(C) & r2_hidden(A,B))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 5 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 6 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 7 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 8 (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.78/1.16 9 (all A (v1_xboole_0(A) -> k1_xboole_0 = A)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 10 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 11 (all A all B all C (m1_relset_1(C,A,B) -> C = k6_relset_1(A,B,k6_relset_1(A,B,C)))) # label(involutiveness_k6_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 12 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 13 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 14 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 15 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.78/1.16 16 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(B,A))) -> v1_funct_2(k6_relset_2(A,B,C),k1_zfmisc_1(B),k1_zfmisc_1(A)) & m2_relset_1(k6_relset_2(A,B,C),k1_zfmisc_1(B),k1_zfmisc_1(A)) & v1_funct_1(k6_relset_2(A,B,C)))) # label(dt_k6_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 17 (all A all B all C all D (m1_subset_1(C,k1_zfmisc_1(A)) & m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> k8_relset_2(A,B,C,D) = k7_relset_2(A,B,C,D))) # label(redefinition_k8_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 18 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) -> (all D (m1_subset_1(D,k1_zfmisc_1(A)) -> (all E (m1_subset_1(E,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> (r1_tarski(C,D) -> r1_tarski(k8_relset_2(A,B,D,E),k8_relset_2(A,B,C,E))))))))) # label(t32_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 19 (all A all B exists C m1_relset_1(C,A,B)) # label(existence_m1_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 20 (all A all B (v1_relat_1(B) -> v1_funct_1(k5_relset_2(A,B)) & v1_relat_1(k5_relset_2(A,B)))) # label(dt_k5_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 21 (all A all B v1_relat_1(k2_zfmisc_1(A,B))) # label(fc1_sysrel) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 22 (exists A (v1_relat_1(A) & v3_relat_1(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 23 (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.82/1.16 24 (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.82/1.16 25 (all A all B all C all D (m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(A,B))) & m1_subset_1(C,k1_zfmisc_1(A)) -> m1_subset_1(k8_relset_2(A,B,C,D),k1_zfmisc_1(B)))) # label(dt_k8_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 26 (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.82/1.16 27 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) -> (all D (m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> k8_setfam_1(B,k4_relset_2(k1_zfmisc_1(A),B,k6_relset_2(B,A,D),k3_pua2mss1(C))) = k7_relset_2(A,B,C,D))))) # label(d4_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 28 (all A all B exists C (m1_relset_1(C,A,B) & v1_funct_1(C) & v1_relat_1(C))) # label(rc2_partfun1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 29 (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.82/1.16 30 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 31 (all A all B (m1_eqrel_1(B,A) -> m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A))))) # label(dt_m1_eqrel_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 32 (all A exists B m1_eqrel_1(B,A)) # label(existence_m1_eqrel_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 33 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 34 (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.82/1.16 35 (all A all B all C all D (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,k1_zfmisc_1(B)))) -> k9_relat_1(C,D) = k4_relset_2(A,B,C,D))) # label(redefinition_k4_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 36 (exists A (-v1_xboole_0(A) & v1_relat_1(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 37 $T # label(dt_k7_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 38 (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.82/1.16 39 (all A all B -(v1_xboole_0(B) & A != B & v1_xboole_0(A))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 40 (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.82/1.16 41 (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.82/1.16 42 (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.82/1.16 43 (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.82/1.16 44 (exists A (v1_xboole_0(A) & v1_relat_1(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 45 (all A m1_eqrel_1(k3_pua2mss1(A),A)) # label(dt_k3_pua2mss1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 46 (all A all B (-v1_xboole_0(A) & -v1_xboole_0(B) -> -v1_xboole_0(k2_zfmisc_1(A,B)))) # label(fc4_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 47 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(B,A))) -> k6_relset_2(A,B,C) = k5_relset_2(B,C))) # label(redefinition_k6_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 48 (all A all B all C all D (m1_subset_1(C,k1_zfmisc_1(k2_zfmisc_1(A,k1_zfmisc_1(B)))) -> m1_subset_1(k4_relset_2(A,B,C,D),k1_zfmisc_1(k1_zfmisc_1(B))))) # label(dt_k4_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 49 (all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) -> (all D (m1_subset_1(D,k1_zfmisc_1(B)) -> (all E (m2_relset_1(E,A,B) -> (r1_tarski(D,k8_relset_2(A,B,C,E)) <-> r1_tarski(C,k8_relset_2(B,A,D,k6_relset_1(A,B,E)))))))))) # label(t61_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 50 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 51 (all A all B (m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A))) -> m1_subset_1(k8_setfam_1(A,B),k1_zfmisc_1(A)))) # label(dt_k8_setfam_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 52 (all A all B all C (m1_relset_1(C,A,B) -> k4_relat_1(C) = k6_relset_1(A,B,C))) # label(redefinition_k6_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 53 (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.82/1.16 54 (all A (v1_xboole_0(A) -> v1_xboole_0(k4_relat_1(A)) & v1_relat_1(k4_relat_1(A)))) # label(fc11_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.16 55 -(all A all B all C (m1_subset_1(C,k1_zfmisc_1(A)) -> (all D (m1_subset_1(D,k1_zfmisc_1(B)) -> (all E (m2_relset_1(E,A,B) -> k8_relset_2(A,B,k8_relset_2(B,A,k8_relset_2(A,B,C,E),k6_relset_1(A,B,E)),E) = k8_relset_2(A,B,C,E) & k8_relset_2(B,A,k8_relset_2(A,B,k8_relset_2(B,A,D,k6_relset_1(A,B,E)),E),k6_relset_1(A,B,E)) = k8_relset_2(B,A,D,k6_relset_1(A,B,E)))))))) # label(t64_relset_2) # label(negated_conjecture) # label(non_clause). [assumption]. 0.82/1.16 0.82/1.16 ============================== end of process non-clausal formulas === 0.82/1.16 0.82/1.16 ============================== PROCESS INITIAL CLAUSES =============== 0.82/1.16 0.82/1.16 ============================== PREDICATE ELIMINATION ================= 0.82/1.16 56 -m1_eqrel_1(A,B) | m1_subset_1(A,k1_zfmisc_1(k1_zfmisc_1(B))) # label(dt_m1_eqrel_1) # label(axiom). [clausify(31)]. 0.82/1.16 57 m1_eqrel_1(f5(A),A) # label(existence_m1_eqrel_1) # label(axiom). [clausify(32)]. 0.82/1.16 58 m1_eqrel_1(k3_pua2mss1(A),A) # label(dt_k3_pua2mss1) # label(axiom). [clausify(45)]. 0.82/1.16 Derived: m1_subset_1(f5(A),k1_zfmisc_1(k1_zfmisc_1(A))). [resolve(56,a,57,a)]. 0.82/1.16 Derived: m1_subset_1(k3_pua2mss1(A),k1_zfmisc_1(k1_zfmisc_1(A))). [resolve(56,a,58,a)]. 0.82/1.16 59 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(40)]. 0.82/1.16 60 m2_relset_1(c8,c4,c5) # label(t64_relset_2) # label(negated_conjecture). [clausify(55)]. 0.82/1.16 61 m2_relset_1(f1(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(1)]. 0.82/1.16 Derived: m1_relset_1(c8,c4,c5). [resolve(59,a,60,a)]. 0.82/1.16 Derived: m1_relset_1(f1(A,B),A,B). [resolve(59,a,61,a)]. 0.82/1.16 62 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(40)]. 0.82/1.16 63 -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(24)]. 0.82/1.16 Derived: m1_subset_1(c8,k1_zfmisc_1(k2_zfmisc_1(c4,c5))). [resolve(63,a,60,a)]. 0.82/1.16 Derived: m1_subset_1(f1(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(63,a,61,a)]. 0.82/1.16 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(63,a,62,a)]. 0.82/1.17 64 -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(53)]. 0.82/1.17 Derived: -m1_relset_1(A,B,C) | m1_relset_1(k6_relset_1(B,C,A),C,B). [resolve(64,b,59,a)]. 0.82/1.17 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(64,b,63,a)]. 0.82/1.17 65 -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | m2_relset_1(k6_relset_2(C,B,A),k1_zfmisc_1(B),k1_zfmisc_1(C)) # label(dt_k6_relset_2) # label(axiom). [clausify(16)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | m1_relset_1(k6_relset_2(C,B,A),k1_zfmisc_1(B),k1_zfmisc_1(C)). [resolve(65,b,59,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | m1_subset_1(k6_relset_2(C,B,A),k1_zfmisc_1(k2_zfmisc_1(k1_zfmisc_1(B),k1_zfmisc_1(C)))). [resolve(65,b,63,a)]. 0.82/1.17 66 -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | -m2_relset_1(E,B,D) | -r1_tarski(C,k8_relset_2(B,D,A,E)) | r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,E))) # label(t61_relset_2) # label(axiom). [clausify(49)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(c4)) | -m1_subset_1(B,k1_zfmisc_1(c5)) | -r1_tarski(B,k8_relset_2(c4,c5,A,c8)) | r1_tarski(A,k8_relset_2(c5,c4,B,k6_relset_1(c4,c5,c8))). [resolve(66,c,60,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | -r1_tarski(C,k8_relset_2(B,D,A,f1(B,D))) | r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,f1(B,D)))). [resolve(66,c,61,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | -r1_tarski(C,k8_relset_2(B,D,A,E)) | r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,E))) | -m1_relset_1(E,B,D). [resolve(66,c,62,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | -r1_tarski(C,k8_relset_2(B,D,A,k6_relset_1(D,B,E))) | r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,k6_relset_1(D,B,E)))) | -m1_relset_1(E,D,B). [resolve(66,c,64,b)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(k1_zfmisc_1(B))) | -m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(D))) | -r1_tarski(C,k8_relset_2(k1_zfmisc_1(B),k1_zfmisc_1(D),A,k6_relset_2(D,B,E))) | r1_tarski(A,k8_relset_2(k1_zfmisc_1(D),k1_zfmisc_1(B),C,k6_relset_1(k1_zfmisc_1(B),k1_zfmisc_1(D),k6_relset_2(D,B,E)))) | -m1_subset_1(E,k1_zfmisc_1(k2_zfmisc_1(B,D))). [resolve(66,c,65,b)]. 0.82/1.17 67 -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | -m2_relset_1(E,B,D) | r1_tarski(C,k8_relset_2(B,D,A,E)) | -r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,E))) # label(t61_relset_2) # label(axiom). [clausify(49)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(c4)) | -m1_subset_1(B,k1_zfmisc_1(c5)) | r1_tarski(B,k8_relset_2(c4,c5,A,c8)) | -r1_tarski(A,k8_relset_2(c5,c4,B,k6_relset_1(c4,c5,c8))). [resolve(67,c,60,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | r1_tarski(C,k8_relset_2(B,D,A,f1(B,D))) | -r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,f1(B,D)))). [resolve(67,c,61,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | r1_tarski(C,k8_relset_2(B,D,A,E)) | -r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,E))) | -m1_relset_1(E,B,D). [resolve(67,c,62,a)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(B)) | -m1_subset_1(C,k1_zfmisc_1(D)) | r1_tarski(C,k8_relset_2(B,D,A,k6_relset_1(D,B,E))) | -r1_tarski(A,k8_relset_2(D,B,C,k6_relset_1(B,D,k6_relset_1(D,B,E)))) | -m1_relset_1(E,D,B). [resolve(67,c,64,b)]. 0.82/1.17 Derived: -m1_subset_1(A,k1_zfmisc_1(k1_zfmisc_1(B))) | -m1_subset_1(C,k1_zfmisc_1(k1_zfmisc_1(D))) | r1_tarski(C,k8_relset_2(k1_zfmisc_1(B),k1_zfmisc_1(D),A,k6_relset_2(D,B,E))) | -r1_tarski(A,k8_relset_2(k1_zfmisc_1(D),k1_zfmisc_1(B),C,k6_relset_1(k1_zfmisc_1(B),k1_zfmisc_1(D),k6_relset_2(D,B,E)))) | -m1_subset_1(E,k1_zfmisc_1(k2_zfmisc_1(B,D))). [resolve(67,c,65,b)]. 0.82/1.17 0.82/1.17 ============================== end predicate elimination ============= 0.82/1.17 0.82/1.17 Auto_denials: (non-Horn, no changes). 0.82/1.17 0.82/1.17 Term ordering decisions: 0.82/1.17 Function symbol KB weights: k1_xboole_0=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. k2_zfmisc_1=1. k5_relset_2=1. k8_setfam_1=1. k9_relat_Alarm clock 179.43/180.08 Prover9 interrupted 179.43/180.09 EOF