TSTP Solution File: MGT005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT005-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:22:47 EDT 2022
% Result : Unsatisfiable 1.28s 1.60s
% Output : Refutation 1.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT005-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 12:28:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.28/1.60 ============================== Prover9 ===============================
% 1.28/1.60 Prover9 (32) version 2009-11A, November 2009.
% 1.28/1.60 Process 32737 was started by sandbox on n021.cluster.edu,
% 1.28/1.60 Thu Jun 9 12:28:54 2022
% 1.28/1.60 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32584_n021.cluster.edu".
% 1.28/1.60 ============================== end of head ===========================
% 1.28/1.60
% 1.28/1.60 ============================== INPUT =================================
% 1.28/1.60
% 1.28/1.60 % Reading from file /tmp/Prover9_32584_n021.cluster.edu
% 1.28/1.60
% 1.28/1.60 set(prolog_style_variables).
% 1.28/1.60 set(auto2).
% 1.28/1.60 % set(auto2) -> set(auto).
% 1.28/1.60 % set(auto) -> set(auto_inference).
% 1.28/1.60 % set(auto) -> set(auto_setup).
% 1.28/1.60 % set(auto_setup) -> set(predicate_elim).
% 1.28/1.60 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.28/1.60 % set(auto) -> set(auto_limits).
% 1.28/1.60 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.28/1.60 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.28/1.60 % set(auto) -> set(auto_denials).
% 1.28/1.60 % set(auto) -> set(auto_process).
% 1.28/1.60 % set(auto2) -> assign(new_constants, 1).
% 1.28/1.60 % set(auto2) -> assign(fold_denial_max, 3).
% 1.28/1.60 % set(auto2) -> assign(max_weight, "200.000").
% 1.28/1.60 % set(auto2) -> assign(max_hours, 1).
% 1.28/1.60 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.28/1.60 % set(auto2) -> assign(max_seconds, 0).
% 1.28/1.60 % set(auto2) -> assign(max_minutes, 5).
% 1.28/1.60 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.28/1.60 % set(auto2) -> set(sort_initial_sos).
% 1.28/1.60 % set(auto2) -> assign(sos_limit, -1).
% 1.28/1.60 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.28/1.60 % set(auto2) -> assign(max_megs, 400).
% 1.28/1.60 % set(auto2) -> assign(stats, some).
% 1.28/1.60 % set(auto2) -> clear(echo_input).
% 1.28/1.60 % set(auto2) -> set(quiet).
% 1.28/1.60 % set(auto2) -> clear(print_initial_clauses).
% 1.28/1.60 % set(auto2) -> clear(print_given).
% 1.28/1.60 assign(lrs_ticks,-1).
% 1.28/1.60 assign(sos_limit,10000).
% 1.28/1.60 assign(order,kbo).
% 1.28/1.60 set(lex_order_vars).
% 1.28/1.60 clear(print_given).
% 1.28/1.60
% 1.28/1.60 % formulas(sos). % not echoed (29 formulas)
% 1.28/1.60
% 1.28/1.60 ============================== end of input ==========================
% 1.28/1.60
% 1.28/1.60 % From the command line: assign(max_seconds, 300).
% 1.28/1.60
% 1.28/1.60 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.28/1.60
% 1.28/1.60 % Formulas that are not ordinary clauses:
% 1.28/1.60
% 1.28/1.60 ============================== end of process non-clausal formulas ===
% 1.28/1.60
% 1.28/1.60 ============================== PROCESS INITIAL CLAUSES ===============
% 1.28/1.60
% 1.28/1.60 ============================== PREDICATE ELIMINATION =================
% 1.28/1.60 1 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -survival_chance(A,D,B) | -survival_chance(A,E,C) | -greater(C,B) | greater(E,D) # label(t3_FOL_32) # label(hypothesis). [assumption].
% 1.28/1.60 2 reorganization_free(sk2,sk12,sk13) # label(t5_FOL_48) # label(negated_conjecture). [assumption].
% 1.28/1.60 Derived: -organization(sk2,sk12) | -organization(sk2,sk13) | -survival_chance(sk2,A,sk12) | -survival_chance(sk2,B,sk13) | -greater(sk13,sk12) | greater(B,A). [resolve(1,c,2,a)].
% 1.28/1.60
% 1.28/1.60 ============================== end predicate elimination =============
% 1.28/1.60
% 1.28/1.60 Auto_denials: (non-Horn, no changes).
% 1.28/1.60
% 1.28/1.60 Term ordering decisions:
% 1.28/1.60 Function symbol KB weights: sk11=1. sk2=1. sk13=1. sk3=1. sk12=1. sk10=1. sk4=1. sk5=1. sk6=1. sk9=1. sk7=1. sk8=1. sk1=1.
% 1.28/1.60
% 1.28/1.60 ============================== end of process initial clauses ========
% 1.28/1.60
% 1.28/1.60 ============================== CLAUSES FOR SEARCH ====================
% 1.28/1.60
% 1.28/1.60 ============================== end of clauses for search =============
% 1.28/1.60
% 1.28/1.60 ============================== SEARCH ================================
% 1.28/1.60
% 1.28/1.60 % Starting search at 0.02 seconds.
% 1.28/1.60
% 1.28/1.60 ============================== PROOF =================================
% 1.28/1.60 % SZS status Unsatisfiable
% 1.28/1.60 % SZS output start Refutation
% 1.28/1.60
% 1.28/1.60 % Proof 1 at 0.60 (+ 0.00) seconds.
% 1.28/1.60 % Length of proof is 67.
% 1.28/1.60 % Level of proof is 15.
% 1.28/1.60 % Maximum clause weight is 69.000.
% 1.28/1.60 % Given clauses 316.
% 1.28/1.60
% 1.28/1.60 1 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -survival_chance(A,D,B) | -survival_chance(A,E,C) | -greater(C,B) | greater(E,D) # label(t3_FOL_32) # label(hypothesis). [assumption].
% 1.28/1.60 2 reorganization_free(sk2,sk12,sk13) # label(t5_FOL_48) # label(negated_conjecture). [assumption].
% 1.28/1.60 3 organization(sk2,sk11) # label(t5_FOL_36) # label(negated_conjecture). [assumption].
% 1.28/1.60 4 organization(sk3,sk11) # label(t5_FOL_37) # label(negated_conjecture). [assumption].
% 1.28/1.60 5 organization(sk2,sk13) # label(t5_FOL_38) # label(negated_conjecture). [assumption].
% 1.28/1.60 6 organization(sk3,sk13) # label(t5_FOL_39) # label(negated_conjecture). [assumption].
% 1.28/1.60 7 greater(sk10,sk9) # label(t5_FOL_53) # label(negated_conjecture). [assumption].
% 1.28/1.60 8 class(sk2,sk5,sk11) # label(t5_FOL_40) # label(negated_conjecture). [assumption].
% 1.28/1.60 9 class(sk3,sk5,sk11) # label(t5_FOL_41) # label(negated_conjecture). [assumption].
% 1.28/1.60 10 survival_chance(sk2,sk6,sk11) # label(t5_FOL_42) # label(negated_conjecture). [assumption].
% 1.28/1.60 11 survival_chance(sk3,sk6,sk11) # label(t5_FOL_43) # label(negated_conjecture). [assumption].
% 1.28/1.60 12 reorganization(sk2,sk11,sk12) # label(t5_FOL_44) # label(negated_conjecture). [assumption].
% 1.28/1.60 13 reorganization(sk3,sk11,sk13) # label(t5_FOL_45) # label(negated_conjecture). [assumption].
% 1.28/1.60 14 reorganization_type(sk2,sk4,sk11) # label(t5_FOL_46) # label(negated_conjecture). [assumption].
% 1.28/1.60 15 reorganization_type(sk3,sk4,sk11) # label(t5_FOL_47) # label(negated_conjecture). [assumption].
% 1.28/1.61 16 survival_chance(sk2,sk7,sk13) # label(t5_FOL_49) # label(negated_conjecture). [assumption].
% 1.28/1.61 17 survival_chance(sk3,sk8,sk13) # label(t5_FOL_50) # label(negated_conjecture). [assumption].
% 1.28/1.61 18 complexity(sk2,sk9,sk11) # label(t5_FOL_51) # label(negated_conjecture). [assumption].
% 1.28/1.61 19 complexity(sk3,sk10,sk11) # label(t5_FOL_52) # label(negated_conjecture). [assumption].
% 1.28/1.61 20 -greater(sk7,sk8) # label(t5_FOL_54) # label(negated_conjecture). [assumption].
% 1.28/1.61 22 -greater(A,B) | -greater(B,A) # label(mp6_2_27) # label(axiom). [assumption].
% 1.28/1.61 23 -reorganization(A,B,C) | greater(C,B) # label(mp7_31) # label(axiom). [assumption].
% 1.28/1.61 24 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp11_28) # label(axiom). [assumption].
% 1.28/1.61 25 -organization(A,B) | survival_chance(A,sk1(B,A),B) # label(mp12_29) # label(axiom). [assumption].
% 1.28/1.61 26 -organization(A,B) | -organization(A,C) | -greater(D,B) | -greater(C,D) | organization(A,D) # label(mp13_30) # label(axiom). [assumption].
% 1.28/1.61 27 -organization(A,B) | -organization(A,C) | -reorganization(A,D,E) | -survival_chance(A,F,B) | -survival_chance(A,V6,C) | greater(D,B) | -greater(C,B) | greater(C,E) | greater(F,V6) # label(t4_FOL_33) # label(hypothesis). [assumption].
% 1.28/1.61 28 -organization(A,B) | -organization(C,B) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -reorganization(A,B,F) | -reorganization(C,B,D) | -reorganization_type(A,V6,B) | -reorganization_type(C,V6,B) | -complexity(A,V7,B) | -complexity(C,V8,B) | -greater(V8,V7) | greater(D,F) # label(a10_FOL_34) # label(hypothesis). [assumption].
% 1.28/1.61 29 -organization(A,B) | -organization(C,B) | -organization(A,D) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -survival_chance(A,F,B) | -survival_chance(C,F,B) | -reorganization(A,B,D) | -reorganization(C,B,V6) | -reorganization_type(A,V7,B) | -reorganization_type(C,V7,B) | -survival_chance(A,V8,D) | -survival_chance(C,V9,D) | -complexity(A,V10,B) | -complexity(C,V11,B) | -greater(V11,V10) | greater(V8,V9) | V8 = V9 # label(a11_FOL_35) # label(hypothesis). [assumption].
% 1.28/1.61 30 -organization(sk2,sk12) | -organization(sk2,sk13) | -survival_chance(sk2,A,sk12) | -survival_chance(sk2,B,sk13) | -greater(sk13,sk12) | greater(B,A). [resolve(1,c,2,a)].
% 1.28/1.61 31 -organization(sk2,sk12) | -survival_chance(sk2,A,sk12) | -survival_chance(sk2,B,sk13) | -greater(sk13,sk12) | greater(B,A). [copy(30),unit_del(b,5)].
% 1.28/1.61 32 -greater(A,A). [factor(22,a,b)].
% 1.28/1.61 48 greater(sk12,sk11). [resolve(23,a,12,a)].
% 1.28/1.61 58 -organization(sk3,A) | -organization(sk3,B) | -survival_chance(sk3,C,A) | -survival_chance(sk3,D,B) | greater(sk11,A) | -greater(B,A) | greater(B,sk13) | greater(C,D). [resolve(27,c,13,a)].
% 1.28/1.61 65 -organization(A,sk11) | -organization(A,B) | -class(sk2,C,sk11) | -class(A,C,sk11) | -reorganization(sk2,sk11,D) | -reorganization(A,sk11,B) | -reorganization_type(A,sk4,sk11) | -complexity(sk2,E,sk11) | -complexity(A,F,sk11) | -greater(F,E) | greater(B,D). [resolve(28,h,14,a),unit_del(a,3)].
% 1.28/1.61 79 -organization(A,sk11) | -organization(sk2,B) | -organization(A,B) | -class(sk2,C,sk11) | -class(A,C,sk11) | -survival_chance(sk2,D,sk11) | -survival_chance(A,D,sk11) | -reorganization(sk2,sk11,B) | -reorganization(A,sk11,E) | -reorganization_type(A,sk4,sk11) | -survival_chance(sk2,F,B) | -survival_chance(A,V6,B) | -complexity(sk2,V7,sk11) | -complexity(A,V8,sk11) | -greater(V8,V7) | greater(F,V6) | F = V6. [resolve(29,k,14,a),unit_del(a,3)].
% 1.28/1.61 94 -organization(sk2,sk12) | -survival_chance(sk2,A,sk12) | -greater(sk13,sk12) | greater(sk7,A). [resolve(31,c,16,a)].
% 1.28/1.61 109 -organization(A,sk11) | -organization(A,B) | -greater(B,sk12) | organization(A,sk12). [resolve(48,a,26,c)].
% 1.28/1.61 112 -greater(sk11,sk12). [resolve(48,a,22,b)].
% 1.28/1.61 122 -organization(sk3,A) | -survival_chance(sk3,B,A) | greater(sk11,A) | -greater(sk13,A) | greater(B,sk8). [resolve(58,d,17,a),unit_del(b,6),unit_del(f,32)].
% 1.28/1.61 179 -organization(sk3,A) | -class(sk2,B,sk11) | -class(sk3,B,sk11) | -reorganization(sk2,sk11,C) | -reorganization(sk3,sk11,A) | -complexity(sk2,D,sk11) | -complexity(sk3,E,sk11) | -greater(E,D) | greater(A,C). [resolve(65,g,15,a),unit_del(a,4)].
% 1.28/1.61 194 -organization(sk2,A) | -organization(sk3,A) | -class(sk2,B,sk11) | -class(sk3,B,sk11) | -survival_chance(sk2,C,sk11) | -survival_chance(sk3,C,sk11) | -reorganization(sk2,sk11,A) | -reorganization(sk3,sk11,D) | -survival_chance(sk2,E,A) | -survival_chance(sk3,F,A) | -complexity(sk2,V6,sk11) | -complexity(sk3,V7,sk11) | -greater(V7,V6) | greater(E,F) | E = F. [resolve(79,j,15,a),unit_del(a,4)].
% 1.28/1.61 212 -organization(sk3,A) | -class(sk2,B,sk11) | -class(sk3,B,sk11) | -reorganization(sk2,sk11,C) | -reorganization(sk3,sk11,A) | -complexity(sk3,D,sk11) | -greater(D,sk9) | greater(A,C). [resolve(179,f,18,a)].
% 1.28/1.61 214 -organization(sk3,A) | -class(sk2,B,sk11) | -class(sk3,B,sk11) | -reorganization(sk2,sk11,C) | -reorganization(sk3,sk11,A) | greater(A,C). [resolve(212,f,19,a),unit_del(f,7)].
% 1.28/1.61 215 -organization(sk3,A) | -reorganization(sk2,sk11,B) | -reorganization(sk3,sk11,A) | greater(A,B). [resolve(214,c,9,a),unit_del(b,8)].
% 1.28/1.61 217 -reorganization(sk2,sk11,A) | greater(sk13,A). [resolve(215,c,13,a),unit_del(a,6)].
% 1.28/1.61 218 greater(sk13,sk12). [resolve(217,a,12,a)].
% 1.28/1.61 220 -organization(sk2,sk12) | -survival_chance(sk2,A,sk12) | greater(sk7,A). [back_unit_del(94),unit_del(c,218)].
% 1.28/1.61 224 -organization(A,sk11) | -organization(A,sk13) | organization(A,sk12). [resolve(218,a,109,c)].
% 1.28/1.61 231 organization(sk3,sk12). [resolve(224,b,6,a),unit_del(a,4)].
% 1.28/1.61 232 organization(sk2,sk12). [resolve(224,b,5,a),unit_del(a,3)].
% 1.28/1.61 234 -survival_chance(sk2,A,sk12) | greater(sk7,A). [back_unit_del(220),unit_del(a,232)].
% 1.28/1.61 236 -organization(sk2,A) | -organization(sk3,A) | -class(sk2,B,sk11) | -class(sk3,B,sk11) | -survival_chance(sk2,C,sk11) | -survival_chance(sk3,C,sk11) | -reorganization(sk2,sk11,A) | -reorganization(sk3,sk11,D) | -survival_chance(sk2,E,A) | -survival_chance(sk3,F,A) | -complexity(sk3,V6,sk11) | -greater(V6,sk9) | greater(E,F) | E = F. [resolve(194,k,18,a)].
% 1.28/1.61 239 survival_chance(sk3,sk1(sk12,sk3),sk12). [resolve(231,a,25,a)].
% 1.28/1.61 246 survival_chance(sk2,sk1(sk12,sk2),sk12). [resolve(232,a,25,a)].
% 1.28/1.61 250 greater(sk1(sk12,sk3),sk8). [resolve(239,a,122,b),unit_del(a,231),unit_del(b,112),unit_del(c,218)].
% 1.28/1.61 266 -greater(sk7,sk1(sk12,sk3)). [ur(24,b,250,a,c,20,a)].
% 1.28/1.61 284 greater(sk7,sk1(sk12,sk2)). [resolve(234,a,246,a)].
% 1.28/1.61 315 -survival_chance(sk2,sk1(sk12,sk3),sk12). [ur(234,b,266,a)].
% 1.28/1.61 316 -greater(sk1(sk12,sk2),sk1(sk12,sk3)). [ur(24,a,284,a,c,266,a)].
% 1.28/1.61 335 -organization(sk2,A) | -organization(sk3,A) | -class(sk2,B,sk11) | -class(sk3,B,sk11) | -survival_chance(sk2,C,sk11) | -survival_chance(sk3,C,sk11) | -reorganization(sk2,sk11,A) | -reorganization(sk3,sk11,D) | -survival_chance(sk2,E,A) | -survival_chance(sk3,F,A) | greater(E,F) | E = F. [resolve(236,k,19,a),unit_del(k,7)].
% 1.28/1.61 349 -organization(sk2,A) | -organization(sk3,A) | -survival_chance(sk2,B,sk11) | -survival_chance(sk3,B,sk11) | -reorganization(sk2,sk11,A) | -reorganization(sk3,sk11,C) | -survival_chance(sk2,D,A) | -survival_chance(sk3,E,A) | greater(D,E) | D = E. [resolve(335,d,9,a),unit_del(c,8)].
% 1.28/1.61 350 -survival_chance(sk2,A,sk11) | -survival_chance(sk3,A,sk11) | -reorganization(sk3,sk11,B) | -survival_chance(sk2,C,sk12) | -survival_chance(sk3,D,sk12) | greater(C,D) | C = D. [resolve(349,e,12,a),unit_del(a,232),unit_del(b,231)].
% 1.28/1.61 352 -survival_chance(sk2,A,sk11) | -survival_chance(sk3,A,sk11) | -survival_chance(sk2,B,sk12) | -survival_chance(sk3,C,sk12) | greater(B,C) | B = C. [resolve(350,c,13,a)].
% 1.28/1.61 354 -survival_chance(sk2,A,sk12) | -survival_chance(sk3,B,sk12) | greater(A,B) | A = B. [resolve(352,b,11,a),unit_del(a,10)].
% 1.28/1.61 357 -survival_chance(sk3,A,sk12) | greater(sk1(sk12,sk2),A) | sk1(sk12,sk2) = A. [resolve(354,a,246,a)].
% 1.28/1.61 359 sk1(sk12,sk3) = sk1(sk12,sk2). [resolve(357,a,239,a),flip(b),unit_del(a,316)].
% 1.28/1.61 367 $F. [back_rewrite(315),rewrite([359(4)]),unit_del(a,246)].
% 1.28/1.61
% 1.28/1.61 % SZS output end Refutation
% 1.28/1.61 ============================== end of proof ==========================
% 1.28/1.61
% 1.28/1.61 ============================== STATISTICS ============================
% 1.28/1.61
% 1.28/1.61 Given=316. Generated=1182. Kept=363. proofs=1.
% 1.28/1.61 Usable=258. Sos=1. Demods=1. Limbo=8, Disabled=126. Hints=0.
% 1.28/1.61 Megabytes=0.38.
% 1.28/1.61 User_CPU=0.60, System_CPU=0.00, Wall_clock=0.
% 1.28/1.61
% 1.28/1.61 ============================== end of statistics =====================
% 1.28/1.61
% 1.28/1.61 ============================== end of search =========================
% 1.28/1.61
% 1.28/1.61 THEOREM PROVED
% 1.28/1.61 % SZS status Unsatisfiable
% 1.28/1.61
% 1.28/1.61 Exiting with 1 proof.
% 1.28/1.61
% 1.28/1.61 Process 32737 exit (max_proofs) Thu Jun 9 12:28:54 2022
% 1.28/1.61 Prover9 interrupted
%------------------------------------------------------------------------------