TSTP Solution File: MGT004+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT004+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:47 EDT 2022
% Result : Theorem 0.71s 1.01s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT004+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 09:39:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.96 ============================== Prover9 ===============================
% 0.42/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.96 Process 31214 was started by sandbox on n022.cluster.edu,
% 0.42/0.96 Thu Jun 9 09:39:05 2022
% 0.42/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31061_n022.cluster.edu".
% 0.42/0.96 ============================== end of head ===========================
% 0.42/0.96
% 0.42/0.96 ============================== INPUT =================================
% 0.42/0.96
% 0.42/0.96 % Reading from file /tmp/Prover9_31061_n022.cluster.edu
% 0.42/0.96
% 0.42/0.96 set(prolog_style_variables).
% 0.42/0.96 set(auto2).
% 0.42/0.96 % set(auto2) -> set(auto).
% 0.42/0.96 % set(auto) -> set(auto_inference).
% 0.42/0.96 % set(auto) -> set(auto_setup).
% 0.42/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.96 % set(auto) -> set(auto_limits).
% 0.42/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.96 % set(auto) -> set(auto_denials).
% 0.42/0.96 % set(auto) -> set(auto_process).
% 0.42/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.96 % set(auto2) -> assign(stats, some).
% 0.42/0.96 % set(auto2) -> clear(echo_input).
% 0.42/0.96 % set(auto2) -> set(quiet).
% 0.42/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.96 % set(auto2) -> clear(print_given).
% 0.42/0.96 assign(lrs_ticks,-1).
% 0.42/0.96 assign(sos_limit,10000).
% 0.42/0.96 assign(order,kbo).
% 0.42/0.96 set(lex_order_vars).
% 0.42/0.96 clear(print_given).
% 0.42/0.96
% 0.42/0.96 % formulas(sos). % not echoed (5 formulas)
% 0.42/0.96
% 0.42/0.96 ============================== end of input ==========================
% 0.42/0.96
% 0.42/0.96 % From the command line: assign(max_seconds, 300).
% 0.42/0.96
% 0.42/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.96
% 0.42/0.96 % Formulas that are not ordinary clauses:
% 0.42/0.96 1 (all X all T (organization(X,T) -> (exists R reliability(X,R,T)))) # label(mp1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.96 2 (all X all T (organization(X,T) -> (exists A accountability(X,A,T)))) # label(mp2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.96 3 (all X all Y all R1 all R2 all A1 all A2 all P1 all P2 all T1 all T2 (organization(X,T1) & organization(Y,T2) & reliability(X,R1,T1) & reliability(Y,R2,T2) & accountability(X,A1,T1) & accountability(Y,A2,T2) & survival_chance(X,P1,T1) & survival_chance(Y,P2,T2) & greater(R2,R1) & greater(A2,A1) -> greater(P2,P1))) # label(a1_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.42/0.96 4 (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.42/0.96 5 -(all X all P1 all P2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & survival_chance(X,P1,T1) & survival_chance(X,P2,T2) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) -> greater(P1,P2))) # label(t4_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.96
% 0.42/0.96 ============================== end of process non-clausal formulas ===
% 0.42/0.96
% 0.42/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.96
% 0.42/0.96 ============================== PREDICATE ELIMINATION =================
% 0.42/0.96 6 -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(4)].
% 0.42/0.96 7 reorganization(c1,c6,c7) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.42/0.96 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(6,c,7,a)].
% 0.71/1.01 8 -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(4)].
% 0.71/1.01 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(8,c,7,a)].
% 0.71/1.01
% 0.71/1.01 ============================== end predicate elimination =============
% 0.71/1.01
% 0.71/1.01 Auto_denials: (non-Horn, no changes).
% 0.71/1.01
% 0.71/1.01 Term ordering decisions:
% 0.71/1.01 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f1=1. f2=1.
% 0.71/1.01
% 0.71/1.01 ============================== end of process initial clauses ========
% 0.71/1.01
% 0.71/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.01
% 0.71/1.01 ============================== end of clauses for search =============
% 0.71/1.01
% 0.71/1.01 ============================== SEARCH ================================
% 0.71/1.01
% 0.71/1.01 % Starting search at 0.02 seconds.
% 0.71/1.01
% 0.71/1.01 ============================== PROOF =================================
% 0.71/1.01 % SZS status Theorem
% 0.71/1.01 % SZS output start Refutation
% 0.71/1.01
% 0.71/1.01 % Proof 1 at 0.06 (+ 0.00) seconds.
% 0.71/1.01 % Length of proof is 37.
% 0.71/1.01 % Level of proof is 9.
% 0.71/1.01 % Maximum clause weight is 39.000.
% 0.71/1.01 % Given clauses 153.
% 0.71/1.01
% 0.71/1.01 1 (all X all T (organization(X,T) -> (exists R reliability(X,R,T)))) # label(mp1) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 2 (all X all T (organization(X,T) -> (exists A accountability(X,A,T)))) # label(mp2) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 3 (all X all Y all R1 all R2 all A1 all A2 all P1 all P2 all T1 all T2 (organization(X,T1) & organization(Y,T2) & reliability(X,R1,T1) & reliability(Y,R2,T2) & accountability(X,A1,T1) & accountability(Y,A2,T2) & survival_chance(X,P1,T1) & survival_chance(Y,P2,T2) & greater(R2,R1) & greater(A2,A1) -> greater(P2,P1))) # label(a1_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.71/1.01 4 (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.71/1.01 5 -(all X all P1 all P2 all T1 all T2 all Ta all Tb (organization(X,T1) & organization(X,T2) & reorganization(X,Ta,Tb) & survival_chance(X,P1,T1) & survival_chance(X,P2,T2) & -greater(Ta,T1) & greater(T2,T1) & -greater(T2,Tb) -> greater(P1,P2))) # label(t4_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/1.01 6 -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(4)].
% 0.71/1.01 7 reorganization(c1,c6,c7) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 8 -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(4)].
% 0.71/1.01 9 organization(c1,c4) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 10 organization(c1,c5) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 11 greater(c5,c4) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 12 survival_chance(c1,c2,c4) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 13 survival_chance(c1,c3,c5) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 14 -greater(c6,c4) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 15 -greater(c5,c7) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 16 -greater(c2,c3) # label(t4_FOL) # label(negated_conjecture). [clausify(5)].
% 0.71/1.01 17 -organization(A,B) | reliability(A,f1(A,B),B) # label(mp1) # label(axiom). [clausify(1)].
% 0.71/1.01 18 -organization(A,B) | accountability(A,f2(A,B),B) # label(mp2) # label(axiom). [clausify(2)].
% 0.71/1.01 19 -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) # label(hypothesis). [clausify(3)].
% 0.71/1.01 20 -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(6,c,7,a)].
% 0.71/1.01 21 -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(8,c,7,a)].
% 0.71/1.01 55 reliability(c1,f1(c1,c5),c5). [resolve(17,a,10,a)].
% 0.71/1.01 56 reliability(c1,f1(c1,c4),c4). [resolve(17,a,9,a)].
% 0.71/1.01 57 accountability(c1,f2(c1,c5),c5). [resolve(18,a,10,a)].
% 0.71/1.01 58 accountability(c1,f2(c1,c4),c4). [resolve(18,a,9,a)].
% 0.71/1.01 59 -organization(A,B) | -reliability(c1,C,c5) | -reliability(A,D,B) | -accountability(c1,E,c5) | -accountability(A,F,B) | -survival_chance(A,V6,B) | -greater(D,C) | -greater(F,E) | greater(V6,c3). [resolve(19,g,13,a),unit_del(a,10)].
% 0.71/1.01 116 -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(55,a,21,d),unit_del(b,10),unit_del(h,15)].
% 0.71/1.01 138 -reliability(c1,A,c5) | -reliability(c1,B,c4) | -accountability(c1,C,c5) | -accountability(c1,D,c4) | -greater(B,A) | -greater(D,C). [resolve(59,f,12,a),unit_del(a,9),unit_del(h,16)].
% 0.71/1.01 147 -reliability(c1,A,c4) | -accountability(c1,B,c5) | -accountability(c1,C,c4) | -greater(A,f1(c1,c5)) | -greater(C,B). [resolve(138,a,55,a)].
% 0.71/1.01 149 -accountability(c1,A,c5) | -accountability(c1,B,c4) | -greater(f1(c1,c4),f1(c1,c5)) | -greater(B,A). [resolve(147,a,56,a)].
% 0.71/1.01 150 -accountability(c1,A,c4) | -greater(f1(c1,c4),f1(c1,c5)) | -greater(A,f2(c1,c5)). [resolve(149,a,57,a)].
% 0.71/1.01 152 -greater(f1(c1,c4),f1(c1,c5)) | -greater(f2(c1,c4),f2(c1,c5)). [resolve(150,a,58,a)].
% 0.71/1.01 185 -accountability(c1,A,c4) | -accountability(c1,B,c5) | greater(A,B). [resolve(116,b,56,a),unit_del(a,9),unit_del(d,14),unit_del(e,11)].
% 0.71/1.01 186 -accountability(c1,A,c5) | greater(f2(c1,c4),A). [resolve(185,a,58,a)].
% 0.71/1.01 188 greater(f2(c1,c4),f2(c1,c5)). [resolve(186,a,57,a)].
% 0.71/1.01 189 -greater(f1(c1,c4),f1(c1,c5)). [back_unit_del(152),unit_del(b,188)].
% 0.71/1.01 190 $F. [ur(20,b,10,a,c,56,a,d,55,a,e,58,a,f,57,a,g,14,a,h,11,a,i,15,a,j,189,a),unit_del(a,9)].
% 0.71/1.01
% 0.71/1.01 % SZS output end Refutation
% 0.71/1.01 ============================== end of proof ==========================
% 0.71/1.01
% 0.71/1.01 ============================== STATISTICS ============================
% 0.71/1.01
% 0.71/1.01 Given=153. Generated=441. Kept=181. proofs=1.
% 0.71/1.01 Usable=146. Sos=20. Demods=0. Limbo=0, Disabled=31. Hints=0.
% 0.71/1.01 Megabytes=0.27.
% 0.71/1.01 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.71/1.01
% 0.71/1.01 ============================== end of statistics =====================
% 0.71/1.01
% 0.71/1.01 ============================== end of search =========================
% 0.71/1.01
% 0.71/1.01 THEOREM PROVED
% 0.71/1.01 % SZS status Theorem
% 0.71/1.01
% 0.71/1.01 Exiting with 1 proof.
% 0.71/1.01
% 0.71/1.01 Process 31214 exit (max_proofs) Thu Jun 9 09:39:05 2022
% 0.71/1.01 Prover9 interrupted
%------------------------------------------------------------------------------