TSTP Solution File: MGT057+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT057+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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.75s 1.02s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT057+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.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 12:17:40 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 13537 was started by sandbox on n019.cluster.edu,
% 0.45/1.01 Thu Jun 9 12:17:40 2022
% 0.45/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13189_n019.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_13189_n019.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (10 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/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.45/1.01 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/1.01 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.45/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.45/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.45/1.01 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/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.45/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.45/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.45/1.01 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(eta,zero) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01
% 0.75/1.01 ============================== PREDICATE ELIMINATION =================
% 0.75/1.01 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.75/1.01 12 organization(c1) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.01 13 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom). [clausify(7)].
% 0.75/1.01 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(11,b,12,a)].
% 0.75/1.01 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.75/1.01 Derived: has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta). [resolve(14,b,12,a)].
% 0.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(17,b,12,a)].
% 0.75/1.01 18 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.75/1.01 19 has_endowment(c1) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.01 Derived: -greater(age(c1,A),eta) | -has_immunity(c1,A). [resolve(18,a,19,a)].
% 0.75/1.01 20 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.75/1.01 Derived: -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A). [resolve(20,a,19,a)].
% 0.75/1.01 21 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(11,b,12,a)].
% 0.75/1.01 22 has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta). [resolve(14,b,12,a)].
% 0.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 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.75/1.01 25 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(17,b,12,a)].
% 0.75/1.01 26 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.75/1.01 27 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.75/1.01 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(26,b,27,a)].
% 0.75/1.01 28 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.75/1.01 Derived: greater(A,B) | A = B | greater(B,A). [resolve(28,a,27,a)].
% 0.75/1.01 29 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.75/1.01 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(29,a,26,b)].
% 0.75/1.01 30 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.75/1.02 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(30,b,28,a)].
% 0.75/1.02 31 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.75/1.02 32 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.75/1.02 33 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.75/1.02
% 0.75/1.02 ============================== end predicate elimination =============
% 0.75/1.02
% 0.75/1.02 Auto_denials: (non-Horn, no changes).
% 0.75/1.02
% 0.75/1.02 Term ordering decisions:
% 0.75/1.02 Function symbol KB weights: eta=1. zero=1. c1=1. c2=1. c3=1. c4=1. hazard_of_mortality=1. age=1.
% 0.75/1.02
% 0.75/1.02 ============================== end of process initial clauses ========
% 0.75/1.02
% 0.75/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.02
% 0.75/1.02 ============================== end of clauses for search =============
% 0.75/1.02
% 0.75/1.02 ============================== SEARCH ================================
% 0.75/1.02
% 0.75/1.02 % Starting search at 0.01 seconds.
% 0.75/1.02
% 0.75/1.02 ============================== PROOF =================================
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02 % SZS output start Refutation
% 0.75/1.02
% 0.75/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.02 % Length of proof is 33.
% 0.75/1.02 % Level of proof is 7.
% 0.75/1.02 % Maximum clause weight is 14.000.
% 0.75/1.02 % Given clauses 51.
% 0.75/1.02
% 0.75/1.02 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.75/1.02 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 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.75/1.02 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.75/1.02 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.75/1.02 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(eta,zero) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.02 12 organization(c1) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 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.75/1.02 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.75/1.02 18 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.75/1.02 19 has_endowment(c1) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 20 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom). [clausify(7)].
% 0.75/1.02 26 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.75/1.02 29 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.75/1.02 34 greater(eta,zero) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 35 age(c1,c2) = zero # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 36 smaller_or_equal(age(c1,c3),eta) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 37 greater(age(c1,c4),eta) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 39 -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(theorem_6) # label(negated_conjecture). [clausify(10)].
% 0.75/1.02 42 -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B). [resolve(15,a,12,a)].
% 0.75/1.02 43 -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.75/1.02 44 -greater(age(c1,A),eta) | -has_immunity(c1,A). [resolve(18,a,19,a)].
% 0.75/1.02 45 -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A). [resolve(20,a,19,a)].
% 0.75/1.02 48 -greater(A,B) | smaller_or_equal(B,A). [resolve(29,a,26,b)].
% 0.75/1.02 59 -has_immunity(c1,c4). [ur(44,a,37,a)].
% 0.75/1.02 60 has_immunity(c1,c3). [resolve(45,a,36,a)].
% 0.75/1.02 61 -smaller_or_equal(zero,eta) | has_immunity(c1,c2). [para(35(a,1),45(a,1))].
% 0.75/1.02 70 smaller_or_equal(zero,eta). [resolve(48,a,34,a)].
% 0.75/1.02 71 has_immunity(c1,c2). [back_unit_del(61),unit_del(a,70)].
% 0.75/1.02 78 has_immunity(c1,A) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,c3)). [resolve(60,a,43,a)].
% 0.75/1.02 122 greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)). [resolve(78,a,59,a)].
% 0.75/1.02 127 hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2). [back_unit_del(39),unit_del(a,122)].
% 0.75/1.02 133 $F. [ur(42,b,71,a,c,127,a),unit_del(a,60)].
% 0.75/1.02
% 0.75/1.02 % SZS output end Refutation
% 0.75/1.02 ============================== end of proof ==========================
% 0.75/1.02
% 0.75/1.02 ============================== STATISTICS ============================
% 0.75/1.02
% 0.75/1.02 Given=51. Generated=276. Kept=99. proofs=1.
% 0.75/1.02 Usable=50. Sos=44. Demods=1. Limbo=0, Disabled=46. Hints=0.
% 0.75/1.02 Megabytes=0.14.
% 0.75/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of statistics =====================
% 0.75/1.02
% 0.75/1.02 ============================== end of search =========================
% 0.75/1.02
% 0.75/1.02 THEOREM PROVED
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02
% 0.75/1.02 Exiting with 1 proof.
% 0.75/1.02
% 0.75/1.02 Process 13537 exit (max_proofs) Thu Jun 9 12:17:40 2022
% 0.75/1.02 Prover9 interrupted
%------------------------------------------------------------------------------