TSTP Solution File: MGT010-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT010-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:49 EDT 2022
% Result : Unsatisfiable 0.70s 0.99s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT010-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 9 10:19:07 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.70/0.99 ============================== Prover9 ===============================
% 0.70/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.99 Process 13710 was started by sandbox2 on n029.cluster.edu,
% 0.70/0.99 Thu Jun 9 10:19:07 2022
% 0.70/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13557_n029.cluster.edu".
% 0.70/0.99 ============================== end of head ===========================
% 0.70/0.99
% 0.70/0.99 ============================== INPUT =================================
% 0.70/0.99
% 0.70/0.99 % Reading from file /tmp/Prover9_13557_n029.cluster.edu
% 0.70/0.99
% 0.70/0.99 set(prolog_style_variables).
% 0.70/0.99 set(auto2).
% 0.70/0.99 % set(auto2) -> set(auto).
% 0.70/0.99 % set(auto) -> set(auto_inference).
% 0.70/0.99 % set(auto) -> set(auto_setup).
% 0.70/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.99 % set(auto) -> set(auto_limits).
% 0.70/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.99 % set(auto) -> set(auto_denials).
% 0.70/0.99 % set(auto) -> set(auto_process).
% 0.70/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.99 % set(auto2) -> assign(stats, some).
% 0.70/0.99 % set(auto2) -> clear(echo_input).
% 0.70/0.99 % set(auto2) -> set(quiet).
% 0.70/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.99 % set(auto2) -> clear(print_given).
% 0.70/0.99 assign(lrs_ticks,-1).
% 0.70/0.99 assign(sos_limit,10000).
% 0.70/0.99 assign(order,kbo).
% 0.70/0.99 set(lex_order_vars).
% 0.70/0.99 clear(print_given).
% 0.70/0.99
% 0.70/0.99 % formulas(sos). % not echoed (19 formulas)
% 0.70/0.99
% 0.70/0.99 ============================== end of input ==========================
% 0.70/0.99
% 0.70/0.99 % From the command line: assign(max_seconds, 300).
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.99
% 0.70/0.99 % Formulas that are not ordinary clauses:
% 0.70/0.99
% 0.70/0.99 ============================== end of process non-clausal formulas ===
% 0.70/0.99
% 0.70/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.99
% 0.70/0.99 ============================== PREDICATE ELIMINATION =================
% 0.70/0.99
% 0.70/0.99 ============================== end predicate elimination =============
% 0.70/0.99
% 0.70/0.99 Auto_denials:
% 0.70/0.99 % copying label t10_FOL_19 to answer in negative clause
% 0.70/0.99
% 0.70/0.99 Term ordering decisions:
% 0.70/0.99 Function symbol KB weights: sk11=1. sk12=1. sk2=1. sk3=1. sk10=1. sk4=1. sk9=1. sk5=1. sk6=1. sk7=1. sk8=1. sk1=1.
% 0.70/0.99
% 0.70/0.99 ============================== end of process initial clauses ========
% 0.70/0.99
% 0.70/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.70/0.99
% 0.70/0.99 ============================== end of clauses for search =============
% 0.70/0.99
% 0.70/0.99 ============================== SEARCH ================================
% 0.70/0.99
% 0.70/0.99 % Starting search at 0.01 seconds.
% 0.70/0.99
% 0.70/0.99 ============================== PROOF =================================
% 0.70/0.99 % SZS status Unsatisfiable
% 0.70/0.99 % SZS output start Refutation
% 0.70/0.99
% 0.70/0.99 % Proof 1 at 0.03 (+ 0.00) seconds: t10_FOL_19.
% 0.70/0.99 % Length of proof is 24.
% 0.70/0.99 % Level of proof is 4.
% 0.70/0.99 % Maximum clause weight is 44.000.
% 0.70/0.99 % Given clauses 26.
% 0.70/0.99
% 0.70/0.99 1 organization(sk2,sk11) # label(t10_FOL_6) # label(negated_conjecture). [assumption].
% 0.70/0.99 2 organization(sk3,sk12) # label(t10_FOL_7) # label(negated_conjecture). [assumption].
% 0.70/0.99 3 greater(sk10,sk9) # label(t10_FOL_18) # label(negated_conjecture). [assumption].
% 0.70/0.99 4 reorganization_free(sk2,sk11,sk11) # label(t10_FOL_8) # label(negated_conjecture). [assumption].
% 0.70/0.99 5 reorganization_free(sk3,sk12,sk12) # label(t10_FOL_9) # label(negated_conjecture). [assumption].
% 0.70/0.99 6 class(sk2,sk4,sk11) # label(t10_FOL_10) # label(negated_conjecture). [assumption].
% 0.70/0.99 7 class(sk3,sk4,sk12) # label(t10_FOL_11) # label(negated_conjecture). [assumption].
% 0.70/0.99 8 reliability(sk2,sk5,sk11) # label(t10_FOL_12) # label(negated_conjecture). [assumption].
% 0.70/0.99 9 reliability(sk3,sk6,sk12) # label(t10_FOL_13) # label(negated_conjecture). [assumption].
% 0.70/0.99 10 accountability(sk2,sk7,sk11) # label(t10_FOL_14) # label(negated_conjecture). [assumption].
% 0.70/0.99 11 accountability(sk3,sk8,sk12) # label(t10_FOL_15) # label(negated_conjecture). [assumption].
% 0.70/0.99 12 size(sk2,sk9,sk11) # label(t10_FOL_16) # label(negated_conjecture). [assumption].
% 0.70/0.99 13 size(sk3,sk10,sk12) # label(t10_FOL_17) # label(negated_conjecture). [assumption].
% 0.70/0.99 14 -greater(sk6,sk5) | -greater(sk8,sk7) # label(t10_FOL_19) # label(negated_conjecture) # answer(t10_FOL_19). [assumption].
% 0.70/0.99 15 -organization(A,B) | reproducibility(A,sk1(B,A),B) # label(mp3_1) # label(axiom). [assumption].
% 0.70/0.99 16 -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_2) # label(hypothesis). [assumption].
% 0.70/0.99 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(V9,V8) | greater(V7,V6) # label(a2_FOL_3) # label(hypothesis). [assumption].
% 0.70/0.99 19 -organization(A,B) | -organization(C,D) | -reorganization_free(A,B,B) | -reorganization_free(C,D,D) | -class(A,E,B) | -class(C,E,D) | -reproducibility(A,F,B) | -reproducibility(C,V6,D) | -size(A,V7,B) | -size(C,V8,D) | -greater(V8,V7) | greater(V6,F) # label(t9_FOL_5) # label(hypothesis). [assumption].
% 0.70/0.99 20 reproducibility(sk3,sk1(sk12,sk3),sk12). [ur(15,a,2,a)].
% 0.70/0.99 21 reproducibility(sk2,sk1(sk11,sk2),sk11). [ur(15,a,1,a)].
% 0.70/0.99 85 greater(sk1(sk12,sk3),sk1(sk11,sk2)). [ur(19,a,1,a,b,2,a,c,4,a,d,5,a,e,6,a,f,7,a,g,21,a,h,20,a,i,12,a,j,13,a,k,3,a)].
% 0.70/0.99 89 greater(sk8,sk7). [ur(17,a,1,a,b,2,a,c,8,a,d,9,a,e,10,a,f,11,a,g,21,a,h,20,a,i,85,a)].
% 0.70/0.99 90 greater(sk6,sk5). [ur(16,a,1,a,b,2,a,c,8,a,d,9,a,e,10,a,f,11,a,g,21,a,h,20,a,i,85,a)].
% 0.70/0.99 95 $F # answer(t10_FOL_19). [back_unit_del(14),unit_del(a,90),unit_del(b,89)].
% 0.70/0.99
% 0.70/0.99 % SZS output end Refutation
% 0.70/0.99 ============================== end of proof ==========================
% 0.70/0.99
% 0.70/0.99 ============================== STATISTICS ============================
% 0.70/0.99
% 0.70/0.99 Given=26. Generated=98. Kept=94. proofs=1.
% 0.70/0.99 Usable=25. Sos=50. Demods=0. Limbo=6, Disabled=32. Hints=0.
% 0.70/0.99 Megabytes=0.17.
% 0.70/0.99 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.70/0.99
% 0.70/0.99 ============================== end of statistics =====================
% 0.70/0.99
% 0.70/0.99 ============================== end of search =========================
% 0.70/0.99
% 0.70/0.99 THEOREM PROVED
% 0.70/0.99 % SZS status Unsatisfiable
% 0.70/0.99
% 0.70/0.99 Exiting with 1 proof.
% 0.70/0.99
% 0.70/0.99 Process 13710 exit (max_proofs) Thu Jun 9 10:19:07 2022
% 0.70/0.99 Prover9 interrupted
%------------------------------------------------------------------------------