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 : 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:11 EDT 2022
% Result : Timeout 300.02s 300.29s
% 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.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 09:22:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 5679 was started by sandbox on n019.cluster.edu,
% 0.43/1.01 Thu Jun 9 09:22:55 2022
% 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5525_n019.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_5525_n019.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (20 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/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.43/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.43/1.01 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.43/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.43/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.43/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.43/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.43/1.01 8 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 9 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 10 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 11 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 12 (all X (robust_position(X) <-> (all T ((smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)) & (greater(age(X,T),tau) -> positional_advantage(X,T)))))) # label(definition_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 13 (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.43/1.01 14 -(all X all T0 all T1 all T2 all T3 (organization(X) & robust_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & smaller(sigma,tau) & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) & smaller_or_equal(age(X,T2),tau) & greater(age(X,T3),tau) -> smaller(hazard_of_mortality(X,T3),hazard_of_mortality(X,T1)) & smaller(hazard_of_mortality(X,T1),hazard_of_mortality(X,T2)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_9) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(8)].
% 0.43/1.01 16 organization(c1) # label(theorem_9) # label(negated_conjecture). [clausify(14)].
% 0.43/1.01 17 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom). [clausify(7)].
% 0.43/1.01 18 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(9)].
% 0.43/1.01 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 0.43/1.01 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(15,a,18,b)].
% 0.43/1.01 19 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(10)].
% 0.43/1.01 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(19,a,16,a)].
% 0.43/1.01 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(19,a,17,b)].
% 0.43/1.01 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(19,a,18,b)].
% 0.43/1.01 20 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(13)].
% 0.43/1.01 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(20,a,16,a)].
% 0.43/1.01 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(20,a,17,b)].
% 0.43/1.01 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(20,a,18,b)].
% 0.43/1.01 21 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(9)].
% 0.43/1.01 Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(21,b,16,a)].
% 0.43/1.01 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -has_endowment(A). [resolve(21,b,17,b)].
% 0.43/1.01 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(21,b,18,b)].
% 0.43/1.01 22 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(9)].
% 0.43/1.01 Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(22,b,16,a)].
% 0.43/1.01 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -has_endowment(A). [resolve(22,b,17,b)].
% 0.43/1.01 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(22,b,18,b)].
% 0.43/1.01 23 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.43/1.01 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(23,b,16,a)].
% 0.43/1.01 Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C). [resolve(23,b,18,b)].
% 0.43/1.01 24 has_endowment(A) | -organization(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom). [clausify(7)].
% 0.43/1.01 25 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.43/1.01 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(25,b,16,a)].
% 0.43/1.01 Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C). [resolve(25,b,18,b)].
% 0.43/1.01 26 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(11)].
% 0.43/1.01 Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(26,a,16,a)].
% 0.43/1.01 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(26,a,17,b)].
% 0.43/1.01 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(26,a,18,b)].
% 0.43/1.01 27 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(11)].
% 0.43/1.01 Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B). [resolve(27,a,16,a)].
% 0.43/1.01 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -has_endowment(A). [resolve(27,a,17,b)].
% 0.43/1.01 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(27,a,18,b)].
% 0.43/1.01 28 -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(13)].
% 0.43/1.01 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(28,a,16,a)].
% 0.43/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A). [resolve(28,a,17,b)].
% 0.43/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(28,a,18,b)].
% 0.43/1.01 29 -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(13)].
% 0.43/1.01 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(29,a,16,a)].
% 0.43/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(29,a,17,b)].
% 0.43/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(29,a,18,b)].
% 0.43/1.01 30 -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(13)].
% 0.43/1.01 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(30,a,16,a)].
% 0.43/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(30,a,17,b)].
% 0.43/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(30,a,18,b)].
% 0.43/1.01 31 -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(13)].
% 0.43/1.01 Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(31,a,16,a)].
% 0.43/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(31,a,17,b)].
% 0.43/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(31,a,18,b)].
% 0.43/1.01 32 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(12)].
% 0.43/1.01 33 robust_position(c1) # label(theorem_9) # label(negatedCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------