TSTP Solution File: MGT034+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT034+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:57 EDT 2022
% Result : Unknown 0.42s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT034+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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 11:05:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.98 ============================== Prover9 ===============================
% 0.42/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.98 Process 19464 was started by sandbox on n019.cluster.edu,
% 0.42/0.98 Thu Jun 9 11:05:10 2022
% 0.42/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19311_n019.cluster.edu".
% 0.42/0.98 ============================== end of head ===========================
% 0.42/0.98
% 0.42/0.98 ============================== INPUT =================================
% 0.42/0.98
% 0.42/0.98 % Reading from file /tmp/Prover9_19311_n019.cluster.edu
% 0.42/0.98
% 0.42/0.98 set(prolog_style_variables).
% 0.42/0.98 set(auto2).
% 0.42/0.98 % set(auto2) -> set(auto).
% 0.42/0.98 % set(auto) -> set(auto_inference).
% 0.42/0.98 % set(auto) -> set(auto_setup).
% 0.42/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.98 % set(auto) -> set(auto_limits).
% 0.42/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.98 % set(auto) -> set(auto_denials).
% 0.42/0.98 % set(auto) -> set(auto_process).
% 0.42/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.98 % set(auto2) -> assign(stats, some).
% 0.42/0.98 % set(auto2) -> clear(echo_input).
% 0.42/0.98 % set(auto2) -> set(quiet).
% 0.42/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.98 % set(auto2) -> clear(print_given).
% 0.42/0.98 assign(lrs_ticks,-1).
% 0.42/0.98 assign(sos_limit,10000).
% 0.42/0.98 assign(order,kbo).
% 0.42/0.98 set(lex_order_vars).
% 0.42/0.98 clear(print_given).
% 0.42/0.98
% 0.42/0.98 % formulas(sos). % not echoed (19 formulas)
% 0.42/0.98
% 0.42/0.98 ============================== end of input ==========================
% 0.42/0.98
% 0.42/0.98 % From the command line: assign(max_seconds, 300).
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.98
% 0.42/0.98 % Formulas that are not ordinary clauses:
% 0.42/0.98 1 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) & greater(growth_rate(S2,T),growth_rate(S1,T)) -> selection_favors(S2,S1,T))) # label(mp1_high_growth_rates) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 2 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))))) # label(l3) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 3 (all E (environment(E) & in_environment(E,critical_point(E)) -> subpopulations(first_movers,efficient_producers,E,critical_point(E)))) # label(mp_critical_point_means_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 4 (all E (environment(E) & in_environment(E,appear(efficient_producers,E)) -> subpopulations(first_movers,efficient_producers,E,appear(efficient_producers,E)))) # label(mp_FM_and_EP_when_EP_appears) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 5 (all E all T all To (environment(E) & in_environment(E,To) & greater_or_equal(difference(growth_rate(first_movers,To),growth_rate(efficient_producers,To)),zero) & greater_or_equal(T,appear(efficient_producers,E)) & greater(To,T) -> (decreases(difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T))) -> greater(difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T)),zero)))) # label(mp_decreasing_function) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 6 (all T (decreases(difference(founding_rate(first_movers,T),founding_rate(efficient_producers,T))) & -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))) -> decreases(difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T))))) # label(mp_difference_between_founding_rates) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 7 (all T (greater(zero,difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T))) <-> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))) # label(mp_negative_growth_rate_difference) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 8 (all T (greater(difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T)),zero) <-> greater(growth_rate(first_movers,T),growth_rate(efficient_producers,T)))) # label(mp_positive_growth_rate_difference) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 9 (all E all T1 all T2 all T (environment(E) & in_environment(E,T1) & in_environment(E,T2) & greater_or_equal(T2,T) & greater_or_equal(T,T1) -> in_environment(E,T))) # label(mp_durations_are_time_intervals) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 10 (all E (environment(E) -> in_environment(E,start_time(E)))) # label(mp_opening_time_in_duration) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 11 (all E (environment(E) -> greater_or_equal(appear(first_movers,E),start_time(E)))) # label(mp_no_FM_before_opening) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 12 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> subpopulations(efficient_producers,first_movers,E,T))) # label(mp_symmetry_of_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 13 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater_or_equal(T,appear(efficient_producers,E)))) # label(mp_FM_and_EP_members_EP_appeared) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 14 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 15 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & -greater(zero,difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T))) -> greater_or_equal(difference(growth_rate(first_movers,T),growth_rate(efficient_producers,T)),zero))) # label(mp_relationship_of_growth_rates) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 16 (all E all T1 all T2 all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T1) & subpopulations(first_movers,efficient_producers,E,T2) & greater_or_equal(T,T1) & greater_or_equal(T2,T) -> subpopulations(first_movers,efficient_producers,E,T))) # label(a10) # label(hypothesis) # label(non_clause). [assumption].
% 0.42/0.98 17 (all E all Tc (environment(E) & Tc = critical_point(E) -> -greater(growth_rate(efficient_producers,Tc),growth_rate(first_movers,Tc)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,Tc) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))))) # label(d1) # label(hypothesis) # label(non_clause). [assumption].
% 0.42/0.98 18 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> decreases(difference(founding_rate(first_movers,T),founding_rate(efficient_producers,T))))) # label(a11) # label(hypothesis) # label(non_clause). [assumption].
% 0.42/0.98 19 -(all E all T (environment(E) & in_environment(E,critical_point(E)) & greater_or_equal(T,appear(efficient_producers,E)) & greater(critical_point(E),T) -> selection_favors(first_movers,efficient_producers,T))) # label(prove_t3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.98
% 0.42/0.98 ============================== end of process non-clausal formulas ===
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.98
% 0.42/0.98 ============================== PREDICATE ELIMINATION =================
% 0.42/0.98 20 -environment(A) | critical_point(A) != B | -greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(d1) # label(hypothesis). [clausify(17)].
% 0.42/0.98 21 environment(c1) # label(prove_t3) # label(negated_conjecture). [clausify(19)].
% 0.42/0.98 Derived: critical_point(c1) != A | -greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(20,a,21,a)].
% 0.42/0.98 22 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l3) # label(axiom). [clausify(2)].
% 0.42/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(22,a,21,a)].
% 0.42/0.98 23 -environment(A) | in_environment(A,start_time(A)) # label(mp_opening_time_in_duration) # label(axiom). [clausify(10)].
% 0.42/0.98 Derived: in_environment(c1,start_time(c1)). [resolve(23,a,21,a)].
% 0.42/0.98 24 -environment(A) | greater_or_equal(appear(first_movers,A),start_time(A)) # label(mp_no_FM_before_opening) # label(axiom). [clausify(11)].
% 0.42/0.98 Derived: greater_or_equal(appear(first_movers,c1),start_time(c1)). [resolve(24,a,21,a)].
% 0.42/0.98 25 -environment(A) | -in_environment(A,critical_point(A)) | subpopulations(first_movers,efficient_producers,A,critical_point(A)) # label(mp_critical_point_means_FM_and_EP) # label(axiom). [clausify(3)].
% 0.42/0.98 Derived: -in_environment(c1,critical_point(c1)) | subpopulations(first_movers,efficient_producers,c1,critical_point(c1)). [resolve(25,a,21,a)].
% 0.42/0.98 26 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | subpopulations(efficient_producers,first_movers,A,B) # label(mp_symmetry_of_FM_and_EP) # label(axiom). [clausify(12)].
% 0.42/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | subpopulations(efficient_producers,first_movers,c1,A). [resolve(26,a,21,a)].
% 0.42/0.98 27 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater_or_equal(B,appear(efficient_producers,A)) # label(mp_FM_and_EP_members_EP_appeared) # label(axiom). [clausify(13)].
% 0.42/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | greater_or_equal(A,appear(efficient_producers,c1)). [resolve(27,a,21,a)].
% 0.42/0.98 28 -environment(A) | -in_environment(A,appear(efficient_producers,A)) | subpopulations(first_movers,efficient_producers,A,appear(efficient_producers,A)) # label(mp_FM_and_EP_when_EP_appears) # label(axiom). [clausify(4)].
% 0.42/0.98 Derived: -in_environment(c1,appear(efficient_producers,c1)) | subpopulations(first_movers,efficient_producers,c1,appear(efficient_producers,c1)). [resolve(28,a,21,a)].
% 0.42/0.98 29 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | decreases(difference(founding_rate(first_movers,B),founding_rate(efficient_producers,B))) # label(a11) # label(hypothesis). [clausify(18)].
% 0.42/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | decreases(difference(founding_rate(first_movers,A),founding_rate(efficient_producers,A))). [resolve(29,a,21,a)].
% 0.42/0.98 30 -environment(A) | -in_environment(A,B) | -in_environment(A,C) | -greater_or_equal(C,D) | -greater_or_equal(D,B) | in_environment(A,D) # label(mp_durations_are_time_intervals) # label(axiom). [clausify(9)].
% 0.42/0.98 Derived: -in_environment(c1,A) | -in_environment(c1,B) | -greater_or_equal(B,C) | -greater_or_equal(C,A) | in_environment(c1,C). [resolve(30,a,21,a)].
% 0.42/0.98 31 -environment(A) | -subpopulations(B,C,A,D) | -greater(growth_rate(C,D),growth_rate(B,D)) | selection_favors(C,B,D) # label(mp1_high_growth_rates) # label(axiom). [clausify(1)].
% 0.42/0.98 Derived: -subpopulations(A,B,c1,C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(31,a,21,a)].
% 0.42/0.98 32 -environment(A) | critical_point(A) != B | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,B) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(d1) # label(hypothesis). [clausify(17)].
% 0.42/0.98 Derived: critical_point(c1) != A | -subpopulations(first_movers,efficient_producers,c1,B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(32,a,21,a)].
% 0.42/0.98 33 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(D,B) | -greater_or_equal(C,D) | subpopulations(first_movers,efficient_producers,A,D) # label(a10) # label(hypothesis). [clausify(16)].
% 0.42/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(C,A) | -greater_or_equal(B,C) | subpopulations(first_movers,efficient_producers,c1,C). [resolve(33,a,21,a)].
% 0.42/0.98 34 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(zero,difference(growth_rate(first_movers,B),growth_rate(efficient_producers,B))) | greater_or_equal(difference(growth_rate(first_movers,B),growth_rate(efficient_producers,B)),zero) # label(mp_relationship_of_growth_rates) # label(axiom). [clausify(15)].
% 0.42/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | greater(zero,difference(growth_rate(first_movers,A),growth_rate(efficient_producers,A))) | greater_or_equal(difference(growth_rate(first_movers,A),growth_rate(efficient_producers,A)),zero). [resolve(34,a,21,a)].
% 0.42/0.99 35 -environment(A) | -in_environment(A,B) | -greater_or_equal(difference(growth_rate(first_movers,B),growth_rate(efficient_producers,B)),zero) | -greater_or_equal(C,appear(efficient_producers,A)) | -greater(B,C) | -decreases(difference(growth_rate(first_movers,C),growth_rate(efficient_producers,C))) | greater(difference(growth_rate(first_movers,C),growth_rate(efficient_producers,C)),zero) # label(mp_decreasing_function) # label(axiom). [clausify(5)].
% 0.42/0.99 Derived: -in_environment(c1,A) | -greater_or_equal(difference(growth_rate(first_movers,A),growth_rate(efficient_producers,A)),zero) | -greater_or_equal(B,appear(efficient_producers,c1)) | -greater(A,B) | -decreases(difference(growth_rate(first_movers,B),growth_rate(efficient_producers,B))) | greater(difference(growth_rate(first_movers,B),growth_rate(efficient_producers,B)),zero). [resolve(35,a,21,a)].
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials: (non-Horn, no changes).
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99 Function symbol KB weights: efficient_producers=1. first_movers=1. zero=1. c1=1. c2=1. growth_rate=1. difference=1. appear=1. founding_rate=1. disbanding_rate=1. critical_point=1. start_time=1.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.02 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=76. Generated=126. Kept=79. proofs=0.
% 0.42/0.99 Usable=76. Sos=0. Demods=0. Limbo=0, Disabled=46. Hints=0.
% 0.42/0.99 Megabytes=0.20.
% 0.42/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 SEARCH FAILED
% 0.42/0.99
% 0.42/0.99 Exiting with failure.
% 0.42/0.99
% 0.42/0.99 Process 19464 exit (sos_empty) Thu Jun 9 11:05:10 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------