TSTP Solution File: MGT006-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT006-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT006-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n024.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 08:22:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 8466 was started by sandbox2 on n024.cluster.edu,
% 0.42/0.99 Thu Jun 9 08:22:50 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8312_n024.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_8312_n024.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (14 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99 1 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -reproducibility(A,D,B) | -reproducibility(A,E,C) | -greater(C,B) | greater(E,D) # label(a4_FOL_5) # label(hypothesis). [assumption].
% 0.42/0.99 2 reorganization_free(sk2,sk7,sk8) # label(t6_FOL_8) # label(negated_conjecture). [assumption].
% 0.42/0.99 Derived: -organization(sk2,sk7) | -organization(sk2,sk8) | -reproducibility(sk2,A,sk7) | -reproducibility(sk2,B,sk8) | -greater(sk8,sk7) | greater(B,A). [resolve(1,c,2,a)].
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials:
% 0.42/0.99 % copying label t6_FOL_14 to answer in negative clause
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99 Function symbol KB weights: sk2=1. sk7=1. sk8=1. sk3=1. sk4=1. sk5=1. sk6=1. sk1=1.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: t6_FOL_14.
% 0.42/0.99 % Length of proof is 21.
% 0.42/0.99 % Level of proof is 5.
% 0.42/0.99 % Maximum clause weight is 36.000.
% 0.42/0.99 % Given clauses 20.
% 0.42/0.99
% 0.42/0.99 1 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -reproducibility(A,D,B) | -reproducibility(A,E,C) | -greater(C,B) | greater(E,D) # label(a4_FOL_5) # label(hypothesis). [assumption].
% 0.42/0.99 2 reorganization_free(sk2,sk7,sk8) # label(t6_FOL_8) # label(negated_conjecture). [assumption].
% 0.42/0.99 3 organization(sk2,sk7) # label(t6_FOL_6) # label(negated_conjecture). [assumption].
% 0.42/0.99 4 organization(sk2,sk8) # label(t6_FOL_7) # label(negated_conjecture). [assumption].
% 0.42/0.99 5 greater(sk8,sk7) # label(t6_FOL_13) # label(negated_conjecture). [assumption].
% 0.42/0.99 6 reliability(sk2,sk3,sk7) # label(t6_FOL_9) # label(negated_conjecture). [assumption].
% 0.42/0.99 7 reliability(sk2,sk4,sk8) # label(t6_FOL_10) # label(negated_conjecture). [assumption].
% 0.42/0.99 8 accountability(sk2,sk5,sk7) # label(t6_FOL_11) # label(negated_conjecture). [assumption].
% 0.42/0.99 9 accountability(sk2,sk6,sk8) # label(t6_FOL_12) # label(negated_conjecture). [assumption].
% 0.42/0.99 10 -greater(sk4,sk3) | -greater(sk6,sk5) # label(t6_FOL_14) # label(negated_conjecture) # answer(t6_FOL_14). [assumption].
% 0.42/0.99 11 -organization(A,B) | reproducibility(A,sk1(B,A),B) # label(mp3_1) # label(axiom). [assumption].
% 0.42/0.99 12 -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.42/0.99 13 -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.42/0.99 15 -organization(sk2,sk7) | -organization(sk2,sk8) | -reproducibility(sk2,A,sk7) | -reproducibility(sk2,B,sk8) | -greater(sk8,sk7) | greater(B,A). [resolve(1,c,2,a)].
% 0.42/0.99 16 -reproducibility(sk2,A,sk7) | -reproducibility(sk2,B,sk8) | greater(B,A). [copy(15),unit_del(a,3),unit_del(b,4),unit_del(e,5)].
% 0.42/0.99 17 reproducibility(sk2,sk1(sk8,sk2),sk8). [ur(11,a,4,a)].
% 0.42/0.99 18 reproducibility(sk2,sk1(sk7,sk2),sk7). [ur(11,a,3,a)].
% 0.42/0.99 56 greater(sk1(sk8,sk2),sk1(sk7,sk2)). [ur(16,a,18,a,b,17,a)].
% 0.42/0.99 58 greater(sk6,sk5). [ur(13,a,3,a,b,4,a,c,6,a,d,7,a,e,8,a,f,9,a,g,18,a,h,17,a,i,56,a)].
% 0.42/0.99 59 greater(sk4,sk3). [ur(12,a,3,a,b,4,a,c,6,a,d,7,a,e,8,a,f,9,a,g,18,a,h,17,a,i,56,a)].
% 0.42/0.99 64 $F # answer(t6_FOL_14). [back_unit_del(10),unit_del(a,59),unit_del(b,58)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=20. Generated=63. Kept=60. proofs=1.
% 0.42/0.99 Usable=18. Sos=27. Demods=0. Limbo=6, Disabled=24. Hints=0.
% 0.42/0.99 Megabytes=0.11.
% 0.42/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 8466 exit (max_proofs) Thu Jun 9 08:22:50 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------