TSTP Solution File: MGT037-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT037-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Unknown 0.78s 1.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT037-2 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 07:49:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.78/1.08 ============================== Prover9 ===============================
% 0.78/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.78/1.08 Process 14129 was started by sandbox2 on n022.cluster.edu,
% 0.78/1.08 Thu Jun 9 07:49:50 2022
% 0.78/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13975_n022.cluster.edu".
% 0.78/1.08 ============================== end of head ===========================
% 0.78/1.08
% 0.78/1.08 ============================== INPUT =================================
% 0.78/1.08
% 0.78/1.08 % Reading from file /tmp/Prover9_13975_n022.cluster.edu
% 0.78/1.08
% 0.78/1.08 set(prolog_style_variables).
% 0.78/1.08 set(auto2).
% 0.78/1.08 % set(auto2) -> set(auto).
% 0.78/1.08 % set(auto) -> set(auto_inference).
% 0.78/1.08 % set(auto) -> set(auto_setup).
% 0.78/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.78/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.78/1.08 % set(auto) -> set(auto_limits).
% 0.78/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.78/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.78/1.08 % set(auto) -> set(auto_denials).
% 0.78/1.08 % set(auto) -> set(auto_process).
% 0.78/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.78/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.78/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.78/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.78/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.78/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.78/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.78/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.78/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.78/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.78/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.78/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.78/1.08 % set(auto2) -> assign(stats, some).
% 0.78/1.08 % set(auto2) -> clear(echo_input).
% 0.78/1.08 % set(auto2) -> set(quiet).
% 0.78/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.78/1.08 % set(auto2) -> clear(print_given).
% 0.78/1.08 assign(lrs_ticks,-1).
% 0.78/1.08 assign(sos_limit,10000).
% 0.78/1.08 assign(order,kbo).
% 0.78/1.08 set(lex_order_vars).
% 0.78/1.08 clear(print_given).
% 0.78/1.08
% 0.78/1.08 % formulas(sos). % not echoed (27 formulas)
% 0.78/1.08
% 0.78/1.08 ============================== end of input ==========================
% 0.78/1.08
% 0.78/1.08 % From the command line: assign(max_seconds, 300).
% 0.78/1.08
% 0.78/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.78/1.08
% 0.78/1.08 % Formulas that are not ordinary clauses:
% 0.78/1.08
% 0.78/1.08 ============================== end of process non-clausal formulas ===
% 0.78/1.08
% 0.78/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.08
% 0.78/1.08 ============================== PREDICATE ELIMINATION =================
% 0.78/1.08 1 -environment(A) | -in_environment(A,B) | -decreases(resources(A,B)) | -decreases(number_of_organizations(A,B)) # label(a7_47) # label(hypothesis). [assumption].
% 0.78/1.08 2 environment(sk3) # label(prove_t6_51) # label(negated_conjecture). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -decreases(resources(sk3,A)) | -decreases(number_of_organizations(sk3,A)). [resolve(1,a,2,a)].
% 0.78/1.08 3 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_37) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | subpopulation(first_movers,sk3,A). [resolve(3,a,2,a)].
% 0.78/1.08 4 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_38) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | subpopulation(efficient_producers,sk3,A). [resolve(4,a,2,a)].
% 0.78/1.08 5 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a7_48) # label(hypothesis). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -constant(resources(sk3,A)) | constant(number_of_organizations(sk3,A)). [resolve(5,a,2,a)].
% 0.78/1.08 6 -environment(A) | -in_environment(A,B) | -greater(appear(an_organisation,A),B) | number_of_organizations(A,B) = zero # label(mp_start_of_organizations_32) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -greater(appear(an_organisation,sk3),A) | number_of_organizations(sk3,A) = zero. [resolve(6,a,2,a)].
% 0.78/1.08 7 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | subpopulation(sk2(B,A),A,B) # label(mp_non_decreasing_33) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | subpopulation(sk2(A,sk3),sk3,A). [resolve(7,a,2,a)].
% 0.78/1.08 8 -environment(A) | -in_environment(A,B) | cardinality_at_time(efficient_producers,B) = zero | greater(cardinality_at_time(efficient_producers,B),zero) # label(mp_efficient_producers_exist_40) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | cardinality_at_time(efficient_producers,A) = zero | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(8,a,2,a)].
% 0.78/1.08 9 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(appear(an_organisation,A),B) # label(mp_environment_inequality_42) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -greater_or_equal(A,appear(an_organisation,sk3)) | greater(appear(an_organisation,sk3),A). [resolve(9,a,2,a)].
% 0.78/1.08 10 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1_43) # label(hypothesis). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -greater_or_equal(A,appear(an_organisation,sk3)) | greater(number_of_organizations(sk3,A),zero). [resolve(10,a,2,a)].
% 0.78/1.08 11 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | greater(cardinality_at_time(sk2(B,A),B),zero) # label(mp_non_decreasing_34) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | greater(cardinality_at_time(sk2(A,sk3),A),zero). [resolve(11,a,2,a)].
% 0.78/1.08 12 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | -greater(zero,growth_rate(sk2(B,A),B)) # label(mp_non_decreasing_35) # label(axiom). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | -greater(zero,growth_rate(sk2(A,sk3),A)). [resolve(12,a,2,a)].
% 0.78/1.08 13 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | in_environment(A,sk1(B,A)) # label(mp_previous_negative_growth_29) # label(axiom). [assumption].
% 0.78/1.08 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | in_environment(sk3,sk1(A,sk3)). [resolve(13,a,2,a)].
% 0.78/1.08 14 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(B,sk1(B,A)) # label(mp_previous_negative_growth_30) # label(axiom). [assumption].
% 0.78/1.08 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(A,sk1(A,sk3)). [resolve(14,a,2,a)].
% 0.78/1.08 15 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | B = efficient_producers | B = first_movers # label(a11_49) # label(hypothesis). [assumption].
% 0.78/1.08 Derived: -subpopulation(A,sk3,B) | -greater(cardinality_at_time(A,B),zero) | A = efficient_producers | A = first_movers. [resolve(15,a,2,a)].
% 0.78/1.08 16 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a4_45) # label(hypothesis). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -greater(number_of_organizations(sk3,A),zero) | -greater(equilibrium(sk3),A) | decreases(resources(sk3,A)). [resolve(16,a,2,a)].
% 0.78/1.08 17 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a4_46) # label(hypothesis). [assumption].
% 0.78/1.08 Derived: -in_environment(sk3,A) | -greater(number_of_organizations(sk3,A),zero) | greater(equilibrium(sk3),A) | constant(resources(sk3,A)). [resolve(17,a,2,a)].
% 0.78/1.08 18 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(sk1(B,A),appear(efficient_producers,A)) # label(mp_previous_negative_growth_28) # label(axiom). [assumption].
% 0.78/1.08 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(sk1(A,sk3),appear(efficient_producers,sk3)). [resolve(18,a,2,a)].
% 0.78/1.08 19 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(zero,growth_rate(efficient_producers,sk1(B,A))) # label(mp_previous_negative_growth_31) # label(axiom). [assumption].
% 0.78/1.09 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(zero,growth_rate(efficient_producers,sk1(A,sk3))). [resolve(19,a,2,a)].
% 0.78/1.09 20 -environment(A) | -in_environment(A,B) | number_of_organizations(A,B) != zero | -subpopulation(C,A,B) | cardinality_at_time(C,B) = zero # label(mp_no_members_36) # label(axiom). [assumption].
% 0.78/1.09 Derived: -in_environment(sk3,A) | number_of_organizations(sk3,A) != zero | -subpopulation(B,sk3,A) | cardinality_at_time(B,A) = zero. [resolve(20,a,2,a)].
% 0.78/1.09 21 -environment(A) | -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) # label(a13_50) # label(hypothesis). [assumption].
% 0.78/1.09 Derived: -in_environment(sk3,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(21,a,2,a)].
% 0.78/1.09
% 0.78/1.09 ============================== end predicate elimination =============
% 0.78/1.09
% 0.78/1.09 Auto_denials: (non-Horn, no changes).
% 0.78/1.09
% 0.78/1.09 Term ordering decisions:
% 0.78/1.09 Function symbol KB weights: sk3=1. zero=1. efficient_producers=1. an_organisation=1. first_movers=1. sk4=1. appear=1. cardinality_at_time=1. number_of_organizations=1. growth_rate=1. sk1=1. resources=1. sk2=1. resilience=1. equilibrium=1.
% 0.78/1.09
% 0.78/1.09 ============================== end of process initial clauses ========
% 0.78/1.09
% 0.78/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.78/1.09
% 0.78/1.09 ============================== end of clauses for search =============
% 0.78/1.09
% 0.78/1.09 ============================== SEARCH ================================
% 0.78/1.09
% 0.78/1.09 % Starting search at 0.01 seconds.
% 0.78/1.09
% 0.78/1.09 ============================== STATISTICS ============================
% 0.78/1.09
% 0.78/1.09 Given=69. Generated=87. Kept=73. proofs=0.
% 0.78/1.09 Usable=66. Sos=0. Demods=1. Limbo=0, Disabled=54. Hints=0.
% 0.78/1.09 Megabytes=0.15.
% 0.78/1.09 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.78/1.09
% 0.78/1.09 ============================== end of statistics =====================
% 0.78/1.09
% 0.78/1.09 ============================== end of search =========================
% 0.78/1.09
% 0.78/1.09 SEARCH FAILED
% 0.78/1.09
% 0.78/1.09 Exiting with failure.
% 0.78/1.09
% 0.78/1.09 Process 14129 exit (sos_empty) Thu Jun 9 07:49:50 2022
% 0.78/1.09 Prover9 interrupted
%------------------------------------------------------------------------------