TSTP Solution File: MGT001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT001-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:46 EDT 2022
% Result : Unsatisfiable 0.67s 1.01s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT001-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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:29:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.01 ============================== Prover9 ===============================
% 0.67/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.67/1.01 Process 32036 was started by sandbox on n023.cluster.edu,
% 0.67/1.01 Thu Jun 9 08:29:08 2022
% 0.67/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31883_n023.cluster.edu".
% 0.67/1.01 ============================== end of head ===========================
% 0.67/1.01
% 0.67/1.01 ============================== INPUT =================================
% 0.67/1.01
% 0.67/1.01 % Reading from file /tmp/Prover9_31883_n023.cluster.edu
% 0.67/1.01
% 0.67/1.01 set(prolog_style_variables).
% 0.67/1.01 set(auto2).
% 0.67/1.01 % set(auto2) -> set(auto).
% 0.67/1.01 % set(auto) -> set(auto_inference).
% 0.67/1.01 % set(auto) -> set(auto_setup).
% 0.67/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.67/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/1.01 % set(auto) -> set(auto_limits).
% 0.67/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/1.01 % set(auto) -> set(auto_denials).
% 0.67/1.01 % set(auto) -> set(auto_process).
% 0.67/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.67/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.67/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.67/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.67/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.67/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.67/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.67/1.01 % set(auto2) -> assign(stats, some).
% 0.67/1.01 % set(auto2) -> clear(echo_input).
% 0.67/1.01 % set(auto2) -> set(quiet).
% 0.67/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.67/1.01 % set(auto2) -> clear(print_given).
% 0.67/1.01 assign(lrs_ticks,-1).
% 0.67/1.01 assign(sos_limit,10000).
% 0.67/1.01 assign(order,kbo).
% 0.67/1.01 set(lex_order_vars).
% 0.67/1.01 clear(print_given).
% 0.67/1.01
% 0.67/1.01 % formulas(sos). % not echoed (19 formulas)
% 0.67/1.01
% 0.67/1.01 ============================== end of input ==========================
% 0.67/1.01
% 0.67/1.01 % From the command line: assign(max_seconds, 300).
% 0.67/1.01
% 0.67/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/1.01
% 0.67/1.01 % Formulas that are not ordinary clauses:
% 0.67/1.01
% 0.67/1.01 ============================== end of process non-clausal formulas ===
% 0.67/1.01
% 0.67/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/1.01
% 0.67/1.01 ============================== PREDICATE ELIMINATION =================
% 0.67/1.01
% 0.67/1.01 ============================== end predicate elimination =============
% 0.67/1.01
% 0.67/1.01 Auto_denials:
% 0.67/1.01 % copying label t1_FOL_19 to answer in negative clause
% 0.67/1.01
% 0.67/1.01 Term ordering decisions:
% 0.67/1.01 Function symbol KB weights: sk6=1. sk7=1. sk4=1. sk5=1. sk8=1. sk9=1. sk10=1. sk11=1. sk1=1. sk2=1. sk3=1.
% 0.67/1.01
% 0.67/1.01 ============================== end of process initial clauses ========
% 0.67/1.01
% 0.67/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.67/1.01
% 0.67/1.01 ============================== end of clauses for search =============
% 0.67/1.01
% 0.67/1.01 ============================== SEARCH ================================
% 0.67/1.01
% 0.67/1.01 % Starting search at 0.01 seconds.
% 0.67/1.01
% 0.67/1.01 ============================== PROOF =================================
% 0.67/1.01 % SZS status Unsatisfiable
% 0.67/1.01 % SZS output start Refutation
% 0.67/1.01
% 0.67/1.01 % Proof 1 at 0.04 (+ 0.00) seconds: t1_FOL_19.
% 0.67/1.01 % Length of proof is 28.
% 0.67/1.01 % Level of proof is 5.
% 0.67/1.01 % Maximum clause weight is 39.000.
% 0.67/1.01 % Given clauses 35.
% 0.67/1.01
% 0.67/1.01 1 organization(sk4,sk6) # label(t1_FOL_10) # label(negated_conjecture). [assumption].
% 0.67/1.01 2 organization(sk5,sk7) # label(t1_FOL_11) # label(negated_conjecture). [assumption].
% 0.67/1.01 3 greater(sk9,sk8) # label(t1_FOL_18) # label(negated_conjecture). [assumption].
% 0.67/1.01 4 reorganization_free(sk4,sk6,sk6) # label(t1_FOL_12) # label(negated_conjecture). [assumption].
% 0.67/1.01 5 reorganization_free(sk5,sk7,sk7) # label(t1_FOL_13) # label(negated_conjecture). [assumption].
% 0.67/1.01 6 inertia(sk4,sk8,sk6) # label(t1_FOL_14) # label(negated_conjecture). [assumption].
% 0.67/1.01 7 inertia(sk5,sk9,sk7) # label(t1_FOL_15) # label(negated_conjecture). [assumption].
% 0.67/1.01 8 survival_chance(sk4,sk10,sk6) # label(t1_FOL_16) # label(negated_conjecture). [assumption].
% 0.67/1.01 9 survival_chance(sk5,sk11,sk7) # label(t1_FOL_17) # label(negated_conjecture). [assumption].
% 0.67/1.01 10 -greater(sk11,sk10) # label(t1_FOL_19) # label(negated_conjecture) # answer(t1_FOL_19). [assumption].
% 0.67/1.01 11 -organization(A,B) | reliability(A,sk1(B,A),B) # label(mp1_1) # label(axiom). [assumption].
% 0.67/1.01 12 -organization(A,B) | accountability(A,sk2(B,A),B) # label(mp2_2) # label(axiom). [assumption].
% 0.67/1.01 13 -organization(A,B) | reproducibility(A,sk3(B,A),B) # label(mp3_3) # label(axiom). [assumption].
% 0.67/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) | -reproducibility(A,V8,B) | -reproducibility(C,V9,D) | -greater(V9,V8) | greater(F,E) # label(a2_FOL_5) # label(hypothesis). [assumption].
% 0.67/1.01 15 -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(V9,V8) | greater(V7,V6) # label(a2_FOL_6) # label(hypothesis). [assumption].
% 0.67/1.01 17 -organization(A,B) | -organization(C,D) | -reorganization_free(A,B,B) | -reorganization_free(C,D,D) | -reproducibility(A,E,B) | -reproducibility(C,F,D) | -inertia(A,V6,B) | -inertia(C,V7,D) | -greater(V7,V6) | greater(F,E) # label(a3_FOL_9) # label(hypothesis). [assumption].
% 0.67/1.01 18 -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_4) # label(hypothesis). [assumption].
% 0.67/1.01 20 reliability(sk5,sk1(sk7,sk5),sk7). [ur(11,a,2,a)].
% 0.67/1.01 21 reliability(sk4,sk1(sk6,sk4),sk6). [ur(11,a,1,a)].
% 0.67/1.01 22 accountability(sk5,sk2(sk7,sk5),sk7). [ur(12,a,2,a)].
% 0.67/1.01 23 accountability(sk4,sk2(sk6,sk4),sk6). [ur(12,a,1,a)].
% 0.67/1.01 24 reproducibility(sk5,sk3(sk7,sk5),sk7). [ur(13,a,2,a)].
% 0.67/1.01 25 reproducibility(sk4,sk3(sk6,sk4),sk6). [ur(13,a,1,a)].
% 0.67/1.01 85 greater(sk3(sk7,sk5),sk3(sk6,sk4)). [ur(17,a,1,a,b,2,a,c,4,a,d,5,a,e,25,a,f,24,a,g,6,a,h,7,a,i,3,a)].
% 0.67/1.01 111 greater(sk2(sk7,sk5),sk2(sk6,sk4)). [ur(15,a,1,a,b,2,a,c,21,a,d,20,a,e,23,a,f,22,a,g,25,a,h,24,a,i,85,a)].
% 0.67/1.01 112 greater(sk1(sk7,sk5),sk1(sk6,sk4)). [ur(14,a,1,a,b,2,a,c,21,a,d,20,a,e,23,a,f,22,a,g,25,a,h,24,a,i,85,a)].
% 0.67/1.01 116 -greater(sk1(sk7,sk5),sk1(sk6,sk4)) # answer(t1_FOL_19). [ur(18,a,1,a,b,2,a,c,21,a,d,20,a,e,23,a,f,22,a,g,8,a,h,9,a,j,111,a,k,10,a)].
% 0.67/1.01 117 $F # answer(t1_FOL_19). [resolve(116,a,112,a)].
% 0.67/1.01
% 0.67/1.01 % SZS output end Refutation
% 0.67/1.01 ============================== end of proof ==========================
% 0.67/1.01
% 0.67/1.01 ============================== STATISTICS ============================
% 0.67/1.01
% 0.67/1.01 Given=35. Generated=127. Kept=116. proofs=1.
% 0.67/1.01 Usable=33. Sos=50. Demods=0. Limbo=3, Disabled=48. Hints=0.
% 0.67/1.01 Megabytes=0.19.
% 0.67/1.01 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.67/1.01
% 0.67/1.01 ============================== end of statistics =====================
% 0.67/1.01
% 0.67/1.01 ============================== end of search =========================
% 0.67/1.01
% 0.67/1.01 THEOREM PROVED
% 0.67/1.01 % SZS status Unsatisfiable
% 0.67/1.01
% 0.67/1.01 Exiting with 1 proof.
% 0.67/1.01
% 0.67/1.01 Process 32036 exit (max_proofs) Thu Jun 9 08:29:08 2022
% 0.67/1.01 Prover9 interrupted
%------------------------------------------------------------------------------