TSTP Solution File: MGT007+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT007+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 : Theorem 0.93s 1.18s
% Output : Refutation 0.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT007+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.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 07:43:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.07 ============================== Prover9 ===============================
% 0.44/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.07 Process 6254 was started by sandbox on n025.cluster.edu,
% 0.44/1.07 Thu Jun 9 07:43:21 2022
% 0.44/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6054_n025.cluster.edu".
% 0.44/1.07 ============================== end of head ===========================
% 0.44/1.07
% 0.44/1.07 ============================== INPUT =================================
% 0.44/1.07
% 0.44/1.07 % Reading from file /tmp/Prover9_6054_n025.cluster.edu
% 0.44/1.07
% 0.44/1.07 set(prolog_style_variables).
% 0.44/1.07 set(auto2).
% 0.44/1.07 % set(auto2) -> set(auto).
% 0.44/1.07 % set(auto) -> set(auto_inference).
% 0.44/1.07 % set(auto) -> set(auto_setup).
% 0.44/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.07 % set(auto) -> set(auto_limits).
% 0.44/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.07 % set(auto) -> set(auto_denials).
% 0.44/1.07 % set(auto) -> set(auto_process).
% 0.44/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.07 % set(auto2) -> assign(stats, some).
% 0.44/1.07 % set(auto2) -> clear(echo_input).
% 0.44/1.07 % set(auto2) -> set(quiet).
% 0.44/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.07 % set(auto2) -> clear(print_given).
% 0.44/1.07 assign(lrs_ticks,-1).
% 0.44/1.07 assign(sos_limit,10000).
% 0.44/1.07 assign(order,kbo).
% 0.44/1.07 set(lex_order_vars).
% 0.44/1.07 clear(print_given).
% 0.44/1.07
% 0.44/1.07 % formulas(sos). % not echoed (6 formulas)
% 0.44/1.07
% 0.44/1.07 ============================== end of input ==========================
% 0.44/1.07
% 0.44/1.07 % From the command line: assign(max_seconds, 300).
% 0.44/1.07
% 0.44/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.07
% 0.44/1.07 % Formulas that are not ordinary clauses:
% 0.44/1.07 1 (all X all T (organization(X,T) -> (exists R reliability(X,R,T)))) # label(mp1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 2 (all X all T (organization(X,T) -> (exists A accountability(X,A,T)))) # label(mp2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 3 (all X all T (organization(X,T) -> (exists A reproducibility(X,A,T)))) # label(mp_not_in_TR) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 4 (all X all Y all T1 all T2 all R1 all R2 all A1 all A2 all Rp1 all Rp2 (organization(X,T1) & organization(Y,T2) & reliability(X,R1,T1) & reliability(Y,R2,T2) & accountability(X,A1,T1) & accountability(Y,A2,T2) & reproducibility(X,Rp1,T1) & reproducibility(Y,Rp2,T2) -> (greater(Rp2,Rp1) <-> greater(R2,R1) & greater(A2,A1)))) # label(a2_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.07 5 (all X all R1 all R2 all A1 all A2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & reliability(X,R1,T1) & reliability(X,R2,T2) & accountability(X,A1,T1) & accountability(X,A2,T2) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) -> greater(R1,R2) & greater(A1,A2))) # label(a6_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.07 6 -(all X all Rp1 all Rp2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & reproducibility(X,Rp1,T1) & reproducibility(X,Rp2,T2) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) -> greater(Rp1,Rp2))) # label(t7_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.07
% 0.44/1.07 ============================== end of process non-clausal formulas ===
% 0.44/1.07
% 0.44/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.07
% 0.44/1.07 ============================== PREDICATE ELIMINATION =================
% 0.44/1.07 7 -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) # label(hypothesis). [clausify(5)].
% 0.93/1.18 8 reorganization(c1,c6,c7) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 Derived: -organization(c1,A) | -organization(c1,B) | -reliability(c1,C,A) | -reliability(c1,D,B) | -accountability(c1,E,A) | -accountability(c1,F,B) | greater(c6,A) | -greater(B,A) | greater(B,c7) | greater(C,D). [resolve(7,c,8,a)].
% 0.93/1.18 9 -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) # label(hypothesis). [clausify(5)].
% 0.93/1.18 Derived: -organization(c1,A) | -organization(c1,B) | -reliability(c1,C,A) | -reliability(c1,D,B) | -accountability(c1,E,A) | -accountability(c1,F,B) | greater(c6,A) | -greater(B,A) | greater(B,c7) | greater(E,F). [resolve(9,c,8,a)].
% 0.93/1.18
% 0.93/1.18 ============================== end predicate elimination =============
% 0.93/1.18
% 0.93/1.18 Auto_denials: (non-Horn, no changes).
% 0.93/1.18
% 0.93/1.18 Term ordering decisions:
% 0.93/1.18 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f1=1. f2=1. f3=1.
% 0.93/1.18
% 0.93/1.18 ============================== end of process initial clauses ========
% 0.93/1.18
% 0.93/1.18 ============================== CLAUSES FOR SEARCH ====================
% 0.93/1.18
% 0.93/1.18 ============================== end of clauses for search =============
% 0.93/1.18
% 0.93/1.18 ============================== SEARCH ================================
% 0.93/1.18
% 0.93/1.18 % Starting search at 0.01 seconds.
% 0.93/1.18
% 0.93/1.18 ============================== PROOF =================================
% 0.93/1.18 % SZS status Theorem
% 0.93/1.18 % SZS output start Refutation
% 0.93/1.18
% 0.93/1.18 % Proof 1 at 0.12 (+ 0.00) seconds.
% 0.93/1.18 % Length of proof is 37.
% 0.93/1.18 % Level of proof is 9.
% 0.93/1.18 % Maximum clause weight is 39.000.
% 0.93/1.18 % Given clauses 349.
% 0.93/1.18
% 0.93/1.18 1 (all X all T (organization(X,T) -> (exists R reliability(X,R,T)))) # label(mp1) # label(axiom) # label(non_clause). [assumption].
% 0.93/1.18 2 (all X all T (organization(X,T) -> (exists A accountability(X,A,T)))) # label(mp2) # label(axiom) # label(non_clause). [assumption].
% 0.93/1.18 4 (all X all Y all T1 all T2 all R1 all R2 all A1 all A2 all Rp1 all Rp2 (organization(X,T1) & organization(Y,T2) & reliability(X,R1,T1) & reliability(Y,R2,T2) & accountability(X,A1,T1) & accountability(Y,A2,T2) & reproducibility(X,Rp1,T1) & reproducibility(Y,Rp2,T2) -> (greater(Rp2,Rp1) <-> greater(R2,R1) & greater(A2,A1)))) # label(a2_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.93/1.18 5 (all X all R1 all R2 all A1 all A2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & reliability(X,R1,T1) & reliability(X,R2,T2) & accountability(X,A1,T1) & accountability(X,A2,T2) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) -> greater(R1,R2) & greater(A1,A2))) # label(a6_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.93/1.18 6 -(all X all Rp1 all Rp2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & reproducibility(X,Rp1,T1) & reproducibility(X,Rp2,T2) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) -> greater(Rp1,Rp2))) # label(t7_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.93/1.18 7 -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) # label(hypothesis). [clausify(5)].
% 0.93/1.18 8 reorganization(c1,c6,c7) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 9 -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) # label(hypothesis). [clausify(5)].
% 0.93/1.18 10 organization(c1,c4) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 11 organization(c1,c5) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 12 greater(c5,c4) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 13 reproducibility(c1,c2,c4) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 14 reproducibility(c1,c3,c5) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 15 -greater(c6,c4) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 16 -greater(c5,c7) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 17 -greater(c2,c3) # label(t7_FOL) # label(negated_conjecture). [clausify(6)].
% 0.93/1.18 18 -organization(A,B) | reliability(A,f1(A,B),B) # label(mp1) # label(axiom). [clausify(1)].
% 0.93/1.18 19 -organization(A,B) | accountability(A,f2(A,B),B) # label(mp2) # label(axiom). [clausify(2)].
% 0.93/1.18 23 -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) | -greater(V7,V6) # label(a2_FOL) # label(hypothesis). [clausify(4)].
% 0.93/1.18 24 -organization(c1,A) | -organization(c1,B) | -reliability(c1,C,A) | -reliability(c1,D,B) | -accountability(c1,E,A) | -accountability(c1,F,B) | greater(c6,A) | -greater(B,A) | greater(B,c7) | greater(C,D). [resolve(7,c,8,a)].
% 0.93/1.18 25 -organization(c1,A) | -organization(c1,B) | -reliability(c1,C,A) | -reliability(c1,D,B) | -accountability(c1,E,A) | -accountability(c1,F,B) | greater(c6,A) | -greater(B,A) | greater(B,c7) | greater(E,F). [resolve(9,c,8,a)].
% 0.93/1.18 75 reliability(c1,f1(c1,c5),c5). [resolve(18,a,11,a)].
% 0.93/1.18 76 reliability(c1,f1(c1,c4),c4). [resolve(18,a,10,a)].
% 0.93/1.18 77 accountability(c1,f2(c1,c5),c5). [resolve(19,a,11,a)].
% 0.93/1.18 78 accountability(c1,f2(c1,c4),c4). [resolve(19,a,10,a)].
% 0.93/1.18 113 -organization(A,B) | -reliability(c1,C,c5) | -reliability(A,D,B) | -accountability(c1,E,c5) | -accountability(A,F,B) | -reproducibility(A,V6,B) | greater(V6,c3) | -greater(D,C) | -greater(F,E). [resolve(23,g,14,a),unit_del(a,11)].
% 0.93/1.18 178 -organization(c1,A) | -reliability(c1,B,A) | -accountability(c1,C,A) | -accountability(c1,D,c5) | greater(c6,A) | -greater(c5,A) | greater(C,D). [resolve(75,a,25,d),unit_del(b,11),unit_del(h,16)].
% 0.93/1.18 372 -reliability(c1,A,c5) | -reliability(c1,B,c4) | -accountability(c1,C,c5) | -accountability(c1,D,c4) | -greater(B,A) | -greater(D,C). [resolve(113,f,13,a),unit_del(a,10),unit_del(f,17)].
% 0.93/1.18 394 -reliability(c1,A,c4) | -accountability(c1,B,c5) | -accountability(c1,C,c4) | -greater(A,f1(c1,c5)) | -greater(C,B). [resolve(372,a,75,a)].
% 0.93/1.18 396 -accountability(c1,A,c5) | -accountability(c1,B,c4) | -greater(f1(c1,c4),f1(c1,c5)) | -greater(B,A). [resolve(394,a,76,a)].
% 0.93/1.18 397 -accountability(c1,A,c4) | -greater(f1(c1,c4),f1(c1,c5)) | -greater(A,f2(c1,c5)). [resolve(396,a,77,a)].
% 0.93/1.18 399 -greater(f1(c1,c4),f1(c1,c5)) | -greater(f2(c1,c4),f2(c1,c5)). [resolve(397,a,78,a)].
% 0.93/1.18 498 -accountability(c1,A,c4) | -accountability(c1,B,c5) | greater(A,B). [resolve(178,b,76,a),unit_del(a,10),unit_del(d,15),unit_del(e,12)].
% 0.93/1.18 499 -accountability(c1,A,c5) | greater(f2(c1,c4),A). [resolve(498,a,78,a)].
% 0.93/1.18 501 greater(f2(c1,c4),f2(c1,c5)). [resolve(499,a,77,a)].
% 0.93/1.18 502 -greater(f1(c1,c4),f1(c1,c5)). [back_unit_del(399),unit_del(b,501)].
% 0.93/1.18 506 $F. [ur(24,b,11,a,c,76,a,d,75,a,e,78,a,f,77,a,g,15,a,h,12,a,i,16,a,j,502,a),unit_del(a,10)].
% 0.93/1.18
% 0.93/1.18 % SZS output end Refutation
% 0.93/1.18 ============================== end of proof ==========================
% 0.93/1.18
% 0.93/1.18 ============================== STATISTICS ============================
% 0.93/1.18
% 0.93/1.18 Given=349. Generated=1099. Kept=496. proofs=1.
% 0.93/1.18 Usable=314. Sos=99. Demods=0. Limbo=2, Disabled=100. Hints=0.
% 0.93/1.18 Megabytes=0.56.
% 0.93/1.18 User_CPU=0.12, System_CPU=0.00, Wall_clock=0.
% 0.93/1.18
% 0.93/1.18 ============================== end of statistics =====================
% 0.93/1.18
% 0.93/1.18 ============================== end of search =========================
% 0.93/1.18
% 0.93/1.18 THEOREM PROVED
% 0.93/1.18 % SZS status Theorem
% 0.93/1.18
% 0.93/1.18 Exiting with 1 proof.
% 0.93/1.18
% 0.93/1.18 Process 6254 exit (max_proofs) Thu Jun 9 07:43:21 2022
% 0.93/1.19 Prover9 interrupted
%------------------------------------------------------------------------------