TSTP Solution File: KLE041+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE041+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:56 EDT 2022
% Result : Theorem 2.25s 2.59s
% Output : Refutation 2.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE041+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 14:28:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.07 ============================== Prover9 ===============================
% 0.43/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.07 Process 14428 was started by sandbox2 on n027.cluster.edu,
% 0.43/1.07 Thu Jun 16 14:28:06 2022
% 0.43/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14274_n027.cluster.edu".
% 0.43/1.07 ============================== end of head ===========================
% 0.43/1.07
% 0.43/1.07 ============================== INPUT =================================
% 0.43/1.07
% 0.43/1.07 % Reading from file /tmp/Prover9_14274_n027.cluster.edu
% 0.43/1.07
% 0.43/1.07 set(prolog_style_variables).
% 0.43/1.07 set(auto2).
% 0.43/1.07 % set(auto2) -> set(auto).
% 0.43/1.07 % set(auto) -> set(auto_inference).
% 0.43/1.07 % set(auto) -> set(auto_setup).
% 0.43/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.07 % set(auto) -> set(auto_limits).
% 0.43/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.07 % set(auto) -> set(auto_denials).
% 0.43/1.07 % set(auto) -> set(auto_process).
% 0.43/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.07 % set(auto2) -> assign(stats, some).
% 0.43/1.07 % set(auto2) -> clear(echo_input).
% 0.43/1.07 % set(auto2) -> set(quiet).
% 0.43/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.07 % set(auto2) -> clear(print_given).
% 0.43/1.07 assign(lrs_ticks,-1).
% 0.43/1.07 assign(sos_limit,10000).
% 0.43/1.07 assign(order,kbo).
% 0.43/1.07 set(lex_order_vars).
% 0.43/1.07 clear(print_given).
% 0.43/1.07
% 0.43/1.07 % formulas(sos). % not echoed (17 formulas)
% 0.43/1.07
% 0.43/1.07 ============================== end of input ==========================
% 0.43/1.07
% 0.43/1.07 % From the command line: assign(max_seconds, 300).
% 0.43/1.07
% 0.43/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.07
% 0.43/1.07 % Formulas that are not ordinary clauses:
% 0.43/1.07 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 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.43/1.07 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 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.43/1.07 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 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.43/1.07 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.43/1.07 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 13 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.07 15 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 16 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 17 -(all X0 all X1 (leq(X0,X1) -> leq(star(X0),star(X1)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.25/2.59
% 2.25/2.59 ============================== end of process non-clausal formulas ===
% 2.25/2.59
% 2.25/2.59 ============================== PROCESS INITIAL CLAUSES ===============
% 2.25/2.59
% 2.25/2.59 ============================== PREDICATE ELIMINATION =================
% 2.25/2.59
% 2.25/2.59 ============================== end predicate elimination =============
% 2.25/2.59
% 2.25/2.59 Auto_denials:
% 2.25/2.59 % copying label goals to answer in negative clause
% 2.25/2.59
% 2.25/2.59 Term ordering decisions:
% 2.25/2.59
% 2.25/2.59 % Assigning unary symbol star kb_weight 0 and highest precedence (9).
% 2.25/2.59 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. multiplication=1. addition=1. star=0.
% 2.25/2.59
% 2.25/2.59 ============================== end of process initial clauses ========
% 2.25/2.59
% 2.25/2.59 ============================== CLAUSES FOR SEARCH ====================
% 2.25/2.59
% 2.25/2.59 ============================== end of clauses for search =============
% 2.25/2.59
% 2.25/2.59 ============================== SEARCH ================================
% 2.25/2.59
% 2.25/2.59 % Starting search at 0.01 seconds.
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=37.000, iters=3406
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=35.000, iters=3608
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=33.000, iters=3474
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=31.000, iters=3380
% 2.25/2.59
% 2.25/2.59 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 59 (0.00 of 0.82 sec).
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=30.000, iters=3401
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=29.000, iters=3379
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=28.000, iters=3394
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=27.000, iters=3347
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=26.000, iters=3356
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=25.000, iters=3358
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=23.000, iters=3351
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=22.000, iters=3358
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=21.000, iters=3353
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=5075, wt=48.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=5123, wt=47.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=5401, wt=46.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=5638, wt=45.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=5327, wt=44.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=6137, wt=43.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=3866, wt=42.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=6115, wt=41.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=6128, wt=40.000
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=11548, wt=19.000
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=20.000, iters=3369
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=19.000, iters=3333
% 2.25/2.59
% 2.25/2.59 Low Water (displace): id=12142, wt=17.000
% 2.25/2.59
% 2.25/2.59 Low Water (keep): wt=17.000, iters=3795
% 2.25/2.59
% 2.25/2.59 ============================== PROOF =================================
% 2.25/2.59 % SZS status Theorem
% 2.25/2.59 % SZS output start Refutation
% 2.25/2.59
% 2.25/2.59 % Proof 1 at 1.50 (+ 0.03) seconds: goals.
% 2.25/2.59 % Length of proof is 69.
% 2.25/2.59 % Level of proof is 11.
% 2.25/2.59 % Maximum clause weight is 17.000.
% 2.25/2.59 % Given clauses 1063.
% 2.25/2.59
% 2.25/2.59 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 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].
% 2.25/2.59 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 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].
% 2.25/2.59 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 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].
% 2.25/2.59 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].
% 2.25/2.59 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 13 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 15 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 16 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause). [assumption].
% 2.25/2.59 17 -(all X0 all X1 (leq(X0,X1) -> leq(star(X0),star(X1)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.25/2.59 18 leq(c1,c2) # label(goals) # label(negated_conjecture). [clausify(17)].
% 2.25/2.59 20 addition(A,A) = A # label(additive_idempotence) # label(axiom). [clausify(4)].
% 2.25/2.59 21 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 2.25/2.59 22 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 2.25/2.59 25 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 2.25/2.59 26 leq(addition(one,multiplication(A,star(A))),star(A)) # label(star_unfold_right) # label(axiom). [clausify(13)].
% 2.25/2.59 27 leq(addition(one,multiplication(star(A),A)),star(A)) # label(star_unfold_left) # label(axiom). [clausify(14)].
% 2.25/2.59 28 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom). [clausify(2)].
% 2.25/2.59 29 addition(A,addition(B,C)) = addition(C,addition(A,B)). [copy(28),rewrite([25(2)]),flip(a)].
% 2.25/2.59 30 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom). [clausify(5)].
% 2.25/2.59 31 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom). [clausify(8)].
% 2.25/2.59 32 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)). [copy(31),flip(a)].
% 2.25/2.59 33 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 2.25/2.59 34 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(33),flip(a)].
% 2.25/2.59 35 -leq(star(c1),star(c2)) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(17)].
% 2.25/2.59 36 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 2.25/2.59 37 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 2.25/2.59 38 -leq(addition(multiplication(A,B),C),B) | leq(multiplication(star(A),C),B) # label(star_induction_left) # label(axiom). [clausify(15)].
% 2.25/2.59 39 -leq(addition(A,multiplication(B,C)),C) | leq(multiplication(star(B),A),C). [copy(38),rewrite([25(2)])].
% 2.25/2.59 40 -leq(addition(multiplication(A,B),C),A) | leq(multiplication(C,star(B)),A) # label(star_induction_right) # label(axiom). [clausify(16)].
% 2.25/2.59 41 -leq(addition(A,multiplication(B,C)),B) | leq(multiplication(A,star(C)),B). [copy(40),rewrite([25(2)])].
% 2.25/2.59 42 leq(addition(one,star(one)),star(one)). [para(22(a,1),26(a,1,2))].
% 2.25/2.59 44 addition(A,addition(A,B)) = addition(A,B). [para(29(a,1),20(a,1)),rewrite([25(1),25(2),29(2,R),20(1),25(3)])].
% 2.25/2.59 47 multiplication(A,addition(B,one)) = addition(A,multiplication(A,B)). [para(21(a,1),32(a,1,1)),rewrite([25(4)]),flip(a)].
% 2.25/2.59 48 multiplication(addition(A,one),B) = addition(B,multiplication(A,B)). [para(22(a,1),34(a,1,1)),rewrite([25(4)]),flip(a)].
% 2.25/2.59 51 addition(star(A),addition(one,multiplication(star(A),A))) = star(A). [hyper(36,a,27,a),rewrite([25(6)])].
% 2.25/2.59 52 addition(star(A),addition(one,multiplication(A,star(A)))) = star(A). [hyper(36,a,26,a),rewrite([25(6)])].
% 2.25/2.59 53 addition(c1,c2) = c2. [hyper(36,a,18,a)].
% 2.25/2.59 54 leq(A,A). [hyper(37,b,20,a)].
% 2.25/2.59 60 -leq(addition(A,B),one) | leq(multiplication(star(B),A),one). [para(21(a,1),39(a,1,2))].
% 2.25/2.59 64 -leq(addition(A,multiplication(B,multiplication(C,D))),D) | leq(multiplication(star(multiplication(B,C)),A),D). [para(30(a,1),39(a,1,2))].
% 2.25/2.59 68 -leq(addition(A,B),B) | leq(multiplication(A,star(one)),B). [para(21(a,1),41(a,1,2))].
% 2.25/2.59 75 addition(one,star(one)) = star(one). [hyper(36,a,42,a),rewrite([25(7),29(7,R),20(6)])].
% 2.25/2.59 77 leq(A,addition(A,B)). [hyper(37,b,44,a)].
% 2.25/2.59 79 leq(multiplication(A,B),multiplication(addition(A,C),B)). [para(34(a,1),77(a,2))].
% 2.25/2.59 137 multiplication(addition(A,addition(B,one)),C) = addition(C,multiplication(addition(A,B),C)). [para(48(a,1),34(a,1,2)),rewrite([29(4,R),34(3),25(1)]),flip(a)].
% 2.25/2.59 191 addition(one,addition(star(A),multiplication(star(A),A))) = star(A). [para(51(a,1),29(a,1)),rewrite([29(7),25(6)]),flip(a)].
% 2.25/2.59 202 addition(one,addition(star(A),multiplication(A,star(A)))) = star(A). [para(52(a,1),29(a,1)),rewrite([29(7),25(6)]),flip(a)].
% 2.25/2.59 211 -leq(A,one) | leq(multiplication(star(A),A),one). [para(20(a,1),60(a,1))].
% 2.25/2.59 226 leq(star(one),one). [hyper(211,a,54,a),rewrite([21(4)])].
% 2.25/2.59 241 star(one) = one. [hyper(36,a,226,a),rewrite([25(4),75(4)])].
% 2.25/2.59 244 -leq(addition(A,B),B) | leq(A,B). [back_rewrite(68),rewrite([241(4),21(4)])].
% 2.25/2.59 246 -leq(addition(A,B),A) | leq(B,A). [para(25(a,1),244(a,1))].
% 2.25/2.59 256 -leq(addition(A,addition(B,C)),C) | leq(addition(A,B),C). [para(29(a,2),246(a,1))].
% 2.25/2.59 323 -leq(multiplication(A,addition(one,multiplication(B,C))),C) | leq(multiplication(star(multiplication(A,B)),A),C). [para(47(a,2),64(a,1)),rewrite([25(3)])].
% 2.25/2.59 396 addition(one,star(A)) = star(A). [para(191(a,1),44(a,1,2)),rewrite([191(9)])].
% 2.25/2.59 515 addition(star(A),multiplication(A,star(A))) = star(A). [para(202(a,1),29(a,1)),rewrite([396(6),25(5)]),flip(a)].
% 2.25/2.59 2370 leq(multiplication(A,B),addition(B,multiplication(addition(A,C),B))). [para(137(a,1),79(a,2))].
% 2.25/2.59 8107 leq(multiplication(c1,A),addition(A,multiplication(c2,A))). [para(53(a,1),2370(a,2,2,1))].
% 2.25/2.59 8152 leq(multiplication(c1,star(c2)),star(c2)). [para(515(a,1),8107(a,2))].
% 2.25/2.59 8161 multiplication(addition(one,c1),star(c2)) = star(c2). [hyper(36,a,8152,a),rewrite([25(7),48(7,R),25(3)])].
% 2.25/2.59 11769 -leq(addition(one,multiplication(A,B)),B) | leq(star(A),B). [para(22(a,1),323(a,1)),rewrite([22(6),21(7)])].
% 2.25/2.59 12369 -leq(addition(one,multiplication(c1,star(c2))),star(c2)) # answer(goals). [ur(11769,b,35,a)].
% 2.25/2.59 12385 -leq(star(c2),star(c2)) # answer(goals). [ur(256,b,12369,a),rewrite([25(8),48(8,R),25(4),8161(7),396(4)])].
% 2.25/2.59 12386 $F # answer(goals). [resolve(12385,a,54,a)].
% 2.25/2.59
% 2.25/2.59 % SZS output end Refutation
% 2.25/2.59 ============================== end of proof ==========================
% 2.25/2.59
% 2.25/2.59 ============================== STATISTICS ============================
% 2.25/2.59
% 2.25/2.59 Given=1063. Generated=57588. Kept=12363. proofs=1.
% 2.25/2.59 Usable=1010. Sos=9998. Demods=945. Limbo=0, Disabled=1373. Hints=0.
% 2.25/2.59 Megabytes=11.41.
% 2.25/2.59 User_CPU=1.50, System_CPU=0.03, Wall_clock=2.
% 2.25/2.59
% 2.25/2.59 ============================== end of statistics =====================
% 2.25/2.59
% 2.25/2.59 ============================== end of search =========================
% 2.25/2.59
% 2.25/2.59 THEOREM PROVED
% 2.25/2.59 % SZS status Theorem
% 2.25/2.59
% 2.25/2.59 Exiting with 1 proof.
% 2.25/2.59
% 2.25/2.59 Process 14428 exit (max_proofs) Thu Jun 16 14:28:08 2022
% 2.25/2.59 Prover9 interrupted
%------------------------------------------------------------------------------