TSTP Solution File: MGT055+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT055+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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.67s 1.01s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : MGT055+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.32 % Computer : n029.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Thu Jun 9 09:54:07 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.67/0.95 ============================== Prover9 ===============================
% 0.67/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.95 Process 2033 was started by sandbox on n029.cluster.edu,
% 0.67/0.95 Thu Jun 9 09:54:07 2022
% 0.67/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1878_n029.cluster.edu".
% 0.67/0.95 ============================== end of head ===========================
% 0.67/0.95
% 0.67/0.95 ============================== INPUT =================================
% 0.67/0.95
% 0.67/0.95 % Reading from file /tmp/Prover9_1878_n029.cluster.edu
% 0.67/0.95
% 0.67/0.95 set(prolog_style_variables).
% 0.67/0.95 set(auto2).
% 0.67/0.95 % set(auto2) -> set(auto).
% 0.67/0.95 % set(auto) -> set(auto_inference).
% 0.67/0.95 % set(auto) -> set(auto_setup).
% 0.67/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.95 % set(auto) -> set(auto_limits).
% 0.67/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.95 % set(auto) -> set(auto_denials).
% 0.67/0.95 % set(auto) -> set(auto_process).
% 0.67/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.95 % set(auto2) -> assign(stats, some).
% 0.67/0.95 % set(auto2) -> clear(echo_input).
% 0.67/0.95 % set(auto2) -> set(quiet).
% 0.67/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.95 % set(auto2) -> clear(print_given).
% 0.67/0.95 assign(lrs_ticks,-1).
% 0.67/0.95 assign(sos_limit,10000).
% 0.67/0.95 assign(order,kbo).
% 0.67/0.95 set(lex_order_vars).
% 0.67/0.95 clear(print_given).
% 0.67/0.95
% 0.67/0.95 % formulas(sos). % not echoed (15 formulas)
% 0.67/0.95
% 0.67/0.95 ============================== end of input ==========================
% 0.67/0.95
% 0.67/0.95 % From the command line: assign(max_seconds, 300).
% 0.67/0.95
% 0.67/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.95
% 0.67/0.95 % Formulas that are not ordinary clauses:
% 0.67/0.95 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.67/0.95 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.67/0.95 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.95 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.95 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.67/0.95 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.67/0.95 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.67/0.96 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.67/0.96 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.67/0.96 10 (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.67/0.96 11 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.96 12 (all X all T0 all T (organization(X) & is_aligned(X,T0) & -is_aligned(X,T) -> greater(capability(X,T0),capability(X,T)))) # label(assumption_14) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.96 13 (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.67/0.96 14 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) & greater(capability(X,T),capability(X,T0)) -> greater(hazard_of_mortality(X,T0),hazard_of_mortality(X,T)))) # label(assumption_16) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.96 15 -(all X all T0 all T1 all T2 all T3 (organization(X) & has_endowment(X) & age(X,T0) = zero & smaller_or_equal(age(X,T1),eta) & greater(age(X,T2),eta) & smaller_or_equal(age(X,T2),sigma) & greater(age(X,T3),sigma) & greater(sigma,eta) & greater(eta,zero) -> greater(hazard_of_mortality(X,T3),hazard_of_mortality(X,T2)) & greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(lemma_8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.96
% 0.67/0.96 ============================== end of process non-clausal formulas ===
% 0.67/0.96
% 0.67/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.96
% 0.67/0.96 ============================== PREDICATE ELIMINATION =================
% 0.67/0.96 16 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(11)].
% 0.67/0.96 17 organization(c1) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/0.96 18 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom). [clausify(7)].
% 0.67/0.96 19 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(10)].
% 0.67/0.96 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(16,a,17,a)].
% 0.67/0.96 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(16,a,18,b)].
% 0.67/0.96 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(16,a,19,b)].
% 0.67/0.96 20 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(10)].
% 0.67/0.96 Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(20,b,17,a)].
% 0.67/0.96 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -has_endowment(A). [resolve(20,b,18,b)].
% 0.67/0.96 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(20,b,19,b)].
% 0.67/0.96 21 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(10)].
% 0.67/0.96 Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(21,b,17,a)].
% 0.67/0.96 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -has_endowment(A). [resolve(21,b,18,b)].
% 0.67/0.96 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(21,b,19,b)].
% 0.67/0.96 22 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.67/0.96 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(22,b,17,a)].
% 0.67/0.96 Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C). [resolve(22,b,19,b)].
% 0.67/0.96 23 has_endowment(A) | -organization(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom). [clausify(7)].
% 0.67/0.96 Derived: has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta). [resolve(23,b,17,a)].
% 0.67/0.96 Derived: has_endowment(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C). [resolve(23,b,19,b)].
% 0.67/0.96 24 -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.67/0.96 Derived: -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(24,a,17,a)].
% 0.67/0.96 Derived: -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A). [resolve(24,a,18,b)].
% 0.67/0.96 Derived: -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -dissimilar(A,D,E). [resolve(24,a,19,b)].
% 0.67/0.96 25 -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.67/0.96 Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(25,a,17,a)].
% 0.67/0.96 Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A). [resolve(25,a,18,b)].
% 0.67/0.96 Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -dissimilar(A,D,E). [resolve(25,a,19,b)].
% 0.67/0.96 26 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) # label(assumption_14) # label(axiom). [clausify(12)].
% 0.67/0.96 Derived: -is_aligned(c1,A) | is_aligned(c1,B) | greater(capability(c1,A),capability(c1,B)). [resolve(26,a,17,a)].
% 0.67/0.96 Derived: -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -has_endowment(A). [resolve(26,a,18,b)].
% 0.67/0.96 Derived: -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -dissimilar(A,D,E). [resolve(26,a,19,b)].
% 0.67/0.96 27 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.67/0.96 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(27,b,17,a)].
% 0.67/0.96 Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C). [resolve(27,b,19,b)].
% 0.67/0.96 28 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(13)].
% 0.67/0.96 Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(28,a,17,a)].
% 0.67/0.96 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(28,a,18,b)].
% 0.67/0.96 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(28,a,19,b)].
% 0.67/0.96 29 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(13)].
% 0.67/0.96 Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B). [resolve(29,a,17,a)].
% 0.67/0.96 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -has_endowment(A). [resolve(29,a,18,b)].
% 0.67/0.96 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(29,a,19,b)].
% 0.67/0.96 30 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_16) # label(axiom). [clausify(14)].
% 0.67/0.96 Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)). [resolve(30,a,17,a)].
% 0.67/0.96 Derived: has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -has_endowment(A). [resolve(30,a,18,b)].
% 0.67/0.96 Derived: has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -dissimilar(A,D,E). [resolve(30,a,19,b)].
% 0.67/0.96 31 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.67/0.96 32 has_endowment(c1) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/0.96 Derived: -greater(age(c1,A),eta) | -has_immunity(c1,A). [resolve(31,a,32,a)].
% 0.67/0.96 33 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.67/0.96 Derived: -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A). [resolve(33,a,32,a)].
% 0.67/0.96 34 age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(16,a,18,b)].
% 0.67/0.96 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(34,c,32,a)].
% 0.67/0.96 35 dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -has_endowment(A). [resolve(20,b,18,b)].
% 0.67/0.96 Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(35,d,32,a)].
% 0.67/0.96 36 dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -has_endowment(A). [resolve(21,b,18,b)].
% 0.67/0.96 Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(36,d,32,a)].
% 0.67/0.96 37 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(22,b,17,a)].
% 0.67/0.96 38 has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C). [resolve(22,b,19,b)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C) | -greater(age(A,D),eta) | -has_immunity(A,D). [resolve(38,a,31,a)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C) | -smaller_or_equal(age(A,D),eta) | has_immunity(A,D). [resolve(38,a,33,a)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C) | age(A,D) != zero | is_aligned(A,D). [resolve(38,a,34,c)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C) | dissimilar(A,D,E) | -is_aligned(A,D) | is_aligned(A,E). [resolve(38,a,35,d)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C) | dissimilar(A,D,E) | is_aligned(A,D) | -is_aligned(A,E). [resolve(38,a,36,d)].
% 0.67/0.96 39 has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta). [resolve(23,b,17,a)].
% 0.67/0.96 40 has_endowment(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C). [resolve(23,b,19,b)].
% 0.67/0.96 Derived: -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -greater(age(A,D),eta) | -has_immunity(A,D). [resolve(40,a,31,a)].
% 0.67/0.96 Derived: -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -smaller_or_equal(age(A,D),eta) | has_immunity(A,D). [resolve(40,a,33,a)].
% 0.67/0.96 Derived: -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | age(A,D) != zero | is_aligned(A,D). [resolve(40,a,34,c)].
% 0.67/0.96 Derived: -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | dissimilar(A,D,E) | -is_aligned(A,D) | is_aligned(A,E). [resolve(40,a,35,d)].
% 0.67/0.96 Derived: -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | dissimilar(A,D,E) | is_aligned(A,D) | -is_aligned(A,E). [resolve(40,a,36,d)].
% 0.67/0.96 41 -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A). [resolve(24,a,18,b)].
% 0.67/0.96 Derived: -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(41,d,32,a)].
% 0.67/0.96 42 -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A). [resolve(25,a,18,b)].
% 0.67/0.96 Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(42,d,32,a)].
% 0.67/0.96 43 -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -has_endowment(A). [resolve(26,a,18,b)].
% 0.67/0.96 Derived: -is_aligned(c1,A) | is_aligned(c1,B) | greater(capability(c1,A),capability(c1,B)). [resolve(43,d,32,a)].
% 0.67/0.96 44 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(27,b,17,a)].
% 0.67/0.96 45 has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C). [resolve(27,b,19,b)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -greater(age(A,D),eta) | -has_immunity(A,D). [resolve(45,a,31,a)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -smaller_or_equal(age(A,D),eta) | has_immunity(A,D). [resolve(45,a,33,a)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | age(A,D) != zero | is_aligned(A,D). [resolve(45,a,34,c)].
% 0.67/0.96 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | dissimilar(A,D,E) | -is_aligned(A,D) | is_aligned(A,E). [resolve(45,a,35,d)].
% 0.67/1.01 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | dissimilar(A,D,E) | is_aligned(A,D) | -is_aligned(A,E). [resolve(45,a,36,d)].
% 0.67/1.01 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -has_immunity(A,D) | -has_immunity(A,E) | hazard_of_mortality(A,D) = hazard_of_mortality(A,E). [resolve(45,a,41,d)].
% 0.67/1.01 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -has_immunity(A,D) | has_immunity(A,E) | greater(hazard_of_mortality(A,E),hazard_of_mortality(A,D)). [resolve(45,a,42,d)].
% 0.67/1.01 Derived: smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | greater(capability(A,D),capability(A,E)). [resolve(45,a,43,d)].
% 0.67/1.01 46 age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(28,a,18,b)].
% 0.67/1.01 Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(46,d,32,a)].
% 0.67/1.01 47 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -has_endowment(A). [resolve(29,a,18,b)].
% 0.67/1.01 48 has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -has_endowment(A). [resolve(30,a,18,b)].
% 0.67/1.01 Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)). [resolve(48,e,32,a)].
% 0.67/1.01 49 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/1.01 50 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.67/1.01 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(49,b,50,a)].
% 0.67/1.01 51 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/1.01 Derived: greater(A,B) | A = B | greater(B,A). [resolve(51,a,50,a)].
% 0.67/1.01 52 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/1.01 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(52,a,49,b)].
% 0.67/1.01 53 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/1.01 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(53,b,51,a)].
% 0.67/1.01 54 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.67/1.01 55 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.67/1.01 56 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.67/1.01
% 0.67/1.01 ============================== end predicate elimination =============
% 0.67/1.01
% 0.67/1.01 Auto_denials: (non-Horn, no changes).
% 0.67/1.01
% 0.67/1.01 Term ordering decisions:
% 0.67/1.01
% 0.67/1.01 % Assigning unary symbol f1 kb_weight 0 and highest precedence (18).
% 0.67/1.01 Function symbol KB weights: eta=1. zero=1. sigma=1. c1=1. c2=1. c3=1. c4=1. c5=1. age=1. hazard_of_mortality=1. capability=1. f1=0.
% 0.67/1.01
% 0.67/1.01 ============================== end of process initial clauses ========
% 0.67/1.01
% 0.67/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.67/1.01
% 0.67/1.01 ============================== end of clauses for search =============
% 0.67/1.01
% 0.67/1.01 ============================== SEARCH ================================
% 0.67/1.01
% 0.67/1.01 % Starting search at 0.02 seconds.
% 0.67/1.01
% 0.67/1.01 ============================== PROOF =================================
% 0.67/1.01 % SZS status Theorem
% 0.67/1.01 % SZS output start Refutation
% 0.67/1.01
% 0.67/1.01 % Proof 1 at 0.06 (+ 0.01) seconds.
% 0.67/1.01 % Length of proof is 82.
% 0.67/1.01 % Level of proof is 12.
% 0.67/1.01 % Maximum clause weight is 24.000.
% 0.67/1.01 % Given clauses 160.
% 0.67/1.01
% 0.67/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.67/1.01 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.67/1.01 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.67/1.01 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.67/1.01 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.67/1.01 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.67/1.01 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.67/1.01 10 (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.67/1.01 11 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.67/1.01 12 (all X all T0 all T (organization(X) & is_aligned(X,T0) & -is_aligned(X,T) -> greater(capability(X,T0),capability(X,T)))) # label(assumption_14) # label(axiom) # label(non_clause). [assumption].
% 0.67/1.01 13 (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.67/1.01 14 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) & greater(capability(X,T),capability(X,T0)) -> greater(hazard_of_mortality(X,T0),hazard_of_mortality(X,T)))) # label(assumption_16) # label(axiom) # label(non_clause). [assumption].
% 0.67/1.01 15 -(all X all T0 all T1 all T2 all T3 (organization(X) & has_endowment(X) & age(X,T0) = zero & smaller_or_equal(age(X,T1),eta) & greater(age(X,T2),eta) & smaller_or_equal(age(X,T2),sigma) & greater(age(X,T3),sigma) & greater(sigma,eta) & greater(eta,zero) -> greater(hazard_of_mortality(X,T3),hazard_of_mortality(X,T2)) & greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(lemma_8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/1.01 16 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(11)].
% 0.67/1.01 17 organization(c1) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 19 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(10)].
% 0.67/1.01 20 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(10)].
% 0.67/1.01 24 -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.67/1.01 25 -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.67/1.01 26 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) # label(assumption_14) # label(axiom). [clausify(12)].
% 0.67/1.01 28 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(13)].
% 0.67/1.01 29 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(13)].
% 0.67/1.01 30 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_16) # label(axiom). [clausify(14)].
% 0.67/1.01 31 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.67/1.01 32 has_endowment(c1) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 33 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.67/1.01 49 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/1.01 51 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/1.01 52 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/1.01 53 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/1.01 57 greater(sigma,eta) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 58 greater(eta,zero) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 59 age(c1,c2) = zero # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 60 smaller_or_equal(age(c1,c3),eta) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 61 greater(age(c1,c4),eta) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 62 smaller_or_equal(age(c1,c4),sigma) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 63 greater(age(c1,c5),sigma) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 64 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(4)].
% 0.67/1.01 65 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(10)].
% 0.67/1.01 66 -greater(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c4)) | -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(lemma_8) # label(negated_conjecture). [clausify(15)].
% 0.67/1.01 68 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom). [clausify(5)].
% 0.67/1.01 70 age(c1,A) != zero | is_aligned(c1,A). [resolve(16,a,17,a)].
% 0.67/1.01 72 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(20,b,17,a)].
% 0.67/1.01 76 -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(24,a,17,a)].
% 0.67/1.01 78 -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [resolve(25,a,17,a)].
% 0.67/1.01 81 -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -dissimilar(A,D,E). [resolve(26,a,19,b)].
% 0.67/1.01 82 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(28,a,17,a)].
% 0.67/1.01 85 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(29,a,19,b)].
% 0.67/1.01 87 has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -dissimilar(A,D,E). [resolve(30,a,19,b)].
% 0.67/1.01 88 -greater(age(c1,A),eta) | -has_immunity(c1,A). [resolve(31,a,32,a)].
% 0.67/1.01 89 -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A). [resolve(33,a,32,a)].
% 0.67/1.01 98 -greater(A,B) | smaller_or_equal(B,A). [resolve(52,a,49,b)].
% 0.67/1.01 99 -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(53,b,51,a)].
% 0.67/1.01 100 -greater(A,A). [factor(64,a,b)].
% 0.67/1.01 103 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C). [factor(85,c,d)].
% 0.67/1.01 110 -greater(sigma,A) | greater(age(c1,c5),A). [resolve(68,a,63,a)].
% 0.67/1.01 118 is_aligned(c1,c2). [resolve(70,a,59,a)].
% 0.67/1.01 119 age(c1,A) != zero | dissimilar(c1,A,c5). [resolve(82,b,63,a)].
% 0.67/1.01 121 -has_immunity(c1,c4). [ur(88,a,61,a)].
% 0.67/1.01 122 has_immunity(c1,c3). [resolve(89,a,60,a)].
% 0.67/1.01 123 -smaller_or_equal(zero,eta) | has_immunity(c1,c2). [para(59(a,1),89(a,1))].
% 0.67/1.01 136 smaller_or_equal(zero,eta). [resolve(98,a,58,a)].
% 0.67/1.01 138 has_immunity(c1,c2). [back_unit_del(123),unit_del(a,136)].
% 0.67/1.01 139 age(c1,c4) = sigma | greater(sigma,age(c1,c4)). [resolve(99,a,62,a),flip(a)].
% 0.67/1.01 149 dissimilar(c1,c2,A) | is_aligned(c1,A). [resolve(118,a,72,b)].
% 0.67/1.01 152 has_immunity(c1,A) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,c3)). [resolve(122,a,78,a)].
% 0.67/1.01 153 -has_immunity(c1,A) | hazard_of_mortality(c1,c3) = hazard_of_mortality(c1,A). [resolve(122,a,76,b),flip(b)].
% 0.67/1.01 160 greater(age(c1,c5),eta). [resolve(110,a,57,a)].
% 0.67/1.01 170 -has_immunity(c1,c5). [ur(88,a,160,a)].
% 0.67/1.01 197 is_aligned(c1,A) | greater(age(c1,A),sigma). [resolve(149,a,103,c),rewrite([59(5)]),xx(b)].
% 0.67/1.01 198 dissimilar(c1,c2,c5). [resolve(119,a,59,a)].
% 0.67/1.01 204 -is_aligned(c1,c5). [resolve(198,a,65,a),unit_del(a,118)].
% 0.67/1.01 337 age(c1,c4) = sigma | -greater(age(c1,c4),sigma). [resolve(139,b,64,b)].
% 0.67/1.01 362 greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)). [resolve(152,a,121,a)].
% 0.67/1.01 368 -greater(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2). [back_unit_del(66),unit_del(b,362)].
% 0.67/1.01 376 hazard_of_mortality(c1,c3) = hazard_of_mortality(c1,c2). [resolve(153,a,138,a)].
% 0.67/1.01 385 -greater(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c4)). [back_rewrite(368),rewrite([376(10)]),xx(b)].
% 0.67/1.01 393 -greater(capability(c1,c4),capability(c1,c5)). [ur(87,a,170,a,b,121,a,d,385,a,e,198,a)].
% 0.67/1.01 395 -is_aligned(c1,c4). [ur(81,b,204,a,c,393,a,d,198,a)].
% 0.67/1.01 403 greater(age(c1,c4),sigma). [resolve(395,a,197,a)].
% 0.67/1.01 409 age(c1,c4) = sigma. [back_unit_del(337),unit_del(b,403)].
% 0.67/1.01 411 $F. [back_rewrite(403),rewrite([409(3)]),unit_del(a,100)].
% 0.67/1.01
% 0.67/1.01 % SZS output end Refutation
% 0.67/1.01 ============================== end of proof ==========================
% 0.67/1.01
% 0.67/1.01 ============================== STATISTICS ============================
% 0.67/1.01
% 0.67/1.01 Given=160. Generated=1242. Kept=354. proofs=1.
% 0.67/1.01 Usable=152. Sos=150. Demods=3. Limbo=2, Disabled=154. Hints=0.
% 0.67/1.01 Megabytes=0.43.
% 0.67/1.01 User_CPU=0.06, System_CPU=0.01, Wall_clock=0.
% 0.67/1.01
% 0.67/1.01 ============================== end of statistics =====================
% 0.67/1.01
% 0.67/1.01 ============================== end of search =========================
% 0.67/1.01
% 0.67/1.01 THEOREM PROVED
% 0.67/1.01 % SZS status Theorem
% 0.67/1.01
% 0.67/1.01 Exiting with 1 proof.
% 0.67/1.01
% 0.67/1.01 Process 2033 exit (max_proofs) Thu Jun 9 09:54:07 2022
% 0.67/1.01 Prover9 interrupted
%------------------------------------------------------------------------------