TSTP Solution File: KLE009+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE009+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:21:40 EDT 2022
% Result : Theorem 0.81s 1.13s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE009+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.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 : Thu Jun 16 15:30:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 29357 was started by sandbox on n020.cluster.edu,
% 0.74/1.01 Thu Jun 16 15:30:05 2022
% 0.74/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29204_n020.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_29204_n020.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (19 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/1.01 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 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.74/1.01 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 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.74/1.01 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 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.74/1.01 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.74/1.01 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 14 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 17 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 18 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 19 -(all X0 all X1 (test(X1) & test(X0) -> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.13
% 0.81/1.13 ============================== end of process non-clausal formulas ===
% 0.81/1.13
% 0.81/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.13
% 0.81/1.13 ============================== PREDICATE ELIMINATION =================
% 0.81/1.13 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.81/1.13 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.81/1.13 22 -complement(A,B) | multiplication(B,A) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 Derived: multiplication(A,f1(A)) = zero | -test(A). [resolve(22,a,20,b)].
% 0.81/1.13 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 Derived: multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 0.81/1.13 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 Derived: addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 0.81/1.13 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.81/1.13 Derived: -test(A) | c(A) != B | test(B). [resolve(25,c,21,b)].
% 0.81/1.13 Derived: -test(A) | c(A) != B | multiplication(B,A) = zero. [resolve(25,c,22,a)].
% 0.81/1.13 Derived: -test(A) | c(A) != B | multiplication(A,B) = zero. [resolve(25,c,23,a)].
% 0.81/1.13 Derived: -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 0.81/1.13 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.81/1.13 Derived: -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 0.81/1.13 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 0.81/1.13 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | -test(B) | c(B) = A. [resolve(27,a,26,c)].
% 0.81/1.13 28 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 0.81/1.13 29 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 0.81/1.13
% 0.81/1.13 ============================== end predicate elimination =============
% 0.81/1.13
% 0.81/1.13 Auto_denials: (non-Horn, no changes).
% 0.81/1.13
% 0.81/1.13 Term ordering decisions:
% 0.81/1.13 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. multiplication=1. addition=1. c=1. f1=1.
% 0.81/1.13
% 0.81/1.13 ============================== end of process initial clauses ========
% 0.81/1.13
% 0.81/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.13
% 0.81/1.13 ============================== end of clauses for search =============
% 0.81/1.13
% 0.81/1.13 ============================== SEARCH ================================
% 0.81/1.13
% 0.81/1.13 % Starting search at 0.02 seconds.
% 0.81/1.13
% 0.81/1.13 ============================== PROOF =================================
% 0.81/1.13 % SZS status Theorem
% 0.81/1.13 % SZS output start Refutation
% 0.81/1.13
% 0.81/1.13 % Proof 1 at 0.12 (+ 0.00) seconds.
% 0.81/1.13 % Length of proof is 69.
% 0.81/1.13 % Level of proof is 13.
% 0.81/1.13 % Maximum clause weight is 19.000.
% 0.81/1.13 % Given clauses 158.
% 0.81/1.13
% 0.81/1.13 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 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.81/1.13 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 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.81/1.13 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.81/1.13 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 14 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 17 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 18 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.13 19 -(all X0 all X1 (test(X1) & test(X0) -> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.13 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.81/1.13 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.81/1.13 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.81/1.13 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.81/1.13 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 0.81/1.13 30 test(c2) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.81/1.13 31 test(c1) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.81/1.13 32 addition(A,zero) = A # label(additive_identity) # label(axiom). [clausify(3)].
% 0.81/1.13 33 addition(A,A) = A # label(additive_idempotence) # label(axiom). [clausify(4)].
% 0.81/1.13 34 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 0.81/1.13 35 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 0.81/1.13 36 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom). [clausify(10)].
% 0.81/1.13 39 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 0.81/1.13 40 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom). [clausify(2)].
% 0.81/1.13 41 addition(A,addition(B,C)) = addition(C,addition(A,B)). [copy(40),rewrite([39(2)]),flip(a)].
% 0.81/1.13 43 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom). [clausify(8)].
% 0.81/1.13 44 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)). [copy(43),flip(a)].
% 0.81/1.13 45 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 0.81/1.13 46 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(45),flip(a)].
% 0.81/1.13 47 addition(addition(addition(multiplication(c1,c2),multiplication(c1,c(c2))),multiplication(c(c1),c2)),multiplication(c(c1),c(c2))) != one # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.81/1.13 48 addition(multiplication(c(c1),c2),addition(multiplication(c(c1),c(c2)),multiplication(c1,addition(c2,c(c2))))) != one. [copy(47),rewrite([44(8),39(11),39(17),41(17,R),39(16)])].
% 0.81/1.13 49 -test(A) | -test(B) | c(addition(A,B)) = multiplication(c(A),c(B)) # label(test_deMorgan1) # label(axiom). [clausify(17)].
% 0.81/1.13 50 -test(A) | -test(B) | multiplication(c(A),c(B)) = c(addition(A,B)). [copy(49),flip(c)].
% 0.81/1.13 51 -test(A) | -test(B) | c(multiplication(A,B)) = addition(c(A),c(B)) # label(test_deMorgan2) # label(axiom). [clausify(18)].
% 0.81/1.13 52 -test(A) | -test(B) | addition(c(A),c(B)) = c(multiplication(A,B)). [copy(51),flip(c)].
% 0.81/1.13 54 multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 0.81/1.13 55 addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 0.81/1.13 59 -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 0.81/1.13 60 -test(A) | c(A) != B | addition(A,B) = one. [copy(59),rewrite([39(4)])].
% 0.81/1.13 61 -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 0.81/1.13 62 multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 0.81/1.13 64 -test(A) | multiplication(c(A),c(A)) = c(A). [factor(50,a,b),rewrite([33(5)])].
% 0.81/1.13 74 multiplication(addition(c1,c(c1)),addition(c2,c(c2))) != one. [para(41(a,1),48(a,1)),rewrite([44(16),46(14)])].
% 0.81/1.13 106 c(c1) != A | addition(A,c1) = one. [resolve(60,a,31,a),rewrite([39(5)])].
% 0.81/1.13 107 c(c2) != A | addition(A,c2) = one. [resolve(60,a,30,a),rewrite([39(5)])].
% 0.81/1.13 111 test(one). [resolve(62,c,32,a),rewrite([36(3),34(6)]),xx(a),xx(b)].
% 0.81/1.13 124 multiplication(c(c1),c(c1)) = c(c1). [resolve(64,a,31,a)].
% 0.81/1.13 125 multiplication(c(c2),c(c2)) = c(c2). [resolve(64,a,30,a)].
% 0.81/1.13 136 addition(one,f1(one)) = one. [resolve(111,a,55,b)].
% 0.81/1.13 137 f1(one) = zero. [resolve(111,a,54,b),rewrite([34(4)])].
% 0.81/1.13 141 addition(zero,one) = one. [back_rewrite(136),rewrite([137(3),39(3)])].
% 0.81/1.13 142 -test(zero) | c(zero) = one. [para(137(a,1),61(a,1)),rewrite([137(4)]),unit_del(c,111)].
% 0.81/1.13 143 test(zero). [resolve(141,a,62,c),rewrite([34(3),36(6)]),xx(a),xx(b)].
% 0.81/1.13 144 c(zero) = one. [back_unit_del(142),unit_del(a,143)].
% 0.81/1.13 147 -test(A) | addition(one,c(A)) = one. [resolve(143,a,52,b),rewrite([144(4),39(4),36(6),144(6)])].
% 0.81/1.13 488 addition(one,c(c1)) = one. [resolve(147,a,31,a)].
% 0.81/1.13 489 addition(one,c(c2)) = one. [resolve(147,a,30,a)].
% 0.81/1.13 491 addition(A,multiplication(c(c1),A)) = A. [para(488(a,1),46(a,2,1)),rewrite([35(2),35(6)])].
% 0.81/1.13 501 addition(A,multiplication(c(c2),A)) = A. [para(489(a,1),46(a,2,1)),rewrite([35(2),35(6)])].
% 0.81/1.13 914 addition(c1,c(c1)) = one. [resolve(106,a,491,a(flip)),rewrite([124(7),33(5),39(4)])].
% 0.81/1.13 919 addition(c2,c(c2)) != one. [back_rewrite(74),rewrite([914(4),35(6)])].
% 0.81/1.13 920 $F. [resolve(107,a,501,a(flip)),rewrite([125(7),33(5),39(4)]),unit_del(a,919)].
% 0.81/1.13
% 0.81/1.13 % SZS output end Refutation
% 0.81/1.13 ============================== end of proof ==========================
% 0.81/1.13
% 0.81/1.13 ============================== STATISTICS ============================
% 0.81/1.13
% 0.81/1.13 Given=158. Generated=2646. Kept=883. proofs=1.
% 0.81/1.13 Usable=146. Sos=597. Demods=367. Limbo=0, Disabled=177. Hints=0.
% 0.81/1.13 Megabytes=0.88.
% 0.81/1.13 User_CPU=0.12, System_CPU=0.00, Wall_clock=0.
% 0.81/1.13
% 0.81/1.13 ============================== end of statistics =====================
% 0.81/1.13
% 0.81/1.13 ============================== end of search =========================
% 0.81/1.13
% 0.81/1.13 THEOREM PROVED
% 0.81/1.13 % SZS status Theorem
% 0.81/1.13
% 0.81/1.13 Exiting with 1 proof.
% 0.81/1.13
% 0.81/1.13 Process 29357 exit (max_proofs) Thu Jun 16 15:30:05 2022
% 0.81/1.13 Prover9 interrupted
%------------------------------------------------------------------------------