TSTP Solution File: MGT006+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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.47s 1.06s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 08:32:23 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.47/1.05 ============================== Prover9 ===============================
% 0.47/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.05 Process 5784 was started by sandbox2 on n023.cluster.edu,
% 0.47/1.05 Thu Jun 9 08:32:23 2022
% 0.47/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5631_n023.cluster.edu".
% 0.47/1.05 ============================== end of head ===========================
% 0.47/1.05
% 0.47/1.05 ============================== INPUT =================================
% 0.47/1.05
% 0.47/1.05 % Reading from file /tmp/Prover9_5631_n023.cluster.edu
% 0.47/1.05
% 0.47/1.05 set(prolog_style_variables).
% 0.47/1.05 set(auto2).
% 0.47/1.05 % set(auto2) -> set(auto).
% 0.47/1.05 % set(auto) -> set(auto_inference).
% 0.47/1.05 % set(auto) -> set(auto_setup).
% 0.47/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.05 % set(auto) -> set(auto_limits).
% 0.47/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.05 % set(auto) -> set(auto_denials).
% 0.47/1.05 % set(auto) -> set(auto_process).
% 0.47/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.05 % set(auto2) -> assign(stats, some).
% 0.47/1.05 % set(auto2) -> clear(echo_input).
% 0.47/1.05 % set(auto2) -> set(quiet).
% 0.47/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.05 % set(auto2) -> clear(print_given).
% 0.47/1.05 assign(lrs_ticks,-1).
% 0.47/1.05 assign(sos_limit,10000).
% 0.47/1.05 assign(order,kbo).
% 0.47/1.05 set(lex_order_vars).
% 0.47/1.05 clear(print_given).
% 0.47/1.05
% 0.47/1.05 % formulas(sos). % not echoed (4 formulas)
% 0.47/1.05
% 0.47/1.05 ============================== end of input ==========================
% 0.47/1.05
% 0.47/1.05 % From the command line: assign(max_seconds, 300).
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.05
% 0.47/1.05 % Formulas that are not ordinary clauses:
% 0.47/1.05 1 (all X all T (organization(X,T) -> (exists Rp reproducibility(X,Rp,T)))) # label(mp3) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 2 (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.47/1.05 3 (all X all Rp1 all Rp2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & reproducibility(X,Rp1,T1) & reproducibility(X,Rp2,T2) & greater(T2,T1) -> greater(Rp2,Rp1))) # label(a4_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.47/1.05 4 -(all X all R1 all R2 all A1 all A2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & reliability(X,R1,T1) & reliability(X,R2,T2) & accountability(X,A1,T1) & accountability(X,A2,T2) & greater(T2,T1) -> greater(R2,R1) & greater(A2,A1))) # label(t6_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.05
% 0.47/1.05 ============================== end of process non-clausal formulas ===
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.05
% 0.47/1.05 ============================== PREDICATE ELIMINATION =================
% 0.47/1.05 5 -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) # label(hypothesis). [clausify(3)].
% 0.47/1.05 6 reorganization_free(c1,c6,c7) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.05 Derived: -organization(c1,c6) | -organization(c1,c7) | -reproducibility(c1,A,c6) | -reproducibility(c1,B,c7) | -greater(c7,c6) | greater(B,A). [resolve(5,c,6,a)].
% 0.47/1.05
% 0.47/1.05 ============================== end predicate elimination =============
% 0.47/1.05
% 0.47/1.05 Auto_denials:
% 0.47/1.05 % copying label t6_FOL to answer in negative clause
% 0.47/1.06
% 0.47/1.06 Term ordering decisions:
% 0.47/1.06 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f1=1.
% 0.47/1.06
% 0.47/1.06 ============================== end of process initial clauses ========
% 0.47/1.06
% 0.47/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.06
% 0.47/1.06 ============================== end of clauses for search =============
% 0.47/1.06
% 0.47/1.06 ============================== SEARCH ================================
% 0.47/1.06
% 0.47/1.06 % Starting search at 0.01 seconds.
% 0.47/1.06
% 0.47/1.06 ============================== PROOF =================================
% 0.47/1.06 % SZS status Theorem
% 0.47/1.06 % SZS output start Refutation
% 0.47/1.06
% 0.47/1.06 % Proof 1 at 0.02 (+ 0.00) seconds: t6_FOL.
% 0.47/1.06 % Length of proof is 25.
% 0.47/1.06 % Level of proof is 6.
% 0.47/1.06 % Maximum clause weight is 36.000.
% 0.47/1.06 % Given clauses 20.
% 0.47/1.06
% 0.47/1.06 1 (all X all T (organization(X,T) -> (exists Rp reproducibility(X,Rp,T)))) # label(mp3) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 2 (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.47/1.06 3 (all X all Rp1 all Rp2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & reproducibility(X,Rp1,T1) & reproducibility(X,Rp2,T2) & greater(T2,T1) -> greater(Rp2,Rp1))) # label(a4_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.47/1.06 4 -(all X all R1 all R2 all A1 all A2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & reliability(X,R1,T1) & reliability(X,R2,T2) & accountability(X,A1,T1) & accountability(X,A2,T2) & greater(T2,T1) -> greater(R2,R1) & greater(A2,A1))) # label(t6_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.06 5 -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) # label(hypothesis). [clausify(3)].
% 0.47/1.06 6 reorganization_free(c1,c6,c7) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 7 organization(c1,c6) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 8 organization(c1,c7) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 9 greater(c7,c6) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 10 reliability(c1,c2,c6) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 11 reliability(c1,c3,c7) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 12 accountability(c1,c4,c6) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 13 accountability(c1,c5,c7) # label(t6_FOL) # label(negated_conjecture). [clausify(4)].
% 0.47/1.06 14 -greater(c3,c2) | -greater(c5,c4) # label(t6_FOL) # label(negated_conjecture) # answer(t6_FOL). [clausify(4)].
% 0.47/1.06 15 -organization(A,B) | reproducibility(A,f1(A,B),B) # label(mp3) # label(axiom). [clausify(1)].
% 0.47/1.06 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) # label(hypothesis). [clausify(2)].
% 0.47/1.06 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) # label(hypothesis). [clausify(2)].
% 0.47/1.06 19 -organization(c1,c6) | -organization(c1,c7) | -reproducibility(c1,A,c6) | -reproducibility(c1,B,c7) | -greater(c7,c6) | greater(B,A). [resolve(5,c,6,a)].
% 0.47/1.06 20 -reproducibility(c1,A,c6) | -reproducibility(c1,B,c7) | greater(B,A). [copy(19),unit_del(a,7),unit_del(b,8),unit_del(e,9)].
% 0.47/1.06 21 reproducibility(c1,f1(c1,c7),c7). [ur(15,a,8,a)].
% 0.47/1.06 22 reproducibility(c1,f1(c1,c6),c6). [ur(15,a,7,a)].
% 0.47/1.06 60 greater(f1(c1,c7),f1(c1,c6)). [ur(20,a,22,a,b,21,a)].
% 0.47/1.06 62 greater(c5,c4). [ur(17,a,7,a,b,8,a,c,10,a,d,11,a,e,12,a,f,13,a,g,22,a,h,21,a,i,60,a)].
% 0.47/1.07 63 greater(c3,c2). [ur(16,a,7,a,b,8,a,c,10,a,d,11,a,e,12,a,f,13,a,g,22,a,h,21,a,i,60,a)].
% 0.47/1.07 68 $F # answer(t6_FOL). [back_unit_del(14),unit_del(a,63),unit_del(b,62)].
% 0.47/1.07
% 0.47/1.07 % SZS output end Refutation
% 0.47/1.07 ============================== end of proof ==========================
% 0.47/1.07
% 0.47/1.07 ============================== STATISTICS ============================
% 0.47/1.07
% 0.47/1.07 Given=20. Generated=63. Kept=60. proofs=1.
% 0.47/1.07 Usable=18. Sos=27. Demods=0. Limbo=6, Disabled=24. Hints=0.
% 0.47/1.07 Megabytes=0.12.
% 0.47/1.07 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.07
% 0.47/1.07 ============================== end of statistics =====================
% 0.47/1.07
% 0.47/1.07 ============================== end of search =========================
% 0.47/1.07
% 0.47/1.07 THEOREM PROVED
% 0.47/1.07 % SZS status Theorem
% 0.47/1.07
% 0.47/1.07 Exiting with 1 proof.
% 0.47/1.07
% 0.47/1.07 Process 5784 exit (max_proofs) Thu Jun 9 08:32:23 2022
% 0.47/1.07 Prover9 interrupted
%------------------------------------------------------------------------------