TSTP Solution File: MGT004-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT004-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 0.41s 1.01s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT004-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 08:34:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.01 ============================== Prover9 ===============================
% 0.41/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.01 Process 29644 was started by sandbox2 on n028.cluster.edu,
% 0.41/1.01 Thu Jun 9 08:34:03 2022
% 0.41/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29490_n028.cluster.edu".
% 0.41/1.01 ============================== end of head ===========================
% 0.41/1.01
% 0.41/1.01 ============================== INPUT =================================
% 0.41/1.01
% 0.41/1.01 % Reading from file /tmp/Prover9_29490_n028.cluster.edu
% 0.41/1.01
% 0.41/1.01 set(prolog_style_variables).
% 0.41/1.01 set(auto2).
% 0.41/1.01 % set(auto2) -> set(auto).
% 0.41/1.01 % set(auto) -> set(auto_inference).
% 0.41/1.01 % set(auto) -> set(auto_setup).
% 0.41/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.01 % set(auto) -> set(auto_limits).
% 0.41/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.01 % set(auto) -> set(auto_denials).
% 0.41/1.01 % set(auto) -> set(auto_process).
% 0.41/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.01 % set(auto2) -> assign(stats, some).
% 0.41/1.01 % set(auto2) -> clear(echo_input).
% 0.41/1.01 % set(auto2) -> set(quiet).
% 0.41/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.01 % set(auto2) -> clear(print_given).
% 0.41/1.01 assign(lrs_ticks,-1).
% 0.41/1.01 assign(sos_limit,10000).
% 0.41/1.01 assign(order,kbo).
% 0.41/1.01 set(lex_order_vars).
% 0.41/1.01 clear(print_given).
% 0.41/1.01
% 0.41/1.01 % formulas(sos). % not echoed (14 formulas)
% 0.41/1.01
% 0.41/1.01 ============================== end of input ==========================
% 0.41/1.01
% 0.41/1.01 % From the command line: assign(max_seconds, 300).
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.01
% 0.41/1.01 % Formulas that are not ordinary clauses:
% 0.41/1.01
% 0.41/1.01 ============================== end of process non-clausal formulas ===
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.01
% 0.41/1.01 ============================== PREDICATE ELIMINATION =================
% 0.41/1.01 1 -organization(A,B) | -organization(A,C) | -reorganization(A,D,E) | -reliability(A,F,B) | -reliability(A,V6,C) | -accountability(A,V7,B) | -accountability(A,V8,C) | greater(D,B) | -greater(C,B) | greater(C,E) | greater(F,V6) # label(a6_FOL_4) # label(hypothesis). [assumption].
% 0.41/1.01 2 reorganization(sk3,sk8,sk9) # label(t4_FOL_8) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -organization(sk3,A) | -organization(sk3,B) | -reliability(sk3,C,A) | -reliability(sk3,D,B) | -accountability(sk3,E,A) | -accountability(sk3,F,B) | greater(sk8,A) | -greater(B,A) | greater(B,sk9) | greater(C,D). [resolve(1,c,2,a)].
% 0.41/1.01 3 -organization(A,B) | -organization(A,C) | -reorganization(A,D,E) | -reliability(A,F,B) | -reliability(A,V6,C) | -accountability(A,V7,B) | -accountability(A,V8,C) | greater(D,B) | -greater(C,B) | greater(C,E) | greater(V7,V8) # label(a6_FOL_5) # label(hypothesis). [assumption].
% 0.41/1.01 Derived: -organization(sk3,A) | -organization(sk3,B) | -reliability(sk3,C,A) | -reliability(sk3,D,B) | -accountability(sk3,E,A) | -accountability(sk3,F,B) | greater(sk8,A) | -greater(B,A) | greater(B,sk9) | greater(E,F). [resolve(3,c,2,a)].
% 0.41/1.01
% 0.41/1.01 ============================== end predicate elimination =============
% 0.41/1.01
% 0.41/1.01 Auto_denials: (non-Horn, no changes).
% 0.41/1.01
% 0.41/1.01 Term ordering decisions:
% 0.41/1.01 Function symbol KB weights: sk3=1. sk6=1. sk7=1. sk8=1. sk9=1. sk4=1. sk5=1. sk1=1. sk2=1.
% 0.41/1.01
% 0.41/1.01 ============================== end of process initial clauses ========
% 0.41/1.01
% 0.41/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.01
% 0.41/1.01 ============================== end of clauses for search =============
% 0.41/1.01
% 0.41/1.01 ============================== SEARCH ================================
% 0.41/1.01
% 0.41/1.01 % Starting search at 0.01 seconds.
% 0.41/1.01
% 0.41/1.01 ============================== PROOF =================================
% 0.41/1.01 % SZS status Unsatisfiable
% 0.41/1.01 % SZS output start Refutation
% 0.41/1.01
% 0.41/1.01 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.41/1.01 % Length of proof is 32.
% 0.41/1.01 % Level of proof is 8.
% 0.41/1.01 % Maximum clause weight is 39.000.
% 0.41/1.01 % Given clauses 153.
% 0.41/1.01
% 0.41/1.01 1 -organization(A,B) | -organization(A,C) | -reorganization(A,D,E) | -reliability(A,F,B) | -reliability(A,V6,C) | -accountability(A,V7,B) | -accountability(A,V8,C) | greater(D,B) | -greater(C,B) | greater(C,E) | greater(F,V6) # label(a6_FOL_4) # label(hypothesis). [assumption].
% 0.41/1.01 2 reorganization(sk3,sk8,sk9) # label(t4_FOL_8) # label(negated_conjecture). [assumption].
% 0.41/1.01 3 -organization(A,B) | -organization(A,C) | -reorganization(A,D,E) | -reliability(A,F,B) | -reliability(A,V6,C) | -accountability(A,V7,B) | -accountability(A,V8,C) | greater(D,B) | -greater(C,B) | greater(C,E) | greater(V7,V8) # label(a6_FOL_5) # label(hypothesis). [assumption].
% 0.41/1.01 4 organization(sk3,sk6) # label(t4_FOL_6) # label(negated_conjecture). [assumption].
% 0.41/1.01 5 organization(sk3,sk7) # label(t4_FOL_7) # label(negated_conjecture). [assumption].
% 0.41/1.01 6 greater(sk7,sk6) # label(t4_FOL_12) # label(negated_conjecture). [assumption].
% 0.41/1.01 7 survival_chance(sk3,sk4,sk6) # label(t4_FOL_9) # label(negated_conjecture). [assumption].
% 0.41/1.01 8 survival_chance(sk3,sk5,sk7) # label(t4_FOL_10) # label(negated_conjecture). [assumption].
% 0.41/1.01 9 -greater(sk8,sk6) # label(t4_FOL_11) # label(negated_conjecture). [assumption].
% 0.41/1.01 10 -greater(sk7,sk9) # label(t4_FOL_13) # label(negated_conjecture). [assumption].
% 0.41/1.01 11 -greater(sk4,sk5) # label(t4_FOL_14) # label(negated_conjecture). [assumption].
% 0.41/1.01 12 -organization(A,B) | reliability(A,sk1(B,A),B) # label(mp1_1) # label(axiom). [assumption].
% 0.41/1.01 13 -organization(A,B) | accountability(A,sk2(B,A),B) # label(mp2_2) # label(axiom). [assumption].
% 0.41/1.01 14 -organization(A,B) | -organization(C,D) | -reliability(A,E,B) | -reliability(C,F,D) | -accountability(A,V6,B) | -accountability(C,V7,D) | -survival_chance(A,V8,B) | -survival_chance(C,V9,D) | -greater(F,E) | -greater(V7,V6) | greater(V9,V8) # label(a1_FOL_3) # label(hypothesis). [assumption].
% 0.41/1.01 15 -organization(sk3,A) | -organization(sk3,B) | -reliability(sk3,C,A) | -reliability(sk3,D,B) | -accountability(sk3,E,A) | -accountability(sk3,F,B) | greater(sk8,A) | -greater(B,A) | greater(B,sk9) | greater(C,D). [resolve(1,c,2,a)].
% 0.41/1.01 16 -organization(sk3,A) | -organization(sk3,B) | -reliability(sk3,C,A) | -reliability(sk3,D,B) | -accountability(sk3,E,A) | -accountability(sk3,F,B) | greater(sk8,A) | -greater(B,A) | greater(B,sk9) | greater(E,F). [resolve(3,c,2,a)].
% 0.41/1.01 50 reliability(sk3,sk1(sk7,sk3),sk7). [resolve(12,a,5,a)].
% 0.41/1.01 51 reliability(sk3,sk1(sk6,sk3),sk6). [resolve(12,a,4,a)].
% 0.41/1.01 52 accountability(sk3,sk2(sk7,sk3),sk7). [resolve(13,a,5,a)].
% 0.41/1.01 53 accountability(sk3,sk2(sk6,sk3),sk6). [resolve(13,a,4,a)].
% 0.41/1.01 54 -organization(A,B) | -reliability(sk3,C,sk7) | -reliability(A,D,B) | -accountability(sk3,E,sk7) | -accountability(A,F,B) | -survival_chance(A,V6,B) | -greater(D,C) | -greater(F,E) | greater(V6,sk5). [resolve(14,g,8,a),unit_del(a,5)].
% 0.41/1.01 111 -organization(sk3,A) | -reliability(sk3,B,A) | -accountability(sk3,C,A) | -accountability(sk3,D,sk7) | greater(sk8,A) | -greater(sk7,A) | greater(C,D). [resolve(50,a,16,d),unit_del(b,5),unit_del(h,10)].
% 0.41/1.01 133 -reliability(sk3,A,sk7) | -reliability(sk3,B,sk6) | -accountability(sk3,C,sk7) | -accountability(sk3,D,sk6) | -greater(B,A) | -greater(D,C). [resolve(54,f,7,a),unit_del(a,4),unit_del(h,11)].
% 0.41/1.01 142 -reliability(sk3,A,sk6) | -accountability(sk3,B,sk7) | -accountability(sk3,C,sk6) | -greater(A,sk1(sk7,sk3)) | -greater(C,B). [resolve(133,a,50,a)].
% 0.41/1.01 144 -accountability(sk3,A,sk7) | -accountability(sk3,B,sk6) | -greater(sk1(sk6,sk3),sk1(sk7,sk3)) | -greater(B,A). [resolve(142,a,51,a)].
% 0.41/1.01 145 -accountability(sk3,A,sk6) | -greater(sk1(sk6,sk3),sk1(sk7,sk3)) | -greater(A,sk2(sk7,sk3)). [resolve(144,a,52,a)].
% 0.41/1.01 147 -greater(sk1(sk6,sk3),sk1(sk7,sk3)) | -greater(sk2(sk6,sk3),sk2(sk7,sk3)). [resolve(145,a,53,a)].
% 0.41/1.01 180 -accountability(sk3,A,sk6) | -accountability(sk3,B,sk7) | greater(A,B). [resolve(111,b,51,a),unit_del(a,4),unit_del(d,9),unit_del(e,6)].
% 0.41/1.01 181 -accountability(sk3,A,sk7) | greater(sk2(sk6,sk3),A). [resolve(180,a,53,a)].
% 0.41/1.01 183 greater(sk2(sk6,sk3),sk2(sk7,sk3)). [resolve(181,a,52,a)].
% 0.41/1.01 184 -greater(sk1(sk6,sk3),sk1(sk7,sk3)). [back_unit_del(147),unit_del(b,183)].
% 0.41/1.01 185 $F. [ur(15,b,5,a,c,51,a,d,50,a,e,53,a,f,52,a,g,9,a,h,6,a,i,10,a,j,184,a),unit_del(a,4)].
% 0.41/1.01
% 0.41/1.01 % SZS output end Refutation
% 0.41/1.01 ============================== end of proof ==========================
% 0.41/1.01
% 0.41/1.01 ============================== STATISTICS ============================
% 0.41/1.01
% 0.41/1.01 Given=153. Generated=441. Kept=181. proofs=1.
% 0.41/1.01 Usable=146. Sos=20. Demods=0. Limbo=0, Disabled=31. Hints=0.
% 0.41/1.01 Megabytes=0.25.
% 0.41/1.01 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.41/1.01
% 0.41/1.01 ============================== end of statistics =====================
% 0.41/1.01
% 0.41/1.01 ============================== end of search =========================
% 0.41/1.01
% 0.41/1.01 THEOREM PROVED
% 0.41/1.01 % SZS status Unsatisfiable
% 0.41/1.01
% 0.41/1.01 Exiting with 1 proof.
% 0.41/1.01
% 0.41/1.01 Process 29644 exit (max_proofs) Thu Jun 9 08:34:03 2022
% 0.41/1.01 Prover9 interrupted
%------------------------------------------------------------------------------