TSTP Solution File: MGT042-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT042-1 : TPTP v8.1.0. Released v2.4.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 22:23:02 EDT 2022
% Result : Unsatisfiable 0.73s 1.03s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT042-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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 9 10:20:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.00 ============================== Prover9 ===============================
% 0.73/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.00 Process 5136 was started by sandbox2 on n027.cluster.edu,
% 0.73/1.00 Thu Jun 9 10:20:28 2022
% 0.73/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4982_n027.cluster.edu".
% 0.73/1.00 ============================== end of head ===========================
% 0.73/1.00
% 0.73/1.00 ============================== INPUT =================================
% 0.73/1.00
% 0.73/1.00 % Reading from file /tmp/Prover9_4982_n027.cluster.edu
% 0.73/1.00
% 0.73/1.00 set(prolog_style_variables).
% 0.73/1.00 set(auto2).
% 0.73/1.00 % set(auto2) -> set(auto).
% 0.73/1.00 % set(auto) -> set(auto_inference).
% 0.73/1.00 % set(auto) -> set(auto_setup).
% 0.73/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.00 % set(auto) -> set(auto_limits).
% 0.73/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.00 % set(auto) -> set(auto_denials).
% 0.73/1.00 % set(auto) -> set(auto_process).
% 0.73/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.00 % set(auto2) -> assign(stats, some).
% 0.73/1.00 % set(auto2) -> clear(echo_input).
% 0.73/1.00 % set(auto2) -> set(quiet).
% 0.73/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.00 % set(auto2) -> clear(print_given).
% 0.73/1.00 assign(lrs_ticks,-1).
% 0.73/1.00 assign(sos_limit,10000).
% 0.73/1.00 assign(order,kbo).
% 0.73/1.00 set(lex_order_vars).
% 0.73/1.00 clear(print_given).
% 0.73/1.00
% 0.73/1.00 % formulas(sos). % not echoed (38 formulas)
% 0.73/1.00
% 0.73/1.00 ============================== end of input ==========================
% 0.73/1.00
% 0.73/1.00 % From the command line: assign(max_seconds, 300).
% 0.73/1.00
% 0.73/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.00
% 0.73/1.00 % Formulas that are not ordinary clauses:
% 0.73/1.00
% 0.73/1.00 ============================== end of process non-clausal formulas ===
% 0.73/1.00
% 0.73/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.00
% 0.73/1.00 ============================== PREDICATE ELIMINATION =================
% 0.73/1.00 1 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6_44) # label(axiom). [assumption].
% 0.73/1.00 2 organization(sk1) # label(lemma_1_46) # label(negated_conjecture). [assumption].
% 0.73/1.00 Derived: -greater(external_ties(sk1,A),external_ties(sk1,B)) | greater(position(sk1,A),position(sk1,B)). [resolve(1,a,2,a)].
% 0.73/1.00 3 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_45) # label(axiom). [assumption].
% 0.73/1.00 Derived: external_ties(sk1,A) != external_ties(sk1,B) | position(sk1,A) = position(sk1,B). [resolve(3,a,2,a)].
% 0.73/1.00 4 -organization(A) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5_41) # label(axiom). [assumption].
% 0.73/1.00 Derived: -greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -smaller_or_equal(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,A),capability(sk1,B)). [resolve(4,a,2,a)].
% 0.73/1.00 5 -organization(A) | -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -greater(internal_friction(A,B),internal_friction(A,C)) | smaller(capability(A,B),capability(A,C)) # label(assumption_5_42) # label(axiom). [assumption].
% 0.73/1.00 Derived: -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | smaller(capability(sk1,A),capability(sk1,B)). [resolve(5,a,2,a)].
% 0.73/1.00 6 -organization(A) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) # label(assumption_5_43) # label(axiom). [assumption].
% 0.73/1.03 Derived: stock_of_knowledge(sk1,A) != stock_of_knowledge(sk1,B) | internal_friction(sk1,A) != internal_friction(sk1,B) | capability(sk1,A) = capability(sk1,B). [resolve(6,a,2,a)].
% 0.73/1.03 7 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4_38) # label(axiom). [assumption].
% 0.73/1.03 Derived: has_immunity(sk1,A) | has_immunity(sk1,B) | -greater(capability(sk1,B),capability(sk1,A)) | -greater_or_equal(position(sk1,B),position(sk1,A)) | smaller(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(7,a,2,a)].
% 0.73/1.03 8 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater_or_equal(capability(A,C),capability(A,B)) | -greater(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4_39) # label(axiom). [assumption].
% 0.73/1.03 Derived: has_immunity(sk1,A) | has_immunity(sk1,B) | -greater_or_equal(capability(sk1,B),capability(sk1,A)) | -greater(position(sk1,B),position(sk1,A)) | smaller(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(8,a,2,a)].
% 0.73/1.03 9 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | capability(A,C) != capability(A,B) | position(A,C) != position(A,B) | hazard_of_mortality(A,C) = hazard_of_mortality(A,B) # label(assumption_4_40) # label(axiom). [assumption].
% 0.73/1.03 Derived: has_immunity(sk1,A) | has_immunity(sk1,B) | capability(sk1,B) != capability(sk1,A) | position(sk1,B) != position(sk1,A) | hazard_of_mortality(sk1,B) = hazard_of_mortality(sk1,A). [resolve(9,a,2,a)].
% 0.73/1.03
% 0.73/1.03 ============================== end predicate elimination =============
% 0.73/1.03
% 0.73/1.03 Auto_denials: (non-Horn, no changes).
% 0.73/1.03
% 0.73/1.03 Term ordering decisions:
% 0.73/1.03 Function symbol KB weights: sk1=1. sk2=1. sk3=1. internal_friction=1. stock_of_knowledge=1. external_ties=1. hazard_of_mortality=1. capability=1. position=1.
% 0.73/1.03
% 0.73/1.03 ============================== end of process initial clauses ========
% 0.73/1.03
% 0.73/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.03
% 0.73/1.03 ============================== end of clauses for search =============
% 0.73/1.03
% 0.73/1.03 ============================== SEARCH ================================
% 0.73/1.03
% 0.73/1.03 % Starting search at 0.02 seconds.
% 0.73/1.03
% 0.73/1.03 ============================== PROOF =================================
% 0.73/1.03 % SZS status Unsatisfiable
% 0.73/1.03 % SZS output start Refutation
% 0.73/1.03
% 0.73/1.03 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.73/1.03 % Length of proof is 59.
% 0.73/1.03 % Level of proof is 15.
% 0.73/1.03 % Maximum clause weight is 27.000.
% 0.73/1.03 % Given clauses 130.
% 0.73/1.03
% 0.73/1.03 1 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6_44) # label(axiom). [assumption].
% 0.73/1.03 2 organization(sk1) # label(lemma_1_46) # label(negated_conjecture). [assumption].
% 0.73/1.03 3 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_45) # label(axiom). [assumption].
% 0.73/1.03 4 -organization(A) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5_41) # label(axiom). [assumption].
% 0.73/1.03 5 -organization(A) | -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -greater(internal_friction(A,B),internal_friction(A,C)) | smaller(capability(A,B),capability(A,C)) # label(assumption_5_42) # label(axiom). [assumption].
% 0.73/1.03 6 -organization(A) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) # label(assumption_5_43) # label(axiom). [assumption].
% 0.73/1.03 7 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4_38) # label(axiom). [assumption].
% 0.73/1.03 8 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater_or_equal(capability(A,C),capability(A,B)) | -greater(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4_39) # label(axiom). [assumption].
% 0.73/1.03 11 greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) # label(lemma_1_49) # label(negated_conjecture). [assumption].
% 0.73/1.03 13 greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) # label(lemma_1_51) # label(negated_conjecture). [assumption].
% 0.73/1.03 16 smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)) | smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)) # label(lemma_1_54) # label(negated_conjecture). [assumption].
% 0.73/1.03 17 smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)). [copy(16),merge(b)].
% 0.73/1.03 18 greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2)) | greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) # label(lemma_1_57) # label(negated_conjecture). [assumption].
% 0.73/1.03 19 -has_immunity(sk1,sk2) # label(lemma_1_47) # label(negated_conjecture). [assumption].
% 0.73/1.03 20 -has_immunity(sk1,sk3) # label(lemma_1_48) # label(negated_conjecture). [assumption].
% 0.73/1.03 21 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict_9) # label(axiom). [assumption].
% 0.73/1.03 22 -smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)) | -smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)) # label(lemma_1_64) # label(negated_conjecture). [assumption].
% 0.73/1.03 23 -smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)). [copy(22),merge(b)].
% 0.73/1.03 25 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.73/1.03 26 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.73/1.03 27 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.73/1.03 28 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.73/1.03 30 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.73/1.03 31 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.73/1.03 33 -greater(external_ties(sk1,A),external_ties(sk1,B)) | greater(position(sk1,A),position(sk1,B)). [resolve(1,a,2,a)].
% 0.73/1.03 34 external_ties(sk1,A) != external_ties(sk1,B) | position(sk1,A) = position(sk1,B). [resolve(3,a,2,a)].
% 0.73/1.03 35 -greater(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -smaller_or_equal(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,A),capability(sk1,B)). [resolve(4,a,2,a)].
% 0.73/1.03 36 -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | smaller(capability(sk1,A),capability(sk1,B)). [resolve(5,a,2,a)].
% 0.73/1.03 37 stock_of_knowledge(sk1,A) != stock_of_knowledge(sk1,B) | internal_friction(sk1,A) != internal_friction(sk1,B) | capability(sk1,A) = capability(sk1,B). [resolve(6,a,2,a)].
% 0.73/1.03 38 has_immunity(sk1,A) | has_immunity(sk1,B) | -greater(capability(sk1,B),capability(sk1,A)) | -greater_or_equal(position(sk1,B),position(sk1,A)) | smaller(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(7,a,2,a)].
% 0.73/1.03 39 has_immunity(sk1,A) | has_immunity(sk1,B) | -greater_or_equal(capability(sk1,B),capability(sk1,A)) | -greater(position(sk1,B),position(sk1,A)) | smaller(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(8,a,2,a)].
% 0.73/1.03 41 -greater(A,A). [factor(21,a,b)].
% 0.73/1.03 45 smaller_or_equal(A,A). [xx_res(25,a)].
% 0.73/1.03 51 smaller(internal_friction(sk1,sk3),internal_friction(sk1,sk2)) | internal_friction(sk1,sk3) = internal_friction(sk1,sk2). [resolve(30,a,17,a)].
% 0.73/1.03 52 greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) | external_ties(sk1,sk3) = external_ties(sk1,sk2). [resolve(31,a,18,a),merge(c)].
% 0.73/1.03 53 greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2). [resolve(31,a,11,b),merge(c)].
% 0.73/1.03 56 greater(position(sk1,sk3),position(sk1,sk2)) | greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)). [resolve(33,a,13,b)].
% 0.73/1.03 57 -greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | greater(capability(sk1,sk3),capability(sk1,sk2)). [resolve(35,b,17,a)].
% 0.73/1.03 90 internal_friction(sk1,sk3) = internal_friction(sk1,sk2) | greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3)). [resolve(51,a,28,a)].
% 0.73/1.03 93 external_ties(sk1,sk3) = external_ties(sk1,sk2) | greater(position(sk1,sk3),position(sk1,sk2)). [resolve(52,a,33,a)].
% 0.73/1.03 111 greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | greater_or_equal(position(sk1,sk3),position(sk1,sk2)). [resolve(56,a,26,a)].
% 0.73/1.03 113 greater(capability(sk1,sk3),capability(sk1,sk2)) | stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2). [resolve(57,a,53,a)].
% 0.73/1.03 126 external_ties(sk1,sk3) = external_ties(sk1,sk2) | greater_or_equal(position(sk1,sk3),position(sk1,sk2)). [resolve(93,b,26,a)].
% 0.73/1.03 136 greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | -greater(capability(sk1,sk3),capability(sk1,sk2)). [resolve(111,b,38,d),unit_del(b,19),unit_del(c,20),unit_del(e,23)].
% 0.73/1.03 174 external_ties(sk1,sk3) = external_ties(sk1,sk2) | -greater(capability(sk1,sk3),capability(sk1,sk2)). [resolve(126,b,38,d),unit_del(b,19),unit_del(c,20),unit_del(e,23)].
% 0.73/1.03 178 external_ties(sk1,sk3) = external_ties(sk1,sk2) | stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2). [resolve(174,b,113,a)].
% 0.73/1.03 185 stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2) | position(sk1,sk3) = position(sk1,sk2). [resolve(178,a,34,a)].
% 0.73/1.03 196 stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2) | greater_or_equal(position(sk1,sk3),position(sk1,sk2)). [resolve(185,b,27,a)].
% 0.73/1.03 208 stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2) | -greater(capability(sk1,sk3),capability(sk1,sk2)). [resolve(196,b,38,d),unit_del(b,19),unit_del(c,20),unit_del(e,23)].
% 0.73/1.03 212 stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2). [resolve(208,b,113,a),merge(b)].
% 0.73/1.03 216 -greater(capability(sk1,sk3),capability(sk1,sk2)). [back_rewrite(136),rewrite([212(3)]),unit_del(a,41)].
% 0.73/1.03 228 greater(position(sk1,sk3),position(sk1,sk2)). [back_rewrite(56),rewrite([212(10)]),unit_del(b,41)].
% 0.73/1.03 235 -smaller(capability(sk1,sk2),capability(sk1,sk3)). [ur(28,b,216,a)].
% 0.73/1.03 238 internal_friction(sk1,sk3) != internal_friction(sk1,sk2) | capability(sk1,sk3) = capability(sk1,sk2). [resolve(212,a,37,a)].
% 0.73/1.03 246 -greater_or_equal(capability(sk1,sk3),capability(sk1,sk2)). [ur(39,a,19,a,b,20,a,d,228,a,e,23,a)].
% 0.73/1.03 249 capability(sk1,sk3) != capability(sk1,sk2). [ur(27,b,246,a)].
% 0.73/1.03 250 internal_friction(sk1,sk3) != internal_friction(sk1,sk2). [back_unit_del(238),unit_del(b,249)].
% 0.73/1.03 258 greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3)). [back_unit_del(90),unit_del(a,250)].
% 0.73/1.03 269 $F. [ur(36,b,258,a,c,235,a),rewrite([212(6)]),unit_del(a,45)].
% 0.73/1.03
% 0.73/1.03 % SZS output end Refutation
% 0.73/1.03 ============================== end of proof ==========================
% 0.73/1.03
% 0.73/1.03 ============================== STATISTICS ============================
% 0.73/1.03
% 0.73/1.03 Given=130. Generated=652. Kept=257. proofs=1.
% 0.73/1.03 Usable=76. Sos=78. Demods=1. Limbo=0, Disabled=149. Hints=0.
% 0.73/1.03 Megabytes=0.32.
% 0.73/1.03 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.73/1.03
% 0.73/1.03 ============================== end of statistics =====================
% 0.73/1.03
% 0.73/1.03 ============================== end of search =========================
% 0.73/1.03
% 0.73/1.03 THEOREM PROVED
% 0.73/1.03 % SZS status Unsatisfiable
% 0.73/1.03
% 0.73/1.03 Exiting with 1 proof.
% 0.73/1.03
% 0.73/1.03 Process 5136 exit (max_proofs) Thu Jun 9 10:20:28 2022
% 0.73/1.03 Prover9 interrupted
%------------------------------------------------------------------------------