TSTP Solution File: MGT060+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 22:23:10 EDT 2022
% Result : Theorem 152.88s 153.20s
% Output : Refutation 152.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 9 08:07:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.80/1.11 ============================== Prover9 ===============================
% 0.80/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.11 Process 16162 was started by sandbox on n028.cluster.edu,
% 0.80/1.11 Thu Jun 9 08:07:33 2022
% 0.80/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15983_n028.cluster.edu".
% 0.80/1.11 ============================== end of head ===========================
% 0.80/1.11
% 0.80/1.11 ============================== INPUT =================================
% 0.80/1.11
% 0.80/1.11 % Reading from file /tmp/Prover9_15983_n028.cluster.edu
% 0.80/1.11
% 0.80/1.11 set(prolog_style_variables).
% 0.80/1.11 set(auto2).
% 0.80/1.11 % set(auto2) -> set(auto).
% 0.80/1.11 % set(auto) -> set(auto_inference).
% 0.80/1.11 % set(auto) -> set(auto_setup).
% 0.80/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.11 % set(auto) -> set(auto_limits).
% 0.80/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.11 % set(auto) -> set(auto_denials).
% 0.80/1.11 % set(auto) -> set(auto_process).
% 0.80/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.11 % set(auto2) -> assign(stats, some).
% 0.80/1.11 % set(auto2) -> clear(echo_input).
% 0.80/1.11 % set(auto2) -> set(quiet).
% 0.80/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.11 % set(auto2) -> clear(print_given).
% 0.80/1.11 assign(lrs_ticks,-1).
% 0.80/1.11 assign(sos_limit,10000).
% 0.80/1.11 assign(order,kbo).
% 0.80/1.11 set(lex_order_vars).
% 0.80/1.11 clear(print_given).
% 0.80/1.11
% 0.80/1.11 % formulas(sos). % not echoed (13 formulas)
% 0.80/1.11
% 0.80/1.11 ============================== end of input ==========================
% 0.80/1.11
% 0.80/1.11 % From the command line: assign(max_seconds, 300).
% 0.80/1.11
% 0.80/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.11
% 0.80/1.11 % Formulas that are not ordinary clauses:
% 0.80/1.11 1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 5 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 7 (all X all T (organization(X) -> (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 8 -(all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.11
% 0.80/1.11 ============================== end of process non-clausal formulas ===
% 0.80/1.11
% 0.80/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.11
% 0.80/1.11 ============================== PREDICATE ELIMINATION =================
% 0.80/1.11 9 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 10 organization(c1) # label(assumption_3) # label(negated_conjecture). [clausify(8)].
% 152.88/153.20 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(9,a,10,a)].
% 152.88/153.20 11 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(11,a,10,a)].
% 152.88/153.20 12 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(12,a,10,a)].
% 152.88/153.20 13 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(13,a,10,a)].
% 152.88/153.20 14 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(14,a,10,a)].
% 152.88/153.20 15 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 152.88/153.20 16 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 152.88/153.20 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(15,b,16,a)].
% 152.88/153.20 17 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 152.88/153.20 Derived: greater(A,B) | A = B | greater(B,A). [resolve(17,a,16,a)].
% 152.88/153.20 18 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 152.88/153.20 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(18,a,15,b)].
% 152.88/153.20 19 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 152.88/153.20 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(19,b,17,a)].
% 152.88/153.20 20 -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(19,b,17,a)].
% 152.88/153.20 21 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 152.88/153.20 22 smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(15,b,16,a)].
% 152.88/153.20 23 -greater(A,B) | smaller_or_equal(B,A). [resolve(18,a,15,b)].
% 152.88/153.20 Derived: A = B | greater(A,B) | A = B | greater(B,A). [resolve(20,a,22,a)].
% 152.88/153.20 24 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 152.88/153.20 25 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 152.88/153.20 26 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 152.88/153.20
% 152.88/153.20 ============================== end predicate elimination =============
% 152.88/153.20
% 152.88/153.20 Auto_denials: (non-Horn, no changes).
% 152.88/153.20
% 152.88/153.20 Term ordering decisions:
% 152.88/153.20 Function symbol KB weights: low=1. high=1. mod1=1. mod2=1. very_low=1. c1=1. c2=1. c3=1. hazard_of_mortality=1.
% 152.88/153.20
% 152.88/153.20 ============================== end of process initial clauses ========
% 152.88/153.20
% 152.88/153.20 ============================== CLAUSES FOR SEARCH ====================
% 152.88/153.20
% 152.88/153.20 ============================== end of clauses for search =============
% 152.88/153.20
% 152.88/153.20 ============================== SEARCH ================================
% 152.88/153.20
% 152.88/153.20 % Starting search at 0.01 seconds.
% 152.88/153.20
% 152.88/153.20 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 25 (0.00 of 4.69 sec).
% 152.88/153.20
% 152.88/153.20 Low Water (keep): wt=30.000, iters=3380
% 152.88/153.20
% 152.88/153.20 Low Water (keep): wt=29.000, iters=3351
% 152.88/153.20
% 152.88/153.20 Low Water (keep): wt=28.000, iters=3351
% 152.88/153.20
% 152.88/153.20 Low Water (keep): wt=27.000, iters=3501
% 152.88/153.20
% 152.88/153.20 Low Water (keep): wt=26.000, iters=3334
% 152.88/153.20
% 152.88/153.20 Low Water (keep): wt=24.000, iters=3335
% 152.88/153.20
% 152.88/153.20 ============================== PROOF =================================
% 152.88/153.20 % SZS status Theorem
% 152.88/153.20 % SZS output start Refutation
% 152.88/153.20
% 152.88/153.20 % Proof 1 at 146.50 (+ 5.56) seconds.
% 152.88/153.20 % Length of proof is 51.
% 152.88/153.20 % Level of proof is 12.
% 152.88/153.20 % Maximum clause weight is 26.000.
% 152.88/153.20 % Given clauses 3779.
% 152.88/153.20
% 152.88/153.20 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 152.88/153.20 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 152.88/153.20 5 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause). [assumption].
% 152.88/153.20 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 152.88/153.20 7 (all X all T (organization(X) -> (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption].
% 152.88/153.20 8 -(all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 152.88/153.20 9 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 10 organization(c1) # label(assumption_3) # label(negated_conjecture). [clausify(8)].
% 152.88/153.20 11 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 12 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 13 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 14 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom). [clausify(7)].
% 152.88/153.20 16 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 152.88/153.20 17 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 152.88/153.20 28 greater(mod1,low) # label(assumption_18b) # label(axiom). [assumption].
% 152.88/153.20 29 greater(low,very_low) # label(assumption_18c) # label(axiom). [assumption].
% 152.88/153.20 30 greater(high,mod2) # label(assumption_18d) # label(axiom). [assumption].
% 152.88/153.20 31 greater(mod2,low) # label(assumption_18e) # label(axiom). [assumption].
% 152.88/153.20 32 has_immunity(c1,c2) # label(assumption_3) # label(negated_conjecture). [clausify(8)].
% 152.88/153.20 33 -has_immunity(c1,c3) # label(assumption_3) # label(negated_conjecture). [clausify(8)].
% 152.88/153.20 34 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(4)].
% 152.88/153.20 35 -greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(assumption_3) # label(negated_conjecture). [clausify(8)].
% 152.88/153.20 36 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom). [clausify(5)].
% 152.88/153.20 37 -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(9,a,10,a)].
% 152.88/153.20 38 has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(11,a,10,a)].
% 152.88/153.20 39 has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(12,a,10,a)].
% 152.88/153.20 40 has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(13,a,10,a)].
% 152.88/153.20 41 has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(14,a,10,a)].
% 152.88/153.20 42 greater(A,B) | A = B | greater(B,A). [resolve(17,a,16,a)].
% 152.88/153.20 44 -greater(A,A). [factor(34,a,b)].
% 152.88/153.20 50 -greater(low,A) | greater(mod2,A). [resolve(36,a,31,a)].
% 152.88/153.20 51 -greater(mod2,A) | greater(high,A). [resolve(36,a,30,a)].
% 152.88/153.20 52 -greater(very_low,A) | greater(low,A). [resolve(36,a,29,a)].
% 152.88/153.20 53 -greater(low,A) | greater(mod1,A). [resolve(36,a,28,a)].
% 152.88/153.20 60 hazard_of_mortality(c1,c2) = very_low. [resolve(37,a,32,a)].
% 152.88/153.20 61 -greater(hazard_of_mortality(c1,c3),very_low). [back_rewrite(35),rewrite([60(6)])].
% 152.88/153.20 62 has_immunity(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high | hazard_of_mortality(c1,A) = mod1. [resolve(41,c,39,c),merge(d),merge(e)].
% 152.88/153.20 71 greater(mod2,very_low). [resolve(50,a,29,a)].
% 152.88/153.20 75 greater(high,very_low). [resolve(51,a,71,a)].
% 152.88/153.20 78 greater(low,A) | greater(A,very_low) | very_low = A. [resolve(52,a,42,c),flip(c)].
% 152.88/153.20 85 greater(mod1,very_low). [resolve(53,a,29,a)].
% 152.88/153.20 107 has_immunity(c1,A) | hazard_of_mortality(c1,A) = high | hazard_of_mortality(c1,A) = mod1 | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(62,b,40,b),merge(d)].
% 152.88/153.20 135 greater(low,hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) = very_low. [resolve(78,b,61,a),flip(b)].
% 152.88/153.20 397 has_immunity(c1,A) | hazard_of_mortality(c1,A) = high | hazard_of_mortality(c1,A) = mod1 | hazard_of_mortality(c1,A) = mod2 | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(107,d,38,c),merge(e)].
% 152.88/153.20 3098 has_immunity(c1,A) | hazard_of_mortality(c1,A) = high | hazard_of_mortality(c1,A) = mod1 | hazard_of_mortality(c1,A) = mod2 | hazard_of_mortality(c1,A) = low. [resolve(397,e,62,b),merge(f),merge(g),merge(h)].
% 152.88/153.20 13140 hazard_of_mortality(c1,c3) = high | hazard_of_mortality(c1,c3) = mod1 | hazard_of_mortality(c1,c3) = mod2 | hazard_of_mortality(c1,c3) = low. [resolve(3098,a,33,a)].
% 152.88/153.20 13141 hazard_of_mortality(c1,c3) = high | hazard_of_mortality(c1,c3) = mod1 | hazard_of_mortality(c1,c3) = low. [para(13140(c,1),61(a,1)),unit_del(d,71)].
% 152.88/153.20 13142 hazard_of_mortality(c1,c3) = high | hazard_of_mortality(c1,c3) = low. [para(13141(b,1),61(a,1)),unit_del(c,85)].
% 152.88/153.20 13143 hazard_of_mortality(c1,c3) = low. [para(13142(a,1),61(a,1)),unit_del(b,75)].
% 152.88/153.20 13406 very_low = low. [back_rewrite(135),rewrite([13143(4),13143(6)]),flip(b),unit_del(a,44)].
% 152.88/153.20 13671 $F. [back_rewrite(29),rewrite([13406(2)]),unit_del(a,44)].
% 152.88/153.20
% 152.88/153.20 % SZS output end Refutation
% 152.88/153.20 ============================== end of proof ==========================
% 152.88/153.20
% 152.88/153.20 ============================== STATISTICS ============================
% 152.88/153.20
% 152.88/153.20 Given=3779. Generated=10969068. Kept=13643. proofs=1.
% 152.88/153.20 Usable=1582. Sos=4079. Demods=3. Limbo=265, Disabled=7752. Hints=0.
% 152.88/153.20 Megabytes=9.85.
% 152.88/153.20 User_CPU=146.50, System_CPU=5.56, Wall_clock=152.
% 152.88/153.20
% 152.88/153.20 ============================== end of statistics =====================
% 152.88/153.20
% 152.88/153.20 ============================== end of search =========================
% 152.88/153.20
% 152.88/153.20 THEOREM PROVED
% 152.88/153.20 % SZS status Theorem
% 152.88/153.20
% 152.88/153.20 Exiting with 1 proof.
% 152.88/153.20
% 152.88/153.20 Process 16162 exit (max_proofs) Thu Jun 9 08:10:05 2022
% 152.88/153.20 Prover9 interrupted
%------------------------------------------------------------------------------