TSTP Solution File: MGT001+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT001+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 : Theorem 0.78s 1.07s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 09:15:55 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.48/1.04 ============================== Prover9 ===============================
% 0.48/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.04 Process 20622 was started by sandbox2 on n019.cluster.edu,
% 0.48/1.04 Thu Jun 9 09:15:55 2022
% 0.48/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20469_n019.cluster.edu".
% 0.48/1.04 ============================== end of head ===========================
% 0.48/1.04
% 0.48/1.04 ============================== INPUT =================================
% 0.48/1.04
% 0.48/1.04 % Reading from file /tmp/Prover9_20469_n019.cluster.edu
% 0.48/1.04
% 0.48/1.04 set(prolog_style_variables).
% 0.48/1.04 set(auto2).
% 0.48/1.04 % set(auto2) -> set(auto).
% 0.48/1.04 % set(auto) -> set(auto_inference).
% 0.48/1.04 % set(auto) -> set(auto_setup).
% 0.48/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.04 % set(auto) -> set(auto_limits).
% 0.48/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.04 % set(auto) -> set(auto_denials).
% 0.48/1.04 % set(auto) -> set(auto_process).
% 0.48/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.04 % set(auto2) -> assign(stats, some).
% 0.48/1.04 % set(auto2) -> clear(echo_input).
% 0.48/1.04 % set(auto2) -> set(quiet).
% 0.48/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.04 % set(auto2) -> clear(print_given).
% 0.48/1.04 assign(lrs_ticks,-1).
% 0.48/1.04 assign(sos_limit,10000).
% 0.48/1.04 assign(order,kbo).
% 0.48/1.04 set(lex_order_vars).
% 0.48/1.04 clear(print_given).
% 0.48/1.04
% 0.48/1.04 % formulas(sos). % not echoed (7 formulas)
% 0.48/1.04
% 0.48/1.04 ============================== end of input ==========================
% 0.48/1.04
% 0.48/1.04 % From the command line: assign(max_seconds, 300).
% 0.48/1.04
% 0.48/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.04
% 0.48/1.04 % Formulas that are not ordinary clauses:
% 0.48/1.04 1 (all X all T (organization(X,T) -> (exists R reliability(X,R,T)))) # label(mp1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 2 (all X all T (organization(X,T) -> (exists A accountability(X,A,T)))) # label(mp2) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 3 (all X all T (organization(X,T) -> (exists Rp reproducibility(X,Rp,T)))) # label(mp3) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 4 (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.48/1.04 5 (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.48/1.04 6 (all X all Y all T1 all T2 all Rp1 all Rp2 all I1 all I2 (organization(X,T1) & organization(Y,T2) & reorganization_free(X,T1,T1) & reorganization_free(Y,T2,T2) & reproducibility(X,Rp1,T1) & reproducibility(Y,Rp2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) -> (greater(Rp2,Rp1) <-> greater(I2,I1)))) # label(a3_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.48/1.04 7 -(all X all Y all T1 all T2 all I1 all I2 all P1 all P2 (organization(X,T1) & organization(Y,T2) & reorganization_free(X,T1,T1) & reorganization_free(Y,T2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) & survival_chance(X,P1,T1) & survival_chance(Y,P2,T2) & greater(I2,I1) -> greater(P2,P1))) # label(t1_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.04
% 0.48/1.04 ============================== end of process non-clausal formulas ===
% 0.78/1.07
% 0.78/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.07
% 0.78/1.07 ============================== PREDICATE ELIMINATION =================
% 0.78/1.07
% 0.78/1.07 ============================== end predicate elimination =============
% 0.78/1.07
% 0.78/1.07 Auto_denials:
% 0.78/1.07 % copying label t1_FOL to answer in negative clause
% 0.78/1.07
% 0.78/1.07 Term ordering decisions:
% 0.78/1.07 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. f1=1. f2=1. f3=1.
% 0.78/1.07
% 0.78/1.07 ============================== end of process initial clauses ========
% 0.78/1.07
% 0.78/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.78/1.07
% 0.78/1.07 ============================== end of clauses for search =============
% 0.78/1.07
% 0.78/1.07 ============================== SEARCH ================================
% 0.78/1.07
% 0.78/1.07 % Starting search at 0.01 seconds.
% 0.78/1.07
% 0.78/1.07 ============================== PROOF =================================
% 0.78/1.07 % SZS status Theorem
% 0.78/1.07 % SZS output start Refutation
% 0.78/1.07
% 0.78/1.07 % Proof 1 at 0.04 (+ 0.00) seconds: t1_FOL.
% 0.78/1.07 % Length of proof is 35.
% 0.78/1.07 % Level of proof is 6.
% 0.78/1.07 % Maximum clause weight is 39.000.
% 0.78/1.07 % Given clauses 35.
% 0.78/1.07
% 0.78/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.78/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.78/1.07 3 (all X all T (organization(X,T) -> (exists Rp reproducibility(X,Rp,T)))) # label(mp3) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.07 4 (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.78/1.07 5 (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.78/1.07 6 (all X all Y all T1 all T2 all Rp1 all Rp2 all I1 all I2 (organization(X,T1) & organization(Y,T2) & reorganization_free(X,T1,T1) & reorganization_free(Y,T2,T2) & reproducibility(X,Rp1,T1) & reproducibility(Y,Rp2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) -> (greater(Rp2,Rp1) <-> greater(I2,I1)))) # label(a3_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.78/1.07 7 -(all X all Y all T1 all T2 all I1 all I2 all P1 all P2 (organization(X,T1) & organization(Y,T2) & reorganization_free(X,T1,T1) & reorganization_free(Y,T2,T2) & inertia(X,I1,T1) & inertia(Y,I2,T2) & survival_chance(X,P1,T1) & survival_chance(Y,P2,T2) & greater(I2,I1) -> greater(P2,P1))) # label(t1_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.78/1.07 8 organization(c1,c3) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 9 organization(c2,c4) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 10 greater(c6,c5) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 11 reorganization_free(c1,c3,c3) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 12 reorganization_free(c2,c4,c4) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 13 inertia(c1,c5,c3) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 14 inertia(c2,c6,c4) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 15 survival_chance(c1,c7,c3) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 16 survival_chance(c2,c8,c4) # label(t1_FOL) # label(negated_conjecture). [clausify(7)].
% 0.78/1.07 17 -greater(c8,c7) # label(t1_FOL) # label(negated_conjecture) # answer(t1_FOL). [clausify(7)].
% 0.78/1.07 18 -organization(A,B) | reliability(A,f1(A,B),B) # label(mp1) # label(axiom). [clausify(1)].
% 0.78/1.07 19 -organization(A,B) | accountability(A,f2(A,B),B) # label(mp2) # label(axiom). [clausify(2)].
% 0.78/1.07 20 -organization(A,B) | reproducibility(A,f3(A,B),B) # label(mp3) # label(axiom). [clausify(3)].
% 0.78/1.07 21 -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) # label(hypothesis). [clausify(5)].
% 0.78/1.07 22 -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) # label(hypothesis). [clausify(5)].
% 0.78/1.07 24 -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(F,E) | -greater(V7,V6) # label(a3_FOL) # label(hypothesis). [clausify(6)].
% 0.78/1.07 25 -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(4)].
% 0.78/1.07 27 reliability(c2,f1(c2,c4),c4). [ur(18,a,9,a)].
% 0.78/1.07 28 reliability(c1,f1(c1,c3),c3). [ur(18,a,8,a)].
% 0.78/1.07 29 accountability(c2,f2(c2,c4),c4). [ur(19,a,9,a)].
% 0.78/1.07 30 accountability(c1,f2(c1,c3),c3). [ur(19,a,8,a)].
% 0.78/1.07 31 reproducibility(c2,f3(c2,c4),c4). [ur(20,a,9,a)].
% 0.78/1.07 32 reproducibility(c1,f3(c1,c3),c3). [ur(20,a,8,a)].
% 0.78/1.07 92 greater(f3(c2,c4),f3(c1,c3)). [ur(24,a,8,a,b,9,a,c,11,a,d,12,a,e,32,a,f,31,a,g,13,a,h,14,a,j,10,a)].
% 0.78/1.07 118 greater(f2(c2,c4),f2(c1,c3)). [ur(22,a,8,a,b,9,a,c,28,a,d,27,a,e,30,a,f,29,a,g,32,a,h,31,a,i,92,a)].
% 0.78/1.07 119 greater(f1(c2,c4),f1(c1,c3)). [ur(21,a,8,a,b,9,a,c,28,a,d,27,a,e,30,a,f,29,a,g,32,a,h,31,a,i,92,a)].
% 0.78/1.07 123 -greater(f1(c2,c4),f1(c1,c3)) # answer(t1_FOL). [ur(25,a,8,a,b,9,a,c,28,a,d,27,a,e,30,a,f,29,a,g,15,a,h,16,a,j,118,a,k,17,a)].
% 0.78/1.07 124 $F # answer(t1_FOL). [resolve(123,a,119,a)].
% 0.78/1.07
% 0.78/1.07 % SZS output end Refutation
% 0.78/1.07 ============================== end of proof ==========================
% 0.78/1.07
% 0.78/1.07 ============================== STATISTICS ============================
% 0.78/1.07
% 0.78/1.07 Given=35. Generated=127. Kept=116. proofs=1.
% 0.78/1.07 Usable=33. Sos=50. Demods=0. Limbo=3, Disabled=48. Hints=0.
% 0.78/1.07 Megabytes=0.21.
% 0.78/1.07 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.78/1.07
% 0.78/1.07 ============================== end of statistics =====================
% 0.78/1.07
% 0.78/1.07 ============================== end of search =========================
% 0.78/1.07
% 0.78/1.07 THEOREM PROVED
% 0.78/1.07 % SZS status Theorem
% 0.78/1.07
% 0.78/1.07 Exiting with 1 proof.
% 0.78/1.07
% 0.78/1.07 Process 20622 exit (max_proofs) Thu Jun 9 09:15:55 2022
% 0.78/1.07 Prover9 interrupted
%------------------------------------------------------------------------------