TSTP Solution File: SEU173+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU173+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 13:29:38 EDT 2022
% Result : Theorem 7.85s 8.16s
% Output : Refutation 7.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU173+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n026.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 : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 23:19:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.08 ============================== Prover9 ===============================
% 0.42/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.08 Process 27421 was started by sandbox on n026.cluster.edu,
% 0.42/1.08 Sun Jun 19 23:19:11 2022
% 0.42/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27234_n026.cluster.edu".
% 0.42/1.08 ============================== end of head ===========================
% 0.42/1.08
% 0.42/1.08 ============================== INPUT =================================
% 0.42/1.08
% 0.42/1.08 % Reading from file /tmp/Prover9_27234_n026.cluster.edu
% 0.42/1.08
% 0.42/1.08 set(prolog_style_variables).
% 0.42/1.08 set(auto2).
% 0.42/1.08 % set(auto2) -> set(auto).
% 0.42/1.08 % set(auto) -> set(auto_inference).
% 0.42/1.08 % set(auto) -> set(auto_setup).
% 0.42/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.08 % set(auto) -> set(auto_limits).
% 0.42/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.08 % set(auto) -> set(auto_denials).
% 0.42/1.08 % set(auto) -> set(auto_process).
% 0.42/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.08 % set(auto2) -> assign(stats, some).
% 0.42/1.08 % set(auto2) -> clear(echo_input).
% 0.42/1.08 % set(auto2) -> set(quiet).
% 0.42/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.08 % set(auto2) -> clear(print_given).
% 0.42/1.08 assign(lrs_ticks,-1).
% 0.42/1.08 assign(sos_limit,10000).
% 0.42/1.08 assign(order,kbo).
% 0.42/1.08 set(lex_order_vars).
% 0.42/1.08 clear(print_given).
% 0.42/1.08
% 0.42/1.08 % formulas(sos). % not echoed (113 formulas)
% 0.42/1.08
% 0.42/1.08 ============================== end of input ==========================
% 0.42/1.08
% 0.42/1.08 % From the command line: assign(max_seconds, 300).
% 0.42/1.08
% 0.42/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.08
% 0.42/1.08 % Formulas that are not ordinary clauses:
% 0.42/1.08 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 2 (all A all B (proper_subset(A,B) -> -proper_subset(B,A))) # label(antisymmetry_r2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 3 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 4 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 5 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 6 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 7 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 8 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 9 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 10 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 11 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 12 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 13 (all A all B all C (C = cartesian_product2(A,B) <-> (all D (in(D,C) <-> (exists E exists F (in(E,A) & in(F,B) & D = ordered_pair(E,F))))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 14 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 15 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 16 (all A all B (B = union(A) <-> (all C (in(C,B) <-> (exists D (in(C,D) & in(D,A))))))) # label(d4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 17 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 18 (all A all B (element(B,powerset(A)) -> subset_complement(A,B) = set_difference(A,B))) # label(d5_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 19 (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.42/1.08 20 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 21 (all A all B (proper_subset(A,B) <-> subset(A,B) & A != B)) # label(d8_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 22 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 23 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 24 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 25 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 26 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 27 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 28 (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.42/1.08 29 $T # label(dt_k3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 30 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 31 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 32 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 33 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 34 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 35 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 36 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 37 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 38 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 39 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 40 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 41 (all A all B (element(B,powerset(A)) -> subset_complement(A,subset_complement(A,B)) = B)) # label(involutiveness_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 42 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 43 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.08 44 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.08 45 (all A all B -(disjoint(singleton(A),B) & in(A,B))) # label(l25_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.08 46 (all A all B (-in(A,B) -> disjoint(singleton(A),B))) # label(l28_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.08 47 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.08 48 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 49 (all A all B (element(B,powerset(A)) -> (all C (in(C,B) -> in(C,A))))) # label(l3_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 50 (all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 51 (all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(l4_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 52 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 53 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(l55_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 54 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 55 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 56 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 57 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 58 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 59 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 60 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(t106_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 61 (all A all B all C all D -(unordered_pair(A,B) = unordered_pair(C,D) & A != C & A != D)) # label(t10_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 62 (all A all B all C (subset(A,B) -> subset(cartesian_product2(A,C),cartesian_product2(B,C)) & subset(cartesian_product2(C,A),cartesian_product2(C,B)))) # label(t118_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 63 (all A all B all C all D (subset(A,B) & subset(C,D) -> subset(cartesian_product2(A,C),cartesian_product2(B,D)))) # label(t119_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 64 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 65 (all A exists B (in(A,B) & (all C all D (in(C,B) & subset(D,C) -> in(D,B))) & (all C (in(C,B) -> in(powerset(C),B))) & (all C -(subset(C,B) & -are_equipotent(C,B) & -in(C,B))))) # label(t136_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 66 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 67 (all A all B all C (subset(A,B) & subset(A,C) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 68 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 69 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 70 (all A all B all C (subset(A,B) -> subset(set_intersection2(A,C),set_intersection2(B,C)))) # label(t26_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 71 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 72 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 73 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 74 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 75 (all A all B all C (subset(A,B) -> subset(set_difference(A,C),set_difference(B,C)))) # label(t33_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 76 (all A all B all C all D (ordered_pair(A,B) = ordered_pair(C,D) -> A = C & B = D)) # label(t33_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 77 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 78 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 79 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(t37_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 80 (all A all B all C (subset(unordered_pair(A,B),C) <-> in(A,C) & in(B,C))) # label(t38_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 81 (all A all B set_union2(A,set_difference(B,A)) = set_union2(A,B)) # label(t39_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 82 (all A all B (subset(A,singleton(B)) <-> A = empty_set | A = singleton(B))) # label(t39_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 83 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 84 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 85 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 86 (all A all B set_difference(set_union2(A,B),B) = set_difference(A,B)) # label(t40_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 87 (all A all B (element(B,powerset(A)) -> (all C (element(C,powerset(A)) -> (disjoint(B,C) <-> subset(B,subset_complement(A,C))))))) # label(t43_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 88 (all A all B (subset(A,B) -> B = set_union2(A,set_difference(B,A)))) # label(t45_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 89 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(t46_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 90 (all A all B set_difference(A,set_difference(A,B)) = set_intersection2(A,B)) # label(t48_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 91 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 92 (all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 93 (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(lemma) # label(non_clause). [assumption].
% 0.42/1.09 94 (all A all B all C (element(C,powerset(A)) -> -(in(B,subset_complement(A,C)) & in(B,C)))) # label(t54_subset_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 95 (all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 96 (all A all B all C (subset(A,B) & disjoint(B,C) -> disjoint(A,C))) # label(t63_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 97 (all A all B (set_difference(A,singleton(B)) = A <-> -in(B,A))) # label(t65_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 98 (all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 99 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 100 (all A all B (subset(singleton(A),singleton(B)) -> A = B)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 101 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 102 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 103 (all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.42/1.09 104 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.09 105 (all A all B all C (subset(A,B) & subset(C,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 2.05/2.40 106 (all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 2.05/2.40 107 (all A all B (in(A,B) -> subset(A,union(B)))) # label(t92_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 2.05/2.40 108 (all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 2.05/2.40 109 (all A exists B (in(A,B) & (all C all D (in(C,B) & subset(D,C) -> in(D,B))) & (all C -(in(C,B) & (all D -(in(D,B) & (all E (subset(E,C) -> in(E,D))))))) & (all C -(subset(C,B) & -are_equipotent(C,B) & -in(C,B))))) # label(t9_tarski) # label(axiom) # label(non_clause). [assumption].
% 2.05/2.40 110 (all A all B all C (singleton(A) = unordered_pair(B,C) -> B = C)) # label(t9_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 2.05/2.40 111 -(all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.05/2.40
% 2.05/2.40 ============================== end of process non-clausal formulas ===
% 2.05/2.40
% 2.05/2.40 ============================== PROCESS INITIAL CLAUSES ===============
% 2.05/2.40
% 2.05/2.40 ============================== PREDICATE ELIMINATION =================
% 2.05/2.40
% 2.05/2.40 ============================== end predicate elimination =============
% 2.05/2.40
% 2.05/2.40 Auto_denials: (non-Horn, no changes).
% 2.05/2.40
% 2.05/2.40 Term ordering decisions:
% 2.05/2.40 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_difference=1. set_union2=1. cartesian_product2=1. set_intersection2=1. unordered_pair=1. ordered_pair=1. subset_complement=1. f1=1. f3=1. f11=1. f14=1. f15=1. f21=1. f22=1. f23=1. f25=1. singleton=1. powerset=1. union=1. f2=1. f17=1. f18=1. f19=1. f20=1. f24=1. f4=1. f5=1. f8=1. f9=1. f10=1. f12=1. f13=1. f16=1. f6=1. f7=1.
% 2.05/2.40
% 2.05/2.40 ============================== end of process initial clauses ========
% 2.05/2.40
% 2.05/2.40 ============================== CLAUSES FOR SEARCH ====================
% 2.05/2.40
% 2.05/2.40 ============================== end of clauses for search =============
% 2.05/2.40
% 2.05/2.40 ============================== SEARCH ================================
% 2.05/2.40
% 2.05/2.40 % Starting search at 0.05 seconds.
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=59.000, iters=3678
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=50.000, iters=3672
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=47.000, iters=3627
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=42.000, iters=3489
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=39.000, iters=3355
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=38.000, iters=3366
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=37.000, iters=3367
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=36.000, iters=3353
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=33.000, iters=3335
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=29.000, iters=3346
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=28.000, iters=3386
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=27.000, iters=3420
% 2.05/2.40
% 2.05/2.40 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 36 (0.00 of 0.55 sec).
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=26.000, iters=3381
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=25.000, iters=3342
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=24.000, iters=3380
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=23.000, iters=3346
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=22.000, iters=3432
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=21.000, iters=3478
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=20.000, iters=3363
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=19.000, iters=3408
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=18.000, iters=3358
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=17.000, iters=3362
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=16.000, iters=3337
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=15.000, iters=3336
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=14.000, iters=3348
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=13.000, iters=3340
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=12.000, iters=3339
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=11.000, iters=3341
% 2.05/2.40
% 2.05/2.40 Low Water (keep): wt=10.000, iters=3336
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1918, wt=74.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1821, wt=64.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=3408, wt=63.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1941, wt=62.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=3420, wt=59.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=2176, wt=58.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1944, wt=56.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1457, wt=55.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1923, wt=54.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=2706, wt=53.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=2529, wt=52.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=3439, wt=51.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=3856, wt=50.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=3421, wt=49.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=2276, wt=48.000
% 2.05/2.40
% 2.05/2.40 Low Water (displace): id=1791, wt=47.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=2559, wt=46.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3375, wt=45.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3558, wt=44.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3440, wt=43.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3561, wt=42.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3865, wt=41.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3563, wt=40.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=4020, wt=39.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=4100, wt=38.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=4153, wt=37.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=3559, wt=36.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=4149, wt=35.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=4150, wt=34.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=13013, wt=15.000
% 7.85/8.16
% 7.85/8.16 Low Water (displace): id=13734, wt=9.000
% 7.85/8.16
% 7.85/8.16 ============================== PROOF =================================
% 7.85/8.16 % SZS status Theorem
% 7.85/8.16 % SZS output start Refutation
% 7.85/8.16
% 7.85/8.16 % Proof 1 at 6.89 (+ 0.21) seconds.
% 7.85/8.16 % Length of proof is 95.
% 7.85/8.16 % Level of proof is 13.
% 7.85/8.16 % Maximum clause weight is 23.000.
% 7.85/8.16 % Given clauses 7149.
% 7.85/8.16
% 7.85/8.16 4 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 5 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 9 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 10 (all A all B ((-empty(A) -> (element(B,A) <-> in(B,A))) & (empty(A) -> (element(B,A) <-> empty(B))))) # label(d2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 12 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 14 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 34 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 35 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 44 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 48 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 52 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 56 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 64 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 77 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 81 (all A all B set_union2(A,set_difference(B,A)) = set_union2(A,B)) # label(t39_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 83 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 84 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -((exists C (in(C,A) & in(C,B))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 86 (all A all B set_difference(set_union2(A,B),B) = set_difference(A,B)) # label(t40_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 90 (all A all B set_difference(A,set_difference(A,B)) = set_intersection2(A,B)) # label(t48_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 91 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 96 (all A all B all C (subset(A,B) & disjoint(B,C) -> disjoint(A,C))) # label(t63_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 98 (all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 99 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 7.85/8.16 102 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 103 (all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 108 (all A union(powerset(A)) = A) # label(t99_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 7.85/8.16 111 -(all A all B ((all C (in(C,A) -> in(C,B))) -> element(A,powerset(B)))) # label(l71_subset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 7.85/8.16 115 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom). [clausify(4)].
% 7.85/8.16 116 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(5)].
% 7.85/8.16 127 powerset(A) != B | in(C,B) | -subset(C,A) # label(d1_zfmisc_1) # label(axiom). [clausify(9)].
% 7.85/8.16 130 empty(A) | -element(B,A) | in(B,A) # label(d2_subset_1) # label(axiom). [clausify(10)].
% 7.85/8.16 131 empty(A) | element(B,A) | -in(B,A) # label(d2_subset_1) # label(axiom). [clausify(10)].
% 7.85/8.16 143 set_union2(A,B) = C | in(f5(A,B,C),C) | in(f5(A,B,C),A) | in(f5(A,B,C),B) # label(d2_xboole_0) # label(axiom). [clausify(12)].
% 7.85/8.16 144 set_union2(A,B) = C | -in(f5(A,B,C),C) | -in(f5(A,B,C),A) # label(d2_xboole_0) # label(axiom). [clausify(12)].
% 7.85/8.16 155 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(14)].
% 7.85/8.16 156 subset(A,B) | in(f11(A,B),A) # label(d3_tarski) # label(axiom). [clausify(14)].
% 7.85/8.16 185 element(f17(A),A) # label(existence_m1_subset_1) # label(axiom). [clausify(34)].
% 7.85/8.16 186 -empty(powerset(A)) # label(fc1_subset_1) # label(axiom). [clausify(35)].
% 7.85/8.16 197 -in(A,B) | set_union2(singleton(A),B) = B # label(l23_zfmisc_1) # label(lemma). [clausify(44)].
% 7.85/8.16 198 -in(A,B) | set_union2(B,singleton(A)) = B. [copy(197),rewrite([115(3)])].
% 7.85/8.16 204 set_difference(A,B) = empty_set | -subset(A,B) # label(l32_xboole_1) # label(lemma). [clausify(48)].
% 7.85/8.16 209 -in(A,B) | subset(A,union(B)) # label(l50_zfmisc_1) # label(lemma). [clausify(52)].
% 7.85/8.16 219 element(f19(A),powerset(A)) # label(rc2_subset_1) # label(axiom). [clausify(56)].
% 7.85/8.16 220 empty(f19(A)) # label(rc2_subset_1) # label(axiom). [clausify(56)].
% 7.85/8.16 231 -subset(A,B) | set_union2(A,B) = B # label(t12_xboole_1) # label(lemma). [clausify(64)].
% 7.85/8.16 239 powerset(empty_set) = singleton(empty_set) # label(t1_zfmisc_1) # label(lemma). [assumption].
% 7.85/8.16 251 subset(set_difference(A,B),A) # label(t36_xboole_1) # label(lemma). [clausify(77)].
% 7.85/8.16 255 set_union2(A,set_difference(B,A)) = set_union2(A,B) # label(t39_xboole_1) # label(lemma). [clausify(81)].
% 7.85/8.16 256 set_difference(A,empty_set) = A # label(t3_boole) # label(axiom). [clausify(83)].
% 7.85/8.16 259 -in(A,B) | -in(A,C) | -disjoint(B,C) # label(t3_xboole_0) # label(lemma). [clausify(84)].
% 7.85/8.16 261 set_difference(set_union2(A,B),B) = set_difference(A,B) # label(t40_xboole_1) # label(lemma). [clausify(86)].
% 7.85/8.16 266 set_difference(A,set_difference(A,B)) = set_intersection2(A,B) # label(t48_xboole_1) # label(lemma). [clausify(90)].
% 7.85/8.16 267 set_intersection2(A,B) = set_difference(A,set_difference(A,B)). [copy(266),flip(a)].
% 7.85/8.16 268 set_difference(empty_set,A) = empty_set # label(t4_boole) # label(axiom). [clausify(91)].
% 7.85/8.16 276 -subset(A,B) | -disjoint(B,C) | disjoint(A,C) # label(t63_xboole_1) # label(lemma). [clausify(96)].
% 7.85/8.16 279 singleton(A) = unordered_pair(A,A) # label(t69_enumset1) # label(lemma). [clausify(98)].
% 7.85/8.16 280 -empty(A) | empty_set = A # label(t6_boole) # label(axiom). [clausify(99)].
% 7.85/8.16 284 subset(A,set_union2(A,B)) # label(t7_xboole_1) # label(lemma). [clausify(102)].
% 7.85/8.16 286 disjoint(A,B) | set_difference(A,B) != A # label(t83_xboole_1) # label(lemma). [clausify(103)].
% 7.85/8.16 291 union(powerset(A)) = A # label(t99_zfmisc_1) # label(lemma). [clausify(108)].
% 7.85/8.16 298 -in(A,c3) | in(A,c4) # label(l71_subset_1) # label(negated_conjecture). [clausify(111)].
% 7.85/8.16 299 -element(c3,powerset(c4)) # label(l71_subset_1) # label(negated_conjecture). [clausify(111)].
% 7.85/8.16 311 set_union2(A,B) = A | -in(f5(A,B,A),A). [factor(144,b,c)].
% 7.85/8.16 336 -in(A,B) | -disjoint(B,B). [factor(259,a,b)].
% 7.85/8.16 350 set_difference(A,set_difference(A,B)) = set_difference(B,set_difference(B,A)). [back_rewrite(116),rewrite([267(1),267(3)])].
% 7.85/8.16 355 unordered_pair(empty_set,empty_set) = powerset(empty_set). [back_rewrite(239),rewrite([279(4)]),flip(a)].
% 7.85/8.16 364 -in(A,B) | set_union2(B,unordered_pair(A,A)) = B. [back_rewrite(198),rewrite([279(2)])].
% 7.85/8.16 867 empty(A) | in(f17(A),A). [resolve(185,a,130,b)].
% 7.85/8.16 904 in(f19(A),powerset(A)). [resolve(219,a,130,b),unit_del(a,186)].
% 7.85/8.16 1053 powerset(A) != B | in(set_difference(A,C),B). [resolve(251,a,127,c)].
% 7.85/8.16 1090 set_difference(set_union2(A,B),set_difference(B,A)) = set_difference(A,set_difference(B,A)). [para(255(a,1),261(a,1,1))].
% 7.85/8.16 1120 f19(A) = empty_set. [resolve(280,a,220,a),flip(a)].
% 7.85/8.16 1129 in(empty_set,powerset(A)). [back_rewrite(904),rewrite([1120(1)])].
% 7.85/8.16 1165 set_difference(A,set_union2(A,B)) = empty_set. [resolve(284,a,204,b)].
% 7.85/8.16 1167 -in(A,B) | in(A,set_union2(B,C)). [resolve(284,a,155,a)].
% 7.85/8.16 1173 disjoint(empty_set,A). [resolve(286,b,268,a)].
% 7.85/8.16 1251 in(f5(A,c3,B),c4) | set_union2(A,c3) = B | in(f5(A,c3,B),B) | in(f5(A,c3,B),A). [resolve(298,a,143,d)].
% 7.85/8.16 1260 in(f5(A,c3,c4),c4) | set_union2(A,c3) = c4 | in(f5(A,c3,c4),A). [factor(1251,a,c)].
% 7.85/8.16 1270 in(f5(c4,c3,c4),c4) | set_union2(c3,c4) = c4. [factor(1260,a,c),rewrite([115(9)])].
% 7.85/8.16 2399 set_difference(A,set_difference(B,A)) = A. [para(261(a,1),350(a,2,2)),rewrite([115(1),1165(2),256(2),115(1),1090(3)]),flip(a)].
% 7.85/8.16 2733 -subset(A,empty_set) | disjoint(A,B). [resolve(1173,a,276,b)].
% 7.85/8.16 2743 set_union2(powerset(A),powerset(empty_set)) = powerset(A). [resolve(1129,a,364,a),rewrite([355(4)])].
% 7.85/8.16 3341 disjoint(A,B) | in(f11(A,empty_set),A). [resolve(2733,a,156,a)].
% 7.85/8.16 6893 in(f17(A),set_union2(A,B)) | empty(A). [resolve(1167,a,867,b)].
% 7.85/8.16 9039 in(f11(A,empty_set),A) | -in(B,A). [resolve(3341,a,336,b)].
% 7.85/8.16 11483 in(f17(powerset(A)),powerset(A)). [para(2743(a,1),6893(a,2)),unit_del(b,186)].
% 7.85/8.16 13167 in(f11(powerset(A),empty_set),powerset(A)). [resolve(9039,b,11483,a)].
% 7.85/8.16 13227 subset(f11(powerset(A),empty_set),A). [resolve(13167,a,209,a),rewrite([291(5)])].
% 7.85/8.16 13252 set_union2(A,f11(powerset(A),empty_set)) = A. [resolve(13227,a,231,a),rewrite([115(4)])].
% 7.85/8.16 15268 in(set_difference(A,B),powerset(A)). [resolve(1053,a,13252,a(flip)),rewrite([13252(7)])].
% 7.85/8.16 15278 in(set_difference(A,B),powerset(set_union2(A,B))). [para(261(a,1),15268(a,1))].
% 7.85/8.16 15320 in(A,powerset(set_union2(A,B))). [para(255(a,1),15278(a,2,1)),rewrite([2399(2)])].
% 7.85/8.16 15342 element(A,powerset(set_union2(A,B))). [resolve(15320,a,131,c),unit_del(a,186)].
% 7.85/8.16 27865 set_union2(c3,c4) = c4. [resolve(1270,a,311,b),rewrite([115(8)]),merge(b)].
% 7.85/8.16 27913 $F. [para(27865(a,1),15342(a,2,1)),unit_del(a,299)].
% 7.85/8.16
% 7.85/8.16 % SZS output end Refutation
% 7.85/8.16 ============================== end of proof ==========================
% 7.85/8.16
% 7.85/8.16 ============================== STATISTICS ============================
% 7.85/8.16
% 7.85/8.16 Given=7149. Generated=334084. Kept=27780. proofs=1.
% 7.85/8.16 Usable=7028. Sos=9999. Demods=598. Limbo=20, Disabled=10917. Hints=0.
% 7.85/8.16 Megabytes=20.71.
% 7.85/8.16 User_CPU=6.89, System_CPU=0.21, Wall_clock=7.
% 7.85/8.16
% 7.85/8.16 ============================== end of statistics =====================
% 7.85/8.16
% 7.85/8.16 ============================== end of search =========================
% 7.85/8.16
% 7.85/8.16 THEOREM PROVED
% 7.85/8.16 % SZS status Theorem
% 7.85/8.16
% 7.85/8.16 Exiting with 1 proof.
% 7.85/8.16
% 7.85/8.16 Process 27421 exit (max_proofs) Sun Jun 19 23:19:18 2022
% 7.85/8.16 Prover9 interrupted
%------------------------------------------------------------------------------