TSTP Solution File: MGT038+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT038+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:23:00 EDT 2022
% Result : Timeout 300.03s 300.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT038+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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:40:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.73/0.98 ============================== Prover9 ===============================
% 0.73/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.73/0.98 Process 27249 was started by sandbox2 on n028.cluster.edu,
% 0.73/0.98 Thu Jun 9 11:40:18 2022
% 0.73/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27096_n028.cluster.edu".
% 0.73/0.98 ============================== end of head ===========================
% 0.73/0.98
% 0.73/0.98 ============================== INPUT =================================
% 0.73/0.98
% 0.73/0.98 % Reading from file /tmp/Prover9_27096_n028.cluster.edu
% 0.73/0.98
% 0.73/0.98 set(prolog_style_variables).
% 0.73/0.98 set(auto2).
% 0.73/0.98 % set(auto2) -> set(auto).
% 0.73/0.98 % set(auto) -> set(auto_inference).
% 0.73/0.98 % set(auto) -> set(auto_setup).
% 0.73/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.73/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/0.98 % set(auto) -> set(auto_limits).
% 0.73/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/0.98 % set(auto) -> set(auto_denials).
% 0.73/0.98 % set(auto) -> set(auto_process).
% 0.73/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.73/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.73/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.73/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.73/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.73/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.73/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.73/0.98 % set(auto2) -> assign(stats, some).
% 0.73/0.98 % set(auto2) -> clear(echo_input).
% 0.73/0.98 % set(auto2) -> set(quiet).
% 0.73/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.73/0.98 % set(auto2) -> clear(print_given).
% 0.73/0.98 assign(lrs_ticks,-1).
% 0.73/0.98 assign(sos_limit,10000).
% 0.73/0.98 assign(order,kbo).
% 0.73/0.98 set(lex_order_vars).
% 0.73/0.98 clear(print_given).
% 0.73/0.98
% 0.73/0.98 % formulas(sos). % not echoed (16 formulas)
% 0.73/0.98
% 0.73/0.98 ============================== end of input ==========================
% 0.73/0.98
% 0.73/0.98 % From the command line: assign(max_seconds, 300).
% 0.73/0.98
% 0.73/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/0.98
% 0.73/0.98 % Formulas that are not ordinary clauses:
% 0.73/0.98 1 (all S all To (finite_set(S) & contracts_from(To,S) -> (exists T2 (greater(T2,To) & cardinality_at_time(s,t2) = zero)))) # label(mp_contracting_time) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 2 (all E all To (environment(E) & stable(E) & in_environment(E,To) & (all T (greater(cardinality_at_time(first_movers,T),zero) & greater_or_equal(T,To) -> greater(zero,growth_rate(first_movers,T)))) -> contracts_from(To,first_movers))) # label(mp_contracts_from) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 3 (all E all T (environment(E) & in_environment(E,T) & greater(cardinality_at_time(first_movers,T),zero) & greater(cardinality_at_time(efficient_producers,T),zero) -> subpopulations(first_movers,efficient_producers,E,T))) # label(mp_contains_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 4 (all E all T1 all T2 (environment(E) & stable(E) & in_environment(E,T1) & greater(T2,T1) -> in_environment(E,T2))) # label(mp_long_stable_environments) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 5 (all E (environment(E) & stable(E) -> in_environment(E,appear(first_movers,E)))) # label(mp_stable_first_movers) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 6 (all E (environment(E) & stable(E) -> in_environment(E,appear(efficient_producers,E)))) # label(mp_stable_efficient_producers) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 7 (all E (environment(E) & stable(E) & (exists T1 (in_environment(E,T1) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,T1) -> greater(zero,growth_rate(first_movers,T)))))) -> (exists T2 (greater(T2,appear(efficient_producers,E)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,T2) -> greater(zero,growth_rate(first_movers,T)))))))) # label(mp_first_movers_negative_growth) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.98 8 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 9 (all E all T1 all T2 (in_environment(E,T1) & in_environment(E,T2) -> greater(T2,T1) | T2 = T1 | greater(T1,T2))) # label(mp_times_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 10 (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.73/0.99 11 (all E (environment(E) -> greater(appear(efficient_producers,e),appear(first_movers,E)))) # label(a3) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/0.99 12 (all E (environment(E) & stable(E) -> (exists T (in_environment(E,T) & greater_or_equal(T,equilibrium(E)))))) # label(a5) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/0.99 13 (all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(efficient_producers,E)) -> greater(cardinality_at_time(efficient_producers,T),zero))) # label(t6) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/0.99 14 (all E (environment(E) & stable(E) -> (exists To (in_environment(E,To) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,To) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))))))) # label(l1) # label(hypothesis) # label(non_clause). [assumption].
% 0.73/0.99 15 -(all E (environment(E) & stable(E) -> (exists To (in_environment(E,To) & greater(To,appear(first_movers,E)) & cardinality_at_time(first_movers,to) = zero)))) # label(prove_t7) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/0.99
% 0.73/0.99 ============================== end of process non-clausal formulas ===
% 0.73/0.99
% 0.73/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/0.99
% 0.73/0.99 ============================== PREDICATE ELIMINATION =================
% 0.73/0.99 16 -finite_set(A) | -contracts_from(B,A) | greater(f1(A,B),B) # label(mp_contracting_time) # label(axiom). [clausify(1)].
% 0.73/0.99 17 finite_set(first_movers) # label(mp7_first_movers_exist) # label(axiom). [assumption].
% 0.73/0.99 Derived: -contracts_from(A,first_movers) | greater(f1(first_movers,A),A). [resolve(16,a,17,a)].
% 0.73/0.99 18 -finite_set(A) | -contracts_from(B,A) | cardinality_at_time(s,t2) = zero # label(mp_contracting_time) # label(axiom). [clausify(1)].
% 0.73/0.99 Derived: -contracts_from(A,first_movers) | cardinality_at_time(s,t2) = zero. [resolve(18,a,17,a)].
% 0.73/0.99 19 -environment(A) | -stable(A) | in_environment(A,f5(A)) # label(a5) # label(hypothesis). [clausify(12)].
% 0.73/0.99 20 environment(c1) # label(prove_t7) # label(negated_conjecture). [clausify(15)].
% 0.73/0.99 Derived: -stable(c1) | in_environment(c1,f5(c1)). [resolve(19,a,20,a)].
% 0.73/0.99 21 -environment(A) | -stable(A) | in_environment(A,f6(A)) # label(l1) # label(hypothesis). [clausify(14)].
% 0.73/0.99 Derived: -stable(c1) | in_environment(c1,f6(c1)). [resolve(21,a,20,a)].
% 0.73/0.99 22 -environment(A) | -stable(A) | in_environment(A,appear(first_movers,A)) # label(mp_stable_first_movers) # label(axiom). [clausify(5)].
% 0.73/0.99 Derived: -stable(c1) | in_environment(c1,appear(first_movers,c1)). [resolve(22,a,20,a)].
% 0.73/0.99 23 -environment(A) | -stable(A) | in_environment(A,appear(efficient_producers,A)) # label(mp_stable_efficient_producers) # label(axiom). [clausify(6)].
% 0.73/0.99 Derived: -stable(c1) | in_environment(c1,appear(efficient_producers,c1)). [resolve(23,a,20,a)].
% 0.73/0.99 24 -environment(A) | greater(appear(efficient_producers,e),appear(first_movers,A)) # label(a3) # label(hypothesis). [clausify(11)].
% 0.73/0.99 Derived: greater(appear(efficient_producers,e),appear(first_movers,c1)). [resolve(24,a,20,a)].
% 0.73/0.99 25 -environment(A) | -stable(A) | greater_or_equal(f5(A),equilibrium(A)) # label(a5) # label(hypothesis). [clausify(12)].
% 0.73/0.99 Derived: -stable(c1) | greater_or_equal(f5(c1),equilibrium(c1)). [resolve(25,a,20,a)].
% 0.73/0.99 26 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(C,B) | in_environment(A,C) # label(mp_long_stable_environments) # label(axiom). [clausify(4)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | -greater(B,A) | in_environment(c1,B). [resolve(26,a,20,a)].
% 0.73/0.99 27 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f2(A,B),B) | contracts_from(B,first_movers) # label(mp_contracts_from) # label(axiom). [clausify(2)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | greater_or_equal(f2(c1,A),A) | contracts_from(A,first_movers). [resolve(27,a,20,a)].
% 0.73/0.99 28 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6) # label(hypothesis). [clausify(13)].
% 0.73/0.99 Derived: -in_environment(c1,A) | -greater_or_equal(A,appear(efficient_producers,c1)) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(28,a,20,a)].
% 0.73/0.99 29 -environment(A) | -stable(A) | -in_environment(A,B) | greater(cardinality_at_time(first_movers,f2(A,B)),zero) | contracts_from(B,first_movers) # label(mp_contracts_from) # label(axiom). [clausify(2)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | greater(cardinality_at_time(first_movers,f2(c1,A)),zero) | contracts_from(A,first_movers). [resolve(29,a,20,a)].
% 0.73/0.99 30 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,f2(A,B))) | contracts_from(B,first_movers) # label(mp_contracts_from) # label(axiom). [clausify(2)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f2(c1,A))) | contracts_from(A,first_movers). [resolve(30,a,20,a)].
% 0.73/0.99 31 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f3(A,B),B) | greater(f4(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(7)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | greater_or_equal(f3(c1,A),A) | greater(f4(c1),appear(efficient_producers,c1)). [resolve(31,a,20,a)].
% 0.73/0.99 32 -environment(A) | -in_environment(A,B) | -greater(cardinality_at_time(first_movers,B),zero) | -greater(cardinality_at_time(efficient_producers,B),zero) | subpopulations(first_movers,efficient_producers,A,B) # label(mp_contains_FM_and_EP) # label(axiom). [clausify(3)].
% 0.73/0.99 Derived: -in_environment(c1,A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,c1,A). [resolve(32,a,20,a)].
% 0.73/0.99 33 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f3(A,B)) | greater(f4(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(7)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f3(c1,A)) | greater(f4(c1),appear(efficient_producers,c1)). [resolve(33,a,20,a)].
% 0.73/0.99 34 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,f3(A,B))) | greater(f4(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(7)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f3(c1,A))) | greater(f4(c1),appear(efficient_producers,c1)). [resolve(34,a,20,a)].
% 0.73/0.99 35 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,f6(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l1) # label(hypothesis). [clausify(14)].
% 0.73/0.99 Derived: -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f6(c1)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(35,a,20,a)].
% 0.73/0.99 36 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f3(A,B),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f4(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(7)].
% 0.73/0.99 Derived: -stable(c1) | -in_environment(c1,A) | greater_or_equal(f3(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f4(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(36,a,20,a)].
% 0.73/0.99 37 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f3(A,B)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f4(A)) | greater(zero,growth_ratCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------