TSTP Solution File: MGT059+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT059+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:10 EDT 2022
% Result : Theorem 0.46s 0.79s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : MGT059+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Thu Jun 9 08:20:22 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.46/0.78 ============================== Prover9 ===============================
% 0.46/0.78 Prover9 (32) version 2009-11A, November 2009.
% 0.46/0.78 Process 15601 was started by sandbox2 on n032.cluster.edu,
% 0.46/0.78 Thu Jun 9 08:20:23 2022
% 0.46/0.78 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15448_n032.cluster.edu".
% 0.46/0.78 ============================== end of head ===========================
% 0.46/0.78
% 0.46/0.78 ============================== INPUT =================================
% 0.46/0.78
% 0.46/0.78 % Reading from file /tmp/Prover9_15448_n032.cluster.edu
% 0.46/0.78
% 0.46/0.78 set(prolog_style_variables).
% 0.46/0.78 set(auto2).
% 0.46/0.78 % set(auto2) -> set(auto).
% 0.46/0.78 % set(auto) -> set(auto_inference).
% 0.46/0.78 % set(auto) -> set(auto_setup).
% 0.46/0.78 % set(auto_setup) -> set(predicate_elim).
% 0.46/0.78 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/0.78 % set(auto) -> set(auto_limits).
% 0.46/0.78 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/0.78 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/0.78 % set(auto) -> set(auto_denials).
% 0.46/0.78 % set(auto) -> set(auto_process).
% 0.46/0.78 % set(auto2) -> assign(new_constants, 1).
% 0.46/0.78 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/0.78 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/0.78 % set(auto2) -> assign(max_hours, 1).
% 0.46/0.78 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/0.78 % set(auto2) -> assign(max_seconds, 0).
% 0.46/0.78 % set(auto2) -> assign(max_minutes, 5).
% 0.46/0.78 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/0.78 % set(auto2) -> set(sort_initial_sos).
% 0.46/0.78 % set(auto2) -> assign(sos_limit, -1).
% 0.46/0.78 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/0.78 % set(auto2) -> assign(max_megs, 400).
% 0.46/0.78 % set(auto2) -> assign(stats, some).
% 0.46/0.78 % set(auto2) -> clear(echo_input).
% 0.46/0.78 % set(auto2) -> set(quiet).
% 0.46/0.78 % set(auto2) -> clear(print_initial_clauses).
% 0.46/0.78 % set(auto2) -> clear(print_given).
% 0.46/0.78 assign(lrs_ticks,-1).
% 0.46/0.78 assign(sos_limit,10000).
% 0.46/0.78 assign(order,kbo).
% 0.46/0.78 set(lex_order_vars).
% 0.46/0.78 clear(print_given).
% 0.46/0.78
% 0.46/0.78 % formulas(sos). % not echoed (8 formulas)
% 0.46/0.78
% 0.46/0.78 ============================== end of input ==========================
% 0.46/0.78
% 0.46/0.78 % From the command line: assign(max_seconds, 300).
% 0.46/0.78
% 0.46/0.78 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/0.79
% 0.46/0.79 % Formulas that are not ordinary clauses:
% 0.46/0.79 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.46/0.79 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.46/0.79 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.79 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.79 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.46/0.79 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.46/0.79 7 (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.46/0.79 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(negated_conjecture) # label(non_clause). [assumption].
% 0.46/0.79
% 0.46/0.79 ============================== end of process non-clausal formulas ===
% 0.46/0.79
% 0.46/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/0.79
% 0.46/0.79 ============================== PREDICATE ELIMINATION =================
% 0.46/0.79 9 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(7)].
% 0.46/0.79 10 organization(c1) # label(assumption_2) # label(negated_conjecture). [clausify(8)].
% 0.46/0.79 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(9,a,10,a)].
% 0.46/0.79 11 -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(7)].
% 0.46/0.79 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(11,a,10,a)].
% 0.46/0.79 12 -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(7)].
% 0.46/0.79 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(12,a,10,a)].
% 0.46/0.79 13 -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(7)].
% 0.46/0.79 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(13,a,10,a)].
% 0.46/0.79 14 -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(7)].
% 0.46/0.79 Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(14,a,10,a)].
% 0.46/0.79 15 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.46/0.79 16 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.46/0.79 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(15,b,16,a)].
% 0.46/0.79 17 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.46/0.79 Derived: greater(A,B) | A = B | greater(B,A). [resolve(17,a,16,a)].
% 0.46/0.79 18 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.46/0.79 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(18,a,15,b)].
% 0.46/0.79 19 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.46/0.79 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(19,b,17,a)].
% 0.46/0.79 20 -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(19,b,17,a)].
% 0.46/0.79 21 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.46/0.79 22 smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(15,b,16,a)].
% 0.46/0.79 23 -greater(A,B) | smaller_or_equal(B,A). [resolve(18,a,15,b)].
% 0.46/0.79 Derived: A = B | greater(A,B) | A = B | greater(B,A). [resolve(20,a,22,a)].
% 0.46/0.79 24 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.46/0.79 25 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.46/0.79 26 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.46/0.79
% 0.46/0.79 ============================== end predicate elimination =============
% 0.46/0.79
% 0.46/0.79 Auto_denials: (non-Horn, no changes).
% 0.46/0.79
% 0.46/0.79 Term ordering decisions:
% 0.46/0.79 Function symbol KB weights: high=1. low=1. mod1=1. mod2=1. very_low=1. c1=1. c2=1. c3=1. hazard_of_mortality=1.
% 0.46/0.79
% 0.46/0.79 ============================== end of process initial clauses ========
% 0.46/0.79
% 0.46/0.79 ============================== CLAUSES FOR SEARCH ====================
% 0.46/0.79
% 0.46/0.79 ============================== end of clauses for search =============
% 0.46/0.79
% 0.46/0.79 ============================== SEARCH ================================
% 0.46/0.79
% 0.46/0.79 % Starting search at 0.01 seconds.
% 0.46/0.79
% 0.46/0.79 ============================== PROOF =================================
% 0.46/0.79 % SZS status Theorem
% 0.46/0.79 % SZS output start Refutation
% 0.46/0.79
% 0.46/0.79 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/0.79 % Length of proof is 14.
% 0.46/0.79 % Level of proof is 5.
% 0.46/0.79 % Maximum clause weight is 8.000.
% 0.46/0.79 % Given clauses 5.
% 0.46/0.79
% 0.46/0.79 7 (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.46/0.79 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(negated_conjecture) # label(non_clause). [assumption].
% 0.46/0.79 9 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(7)].
% 0.46/0.79 10 organization(c1) # label(assumption_2) # label(negated_conjecture). [clausify(8)].
% 0.46/0.79 27 has_immunity(c1,c2) # label(assumption_2) # label(negated_conjecture). [clausify(8)].
% 0.46/0.79 28 has_immunity(c1,c3) # label(assumption_2) # label(negated_conjecture). [clausify(8)].
% 0.46/0.79 30 hazard_of_mortality(c1,c2) != hazard_of_mortality(c1,c3) # label(assumption_2) # label(negated_conjecture). [clausify(8)].
% 0.46/0.79 31 hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2). [copy(30),flip(a)].
% 0.46/0.79 33 -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(9,a,10,a)].
% 0.46/0.79 41 hazard_of_mortality(c1,c3) = c_0. [new_symbol(31)].
% 0.46/0.79 42 hazard_of_mortality(c1,c2) != c_0. [back_rewrite(31),rewrite([41(3)]),flip(a)].
% 0.46/0.79 43 c_0 = very_low. [resolve(33,a,28,a),rewrite([41(3)])].
% 0.46/0.79 44 hazard_of_mortality(c1,c2) = very_low. [resolve(33,a,27,a)].
% 0.46/0.79 45 $F. [back_rewrite(42),rewrite([44(3),43(2)]),xx(a)].
% 0.46/0.79
% 0.46/0.79 % SZS output end Refutation
% 0.46/0.79 ============================== end of proof ==========================
% 0.46/0.79
% 0.46/0.79 ============================== STATISTICS ============================
% 0.46/0.79
% 0.46/0.79 Given=5. Generated=20. Kept=16. proofs=1.
% 0.46/0.79 Usable=5. Sos=7. Demods=3. Limbo=2, Disabled=32. Hints=0.
% 0.46/0.79 Megabytes=0.06.
% 0.46/0.79 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/0.79
% 0.46/0.79 ============================== end of statistics =====================
% 0.46/0.79
% 0.46/0.79 ============================== end of search =========================
% 0.46/0.79
% 0.46/0.79 THEOREM PROVED
% 0.46/0.79 % SZS status Theorem
% 0.46/0.79
% 0.46/0.79 Exiting with 1 proof.
% 0.46/0.79
% 0.46/0.79 Process 15601 exit (max_proofs) Thu Jun 9 08:20:23 2022
% 0.46/0.79 Prover9 interrupted
%------------------------------------------------------------------------------