TSTP Solution File: SEU142+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU142+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:17 EDT 2022
% Result : Theorem 89.83s 90.13s
% Output : Refutation 89.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU142+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n007.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sat Jun 18 20:52:58 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.77/1.02 ============================== Prover9 ===============================
% 0.77/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.02 Process 6423 was started by sandbox on n007.cluster.edu,
% 0.77/1.02 Sat Jun 18 20:52:59 2022
% 0.77/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6256_n007.cluster.edu".
% 0.77/1.02 ============================== end of head ===========================
% 0.77/1.02
% 0.77/1.02 ============================== INPUT =================================
% 0.77/1.02
% 0.77/1.02 % Reading from file /tmp/Prover9_6256_n007.cluster.edu
% 0.77/1.02
% 0.77/1.02 set(prolog_style_variables).
% 0.77/1.02 set(auto2).
% 0.77/1.02 % set(auto2) -> set(auto).
% 0.77/1.02 % set(auto) -> set(auto_inference).
% 0.77/1.02 % set(auto) -> set(auto_setup).
% 0.77/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.02 % set(auto) -> set(auto_limits).
% 0.77/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.02 % set(auto) -> set(auto_denials).
% 0.77/1.02 % set(auto) -> set(auto_process).
% 0.77/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.02 % set(auto2) -> assign(stats, some).
% 0.77/1.02 % set(auto2) -> clear(echo_input).
% 0.77/1.02 % set(auto2) -> set(quiet).
% 0.77/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.02 % set(auto2) -> clear(print_given).
% 0.77/1.02 assign(lrs_ticks,-1).
% 0.77/1.02 assign(sos_limit,10000).
% 0.77/1.02 assign(order,kbo).
% 0.77/1.02 set(lex_order_vars).
% 0.77/1.02 clear(print_given).
% 0.77/1.02
% 0.77/1.02 % formulas(sos). % not echoed (63 formulas)
% 0.77/1.02
% 0.77/1.02 ============================== end of input ==========================
% 0.77/1.02
% 0.77/1.02 % From the command line: assign(max_seconds, 300).
% 0.77/1.02
% 0.77/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.02
% 0.77/1.02 % Formulas that are not ordinary clauses:
% 0.77/1.02 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 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.77/1.02 3 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 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.77/1.02 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.77/1.02 6 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 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.77/1.02 8 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 9 (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.77/1.02 10 (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.77/1.02 11 (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.77/1.02 12 (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.77/1.02 13 (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.77/1.02 14 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 15 (all A all B (proper_subset(A,B) <-> subset(A,B) & A != B)) # label(d8_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 16 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 17 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 18 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 19 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 20 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 21 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 22 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 23 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 24 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 25 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 26 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 27 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 28 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 29 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 30 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 31 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 32 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 33 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 34 (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.77/1.02 35 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 36 (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.77/1.02 37 (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.77/1.02 38 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 39 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 40 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 41 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 42 (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.77/1.02 43 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 44 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 0.77/1.02 45 (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.77/1.02 46 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.02 47 (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.77/1.02 48 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 89.83/90.13 49 (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].
% 89.83/90.13 50 (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].
% 89.83/90.13 51 (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].
% 89.83/90.13 52 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 53 (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].
% 89.83/90.13 54 (all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 89.83/90.13 55 (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].
% 89.83/90.13 56 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 57 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 58 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 89.83/90.13 59 (all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(lemma) # label(non_clause). [assumption].
% 89.83/90.13 60 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 61 (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].
% 89.83/90.13 62 -(all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(negated_conjecture) # label(non_clause). [assumption].
% 89.83/90.13
% 89.83/90.13 ============================== end of process non-clausal formulas ===
% 89.83/90.13
% 89.83/90.13 ============================== PROCESS INITIAL CLAUSES ===============
% 89.83/90.13
% 89.83/90.13 ============================== PREDICATE ELIMINATION =================
% 89.83/90.13
% 89.83/90.13 ============================== end predicate elimination =============
% 89.83/90.13
% 89.83/90.13 Auto_denials: (non-Horn, no changes).
% 89.83/90.13
% 89.83/90.13 Term ordering decisions:
% 89.83/90.13 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. set_difference=1. set_intersection2=1. set_union2=1. unordered_pair=1. f1=1. f5=1. f8=1. f9=1. f10=1. singleton=1. f2=1. f3=1. f4=1. f6=1. f7=1.
% 89.83/90.13
% 89.83/90.13 ============================== end of process initial clauses ========
% 89.83/90.13
% 89.83/90.13 ============================== CLAUSES FOR SEARCH ====================
% 89.83/90.13
% 89.83/90.13 ============================== end of clauses for search =============
% 89.83/90.13
% 89.83/90.13 ============================== SEARCH ================================
% 89.83/90.13
% 89.83/90.13 % Starting search at 0.02 seconds.
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=21.000, iters=3359
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=20.000, iters=3350
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=18.000, iters=3445
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=16.000, iters=3454
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=15.000, iters=3363
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=12.000, iters=3512
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=11.000, iters=3357
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=10.000, iters=3409
% 89.83/90.13
% 89.83/90.13 Low Water (keep): wt=9.000, iters=3341
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=4817, wt=23.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=3555, wt=22.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=4924, wt=21.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=4946, wt=20.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=5518, wt=19.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=5520, wt=18.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=5519, wt=17.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=5516, wt=16.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=5515, wt=15.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=5972, wt=14.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=6204, wt=13.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=6201, wt=12.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=6594, wt=11.000
% 89.83/90.13
% 89.83/90.13 Low Water (displace): id=7424, wt=10.000
% 89.83/90.13
% 89.83/90.13 ============================== PROOF =================================
% 89.83/90.13 % SZS status Theorem
% 89.83/90.13 % SZS output start Refutation
% 89.83/90.13
% 89.83/90.13 % Proof 1 at 86.68 (+ 2.43) seconds.
% 89.83/90.13 % Length of proof is 27.
% 89.83/90.13 % Level of proof is 6.
% 89.83/90.13 % Maximum clause weight is 24.000.
% 89.83/90.13 % Given clauses 2977.
% 89.83/90.13
% 89.83/90.13 7 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 9 (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].
% 89.83/90.13 46 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 57 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 89.83/90.13 62 -(all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(negated_conjecture) # label(non_clause). [assumption].
% 89.83/90.13 63 empty(empty_set) # label(fc1_xboole_0) # label(axiom). [assumption].
% 89.83/90.13 73 set_difference(A,empty_set) = A # label(t3_boole) # label(axiom). [clausify(46)].
% 89.83/90.13 90 singleton(A) = B | in(f1(A,B),B) | f1(A,B) = A # label(d1_tarski) # label(axiom). [clausify(7)].
% 89.83/90.13 100 -in(A,B) | -empty(B) # label(t7_boole) # label(axiom). [clausify(57)].
% 89.83/90.13 106 singleton(c3) != unordered_pair(c3,c3) # label(t69_enumset1) # label(negated_conjecture). [clausify(62)].
% 89.83/90.13 107 unordered_pair(c3,c3) != singleton(c3). [copy(106),flip(a)].
% 89.83/90.13 139 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(7)].
% 89.83/90.13 145 unordered_pair(A,B) != C | in(D,C) | D != B # label(d2_tarski) # label(axiom). [clausify(9)].
% 89.83/90.13 157 singleton(A) = B | -in(f1(A,B),B) | f1(A,B) != A # label(d1_tarski) # label(axiom). [clausify(7)].
% 89.83/90.13 158 unordered_pair(A,B) != C | -in(D,C) | D = A | D = B # label(d2_tarski) # label(axiom). [clausify(9)].
% 89.83/90.13 181 unordered_pair(c3,c3) = c_0. [new_symbol(107)].
% 89.83/90.13 197 singleton(c3) != c_0. [back_rewrite(107),rewrite([181(3)]),flip(a)].
% 89.83/90.13 216 -in(A,empty_set). [ur(100,b,63,a)].
% 89.83/90.13 555 unordered_pair(A,B) != C | f1(D,C) = A | f1(D,C) = B | singleton(D) = C | f1(D,C) = D. [resolve(158,b,90,b)].
% 89.83/90.13 578 unordered_pair(A,B) != C | f1(A,C) = A | f1(A,C) = B | singleton(A) = C. [factor(555,b,e)].
% 89.83/90.13 1047 in(A,c_0) | c3 != A. [resolve(181,a,145,a),flip(b)].
% 89.83/90.13 1161 singleton(A) = empty_set | f1(A,empty_set) = A. [resolve(216,a,90,b)].
% 89.83/90.13 1175 singleton(A) != empty_set. [ur(139,b,216,a,c,73,a)].
% 89.83/90.13 1178 f1(A,empty_set) = A. [back_unit_del(1161),unit_del(a,1175)].
% 89.83/90.13 1236 in(c3,c_0). [resolve(1047,b,1178,a(flip)),rewrite([1178(3)])].
% 89.83/90.13 19066 f1(c3,c_0) = c3. [resolve(578,a,181,a),merge(b),unit_del(b,197)].
% 89.83/90.13 19076 $F. [ur(157,a,197,a,c,19066,a),rewrite([19066(3)]),unit_del(a,1236)].
% 89.83/90.13
% 89.83/90.13 % SZS output end Refutation
% 89.83/90.13 ============================== end of proof ==========================
% 89.83/90.13
% 89.83/90.13 ============================== STATISTICS ============================
% 89.83/90.13
% 89.83/90.13 Given=2977. Generated=4599396. Kept=18996. proofs=1.
% 89.83/90.13 Usable=2576. Sos=9357. Demods=145. Limbo=0, Disabled=7158. Hints=0.
% 89.83/90.13 Megabytes=11.98.
% 89.83/90.13 User_CPU=86.68, System_CPU=2.43, Wall_clock=89.
% 89.83/90.13
% 89.83/90.13 ============================== end of statistics =====================
% 89.83/90.13
% 89.83/90.13 ============================== end of search =========================
% 89.83/90.13
% 89.83/90.13 THEOREM PROVED
% 89.83/90.13 % SZS status Theorem
% 89.83/90.13
% 89.83/90.13 Exiting with 1 proof.
% 89.83/90.13
% 89.83/90.13 Process 6423 exit (max_proofs) Sat Jun 18 20:54:28 2022
% 89.83/90.13 Prover9 interrupted
%------------------------------------------------------------------------------