TSTP Solution File: MGT050-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT050-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:07 EDT 2022
% Result : Unsatisfiable 0.77s 1.03s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT050-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 : n025.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 09:15:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.77/1.03 ============================== Prover9 ===============================
% 0.77/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03 Process 17405 was started by sandbox on n025.cluster.edu,
% 0.77/1.03 Thu Jun 9 09:15:06 2022
% 0.77/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17252_n025.cluster.edu".
% 0.77/1.03 ============================== end of head ===========================
% 0.77/1.03
% 0.77/1.03 ============================== INPUT =================================
% 0.77/1.03
% 0.77/1.03 % Reading from file /tmp/Prover9_17252_n025.cluster.edu
% 0.77/1.03
% 0.77/1.03 set(prolog_style_variables).
% 0.77/1.03 set(auto2).
% 0.77/1.03 % set(auto2) -> set(auto).
% 0.77/1.03 % set(auto) -> set(auto_inference).
% 0.77/1.03 % set(auto) -> set(auto_setup).
% 0.77/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03 % set(auto) -> set(auto_limits).
% 0.77/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03 % set(auto) -> set(auto_denials).
% 0.77/1.03 % set(auto) -> set(auto_process).
% 0.77/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03 % set(auto2) -> assign(stats, some).
% 0.77/1.03 % set(auto2) -> clear(echo_input).
% 0.77/1.03 % set(auto2) -> set(quiet).
% 0.77/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03 % set(auto2) -> clear(print_given).
% 0.77/1.03 assign(lrs_ticks,-1).
% 0.77/1.03 assign(sos_limit,10000).
% 0.77/1.03 assign(order,kbo).
% 0.77/1.03 set(lex_order_vars).
% 0.77/1.03 clear(print_given).
% 0.77/1.03
% 0.77/1.03 % formulas(sos). % not echoed (27 formulas)
% 0.77/1.03
% 0.77/1.03 ============================== end of input ==========================
% 0.77/1.03
% 0.77/1.03 % From the command line: assign(max_seconds, 300).
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03
% 0.77/1.03 % Formulas that are not ordinary clauses:
% 0.77/1.03
% 0.77/1.03 ============================== end of process non-clausal formulas ===
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.03
% 0.77/1.03 ============================== PREDICATE ELIMINATION =================
% 0.77/1.03 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_41) # label(axiom). [assumption].
% 0.77/1.03 2 organization(sk1) # label(theorem_3_53) # label(negated_conjecture). [assumption].
% 0.77/1.03 Derived: has_endowment(sk1) | -has_immunity(sk1,A). [resolve(1,a,2,a)].
% 0.77/1.03 3 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10_50) # label(axiom). [assumption].
% 0.77/1.03 Derived: stock_of_knowledge(sk1,A) = stock_of_knowledge(sk1,B). [resolve(3,a,2,a)].
% 0.77/1.03 4 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11_51) # label(axiom). [assumption].
% 0.77/1.03 Derived: external_ties(sk1,A) = external_ties(sk1,B). [resolve(4,a,2,a)].
% 0.77/1.03 5 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6_48) # label(axiom). [assumption].
% 0.77/1.03 Derived: -greater(external_ties(sk1,A),external_ties(sk1,B)) | greater(position(sk1,A),position(sk1,B)). [resolve(5,a,2,a)].
% 0.77/1.03 6 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_49) # label(axiom). [assumption].
% 0.77/1.03 Derived: external_ties(sk1,A) != external_ties(sk1,B) | position(sk1,A) = position(sk1,B). [resolve(6,a,2,a)].
% 0.77/1.03 7 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12_52) # label(axiom). [assumption].
% 0.77/1.03 Derived: -greater(age(sk1,A),age(sk1,B)) | greater(internal_friction(sk1,A),internal_friction(sk1,B)). [resolve(7,a,2,a)].
% 0.77/1.03 8 -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_45) # label(axiom). [assumption].
% 0.77/1.03 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(8,a,2,a)].
% 0.77/1.03 9 -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_46) # label(axiom). [assumption].
% 0.77/1.03 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(9,a,2,a)].
% 0.77/1.03 10 -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_47) # label(axiom). [assumption].
% 0.77/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(10,a,2,a)].
% 0.77/1.03 11 -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_42) # label(axiom). [assumption].
% 0.77/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(11,a,2,a)].
% 0.77/1.03 12 -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_43) # label(axiom). [assumption].
% 0.77/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(12,a,2,a)].
% 0.77/1.03 13 -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_44) # label(axiom). [assumption].
% 0.77/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(13,a,2,a)].
% 0.77/1.03 14 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.77/1.03 15 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.77/1.03 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(14,a,15,a)].
% 0.77/1.03 16 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.77/1.03 Derived: greater(A,B) | B = A | greater(B,A). [resolve(16,a,15,a)].
% 0.77/1.03 17 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.77/1.03 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(17,b,14,a)].
% 0.77/1.03 18 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.77/1.03 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(18,b,16,a)].
% 0.77/1.03 19 -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(9,a,2,a)].
% 0.77/1.03 Derived: -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | smaller_or_equal(capability(sk1,A),capability(sk1,B)). [resolve(19,c,14,a)].
% 0.77/1.03 Derived: -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,B),capability(sk1,A)). [resolve(19,c,16,a)].
% 0.77/1.03 20 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(11,a,2,a)].
% 0.77/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_or_equal(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(20,e,14,a)].
% 0.77/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)) | greater(hazard_of_mortality(sk1,A),hazard_of_mortality(sk1,B)). [resolve(20,e,16,a)].
% 0.77/1.03 21 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(12,a,2,a)].
% 0.77/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_or_equal(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(21,e,14,a)].
% 0.77/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)) | greater(hazard_of_mortality(sk1,A),hazard_of_mortality(sk1,B)). [resolve(21,e,16,a)].
% 0.77/1.03
% 0.77/1.03 ============================== end predicate elimination =============
% 0.77/1.03
% 0.77/1.03 Auto_denials: (non-Horn, no changes).
% 0.77/1.03
% 0.77/1.03 Term ordering decisions:
% 0.77/1.03 Function symbol KB weights: sk1=1. sk2=1. sk3=1. capability=1. position=1. hazard_of_mortality=1. internal_friction=1. stock_of_knowledge=1. external_ties=1. age=1.
% 0.77/1.03
% 0.77/1.03 ============================== end of process initial clauses ========
% 0.77/1.03
% 0.77/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.03
% 0.77/1.03 ============================== end of clauses for search =============
% 0.77/1.03
% 0.77/1.03 ============================== SEARCH ================================
% 0.77/1.03
% 0.77/1.03 % Starting search at 0.01 seconds.
% 0.77/1.03
% 0.77/1.03 ============================== PROOF =================================
% 0.77/1.03 % SZS status Unsatisfiable
% 0.77/1.03 % SZS output start Refutation
% 0.77/1.03
% 0.77/1.03 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.77/1.03 % Length of proof is 35.
% 0.77/1.03 % Level of proof is 6.
% 0.77/1.03 % Maximum clause weight is 21.000.
% 0.77/1.03 % Given clauses 55.
% 0.77/1.03
% 0.77/1.03 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_41) # label(axiom). [assumption].
% 0.77/1.03 2 organization(sk1) # label(theorem_3_53) # label(negated_conjecture). [assumption].
% 0.77/1.03 3 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10_50) # label(axiom). [assumption].
% 0.77/1.03 4 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11_51) # label(axiom). [assumption].
% 0.77/1.03 6 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_49) # label(axiom). [assumption].
% 0.77/1.03 7 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12_52) # label(axiom). [assumption].
% 0.77/1.03 9 -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_46) # label(axiom). [assumption].
% 0.77/1.03 11 -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_42) # label(axiom). [assumption].
% 0.77/1.03 16 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.77/1.03 19 -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(9,a,2,a)].
% 0.77/1.03 20 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(11,a,2,a)].
% 0.77/1.03 22 greater(age(sk1,sk3),age(sk1,sk2)) # label(theorem_3_55) # label(negated_conjecture). [assumption].
% 0.77/1.03 23 -has_endowment(sk1) # label(theorem_3_54) # label(negated_conjecture). [assumption].
% 0.77/1.03 25 -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)) # label(theorem_3_56) # label(negated_conjecture). [assumption].
% 0.77/1.03 26 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.77/1.03 28 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.77/1.03 31 has_endowment(sk1) | -has_immunity(sk1,A). [resolve(1,a,2,a)].
% 0.77/1.03 32 -has_immunity(sk1,A). [copy(31),unit_del(a,23)].
% 0.77/1.03 33 stock_of_knowledge(sk1,A) = stock_of_knowledge(sk1,B). [resolve(3,a,2,a)].
% 0.77/1.03 34 external_ties(sk1,A) = external_ties(sk1,B). [resolve(4,a,2,a)].
% 0.77/1.03 36 external_ties(sk1,A) != external_ties(sk1,B) | position(sk1,A) = position(sk1,B). [resolve(6,a,2,a)].
% 0.77/1.03 37 position(sk1,A) = position(sk1,B). [copy(36),unit_del(a,34)].
% 0.77/1.03 38 -greater(age(sk1,A),age(sk1,B)) | greater(internal_friction(sk1,A),internal_friction(sk1,B)). [resolve(7,a,2,a)].
% 0.77/1.03 49 -smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,B),capability(sk1,A)). [resolve(19,c,16,a)].
% 0.77/1.03 52 has_immunity(sk1,A) | has_immunity(sk1,B) | -greater(capability(sk1,B),capability(sk1,A)) | -greater_or_equal(position(sk1,B),position(sk1,A)) | greater(hazard_of_mortality(sk1,A),hazard_of_mortality(sk1,B)). [resolve(20,e,16,a)].
% 0.77/1.03 53 -greater(capability(sk1,A),capability(sk1,B)) | -greater_or_equal(position(sk1,A),position(sk1,B)) | greater(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [copy(52),unit_del(a,32),unit_del(b,32)].
% 0.77/1.03 59 stock_of_knowledge(sk1,A) = c_0. [new_symbol(33)].
% 0.77/1.03 60 -smaller_or_equal(c_0,c_0) | -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,B),capability(sk1,A)). [back_rewrite(49),rewrite([59(2),59(3)])].
% 0.77/1.03 63 smaller_or_equal(A,A). [xx_res(26,a)].
% 0.77/1.03 65 -greater(internal_friction(sk1,A),internal_friction(sk1,B)) | greater(capability(sk1,B),capability(sk1,A)). [back_unit_del(60),unit_del(a,63)].
% 0.77/1.03 74 greater_or_equal(position(sk1,A),position(sk1,B)). [resolve(37,a,28,a)].
% 0.77/1.03 76 -greater(capability(sk1,A),capability(sk1,B)) | greater(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [back_unit_del(53),unit_del(b,74)].
% 0.77/1.03 78 greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)). [resolve(38,a,22,a)].
% 0.77/1.03 98 greater(capability(sk1,sk2),capability(sk1,sk3)). [resolve(65,a,78,a)].
% 0.77/1.03 119 $F. [resolve(76,a,98,a),unit_del(a,25)].
% 0.77/1.03
% 0.77/1.03 % SZS output end Refutation
% 0.77/1.03 ============================== end of proof ==========================
% 0.77/1.03
% 0.77/1.03 ============================== STATISTICS ============================
% 0.77/1.03
% 0.77/1.03 Given=55. Generated=198. Kept=89. proofs=1.
% 0.77/1.03 Usable=50. Sos=19. Demods=1. Limbo=0, Disabled=69. Hints=0.
% 0.77/1.03 Megabytes=0.14.
% 0.77/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.77/1.03
% 0.77/1.03 ============================== end of statistics =====================
% 0.77/1.03
% 0.77/1.03 ============================== end of search =========================
% 0.77/1.03
% 0.77/1.03 THEOREM PROVED
% 0.77/1.03 % SZS status Unsatisfiable
% 0.77/1.03
% 0.77/1.03 Exiting with 1 proof.
% 0.77/1.03
% 0.77/1.03 Process 17405 exit (max_proofs) Thu Jun 9 09:15:06 2022
% 0.77/1.03 Prover9 interrupted
%------------------------------------------------------------------------------