TSTP Solution File: MGT063-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT063-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:11 EDT 2022
% Result : Timeout 300.08s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT063-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n026.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 12:08:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 8611 was started by sandbox2 on n026.cluster.edu,
% 0.44/1.00 Thu Jun 9 12:08:03 2022
% 0.44/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8306_n026.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_8306_n026.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (58 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00
% 0.44/1.00 ============================== end of process non-clausal formulas ===
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00
% 0.44/1.00 ============================== PREDICATE ELIMINATION =================
% 0.44/1.00 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_46) # label(axiom). [assumption].
% 0.44/1.00 2 organization(sk3) # label(theorem_9_74) # label(negated_conjecture). [assumption].
% 0.44/1.00 3 -has_endowment(A) | organization(A) # label(definition_1_39) # label(axiom). [assumption].
% 0.44/1.00 4 -dissimilar(A,B,C) | organization(A) # label(definition_2_47) # label(axiom). [assumption].
% 0.44/1.00 Derived: has_endowment(sk3) | -has_immunity(sk3,A). [resolve(1,a,2,a)].
% 0.44/1.00 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(1,a,4,b)].
% 0.44/1.00 5 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_54) # label(axiom). [assumption].
% 0.44/1.00 Derived: age(sk3,A) != zero | is_aligned(sk3,A). [resolve(5,a,2,a)].
% 0.44/1.00 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(5,a,3,b)].
% 0.44/1.00 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(5,a,4,b)].
% 0.44/1.00 6 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_63) # label(axiom). [assumption].
% 0.44/1.00 Derived: -has_immunity(sk3,A) | hazard_of_mortality(sk3,A) = very_low. [resolve(6,a,2,a)].
% 0.44/1.00 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(6,a,3,b)].
% 0.44/1.00 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(6,a,4,b)].
% 0.44/1.00 7 -organization(A) | -has_immunity(A,sk1(A)) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_45) # label(axiom). [assumption].
% 0.44/1.00 8 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,B,C) # label(definition_2_50) # label(axiom). [assumption].
% 0.44/1.00 9 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_51) # label(axiom). [assumption].
% 0.44/1.00 Derived: -is_aligned(sk3,A) | is_aligned(sk3,B) | dissimilar(sk3,A,B). [resolve(9,a,2,a)].
% 0.44/1.00 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A). [resolve(9,a,3,b)].
% 0.44/1.00 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(9,a,4,b)].
% 0.44/1.00 10 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_52) # label(axiom). [assumption].
% 0.44/1.00 Derived: -is_aligned(sk3,A) | is_aligned(sk3,B) | dissimilar(sk3,B,A). [resolve(10,a,2,a)].
% 0.44/1.00 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -has_endowment(A). [resolve(10,a,3,b)].
% 0.44/1.00 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(10,a,4,b)].
% 0.44/1.00 11 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,C,B) # label(definition_2_53) # label(axiom). [assumption].
% 0.44/1.00 12 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_43) # label(axiom). [assumption].
% 0.44/1.00 Derived: smaller_or_equal(age(sk3,sk1(sk3)),eta) | has_immunity(sk3,sk1(sk3)) | has_endowment(sk3). [resolve(12,a,2,a)].
% 0.44/1.00 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) | -dissimilar(A,B,C). [resolve(12,a,4,b)].
% 0.44/1.00 13 -organization(A) | -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_44) # label(axiom). [assumption].
% 0.44/1.00 14 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_42) # label(axiom). [assumption].
% 0.44/1.00 Derived: smaller_or_equal(age(sk3,sk1(sk3)),eta) | greater(age(sk3,sk1(sk3)),eta) | has_endowment(sk3). [resolve(14,a,2,a)].
% 0.44/1.00 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) | -dissimilar(A,B,C). [resolve(14,a,4,b)].
% 0.44/1.00 15 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_55) # label(axiom). [assumption].
% 0.44/1.00 Derived: age(sk3,A) != zero | -greater(age(sk3,B),sigma) | dissimilar(sk3,A,B). [resolve(15,a,2,a)].
% 0.44/1.00 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(15,a,3,b)].
% 0.44/1.00 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(15,a,4,b)].
% 0.44/1.00 16 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_56) # label(axiom). [assumption].
% 0.44/1.00 Derived: age(sk3,A) != zero | -dissimilar(sk3,A,B) | greater(age(sk3,B),sigma). [resolve(16,a,2,a)].
% 0.44/1.00 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -has_endowment(A). [resolve(16,a,3,b)].
% 0.44/1.00 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(16,a,4,b)].
% 0.44/1.00 17 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_64) # label(axiom). [assumption].
% 0.44/1.00 Derived: has_immunity(sk3,A) | -is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = low. [resolve(17,a,2,a)].
% 0.44/1.00 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A). [resolve(17,a,3,b)].
% 0.44/1.00 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(17,a,4,b)].
% 0.44/1.00 18 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_65) # label(axiom). [assumption].
% 0.44/1.00 Derived: has_immunity(sk3,A) | is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod1. [resolve(18,a,2,a)].
% 0.44/1.00 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(18,a,3,b)].
% 0.44/1.00 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(18,a,4,b)].
% 0.44/1.00 19 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17_66) # label(axiom). [assumption].
% 0.44/1.01 Derived: has_immunity(sk3,A) | -is_aligned(sk3,A) | positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod2. [resolve(19,a,2,a)].
% 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A). [resolve(19,a,3,b)].
% 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(19,a,4,b)].
% 0.44/1.01 20 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_67) # label(axiom). [assumption].
% 0.44/1.01 Derived: has_immunity(sk3,A) | is_aligned(sk3,A) | positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = high. [resolve(20,a,2,a)].
% 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A). [resolve(20,a,3,b)].
% 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(20,a,4,b)].
% 0.44/1.01 21 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4_57) # label(axiom). [assumption].
% 0.44/1.01 22 robust_position(sk3) # label(theorem_9_75) # label(negated_conjecture). [assumption].
% 0.44/1.01 23 positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau) | robust_position(A) # label(definition_4_61) # label(axiom). [assumption].
% 0.44/1.01 24 smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau) | robust_position(A) # label(definition_4_59) # label(axiom). [assumption].
% 0.44/1.01 Derived: -smaller_or_equal(age(sk3,A),tau) | -positional_advantage(sk3,A). [resolve(21,a,22,a)].
% 0.44/1.01 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau). [resolve(21,a,23,c)].
% 0.44/1.01 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau). [resolve(21,a,24,c)].
% 0.44/1.01 25 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4_58) # label(axiom). [assumption].
% 0.44/1.01 Derived: -greater(age(sk3,A),tau) | positional_advantage(sk3,A). [resolve(25,a,22,a)].
% 0.44/1.01 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau). [resolve(25,a,23,c)].
% 0.44/1.01 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau). [resolve(25,a,24,c)].
% 0.44/1.01 26 positional_advantage(A,sk2(A)) | -positional_advantage(A,sk2(A)) | robust_position(A) # label(definition_4_62) # label(axiom). [assumption].
% 0.44/1.01 27 smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | robust_position(A) # label(definition_4_60) # label(axiom). [assumption].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B). [resolve(27,c,21,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | -greater(age(A,B),tau) | positional_advantage(A,B). [resolve(27,c,25,a)].
% 0.44/1.01 28 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.44/1.01 29 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.44/1.01 30 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials: (non-Horn, no changes).
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01 Function symbol KB weights: sk3=1. tau=1. zero=1. sigma=1. eta=1. low=1. mod1=1. mod2=1. high=1. very_low=1. sk6=1. sk4=1. sk5=1. sk7=1. age=1. hazard_of_mortality=1. sk2=1. sk1=1.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 =============Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------