TSTP Solution File: MGT054-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT054-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:08 EDT 2022
% Result : Unsatisfiable 0.68s 0.99s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT054-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 12:46:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.68/0.98 ============================== Prover9 ===============================
% 0.68/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.98 Process 20134 was started by sandbox on n020.cluster.edu,
% 0.68/0.98 Thu Jun 9 12:46:07 2022
% 0.68/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19977_n020.cluster.edu".
% 0.68/0.98 ============================== end of head ===========================
% 0.68/0.98
% 0.68/0.98 ============================== INPUT =================================
% 0.68/0.98
% 0.68/0.98 % Reading from file /tmp/Prover9_19977_n020.cluster.edu
% 0.68/0.98
% 0.68/0.98 set(prolog_style_variables).
% 0.68/0.98 set(auto2).
% 0.68/0.98 % set(auto2) -> set(auto).
% 0.68/0.98 % set(auto) -> set(auto_inference).
% 0.68/0.98 % set(auto) -> set(auto_setup).
% 0.68/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.98 % set(auto) -> set(auto_limits).
% 0.68/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.98 % set(auto) -> set(auto_denials).
% 0.68/0.98 % set(auto) -> set(auto_process).
% 0.68/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.98 % set(auto2) -> assign(stats, some).
% 0.68/0.98 % set(auto2) -> clear(echo_input).
% 0.68/0.98 % set(auto2) -> set(quiet).
% 0.68/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.98 % set(auto2) -> clear(print_given).
% 0.68/0.98 assign(lrs_ticks,-1).
% 0.68/0.98 assign(sos_limit,10000).
% 0.68/0.98 assign(order,kbo).
% 0.68/0.98 set(lex_order_vars).
% 0.68/0.98 clear(print_given).
% 0.68/0.98
% 0.68/0.98 % formulas(sos). % not echoed (32 formulas)
% 0.68/0.98
% 0.68/0.98 ============================== end of input ==========================
% 0.68/0.98
% 0.68/0.98 % From the command line: assign(max_seconds, 300).
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.98
% 0.68/0.98 % Formulas that are not ordinary clauses:
% 0.68/0.98
% 0.68/0.98 ============================== end of process non-clausal formulas ===
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.98
% 0.68/0.98 ============================== PREDICATE ELIMINATION =================
% 0.68/0.98 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_38) # label(axiom). [assumption].
% 0.68/0.98 2 organization(sk1) # label(theorem_5_52) # label(negated_conjecture). [assumption].
% 0.68/0.98 3 -dissimilar(A,B,C) | organization(A) # label(definition_2_40) # label(axiom). [assumption].
% 0.68/0.98 Derived: has_endowment(sk1) | -has_immunity(sk1,A). [resolve(1,a,2,a)].
% 0.68/0.98 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(1,a,3,b)].
% 0.68/0.98 4 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_47) # label(axiom). [assumption].
% 0.68/0.98 Derived: age(sk1,A) != zero | is_aligned(sk1,A). [resolve(4,a,2,a)].
% 0.68/0.98 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(4,a,3,b)].
% 0.68/0.98 5 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,B,C) # label(definition_2_43) # label(axiom). [assumption].
% 0.68/0.98 6 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_44) # label(axiom). [assumption].
% 0.68/0.98 Derived: -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,A,B). [resolve(6,a,2,a)].
% 0.68/0.98 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(6,a,3,b)].
% 0.68/0.98 7 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_45) # label(axiom). [assumption].
% 0.68/0.98 Derived: -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,B,A). [resolve(7,a,2,a)].
% 0.68/0.98 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(7,a,3,b)].
% 0.68/0.98 8 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,C,B) # label(definition_2_46) # label(axiom). [assumption].
% 0.68/0.98 9 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3_39) # label(axiom). [assumption].
% 0.68/0.99 Derived: -has_immunity(sk1,A) | has_immunity(sk1,B) | greater(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [resolve(9,a,2,a)].
% 0.68/0.99 Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -dissimilar(A,D,E). [resolve(9,a,3,b)].
% 0.68/0.99 10 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) # label(assumption_14_48) # label(axiom). [assumption].
% 0.68/0.99 Derived: -is_aligned(sk1,A) | is_aligned(sk1,B) | greater(capability(sk1,A),capability(sk1,B)). [resolve(10,a,2,a)].
% 0.68/0.99 Derived: -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -dissimilar(A,D,E). [resolve(10,a,3,b)].
% 0.68/0.99 11 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_49) # label(axiom). [assumption].
% 0.68/0.99 Derived: age(sk1,A) != zero | -greater(age(sk1,B),sigma) | dissimilar(sk1,A,B). [resolve(11,a,2,a)].
% 0.68/0.99 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(11,a,3,b)].
% 0.68/0.99 12 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_50) # label(axiom). [assumption].
% 0.68/0.99 Derived: age(sk1,A) != zero | -dissimilar(sk1,A,B) | greater(age(sk1,B),sigma). [resolve(12,a,2,a)].
% 0.68/0.99 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(12,a,3,b)].
% 0.68/0.99 13 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_16_51) # label(axiom). [assumption].
% 0.68/0.99 Derived: has_immunity(sk1,A) | has_immunity(sk1,B) | -greater(capability(sk1,B),capability(sk1,A)) | greater(hazard_of_mortality(sk1,A),hazard_of_mortality(sk1,B)). [resolve(13,a,2,a)].
% 0.68/0.99 Derived: has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) | -dissimilar(A,D,E). [resolve(13,a,3,b)].
% 0.68/0.99 14 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.68/0.99 15 smaller_or_equal(age(sk1,sk3),sigma) # label(theorem_5_55) # label(negated_conjecture). [assumption].
% 0.68/0.99 16 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.68/0.99 17 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.68/0.99 Derived: smaller(age(sk1,sk3),sigma) | age(sk1,sk3) = sigma. [resolve(14,a,15,a)].
% 0.68/0.99 18 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.68/0.99 19 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.68/0.99 Derived: greater(A,B) | B = A | greater(B,A). [resolve(18,a,19,a)].
% 0.68/0.99 20 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.68/0.99 21 smaller(age(sk1,sk3),sigma) | age(sk1,sk3) = sigma. [resolve(14,a,15,a)].
% 0.68/0.99 Derived: age(sk1,sk3) = sigma | greater(sigma,age(sk1,sk3)). [resolve(21,a,18,a)].
% 0.68/0.99 22 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.68/0.99 23 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.68/0.99 24 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.68/0.99
% 0.68/0.99 ============================== end predicate elimination =============
% 0.68/0.99
% 0.68/0.99 Auto_denials: (non-Horn, no changes).
% 0.68/0.99
% 0.68/0.99 Term ordering decisions:
% 0.68/0.99 Function symbol KB weights: sk1=1. sigma=1. zero=1. sk3=1. sk2=1. sk4=1. age=1. capability=1. hazard_of_mortality=1.
% 0.68/0.99
% 0.68/0.99 ============================== end of process initial clauses ========
% 0.68/0.99
% 0.68/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.99
% 0.68/0.99 ============================== end of clauses for search =============
% 0.68/0.99
% 0.68/0.99 ============================== SEARCH ================================
% 0.68/0.99
% 0.68/0.99 % Starting search at 0.02 seconds.
% 0.68/0.99
% 0.68/0.99 ============================== PROOF =================================
% 0.68/0.99 % SZS status Unsatisfiable
% 0.68/0.99 % SZS output start Refutation
% 0.68/0.99
% 0.68/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.68/0.99 % Length of proof is 43.
% 0.68/0.99 % Level of proof is 8.
% 0.68/0.99 % Maximum clause weight is 18.000.
% 0.68/0.99 % Given clauses 52.
% 0.68/0.99
% 0.68/0.99 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_38) # label(axiom). [assumption].
% 0.68/0.99 2 organization(sk1) # label(theorem_5_52) # label(negated_conjecture). [assumption].
% 0.68/0.99 3 -dissimilar(A,B,C) | organization(A) # label(definition_2_40) # label(axiom). [assumption].
% 0.68/0.99 4 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_47) # label(axiom). [assumption].
% 0.68/0.99 6 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_44) # label(axiom). [assumption].
% 0.68/0.99 10 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) # label(assumption_14_48) # label(axiom). [assumption].
% 0.68/0.99 11 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_49) # label(axiom). [assumption].
% 0.68/0.99 12 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_50) # label(axiom). [assumption].
% 0.68/0.99 13 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)) # label(assumption_16_51) # label(axiom). [assumption].
% 0.68/0.99 14 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.68/0.99 15 smaller_or_equal(age(sk1,sk3),sigma) # label(theorem_5_55) # label(negated_conjecture). [assumption].
% 0.68/0.99 18 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.68/0.99 21 smaller(age(sk1,sk3),sigma) | age(sk1,sk3) = sigma. [resolve(14,a,15,a)].
% 0.68/0.99 26 age(sk1,sk2) = zero # label(theorem_5_54) # label(negated_conjecture). [assumption].
% 0.68/0.99 27 greater(age(sk1,sk4),sigma) # label(theorem_5_56) # label(negated_conjecture). [assumption].
% 0.68/0.99 28 -has_endowment(sk1) # label(theorem_5_53) # label(negated_conjecture). [assumption].
% 0.68/0.99 29 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict_9) # label(axiom). [assumption].
% 0.68/0.99 30 -greater(hazard_of_mortality(sk1,sk4),hazard_of_mortality(sk1,sk3)) # label(theorem_5_58) # label(negated_conjecture). [assumption].
% 0.68/0.99 31 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2_42) # label(axiom). [assumption].
% 0.68/0.99 34 has_endowment(sk1) | -has_immunity(sk1,A). [resolve(1,a,2,a)].
% 0.68/0.99 35 -has_immunity(sk1,A). [copy(34),unit_del(a,28)].
% 0.68/0.99 37 age(sk1,A) != zero | is_aligned(sk1,A). [resolve(4,a,2,a)].
% 0.68/0.99 39 -is_aligned(sk1,A) | is_aligned(sk1,B) | dissimilar(sk1,A,B). [resolve(6,a,2,a)].
% 0.68/0.99 46 -is_aligned(A,B) | is_aligned(A,C) | greater(capability(A,B),capability(A,C)) | -dissimilar(A,D,E). [resolve(10,a,3,b)].
% 0.68/0.99 47 age(sk1,A) != zero | -greater(age(sk1,B),sigma) | dissimilar(sk1,A,B). [resolve(11,a,2,a)].
% 0.68/0.99 50 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(12,a,3,b)].
% 0.68/0.99 51 has_immunity(sk1,A) | has_immunity(sk1,B) | -greater(capability(sk1,B),capability(sk1,A)) | greater(hazard_of_mortality(sk1,A),hazard_of_mortality(sk1,B)). [resolve(13,a,2,a)].
% 0.68/0.99 52 -greater(capability(sk1,A),capability(sk1,B)) | greater(hazard_of_mortality(sk1,B),hazard_of_mortality(sk1,A)). [copy(51),unit_del(a,35),unit_del(b,35)].
% 0.68/0.99 55 age(sk1,sk3) = sigma | greater(sigma,age(sk1,sk3)). [resolve(21,a,18,a)].
% 0.68/0.99 56 -greater(A,A). [factor(29,a,b)].
% 0.68/0.99 59 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma). [factor(50,b,d)].
% 0.68/0.99 66 is_aligned(sk1,sk2). [resolve(37,a,26,a)].
% 0.68/0.99 67 age(sk1,A) != zero | dissimilar(sk1,A,sk4). [resolve(47,b,27,a)].
% 0.68/0.99 68 -greater(capability(sk1,sk3),capability(sk1,sk4)). [ur(52,b,30,a)].
% 0.68/0.99 79 age(sk1,sk3) = sigma | -greater(age(sk1,sk3),sigma). [resolve(55,b,29,b)].
% 0.68/0.99 85 is_aligned(sk1,A) | dissimilar(sk1,sk2,A). [resolve(66,a,39,a)].
% 0.68/0.99 94 is_aligned(sk1,A) | greater(age(sk1,A),sigma). [resolve(85,b,59,b),rewrite([26(5)]),xx(b)].
% 0.68/0.99 97 dissimilar(sk1,sk2,sk4). [resolve(67,a,26,a)].
% 0.68/0.99 98 -is_aligned(sk1,sk4). [resolve(97,a,31,a),unit_del(a,66)].
% 0.68/0.99 111 -is_aligned(sk1,sk3). [ur(46,b,98,a,c,68,a,d,97,a)].
% 0.68/0.99 113 greater(age(sk1,sk3),sigma). [resolve(111,a,94,a)].
% 0.68/0.99 118 age(sk1,sk3) = sigma. [back_unit_del(79),unit_del(b,113)].
% 0.68/0.99 120 $F. [back_rewrite(113),rewrite([118(3)]),unit_del(a,56)].
% 0.68/0.99
% 0.68/0.99 % SZS output end Refutation
% 0.68/0.99 ============================== end of proof ==========================
% 0.68/0.99
% 0.68/0.99 ============================== STATISTICS ============================
% 0.68/0.99
% 0.68/0.99 Given=52. Generated=233. Kept=92. proofs=1.
% 0.68/0.99 Usable=51. Sos=29. Demods=2. Limbo=2, Disabled=63. Hints=0.
% 0.68/0.99 Megabytes=0.13.
% 0.68/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of statistics =====================
% 0.68/0.99
% 0.68/0.99 ============================== end of search =========================
% 0.68/0.99
% 0.68/0.99 THEOREM PROVED
% 0.68/0.99 % SZS status Unsatisfiable
% 0.68/0.99
% 0.68/0.99 Exiting with 1 proof.
% 0.68/0.99
% 0.68/0.99 Process 20134 exit (max_proofs) Thu Jun 9 12:46:07 2022
% 0.68/0.99 Prover9 interrupted
%------------------------------------------------------------------------------