TSTP Solution File: MGT007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT007-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:48 EDT 2022
% Result : Unsatisfiable 0.83s 1.17s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT007-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 08:31:36 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.83/1.17 ============================== Prover9 ===============================
% 0.83/1.17 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.17 Process 5420 was started by sandbox2 on n029.cluster.edu,
% 0.83/1.17 Thu Jun 9 08:31:37 2022
% 0.83/1.17 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5267_n029.cluster.edu".
% 0.83/1.17 ============================== end of head ===========================
% 0.83/1.17
% 0.83/1.17 ============================== INPUT =================================
% 0.83/1.17
% 0.83/1.17 % Reading from file /tmp/Prover9_5267_n029.cluster.edu
% 0.83/1.17
% 0.83/1.17 set(prolog_style_variables).
% 0.83/1.17 set(auto2).
% 0.83/1.17 % set(auto2) -> set(auto).
% 0.83/1.17 % set(auto) -> set(auto_inference).
% 0.83/1.17 % set(auto) -> set(auto_setup).
% 0.83/1.17 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.17 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.17 % set(auto) -> set(auto_limits).
% 0.83/1.17 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.17 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.17 % set(auto) -> set(auto_denials).
% 0.83/1.17 % set(auto) -> set(auto_process).
% 0.83/1.17 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.17 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.17 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.17 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.17 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.17 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.17 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.17 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.17 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.17 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.17 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.17 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.17 % set(auto2) -> assign(stats, some).
% 0.83/1.17 % set(auto2) -> clear(echo_input).
% 0.83/1.17 % set(auto2) -> set(quiet).
% 0.83/1.17 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.17 % set(auto2) -> clear(print_given).
% 0.83/1.17 assign(lrs_ticks,-1).
% 0.83/1.17 assign(sos_limit,10000).
% 0.83/1.17 assign(order,kbo).
% 0.83/1.17 set(lex_order_vars).
% 0.83/1.17 clear(print_given).
% 0.83/1.17
% 0.83/1.17 % formulas(sos). % not echoed (17 formulas)
% 0.83/1.17
% 0.83/1.17 ============================== end of input ==========================
% 0.83/1.17
% 0.83/1.17 % From the command line: assign(max_seconds, 300).
% 0.83/1.17
% 0.83/1.17 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.17
% 0.83/1.17 % Formulas that are not ordinary clauses:
% 0.83/1.17
% 0.83/1.17 ============================== end of process non-clausal formulas ===
% 0.83/1.17
% 0.83/1.17 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.17
% 0.83/1.17 ============================== PREDICATE ELIMINATION =================
% 0.83/1.17 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_7) # label(hypothesis). [assumption].
% 0.83/1.17 2 reorganization(sk4,sk9,sk10) # label(t7_FOL_11) # label(negated_conjecture). [assumption].
% 0.83/1.17 Derived: -organization(sk4,A) | -organization(sk4,B) | -reliability(sk4,C,A) | -reliability(sk4,D,B) | -accountability(sk4,E,A) | -accountability(sk4,F,B) | greater(sk9,A) | -greater(B,A) | greater(B,sk10) | greater(C,D). [resolve(1,c,2,a)].
% 0.83/1.17 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_8) # label(hypothesis). [assumption].
% 0.83/1.17 Derived: -organization(sk4,A) | -organization(sk4,B) | -reliability(sk4,C,A) | -reliability(sk4,D,B) | -accountability(sk4,E,A) | -accountability(sk4,F,B) | greater(sk9,A) | -greater(B,A) | greater(B,sk10) | greater(E,F). [resolve(3,c,2,a)].
% 0.83/1.17
% 0.83/1.17 ============================== end predicate elimination =============
% 0.83/1.17
% 0.83/1.17 Auto_denials: (non-Horn, no changes).
% 0.83/1.17
% 0.83/1.17 Term ordering decisions:
% 0.83/1.17 Function symbol KB weights: sk4=1. sk7=1. sk8=1. sk10=1. sk9=1. sk5=1. sk6=1. sk1=1. sk2=1. sk3=1.
% 0.83/1.17
% 0.83/1.17 ============================== end of process initial clauses ========
% 0.83/1.17
% 0.83/1.17 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.17
% 0.83/1.17 ============================== end of clauses for search =============
% 0.83/1.17
% 0.83/1.17 ============================== SEARCH ================================
% 0.83/1.17
% 0.83/1.17 % Starting search at 0.02 seconds.
% 0.83/1.17
% 0.83/1.17 ============================== PROOF =================================
% 0.83/1.17 % SZS status Unsatisfiable
% 0.83/1.17 % SZS output start Refutation
% 0.83/1.17
% 0.83/1.17 % Proof 1 at 0.15 (+ 0.00) seconds.
% 0.83/1.17 % Length of proof is 32.
% 0.83/1.17 % Level of proof is 8.
% 0.83/1.17 % Maximum clause weight is 39.000.
% 0.83/1.17 % Given clauses 349.
% 0.83/1.17
% 0.83/1.17 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_7) # label(hypothesis). [assumption].
% 0.83/1.17 2 reorganization(sk4,sk9,sk10) # label(t7_FOL_11) # label(negated_conjecture). [assumption].
% 0.83/1.17 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_8) # label(hypothesis). [assumption].
% 0.83/1.17 4 organization(sk4,sk7) # label(t7_FOL_9) # label(negated_conjecture). [assumption].
% 0.83/1.17 5 organization(sk4,sk8) # label(t7_FOL_10) # label(negated_conjecture). [assumption].
% 0.83/1.17 6 greater(sk8,sk7) # label(t7_FOL_15) # label(negated_conjecture). [assumption].
% 0.83/1.17 7 reproducibility(sk4,sk5,sk7) # label(t7_FOL_12) # label(negated_conjecture). [assumption].
% 0.83/1.17 8 reproducibility(sk4,sk6,sk8) # label(t7_FOL_13) # label(negated_conjecture). [assumption].
% 0.83/1.17 9 -greater(sk9,sk7) # label(t7_FOL_14) # label(negated_conjecture). [assumption].
% 0.83/1.17 10 -greater(sk8,sk10) # label(t7_FOL_16) # label(negated_conjecture). [assumption].
% 0.83/1.17 11 -greater(sk5,sk6) # label(t7_FOL_17) # label(negated_conjecture). [assumption].
% 0.83/1.17 12 -organization(A,B) | reliability(A,sk1(B,A),B) # label(mp1_1) # label(axiom). [assumption].
% 0.83/1.17 13 -organization(A,B) | accountability(A,sk2(B,A),B) # label(mp2_2) # label(axiom). [assumption].
% 0.83/1.17 17 -organization(A,B) | -organization(C,D) | -reliability(A,E,B) | -reliability(C,F,D) | -accountability(A,V6,B) | -accountability(C,V7,D) | -reproducibility(A,V8,B) | -reproducibility(C,V9,D) | -greater(F,E) | -greater(V7,V6) | greater(V9,V8) # label(a2_FOL_6) # label(hypothesis). [assumption].
% 0.83/1.17 18 -organization(sk4,A) | -organization(sk4,B) | -reliability(sk4,C,A) | -reliability(sk4,D,B) | -accountability(sk4,E,A) | -accountability(sk4,F,B) | greater(sk9,A) | -greater(B,A) | greater(B,sk10) | greater(C,D). [resolve(1,c,2,a)].
% 0.83/1.17 19 -organization(sk4,A) | -organization(sk4,B) | -reliability(sk4,C,A) | -reliability(sk4,D,B) | -accountability(sk4,E,A) | -accountability(sk4,F,B) | greater(sk9,A) | -greater(B,A) | greater(B,sk10) | greater(E,F). [resolve(3,c,2,a)].
% 0.83/1.17 69 reliability(sk4,sk1(sk8,sk4),sk8). [resolve(12,a,5,a)].
% 0.83/1.17 70 reliability(sk4,sk1(sk7,sk4),sk7). [resolve(12,a,4,a)].
% 0.83/1.17 71 accountability(sk4,sk2(sk8,sk4),sk8). [resolve(13,a,5,a)].
% 0.83/1.17 72 accountability(sk4,sk2(sk7,sk4),sk7). [resolve(13,a,4,a)].
% 0.83/1.17 107 -organization(A,B) | -reliability(sk4,C,sk8) | -reliability(A,D,B) | -accountability(sk4,E,sk8) | -accountability(A,F,B) | -reproducibility(A,V6,B) | -greater(D,C) | -greater(F,E) | greater(V6,sk6). [resolve(17,g,8,a),unit_del(a,5)].
% 0.83/1.17 172 -organization(sk4,A) | -reliability(sk4,B,A) | -accountability(sk4,C,A) | -accountability(sk4,D,sk8) | greater(sk9,A) | -greater(sk8,A) | greater(C,D). [resolve(69,a,19,d),unit_del(b,5),unit_del(h,10)].
% 0.83/1.17 366 -reliability(sk4,A,sk8) | -reliability(sk4,B,sk7) | -accountability(sk4,C,sk8) | -accountability(sk4,D,sk7) | -greater(B,A) | -greater(D,C). [resolve(107,f,7,a),unit_del(a,4),unit_del(h,11)].
% 0.83/1.17 388 -reliability(sk4,A,sk7) | -accountability(sk4,B,sk8) | -accountability(sk4,C,sk7) | -greater(A,sk1(sk8,sk4)) | -greater(C,B). [resolve(366,a,69,a)].
% 0.83/1.17 390 -accountability(sk4,A,sk8) | -accountability(sk4,B,sk7) | -greater(sk1(sk7,sk4),sk1(sk8,sk4)) | -greater(B,A). [resolve(388,a,70,a)].
% 0.83/1.17 391 -accountability(sk4,A,sk7) | -greater(sk1(sk7,sk4),sk1(sk8,sk4)) | -greater(A,sk2(sk8,sk4)). [resolve(390,a,71,a)].
% 0.83/1.17 393 -greater(sk1(sk7,sk4),sk1(sk8,sk4)) | -greater(sk2(sk7,sk4),sk2(sk8,sk4)). [resolve(391,a,72,a)].
% 0.83/1.17 492 -accountability(sk4,A,sk7) | -accountability(sk4,B,sk8) | greater(A,B). [resolve(172,b,70,a),unit_del(a,4),unit_del(d,9),unit_del(e,6)].
% 0.83/1.17 493 -accountability(sk4,A,sk8) | greater(sk2(sk7,sk4),A). [resolve(492,a,72,a)].
% 0.83/1.17 495 greater(sk2(sk7,sk4),sk2(sk8,sk4)). [resolve(493,a,71,a)].
% 0.83/1.17 496 -greater(sk1(sk7,sk4),sk1(sk8,sk4)). [back_unit_del(393),unit_del(b,495)].
% 0.83/1.17 500 $F. [ur(18,b,5,a,c,70,a,d,69,a,e,72,a,f,71,a,g,9,a,h,6,a,i,10,a,j,496,a),unit_del(a,4)].
% 0.83/1.17
% 0.83/1.17 % SZS output end Refutation
% 0.83/1.17 ============================== end of proof ==========================
% 0.83/1.17
% 0.83/1.17 ============================== STATISTICS ============================
% 0.83/1.17
% 0.83/1.17 Given=349. Generated=1099. Kept=496. proofs=1.
% 0.83/1.17 Usable=314. Sos=99. Demods=0. Limbo=2, Disabled=100. Hints=0.
% 0.83/1.17 Megabytes=0.55.
% 0.83/1.17 User_CPU=0.16, System_CPU=0.00, Wall_clock=0.
% 0.83/1.17
% 0.83/1.17 ============================== end of statistics =====================
% 0.83/1.17
% 0.83/1.17 ============================== end of search =========================
% 0.83/1.17
% 0.83/1.17 THEOREM PROVED
% 0.83/1.17 % SZS status Unsatisfiable
% 0.83/1.17
% 0.83/1.17 Exiting with 1 proof.
% 0.83/1.17
% 0.83/1.17 Process 5420 exit (max_proofs) Thu Jun 9 08:31:37 2022
% 0.83/1.17 Prover9 interrupted
%------------------------------------------------------------------------------