TSTP Solution File: MGT032-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT032-2 : TPTP v8.1.0. Released v2.4.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:57 EDT 2022
% Result : Unsatisfiable 0.42s 0.98s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : MGT032-2 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 09:37:08 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 18010 was started by sandbox2 on n023.cluster.edu,
% 0.42/0.98 Thu Jun 9 09:37:08 2022
% 0.42/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17857_n023.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_17857_n023.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 (8 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
% 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 1 -environment(A) | -stable(A) | in_environment(A,sk1(A)) # label(l1_2) # label(hypothesis). [assumption].
% 0.42/0.98 2 environment(sk2) # label(prove_t1_4) # label(negated_conjecture). [assumption].
% 0.42/0.98 Derived: -stable(sk2) | in_environment(sk2,sk1(sk2)). [resolve(1,a,2,a)].
% 0.42/0.98 3 -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_1) # label(axiom). [assumption].
% 0.42/0.98 Derived: -subpopulations(A,B,sk2,C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(3,a,2,a)].
% 0.42/0.98 4 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk1(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l1_3) # label(hypothesis). [assumption].
% 0.42/0.98 Derived: -stable(sk2) | -subpopulations(first_movers,efficient_producers,sk2,A) | -greater_or_equal(A,sk1(sk2)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(4,a,2,a)].
% 0.42/0.98 5 -stable(sk2) | in_environment(sk2,sk1(sk2)). [resolve(1,a,2,a)].
% 0.42/0.98 6 stable(sk2) # label(prove_t1_5) # label(negated_conjecture). [assumption].
% 0.42/0.98 Derived: in_environment(sk2,sk1(sk2)). [resolve(5,a,6,a)].
% 0.42/0.98 7 -stable(sk2) | -subpopulations(first_movers,efficient_producers,sk2,A) | -greater_or_equal(A,sk1(sk2)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(4,a,2,a)].
% 0.42/0.98 Derived: -subpopulations(first_movers,efficient_producers,sk2,A) | -greater_or_equal(A,sk1(sk2)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(7,a,6,a)].
% 0.42/0.98 8 in_environment(sk2,sk1(sk2)). [resolve(5,a,6,a)].
% 0.42/0.98 9 -in_environment(sk2,A) | -selection_favors(efficient_producers,first_movers,sk3(A)) # label(prove_t1_8) # label(negated_conjecture). [assumption].
% 0.42/0.98 10 -in_environment(sk2,A) | greater_or_equal(sk3(A),A) # label(prove_t1_7) # label(negated_conjecture). [assumption].
% 0.42/0.98 11 -in_environment(sk2,A) | subpopulations(first_movers,efficient_producers,sk2,sk3(A)) # label(prove_t1_6) # label(negated_conjecture). [assumption].
% 0.42/0.98 Derived: -selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))). [resolve(8,a,9,a)].
% 0.42/0.98 Derived: greater_or_equal(sk3(sk1(sk2)),sk1(sk2)). [resolve(8,a,10,a)].
% 0.42/0.98 Derived: subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))). [resolve(8,a,11,a)].
% 0.42/0.98 12 subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))). [resolve(8,a,11,a)].
% 0.42/0.98 13 -subpopulations(A,B,sk2,C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(3,a,2,a)].
% 0.42/0.98 14 -subpopulations(first_movers,efficient_producers,sk2,A) | -greater_or_equal(A,sk1(sk2)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(7,a,6,a)].
% 0.42/0.98 Derived: -greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) | selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))). [resolve(12,a,13,a)].
% 0.42/0.98 Derived: -greater_or_equal(sk3(sk1(sk2)),sk1(sk2)) | greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(12,a,14,a)].
% 0.42/0.98 15 -greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) | selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))). [resolve(12,a,13,a)].
% 0.42/0.98 16 -selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))). [resolve(8,a,9,a)].
% 0.42/0.98 Derived: -greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(15,b,16,a)].
% 0.42/0.98 17 -greater_or_equal(sk3(sk1(sk2)),sk1(sk2)) | greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(12,a,14,a)].
% 0.42/0.98 18 greater_or_equal(sk3(sk1(sk2)),sk1(sk2)). [resolve(8,a,10,a)].
% 0.42/0.98 Derived: greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(17,a,18,a)].
% 0.42/0.98 19 greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(17,a,18,a)].
% 0.42/0.98 20 -greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(15,b,16,a)].
% 0.42/0.98 Derived: $F. [resolve(19,a,20,a)].
% 0.42/0.98
% 0.42/0.98 ============================== end predicate elimination =============
% 0.42/0.98
% 0.42/0.98 Auto_denials: (no changes).
% 0.42/0.98
% 0.42/0.98 Term ordering decisions:
% 0.42/0.98 Function symbol KB weights:
% 0.42/0.98
% 0.42/0.98 ============================== PROOF =================================
% 0.42/0.98 % SZS status Unsatisfiable
% 0.42/0.98 % SZS output start Refutation
% 0.42/0.98
% 0.42/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.42/0.98 % Length of proof is 21.
% 0.42/0.98 % Level of proof is 6.
% 0.42/0.98 % Maximum clause weight is 0.000.
% 0.42/0.98 % Given clauses 0.
% 0.42/0.98
% 0.42/0.98 1 -environment(A) | -stable(A) | in_environment(A,sk1(A)) # label(l1_2) # label(hypothesis). [assumption].
% 0.42/0.98 2 environment(sk2) # label(prove_t1_4) # label(negated_conjecture). [assumption].
% 0.42/0.98 3 -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_1) # label(axiom). [assumption].
% 0.42/0.98 4 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk1(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l1_3) # label(hypothesis). [assumption].
% 0.42/0.98 5 -stable(sk2) | in_environment(sk2,sk1(sk2)). [resolve(1,a,2,a)].
% 0.42/0.98 6 stable(sk2) # label(prove_t1_5) # label(negated_conjecture). [assumption].
% 0.42/0.98 7 -stable(sk2) | -subpopulations(first_movers,efficient_producers,sk2,A) | -greater_or_equal(A,sk1(sk2)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(4,a,2,a)].
% 0.42/0.98 8 in_environment(sk2,sk1(sk2)). [resolve(5,a,6,a)].
% 0.42/0.98 9 -in_environment(sk2,A) | -selection_favors(efficient_producers,first_movers,sk3(A)) # label(prove_t1_8) # label(negated_conjecture). [assumption].
% 0.42/0.98 10 -in_environment(sk2,A) | greater_or_equal(sk3(A),A) # label(prove_t1_7) # label(negated_conjecture). [assumption].
% 0.42/0.98 11 -in_environment(sk2,A) | subpopulations(first_movers,efficient_producers,sk2,sk3(A)) # label(prove_t1_6) # label(negated_conjecture). [assumption].
% 0.42/0.98 12 subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))). [resolve(8,a,11,a)].
% 0.42/0.98 13 -subpopulations(A,B,sk2,C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(3,a,2,a)].
% 0.42/0.98 14 -subpopulations(first_movers,efficient_producers,sk2,A) | -greater_or_equal(A,sk1(sk2)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(7,a,6,a)].
% 0.42/0.98 15 -greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) | selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))). [resolve(12,a,13,a)].
% 0.42/0.98 16 -selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))). [resolve(8,a,9,a)].
% 0.42/0.98 17 -greater_or_equal(sk3(sk1(sk2)),sk1(sk2)) | greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(12,a,14,a)].
% 0.42/0.98 18 greater_or_equal(sk3(sk1(sk2)),sk1(sk2)). [resolve(8,a,10,a)].
% 0.42/0.98 19 greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(17,a,18,a)].
% 0.42/0.98 20 -greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))). [resolve(15,b,16,a)].
% 0.42/0.98 21 $F. [resolve(19,a,20,a)].
% 0.42/0.98
% 0.42/0.98 % SZS output end Refutation
% 0.42/0.98 ============================== end of proof ==========================
% 0.42/0.98
% 0.42/0.98 ============================== STATISTICS ============================
% 0.42/0.98
% 0.42/0.98 Given=0. Generated=1. Kept=0. proofs=1.
% 0.42/0.98 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=21. Hints=0.
% 0.42/0.98 Megabytes=0.02.
% 0.42/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.42/0.98
% 0.42/0.98 ============================== end of statistics =====================
% 0.42/0.98
% 0.42/0.98 ============================== end of search =========================
% 0.42/0.98
% 0.42/0.98 THEOREM PROVED
% 0.42/0.98 % SZS status Unsatisfiable
% 0.42/0.98
% 0.42/0.98 Exiting with 1 proof.
% 0.42/0.98
% 0.42/0.98 Process 18010 exit (max_proofs) Thu Jun 9 09:37:08 2022
% 0.42/0.98 Prover9 interrupted
%------------------------------------------------------------------------------