TSTP Solution File: MGT046+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT046+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:05 EDT 2022
% Result : Theorem 0.76s 1.00s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT046+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 11:53:19 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.76/1.00 ============================== Prover9 ===============================
% 0.76/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.00 Process 26426 was started by sandbox2 on n022.cluster.edu,
% 0.76/1.00 Thu Jun 9 11:53:20 2022
% 0.76/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26273_n022.cluster.edu".
% 0.76/1.00 ============================== end of head ===========================
% 0.76/1.00
% 0.76/1.00 ============================== INPUT =================================
% 0.76/1.00
% 0.76/1.00 % Reading from file /tmp/Prover9_26273_n022.cluster.edu
% 0.76/1.00
% 0.76/1.00 set(prolog_style_variables).
% 0.76/1.00 set(auto2).
% 0.76/1.00 % set(auto2) -> set(auto).
% 0.76/1.00 % set(auto) -> set(auto_inference).
% 0.76/1.00 % set(auto) -> set(auto_setup).
% 0.76/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.00 % set(auto) -> set(auto_limits).
% 0.76/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.00 % set(auto) -> set(auto_denials).
% 0.76/1.00 % set(auto) -> set(auto_process).
% 0.76/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.00 % set(auto2) -> assign(stats, some).
% 0.76/1.00 % set(auto2) -> clear(echo_input).
% 0.76/1.00 % set(auto2) -> set(quiet).
% 0.76/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.00 % set(auto2) -> clear(print_given).
% 0.76/1.00 assign(lrs_ticks,-1).
% 0.76/1.00 assign(sos_limit,10000).
% 0.76/1.00 assign(order,kbo).
% 0.76/1.00 set(lex_order_vars).
% 0.76/1.00 clear(print_given).
% 0.76/1.00
% 0.76/1.00 % formulas(sos). % not echoed (14 formulas)
% 0.76/1.00
% 0.76/1.00 ============================== end of input ==========================
% 0.76/1.00
% 0.76/1.00 % From the command line: assign(max_seconds, 300).
% 0.76/1.00
% 0.76/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.00
% 0.76/1.00 % Formulas that are not ordinary clauses:
% 0.76/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.76/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.76/1.00 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.76/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.76/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.76/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.76/1.00 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 8 (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.76/1.00 9 (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.76/1.00 10 (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.76/1.00 11 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)))) # label(assumption_7) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 12 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(external_ties(X,T),external_ties(X,T0)))) # label(assumption_8) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 13 (all X all T0 all T (organization(X) -> internal_friction(X,T) = internal_friction(X,T0))) # label(assumption_9) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 14 -(all X all T0 all T (organization(X) & -has_endowment(X) & greater(age(X,T),age(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(theorem_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.00
% 0.76/1.00 ============================== end of process non-clausal formulas ===
% 0.76/1.00
% 0.76/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.00
% 0.76/1.00 ============================== PREDICATE ELIMINATION =================
% 0.76/1.00 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.76/1.00 16 organization(c1) # label(theorem_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.00 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 0.76/1.00 17 -organization(A) | internal_friction(A,B) = internal_friction(A,C) # label(assumption_9) # label(axiom). [clausify(13)].
% 0.76/1.00 Derived: internal_friction(c1,A) = internal_friction(c1,B). [resolve(17,a,16,a)].
% 0.76/1.00 18 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom). [clausify(10)].
% 0.76/1.00 Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(18,a,16,a)].
% 0.76/1.00 19 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(10)].
% 0.76/1.00 Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(19,a,16,a)].
% 0.76/1.00 20 -organization(A) | -greater(age(A,B),age(A,C)) | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) # label(assumption_7) # label(axiom). [clausify(11)].
% 0.76/1.00 Derived: -greater(age(c1,A),age(c1,B)) | greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)). [resolve(20,a,16,a)].
% 0.76/1.00 21 -organization(A) | -greater(age(A,B),age(A,C)) | greater(external_ties(A,B),external_ties(A,C)) # label(assumption_8) # label(axiom). [clausify(12)].
% 0.76/1.00 Derived: -greater(age(c1,A),age(c1,B)) | greater(external_ties(c1,A),external_ties(c1,B)). [resolve(21,a,16,a)].
% 0.76/1.00 22 -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(9)].
% 0.76/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(22,a,16,a)].
% 0.76/1.00 23 -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(9)].
% 0.76/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(23,a,16,a)].
% 0.76/1.00 24 -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(9)].
% 0.76/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(24,a,16,a)].
% 0.76/1.00 25 -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(8)].
% 0.76/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(25,a,16,a)].
% 0.76/1.00 26 -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(8)].
% 0.76/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(26,a,16,a)].
% 0.76/1.00 27 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | capability(A,B) != capability(A,C) | position(A,B) != position(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_4) # label(axiom). [clausify(8)].
% 0.76/1.00 Derived: has_immunity(c1,A) | has_immunity(c1,B) | capability(c1,A) != capability(c1,B) | position(c1,A) != position(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(27,a,16,a)].
% 0.76/1.00
% 0.76/1.00 ============================== end predicate elimination =============
% 0.76/1.00
% 0.76/1.00 Auto_denials: (non-Horn, no changes).
% 0.76/1.00
% 0.76/1.00 Term ordering decisions:
% 0.76/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. capability=1. position=1. internal_friction=1. stock_of_knowledge=1. age=1. external_ties=1. hazard_of_mortality=1.
% 0.76/1.00
% 0.76/1.00 ============================== end of process initial clauses ========
% 0.76/1.00
% 0.76/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.00
% 0.76/1.00 ============================== end of clauses for search =============
% 0.76/1.00
% 0.76/1.00 ============================== SEARCH ================================
% 0.76/1.00
% 0.76/1.00 % Starting search at 0.01 seconds.
% 0.76/1.00
% 0.76/1.00 ============================== PROOF =================================
% 0.76/1.00 % SZS status Theorem
% 0.76/1.00 % SZS output start Refutation
% 0.76/1.00
% 0.76/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.00 % Length of proof is 42.
% 0.76/1.00 % Level of proof is 7.
% 0.76/1.00 % Maximum clause weight is 21.000.
% 0.76/1.00 % Given clauses 50.
% 0.76/1.00
% 0.76/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.76/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.76/1.00 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 8 (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.76/1.00 9 (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.76/1.00 10 (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.76/1.00 11 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)))) # label(assumption_7) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 12 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(external_ties(X,T),external_ties(X,T0)))) # label(assumption_8) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 13 (all X all T0 all T (organization(X) -> internal_friction(X,T) = internal_friction(X,T0))) # label(assumption_9) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.00 14 -(all X all T0 all T (organization(X) & -has_endowment(X) & greater(age(X,T),age(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(theorem_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.00 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.76/1.00 16 organization(c1) # label(theorem_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.00 17 -organization(A) | internal_friction(A,B) = internal_friction(A,C) # label(assumption_9) # label(axiom). [clausify(13)].
% 0.76/1.00 18 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom). [clausify(10)].
% 0.76/1.00 20 -organization(A) | -greater(age(A,B),age(A,C)) | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) # label(assumption_7) # label(axiom). [clausify(11)].
% 0.76/1.00 21 -organization(A) | -greater(age(A,B),age(A,C)) | greater(external_ties(A,B),external_ties(A,C)) # label(assumption_8) # label(axiom). [clausify(12)].
% 0.76/1.00 22 -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(9)].
% 0.76/1.00 26 -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(8)].
% 0.76/1.00 28 greater(age(c1,c3),age(c1,c2)) # label(theorem_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.00 30 -has_endowment(c1) # label(theorem_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.00 32 -smaller(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(theorem_1) # label(negated_conjecture). [clausify(14)].
% 0.76/1.00 34 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.76/1.00 35 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.76/1.00 42 has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 0.76/1.00 43 -has_immunity(c1,A). [copy(42),unit_del(a,30)].
% 0.76/1.00 44 internal_friction(c1,A) = internal_friction(c1,B). [resolve(17,a,16,a)].
% 0.76/1.00 45 -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(18,a,16,a)].
% 0.76/1.00 47 -greater(age(c1,A),age(c1,B)) | greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)). [resolve(20,a,16,a)].
% 0.76/1.00 48 -greater(age(c1,A),age(c1,B)) | greater(external_ties(c1,A),external_ties(c1,B)). [resolve(21,a,16,a)].
% 0.76/1.00 49 -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(22,a,16,a)].
% 0.76/1.00 55 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(26,a,16,a)].
% 0.76/1.00 56 -greater_or_equal(capability(c1,A),capability(c1,B)) | -greater(position(c1,A),position(c1,B)) | smaller(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)). [copy(55),unit_del(a,43),unit_del(b,43)].
% 0.76/1.00 60 internal_friction(c1,A) = c_0. [new_symbol(44)].
% 0.76/1.00 61 -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(c_0,c_0) | greater(capability(c1,A),capability(c1,B)). [back_rewrite(49),rewrite([60(7),60(8)])].
% 0.76/1.00 65 smaller_or_equal(A,A). [xx_res(34,b)].
% 0.76/1.00 66 -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | greater(capability(c1,A),capability(c1,B)). [back_unit_del(61),unit_del(b,65)].
% 0.76/1.00 74 greater(stock_of_knowledge(c1,c3),stock_of_knowledge(c1,c2)). [resolve(47,a,28,a)].
% 0.76/1.00 75 greater(external_ties(c1,c3),external_ties(c1,c2)). [resolve(48,a,28,a)].
% 0.76/1.00 88 greater(position(c1,c3),position(c1,c2)). [resolve(75,a,45,a)].
% 0.76/1.00 102 -greater_or_equal(capability(c1,c3),capability(c1,c2)). [ur(56,b,88,a,c,32,a)].
% 0.76/1.00 104 greater(capability(c1,c3),capability(c1,c2)). [resolve(66,a,74,a)].
% 0.76/1.00 107 $F. [ur(35,a,102,a),unit_del(a,104)].
% 0.76/1.00
% 0.76/1.00 % SZS output end Refutation
% 0.76/1.00 ============================== end of proof ==========================
% 0.76/1.00
% 0.76/1.00 ============================== STATISTICS ============================
% 0.76/1.00
% 0.76/1.00 Given=50. Generated=139. Kept=74. proofs=1.
% 0.76/1.00 Usable=50. Sos=19. Demods=1. Limbo=1, Disabled=43. Hints=0.
% 0.76/1.00 Megabytes=0.16.
% 0.76/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.00
% 0.76/1.00 ============================== end of statistics =====================
% 0.76/1.00
% 0.76/1.00 ============================== end of search =========================
% 0.76/1.00
% 0.76/1.00 THEOREM PROVED
% 0.76/1.00 % SZS status Theorem
% 0.76/1.00
% 0.76/1.00 Exiting with 1 proof.
% 0.76/1.00
% 0.76/1.00 Process 26426 exit (max_proofs) Thu Jun 9 11:53:20 2022
% 0.76/1.00 Prover9 interrupted
%------------------------------------------------------------------------------