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 : n017.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 : Unsatisfiable 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT059-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 08:00:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 12644 was started by sandbox on n017.cluster.edu,
% 0.43/0.98 Thu Jun 9 08:00:34 2022
% 0.43/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12491_n017.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_12491_n017.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (20 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98 1 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_32) # label(axiom). [assumption].
% 0.43/0.98 2 organization(sk1) # label(assumption_2_37) # label(negated_conjecture). [assumption].
% 0.43/0.98 Derived: -has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = very_low. [resolve(1,a,2,a)].
% 0.43/0.98 3 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_33) # label(axiom). [assumption].
% 0.43/0.98 Derived: has_immunity(sk1,A) | -is_aligned(sk1,A) | -positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = low. [resolve(3,a,2,a)].
% 0.43/0.98 4 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_34) # label(axiom). [assumption].
% 0.43/0.98 Derived: has_immunity(sk1,A) | is_aligned(sk1,A) | -positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = mod1. [resolve(4,a,2,a)].
% 0.43/0.98 5 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17_35) # label(axiom). [assumption].
% 0.43/0.98 Derived: has_immunity(sk1,A) | -is_aligned(sk1,A) | positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = mod2. [resolve(5,a,2,a)].
% 0.43/0.98 6 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_36) # label(axiom). [assumption].
% 0.43/0.98 Derived: has_immunity(sk1,A) | is_aligned(sk1,A) | positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = high. [resolve(6,a,2,a)].
% 0.43/0.98 7 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.43/0.98 8 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.43/0.98 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(7,a,8,a)].
% 0.43/0.98 9 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.43/0.98 Derived: greater(A,B) | B = A | greater(B,A). [resolve(9,a,8,a)].
% 0.43/0.98 10 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.43/0.98 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(10,b,7,a)].
% 0.43/0.98 11 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.43/0.98 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(11,b,9,a)].
% 0.43/0.98 12 -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(11,b,9,a)].
% 0.43/0.98 13 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.43/0.98 14 smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(7,a,8,a)].
% 0.43/0.98 15 -greater(A,B) | smaller_or_equal(B,A). [resolve(10,b,7,a)].
% 0.43/0.98 Derived: A = B | greater(B,A) | A = B | greater(A,B). [resolve(12,a,14,a)].
% 0.43/0.98 16 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.43/0.98 17 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.43/0.98 18 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials: (non-Horn, no changes).
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights: sk1=1. high=1. low=1. mod1=1. mod2=1. sk2=1. sk3=1. very_low=1. hazard_of_mortality=1.
% 0.43/0.98
% 0.43/0.98 ============================== end of process initial clauses ========
% 0.43/0.98
% 0.43/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98
% 0.43/0.98 ============================== end of clauses for search =============
% 0.43/0.98
% 0.43/0.98 ============================== SEARCH ================================
% 0.43/0.98
% 0.43/0.98 % Starting search at 0.01 seconds.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.98 % Length of proof is 12.
% 0.43/0.98 % Level of proof is 4.
% 0.43/0.98 % Maximum clause weight is 8.000.
% 0.43/0.98 % Given clauses 5.
% 0.43/0.98
% 0.43/0.98 1 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_32) # label(axiom). [assumption].
% 0.43/0.98 2 organization(sk1) # label(assumption_2_37) # label(negated_conjecture). [assumption].
% 0.43/0.98 19 has_immunity(sk1,sk2) # label(assumption_2_38) # label(negated_conjecture). [assumption].
% 0.43/0.98 20 has_immunity(sk1,sk3) # label(assumption_2_39) # label(negated_conjecture). [assumption].
% 0.43/0.98 22 hazard_of_mortality(sk1,sk2) != hazard_of_mortality(sk1,sk3) # label(assumption_2_40) # label(negated_conjecture). [assumption].
% 0.43/0.98 23 hazard_of_mortality(sk1,sk3) != hazard_of_mortality(sk1,sk2). [copy(22),flip(a)].
% 0.43/0.98 25 -has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = very_low. [resolve(1,a,2,a)].
% 0.43/0.98 33 hazard_of_mortality(sk1,sk3) = c_0. [new_symbol(23)].
% 0.43/0.98 34 hazard_of_mortality(sk1,sk2) != c_0. [back_rewrite(23),rewrite([33(3)]),flip(a)].
% 0.43/0.98 35 c_0 = very_low. [resolve(25,a,20,a),rewrite([33(3)])].
% 0.43/0.98 36 hazard_of_mortality(sk1,sk2) = very_low. [resolve(25,a,19,a)].
% 0.43/0.98 37 $F. [back_rewrite(34),rewrite([36(3),35(2)]),xx(a)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=5. Generated=20. Kept=16. proofs=1.
% 0.43/0.98 Usable=5. Sos=7. Demods=3. Limbo=2, Disabled=32. Hints=0.
% 0.43/0.98 Megabytes=0.04.
% 0.43/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 12644 exit (max_proofs) Thu Jun 9 08:00:34 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------