TSTP Solution File: MGT027-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:55 EDT 2022
% Result : Unsatisfiable 0.67s 0.98s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 08:45:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.67/0.98 ============================== Prover9 ===============================
% 0.67/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.98 Process 11810 was started by sandbox on n017.cluster.edu,
% 0.67/0.98 Thu Jun 9 08:45:04 2022
% 0.67/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11656_n017.cluster.edu".
% 0.67/0.98 ============================== end of head ===========================
% 0.67/0.98
% 0.67/0.98 ============================== INPUT =================================
% 0.67/0.98
% 0.67/0.98 % Reading from file /tmp/Prover9_11656_n017.cluster.edu
% 0.67/0.98
% 0.67/0.98 set(prolog_style_variables).
% 0.67/0.98 set(auto2).
% 0.67/0.98 % set(auto2) -> set(auto).
% 0.67/0.98 % set(auto) -> set(auto_inference).
% 0.67/0.98 % set(auto) -> set(auto_setup).
% 0.67/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.98 % set(auto) -> set(auto_limits).
% 0.67/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.98 % set(auto) -> set(auto_denials).
% 0.67/0.98 % set(auto) -> set(auto_process).
% 0.67/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.98 % set(auto2) -> assign(stats, some).
% 0.67/0.98 % set(auto2) -> clear(echo_input).
% 0.67/0.98 % set(auto2) -> set(quiet).
% 0.67/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.98 % set(auto2) -> clear(print_given).
% 0.67/0.98 assign(lrs_ticks,-1).
% 0.67/0.98 assign(sos_limit,10000).
% 0.67/0.98 assign(order,kbo).
% 0.67/0.98 set(lex_order_vars).
% 0.67/0.98 clear(print_given).
% 0.67/0.98
% 0.67/0.98 % formulas(sos). % not echoed (16 formulas)
% 0.67/0.98
% 0.67/0.98 ============================== end of input ==========================
% 0.67/0.98
% 0.67/0.98 % From the command line: assign(max_seconds, 300).
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.98
% 0.67/0.98 % Formulas that are not ordinary clauses:
% 0.67/0.98
% 0.67/0.98 ============================== end of process non-clausal formulas ===
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.98
% 0.67/0.98 ============================== PREDICATE ELIMINATION =================
% 0.67/0.98 1 -environment(A) | -stable(A) | in_environment(A,appear(efficient_producers,A)) # label(mp_EP_in_stable_environments_29) # label(axiom). [assumption].
% 0.67/0.98 2 environment(sk3) # label(prove_l9_37) # label(negated_conjecture). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | in_environment(sk3,appear(efficient_producers,sk3)). [resolve(1,a,2,a)].
% 0.67/0.98 3 -environment(A) | -stable(A) | greater(sk2(A),appear(efficient_producers,A)) # label(l10_35) # label(hypothesis). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | greater(sk2(sk3),appear(efficient_producers,sk3)). [resolve(3,a,2,a)].
% 0.67/0.98 4 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(C,B) | in_environment(A,C) # label(mp_long_stable_environments_28) # label(axiom). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | -in_environment(sk3,A) | -greater(B,A) | in_environment(sk3,B). [resolve(4,a,2,a)].
% 0.67/0.98 5 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | contracts_from(B,first_movers) # label(mp_contracts_from_25) # label(axiom). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | -in_environment(sk3,A) | greater_or_equal(sk1(A,sk3),A) | contracts_from(A,first_movers). [resolve(5,a,2,a)].
% 0.67/0.98 6 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6_34) # label(hypothesis). [assumption].
% 0.67/0.98 Derived: -in_environment(sk3,A) | -greater_or_equal(A,appear(efficient_producers,sk3)) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(6,a,2,a)].
% 0.67/0.98 7 -environment(A) | -stable(A) | -in_environment(A,B) | greater(cardinality_at_time(first_movers,sk1(B,A)),zero) | contracts_from(B,first_movers) # label(mp_contracts_from_24) # label(axiom). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | -in_environment(sk3,A) | greater(cardinality_at_time(first_movers,sk1(A,sk3)),zero) | contracts_from(A,first_movers). [resolve(7,a,2,a)].
% 0.67/0.98 8 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,sk1(B,A))) | contracts_from(B,first_movers) # label(mp_contracts_from_26) # label(axiom). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | -in_environment(sk3,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk3))) | contracts_from(A,first_movers). [resolve(8,a,2,a)].
% 0.67/0.98 9 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk2(A)) | greater(zero,growth_rate(first_movers,B)) # label(l10_36) # label(hypothesis). [assumption].
% 0.67/0.98 Derived: -stable(sk3) | -subpopulations(first_movers,efficient_producers,sk3,A) | -greater_or_equal(A,sk2(sk3)) | greater(zero,growth_rate(first_movers,A)). [resolve(9,a,2,a)].
% 0.67/0.98 10 -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_non_empty_fm_and_ep_27) # label(axiom). [assumption].
% 0.67/0.98 Derived: -in_environment(sk3,A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,sk3,A). [resolve(10,a,2,a)].
% 0.67/0.98
% 0.67/0.98 ============================== end predicate elimination =============
% 0.67/0.98
% 0.67/0.98 Auto_denials: (non-Horn, no changes).
% 0.67/0.98
% 0.67/0.98 Term ordering decisions:
% 0.67/0.98
% 0.67/0.98 % Assigning unary symbol sk2 kb_weight 0 and highest precedence (16).
% 0.67/0.98 Function symbol KB weights: sk3=1. first_movers=1. efficient_producers=1. zero=1. cardinality_at_time=1. appear=1. sk1=1. growth_rate=1. sk2=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of process initial clauses ========
% 0.67/0.98
% 0.67/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.98
% 0.67/0.98 ============================== end of clauses for search =============
% 0.67/0.98
% 0.67/0.98 ============================== SEARCH ================================
% 0.67/0.98
% 0.67/0.98 % Starting search at 0.01 seconds.
% 0.67/0.98
% 0.67/0.98 ============================== PROOF =================================
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98 % SZS output start Refutation
% 0.67/0.98
% 0.67/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.67/0.98 % Length of proof is 55.
% 0.67/0.98 % Level of proof is 13.
% 0.67/0.98 % Maximum clause weight is 21.000.
% 0.67/0.98 % Given clauses 58.
% 0.67/0.98
% 0.67/0.98 1 -environment(A) | -stable(A) | in_environment(A,appear(efficient_producers,A)) # label(mp_EP_in_stable_environments_29) # label(axiom). [assumption].
% 0.67/0.98 2 environment(sk3) # label(prove_l9_37) # label(negated_conjecture). [assumption].
% 0.67/0.98 3 -environment(A) | -stable(A) | greater(sk2(A),appear(efficient_producers,A)) # label(l10_35) # label(hypothesis). [assumption].
% 0.67/0.98 4 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(C,B) | in_environment(A,C) # label(mp_long_stable_environments_28) # label(axiom). [assumption].
% 0.67/0.98 5 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | contracts_from(B,first_movers) # label(mp_contracts_from_25) # label(axiom). [assumption].
% 0.67/0.98 6 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6_34) # label(hypothesis). [assumption].
% 0.67/0.98 7 -environment(A) | -stable(A) | -in_environment(A,B) | greater(cardinality_at_time(first_movers,sk1(B,A)),zero) | contracts_from(B,first_movers) # label(mp_contracts_from_24) # label(axiom). [assumption].
% 0.67/0.98 8 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,sk1(B,A))) | contracts_from(B,first_movers) # label(mp_contracts_from_26) # label(axiom). [assumption].
% 0.67/0.98 9 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk2(A)) | greater(zero,growth_rate(first_movers,B)) # label(l10_36) # label(hypothesis). [assumption].
% 0.67/0.98 10 -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_non_empty_fm_and_ep_27) # label(axiom). [assumption].
% 0.67/0.98 11 stable(sk3) # label(prove_l9_38) # label(negated_conjecture). [assumption].
% 0.67/0.98 12 -greater(A,appear(efficient_producers,sk3)) | -contracts_from(A,first_movers) # label(prove_l9_39) # label(negated_conjecture). [assumption].
% 0.67/0.98 13 -greater(A,B) | greater_or_equal(A,B) # label(mp_greater_or_equal_32) # label(axiom). [assumption].
% 0.67/0.98 15 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp_greater_transitivity_30) # label(axiom). [assumption].
% 0.67/0.98 16 -greater_or_equal(A,B) | greater(A,B) | A = B # label(mp_greater_or_equal_31) # label(axiom). [assumption].
% 0.67/0.98 17 -stable(sk3) | in_environment(sk3,appear(efficient_producers,sk3)). [resolve(1,a,2,a)].
% 0.67/0.98 18 in_environment(sk3,appear(efficient_producers,sk3)). [copy(17),unit_del(a,11)].
% 0.67/0.98 19 -stable(sk3) | greater(sk2(sk3),appear(efficient_producers,sk3)). [resolve(3,a,2,a)].
% 0.67/0.98 20 greater(sk2(sk3),appear(efficient_producers,sk3)). [copy(19),unit_del(a,11)].
% 0.67/0.98 21 -stable(sk3) | -in_environment(sk3,A) | -greater(B,A) | in_environment(sk3,B). [resolve(4,a,2,a)].
% 0.67/0.98 22 -in_environment(sk3,A) | -greater(B,A) | in_environment(sk3,B). [copy(21),unit_del(a,11)].
% 0.67/0.98 23 -stable(sk3) | -in_environment(sk3,A) | greater_or_equal(sk1(A,sk3),A) | contracts_from(A,first_movers). [resolve(5,a,2,a)].
% 0.67/0.98 24 -in_environment(sk3,A) | greater_or_equal(sk1(A,sk3),A) | contracts_from(A,first_movers). [copy(23),unit_del(a,11)].
% 0.67/0.98 25 -in_environment(sk3,A) | -greater_or_equal(A,appear(efficient_producers,sk3)) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(6,a,2,a)].
% 0.67/0.98 26 -stable(sk3) | -in_environment(sk3,A) | greater(cardinality_at_time(first_movers,sk1(A,sk3)),zero) | contracts_from(A,first_movers). [resolve(7,a,2,a)].
% 0.67/0.98 27 -in_environment(sk3,A) | greater(cardinality_at_time(first_movers,sk1(A,sk3)),zero) | contracts_from(A,first_movers). [copy(26),unit_del(a,11)].
% 0.67/0.98 28 -stable(sk3) | -in_environment(sk3,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk3))) | contracts_from(A,first_movers). [resolve(8,a,2,a)].
% 0.67/0.98 29 -in_environment(sk3,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk3))) | contracts_from(A,first_movers). [copy(28),unit_del(a,11)].
% 0.67/0.98 30 -stable(sk3) | -subpopulations(first_movers,efficient_producers,sk3,A) | -greater_or_equal(A,sk2(sk3)) | greater(zero,growth_rate(first_movers,A)). [resolve(9,a,2,a)].
% 0.67/0.98 31 -subpopulations(first_movers,efficient_producers,sk3,A) | -greater_or_equal(A,sk2(sk3)) | greater(zero,growth_rate(first_movers,A)). [copy(30),unit_del(a,11)].
% 0.67/0.98 32 -in_environment(sk3,A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,sk3,A). [resolve(10,a,2,a)].
% 0.67/0.98 34 -greater(A,sk2(sk3)) | greater(A,appear(efficient_producers,sk3)). [resolve(20,a,15,b)].
% 0.67/0.98 36 greater_or_equal(sk2(sk3),appear(efficient_producers,sk3)). [resolve(20,a,13,a)].
% 0.67/0.98 37 -contracts_from(sk2(sk3),first_movers). [ur(12,a,20,a)].
% 0.67/0.98 38 -greater(A,appear(efficient_producers,sk3)) | in_environment(sk3,A). [resolve(22,a,18,a)].
% 0.67/0.98 45 -in_environment(sk3,sk2(sk3)) | greater(cardinality_at_time(efficient_producers,sk2(sk3)),zero). [resolve(36,a,25,b)].
% 0.67/0.98 49 in_environment(sk3,sk2(sk3)). [resolve(38,a,20,a)].
% 0.67/0.98 50 greater(cardinality_at_time(efficient_producers,sk2(sk3)),zero). [back_unit_del(45),unit_del(a,49)].
% 0.67/0.98 51 -greater(cardinality_at_time(first_movers,sk2(sk3)),zero) | subpopulations(first_movers,efficient_producers,sk3,sk2(sk3)). [resolve(49,a,32,a),unit_del(b,50)].
% 0.67/0.98 52 -greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3))). [resolve(49,a,29,a),unit_del(b,37)].
% 0.67/0.98 53 greater(cardinality_at_time(first_movers,sk1(sk2(sk3),sk3)),zero). [resolve(49,a,27,a),unit_del(b,37)].
% 0.67/0.98 54 greater_or_equal(sk1(sk2(sk3),sk3),sk2(sk3)). [resolve(49,a,24,a),unit_del(b,37)].
% 0.67/0.98 55 -greater(A,sk2(sk3)) | in_environment(sk3,A). [resolve(49,a,22,a)].
% 0.67/0.98 59 greater(sk1(sk2(sk3),sk3),sk2(sk3)) | sk1(sk2(sk3),sk3) = sk2(sk3). [resolve(54,a,16,a)].
% 0.67/0.98 60 -subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)). [ur(31,b,54,a,c,52,a)].
% 0.67/0.98 66 sk1(sk2(sk3),sk3) = sk2(sk3) | in_environment(sk3,sk1(sk2(sk3),sk3)). [resolve(59,a,55,a)].
% 0.67/0.98 67 sk1(sk2(sk3),sk3) = sk2(sk3) | greater(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)). [resolve(59,a,34,a)].
% 0.67/0.98 70 sk1(sk2(sk3),sk3) = sk2(sk3) | -greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero). [resolve(66,b,32,a),unit_del(b,53),unit_del(d,60)].
% 0.67/0.98 77 sk1(sk2(sk3),sk3) = sk2(sk3) | greater_or_equal(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)). [resolve(67,b,13,a)].
% 0.67/0.98 78 sk1(sk2(sk3),sk3) = sk2(sk3) | -in_environment(sk3,sk1(sk2(sk3),sk3)) | greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero). [resolve(77,b,25,b)].
% 0.67/0.98 79 sk1(sk2(sk3),sk3) = sk2(sk3) | greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero). [resolve(78,b,66,b),merge(c)].
% 0.67/0.98 80 sk1(sk2(sk3),sk3) = sk2(sk3). [resolve(79,b,70,b),merge(b)].
% 0.67/0.98 84 -subpopulations(first_movers,efficient_producers,sk3,sk2(sk3)). [back_rewrite(60),rewrite([80(7)])].
% 0.67/0.98 85 greater(cardinality_at_time(first_movers,sk2(sk3)),zero). [back_rewrite(53),rewrite([80(5)])].
% 0.67/0.98 87 $F. [back_unit_del(51),unit_del(a,85),unit_del(b,84)].
% 0.67/0.98
% 0.67/0.98 % SZS output end Refutation
% 0.67/0.98 ============================== end of proof ==========================
% 0.67/0.98
% 0.67/0.98 ============================== STATISTICS ============================
% 0.67/0.98
% 0.67/0.98 Given=58. Generated=85. Kept=69. proofs=1.
% 0.67/0.98 Usable=37. Sos=4. Demods=1. Limbo=3, Disabled=50. Hints=0.
% 0.67/0.98 Megabytes=0.12.
% 0.67/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of statistics =====================
% 0.67/0.98
% 0.67/0.98 ============================== end of search =========================
% 0.67/0.98
% 0.67/0.98 THEOREM PROVED
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98
% 0.67/0.98 Exiting with 1 proof.
% 0.67/0.98
% 0.67/0.98 Process 11810 exit (max_proofs) Thu Jun 9 08:45:04 2022
% 0.67/0.98 Prover9 interrupted
%------------------------------------------------------------------------------