TSTP Solution File: KLE091+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE091+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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 : Sun Jul 17 02:22:11 EDT 2022
% Result : Theorem 1.14s 1.42s
% Output : Refutation 1.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE091+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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.12/0.33 % DateTime : Thu Jun 16 14:28:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/1.05 ============================== Prover9 ===============================
% 0.76/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.05 Process 2923 was started by sandbox on n015.cluster.edu,
% 0.76/1.05 Thu Jun 16 14:28:57 2022
% 0.76/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2770_n015.cluster.edu".
% 0.76/1.05 ============================== end of head ===========================
% 0.76/1.05
% 0.76/1.05 ============================== INPUT =================================
% 0.76/1.05
% 0.76/1.05 % Reading from file /tmp/Prover9_2770_n015.cluster.edu
% 0.76/1.05
% 0.76/1.05 set(prolog_style_variables).
% 0.76/1.05 set(auto2).
% 0.76/1.05 % set(auto2) -> set(auto).
% 0.76/1.05 % set(auto) -> set(auto_inference).
% 0.76/1.05 % set(auto) -> set(auto_setup).
% 0.76/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.05 % set(auto) -> set(auto_limits).
% 0.76/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.05 % set(auto) -> set(auto_denials).
% 0.76/1.05 % set(auto) -> set(auto_process).
% 0.76/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.05 % set(auto2) -> assign(stats, some).
% 0.76/1.05 % set(auto2) -> clear(echo_input).
% 0.76/1.05 % set(auto2) -> set(quiet).
% 0.76/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.05 % set(auto2) -> clear(print_given).
% 0.76/1.05 assign(lrs_ticks,-1).
% 0.76/1.05 assign(sos_limit,10000).
% 0.76/1.05 assign(order,kbo).
% 0.76/1.05 set(lex_order_vars).
% 0.76/1.05 clear(print_given).
% 0.76/1.05
% 0.76/1.05 % formulas(sos). % not echoed (21 formulas)
% 0.76/1.05
% 0.76/1.05 ============================== end of input ==========================
% 0.76/1.05
% 0.76/1.05 % From the command line: assign(max_seconds, 300).
% 0.76/1.05
% 0.76/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.05
% 0.76/1.05 % Formulas that are not ordinary clauses:
% 0.76/1.05 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 13 (all X0 multiplication(antidomain(X0),X0) = zero) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.05 14 (all X0 all X1 addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))) = antidomain(multiplication(X0,antidomain(antidomain(X1))))) # label(domain2) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 15 (all X0 addition(antidomain(antidomain(X0)),antidomain(X0)) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 16 (all X0 domain(X0) = antidomain(antidomain(X0))) # label(domain4) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 17 (all X0 multiplication(X0,coantidomain(X0)) = zero) # label(codomain1) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 18 (all X0 all X1 addition(coantidomain(multiplication(X0,X1)),coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))) = coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))) # label(codomain2) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 19 (all X0 addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one) # label(codomain3) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 20 (all X0 codomain(X0) = coantidomain(coantidomain(X0))) # label(codomain4) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 21 -(all X0 domain(codomain(X0)) = codomain(X0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.14/1.42
% 1.14/1.42 ============================== end of process non-clausal formulas ===
% 1.14/1.42
% 1.14/1.42 ============================== PROCESS INITIAL CLAUSES ===============
% 1.14/1.42
% 1.14/1.42 ============================== PREDICATE ELIMINATION =================
% 1.14/1.42 22 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 1.14/1.42 23 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 1.14/1.42
% 1.14/1.42 ============================== end predicate elimination =============
% 1.14/1.42
% 1.14/1.42 Auto_denials:
% 1.14/1.42 % copying label goals to answer in negative clause
% 1.14/1.42
% 1.14/1.42 Term ordering decisions:
% 1.14/1.42 Function symbol KB weights: zero=1. one=1. c1=1. multiplication=1. addition=1. antidomain=1. coantidomain=1. codomain=1. domain=1.
% 1.14/1.42
% 1.14/1.42 ============================== end of process initial clauses ========
% 1.14/1.42
% 1.14/1.42 ============================== CLAUSES FOR SEARCH ====================
% 1.14/1.42
% 1.14/1.42 ============================== end of clauses for search =============
% 1.14/1.42
% 1.14/1.42 ============================== SEARCH ================================
% 1.14/1.42
% 1.14/1.42 % Starting search at 0.01 seconds.
% 1.14/1.42
% 1.14/1.42 ============================== PROOF =================================
% 1.14/1.42 % SZS status Theorem
% 1.14/1.42 % SZS output start Refutation
% 1.14/1.42
% 1.14/1.42 % Proof 1 at 0.37 (+ 0.02) seconds: goals.
% 1.14/1.42 % Length of proof is 73.
% 1.14/1.42 % Level of proof is 15.
% 1.14/1.42 % Maximum clause weight is 18.000.
% 1.14/1.42 % Given clauses 208.
% 1.14/1.42
% 1.14/1.42 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 13 (all X0 multiplication(antidomain(X0),X0) = zero) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 14 (all X0 all X1 addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))) = antidomain(multiplication(X0,antidomain(antidomain(X1))))) # label(domain2) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 15 (all X0 addition(antidomain(antidomain(X0)),antidomain(X0)) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 16 (all X0 domain(X0) = antidomain(antidomain(X0))) # label(domain4) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 17 (all X0 multiplication(X0,coantidomain(X0)) = zero) # label(codomain1) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 19 (all X0 addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one) # label(codomain3) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 20 (all X0 codomain(X0) = coantidomain(coantidomain(X0))) # label(codomain4) # label(axiom) # label(non_clause). [assumption].
% 1.14/1.42 21 -(all X0 domain(codomain(X0)) = codomain(X0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.14/1.42 24 addition(A,zero) = A # label(additive_identity) # label(axiom). [clausify(3)].
% 1.14/1.42 25 addition(A,A) = A # label(additive_idempotence) # label(axiom). [clausify(4)].
% 1.14/1.42 26 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 1.14/1.42 27 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 1.14/1.42 28 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom). [clausify(10)].
% 1.14/1.42 30 multiplication(antidomain(A),A) = zero # label(domain1) # label(axiom). [clausify(13)].
% 1.14/1.42 31 domain(A) = antidomain(antidomain(A)) # label(domain4) # label(axiom). [clausify(16)].
% 1.14/1.42 32 multiplication(A,coantidomain(A)) = zero # label(codomain1) # label(axiom). [clausify(17)].
% 1.14/1.42 33 codomain(A) = coantidomain(coantidomain(A)) # label(codomain4) # label(axiom). [clausify(20)].
% 1.14/1.42 34 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 1.14/1.42 35 addition(antidomain(antidomain(A)),antidomain(A)) = one # label(domain3) # label(axiom). [clausify(15)].
% 1.14/1.42 36 addition(antidomain(A),antidomain(antidomain(A))) = one. [copy(35),rewrite([34(4)])].
% 1.14/1.42 37 addition(coantidomain(coantidomain(A)),coantidomain(A)) = one # label(codomain3) # label(axiom). [clausify(19)].
% 1.14/1.42 38 addition(coantidomain(A),coantidomain(coantidomain(A))) = one. [copy(37),rewrite([34(4)])].
% 1.14/1.42 39 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom). [clausify(2)].
% 1.14/1.42 40 addition(A,addition(B,C)) = addition(C,addition(A,B)). [copy(39),rewrite([34(2)]),flip(a)].
% 1.14/1.42 41 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom). [clausify(5)].
% 1.14/1.42 42 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom). [clausify(8)].
% 1.14/1.42 43 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)). [copy(42),flip(a)].
% 1.14/1.42 44 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 1.14/1.42 45 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(44),flip(a)].
% 1.14/1.42 46 antidomain(multiplication(A,antidomain(antidomain(B)))) = addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))) # label(domain2) # label(axiom). [clausify(14)].
% 1.14/1.42 47 addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))) = antidomain(multiplication(A,antidomain(antidomain(B)))). [copy(46),flip(a)].
% 1.14/1.42 50 codomain(c1) != domain(codomain(c1)) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(21)].
% 1.14/1.42 51 antidomain(antidomain(coantidomain(coantidomain(c1)))) != coantidomain(coantidomain(c1)) # answer(goals). [copy(50),rewrite([33(2),33(5),31(7)]),flip(a)].
% 1.14/1.42 52 antidomain(one) = zero. [para(30(a,1),26(a,1)),flip(a)].
% 1.14/1.42 54 addition(A,addition(A,B)) = addition(A,B). [para(40(a,1),25(a,1)),rewrite([34(1),34(2),40(2,R),25(1),34(3)])].
% 1.14/1.42 58 addition(zero,multiplication(A,B)) = multiplication(A,B). [para(24(a,1),43(a,2,2)),rewrite([28(3),34(3)])].
% 1.14/1.42 60 multiplication(antidomain(A),addition(A,B)) = multiplication(antidomain(A),B). [para(30(a,1),43(a,1,1)),rewrite([58(4)]),flip(a)].
% 1.14/1.42 64 multiplication(addition(A,B),coantidomain(B)) = multiplication(A,coantidomain(B)). [para(32(a,1),45(a,1,1)),rewrite([58(4),34(3)]),flip(a)].
% 1.14/1.42 72 addition(antidomain(zero),antidomain(multiplication(A,antidomain(antidomain(coantidomain(A)))))) = antidomain(multiplication(A,antidomain(antidomain(coantidomain(A))))). [para(32(a,1),47(a,1,1,1))].
% 1.14/1.42 81 addition(zero,antidomain(zero)) = one. [para(52(a,1),36(a,1,1)),rewrite([52(3)])].
% 1.14/1.42 85 multiplication(A,antidomain(zero)) = A. [para(81(a,1),43(a,2,2)),rewrite([28(2),58(5),26(5)])].
% 1.14/1.42 91 addition(one,antidomain(A)) = one. [para(36(a,1),54(a,1,2)),rewrite([34(3),36(7)])].
% 1.14/1.42 92 addition(one,coantidomain(A)) = one. [para(38(a,1),54(a,1,2)),rewrite([34(3),38(7)])].
% 1.14/1.42 93 antidomain(zero) = one. [para(85(a,1),27(a,1)),flip(a)].
% 1.14/1.42 94 antidomain(multiplication(A,antidomain(antidomain(coantidomain(A))))) = one. [back_rewrite(72),rewrite([93(2),91(7)]),flip(a)].
% 1.14/1.42 105 addition(A,multiplication(antidomain(B),A)) = A. [para(91(a,1),45(a,2,1)),rewrite([27(2),27(5)])].
% 1.14/1.42 107 addition(A,multiplication(coantidomain(B),A)) = A. [para(92(a,1),45(a,2,1)),rewrite([27(2),27(5)])].
% 1.14/1.42 141 multiplication(A,antidomain(antidomain(coantidomain(A)))) = zero. [para(94(a,1),30(a,1,1)),rewrite([27(6)])].
% 1.14/1.42 146 multiplication(A,addition(B,antidomain(antidomain(coantidomain(A))))) = multiplication(A,B). [para(141(a,1),43(a,1,1)),rewrite([58(3),34(5)]),flip(a)].
% 1.14/1.42 152 multiplication(antidomain(coantidomain(A)),coantidomain(coantidomain(A))) = antidomain(coantidomain(A)). [para(38(a,1),60(a,1,2)),rewrite([26(4)]),flip(a)].
% 1.14/1.42 246 multiplication(addition(A,B),coantidomain(A)) = multiplication(B,coantidomain(A)). [para(34(a,1),64(a,1,1))].
% 1.14/1.42 248 multiplication(coantidomain(A),coantidomain(coantidomain(coantidomain(A)))) = coantidomain(coantidomain(coantidomain(A))). [para(38(a,1),64(a,1,1)),rewrite([27(5)]),flip(a)].
% 1.14/1.42 635 addition(antidomain(coantidomain(A)),coantidomain(coantidomain(A))) = coantidomain(coantidomain(A)). [para(152(a,1),105(a,1,2)),rewrite([34(5)])].
% 1.14/1.42 832 multiplication(antidomain(antidomain(A)),coantidomain(antidomain(A))) = coantidomain(antidomain(A)). [para(36(a,1),246(a,1,1)),rewrite([27(4)]),flip(a)].
% 1.14/1.42 2359 multiplication(A,antidomain(coantidomain(A))) = A. [para(36(a,1),146(a,1,2)),rewrite([26(2)]),flip(a)].
% 1.14/1.42 2381 multiplication(A,multiplication(antidomain(coantidomain(A)),B)) = multiplication(A,B). [para(2359(a,1),41(a,1,1)),flip(a)].
% 1.14/1.42 2389 addition(coantidomain(A),antidomain(coantidomain(coantidomain(A)))) = antidomain(coantidomain(coantidomain(A))). [para(2359(a,1),107(a,1,2)),rewrite([34(5)])].
% 1.14/1.42 2488 multiplication(A,coantidomain(coantidomain(A))) = A. [para(152(a,1),2381(a,1,2)),rewrite([2359(3)]),flip(a)].
% 1.14/1.42 2521 coantidomain(coantidomain(coantidomain(A))) = coantidomain(A). [back_rewrite(248),rewrite([2488(5)]),flip(a)].
% 1.14/1.42 2550 antidomain(coantidomain(coantidomain(A))) = coantidomain(A). [para(2521(a,1),635(a,1,2)),rewrite([34(5),2389(5),2521(6)])].
% 1.14/1.42 2564 coantidomain(coantidomain(c1)) != antidomain(coantidomain(c1)) # answer(goals). [back_rewrite(51),rewrite([2550(4)]),flip(a)].
% 1.14/1.42 2656 coantidomain(coantidomain(A)) = antidomain(coantidomain(A)). [para(2550(a,1),832(a,1,1,1)),rewrite([2550(5),152(5),2550(5)]),flip(a)].
% 1.14/1.42 2657 $F # answer(goals). [resolve(2656,a,2564,a)].
% 1.14/1.42
% 1.14/1.42 % SZS output end Refutation
% 1.14/1.42 ============================== end of proof ==========================
% 1.14/1.42
% 1.14/1.42 ============================== STATISTICS ============================
% 1.14/1.42
% 1.14/1.42 Given=208. Generated=18537. Kept=2625. proofs=1.
% 1.14/1.42 Usable=163. Sos=1898. Demods=1902. Limbo=6, Disabled=579. Hints=0.
% 1.14/1.42 Megabytes=3.09.
% 1.14/1.42 User_CPU=0.37, System_CPU=0.02, Wall_clock=0.
% 1.14/1.42
% 1.14/1.42 ============================== end of statistics =====================
% 1.14/1.42
% 1.14/1.42 ============================== end of search =========================
% 1.14/1.42
% 1.14/1.42 THEOREM PROVED
% 1.14/1.42 % SZS status Theorem
% 1.14/1.42
% 1.14/1.42 Exiting with 1 proof.
% 1.14/1.42
% 1.14/1.42 Process 2923 exit (max_proofs) Thu Jun 16 14:28:57 2022
% 1.14/1.42 Prover9 interrupted
%------------------------------------------------------------------------------