TSTP Solution File: MGT005+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.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:47 EDT 2022
% Result : Theorem 1.57s 1.88s
% Output : Refutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:11:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 14481 was started by sandbox on n019.cluster.edu,
% 0.44/1.00 Thu Jun 9 09:11:55 2022
% 0.44/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14327_n019.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_14327_n019.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (13 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00 1 (all X all Y -(greater(X,Y) & X = Y)) # label(mp6_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 2 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(mp6_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 3 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp11) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 4 (all X all Y all P1 all P2 all T (survival_chance(X,P1,T) & survival_chance(Y,P2,T) -> greater(P1,P2) | P1 = P2 | greater(P2,P1))) # label(mp14) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 5 (all X all T (organization(X,T) -> (exists P survival_chance(X,P,T)))) # label(mp12) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 6 (all X all T all T1 all T2 (organization(X,T1) & organization(X,T2) & greater(T,T1) & greater(T2,T) -> organization(X,T))) # label(mp13) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 7 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 8 (all X all P1 all P2 all T1 all T2 (organization(X,T1) & organization(X,T2) & reorganization_free(X,T1,T2) & survival_chance(X,P1,T1) & survival_chance(X,P2,T2) & greater(T2,T1) -> greater(P2,P1))) # label(t3_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.00 9 (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(hypothesis) # label(non_clause). [assumption].
% 0.44/1.00 10 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & reorganization_type(Y,Re,Ta) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 1.57/1.88 11 (all X all Y all Re all C all P all P1 all P2 all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(X,Tb) & organization(Y,Tb) & class(X,C,Ta) & class(Y,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & reorganization_type(Y,Re,Ta) & survival_chance(X,P1,Tb) & survival_chance(Y,P2,Tb) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) -> greater(P1,P2) | P1 = P2)) # label(a11_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 1.57/1.88 12 (all X all Y all Px1 all Px2 all Py1 all Py2 all T1 all T2 (greater(T2,T1) & survival_chance(X,Px1,T1) & survival_chance(Y,Py1,T1) & survival_chance(X,Px2,T2) & survival_chance(Y,Py2,T2) & greater(Px2,Px1) & greater(Py1,Px2) -> (exists T0 exists Px0 exists Py0 (greater(T0,T1) & greater(T2,T0) & survival_chance(X,Px0,T0) & survival_chance(Y,Py0,T0) & Px0 = Py0)))) # label(a15_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 1.57/1.88 13 -(all X all Y all Re all C all P all P1 all P2 all C1 all C2 all T all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(X,Tc) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & reorganization_type(Y,Re,Ta) & reorganization_free(X,Tb,Tc) & survival_chance(X,P1,T) & survival_chance(Y,P2,T) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & (T = Tc -> greater(P1,P2)) -> (T = Tb -> greater(P1,P2) | P1 = P2))) # label(t5_plus_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.57/1.88
% 1.57/1.88 ============================== end of process non-clausal formulas ===
% 1.57/1.88
% 1.57/1.88 ============================== PROCESS INITIAL CLAUSES ===============
% 1.57/1.88
% 1.57/1.88 ============================== PREDICATE ELIMINATION =================
% 1.57/1.88 14 -organization(A,B) | -organization(A,C) | -reorganization_free(A,B,C) | -survival_chance(A,D,B) | -survival_chance(A,E,C) | -greater(C,B) | greater(E,D) # label(t3_FOL) # label(hypothesis). [clausify(8)].
% 1.57/1.88 15 reorganization_free(c1,c12,c13) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 Derived: -organization(c1,c12) | -organization(c1,c13) | -survival_chance(c1,A,c12) | -survival_chance(c1,B,c13) | -greater(c13,c12) | greater(B,A). [resolve(14,c,15,a)].
% 1.57/1.88
% 1.57/1.88 ============================== end predicate elimination =============
% 1.57/1.88
% 1.57/1.88 Auto_denials: (non-Horn, no changes).
% 1.57/1.88
% 1.57/1.88 Term ordering decisions:
% 1.57/1.88 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. f1=1. f2=1. f3=1. f4=1.
% 1.57/1.88
% 1.57/1.88 ============================== end of process initial clauses ========
% 1.57/1.88
% 1.57/1.88 ============================== CLAUSES FOR SEARCH ====================
% 1.57/1.88
% 1.57/1.88 ============================== end of clauses for search =============
% 1.57/1.88
% 1.57/1.88 ============================== SEARCH ================================
% 1.57/1.88
% 1.57/1.88 % Starting search at 0.03 seconds.
% 1.57/1.88
% 1.57/1.88 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 0.38 sec).
% 1.57/1.88
% 1.57/1.88 ============================== PROOF =================================
% 1.57/1.88 % SZS status Theorem
% 1.57/1.88 % SZS output start Refutation
% 1.57/1.88
% 1.57/1.88 % Proof 1 at 0.89 (+ 0.01) seconds.
% 1.57/1.88 % Length of proof is 47.
% 1.57/1.88 % Level of proof is 10.
% 1.57/1.88 % Maximum clause weight is 69.000.
% 1.57/1.88 % Given clauses 1392.
% 1.57/1.88
% 1.57/1.88 6 (all X all T all T1 all T2 (organization(X,T1) & organization(X,T2) & greater(T,T1) & greater(T2,T) -> organization(X,T))) # label(mp13) # label(axiom) # label(non_clause). [assumption].
% 1.57/1.88 7 (all X all Ta all Tb (reorganization(X,Ta,Tb) -> greater(Tb,Ta))) # label(mp7) # label(axiom) # label(non_clause). [assumption].
% 1.57/1.88 10 (all X all Y all Re all C all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & reorganization_type(Y,Re,Ta) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) -> greater(Tc,Tb))) # label(a10_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 1.57/1.88 11 (all X all Y all Re all C all P all P1 all P2 all C1 all C2 all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(X,Tb) & organization(Y,Tb) & class(X,C,Ta) & class(Y,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & reorganization_type(Y,Re,Ta) & survival_chance(X,P1,Tb) & survival_chance(Y,P2,Tb) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) -> greater(P1,P2) | P1 = P2)) # label(a11_FOL) # label(hypothesis) # label(non_clause). [assumption].
% 1.57/1.88 13 -(all X all Y all Re all C all P all P1 all P2 all C1 all C2 all T all Ta all Tb all Tc (organization(X,Ta) & organization(Y,Ta) & organization(X,Tc) & organization(Y,Tc) & class(X,C,Ta) & class(Y,C,Ta) & survival_chance(X,P,Ta) & survival_chance(Y,P,Ta) & reorganization(X,Ta,Tb) & reorganization(Y,Ta,Tc) & reorganization_type(X,Re,Ta) & reorganization_type(Y,Re,Ta) & reorganization_free(X,Tb,Tc) & survival_chance(X,P1,T) & survival_chance(Y,P2,T) & complexity(X,C1,Ta) & complexity(Y,C2,Ta) & greater(C2,C1) & (T = Tc -> greater(P1,P2)) -> (T = Tb -> greater(P1,P2) | P1 = P2))) # label(t5_plus_FOL) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.57/1.88 16 organization(c1,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 17 organization(c2,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 18 organization(c1,c13) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 19 organization(c2,c13) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 20 greater(c9,c8) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 21 c12 = c10 # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 22 class(c1,c4,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 23 class(c2,c4,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 24 survival_chance(c1,c5,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 25 survival_chance(c2,c5,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 26 reorganization(c1,c11,c12) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 27 reorganization(c1,c11,c10). [copy(26),rewrite([21(3)])].
% 1.57/1.88 28 reorganization(c2,c11,c13) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 29 reorganization_type(c1,c3,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 30 reorganization_type(c2,c3,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 31 survival_chance(c1,c6,c10) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 32 survival_chance(c2,c7,c10) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 33 complexity(c1,c8,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 34 complexity(c2,c9,c11) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 35 -greater(c6,c7) # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 36 c7 != c6 # label(t5_plus_FOL) # label(negated_conjecture). [clausify(13)].
% 1.57/1.88 41 -reorganization(A,B,C) | greater(C,B) # label(mp7) # label(axiom). [clausify(7)].
% 1.57/1.88 44 -organization(A,B) | -organization(A,C) | -greater(D,B) | -greater(C,D) | organization(A,D) # label(mp13) # label(axiom). [clausify(6)].
% 1.57/1.88 52 -organization(A,B) | -organization(C,B) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -reorganization(A,B,F) | -reorganization(C,B,D) | -reorganization_type(A,V6,B) | -reorganization_type(C,V6,B) | -complexity(A,V7,B) | -complexity(C,V8,B) | -greater(V8,V7) | greater(D,F) # label(a10_FOL) # label(hypothesis). [clausify(10)].
% 1.57/1.88 53 -organization(A,B) | -organization(C,B) | -organization(A,D) | -organization(C,D) | -class(A,E,B) | -class(C,E,B) | -survival_chance(A,F,B) | -survival_chance(C,F,B) | -reorganization(A,B,D) | -reorganization(C,B,V6) | -reorganization_type(A,V7,B) | -reorganization_type(C,V7,B) | -survival_chance(A,V8,D) | -survival_chance(C,V9,D) | -complexity(A,V10,B) | -complexity(C,V11,B) | -greater(V11,V10) | greater(V8,V9) | V9 = V8 # label(a11_FOL) # label(hypothesis). [clausify(11)].
% 1.57/1.89 97 greater(c10,c11). [resolve(41,a,27,a)].
% 1.57/1.89 107 -organization(c2,A) | -greater(B,c11) | -greater(A,B) | organization(c2,B). [resolve(44,a,17,a)].
% 1.57/1.89 108 -organization(c1,A) | -greater(B,c11) | -greater(A,B) | organization(c1,B). [resolve(44,a,16,a)].
% 1.57/1.89 423 -organization(A,c11) | -organization(A,B) | -class(c1,C,c11) | -class(A,C,c11) | -reorganization(c1,c11,D) | -reorganization(A,c11,B) | -reorganization_type(A,c3,c11) | -complexity(c1,E,c11) | -complexity(A,F,c11) | -greater(F,E) | greater(B,D). [resolve(52,h,29,a),unit_del(a,16)].
% 1.57/1.89 859 -greater(A,c11) | -greater(c13,A) | organization(c2,A). [resolve(107,a,19,a)].
% 1.57/1.89 860 -greater(c13,c10) | organization(c2,c10). [resolve(859,a,97,a)].
% 1.57/1.89 861 -greater(A,c11) | -greater(c13,A) | organization(c1,A). [resolve(108,a,18,a)].
% 1.57/1.89 864 -greater(c13,c10) | organization(c1,c10). [resolve(861,a,97,a)].
% 1.57/1.89 2087 -organization(c2,A) | -class(c1,B,c11) | -class(c2,B,c11) | -reorganization(c1,c11,C) | -reorganization(c2,c11,A) | -complexity(c1,D,c11) | -complexity(c2,E,c11) | -greater(E,D) | greater(A,C). [resolve(423,g,30,a),unit_del(a,17)].
% 1.57/1.89 2088 -organization(c2,A) | -class(c1,B,c11) | -class(c2,B,c11) | -reorganization(c1,c11,C) | -reorganization(c2,c11,A) | -complexity(c2,D,c11) | -greater(D,c8) | greater(A,C). [resolve(2087,f,33,a)].
% 1.57/1.89 2090 -organization(c2,A) | -class(c1,B,c11) | -class(c2,B,c11) | -reorganization(c1,c11,C) | -reorganization(c2,c11,A) | greater(A,C). [resolve(2088,f,34,a),unit_del(f,20)].
% 1.57/1.89 2091 -organization(c2,A) | -reorganization(c1,c11,B) | -reorganization(c2,c11,A) | greater(A,B). [resolve(2090,c,23,a),unit_del(b,22)].
% 1.57/1.89 2093 -reorganization(c1,c11,A) | greater(c13,A). [resolve(2091,c,28,a),unit_del(a,19)].
% 1.57/1.89 2094 greater(c13,c10). [resolve(2093,a,27,a)].
% 1.57/1.89 2231 organization(c1,c10). [back_unit_del(864),unit_del(a,2094)].
% 1.57/1.89 2232 organization(c2,c10). [back_unit_del(860),unit_del(a,2094)].
% 1.57/1.89 2432 $F. [ur(53,a,16,a,b,17,a,c,2231,a,e,22,a,f,23,a,g,24,a,h,25,a,i,27,a,j,28,a,k,29,a,l,30,a,m,31,a,n,32,a,o,33,a,p,34,a,q,20,a,r,35,a,s,36,a),unit_del(a,2232)].
% 1.57/1.89
% 1.57/1.89 % SZS output end Refutation
% 1.57/1.89 ============================== end of proof ==========================
% 1.57/1.89
% 1.57/1.89 ============================== STATISTICS ============================
% 1.57/1.89
% 1.57/1.89 Given=1392. Generated=9168. Kept=2413. proofs=1.
% 1.57/1.89 Usable=1190. Sos=854. Demods=1. Limbo=11, Disabled=397. Hints=0.
% 1.57/1.89 Megabytes=4.17.
% 1.57/1.89 User_CPU=0.89, System_CPU=0.01, Wall_clock=1.
% 1.57/1.89
% 1.57/1.89 ============================== end of statistics =====================
% 1.57/1.89
% 1.57/1.89 ============================== end of search =========================
% 1.57/1.89
% 1.57/1.89 THEOREM PROVED
% 1.57/1.89 % SZS status Theorem
% 1.57/1.89
% 1.57/1.89 Exiting with 1 proof.
% 1.57/1.89
% 1.57/1.89 Process 14481 exit (max_proofs) Thu Jun 9 09:11:56 2022
% 1.57/1.89 Prover9 interrupted
%------------------------------------------------------------------------------