TSTP Solution File: KLE071+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE071+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:05 EDT 2022
% Result : Theorem 1.33s 1.64s
% Output : Refutation 1.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE071+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 12:31:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.73/1.03 ============================== Prover9 ===============================
% 0.73/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.03 Process 11017 was started by sandbox2 on n012.cluster.edu,
% 0.73/1.03 Thu Jun 16 12:31:40 2022
% 0.73/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10862_n012.cluster.edu".
% 0.73/1.03 ============================== end of head ===========================
% 0.73/1.03
% 0.73/1.03 ============================== INPUT =================================
% 0.73/1.03
% 0.73/1.03 % Reading from file /tmp/Prover9_10862_n012.cluster.edu
% 0.73/1.03
% 0.73/1.03 set(prolog_style_variables).
% 0.73/1.03 set(auto2).
% 0.73/1.03 % set(auto2) -> set(auto).
% 0.73/1.03 % set(auto) -> set(auto_inference).
% 0.73/1.03 % set(auto) -> set(auto_setup).
% 0.73/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.03 % set(auto) -> set(auto_limits).
% 0.73/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.03 % set(auto) -> set(auto_denials).
% 0.73/1.03 % set(auto) -> set(auto_process).
% 0.73/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.03 % set(auto2) -> assign(stats, some).
% 0.73/1.03 % set(auto2) -> clear(echo_input).
% 0.73/1.03 % set(auto2) -> set(quiet).
% 0.73/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.03 % set(auto2) -> clear(print_given).
% 0.73/1.03 assign(lrs_ticks,-1).
% 0.73/1.03 assign(sos_limit,10000).
% 0.73/1.03 assign(order,kbo).
% 0.73/1.03 set(lex_order_vars).
% 0.73/1.03 clear(print_given).
% 0.73/1.03
% 0.73/1.03 % formulas(sos). % not echoed (18 formulas)
% 0.73/1.03
% 0.73/1.03 ============================== end of input ==========================
% 0.73/1.03
% 0.73/1.03 % From the command line: assign(max_seconds, 300).
% 0.73/1.03
% 0.73/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.03
% 0.73/1.03 % Formulas that are not ordinary clauses:
% 0.73/1.03 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 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.73/1.03 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 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.73/1.03 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 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.73/1.03 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.73/1.03 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 13 (all X0 addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0)) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 14 (all X0 all X1 domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1)))) # label(domain2) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 15 (all X0 addition(domain(X0),one) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 16 (all X0 all X1 domain(addition(X0,X1)) = addition(domain(X0),domain(X1))) # label(domain5) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 17 -(all X0 all X1 all X2 addition(domain(X0),multiplication(domain(X1),domain(X2))) = multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.33/1.64
% 1.33/1.64 ============================== end of process non-clausal formulas ===
% 1.33/1.64
% 1.33/1.64 ============================== PROCESS INITIAL CLAUSES ===============
% 1.33/1.64
% 1.33/1.64 ============================== PREDICATE ELIMINATION =================
% 1.33/1.64 18 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 1.33/1.64 19 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 1.33/1.64
% 1.33/1.64 ============================== end predicate elimination =============
% 1.33/1.64
% 1.33/1.64 Auto_denials:
% 1.33/1.64 % copying label goals to answer in negative clause
% 1.33/1.64
% 1.33/1.64 Term ordering decisions:
% 1.33/1.64
% 1.33/1.64 % Assigning unary symbol domain kb_weight 0 and highest precedence (9).
% 1.33/1.64 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. c3=1. multiplication=1. addition=1. domain=0.
% 1.33/1.64
% 1.33/1.64 ============================== end of process initial clauses ========
% 1.33/1.64
% 1.33/1.64 ============================== CLAUSES FOR SEARCH ====================
% 1.33/1.64
% 1.33/1.64 ============================== end of clauses for search =============
% 1.33/1.64
% 1.33/1.64 ============================== SEARCH ================================
% 1.33/1.64
% 1.33/1.64 % Starting search at 0.01 seconds.
% 1.33/1.64
% 1.33/1.64 ============================== PROOF =================================
% 1.33/1.64 % SZS status Theorem
% 1.33/1.64 % SZS output start Refutation
% 1.33/1.64
% 1.33/1.64 % Proof 1 at 0.61 (+ 0.01) seconds: goals.
% 1.33/1.64 % Length of proof is 70.
% 1.33/1.64 % Level of proof is 15.
% 1.33/1.64 % Maximum clause weight is 24.000.
% 1.33/1.64 % Given clauses 146.
% 1.33/1.64
% 1.33/1.64 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 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.33/1.64 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.33/1.64 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 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.33/1.64 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.33/1.64 13 (all X0 addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0)) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 14 (all X0 all X1 domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1)))) # label(domain2) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 15 (all X0 addition(domain(X0),one) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 16 (all X0 all X1 domain(addition(X0,X1)) = addition(domain(X0),domain(X1))) # label(domain5) # label(axiom) # label(non_clause). [assumption].
% 1.33/1.64 17 -(all X0 all X1 all X2 addition(domain(X0),multiplication(domain(X1),domain(X2))) = multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.33/1.64 23 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 1.33/1.64 24 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 1.33/1.64 27 addition(domain(A),one) = one # label(domain3) # label(axiom). [clausify(15)].
% 1.33/1.64 28 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 1.33/1.64 29 domain(multiplication(A,domain(B))) = domain(multiplication(A,B)) # label(domain2) # label(axiom). [clausify(14)].
% 1.33/1.64 30 domain(addition(A,B)) = addition(domain(A),domain(B)) # label(domain5) # label(axiom). [clausify(16)].
% 1.33/1.64 31 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom). [clausify(2)].
% 1.33/1.64 32 addition(A,addition(B,C)) = addition(C,addition(A,B)). [copy(31),rewrite([28(2)]),flip(a)].
% 1.33/1.64 33 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom). [clausify(5)].
% 1.33/1.64 34 multiplication(domain(A),A) = addition(A,multiplication(domain(A),A)) # label(domain1) # label(axiom). [clausify(13)].
% 1.33/1.64 35 addition(A,multiplication(domain(A),A)) = multiplication(domain(A),A). [copy(34),flip(a)].
% 1.33/1.64 36 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom). [clausify(8)].
% 1.33/1.64 37 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)). [copy(36),flip(a)].
% 1.33/1.64 38 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 1.33/1.64 39 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(38),flip(a)].
% 1.33/1.64 40 multiplication(addition(domain(c1),domain(c2)),addition(domain(c1),domain(c3))) != addition(domain(c1),multiplication(domain(c2),domain(c3))) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(17)].
% 1.33/1.64 43 domain(domain(A)) = domain(A). [para(24(a,1),29(a,1,1)),rewrite([24(4)])].
% 1.33/1.64 52 addition(multiplication(A,domain(B)),multiplication(domain(multiplication(A,B)),multiplication(A,domain(B)))) = multiplication(domain(multiplication(A,B)),multiplication(A,domain(B))). [para(29(a,1),35(a,1,2,1)),rewrite([29(11)])].
% 1.33/1.64 57 multiplication(A,addition(B,one)) = addition(A,multiplication(A,B)). [para(23(a,1),37(a,1,1)),rewrite([28(4)]),flip(a)].
% 1.33/1.64 58 addition(A,multiplication(A,domain(B))) = A. [para(27(a,1),37(a,2,2)),rewrite([23(4),28(3),23(5)])].
% 1.33/1.64 59 addition(domain(multiplication(A,B)),domain(multiplication(A,C))) = domain(multiplication(A,addition(B,C))). [para(37(a,1),30(a,1,1)),flip(a)].
% 1.33/1.64 61 addition(A,multiplication(domain(B),A)) = A. [para(27(a,1),39(a,2,1)),rewrite([24(4),28(3),24(5)])].
% 1.33/1.64 62 addition(domain(multiplication(A,B)),domain(multiplication(C,B))) = domain(multiplication(addition(A,C),B)). [para(39(a,1),30(a,1,1)),flip(a)].
% 1.33/1.64 65 multiplication(domain(A),multiplication(A,B)) = multiplication(A,B). [para(35(a,1),39(a,2,1)),rewrite([33(4),61(5),33(4)]),flip(a)].
% 1.33/1.64 67 multiplication(domain(multiplication(A,B)),multiplication(A,domain(B))) = multiplication(A,domain(B)). [back_rewrite(52),rewrite([61(8)]),flip(a)].
% 1.33/1.64 68 multiplication(domain(A),A) = A. [back_rewrite(35),rewrite([61(3)]),flip(a)].
% 1.33/1.64 70 addition(A,multiplication(B,A)) = multiplication(addition(B,domain(A)),A). [para(68(a,1),39(a,1,1)),rewrite([28(4)])].
% 1.33/1.64 71 multiplication(domain(A),domain(A)) = domain(A). [para(43(a,1),68(a,1,1))].
% 1.33/1.64 72 multiplication(addition(domain(A),domain(B)),A) = A. [back_rewrite(61),rewrite([70(3),28(3)])].
% 1.33/1.64 79 addition(domain(A),domain(multiplication(A,B))) = domain(A). [para(58(a,1),30(a,1,1)),rewrite([29(5)]),flip(a)].
% 1.33/1.64 81 addition(A,addition(B,multiplication(A,domain(C)))) = addition(A,B). [para(58(a,1),32(a,2,2)),rewrite([28(3),28(5)])].
% 1.33/1.64 84 addition(domain(A),multiplication(domain(A),B)) = multiplication(domain(A),addition(B,domain(A))). [para(71(a,1),37(a,1,1)),rewrite([28(7)])].
% 1.33/1.64 96 multiplication(addition(domain(A),domain(B)),B) = B. [para(28(a,1),72(a,1,1))].
% 1.33/1.64 115 multiplication(domain(multiplication(A,B)),multiplication(A,multiplication(domain(B),C))) = multiplication(A,multiplication(domain(B),C)). [para(29(a,1),65(a,1,1)),rewrite([33(5),33(9)])].
% 1.33/1.64 125 addition(domain(A),domain(multiplication(domain(A),B))) = domain(A). [para(43(a,1),79(a,1,1)),rewrite([43(7)])].
% 1.33/1.64 144 domain(multiplication(domain(A),addition(A,B))) = domain(A). [para(68(a,1),59(a,1,1,1)),rewrite([125(5)]),flip(a)].
% 1.33/1.64 146 domain(multiplication(addition(domain(A),domain(B)),addition(A,C))) = addition(domain(A),domain(multiplication(addition(domain(A),domain(B)),C))). [para(72(a,1),59(a,1,1,1)),flip(a)].
% 1.33/1.64 149 domain(multiplication(addition(domain(A),domain(B)),addition(B,C))) = addition(domain(B),domain(multiplication(addition(domain(A),domain(B)),C))). [para(96(a,1),59(a,1,2,1)),rewrite([28(7),28(11)]),flip(a)].
% 1.33/1.64 174 addition(domain(A),domain(multiplication(domain(B),A))) = domain(A). [para(27(a,1),62(a,2,1,1)),rewrite([24(5),28(5),24(7)])].
% 1.33/1.64 183 domain(multiplication(addition(A,domain(B)),addition(B,C))) = addition(domain(B),domain(multiplication(A,addition(B,C)))). [para(144(a,1),62(a,1,1)),rewrite([28(7)]),flip(a)].
% 1.33/1.64 186 addition(domain(A),domain(multiplication(addition(domain(B),domain(A)),C))) = addition(domain(A),domain(multiplication(domain(B),addition(A,C)))). [back_rewrite(149),rewrite([183(6)]),flip(a)].
% 1.33/1.64 207 multiplication(domain(A),multiplication(domain(B),A)) = multiplication(domain(B),A). [para(174(a,1),96(a,1,1))].
% 1.33/1.64 272 addition(A,multiplication(addition(A,B),domain(C))) = addition(A,multiplication(B,domain(C))). [para(39(a,1),81(a,1,2)),rewrite([28(1)])].
% 1.33/1.64 1107 multiplication(domain(multiplication(A,B)),domain(A)) = domain(multiplication(A,B)). [para(79(a,1),84(a,2,2)),rewrite([57(7,R),27(5),23(4)]),flip(a)].
% 1.33/1.64 1110 multiplication(domain(multiplication(domain(A),B)),domain(A)) = domain(multiplication(domain(A),B)). [para(125(a,1),84(a,2,2)),rewrite([57(9,R),27(6),23(5)]),flip(a)].
% 1.33/1.64 1111 multiplication(domain(multiplication(domain(A),B)),domain(B)) = domain(multiplication(domain(A),B)). [para(174(a,1),84(a,2,2)),rewrite([57(9,R),27(6),23(5)]),flip(a)].
% 1.33/1.64 1216 domain(multiplication(domain(multiplication(A,B)),A)) = domain(multiplication(A,B)). [para(1107(a,1),29(a,1,1)),rewrite([43(3)]),flip(a)].
% 1.33/1.64 1256 domain(multiplication(domain(multiplication(domain(A),B)),A)) = domain(multiplication(domain(A),B)). [para(1216(a,1),29(a,1)),flip(a)].
% 1.33/1.64 2750 multiplication(domain(multiplication(domain(A),B)),multiplication(domain(B),C)) = multiplication(domain(multiplication(domain(A),B)),C). [para(1111(a,1),33(a,1,1)),flip(a)].
% 1.33/1.64 2828 multiplication(domain(multiplication(domain(A),B)),A) = multiplication(domain(B),A). [para(207(a,1),115(a,1,2)),rewrite([2750(6),207(8)])].
% 1.33/1.64 2831 domain(multiplication(domain(A),B)) = multiplication(domain(B),domain(A)). [para(67(a,1),115(a,1,2)),rewrite([2828(4),2750(7),1110(5),67(10)])].
% 1.33/1.64 2874 multiplication(domain(A),domain(B)) = multiplication(domain(B),domain(A)). [back_rewrite(1256),rewrite([2831(3),33(4),68(3),2831(3),2831(6)])].
% 1.33/1.64 3011 addition(domain(A),domain(multiplication(addition(domain(A),domain(B)),C))) = addition(domain(A),multiplication(domain(B),domain(C))). [back_rewrite(186),rewrite([28(4),2831(12),30(10),272(14),2874(11)])].
% 1.33/1.64 3015 domain(multiplication(domain(A),B)) = multiplication(domain(A),domain(B)). [back_rewrite(2831),rewrite([2874(6)])].
% 1.33/1.64 3032 domain(multiplication(addition(domain(A),domain(B)),addition(A,C))) = addition(domain(A),multiplication(domain(B),domain(C))). [back_rewrite(146),rewrite([3011(13)])].
% 1.33/1.64 3055 domain(multiplication(addition(domain(A),domain(B)),C)) = multiplication(addition(domain(A),domain(B)),domain(C)). [para(30(a,1),3015(a,1,1,1)),rewrite([30(7)])].
% 1.33/1.64 3137 multiplication(addition(domain(A),domain(B)),addition(domain(A),domain(C))) = addition(domain(A),multiplication(domain(B),domain(C))). [back_rewrite(3032),rewrite([3055(6),30(5)])].
% 1.33/1.64 3138 $F # answer(goals). [resolve(3137,a,40,a)].
% 1.33/1.64
% 1.33/1.64 % SZS output end Refutation
% 1.33/1.64 ============================== end of proof ==========================
% 1.33/1.64
% 1.33/1.64 ============================== STATISTICS ============================
% 1.33/1.64
% 1.33/1.64 Given=146. Generated=23574. Kept=3114. proofs=1.
% 1.33/1.64 Usable=117. Sos=2198. Demods=2260. Limbo=82, Disabled=735. Hints=0.
% 1.33/1.64 Megabytes=3.95.
% 1.33/1.64 User_CPU=0.61, System_CPU=0.01, Wall_clock=0.
% 1.33/1.64
% 1.33/1.64 ============================== end of statistics =====================
% 1.33/1.64
% 1.33/1.64 ============================== end of search =========================
% 1.33/1.64
% 1.33/1.64 THEOREM PROVED
% 1.33/1.64 % SZS status Theorem
% 1.33/1.64
% 1.33/1.64 Exiting with 1 proof.
% 1.33/1.64
% 1.33/1.64 Process 11017 exit (max_proofs) Thu Jun 16 12:31:40 2022
% 1.33/1.64 Prover9 interrupted
%------------------------------------------------------------------------------