0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n005.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % DateTime : Thu Jul 2 14:11:51 EDT 2020 0.12/0.33 % CPUTime : 0.74/1.11 ============================== Prover9 =============================== 0.74/1.11 Prover9 (32) version 2009-11A, November 2009. 0.74/1.11 Process 31290 was started by sandbox2 on n005.cluster.edu, 0.74/1.11 Thu Jul 2 14:11:52 2020 0.74/1.11 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_31095_n005.cluster.edu". 0.74/1.11 ============================== end of head =========================== 0.74/1.11 0.74/1.11 ============================== INPUT ================================= 0.74/1.11 0.74/1.11 % Reading from file /tmp/Prover9_31095_n005.cluster.edu 0.74/1.11 0.74/1.11 set(prolog_style_variables). 0.74/1.11 set(auto2). 0.74/1.11 % set(auto2) -> set(auto). 0.74/1.11 % set(auto) -> set(auto_inference). 0.74/1.11 % set(auto) -> set(auto_setup). 0.74/1.11 % set(auto_setup) -> set(predicate_elim). 0.74/1.11 % set(auto_setup) -> assign(eq_defs, unfold). 0.74/1.11 % set(auto) -> set(auto_limits). 0.74/1.11 % set(auto_limits) -> assign(max_weight, "100.000"). 0.74/1.11 % set(auto_limits) -> assign(sos_limit, 20000). 0.74/1.11 % set(auto) -> set(auto_denials). 0.74/1.11 % set(auto) -> set(auto_process). 0.74/1.11 % set(auto2) -> assign(new_constants, 1). 0.74/1.11 % set(auto2) -> assign(fold_denial_max, 3). 0.74/1.11 % set(auto2) -> assign(max_weight, "200.000"). 0.74/1.11 % set(auto2) -> assign(max_hours, 1). 0.74/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.74/1.11 % set(auto2) -> assign(max_seconds, 0). 0.74/1.11 % set(auto2) -> assign(max_minutes, 5). 0.74/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.74/1.11 % set(auto2) -> set(sort_initial_sos). 0.74/1.11 % set(auto2) -> assign(sos_limit, -1). 0.74/1.11 % set(auto2) -> assign(lrs_ticks, 3000). 0.74/1.11 % set(auto2) -> assign(max_megs, 400). 0.74/1.11 % set(auto2) -> assign(stats, some). 0.74/1.11 % set(auto2) -> clear(echo_input). 0.74/1.11 % set(auto2) -> set(quiet). 0.74/1.11 % set(auto2) -> clear(print_initial_clauses). 0.74/1.11 % set(auto2) -> clear(print_given). 0.74/1.11 assign(lrs_ticks,-1). 0.74/1.11 assign(sos_limit,10000). 0.74/1.11 assign(order,kbo). 0.74/1.11 set(lex_order_vars). 0.74/1.11 clear(print_given). 0.74/1.11 0.74/1.11 % formulas(sos). % not echoed (65 formulas) 0.74/1.11 0.74/1.11 ============================== end of input ========================== 0.74/1.11 0.74/1.11 % From the command line: assign(max_seconds, 960). 0.74/1.11 0.74/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.74/1.11 0.74/1.11 % Formulas that are not ordinary clauses: 0.74/1.11 1 (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.74/1.11 2 (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.74/1.11 3 (all A all B v1_relat_1(k2_zfmisc_1(A,B))) # label(fc1_sysrel) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 4 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 5 (all A (v1_xboole_0(A) -> A = k1_xboole_0)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 6 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 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.74/1.11 8 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 9 (exists A (v1_relat_1(A) & v1_xboole_0(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 10 (all A (v1_xboole_0(A) -> v1_relat_1(k1_relat_1(A)) & v1_xboole_0(k1_relat_1(A)))) # label(fc7_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 11 (all A all B all C -(r2_hidden(A,B) & v1_xboole_0(C) & m1_subset_1(B,k1_zfmisc_1(C)))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 12 (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.74/1.11 13 $T # label(dt_k2_funct_5) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 14 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k5_relat_1(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.11 15 (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.74/1.12 16 (all A all B (m1_subset_1(A,B) -> v1_xboole_0(B) | r2_hidden(A,B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 17 (all A (v1_relat_1(A) -> (all B (v1_relat_1(B) -> k4_relat_1(k5_relat_1(A,B)) = k5_relat_1(k4_relat_1(B),k4_relat_1(A)))))) # label(t54_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 18 (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.74/1.12 19 (all A (v1_relat_1(A) & -v1_xboole_0(A) -> -v1_xboole_0(k2_relat_1(A)))) # label(fc6_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 20 (all A all B all C (r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) -> m1_subset_1(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 21 (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.74/1.12 22 (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.74/1.12 23 (all A (v1_relat_1(A) -> k2_funct_5(A) = k2_relat_1(A) & k1_relat_1(A) = k1_funct_5(A))) # label(t21_funct_5) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 24 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 25 (all A all B -(v1_xboole_0(A) & v1_xboole_0(B) & B != A)) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 26 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 27 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 28 (all A all B all C (m1_relset_1(C,A,B) -> k4_relset_1(A,B,C) = k1_relat_1(C))) # label(redefinition_k4_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 29 (all A (v1_xboole_0(A) -> v1_relat_1(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 30 (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.74/1.12 31 (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.74/1.12 32 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 33 (all A (-v1_xboole_0(A) & v1_relat_1(A) -> -v1_xboole_0(k1_relat_1(A)))) # label(fc5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 34 $T # label(dt_m1_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 35 (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.74/1.12 36 (all A all B all C all D all E (m1_subset_1(E,k1_zfmisc_1(k2_zfmisc_1(B,C))) & m1_subset_1(D,k1_zfmisc_1(k2_zfmisc_1(A,B))) -> 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.74/1.12 37 (all A all B all C all D (m1_relset_1(C,A,B) -> k10_relset_1(A,B,C,D) = k9_relat_1(C,D))) # label(redefinition_k10_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 38 (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.74/1.12 39 (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.74/1.12 40 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 41 (all A (-v1_xboole_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(A)) & -v1_xboole_0(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 42 (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.74/1.12 43 (exists A (-v1_xboole_0(A) & v1_relat_1(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 44 (all A all B (v1_relat_1(B) & v1_xboole_0(A) -> v1_xboole_0(k5_relat_1(A,B)) & v1_relat_1(k5_relat_1(A,B)))) # label(fc9_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 45 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 46 (all A all B all C (m2_relset_1(C,B,A) -> k1_funct_5(C) = k10_relset_1(A,B,k6_relset_1(B,A,C),A) & k2_funct_5(C) = k10_relset_1(B,A,C,B))) # label(t51_relset_2) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 47 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 48 (exists A (v1_relat_1(A) & v3_relat_1(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 49 (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.74/1.12 50 (all A all B -(v1_xboole_0(B) & r2_hidden(A,B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 51 (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.74/1.12 52 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 53 (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.74/1.12 54 (all A all B exists C m2_relset_1(C,A,B)) # label(existence_m2_relset_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 55 (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.74/1.12 56 (all A (v1_xboole_0(A) -> v1_relat_1(k2_relat_1(A)) & v1_xboole_0(k2_relat_1(A)))) # label(fc8_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 57 (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.74/1.12 58 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 59 $T # label(dt_k1_funct_5) # label(axiom) # label(non_clause). [assumption]. 0.74/1.12 60 -(all A all B all C all D (m2_relset_1(D,A,B) -> (all E (m2_relset_1(E,B,C) -> r1_tarski(k1_funct_5(k9_relset_2(A,B,C,D,E)),k1_funct_5(D)) & k1_funct_5(k9_relset_2(A,B,C,D,E)) = k10_relset_1(B,A,k6_relset_1(A,B,D),k1_funct_5(E)))))) # label(t52_relset_2) # label(negated_conjecture) # label(non_clause). [assumption]. 0.74/1.12 0.74/1.12 ============================== end of process non-clausal formulas === 0.74/1.12 0.74/1.12 ============================== PROCESS INITIAL CLAUSES =============== 0.74/1.12 0.74/1.12 ============================== PREDICATE ELIMINATION ================= 0.74/1.12 61 -m2_relset_1(A,B,C) | m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(53)]. 0.74/1.12 62 m2_relset_1(c7,c4,c5) # label(t52_relset_2) # label(negated_conjecture). [clausify(60)]. 0.74/1.12 63 m2_relset_1(c8,c5,c6) # label(t52_relset_2) # label(negated_conjecture). [clausify(60)]. 0.74/1.12 64 m2_relset_1(f5(A,B),A,B) # label(existence_m2_relset_1) # label(axiom). [clausify(54)]. 0.74/1.12 Derived: m1_relset_1(c7,c4,c5). [resolve(61,a,62,a)]. 0.74/1.12 Derived: m1_relset_1(c8,c5,c6). [resolve(61,a,63,a)]. 0.74/1.12 Derived: m1_relset_1(f5(A,B),A,B). [resolve(61,a,64,a)]. 0.74/1.12 65 m2_relset_1(A,B,C) | -m1_relset_1(A,B,C) # label(redefinition_m2_relset_1) # label(axiom). [clausify(53)]. 0.74/1.12 66 -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(42)]. 0.74/1.12 Derived: m1_subset_1(c7,k1_zfmisc_1(k2_zfmisc_1(c4,c5))). [resolve(66,a,62,a)]. 0.74/1.12 Derived: m1_subset_1(c8,k1_zfmisc_1(k2_zfmisc_1(c5,c6))). [resolve(66,a,63,a)]. 0.74/1.12 Derived: m1_subset_1(f5(A,B),k1_zfmisc_1(k2_zfmisc_1(A,B))). [resolve(66,a,64,a)]. 0.74/1.12 Derived: m1_subset_1(A,k1_zfmisc_1(k2_zfmisc_1(B,C))) | -m1_relset_1(A,B,C). [resolve(66,a,65,a)]. 0.74/1.12 67 -m1_relset_1(A,B,C) | m2_relset_1(k6_relset_1(B,C,A),C,B) # label(dt_k6_relset_1) # laAlarm clock 119.48/120.03 Prover9 interrupted 119.48/120.04 EOF