0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.33 % Computer : n016.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1440 0.11/0.33 % WCLimit : 180 0.11/0.33 % DateTime : Mon Jul 3 03:49:34 EDT 2023 0.11/0.33 % CPUTime : 0.41/0.99 ============================== Prover9 =============================== 0.41/0.99 Prover9 (32) version 2009-11A, November 2009. 0.41/0.99 Process 20713 was started by sandbox on n016.cluster.edu, 0.41/0.99 Mon Jul 3 03:49:34 2023 0.41/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_20560_n016.cluster.edu". 0.41/0.99 ============================== end of head =========================== 0.41/0.99 0.41/0.99 ============================== INPUT ================================= 0.41/0.99 0.41/0.99 % Reading from file /tmp/Prover9_20560_n016.cluster.edu 0.41/0.99 0.41/0.99 set(prolog_style_variables). 0.41/0.99 set(auto2). 0.41/0.99 % set(auto2) -> set(auto). 0.41/0.99 % set(auto) -> set(auto_inference). 0.41/0.99 % set(auto) -> set(auto_setup). 0.41/0.99 % set(auto_setup) -> set(predicate_elim). 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.41/0.99 % set(auto) -> set(auto_limits). 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.41/0.99 % set(auto) -> set(auto_denials). 0.41/0.99 % set(auto) -> set(auto_process). 0.41/0.99 % set(auto2) -> assign(new_constants, 1). 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.41/0.99 % set(auto2) -> assign(max_hours, 1). 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.41/0.99 % set(auto2) -> assign(max_seconds, 0). 0.41/0.99 % set(auto2) -> assign(max_minutes, 5). 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.41/0.99 % set(auto2) -> set(sort_initial_sos). 0.41/0.99 % set(auto2) -> assign(sos_limit, -1). 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.41/0.99 % set(auto2) -> assign(max_megs, 400). 0.41/0.99 % set(auto2) -> assign(stats, some). 0.41/0.99 % set(auto2) -> clear(echo_input). 0.41/0.99 % set(auto2) -> set(quiet). 0.41/0.99 % set(auto2) -> clear(print_initial_clauses). 0.41/0.99 % set(auto2) -> clear(print_given). 0.41/0.99 assign(lrs_ticks,-1). 0.41/0.99 assign(sos_limit,10000). 0.41/0.99 assign(order,kbo). 0.41/0.99 set(lex_order_vars). 0.41/0.99 clear(print_given). 0.41/0.99 0.41/0.99 % formulas(sos). % not echoed (47 formulas) 0.41/0.99 0.41/0.99 ============================== end of input ========================== 0.41/0.99 0.41/0.99 % From the command line: assign(max_seconds, 1440). 0.41/0.99 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.41/0.99 0.41/0.99 % Formulas that are not ordinary clauses: 0.41/0.99 1 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 2 (all A (one_sorted_str(A) & -empty_carrier(A) -> (exists B (element(B,powerset(the_carrier(A))) & -empty(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 3 (all A (v3_membered(A) -> (all B (element(B,powerset(A)) -> v2_membered(B) & v3_membered(B) & v1_membered(B))))) # label(cc18_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 4 (all A (v5_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B) & v3_membered(B) & v5_membered(B) & v4_membered(B))))) # label(cc20_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 5 (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.41/0.99 6 (all A (v3_membered(A) -> v2_membered(A))) # label(cc3_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 7 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 8 (all A all B -(empty(A) & empty(B) & B != A)) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 9 (exists A (v1_membered(A) & v3_membered(A) & v5_membered(A) & v4_membered(A) & v2_membered(A) & -empty(A))) # label(rc1_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 10 (all A all B (element(B,powerset(A)) -> element(subset_complement(A,B),powerset(A)))) # label(dt_k3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 11 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 12 (all A (one_sorted_str(A) & -empty_carrier(A) -> -empty(the_carrier(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 13 (all A (v2_membered(A) -> (all B (element(B,A) -> v1_xreal_0(B) & v1_xcmplx_0(B))))) # label(cc11_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 14 (all A (empty(A) -> v2_membered(A) & v4_membered(A) & v5_membered(A) & v3_membered(A) & v1_membered(A))) # label(cc15_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 15 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 16 (all A (v1_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B))))) # label(cc10_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 17 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 18 (all A (v2_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v2_membered(B))))) # label(cc17_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 19 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 20 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 21 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 22 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 23 (all A all B all C (element(C,powerset(A)) -> -(in(B,C) & in(B,subset_complement(A,C))))) # label(t54_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 24 (all A (v2_membered(A) -> v1_membered(A))) # label(cc4_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 25 (all A (v5_membered(A) -> v4_membered(A))) # label(cc1_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 26 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 27 (all A all B (element(B,powerset(A)) -> B = subset_complement(A,subset_complement(A,B)))) # label(involutiveness_k3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 28 (all A (v4_membered(A) -> v3_membered(A))) # label(cc2_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 29 (all A (A != empty_set -> (all B (element(B,powerset(A)) -> (all C (element(C,A) -> (-in(C,B) -> in(C,subset_complement(A,B))))))))) # label(t50_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 30 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 31 (all A (v1_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B))))) # label(cc16_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 32 (all A (v3_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_rat_1(B) & v1_xreal_0(B))))) # label(cc12_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 33 (all A (v5_membered(A) -> (all B (element(B,A) -> natural(B) & v1_rat_1(B) & v1_int_1(B) & v1_xreal_0(B) & v1_xcmplx_0(B))))) # label(cc14_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 34 (exists A (one_sorted_str(A) & -empty_carrier(A))) # label(rc3_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 35 (all A all B all C -(element(B,powerset(C)) & empty(C) & in(A,B))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 36 (all A (v4_membered(A) -> (all B (element(B,A) -> v1_xcmplx_0(B) & v1_int_1(B) & v1_rat_1(B) & v1_xreal_0(B))))) # label(cc13_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 37 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 38 (all A (v4_membered(A) -> (all B (element(B,powerset(A)) -> v1_membered(B) & v4_membered(B) & v3_membered(B) & v2_membered(B))))) # label(cc19_membered) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 39 (exists A one_sorted_str(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 40 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 41 -(all A (one_sorted_str(A) & -empty_carrier(A) -> (all B (element(B,powerset(the_carrier(A))) -> (all C (element(C,the_carrier(A)) -> (-in(C,B) <-> in(C,subset_complement(the_carrier(A),B))))))))) # label(l40_tops_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.41/0.99 0.41/0.99 ============================== end of process non-clausal formulas === 0.41/0.99 0.41/0.99 ============================== PROCESS INITIAL CLAUSES =============== 0.81/1.09 0.81/1.09 ============================== PREDICATE ELIMINATION ================= 0.81/1.09 42 -one_sorted_str(A) | empty_carrier(A) | -empty(f1(A)) # label(rc5_struct_0) # label(axiom). [clausify(2)]. 0.81/1.09 43 one_sorted_str(c2) # label(rc3_struct_0) # label(axiom). [clausify(34)]. 0.81/1.09 44 one_sorted_str(c3) # label(existence_l1_struct_0) # label(axiom). [clausify(39)]. 0.81/1.09 45 one_sorted_str(c4) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 Derived: empty_carrier(c2) | -empty(f1(c2)). [resolve(42,a,43,a)]. 0.81/1.09 Derived: empty_carrier(c3) | -empty(f1(c3)). [resolve(42,a,44,a)]. 0.81/1.09 Derived: empty_carrier(c4) | -empty(f1(c4)). [resolve(42,a,45,a)]. 0.81/1.09 46 -one_sorted_str(A) | empty_carrier(A) | -empty(the_carrier(A)) # label(fc1_struct_0) # label(axiom). [clausify(12)]. 0.81/1.09 Derived: empty_carrier(c2) | -empty(the_carrier(c2)). [resolve(46,a,43,a)]. 0.81/1.09 Derived: empty_carrier(c3) | -empty(the_carrier(c3)). [resolve(46,a,44,a)]. 0.81/1.09 Derived: empty_carrier(c4) | -empty(the_carrier(c4)). [resolve(46,a,45,a)]. 0.81/1.09 47 -one_sorted_str(A) | empty_carrier(A) | element(f1(A),powerset(the_carrier(A))) # label(rc5_struct_0) # label(axiom). [clausify(2)]. 0.81/1.09 Derived: empty_carrier(c2) | element(f1(c2),powerset(the_carrier(c2))). [resolve(47,a,43,a)]. 0.81/1.09 Derived: empty_carrier(c3) | element(f1(c3),powerset(the_carrier(c3))). [resolve(47,a,44,a)]. 0.81/1.09 Derived: empty_carrier(c4) | element(f1(c4),powerset(the_carrier(c4))). [resolve(47,a,45,a)]. 0.81/1.09 48 element(A,powerset(B)) | -subset(A,B) # label(t3_subset) # label(axiom). [clausify(20)]. 0.81/1.09 49 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(15)]. 0.81/1.09 50 -element(A,powerset(B)) | subset(A,B) # label(t3_subset) # label(axiom). [clausify(20)]. 0.81/1.09 Derived: element(A,powerset(A)). [resolve(48,b,49,a)]. 0.81/1.09 0.81/1.09 ============================== end predicate elimination ============= 0.81/1.09 0.81/1.09 Auto_denials: (non-Horn, no changes). 0.81/1.09 0.81/1.09 Term ordering decisions: 0.81/1.09 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. subset_complement=1. powerset=1. the_carrier=1. f1=1. f2=1. 0.81/1.09 0.81/1.09 ============================== end of process initial clauses ======== 0.81/1.09 0.81/1.09 ============================== CLAUSES FOR SEARCH ==================== 0.81/1.09 0.81/1.09 ============================== end of clauses for search ============= 0.81/1.09 0.81/1.09 ============================== SEARCH ================================ 0.81/1.09 0.81/1.09 % Starting search at 0.02 seconds. 0.81/1.09 0.81/1.09 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 135 (0.00 of 0.11 sec). 0.81/1.09 0.81/1.09 ============================== PROOF ================================= 0.81/1.09 % SZS status Theorem 0.81/1.09 % SZS output start Refutation 0.81/1.09 0.81/1.09 % Proof 1 at 0.11 (+ 0.00) seconds. 0.81/1.09 % Length of proof is 50. 0.81/1.09 % Level of proof is 8. 0.81/1.09 % Maximum clause weight is 18.000. 0.81/1.09 % Given clauses 500. 0.81/1.09 0.81/1.09 2 (all A (one_sorted_str(A) & -empty_carrier(A) -> (exists B (element(B,powerset(the_carrier(A))) & -empty(B))))) # label(rc5_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 5 (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.81/1.09 10 (all A all B (element(B,powerset(A)) -> element(subset_complement(A,B),powerset(A)))) # label(dt_k3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 12 (all A (one_sorted_str(A) & -empty_carrier(A) -> -empty(the_carrier(A)))) # label(fc1_struct_0) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 23 (all A all B all C (element(C,powerset(A)) -> -(in(B,C) & in(B,subset_complement(A,C))))) # label(t54_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 26 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 27 (all A all B (element(B,powerset(A)) -> B = subset_complement(A,subset_complement(A,B)))) # label(involutiveness_k3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 29 (all A (A != empty_set -> (all B (element(B,powerset(A)) -> (all C (element(C,A) -> (-in(C,B) -> in(C,subset_complement(A,B))))))))) # label(t50_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 30 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 40 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.81/1.09 41 -(all A (one_sorted_str(A) & -empty_carrier(A) -> (all B (element(B,powerset(the_carrier(A))) -> (all C (element(C,the_carrier(A)) -> (-in(C,B) <-> in(C,subset_complement(the_carrier(A),B))))))))) # label(l40_tops_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.81/1.09 42 -one_sorted_str(A) | empty_carrier(A) | -empty(f1(A)) # label(rc5_struct_0) # label(axiom). [clausify(2)]. 0.81/1.09 45 one_sorted_str(c4) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 46 -one_sorted_str(A) | empty_carrier(A) | -empty(the_carrier(A)) # label(fc1_struct_0) # label(axiom). [clausify(12)]. 0.81/1.09 47 -one_sorted_str(A) | empty_carrier(A) | element(f1(A),powerset(the_carrier(A))) # label(rc5_struct_0) # label(axiom). [clausify(2)]. 0.81/1.09 61 empty(empty_set) # label(fc6_membered_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS) # label(axiom). [assumption]. 0.81/1.09 62 element(f2(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(30)]. 0.81/1.09 63 element(c6,the_carrier(c4)) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 64 element(c5,powerset(the_carrier(c4))) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 67 -empty_carrier(c4) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 68 -empty(A) | -in(B,A) # label(t7_boole) # label(axiom). [clausify(40)]. 0.81/1.09 71 -element(A,powerset(B)) | -in(C,A) | -in(C,subset_complement(B,A)) # label(t54_subset_1) # label(axiom). [clausify(23)]. 0.81/1.09 94 -element(A,B) | in(A,B) | empty(B) # label(t2_subset) # label(axiom). [clausify(26)]. 0.81/1.09 100 -in(c6,c5) | in(c6,subset_complement(the_carrier(c4),c5)) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 101 in(c6,c5) | -in(c6,subset_complement(the_carrier(c4),c5)) # label(l40_tops_1) # label(negated_conjecture). [clausify(41)]. 0.81/1.09 102 -in(A,B) | -element(B,powerset(C)) | element(A,C) # label(t4_subset) # label(axiom). [clausify(5)]. 0.81/1.09 103 -element(A,powerset(B)) | element(subset_complement(B,A),powerset(B)) # label(dt_k3_subset_1) # label(axiom). [clausify(10)]. 0.81/1.09 104 -element(A,powerset(B)) | subset_complement(B,subset_complement(B,A)) = A # label(involutiveness_k3_subset_1) # label(axiom). [clausify(27)]. 0.81/1.09 105 empty_set = A | -element(B,powerset(A)) | -element(C,A) | in(C,B) | in(C,subset_complement(A,B)) # label(t50_subset_1) # label(axiom). [clausify(29)]. 0.81/1.09 109 empty_carrier(c4) | -empty(f1(c4)). [resolve(42,a,45,a)]. 0.81/1.09 110 -empty(f1(c4)). [copy(109),unit_del(a,67)]. 0.81/1.09 114 empty_carrier(c4) | -empty(the_carrier(c4)). [resolve(46,a,45,a)]. 0.81/1.09 115 -empty(the_carrier(c4)). [copy(114),unit_del(a,67)]. 0.81/1.09 119 empty_carrier(c4) | element(f1(c4),powerset(the_carrier(c4))). [resolve(47,a,45,a)]. 0.81/1.09 120 element(f1(c4),powerset(the_carrier(c4))). [copy(119),unit_del(a,67)]. 0.81/1.09 123 -in(A,empty_set). [ur(68,a,61,a)]. 0.81/1.09 147 in(f2(A),A) | empty(A). [resolve(94,a,62,a)]. 0.81/1.09 158 element(subset_complement(the_carrier(c4),c5),powerset(the_carrier(c4))). [resolve(103,a,64,a)]. 0.81/1.09 160 subset_complement(the_carrier(c4),subset_complement(the_carrier(c4),c5)) = c5. [resolve(104,a,64,a)]. 0.81/1.09 162 the_carrier(c4) = empty_set | -element(A,the_carrier(c4)) | in(A,c5) | in(A,subset_complement(the_carrier(c4),c5)). [resolve(105,b,64,a),flip(a)]. 0.81/1.09 283 empty(A) | -element(A,powerset(B)) | element(f2(A),B). [resolve(147,a,102,a)]. 0.81/1.09 338 -in(A,subset_complement(the_carrier(c4),c5)) | -in(A,c5). [para(160(a,1),71(c,2)),unit_del(a,158)]. 0.81/1.09 342 the_carrier(c4) = empty_set | in(c6,c5) | in(c6,subset_complement(the_carrier(c4),c5)). [resolve(162,b,63,a)]. 0.81/1.09 575 element(f2(f1(c4)),the_carrier(c4)). [resolve(283,b,120,a),unit_del(a,110)]. 0.81/1.09 585 in(f2(f1(c4)),the_carrier(c4)). [resolve(575,a,94,a),unit_del(b,115)]. 0.81/1.09 694 the_carrier(c4) = empty_set | in(c6,c5). [resolve(342,c,101,b),merge(c)]. 0.81/1.09 696 the_carrier(c4) = empty_set | in(c6,subset_complement(the_carrier(c4),c5)). [resolve(694,b,100,a)]. 0.81/1.09 1000 the_carrier(c4) = empty_set | -in(c6,c5). [resolve(696,b,338,a)]. 0.81/1.09 1006 the_carrier(c4) = empty_set. [resolve(1000,b,694,b),merge(b)]. 0.81/1.10 1039 $F. [back_rewrite(585),rewrite([1006(5)]),unit_del(a,123)]. 0.81/1.10 0.81/1.10 % SZS output end Refutation 0.81/1.10 ============================== end of proof ========================== 0.81/1.10 0.81/1.10 ============================== STATISTICS ============================ 0.81/1.10 0.81/1.10 Given=500. Generated=2160. Kept=982. proofs=1. 0.81/1.10 Usable=474. Sos=366. Demods=8. Limbo=33, Disabled=198. Hints=0. 0.81/1.10 Megabytes=1.09. 0.81/1.10 User_CPU=0.11, System_CPU=0.00, Wall_clock=1. 0.81/1.10 0.81/1.10 ============================== end of statistics ===================== 0.81/1.10 0.81/1.10 ============================== end of search ========================= 0.81/1.10 0.81/1.10 THEOREM PROVED 0.81/1.10 % SZS status Theorem 0.81/1.10 0.81/1.10 Exiting with 1 proof. 0.81/1.10 0.81/1.10 Process 20713 exit (max_proofs) Mon Jul 3 03:49:35 2023 0.81/1.10 Prover9 interrupted 0.81/1.10 EOF