TSTP Solution File: MGT056+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT056+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:09 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT056+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 11:51:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.44/0.98 ============================== Prover9 ===============================
% 0.44/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.98 Process 5562 was started by sandbox on n028.cluster.edu,
% 0.44/0.98 Thu Jun 9 11:51:03 2022
% 0.44/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5409_n028.cluster.edu".
% 0.44/0.98 ============================== end of head ===========================
% 0.44/0.98
% 0.44/0.98 ============================== INPUT =================================
% 0.44/0.98
% 0.44/0.98 % Reading from file /tmp/Prover9_5409_n028.cluster.edu
% 0.44/0.98
% 0.44/0.98 set(prolog_style_variables).
% 0.44/0.98 set(auto2).
% 0.44/0.98 % set(auto2) -> set(auto).
% 0.44/0.98 % set(auto) -> set(auto_inference).
% 0.44/0.98 % set(auto) -> set(auto_setup).
% 0.44/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.98 % set(auto) -> set(auto_limits).
% 0.44/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.98 % set(auto) -> set(auto_denials).
% 0.44/0.98 % set(auto) -> set(auto_process).
% 0.44/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.98 % set(auto2) -> assign(stats, some).
% 0.44/0.98 % set(auto2) -> clear(echo_input).
% 0.44/0.98 % set(auto2) -> set(quiet).
% 0.44/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.98 % set(auto2) -> clear(print_given).
% 0.44/0.98 assign(lrs_ticks,-1).
% 0.44/0.98 assign(sos_limit,10000).
% 0.44/0.98 assign(order,kbo).
% 0.44/0.98 set(lex_order_vars).
% 0.44/0.98 clear(print_given).
% 0.44/0.98
% 0.44/0.98 % formulas(sos). % not echoed (10 formulas)
% 0.44/0.98
% 0.44/0.98 ============================== end of input ==========================
% 0.44/0.98
% 0.44/0.98 % From the command line: assign(max_seconds, 300).
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.98
% 0.44/0.98 % Formulas that are not ordinary clauses:
% 0.44/0.98 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.44/0.98 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.44/0.98 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 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.44/0.98 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.44/0.98 7 (all X (has_endowment(X) <-> (all T (organization(X) & (smaller_or_equal(age(X,T),eta) -> has_immunity(X,T)) & (greater(age(X,T),eta) -> -has_immunity(X,T)))))) # label(definition_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 8 (all X all T0 all T (organization(X) & has_immunity(X,T0) & has_immunity(X,T) -> hazard_of_mortality(X,T0) = hazard_of_mortality(X,T))) # label(assumption_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 9 (all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.98 10 -(all X all T0 all T1 all T2 (organization(X) & has_endowment(X) & age(X,T0) = zero & smaller_or_equal(age(X,T1),eta) & greater(age(X,T2),eta) & greater_or_equal(eta,sigma) & greater(sigma,zero) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(lemma_9) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.98
% 0.44/0.98 ============================== end of process non-clausal formulas ===
% 0.44/0.98
% 0.44/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.98
% 0.44/0.98 ============================== PREDICATE ELIMINATION =================
% 0.44/0.98 11 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.98 12 organization(c1) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.98 13 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.98 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(11,b,12,a)].
% 0.44/0.98 14 has_endowment(A) | -organization(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.98 Derived: has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta). [resolve(14,b,12,a)].
% 0.44/0.98 15 -organization(A) | -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_2) # label(axiom). [clausify(8)].
% 0.44/0.98 Derived: -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(15,a,12,a)].
% 0.44/0.98 Derived: -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A). [resolve(15,a,13,b)].
% 0.44/0.98 16 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3) # label(axiom). [clausify(9)].
% 0.44/0.98 Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(16,a,12,a)].
% 0.44/0.98 Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A). [resolve(16,a,13,b)].
% 0.44/0.98 17 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.98 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(17,b,12,a)].
% 0.44/0.98 18 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.98 19 has_endowment(c1) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.98 Derived: -greater(age(c1,A),eta) | -has_immunity(c1,A). [resolve(18,a,19,a)].
% 0.44/0.98 20 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.98 Derived: -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A). [resolve(20,a,19,a)].
% 0.44/0.98 21 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(11,b,12,a)].
% 0.44/0.98 22 has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta). [resolve(14,b,12,a)].
% 0.44/0.98 23 -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A). [resolve(15,a,13,b)].
% 0.44/0.98 Derived: -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(23,d,19,a)].
% 0.44/0.98 24 -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A). [resolve(16,a,13,b)].
% 0.44/0.98 Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(24,d,19,a)].
% 0.44/0.98 25 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(17,b,12,a)].
% 0.44/0.98 26 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.44/0.98 27 greater_or_equal(eta,sigma) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.98 28 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.44/0.98 29 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.44/0.98 Derived: greater(eta,sigma) | sigma = eta. [resolve(26,a,27,a)].
% 0.44/0.98 30 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.44/0.98 31 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.44/0.99 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(30,b,31,a)].
% 0.44/0.99 32 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.44/0.99 Derived: greater(A,B) | A = B | greater(B,A). [resolve(32,a,31,a)].
% 0.44/0.99 33 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.44/0.99 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(33,a,30,b)].
% 0.44/0.99 34 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.44/0.99 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(34,b,32,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights: eta=1. sigma=1. zero=1. c1=1. c2=1. c3=1. c4=1. hazard_of_mortality=1. age=1.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 56.
% 0.44/0.99 % Level of proof is 10.
% 0.44/0.99 % Maximum clause weight is 14.000.
% 0.44/0.99 % Given clauses 66.
% 0.44/0.99
% 0.44/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.44/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.44/0.99 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/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.44/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.44/0.99 7 (all X (has_endowment(X) <-> (all T (organization(X) & (smaller_or_equal(age(X,T),eta) -> has_immunity(X,T)) & (greater(age(X,T),eta) -> -has_immunity(X,T)))))) # label(definition_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 8 (all X all T0 all T (organization(X) & has_immunity(X,T0) & has_immunity(X,T) -> hazard_of_mortality(X,T0) = hazard_of_mortality(X,T))) # label(assumption_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 9 (all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 10 -(all X all T0 all T1 all T2 (organization(X) & has_endowment(X) & age(X,T0) = zero & smaller_or_equal(age(X,T1),eta) & greater(age(X,T2),eta) & greater_or_equal(eta,sigma) & greater(sigma,zero) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(lemma_9) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 12 organization(c1) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 15 -organization(A) | -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_2) # label(axiom). [clausify(8)].
% 0.44/0.99 16 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3) # label(axiom). [clausify(9)].
% 0.44/0.99 18 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.99 19 has_endowment(c1) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 20 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/0.99 26 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.44/0.99 27 greater_or_equal(eta,sigma) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 30 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.44/0.99 31 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.44/0.99 32 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.44/0.99 33 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.44/0.99 35 greater(sigma,zero) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 36 age(c1,c2) = zero # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 37 smaller_or_equal(age(c1,c3),eta) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 38 greater(age(c1,c4),eta) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 39 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(4)].
% 0.44/0.99 40 -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(lemma_9) # label(negated_conjecture). [clausify(10)].
% 0.44/0.99 42 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom). [clausify(5)].
% 0.44/0.99 43 -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(15,a,12,a)].
% 0.44/0.99 44 -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(16,a,12,a)].
% 0.44/0.99 45 -greater(age(c1,A),eta) | -has_immunity(c1,A). [resolve(18,a,19,a)].
% 0.44/0.99 46 -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A). [resolve(20,a,19,a)].
% 0.44/0.99 47 greater(eta,sigma) | sigma = eta. [resolve(26,a,27,a)].
% 0.44/0.99 49 greater(A,B) | A = B | greater(B,A). [resolve(32,a,31,a)].
% 0.44/0.99 50 -greater(A,B) | smaller_or_equal(B,A). [resolve(33,a,30,b)].
% 0.44/0.99 52 -greater(A,A). [factor(39,a,b)].
% 0.44/0.99 58 -greater(zero,A) | greater(sigma,A). [resolve(42,a,35,a)].
% 0.44/0.99 60 -greater(A,sigma) | greater(A,zero). [resolve(42,b,35,a)].
% 0.44/0.99 61 -has_immunity(c1,c4). [ur(45,a,38,a)].
% 0.44/0.99 62 has_immunity(c1,c3). [resolve(46,a,37,a)].
% 0.44/0.99 63 -smaller_or_equal(zero,eta) | has_immunity(c1,c2). [para(36(a,1),46(a,1))].
% 0.44/0.99 81 has_immunity(c1,A) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,c3)). [resolve(62,a,44,a)].
% 0.44/0.99 87 greater(sigma,A) | greater(A,zero) | zero = A. [resolve(58,a,49,c),flip(c)].
% 0.44/0.99 89 greater(eta,zero) | sigma = eta. [resolve(60,a,47,a)].
% 0.44/0.99 93 sigma = eta | smaller_or_equal(zero,eta). [resolve(89,a,50,a)].
% 0.44/0.99 97 sigma = eta | has_immunity(c1,c2). [resolve(93,b,63,a)].
% 0.44/0.99 119 greater(sigma,A) | zero = A | smaller_or_equal(zero,A). [resolve(87,b,50,a)].
% 0.44/0.99 141 greater(sigma,eta) | zero = eta | has_immunity(c1,c2). [resolve(119,c,63,a)].
% 0.44/0.99 155 greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)). [resolve(81,a,61,a)].
% 0.44/0.99 160 hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2). [back_unit_del(40),unit_del(a,155)].
% 0.44/0.99 164 -has_immunity(c1,c2). [ur(43,a,62,a,c,160,a)].
% 0.44/0.99 165 greater(sigma,eta) | zero = eta. [back_unit_del(141),unit_del(c,164)].
% 0.44/0.99 166 sigma = eta. [back_unit_del(97),unit_del(b,164)].
% 0.44/0.99 169 zero = eta. [back_rewrite(165),rewrite([166(1)]),unit_del(a,52)].
% 0.44/0.99 170 $F. [back_rewrite(35),rewrite([166(1),169(2)]),unit_del(a,52)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=66. Generated=384. Kept=135. proofs=1.
% 0.44/0.99 Usable=34. Sos=25. Demods=3. Limbo=4, Disabled=115. Hints=0.
% 0.44/0.99 Megabytes=0.18.
% 0.44/0.99 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 5562 exit (max_proofs) Thu Jun 9 11:51:03 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------