TSTP Solution File: MGT043+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT043+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:03 EDT 2022
% Result : Theorem 0.73s 1.05s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT043+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n022.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 11:43:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 31951 was started by sandbox on n022.cluster.edu,
% 0.45/0.99 Thu Jun 9 11:43:20 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31785_n022.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_31785_n022.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (10 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99 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.45/0.99 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.45/0.99 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 10 -(all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) & stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & greater(internal_friction(X,T),internal_friction(X,T0)) & external_ties(X,T0) = external_ties(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(lemma_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99 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.45/0.99 12 organization(c1) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.45/0.99 Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(11,a,12,a)].
% 0.45/0.99 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.45/0.99 Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,12,a)].
% 0.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.45/0.99 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.05 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.05 20 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.73/1.05 21 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.73/1.05 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(20,b,21,a)].
% 0.73/1.05 22 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.73/1.05 Derived: greater(A,B) | A = B | greater(B,A). [resolve(22,a,21,a)].
% 0.73/1.05 23 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.73/1.05 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(23,a,20,b)].
% 0.73/1.05 24 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.73/1.05 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(24,b,22,a)].
% 0.73/1.05 25 -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.05 Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller_or_equal(capability(c1,A),capability(c1,B)). [resolve(25,c,20,b)].
% 0.73/1.05 Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)). [resolve(25,c,22,a)].
% 0.73/1.05 26 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.05 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_or_equal(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(26,e,20,b)].
% 0.73/1.05 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)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)). [resolve(26,e,22,a)].
% 0.73/1.05 27 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.05 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_or_equal(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(27,e,20,b)].
% 0.73/1.05 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)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)). [resolve(27,e,22,a)].
% 0.73/1.05
% 0.73/1.05 ============================== end predicate elimination =============
% 0.73/1.05
% 0.73/1.05 Auto_denials: (non-Horn, no changes).
% 0.73/1.05
% 0.73/1.05 Term ordering decisions:
% 0.73/1.05 Function symbol KB weights: c1=1. c2=1. c3=1. capability=1. position=1. hazard_of_mortality=1. internal_friction=1. stock_of_knowledge=1. external_ties=1.
% 0.73/1.05
% 0.73/1.05 ============================== end of process initial clauses ========
% 0.73/1.05
% 0.73/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.05
% 0.73/1.05 ============================== end of clauses for search =============
% 0.73/1.05
% 0.73/1.05 ============================== SEARCH ================================
% 0.73/1.05
% 0.73/1.05 % Starting search at 0.02 seconds.
% 0.73/1.05
% 0.73/1.05 ============================== PROOF =================================
% 0.73/1.05 % SZS status Theorem
% 0.73/1.05 % SZS output start Refutation
% 0.73/1.05
% 0.73/1.05 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.73/1.05 % Length of proof is 31.
% 0.73/1.05 % Level of proof is 6.
% 0.73/1.05 % Maximum clause weight is 27.000.
% 0.73/1.05 % Given clauses 90.
% 0.73/1.05
% 0.73/1.05 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.05 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.05 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.05 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.05 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.05 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.05 10 -(all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) & stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & greater(internal_friction(X,T),internal_friction(X,T0)) & external_ties(X,T0) = external_ties(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(lemma_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/1.05 12 organization(c1) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 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.05 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.05 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.05 22 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.73/1.05 25 -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.05 26 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.05 28 stock_of_knowledge(c1,c3) = stock_of_knowledge(c1,c2) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 29 greater(internal_friction(c1,c3),internal_friction(c1,c2)) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 30 external_ties(c1,c3) = external_ties(c1,c2) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 31 -has_immunity(c1,c2) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 32 -has_immunity(c1,c3) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 34 -greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(lemma_2) # label(negated_conjecture). [clausify(10)].
% 0.73/1.05 35 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.73/1.05 37 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.73/1.05 41 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(13,a,12,a)].
% 0.73/1.05 50 -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)). [resolve(25,c,22,a)].
% 0.73/1.05 52 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)). [resolve(26,e,22,a)].
% 0.73/1.05 59 smaller_or_equal(A,A). [xx_res(35,b)].
% 0.73/1.05 63 greater_or_equal(A,A). [xx_res(37,b)].
% 0.73/1.05 68 position(c1,c3) = position(c1,c2). [resolve(41,a,30,a)].
% 0.73/1.05 87 -smaller_or_equal(stock_of_knowledge(c1,c2),stock_of_knowledge(c1,A)) | -greater(internal_friction(c1,c3),internal_friction(c1,A)) | greater(capability(c1,A),capability(c1,c3)). [para(28(a,1),50(a,1))].
% 0.73/1.05 328 greater(capability(c1,c2),capability(c1,c3)). [resolve(87,a,59,a),unit_del(a,29)].
% 0.73/1.05 335 $F. [ur(52,a,32,a,b,31,a,c,328,a,e,34,a),rewrite([68(6)]),unit_del(a,63)].
% 0.73/1.05
% 0.73/1.05 % SZS output end Refutation
% 0.73/1.05 ============================== end of proof ==========================
% 0.73/1.05
% 0.73/1.05 ============================== STATISTICS ============================
% 0.73/1.05
% 0.73/1.05 Given=90. Generated=1250. Kept=307. proofs=1.
% 0.73/1.05 Usable=89. Sos=205. Demods=3. Limbo=6, Disabled=51. Hints=0.
% 0.73/1.05 Megabytes=0.39.
% 0.73/1.05 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.73/1.05
% 0.73/1.05 ============================== end of statistics =====================
% 0.73/1.05
% 0.73/1.05 ============================== end of search =========================
% 0.73/1.05
% 0.73/1.05 THEOREM PROVED
% 0.73/1.05 % SZS status Theorem
% 0.73/1.05
% 0.73/1.05 Exiting with 1 proof.
% 0.73/1.05
% 0.73/1.05 Process 31951 exit (max_proofs) Thu Jun 9 11:43:20 2022
% 0.73/1.05 Prover9 interrupted
%------------------------------------------------------------------------------