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 : 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:02 EDT 2022
% Result : Theorem 0.73s 1.03s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : MGT042+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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 12:28:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 9291 was started by sandbox2 on n025.cluster.edu,
% 0.42/1.00 Thu Jun 9 12:28:06 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9136_n025.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_9136_n025.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (10 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 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.42/1.00 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.42/1.00 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 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.42/1.00 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.42/1.00 7 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(capability(X,T),capability(X,T0)) & greater_or_equal(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater_or_equal(capability(X,T),capability(X,T0)) & greater(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (capability(X,T) = capability(X,T0) & position(X,T) = position(X,T0) -> hazard_of_mortality(X,T) = hazard_of_mortality(X,T0)))) # label(assumption_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 (all X all T0 all T (organization(X) -> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> greater(capability(X,T),capability(X,T0))) & (smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater(internal_friction(X,T),internal_friction(X,T0)) -> smaller(capability(X,T),capability(X,T0))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T) = capability(X,T0)))) # label(assumption_5) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T) = external_ties(X,T0) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 10 -(all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater_or_equal(external_ties(X,T),external_ties(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater(external_ties(X,T),external_ties(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(lemma_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00 11 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom). [clausify(9)].
% 0.42/1.00 12 organization(c1) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.42/1.00 Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(11,a,12,a)].
% 0.42/1.00 13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(9)].
% 0.42/1.00 Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,12,a)].
% 0.42/1.00 14 -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) # label(axiom). [clausify(8)].
% 0.42/1.00 Derived: -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,A),capability(c1,B)). [resolve(14,a,12,a)].
% 0.42/1.00 15 -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) # label(axiom). [clausify(8)].
% 0.42/1.00 Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)). [resolve(15,a,12,a)].
% 0.42/1.00 16 -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) # label(axiom). [clausify(8)].
% 0.42/1.00 Derived: stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | internal_friction(c1,A) != internal_friction(c1,B) | capability(c1,A) = capability(c1,B). [resolve(16,a,12,a)].
% 0.42/1.00 17 -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) # label(axiom). [clausify(7)].
% 0.42/1.00 Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(17,a,12,a)].
% 0.42/1.00 18 -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) # label(axiom). [clausify(7)].
% 0.42/1.00 Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(18,a,12,a)].
% 0.73/1.03 19 -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) # label(axiom). [clausify(7)].
% 0.73/1.03 Derived: has_immunity(c1,A) | has_immunity(c1,B) | capability(c1,B) != capability(c1,A) | position(c1,B) != position(c1,A) | hazard_of_mortality(c1,B) = hazard_of_mortality(c1,A). [resolve(19,a,12,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: c1=1. c2=1. c3=1. stock_of_knowledge=1. capability=1. external_ties=1. position=1. internal_friction=1. hazard_of_mortality=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.01 seconds.
% 0.73/1.03
% 0.73/1.03 ============================== PROOF =================================
% 0.73/1.03 % SZS status Theorem
% 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 64.
% 0.73/1.03 % Level of proof is 16.
% 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 (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.73/1.03 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.73/1.03 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 7 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(capability(X,T),capability(X,T0)) & greater_or_equal(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater_or_equal(capability(X,T),capability(X,T0)) & greater(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (capability(X,T) = capability(X,T0) & position(X,T) = position(X,T0) -> hazard_of_mortality(X,T) = hazard_of_mortality(X,T0)))) # label(assumption_4) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 8 (all X all T0 all T (organization(X) -> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> greater(capability(X,T),capability(X,T0))) & (smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater(internal_friction(X,T),internal_friction(X,T0)) -> smaller(capability(X,T),capability(X,T0))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T) = capability(X,T0)))) # label(assumption_5) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 9 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T) = external_ties(X,T0) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.03 10 -(all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater_or_equal(external_ties(X,T),external_ties(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) & greater(external_ties(X,T),external_ties(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))))) # label(lemma_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/1.03 11 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom). [clausify(9)].
% 0.73/1.03 12 organization(c1) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 13 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(9)].
% 0.73/1.03 14 -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) # label(axiom). [clausify(8)].
% 0.73/1.03 15 -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) # label(axiom). [clausify(8)].
% 0.73/1.03 16 -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) # label(axiom). [clausify(8)].
% 0.73/1.03 17 -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) # label(axiom). [clausify(7)].
% 0.73/1.03 18 -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) # label(axiom). [clausify(7)].
% 0.73/1.03 20 smaller_or_equal(internal_friction(c1,c3),internal_friction(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 22 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater_or_equal(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 23 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater(external_ties(c1,c3),external_ties(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 25 greater_or_equal(external_ties(c1,c3),external_ties(c1,c2)) | greater(external_ties(c1,c3),external_ties(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 26 -has_immunity(c1,c2) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 27 -has_immunity(c1,c3) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 28 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(4)].
% 0.73/1.03 29 -smaller(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(lemma_1) # label(negated_conjecture). [clausify(10)].
% 0.73/1.03 31 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.73/1.03 32 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.73/1.03 33 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.73/1.03 34 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.73/1.03 36 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.73/1.03 37 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.73/1.03 39 -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(11,a,12,a)].
% 0.73/1.03 40 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,12,a)].
% 0.73/1.03 41 -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,A),capability(c1,B)). [resolve(14,a,12,a)].
% 0.73/1.03 42 -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)). [resolve(15,a,12,a)].
% 0.73/1.03 43 stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | internal_friction(c1,A) != internal_friction(c1,B) | capability(c1,A) = capability(c1,B). [resolve(16,a,12,a)].
% 0.73/1.03 44 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(17,a,12,a)].
% 0.73/1.03 45 has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(18,a,12,a)].
% 0.73/1.03 47 -greater(A,A). [factor(28,a,b)].
% 0.73/1.03 51 smaller_or_equal(A,A). [xx_res(31,b)].
% 0.73/1.03 57 smaller(internal_friction(c1,c3),internal_friction(c1,c2)) | internal_friction(c1,c3) = internal_friction(c1,c2). [resolve(36,a,20,a),flip(b)].
% 0.73/1.03 58 greater(external_ties(c1,c3),external_ties(c1,c2)) | external_ties(c1,c3) = external_ties(c1,c2). [resolve(37,a,25,a),flip(b),merge(c)].
% 0.73/1.03 59 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(37,a,22,b),flip(b),merge(c)].
% 0.73/1.03 62 greater(position(c1,c3),position(c1,c2)) | greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)). [resolve(39,a,23,b)].
% 0.73/1.03 63 -greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater(capability(c1,c3),capability(c1,c2)). [resolve(41,b,20,a)].
% 0.73/1.03 96 internal_friction(c1,c3) = internal_friction(c1,c2) | greater(internal_friction(c1,c2),internal_friction(c1,c3)). [resolve(57,a,34,a)].
% 0.73/1.03 99 external_ties(c1,c3) = external_ties(c1,c2) | greater(position(c1,c3),position(c1,c2)). [resolve(58,a,39,a)].
% 0.73/1.03 117 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | greater_or_equal(position(c1,c3),position(c1,c2)). [resolve(62,a,32,b)].
% 0.73/1.03 119 greater(capability(c1,c3),capability(c1,c2)) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(63,a,59,a)].
% 0.73/1.03 132 external_ties(c1,c3) = external_ties(c1,c2) | greater_or_equal(position(c1,c3),position(c1,c2)). [resolve(99,b,32,b)].
% 0.73/1.03 142 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)) | -greater(capability(c1,c3),capability(c1,c2)). [resolve(117,b,44,d),unit_del(b,26),unit_del(c,27),unit_del(e,29)].
% 0.73/1.03 180 external_ties(c1,c3) = external_ties(c1,c2) | -greater(capability(c1,c3),capability(c1,c2)). [resolve(132,b,44,d),unit_del(b,26),unit_del(c,27),unit_del(e,29)].
% 0.73/1.03 184 external_ties(c1,c3) = external_ties(c1,c2) | stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(180,b,119,a)].
% 0.73/1.03 191 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | position(c1,c3) = position(c1,c2). [resolve(184,a,40,a)].
% 0.73/1.03 204 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | greater_or_equal(position(c1,c3),position(c1,c2)). [resolve(191,b,33,b(flip))].
% 0.73/1.03 217 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) | -greater(capability(c1,c3),capability(c1,c2)). [resolve(204,b,44,d),unit_del(b,26),unit_del(c,27),unit_del(e,29)].
% 0.73/1.03 218 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2). [resolve(217,b,119,a),merge(b)].
% 0.73/1.03 222 -greater(capability(c1,c3),capability(c1,c2)). [back_rewrite(142),rewrite([218(3)]),unit_del(a,47)].
% 0.73/1.03 234 greater(position(c1,c3),position(c1,c2)). [back_rewrite(62),rewrite([218(10)]),unit_del(b,47)].
% 0.73/1.03 241 -smaller(capability(c1,c2),capability(c1,c3)). [ur(34,b,222,a)].
% 0.73/1.03 250 -greater_or_equal(capability(c1,c3),capability(c1,c2)). [ur(45,a,26,a,b,27,a,d,234,a,e,29,a)].
% 0.73/1.03 253 capability(c1,c3) != capability(c1,c2). [ur(33,a,250,a),flip(a)].
% 0.73/1.03 255 internal_friction(c1,c3) != internal_friction(c1,c2). [ur(43,a,218,a,c,253,a)].
% 0.73/1.03 263 greater(internal_friction(c1,c2),internal_friction(c1,c3)). [back_unit_del(96),unit_del(a,255)].
% 0.73/1.03 271 $F. [ur(42,b,263,a,c,241,a),rewrite([218(6)]),unit_del(a,51)].
% 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=631. Kept=251. proofs=1.
% 0.73/1.03 Usable=76. Sos=75. Demods=1. Limbo=0, Disabled=136. Hints=0.
% 0.73/1.03 Megabytes=0.34.
% 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 Theorem
% 0.73/1.03
% 0.73/1.03 Exiting with 1 proof.
% 0.73/1.03
% 0.73/1.03 Process 9291 exit (max_proofs) Thu Jun 9 12:28:06 2022
% 0.73/1.03 Prover9 interrupted
%------------------------------------------------------------------------------