TSTP Solution File: REL005+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL005+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 : Mon Jul 18 19:53:26 EDT 2022
% Result : Theorem 2.15s 2.43s
% Output : Refutation 2.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL005+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.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 : Fri Jul 8 13:10:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.98 ============================== Prover9 ===============================
% 0.45/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.98 Process 550 was started by sandbox on n018.cluster.edu,
% 0.45/0.98 Fri Jul 8 13:10:41 2022
% 0.45/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_381_n018.cluster.edu".
% 0.45/0.98 ============================== end of head ===========================
% 0.45/0.98
% 0.45/0.98 ============================== INPUT =================================
% 0.45/0.98
% 0.45/0.98 % Reading from file /tmp/Prover9_381_n018.cluster.edu
% 0.45/0.98
% 0.45/0.98 set(prolog_style_variables).
% 0.45/0.98 set(auto2).
% 0.45/0.98 % set(auto2) -> set(auto).
% 0.45/0.98 % set(auto) -> set(auto_inference).
% 0.45/0.98 % set(auto) -> set(auto_setup).
% 0.45/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.98 % set(auto) -> set(auto_limits).
% 0.45/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.98 % set(auto) -> set(auto_denials).
% 0.45/0.98 % set(auto) -> set(auto_process).
% 0.45/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.98 % set(auto2) -> assign(stats, some).
% 0.45/0.98 % set(auto2) -> clear(echo_input).
% 0.45/0.98 % set(auto2) -> set(quiet).
% 0.45/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.98 % set(auto2) -> clear(print_given).
% 0.45/0.98 assign(lrs_ticks,-1).
% 0.45/0.98 assign(sos_limit,10000).
% 0.45/0.98 assign(order,kbo).
% 0.45/0.98 set(lex_order_vars).
% 0.45/0.98 clear(print_given).
% 0.45/0.98
% 0.45/0.98 % formulas(sos). % not echoed (14 formulas)
% 0.45/0.98
% 0.45/0.98 ============================== end of input ==========================
% 0.45/0.98
% 0.45/0.98 % From the command line: assign(max_seconds, 300).
% 0.45/0.98
% 0.45/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.98
% 0.45/0.98 % Formulas that are not ordinary clauses:
% 0.45/0.98 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 2 (all X0 all X1 all X2 join(X0,join(X1,X2)) = join(join(X0,X1),X2)) # label(maddux2_join_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 3 (all X0 all X1 X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))) # label(maddux3_a_kind_of_de_Morgan) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 4 (all X0 all X1 meet(X0,X1) = complement(join(complement(X0),complement(X1)))) # label(maddux4_definiton_of_meet) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 5 (all X0 all X1 all X2 composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2)) # label(composition_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 7 (all X0 all X1 all X2 composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2))) # label(composition_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 11 (all X0 all X1 join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1)) # label(converse_cancellativity) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.98 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 14 -(all X0 all X1 converse(meet(X0,X1)) = meet(converse(X0),converse(X1))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.15/2.43
% 2.15/2.43 ============================== end of process non-clausal formulas ===
% 2.15/2.43
% 2.15/2.43 ============================== PROCESS INITIAL CLAUSES ===============
% 2.15/2.43
% 2.15/2.43 ============================== PREDICATE ELIMINATION =================
% 2.15/2.43
% 2.15/2.43 ============================== end predicate elimination =============
% 2.15/2.43
% 2.15/2.43 Auto_denials:
% 2.15/2.43 % copying label goals to answer in negative clause
% 2.15/2.43
% 2.15/2.43 Term ordering decisions:
% 2.15/2.43 Function symbol KB weights: one=1. top=1. zero=1. c1=1. c2=1. join=1. composition=1. meet=1. complement=1. converse=1.
% 2.15/2.43
% 2.15/2.43 ============================== end of process initial clauses ========
% 2.15/2.43
% 2.15/2.43 ============================== CLAUSES FOR SEARCH ====================
% 2.15/2.43
% 2.15/2.43 ============================== end of clauses for search =============
% 2.15/2.43
% 2.15/2.43 ============================== SEARCH ================================
% 2.15/2.43
% 2.15/2.43 % Starting search at 0.01 seconds.
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=38.000, iters=3354
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=35.000, iters=3378
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=32.000, iters=3358
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=31.000, iters=3407
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=30.000, iters=3370
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=29.000, iters=3336
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=28.000, iters=3339
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=27.000, iters=3406
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=26.000, iters=3336
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=25.000, iters=3366
% 2.15/2.43
% 2.15/2.43 Low Water (keep): wt=24.000, iters=3335
% 2.15/2.43
% 2.15/2.43 ============================== PROOF =================================
% 2.15/2.43 % SZS status Theorem
% 2.15/2.43 % SZS output start Refutation
% 2.15/2.43
% 2.15/2.43 % Proof 1 at 1.42 (+ 0.04) seconds: goals.
% 2.15/2.43 % Length of proof is 82.
% 2.15/2.43 % Level of proof is 27.
% 2.15/2.43 % Maximum clause weight is 16.000.
% 2.15/2.43 % Given clauses 519.
% 2.15/2.43
% 2.15/2.43 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 2 (all X0 all X1 all X2 join(X0,join(X1,X2)) = join(join(X0,X1),X2)) # label(maddux2_join_associativity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 3 (all X0 all X1 X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))) # label(maddux3_a_kind_of_de_Morgan) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 4 (all X0 all X1 meet(X0,X1) = complement(join(complement(X0),complement(X1)))) # label(maddux4_definiton_of_meet) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 5 (all X0 all X1 all X2 composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2)) # label(composition_associativity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 11 (all X0 all X1 join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1)) # label(converse_cancellativity) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 2.15/2.43 14 -(all X0 all X1 converse(meet(X0,X1)) = meet(converse(X0),converse(X1))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.15/2.43 15 composition(A,one) = A # label(composition_identity) # label(axiom). [clausify(6)].
% 2.15/2.43 16 converse(converse(A)) = A # label(converse_idempotence) # label(axiom). [clausify(8)].
% 2.15/2.43 17 join(A,complement(A)) = top # label(def_top) # label(axiom). [clausify(12)].
% 2.15/2.43 18 meet(A,complement(A)) = zero # label(def_zero) # label(axiom). [clausify(13)].
% 2.15/2.43 19 join(A,B) = join(B,A) # label(maddux1_join_commutativity) # label(axiom). [clausify(1)].
% 2.15/2.43 20 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet) # label(axiom). [clausify(4)].
% 2.15/2.43 21 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity) # label(axiom). [clausify(9)].
% 2.15/2.43 22 join(converse(A),converse(B)) = converse(join(A,B)). [copy(21),flip(a)].
% 2.15/2.43 23 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity) # label(axiom). [clausify(10)].
% 2.15/2.43 24 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(23),flip(a)].
% 2.15/2.43 25 join(join(A,B),C) = join(A,join(B,C)) # label(maddux2_join_associativity) # label(axiom). [clausify(2)].
% 2.15/2.43 26 join(A,join(B,C)) = join(C,join(A,B)). [copy(25),rewrite([19(2)]),flip(a)].
% 2.15/2.43 27 composition(composition(A,B),C) = composition(A,composition(B,C)) # label(composition_associativity) # label(axiom). [clausify(5)].
% 2.15/2.43 30 complement(A) = join(composition(converse(B),complement(composition(B,A))),complement(A)) # label(converse_cancellativity) # label(axiom). [clausify(11)].
% 2.15/2.43 31 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(30),rewrite([19(7)]),flip(a)].
% 2.15/2.43 32 join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A # label(maddux3_a_kind_of_de_Morgan) # label(axiom). [clausify(3)].
% 2.15/2.43 33 join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))) = B. [copy(32),rewrite([19(6),19(8)]),rewrite([19(6)])].
% 2.15/2.43 34 converse(meet(c1,c2)) != meet(converse(c1),converse(c2)) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(14)].
% 2.15/2.43 35 complement(join(complement(converse(c1)),complement(converse(c2)))) != converse(complement(join(complement(c1),complement(c2)))) # answer(goals). [copy(34),rewrite([20(3),20(12)]),flip(a)].
% 2.15/2.43 36 complement(top) = zero. [back_rewrite(18),rewrite([20(2),17(4)])].
% 2.15/2.43 39 converse(composition(converse(A),B)) = composition(converse(B),A). [para(16(a,1),24(a,1,2)),flip(a)].
% 2.15/2.43 40 join(A,join(B,complement(A))) = join(B,top). [para(17(a,1),26(a,2,2)),rewrite([19(2)])].
% 2.15/2.43 41 composition(A,composition(one,B)) = composition(A,B). [para(15(a,1),27(a,1,1)),flip(a)].
% 2.15/2.43 47 join(complement(one),composition(converse(A),complement(A))) = complement(one). [para(15(a,1),31(a,1,2,2,1))].
% 2.15/2.43 52 join(zero,complement(join(complement(A),complement(A)))) = A. [para(17(a,1),33(a,1,1,1)),rewrite([36(2)])].
% 2.15/2.43 60 join(complement(join(top,complement(A))),complement(join(zero,complement(A)))) = A. [para(36(a,1),33(a,1,2,1,1))].
% 2.15/2.43 73 composition(converse(one),A) = A. [para(15(a,1),39(a,1,1)),rewrite([16(2)]),flip(a)].
% 2.15/2.43 79 converse(one) = one. [para(73(a,1),15(a,1)),flip(a)].
% 2.15/2.43 83 join(complement(A),complement(composition(one,A))) = complement(A). [para(73(a,1),31(a,1,2))].
% 2.15/2.43 84 composition(one,A) = A. [para(73(a,1),41(a,2)),rewrite([79(2),41(4)])].
% 2.15/2.43 85 join(complement(A),complement(A)) = complement(A). [back_rewrite(83),rewrite([84(3)])].
% 2.15/2.43 86 join(zero,complement(complement(A))) = A. [back_rewrite(52),rewrite([85(4)])].
% 2.15/2.43 87 converse(join(A,one)) = join(one,converse(A)). [para(79(a,1),22(a,1,1)),rewrite([19(5)]),flip(a)].
% 2.15/2.43 91 join(top,complement(A)) = top. [para(85(a,1),40(a,1,2)),rewrite([17(2),19(4)]),flip(a)].
% 2.15/2.43 92 join(zero,complement(join(zero,complement(A)))) = A. [back_rewrite(60),rewrite([91(3),36(2)])].
% 2.15/2.43 93 join(top,top) = join(A,top). [para(91(a,1),40(a,1,2)),flip(a)].
% 2.15/2.43 98 join(A,top) = join(B,top). [para(93(a,1),40(a,2)),rewrite([91(3)])].
% 2.15/2.43 99 join(A,top) = c_0. [new_symbol(98)].
% 2.15/2.43 102 join(A,join(B,complement(A))) = c_0. [back_rewrite(40),rewrite([99(5)])].
% 2.15/2.43 113 c_0 = top. [para(86(a,1),102(a,1,2)),rewrite([19(2),17(2)]),flip(a)].
% 2.15/2.43 114 join(A,join(B,complement(A))) = top. [back_rewrite(102),rewrite([113(4)])].
% 2.15/2.43 141 join(zero,complement(A)) = complement(A). [para(86(a,1),92(a,1,2,1))].
% 2.15/2.43 142 complement(complement(A)) = A. [back_rewrite(92),rewrite([141(4),141(4)])].
% 2.15/2.43 143 join(A,zero) = A. [back_rewrite(86),rewrite([142(3),19(2)])].
% 2.15/2.43 148 join(complement(join(A,B)),complement(join(B,complement(A)))) = complement(B). [para(142(a,1),33(a,1,1,1,2)),rewrite([142(5),19(4)])].
% 2.15/2.43 150 join(A,A) = A. [para(142(a,1),85(a,1,1)),rewrite([142(2),142(3)])].
% 2.15/2.43 154 join(A,join(A,B)) = join(A,B). [para(150(a,1),26(a,1)),rewrite([19(3),26(4,R),19(3),26(3,R),150(2)]),flip(a)].
% 2.15/2.43 155 join(A,complement(join(B,complement(A)))) = A. [para(33(a,1),154(a,1,2)),rewrite([19(4),33(12)])].
% 2.15/2.43 157 join(A,join(B,complement(join(C,complement(A))))) = join(A,B). [para(155(a,1),26(a,2,2)),rewrite([19(4),19(6)])].
% 2.15/2.43 160 join(complement(A),complement(join(A,B))) = complement(A). [para(142(a,1),155(a,1,2,1,2)),rewrite([19(2)])].
% 2.15/2.43 168 join(complement(one),composition(converse(complement(A)),A)) = complement(one). [para(142(a,1),47(a,1,2,2))].
% 2.15/2.43 171 join(complement(converse(A)),complement(converse(join(A,B)))) = complement(converse(A)). [para(22(a,1),160(a,1,2,1))].
% 2.15/2.43 222 join(complement(one),converse(complement(one))) = complement(one). [para(15(a,1),168(a,1,2))].
% 2.15/2.43 226 converse(complement(one)) = complement(one). [para(222(a,1),22(a,2,1)),rewrite([16(7),19(6),222(6)]),flip(a)].
% 2.15/2.43 231 converse(top) = top. [para(226(a,1),87(a,2,2)),rewrite([19(4),17(4),17(6)])].
% 2.15/2.43 2512 join(A,complement(join(A,B))) = join(A,complement(B)). [para(148(a,1),157(a,1,2)),flip(a)].
% 2.15/2.43 2940 join(complement(converse(A)),converse(join(A,B))) = top. [para(171(a,1),114(a,1,2)),rewrite([19(5)])].
% 2.15/2.43 2966 join(A,join(B,converse(complement(converse(A))))) = top. [para(2940(a,1),22(a,2,1)),rewrite([16(6),26(5),19(4),26(5,R),19(4),231(7)])].
% 2.15/2.43 2997 join(A,converse(complement(converse(A)))) = top. [para(150(a,1),2966(a,1,2))].
% 2.15/2.43 3034 join(A,complement(converse(complement(converse(A))))) = A. [para(2997(a,1),2512(a,1,2,1)),rewrite([36(2),143(2)]),flip(a)].
% 2.15/2.43 3035 join(converse(A),complement(converse(complement(A)))) = converse(A). [para(16(a,1),3034(a,1,2,1,1,1))].
% 2.15/2.43 3038 join(A,converse(complement(converse(complement(A))))) = converse(complement(converse(complement(A)))). [para(3034(a,1),33(a,1,2,1)),rewrite([142(9),19(8),2512(8),142(6)])].
% 2.15/2.43 3157 converse(complement(converse(complement(A)))) = A. [para(3035(a,1),22(a,2,1)),rewrite([16(2),3038(5),16(6)])].
% 2.15/2.43 3180 complement(converse(complement(A))) = converse(A). [para(3157(a,1),16(a,1,1)),flip(a)].
% 2.15/2.43 3249 converse(complement(A)) = complement(converse(A)). [para(3180(a,1),142(a,1,1)),flip(a)].
% 2.15/2.43 3435 complement(join(complement(converse(c1)),complement(converse(c2)))) != complement(converse(join(complement(c1),complement(c2)))) # answer(goals). [back_rewrite(35),rewrite([3249(15)])].
% 2.15/2.43 3436 join(complement(converse(A)),converse(B)) = converse(join(B,complement(A))). [para(3249(a,1),22(a,1,1)),rewrite([19(6)])].
% 2.15/2.43 9559 join(complement(converse(A)),complement(converse(B))) = converse(join(complement(A),complement(B))). [para(3249(a,1),3436(a,1,2)),rewrite([19(8)])].
% 2.15/2.43 9600 $F # answer(goals). [back_rewrite(3435),rewrite([9559(7)]),xx(a)].
% 2.15/2.43
% 2.15/2.43 % SZS output end Refutation
% 2.15/2.43 ============================== end of proof ==========================
% 2.15/2.43
% 2.15/2.43 ============================== STATISTICS ============================
% 2.15/2.43
% 2.15/2.43 Given=519. Generated=71041. Kept=9578. proofs=1.
% 2.15/2.43 Usable=414. Sos=7357. Demods=7370. Limbo=41, Disabled=1780. Hints=0.
% 2.15/2.43 Megabytes=11.85.
% 2.15/2.43 User_CPU=1.42, System_CPU=0.04, Wall_clock=1.
% 2.15/2.43
% 2.15/2.43 ============================== end of statistics =====================
% 2.15/2.43
% 2.15/2.43 ============================== end of search =========================
% 2.15/2.43
% 2.15/2.43 THEOREM PROVED
% 2.15/2.43 % SZS status Theorem
% 2.15/2.43
% 2.15/2.43 Exiting with 1 proof.
% 2.15/2.43
% 2.15/2.43 Process 550 exit (max_proofs) Fri Jul 8 13:10:42 2022
% 2.15/2.43 Prover9 interrupted
%------------------------------------------------------------------------------