TSTP Solution File: SEU145+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:19 EDT 2022
% Result : Theorem 41.85s 42.16s
% Output : Refutation 41.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 08:03:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.98/1.29 ============================== Prover9 ===============================
% 0.98/1.29 Prover9 (32) version 2009-11A, November 2009.
% 0.98/1.29 Process 7934 was started by sandbox2 on n014.cluster.edu,
% 0.98/1.29 Sun Jun 19 08:03:19 2022
% 0.98/1.29 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7781_n014.cluster.edu".
% 0.98/1.29 ============================== end of head ===========================
% 0.98/1.29
% 0.98/1.29 ============================== INPUT =================================
% 0.98/1.29
% 0.98/1.29 % Reading from file /tmp/Prover9_7781_n014.cluster.edu
% 0.98/1.29
% 0.98/1.29 set(prolog_style_variables).
% 0.98/1.29 set(auto2).
% 0.98/1.29 % set(auto2) -> set(auto).
% 0.98/1.29 % set(auto) -> set(auto_inference).
% 0.98/1.29 % set(auto) -> set(auto_setup).
% 0.98/1.29 % set(auto_setup) -> set(predicate_elim).
% 0.98/1.29 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.98/1.29 % set(auto) -> set(auto_limits).
% 0.98/1.29 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.98/1.29 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.98/1.29 % set(auto) -> set(auto_denials).
% 0.98/1.29 % set(auto) -> set(auto_process).
% 0.98/1.29 % set(auto2) -> assign(new_constants, 1).
% 0.98/1.29 % set(auto2) -> assign(fold_denial_max, 3).
% 0.98/1.29 % set(auto2) -> assign(max_weight, "200.000").
% 0.98/1.29 % set(auto2) -> assign(max_hours, 1).
% 0.98/1.29 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.98/1.29 % set(auto2) -> assign(max_seconds, 0).
% 0.98/1.29 % set(auto2) -> assign(max_minutes, 5).
% 0.98/1.29 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.98/1.29 % set(auto2) -> set(sort_initial_sos).
% 0.98/1.29 % set(auto2) -> assign(sos_limit, -1).
% 0.98/1.29 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.98/1.29 % set(auto2) -> assign(max_megs, 400).
% 0.98/1.29 % set(auto2) -> assign(stats, some).
% 0.98/1.29 % set(auto2) -> clear(echo_input).
% 0.98/1.29 % set(auto2) -> set(quiet).
% 0.98/1.29 % set(auto2) -> clear(print_initial_clauses).
% 0.98/1.29 % set(auto2) -> clear(print_given).
% 0.98/1.29 assign(lrs_ticks,-1).
% 0.98/1.29 assign(sos_limit,10000).
% 0.98/1.29 assign(order,kbo).
% 0.98/1.29 set(lex_order_vars).
% 0.98/1.29 clear(print_given).
% 0.98/1.29
% 0.98/1.29 % formulas(sos). % not echoed (8 formulas)
% 0.98/1.29
% 0.98/1.29 ============================== end of input ==========================
% 0.98/1.29
% 0.98/1.29 % From the command line: assign(max_seconds, 300).
% 0.98/1.29
% 0.98/1.29 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.98/1.29
% 0.98/1.29 % Formulas that are not ordinary clauses:
% 0.98/1.29 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.29 2 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.29 3 (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.98/1.29 4 (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.98/1.29 5 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.29 6 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.29 7 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.98/1.29 8 -(all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.98/1.29
% 0.98/1.29 ============================== end of process non-clausal formulas ===
% 0.98/1.29
% 0.98/1.29 ============================== PROCESS INITIAL CLAUSES ===============
% 0.98/1.29
% 0.98/1.29 ============================== PREDICATE ELIMINATION =================
% 0.98/1.29
% 0.98/1.29 ============================== end predicate elimination =============
% 0.98/1.29
% 0.98/1.29 Auto_denials: (non-Horn, no changes).
% 0.98/1.29
% 0.98/1.29 Term ordering decisions:
% 0.98/1.29
% 0.98/1.29 % Assigning unary symbol singleton kb_weight 0 and highest precedence (11).
% 0.98/1.29 Function symbol KB weights: c1=1. c2=1. c3=1. set_difference=1. f1=1. f2=1. f3=1. singleton=0.
% 0.98/1.29
% 0.98/1.29 ============================== end of process initial clauses ========
% 0.98/1.29
% 0.98/1.29 ============================== CLAUSES FOR SEARCH ====================
% 0.98/1.29
% 0.98/1.29 ============================== end of clauses for search =============
% 0.98/1.29
% 0.98/1.29 ============================== SEARCH ================================
% 0.98/1.29
% 0.98/1.29 % Starting search at 0.01 seconds.
% 0.98/1.29
% 0.98/1.29 Low Water (keep): wt=25.000, iters=3658
% 0.98/1.29
% 0.98/1.29 Low Water (keep): wt=23.000, iters=3415
% 0.98/1.29
% 0.98/1.29 Low Water (keep): wt=22.000, iters=3335
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=21.000, iters=3499
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=20.000, iters=3366
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=19.000, iters=3381
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=18.000, iters=3335
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=17.000, iters=3421
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=16.000, iters=3348
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=15.000, iters=3354
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=14.000, iters=3366
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=13.000, iters=3367
% 41.85/42.16
% 41.85/42.16 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 31 (0.00 of 0.69 sec).
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=12.000, iters=3340
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=11.000, iters=3339
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=3885, wt=27.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=3886, wt=26.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=3915, wt=25.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=3933, wt=24.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=4032, wt=23.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=4359, wt=22.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=15488, wt=17.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=15513, wt=10.000
% 41.85/42.16
% 41.85/42.16 Low Water (keep): wt=10.000, iters=3333
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=19162, wt=9.000
% 41.85/42.16
% 41.85/42.16 Low Water (displace): id=21895, wt=8.000
% 41.85/42.16
% 41.85/42.16 ============================== PROOF =================================
% 41.85/42.16 % SZS status Theorem
% 41.85/42.16 % SZS output start Refutation
% 41.85/42.16
% 41.85/42.16 % Proof 1 at 40.06 (+ 1.11) seconds.
% 41.85/42.16 % Length of proof is 87.
% 41.85/42.16 % Level of proof is 23.
% 41.85/42.16 % Maximum clause weight is 23.000.
% 41.85/42.16 % Given clauses 4675.
% 41.85/42.16
% 41.85/42.16 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 41.85/42.16 2 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 41.85/42.16 3 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 41.85/42.16 4 (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].
% 41.85/42.16 8 -(all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 41.85/42.16 10 subset(c1,c2) # label(l3_zfmisc_1) # label(negated_conjecture). [clausify(8)].
% 41.85/42.16 11 subset(A,B) | in(f2(A,B),A) # label(d3_tarski) # label(axiom). [clausify(3)].
% 41.85/42.16 13 set_difference(A,B) = C | in(f3(A,B,C),C) | in(f3(A,B,C),A) # label(d4_xboole_0) # label(axiom). [clausify(4)].
% 41.85/42.16 14 -in(c3,c1) # label(l3_zfmisc_1) # label(negated_conjecture). [clausify(8)].
% 41.85/42.16 15 -in(A,B) | -in(B,A) # label(antisymmetry_r2_hidden) # label(axiom). [clausify(1)].
% 41.85/42.16 16 -subset(c1,set_difference(c2,singleton(c3))) # label(l3_zfmisc_1) # label(negated_conjecture). [clausify(8)].
% 41.85/42.16 17 set_difference(A,B) != C | -in(D,C) | -in(D,B) # label(d4_xboole_0) # label(axiom). [clausify(4)].
% 41.85/42.16 18 subset(A,B) | -in(f2(A,B),B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 41.85/42.16 19 -subset(A,B) | -in(C,A) | in(C,B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 41.85/42.16 20 singleton(A) != B | -in(C,B) | C = A # label(d1_tarski) # label(axiom). [clausify(2)].
% 41.85/42.16 21 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(2)].
% 41.85/42.16 22 set_difference(A,B) != C | -in(D,C) | in(D,A) # label(d4_xboole_0) # label(axiom). [clausify(4)].
% 41.85/42.16 24 set_difference(A,B) != C | in(D,C) | -in(D,A) | in(D,B) # label(d4_xboole_0) # label(axiom). [clausify(4)].
% 41.85/42.16 26 set_difference(A,B) = C | -in(f3(A,B,C),C) | -in(f3(A,B,C),A) | in(f3(A,B,C),B) # label(d4_xboole_0) # label(axiom). [clausify(4)].
% 41.85/42.16 27 set_difference(A,B) = A | in(f3(A,B,A),A). [factor(13,b,c)].
% 41.85/42.16 28 -in(A,A). [factor(15,a,b)].
% 41.85/42.16 32 set_difference(A,B) = A | -in(f3(A,B,A),A) | in(f3(A,B,A),B). [factor(26,b,c)].
% 41.85/42.16 36 in(f2(c1,set_difference(c2,singleton(c3))),c1). [resolve(16,a,11,a)].
% 41.85/42.16 43 -in(f2(c1,set_difference(c2,singleton(c3))),set_difference(c2,singleton(c3))). [ur(18,a,16,a)].
% 41.85/42.16 44 -in(A,B) | in(A,C) | in(f2(B,C),B). [resolve(19,a,11,a)].
% 41.85/42.16 45 -in(A,c1) | in(A,c2). [resolve(19,a,10,a)].
% 41.85/42.16 49 in(A,singleton(B)) | A != B. [xx_res(21,a)].
% 41.85/42.16 50 singleton(A) != B | in(A,B). [xx_res(21,c)].
% 41.85/42.16 55 -in(c3,set_difference(c1,A)). [ur(22,a,xx,c,14,a)].
% 41.85/42.16 74 set_difference(A,B) = A | set_difference(C,A) != D | -in(f3(A,B,A),D). [resolve(27,b,17,c)].
% 41.85/42.16 75 set_difference(A,B) = A | set_difference(C,D) != A | -in(f3(A,B,A),D). [resolve(27,b,17,b)].
% 41.85/42.16 78 -in(A,set_difference(A,B)). [ur(22,a,xx,c,28,a)].
% 41.85/42.16 79 singleton(A) != A. [ur(21,b,28,a,c,xx)].
% 41.85/42.16 85 set_difference(A,B) = A | in(f3(A,B,A),B). [resolve(32,b,27,b),merge(c)].
% 41.85/42.16 90 -in(A,singleton(singleton(A))). [ur(20,a,xx,c,79,a(flip))].
% 41.85/42.16 99 in(A,singleton(A)). [xx_res(49,b)].
% 41.85/42.16 102 set_difference(singleton(A),B) != C | in(A,C) | in(A,B). [resolve(99,a,24,c)].
% 41.85/42.16 121 -subset(singleton(A),A). [ur(19,b,99,a,c,28,a)].
% 41.85/42.16 134 in(f2(singleton(A),A),singleton(A)). [resolve(121,a,11,a)].
% 41.85/42.16 155 singleton(A) != singleton(B) | f2(singleton(B),B) = A. [resolve(134,a,20,b)].
% 41.85/42.16 180 in(f2(c1,set_difference(c2,singleton(c3))),c2). [resolve(36,a,45,a)].
% 41.85/42.16 183 set_difference(c1,A) != B | in(f2(c1,set_difference(c2,singleton(c3))),B) | in(f2(c1,set_difference(c2,singleton(c3))),A). [resolve(36,a,24,c)].
% 41.85/42.16 267 set_difference(c2,A) != B | in(f2(c1,set_difference(c2,singleton(c3))),B) | in(f2(c1,set_difference(c2,singleton(c3))),A). [resolve(180,a,24,c)].
% 41.85/42.16 285 -in(f2(c1,set_difference(c2,singleton(c3))),set_difference(A,c2)). [ur(17,a,xx,c,180,a)].
% 41.85/42.16 319 set_difference(singleton(A),singleton(singleton(A))) != A. [ur(24,b,28,a,c,99,a,d,90,a)].
% 41.85/42.16 359 in(A,B) | in(f2(singleton(A),B),singleton(A)). [resolve(44,a,99,a)].
% 41.85/42.16 371 in(A,B) | singleton(C) != singleton(A) | f2(singleton(A),B) = C. [resolve(359,b,20,b)].
% 41.85/42.16 487 set_difference(A,B) = A | singleton(C) != B | f3(A,B,A) = C. [resolve(85,b,20,b)].
% 41.85/42.16 1526 f2(singleton(A),A) = A. [xx_res(155,a)].
% 41.85/42.16 5903 in(A,set_difference(singleton(A),B)) | in(A,B). [resolve(102,a,1526,a(flip)),rewrite([1526(6)])].
% 41.85/42.16 5918 in(A,B) | -in(set_difference(singleton(A),B),A). [resolve(5903,a,15,b)].
% 41.85/42.16 5933 set_difference(A,B) = A | set_difference(C,A) != B. [resolve(74,c,85,b),merge(c)].
% 41.85/42.16 6014 -in(set_difference(singleton(A),A),A). [ur(5918,a,28,a)].
% 41.85/42.16 6062 set_difference(A,B) = A | set_difference(C,B) != A. [resolve(75,c,85,b),merge(c)].
% 41.85/42.16 6109 singleton(set_difference(singleton(A),A)) != A. [ur(50,b,6014,a)].
% 41.85/42.16 6217 set_difference(A,set_difference(B,A)) = A. [resolve(5933,b,1526,a(flip)),rewrite([1526(4)])].
% 41.85/42.16 6244 set_difference(set_difference(A,B),B) = set_difference(A,B). [resolve(6217,a,5933,b)].
% 41.85/42.16 7046 -in(A,singleton(singleton(set_difference(singleton(A),A)))). [ur(20,a,6217,a(flip),c,6109,a(flip)),rewrite([6217(10)])].
% 41.85/42.16 9517 -in(A,singleton(set_difference(singleton(A),singleton(singleton(A))))). [ur(20,a,6217,a(flip),c,319,a(flip)),rewrite([6217(12)])].
% 41.85/42.16 9842 c2 != A | in(f2(c1,set_difference(c2,singleton(c3))),A). [para(6217(a,1),267(a,1)),unit_del(c,285)].
% 41.85/42.16 9850 set_difference(c2,singleton(c3)) != c2. [ur(9842,b,43,a),flip(a)].
% 41.85/42.16 9851 f2(c1,set_difference(c2,singleton(c3))) != c2. [ur(9842,b,28,a),flip(a)].
% 41.85/42.16 9853 set_difference(A,singleton(c3)) != c2. [ur(6062,a,9850,a)].
% 41.85/42.16 9859 -in(f3(c2,singleton(c3),c2),set_difference(A,c2)). [ur(75,a,9850,a,b,6217,a)].
% 41.85/42.16 9871 -in(set_difference(A,singleton(c3)),singleton(c2)). [ur(20,a,6217,a(flip),c,9853,a),rewrite([6217(9)])].
% 41.85/42.16 12656 in(A,B) | f2(singleton(A),B) = A. [xx_res(371,b)].
% 41.85/42.16 12697 f2(singleton(set_difference(A,singleton(c3))),singleton(c2)) = set_difference(A,singleton(c3)). [resolve(12656,a,9871,a)].
% 41.85/42.16 12962 f2(singleton(A),set_difference(A,B)) = A. [resolve(12656,a,78,a)].
% 41.85/42.16 13207 f2(singleton(A),singleton(singleton(set_difference(singleton(A),A)))) = A. [resolve(7046,a,12656,a)].
% 41.85/42.16 13710 set_difference(A,singleton(B)) = A | f3(A,singleton(B),A) = B. [resolve(487,b,12962,a(flip)),rewrite([12962(5),12962(8)])].
% 41.85/42.16 14412 -in(f2(c1,set_difference(c2,singleton(c3))),singleton(c2)). [ur(20,a,13207,a(flip),c,9851,a),rewrite([13207(18)])].
% 41.85/42.16 18216 in(f2(c1,set_difference(c2,singleton(c3))),singleton(c3)). [resolve(12697,a,267,a(flip)),rewrite([12697(14)]),unit_del(a,43)].
% 41.85/42.16 18787 f2(singleton(A),singleton(set_difference(singleton(A),singleton(singleton(A))))) = A. [resolve(9517,a,12656,a)].
% 41.85/42.16 18844 in(f3(c2,singleton(c3),c2),c2). [resolve(9859,a,5903,a)].
% 41.85/42.16 18853 in(f3(c2,singleton(c3),c2),singleton(c3)). [resolve(18844,a,26,c),unit_del(a,9853),unit_del(b,18844)].
% 41.85/42.16 18862 singleton(c3) != singleton(A) | f3(c2,singleton(c3),c2) = A. [resolve(18853,a,20,b),flip(a)].
% 41.85/42.16 18964 f3(c2,singleton(c3),c2) = c3. [xx_res(18862,a)].
% 41.85/42.16 19006 in(c3,c2). [back_rewrite(18844),rewrite([18964(5)])].
% 41.85/42.16 19090 set_difference(c1,A) != c2. [ur(22,b,19006,a,c,14,a)].
% 41.85/42.16 19589 -in(set_difference(c1,A),singleton(c2)). [ur(20,a,18787,a(flip),c,19090,a),rewrite([18787(15)])].
% 41.85/42.16 20050 -in(set_difference(c1,singleton(c2)),c1). [ur(24,a,6244,a(flip),b,78,a,d,19589,a)].
% 41.85/42.16 20258 f2(singleton(set_difference(c1,singleton(c2))),c1) = set_difference(c1,singleton(c2)). [resolve(20050,a,12656,a)].
% 41.85/42.16 22089 in(f2(c1,set_difference(c2,singleton(c3))),set_difference(c1,singleton(c2))). [resolve(20258,a,183,a(flip)),rewrite([20258(13)]),unit_del(b,14412)].
% 41.85/42.16 22146 set_difference(c1,singleton(c2)) != set_difference(A,singleton(c3)). [ur(17,b,22089,a,c,18216,a),flip(a)].
% 41.85/42.16 23698 set_difference(A,singleton(B)) = A | in(B,A). [para(13710(b,1),27(b,1)),merge(b)].
% 41.85/42.16 24626 set_difference(set_difference(c1,A),singleton(c3)) = set_difference(c1,A). [resolve(23698,b,55,a)].
% 41.85/42.16 24627 $F. [resolve(24626,a,22146,a(flip))].
% 41.85/42.16
% 41.85/42.16 % SZS output end Refutation
% 41.85/42.16 ============================== end of proof ==========================
% 41.85/42.16
% 41.85/42.16 ============================== STATISTICS ============================
% 41.85/42.16
% 41.85/42.16 Given=4675. Generated=2263631. Kept=24618. proofs=1.
% 41.85/42.16 Usable=4531. Sos=9998. Demods=1862. Limbo=904, Disabled=9202. Hints=0.
% 41.85/42.16 Megabytes=15.98.
% 41.85/42.16 User_CPU=40.06, System_CPU=1.11, Wall_clock=41.
% 41.85/42.16
% 41.85/42.16 ============================== end of statistics =====================
% 41.85/42.16
% 41.85/42.16 ============================== end of search =========================
% 41.85/42.16
% 41.85/42.16 THEOREM PROVED
% 41.85/42.16 % SZS status Theorem
% 41.85/42.16
% 41.85/42.16 Exiting with 1 proof.
% 41.85/42.16
% 41.85/42.16 Process 7934 exit (max_proofs) Sun Jun 19 08:04:00 2022
% 41.85/42.16 Prover9 interrupted
%------------------------------------------------------------------------------