TSTP Solution File: MGT062+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT062+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:11 EDT 2022
% Result : Theorem 0.74s 1.01s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT062+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 09:32:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 30402 was started by sandbox on n028.cluster.edu,
% 0.74/1.00 Thu Jun 9 09:32:03 2022
% 0.74/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30222_n028.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_30222_n028.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (14 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/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.74/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.74/1.00 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.74/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.74/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.74/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.74/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.74/1.00 8 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 9 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 10 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 11 (all X (robust_position(X) <-> (all T ((smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)) & (greater(age(X,T),tau) -> positional_advantage(X,T)))))) # label(definition_4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 12 (all X all T (organization(X) -> (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 13 -(all X all T0 all T1 all T2 (organization(X) & robust_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & sigma = tau & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) -> smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 14 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.74/1.00 15 organization(c1) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.00 16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(8)].
% 0.74/1.00 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(14,a,15,a)].
% 0.74/1.00 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(14,a,16,b)].
% 0.74/1.00 17 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(9)].
% 0.74/1.00 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(17,a,15,a)].
% 0.74/1.00 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(17,a,16,b)].
% 0.74/1.00 18 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(18,a,15,a)].
% 0.74/1.00 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(18,a,16,b)].
% 0.74/1.00 19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.74/1.00 Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(19,b,15,a)].
% 0.74/1.00 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(19,b,16,b)].
% 0.74/1.00 20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.74/1.00 Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(20,b,15,a)].
% 0.74/1.00 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(20,b,16,b)].
% 0.74/1.00 21 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.74/1.00 Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(21,a,15,a)].
% 0.74/1.00 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(21,a,16,b)].
% 0.74/1.00 22 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.74/1.00 Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B). [resolve(22,a,15,a)].
% 0.74/1.00 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(22,a,16,b)].
% 0.74/1.00 23 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(23,a,15,a)].
% 0.74/1.00 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(23,a,16,b)].
% 0.74/1.00 24 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(24,a,15,a)].
% 0.74/1.00 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(24,a,16,b)].
% 0.74/1.00 25 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(25,a,15,a)].
% 0.74/1.00 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(25,a,16,b)].
% 0.74/1.00 26 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.00 Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(26,a,15,a)].
% 0.74/1.00 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(26,a,16,b)].
% 0.74/1.00 27 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.00 28 robust_position(c1) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.00 29 robust_position(A) | positional_advantage(A,f1(A)) | greater(age(A,f1(A)),tau) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.00 30 robust_position(A) | smaller_or_equal(age(A,f1(A)),tau) | greater(age(A,f1(A)),tau) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.00 Derived: -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A). [resolve(27,a,28,a)].
% 0.74/1.00 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | positional_advantage(A,f1(A)) | greater(age(A,f1(A)),tau). [resolve(27,a,29,a)].
% 0.74/1.00 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),tau) | greater(age(A,f1(A)),tau). [resolve(27,a,30,a)].
% 0.74/1.00 31 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.00 Derived: -greater(age(c1,A),tau) | positional_advantage(c1,A). [resolve(31,a,28,a)].
% 0.74/1.00 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | positional_advantage(A,f1(A)) | greater(age(A,f1(A)),tau). [resolve(31,a,29,a)].
% 0.74/1.00 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),tau) | greater(age(A,f1(A)),tau). [resolve(31,a,30,a)].
% 0.74/1.00 32 robust_position(A) | smaller_or_equal(age(A,f1(A)),tau) | -positional_advantage(A,f1(A)) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.00 Derived: smaller_or_equal(age(A,f1(A)),tau) | -positional_advantage(A,f1(A)) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B). [resolve(32,a,27,a)].
% 0.74/1.00 Derived: smaller_or_equal(age(A,f1(A)),tau) | -positional_advantage(A,f1(A)) | -greater(age(A,B),tau) | positional_advantage(A,B). [resolve(32,a,31,a)].
% 0.74/1.00 33 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.74/1.00 34 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.74/1.00 35 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.74/1.00
% 0.74/1.00 ============================== end predicate elimination =============
% 0.74/1.00
% 0.74/1.00 Auto_denials: (non-Horn, no changes).
% 0.74/1.00
% 0.74/1.00 Term ordering decisions:
% 0.74/1.00
% 0.74/1.00 % Assigning unary symbol f1 kb_weight 0 and highest precedence (24).
% 0.74/1.00 Function symbol KB weights: tau=1. zero=1. sigma=1. mod1=1. mod2=1. high=1. low=1. very_low=1. c1=1. c2=1. c3=1. c4=1. age=1. hazard_of_mortality=1. f1=0.
% 0.74/1.00
% 0.74/1.00 ============================== end of process initial clauses ========
% 0.74/1.00
% 0.74/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.00
% 0.74/1.00 ============================== end of clauses for search =============
% 0.74/1.00
% 0.74/1.00 ============================== SEARCH ================================
% 0.74/1.00
% 0.74/1.00 % Starting search at 0.01 seconds.
% 0.74/1.01
% 0.74/1.01 ============================== PROOF =================================
% 0.74/1.01 % SZS status Theorem
% 0.74/1.01 % SZS output start Refutation
% 0.74/1.01
% 0.74/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.74/1.01 % Length of proof is 72.
% 0.74/1.01 % Level of proof is 11.
% 0.74/1.01 % Maximum clause weight is 18.000.
% 0.74/1.01 % Given clauses 106.
% 0.74/1.01
% 0.74/1.01 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.74/1.01 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 8 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 9 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 10 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 11 (all X (robust_position(X) <-> (all T ((smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)) & (greater(age(X,T),tau) -> positional_advantage(X,T)))))) # label(definition_4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 12 (all X all T (organization(X) -> (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 13 -(all X all T0 all T1 all T2 (organization(X) & robust_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & sigma = tau & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) -> smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.01 14 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.74/1.01 15 organization(c1) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(8)].
% 0.74/1.01 17 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(9)].
% 0.74/1.01 19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.74/1.01 21 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.74/1.01 22 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.74/1.01 24 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.01 25 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom). [clausify(12)].
% 0.74/1.01 27 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.01 28 robust_position(c1) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 31 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(11)].
% 0.74/1.01 36 greater(mod2,mod1) # label(assumption_19) # label(axiom). [assumption].
% 0.74/1.01 38 greater(tau,zero) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 39 tau = sigma # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 40 sigma = tau. [copy(39),flip(a)].
% 0.74/1.01 41 age(c1,c2) = zero # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 42 smaller_or_equal(age(c1,c3),sigma) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 43 smaller_or_equal(age(c1,c3),tau). [copy(42),rewrite([40(4)])].
% 0.74/1.01 44 greater(age(c1,c4),sigma) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 45 greater(age(c1,c4),tau). [copy(44),rewrite([40(4)])].
% 0.74/1.01 47 -has_endowment(c1) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 49 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.74/1.01 50 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(theorem_8) # label(negated_conjecture). [clausify(13)].
% 0.74/1.01 51 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.74/1.01 54 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.74/1.01 58 has_endowment(c1) | -has_immunity(c1,A). [resolve(14,a,15,a)].
% 0.74/1.01 59 -has_immunity(c1,A). [copy(58),unit_del(a,47)].
% 0.74/1.01 61 age(c1,A) != zero | is_aligned(c1,A). [resolve(17,a,15,a)].
% 0.74/1.01 64 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(19,b,15,a)].
% 0.74/1.01 68 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(21,a,15,a)].
% 0.74/1.01 69 age(c1,A) != zero | -greater(age(c1,B),tau) | dissimilar(c1,A,B). [copy(68),rewrite([40(7)])].
% 0.74/1.01 74 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(22,a,16,b)].
% 0.74/1.01 75 age(A,B) != zero | greater(age(A,C),tau) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [copy(74),rewrite([40(5)])].
% 0.74/1.01 79 has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(24,a,15,a)].
% 0.74/1.01 80 is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [copy(79),unit_del(a,59)].
% 0.74/1.01 82 has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(25,a,15,a)].
% 0.74/1.01 83 -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [copy(82),unit_del(a,59)].
% 0.74/1.01 88 -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A). [resolve(27,a,28,a)].
% 0.74/1.01 91 -greater(age(c1,A),tau) | positional_advantage(c1,A). [resolve(31,a,28,a)].
% 0.74/1.01 99 age(A,B) != zero | greater(age(A,C),tau) | -dissimilar(A,B,C). [factor(75,c,d)].
% 0.74/1.01 110 smaller(zero,tau). [resolve(54,b,38,a)].
% 0.74/1.01 119 is_aligned(c1,c2). [resolve(61,a,41,a)].
% 0.74/1.01 120 age(c1,A) != zero | dissimilar(c1,A,c4). [resolve(69,b,45,a)].
% 0.74/1.01 122 -positional_advantage(c1,c3). [resolve(88,a,43,a)].
% 0.74/1.01 123 -smaller_or_equal(zero,tau) | -positional_advantage(c1,c2). [para(41(a,1),88(a,1))].
% 0.74/1.01 124 positional_advantage(c1,c4). [resolve(91,a,45,a)].
% 0.74/1.01 131 -greater(age(c1,c3),tau). [ur(91,b,122,a)].
% 0.74/1.01 132 smaller_or_equal(zero,tau). [resolve(110,a,51,b)].
% 0.74/1.01 133 -positional_advantage(c1,c2). [back_unit_del(123),unit_del(a,132)].
% 0.74/1.01 135 hazard_of_mortality(c1,c2) = mod2. [resolve(119,a,83,a),unit_del(a,133)].
% 0.74/1.01 137 dissimilar(c1,c2,A) | is_aligned(c1,A). [resolve(119,a,64,b)].
% 0.74/1.01 140 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != mod2. [back_rewrite(50),rewrite([135(13)])].
% 0.74/1.01 146 is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = mod1. [resolve(124,a,80,b)].
% 0.74/1.01 162 -dissimilar(c1,c2,c3). [ur(99,a,41,a,b,131,a)].
% 0.74/1.01 178 is_aligned(c1,c3). [resolve(137,a,162,a)].
% 0.74/1.01 180 hazard_of_mortality(c1,c3) = mod2. [resolve(178,a,83,a),unit_del(a,122)].
% 0.74/1.01 185 -smaller(hazard_of_mortality(c1,c4),mod2). [back_rewrite(140),rewrite([180(6),180(8)]),xx(b)].
% 0.74/1.01 188 -greater(mod2,hazard_of_mortality(c1,c4)). [ur(54,a,185,a)].
% 0.74/1.01 192 dissimilar(c1,c2,c4). [resolve(120,a,41,a)].
% 0.74/1.01 195 -is_aligned(c1,c4). [resolve(192,a,49,a),unit_del(a,119)].
% 0.74/1.01 196 hazard_of_mortality(c1,c4) = mod1. [back_unit_del(146),unit_del(a,195)].
% 0.74/1.01 197 $F. [back_rewrite(188),rewrite([196(4)]),unit_del(a,36)].
% 0.74/1.01
% 0.74/1.01 % SZS output end Refutation
% 0.74/1.01 ============================== end of proof ==========================
% 0.74/1.01
% 0.74/1.01 ============================== STATISTICS ============================
% 0.74/1.01
% 0.74/1.01 Given=106. Generated=380. Kept=149. proofs=1.
% 0.74/1.01 Usable=100. Sos=28. Demods=5. Limbo=1, Disabled=91. Hints=0.
% 0.74/1.01 Megabytes=0.23.
% 0.74/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.74/1.01
% 0.74/1.01 ============================== end of statistics =====================
% 0.74/1.01
% 0.74/1.01 ============================== end of search =========================
% 0.74/1.01
% 0.74/1.01 THEOREM PROVED
% 0.74/1.01 % SZS status Theorem
% 0.74/1.01
% 0.74/1.01 Exiting with 1 proof.
% 0.74/1.01
% 0.74/1.01 Process 30402 exit (max_proofs) Thu Jun 9 09:32:03 2022
% 0.74/1.01 Prover9 interrupted
%------------------------------------------------------------------------------