TSTP Solution File: SEU149+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU149+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:22 EDT 2022
% Result : Theorem 0.96s 1.25s
% Output : Refutation 0.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU149+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.19/0.33 % DateTime : Sun Jun 19 07:17:43 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.46/1.08 ============================== Prover9 ===============================
% 0.46/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.08 Process 8854 was started by sandbox on n003.cluster.edu,
% 0.46/1.08 Sun Jun 19 07:17:44 2022
% 0.46/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8514_n003.cluster.edu".
% 0.46/1.08 ============================== end of head ===========================
% 0.46/1.08
% 0.46/1.08 ============================== INPUT =================================
% 0.46/1.08
% 0.46/1.08 % Reading from file /tmp/Prover9_8514_n003.cluster.edu
% 0.46/1.08
% 0.46/1.08 set(prolog_style_variables).
% 0.46/1.08 set(auto2).
% 0.46/1.08 % set(auto2) -> set(auto).
% 0.46/1.08 % set(auto) -> set(auto_inference).
% 0.46/1.08 % set(auto) -> set(auto_setup).
% 0.46/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.08 % set(auto) -> set(auto_limits).
% 0.46/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.08 % set(auto) -> set(auto_denials).
% 0.46/1.08 % set(auto) -> set(auto_process).
% 0.46/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.08 % set(auto2) -> assign(stats, some).
% 0.46/1.08 % set(auto2) -> clear(echo_input).
% 0.46/1.08 % set(auto2) -> set(quiet).
% 0.46/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.08 % set(auto2) -> clear(print_given).
% 0.46/1.08 assign(lrs_ticks,-1).
% 0.46/1.08 assign(sos_limit,10000).
% 0.46/1.08 assign(order,kbo).
% 0.46/1.08 set(lex_order_vars).
% 0.46/1.08 clear(print_given).
% 0.46/1.08
% 0.46/1.08 % formulas(sos). % not echoed (72 formulas)
% 0.46/1.08
% 0.46/1.08 ============================== end of input ==========================
% 0.46/1.08
% 0.46/1.08 % From the command line: assign(max_seconds, 300).
% 0.46/1.08
% 0.46/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.08
% 0.46/1.08 % Formulas that are not ordinary clauses:
% 0.46/1.08 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.46/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.46/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.46/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.46/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.46/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.46/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.46/1.08 8 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/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.46/1.08 10 (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.46/1.08 11 (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.46/1.08 12 (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.46/1.08 13 (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.46/1.08 14 (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.46/1.08 15 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 16 (all A all B (proper_subset(A,B) <-> subset(A,B) & A != B)) # label(d8_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 17 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 18 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 19 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 20 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 21 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 22 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 23 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 24 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 25 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 26 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 27 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 28 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 29 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 30 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 31 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 32 (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.46/1.08 33 (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.46/1.08 34 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 35 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 36 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 37 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 38 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 39 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 40 (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.46/1.08 41 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 42 (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.46/1.08 43 (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.46/1.08 44 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 45 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 46 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.08 47 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.46/1.08 48 (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.96/1.25 49 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 50 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 51 (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.96/1.25 52 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 53 (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.96/1.25 54 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 55 (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.96/1.25 56 (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.96/1.25 57 (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.96/1.25 58 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 59 (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.96/1.25 60 (all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 61 (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.96/1.25 62 (all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 63 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 64 (all A all B (subset(singleton(A),singleton(B)) -> A = B)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 65 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 66 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 67 (all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 68 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 69 (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].
% 0.96/1.25 70 -(all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.96/1.25
% 0.96/1.25 ============================== end of process non-clausal formulas ===
% 0.96/1.25
% 0.96/1.25 ============================== PROCESS INITIAL CLAUSES ===============
% 0.96/1.25
% 0.96/1.25 ============================== PREDICATE ELIMINATION =================
% 0.96/1.25
% 0.96/1.25 ============================== end predicate elimination =============
% 0.96/1.25
% 0.96/1.25 Auto_denials: (non-Horn, no changes).
% 0.96/1.25
% 0.96/1.25 Term ordering decisions:
% 0.96/1.25 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_difference=1. set_intersection2=1. set_union2=1. unordered_pair=1. f1=1. f3=1. f6=1. f9=1. f10=1. f11=1. singleton=1. powerset=1. f2=1. f4=1. f5=1. f7=1. f8=1.
% 0.96/1.25
% 0.96/1.25 ============================== end of process initial clauses ========
% 0.96/1.25
% 0.96/1.25 ============================== CLAUSES FOR SEARCH ====================
% 0.96/1.25
% 0.96/1.25 ============================== end of clauses for search =============
% 0.96/1.25
% 0.96/1.25 ============================== SEARCH ================================
% 0.96/1.25
% 0.96/1.25 % Starting search at 0.03 seconds.
% 0.96/1.25
% 0.96/1.25 ============================== PROOF =================================
% 0.96/1.25 % SZS status Theorem
% 0.96/1.25 % SZS output start Refutation
% 0.96/1.25
% 0.96/1.25 % Proof 1 at 0.18 (+ 0.00) seconds.
% 0.96/1.25 % Length of proof is 31.
% 0.96/1.25 % Level of proof is 8.
% 0.96/1.25 % Maximum clause weight is 16.000.
% 0.96/1.25 % Given clauses 241.
% 0.96/1.25
% 0.96/1.25 3 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 8 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.96/1.25 10 (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.96/1.25 29 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 30 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 62 (all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 64 (all A all B (subset(singleton(A),singleton(B)) -> A = B)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause). [assumption].
% 0.96/1.25 70 -(all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.96/1.25 73 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(3)].
% 0.96/1.25 84 empty_set = A | in(f2(A),A) # label(d1_xboole_0) # label(axiom). [clausify(8)].
% 0.96/1.25 89 unordered_pair(A,B) != C | -in(D,C) | D = A | D = B # label(d2_tarski) # label(axiom). [clausify(10)].
% 0.96/1.25 91 unordered_pair(A,B) != C | in(D,C) | D != B # label(d2_tarski) # label(axiom). [clausify(10)].
% 0.96/1.25 127 singleton(A) != empty_set # label(l1_zfmisc_1) # label(lemma). [clausify(29)].
% 0.96/1.25 129 subset(singleton(A),B) | -in(A,B) # label(l2_zfmisc_1) # label(lemma). [clausify(30)].
% 0.96/1.25 170 singleton(A) = unordered_pair(A,A) # label(t69_enumset1) # label(lemma). [clausify(62)].
% 0.96/1.25 172 -subset(singleton(A),singleton(B)) | B = A # label(t6_zfmisc_1) # label(lemma). [clausify(64)].
% 0.96/1.25 173 -subset(unordered_pair(A,A),unordered_pair(B,B)) | B = A. [copy(172),rewrite([170(1),170(2)])].
% 0.96/1.25 180 singleton(c3) = unordered_pair(c4,c5) # label(t8_zfmisc_1) # label(negated_conjecture). [clausify(70)].
% 0.96/1.25 181 unordered_pair(c4,c5) = unordered_pair(c3,c3). [copy(180),rewrite([170(2)]),flip(a)].
% 0.96/1.25 182 c4 != c3 # label(t8_zfmisc_1) # label(negated_conjecture). [clausify(70)].
% 0.96/1.25 222 subset(unordered_pair(A,A),B) | -in(A,B). [back_rewrite(129),rewrite([170(1)])].
% 0.96/1.25 224 unordered_pair(A,A) != empty_set. [back_rewrite(127),rewrite([170(1)])].
% 0.96/1.25 231 unordered_pair(A,B) != C | f2(C) = A | f2(C) = B | empty_set = C. [resolve(89,b,84,b)].
% 0.96/1.25 238 unordered_pair(A,B) != C | in(B,C). [xx_res(91,c)].
% 0.96/1.25 1215 f2(unordered_pair(c3,c3)) = c4 | f2(unordered_pair(c3,c3)) = c5. [resolve(231,a,181,a),flip(c),unit_del(c,224)].
% 0.96/1.25 1218 f2(unordered_pair(A,A)) = A. [resolve(231,a,170,a(flip)),rewrite([170(1),170(4),170(8)]),flip(c),merge(b),unit_del(b,224)].
% 0.96/1.25 1222 c5 = c3. [back_rewrite(1215),rewrite([1218(4),1218(7)]),flip(a),flip(b),unit_del(a,182)].
% 0.96/1.25 1226 unordered_pair(c3,c4) = unordered_pair(c3,c3). [back_rewrite(181),rewrite([1222(2),73(3)])].
% 0.96/1.25 1584 in(c4,unordered_pair(c3,c3)). [resolve(1226,a,238,a)].
% 0.96/1.25 1595 subset(unordered_pair(c4,c4),unordered_pair(c3,c3)). [resolve(1584,a,222,b)].
% 0.96/1.25 1747 $F. [resolve(1595,a,173,a),flip(a),unit_del(a,182)].
% 0.96/1.25
% 0.96/1.25 % SZS output end Refutation
% 0.96/1.25 ============================== end of proof ==========================
% 0.96/1.25
% 0.96/1.25 ============================== STATISTICS ============================
% 0.96/1.25
% 0.96/1.25 Given=241. Generated=3633. Kept=1669. proofs=1.
% 0.96/1.25 Usable=207. Sos=1246. Demods=59. Limbo=2, Disabled=324. Hints=0.
% 0.96/1.25 Megabytes=1.67.
% 0.96/1.25 User_CPU=0.18, System_CPU=0.00, Wall_clock=0.
% 0.96/1.25
% 0.96/1.25 ============================== end of statistics =====================
% 0.96/1.25
% 0.96/1.25 ============================== end of search =========================
% 0.96/1.25
% 0.96/1.25 THEOREM PROVED
% 0.96/1.25 % SZS status Theorem
% 0.96/1.25
% 0.96/1.25 Exiting with 1 proof.
% 0.96/1.25
% 0.96/1.25 Process 8854 exit (max_proofs) Sun Jun 19 07:17:44 2022
% 0.96/1.25 Prover9 interrupted
%------------------------------------------------------------------------------