TSTP Solution File: MGT060-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT060-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:10 EDT 2022
% Result : Unsatisfiable 150.54s 150.84s
% Output : Refutation 150.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.16 % Problem : MGT060-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.17 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.38 % Computer : n019.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 600
% 0.13/0.38 % DateTime : Thu Jun 9 09:29:55 EDT 2022
% 0.13/0.39 % CPUTime :
% 0.77/1.06 ============================== Prover9 ===============================
% 0.77/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.06 Process 16072 was started by sandbox2 on n019.cluster.edu,
% 0.77/1.06 Thu Jun 9 09:29:56 2022
% 0.77/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15918_n019.cluster.edu".
% 0.77/1.06 ============================== end of head ===========================
% 0.77/1.06
% 0.77/1.06 ============================== INPUT =================================
% 0.77/1.06
% 0.77/1.06 % Reading from file /tmp/Prover9_15918_n019.cluster.edu
% 0.77/1.06
% 0.77/1.06 set(prolog_style_variables).
% 0.77/1.06 set(auto2).
% 0.77/1.06 % set(auto2) -> set(auto).
% 0.77/1.06 % set(auto) -> set(auto_inference).
% 0.77/1.06 % set(auto) -> set(auto_setup).
% 0.77/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.06 % set(auto) -> set(auto_limits).
% 0.77/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.06 % set(auto) -> set(auto_denials).
% 0.77/1.06 % set(auto) -> set(auto_process).
% 0.77/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.06 % set(auto2) -> assign(stats, some).
% 0.77/1.06 % set(auto2) -> clear(echo_input).
% 0.77/1.06 % set(auto2) -> set(quiet).
% 0.77/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.06 % set(auto2) -> clear(print_given).
% 0.77/1.06 assign(lrs_ticks,-1).
% 0.77/1.06 assign(sos_limit,10000).
% 0.77/1.06 assign(order,kbo).
% 0.77/1.06 set(lex_order_vars).
% 0.77/1.06 clear(print_given).
% 0.77/1.06
% 0.77/1.06 % formulas(sos). % not echoed (25 formulas)
% 0.77/1.06
% 0.77/1.06 ============================== end of input ==========================
% 0.77/1.06
% 0.77/1.06 % From the command line: assign(max_seconds, 300).
% 0.77/1.06
% 0.77/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.06
% 0.77/1.06 % Formulas that are not ordinary clauses:
% 0.77/1.06
% 0.77/1.06 ============================== end of process non-clausal formulas ===
% 0.77/1.06
% 0.77/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.06
% 0.77/1.06 ============================== PREDICATE ELIMINATION =================
% 0.77/1.06 1 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_32) # label(axiom). [assumption].
% 0.77/1.06 2 organization(sk1) # label(assumption_3_42) # label(negated_conjecture). [assumption].
% 0.77/1.06 Derived: -has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = very_low. [resolve(1,a,2,a)].
% 0.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 7 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.77/1.06 8 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 150.54/150.84 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(7,a,8,a)].
% 150.54/150.84 9 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 150.54/150.84 Derived: greater(A,B) | B = A | greater(B,A). [resolve(9,a,8,a)].
% 150.54/150.84 10 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 150.54/150.84 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(10,b,7,a)].
% 150.54/150.84 11 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 150.54/150.84 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(11,b,9,a)].
% 150.54/150.84 12 -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(11,b,9,a)].
% 150.54/150.84 13 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 150.54/150.84 14 smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(7,a,8,a)].
% 150.54/150.84 15 -greater(A,B) | smaller_or_equal(B,A). [resolve(10,b,7,a)].
% 150.54/150.84 Derived: A = B | greater(B,A) | A = B | greater(A,B). [resolve(12,a,14,a)].
% 150.54/150.84 16 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 150.54/150.84 17 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 150.54/150.84 18 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 150.54/150.84
% 150.54/150.84 ============================== end predicate elimination =============
% 150.54/150.84
% 150.54/150.84 Auto_denials: (non-Horn, no changes).
% 150.54/150.84
% 150.54/150.84 Term ordering decisions:
% 150.54/150.84 Function symbol KB weights: sk1=1. low=1. high=1. mod1=1. mod2=1. very_low=1. sk2=1. sk3=1. hazard_of_mortality=1.
% 150.54/150.84
% 150.54/150.84 ============================== end of process initial clauses ========
% 150.54/150.84
% 150.54/150.84 ============================== CLAUSES FOR SEARCH ====================
% 150.54/150.84
% 150.54/150.84 ============================== end of clauses for search =============
% 150.54/150.84
% 150.54/150.84 ============================== SEARCH ================================
% 150.54/150.84
% 150.54/150.84 % Starting search at 0.01 seconds.
% 150.54/150.84
% 150.54/150.84 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 25 (0.00 of 4.03 sec).
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=33.000, iters=3413
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=30.000, iters=3380
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=29.000, iters=3351
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=28.000, iters=3351
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=27.000, iters=3501
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=26.000, iters=3334
% 150.54/150.84
% 150.54/150.84 Low Water (keep): wt=24.000, iters=3335
% 150.54/150.84
% 150.54/150.84 ============================== PROOF =================================
% 150.54/150.84 % SZS status Unsatisfiable
% 150.54/150.84 % SZS output start Refutation
% 150.54/150.84
% 150.54/150.84 % Proof 1 at 144.20 (+ 5.59) seconds.
% 150.54/150.84 % Length of proof is 45.
% 150.54/150.84 % Level of proof is 11.
% 150.54/150.84 % Maximum clause weight is 26.000.
% 150.54/150.84 % Given clauses 3779.
% 150.54/150.84
% 150.54/150.84 1 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_32) # label(axiom). [assumption].
% 150.54/150.84 2 organization(sk1) # label(assumption_3_42) # label(negated_conjecture). [assumption].
% 150.54/150.84 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].
% 150.54/150.84 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].
% 150.54/150.84 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].
% 150.54/150.84 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].
% 150.54/150.84 8 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 150.54/150.84 9 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 150.54/150.84 20 greater(mod1,low) # label(assumption_18b_38) # label(axiom). [assumption].
% 150.54/150.84 21 greater(low,very_low) # label(assumption_18c_39) # label(axiom). [assumption].
% 150.54/150.84 22 greater(high,mod2) # label(assumption_18d_40) # label(axiom). [assumption].
% 150.54/150.84 23 greater(mod2,low) # label(assumption_18e_41) # label(axiom). [assumption].
% 150.54/150.84 24 has_immunity(sk1,sk2) # label(assumption_3_43) # label(negated_conjecture). [assumption].
% 150.54/150.84 25 -has_immunity(sk1,sk3) # label(assumption_3_44) # label(negated_conjecture). [assumption].
% 150.54/150.84 26 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict_9) # label(axiom). [assumption].
% 150.54/150.84 27 -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)) # label(assumption_3_45) # label(negated_conjecture). [assumption].
% 150.54/150.84 28 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive_10) # label(axiom). [assumption].
% 150.54/150.84 29 -has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = very_low. [resolve(1,a,2,a)].
% 150.54/150.84 30 has_immunity(sk1,A) | -is_aligned(sk1,A) | -positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = low. [resolve(3,a,2,a)].
% 150.54/150.84 31 has_immunity(sk1,A) | is_aligned(sk1,A) | -positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = mod1. [resolve(4,a,2,a)].
% 150.54/150.84 32 has_immunity(sk1,A) | -is_aligned(sk1,A) | positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = mod2. [resolve(5,a,2,a)].
% 150.54/150.84 33 has_immunity(sk1,A) | is_aligned(sk1,A) | positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = high. [resolve(6,a,2,a)].
% 150.54/150.84 34 greater(A,B) | B = A | greater(B,A). [resolve(9,a,8,a)].
% 150.54/150.84 36 -greater(A,A). [factor(26,a,b)].
% 150.54/150.84 42 -greater(low,A) | greater(mod2,A). [resolve(28,a,23,a)].
% 150.54/150.84 43 -greater(mod2,A) | greater(high,A). [resolve(28,a,22,a)].
% 150.54/150.84 44 -greater(very_low,A) | greater(low,A). [resolve(28,a,21,a)].
% 150.54/150.84 45 -greater(low,A) | greater(mod1,A). [resolve(28,a,20,a)].
% 150.54/150.84 52 hazard_of_mortality(sk1,sk2) = very_low. [resolve(29,a,24,a)].
% 150.54/150.84 53 -greater(hazard_of_mortality(sk1,sk3),very_low). [back_rewrite(27),rewrite([52(6)])].
% 150.54/150.84 54 has_immunity(sk1,A) | is_aligned(sk1,A) | hazard_of_mortality(sk1,A) = high | hazard_of_mortality(sk1,A) = mod1. [resolve(33,c,31,c),merge(d),merge(e)].
% 150.54/150.84 63 greater(mod2,very_low). [resolve(42,a,21,a)].
% 150.54/150.84 67 greater(high,very_low). [resolve(43,a,63,a)].
% 150.54/150.84 70 greater(low,A) | greater(A,very_low) | very_low = A. [resolve(44,a,34,c)].
% 150.54/150.84 77 greater(mod1,very_low). [resolve(45,a,21,a)].
% 150.54/150.84 99 has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = high | hazard_of_mortality(sk1,A) = mod1 | positional_advantage(sk1,A) | hazard_of_mortality(sk1,A) = mod2. [resolve(54,b,32,b),merge(d)].
% 150.54/150.84 127 greater(low,hazard_of_mortality(sk1,sk3)) | hazard_of_mortality(sk1,sk3) = very_low. [resolve(70,b,53,a),flip(b)].
% 150.54/150.84 389 has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = high | hazard_of_mortality(sk1,A) = mod1 | hazard_of_mortality(sk1,A) = mod2 | -is_aligned(sk1,A) | hazard_of_mortality(sk1,A) = low. [resolve(99,d,30,c),merge(e)].
% 150.54/150.84 3090 has_immunity(sk1,A) | hazard_of_mortality(sk1,A) = high | hazard_of_mortality(sk1,A) = mod1 | hazard_of_mortality(sk1,A) = mod2 | hazard_of_mortality(sk1,A) = low. [resolve(389,e,54,b),merge(f),merge(g),merge(h)].
% 150.54/150.84 13134 hazard_of_mortality(sk1,sk3) = high | hazard_of_mortality(sk1,sk3) = mod1 | hazard_of_mortality(sk1,sk3) = mod2 | hazard_of_mortality(sk1,sk3) = low. [resolve(3090,a,25,a)].
% 150.54/150.84 13135 hazard_of_mortality(sk1,sk3) = high | hazard_of_mortality(sk1,sk3) = mod1 | hazard_of_mortality(sk1,sk3) = low. [para(13134(c,1),53(a,1)),unit_del(d,63)].
% 150.54/150.84 13136 hazard_of_mortality(sk1,sk3) = high | hazard_of_mortality(sk1,sk3) = low. [para(13135(b,1),53(a,1)),unit_del(c,77)].
% 150.54/150.84 13137 hazard_of_mortality(sk1,sk3) = low. [para(13136(a,1),53(a,1)),unit_del(b,67)].
% 150.54/150.84 13394 very_low = low. [back_rewrite(127),rewrite([13137(4),13137(6)]),flip(b),unit_del(a,36)].
% 150.54/150.84 13611 $F. [back_rewrite(21),rewrite([13394(2)]),unit_del(a,36)].
% 150.54/150.84
% 150.54/150.84 % SZS output end Refutation
% 150.54/150.84 ============================== end of proof ==========================
% 150.54/150.84
% 150.54/150.84 ============================== STATISTICS ============================
% 150.54/150.84
% 150.54/150.84 Given=3779. Generated=10969036. Kept=13591. proofs=1.
% 150.54/150.84 Usable=1582. Sos=4079. Demods=3. Limbo=217, Disabled=7748. Hints=0.
% 150.54/150.84 Megabytes=9.81.
% 150.54/150.84 User_CPU=144.20, System_CPU=5.59, Wall_clock=149.
% 150.54/150.84
% 150.54/150.84 ============================== end of statistics =====================
% 150.54/150.84
% 150.54/150.84 ============================== end of search =========================
% 150.54/150.84
% 150.54/150.84 THEOREM PROVED
% 150.54/150.84 % SZS status Unsatisfiable
% 150.54/150.84
% 150.54/150.84 Exiting with 1 proof.
% 150.54/150.84
% 150.54/150.84 Process 16072 exit (max_proofs) Thu Jun 9 09:32:25 2022
% 150.54/150.84 Prover9 interrupted
%------------------------------------------------------------------------------