TSTP Solution File: MGT036-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:59 EDT 2022
% Result : Unsatisfiable 0.50s 0.79s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Thu Jun 9 08:31:07 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.50/0.79 ============================== Prover9 ===============================
% 0.50/0.79 Prover9 (32) version 2009-11A, November 2009.
% 0.50/0.79 Process 3490 was started by sandbox2 on n032.cluster.edu,
% 0.50/0.79 Thu Jun 9 08:31:08 2022
% 0.50/0.79 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3291_n032.cluster.edu".
% 0.50/0.79 ============================== end of head ===========================
% 0.50/0.79
% 0.50/0.79 ============================== INPUT =================================
% 0.50/0.79
% 0.50/0.79 % Reading from file /tmp/Prover9_3291_n032.cluster.edu
% 0.50/0.79
% 0.50/0.79 set(prolog_style_variables).
% 0.50/0.79 set(auto2).
% 0.50/0.79 % set(auto2) -> set(auto).
% 0.50/0.79 % set(auto) -> set(auto_inference).
% 0.50/0.79 % set(auto) -> set(auto_setup).
% 0.50/0.79 % set(auto_setup) -> set(predicate_elim).
% 0.50/0.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/0.79 % set(auto) -> set(auto_limits).
% 0.50/0.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/0.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/0.79 % set(auto) -> set(auto_denials).
% 0.50/0.79 % set(auto) -> set(auto_process).
% 0.50/0.79 % set(auto2) -> assign(new_constants, 1).
% 0.50/0.79 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/0.79 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/0.79 % set(auto2) -> assign(max_hours, 1).
% 0.50/0.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/0.79 % set(auto2) -> assign(max_seconds, 0).
% 0.50/0.79 % set(auto2) -> assign(max_minutes, 5).
% 0.50/0.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/0.79 % set(auto2) -> set(sort_initial_sos).
% 0.50/0.79 % set(auto2) -> assign(sos_limit, -1).
% 0.50/0.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/0.79 % set(auto2) -> assign(max_megs, 400).
% 0.50/0.79 % set(auto2) -> assign(stats, some).
% 0.50/0.79 % set(auto2) -> clear(echo_input).
% 0.50/0.79 % set(auto2) -> set(quiet).
% 0.50/0.79 % set(auto2) -> clear(print_initial_clauses).
% 0.50/0.79 % set(auto2) -> clear(print_given).
% 0.50/0.79 assign(lrs_ticks,-1).
% 0.50/0.79 assign(sos_limit,10000).
% 0.50/0.79 assign(order,kbo).
% 0.50/0.79 set(lex_order_vars).
% 0.50/0.79 clear(print_given).
% 0.50/0.79
% 0.50/0.79 % formulas(sos). % not echoed (14 formulas)
% 0.50/0.79
% 0.50/0.79 ============================== end of input ==========================
% 0.50/0.79
% 0.50/0.79 % From the command line: assign(max_seconds, 300).
% 0.50/0.79
% 0.50/0.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/0.79
% 0.50/0.79 % Formulas that are not ordinary clauses:
% 0.50/0.79
% 0.50/0.79 ============================== end of process non-clausal formulas ===
% 0.50/0.79
% 0.50/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/0.79
% 0.50/0.79 ============================== PREDICATE ELIMINATION =================
% 0.50/0.79 1 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur_2) # label(axiom). [assumption].
% 0.50/0.79 2 environment(sk1) # label(prove_t5_12) # label(negated_conjecture). [assumption].
% 0.50/0.79 3 environment(A) | -greater(zero,growth_rate(B,C)) # label(mp_growth_rate_relationships_3) # label(axiom). [assumption].
% 0.50/0.79 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | in_environment(sk1,A). [resolve(1,a,2,a)].
% 0.50/0.79 Derived: -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) | -greater(zero,growth_rate(C,D)). [resolve(1,a,3,a)].
% 0.50/0.79 4 -environment(A) | -subpopulations(B,C,A,D) | subpopulations(C,B,A,D) # label(mp_symmetry_of_subpopulations_1) # label(axiom). [assumption].
% 0.50/0.79 Derived: -subpopulations(A,B,sk1,C) | subpopulations(B,A,sk1,C). [resolve(4,a,2,a)].
% 0.50/0.79 Derived: -subpopulations(A,B,C,D) | subpopulations(B,A,C,D) | -greater(zero,growth_rate(E,F)). [resolve(4,a,3,a)].
% 0.50/0.79 5 -environment(A) | -subpopulations(B,C,A,D) | -outcompetes(C,B,D) | greater_or_equal(growth_rate(C,D),zero) # label(d2_8) # label(hypothesis). [assumption].
% 0.50/0.79 Derived: -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater_or_equal(growth_rate(B,C),zero). [resolve(5,a,2,a)].
% 0.50/0.79 Derived: -subpopulations(A,B,C,D) | -outcompetes(B,A,D) | greater_or_equal(growth_rate(B,D),zero) | -greater(zero,growth_rate(E,F)). [resolve(5,a,3,a)].
% 0.50/0.79 6 -environment(A) | -subpopulations(B,C,A,D) | -outcompetes(C,B,D) | greater(zero,growth_rate(B,D)) # label(d2_9) # label(hypothesis). [assumption].
% 0.50/0.79 Derived: -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater(zero,growth_rate(A,C)). [resolve(6,a,2,a)].
% 0.50/0.79 Derived: -subpopulations(A,B,C,D) | -outcompetes(B,A,D) | greater(zero,growth_rate(A,D)) | -greater(zero,growth_rate(E,F)). [resolve(6,a,3,a)].
% 0.50/0.79 7 greater(zero,growth_rate(A,B)) | -environment(C) | -subpopulations(A,D,C,B) | greater_or_equal(growth_rate(A,B),zero) # label(mp_growth_rate_relationships_6) # label(axiom). [assumption].
% 0.50/0.79 Derived: greater(zero,growth_rate(A,B)) | -subpopulations(A,C,sk1,B) | greater_or_equal(growth_rate(A,B),zero). [resolve(7,b,2,a)].
% 0.50/0.79 Derived: greater(zero,growth_rate(A,B)) | -subpopulations(A,C,D,B) | greater_or_equal(growth_rate(A,B),zero) | -greater(zero,growth_rate(E,F)). [resolve(7,b,3,a)].
% 0.50/0.79 8 -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_11) # label(hypothesis). [assumption].
% 0.50/0.79 Derived: -in_environment(sk1,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(8,a,2,a)].
% 0.50/0.79 Derived: -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) | -greater(zero,growth_rate(E,F)). [resolve(8,a,3,a)].
% 0.50/0.79 9 -environment(A) | -subpopulations(B,C,A,D) | -greater_or_equal(growth_rate(C,D),zero) | -greater(zero,growth_rate(B,D)) | outcompetes(C,B,D) # label(d2_7) # label(hypothesis). [assumption].
% 0.50/0.79 Derived: -subpopulations(A,B,sk1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(9,a,2,a)].
% 0.50/0.79 Derived: -subpopulations(A,B,C,D) | -greater_or_equal(growth_rate(B,D),zero) | -greater(zero,growth_rate(A,D)) | outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(9,a,3,a)].
% 0.50/0.79 10 -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater_or_equal(growth_rate(B,C),zero). [resolve(5,a,2,a)].
% 0.50/0.79 11 outcompetes(first_movers,efficient_producers,sk2) # label(prove_t5_14) # label(negated_conjecture). [assumption].
% 0.50/0.79 Derived: -subpopulations(efficient_producers,first_movers,sk1,sk2) | greater_or_equal(growth_rate(first_movers,sk2),zero). [resolve(10,b,11,a)].
% 0.50/0.79 12 -subpopulations(A,B,C,D) | -outcompetes(B,A,D) | greater_or_equal(growth_rate(B,D),zero) | -greater(zero,growth_rate(E,F)). [resolve(5,a,3,a)].
% 0.50/0.79 Derived: -subpopulations(efficient_producers,first_movers,A,sk2) | greater_or_equal(growth_rate(first_movers,sk2),zero) | -greater(zero,growth_rate(B,C)). [resolve(12,b,11,a)].
% 0.50/0.79 13 -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater(zero,growth_rate(A,C)). [resolve(6,a,2,a)].
% 0.50/0.79 Derived: -subpopulations(efficient_producers,first_movers,sk1,sk2) | greater(zero,growth_rate(efficient_producers,sk2)). [resolve(13,b,11,a)].
% 0.50/0.79 14 -subpopulations(A,B,C,D) | -outcompetes(B,A,D) | greater(zero,growth_rate(A,D)) | -greater(zero,growth_rate(E,F)). [resolve(6,a,3,a)].
% 0.50/0.79 Derived: -subpopulations(efficient_producers,first_movers,A,sk2) | greater(zero,growth_rate(efficient_producers,sk2)) | -greater(zero,growth_rate(B,C)). [resolve(14,b,11,a)].
% 0.50/0.79 15 -subpopulations(A,B,sk1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(9,a,2,a)].
% 0.50/0.79 16 -subpopulations(A,B,C,D) | -greater_or_equal(growth_rate(B,D),zero) | -greater(zero,growth_rate(A,D)) | outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(9,a,3,a)].
% 0.50/0.79 17 greater(zero,growth_rate(A,B)) | -subpopulations(A,C,sk1,B) | greater_or_equal(growth_rate(A,B),zero). [resolve(7,b,2,a)].
% 0.50/0.79 18 -greater_or_equal(growth_rate(A,B),zero) | -greater(zero,growth_rate(A,B)) # label(mp_growth_rate_relationships_5) # label(axiom). [assumption].
% 0.50/0.79 19 greater(zero,growth_rate(A,B)) | -subpopulations(A,C,D,B) | greater_or_equal(growth_rate(A,B),zero) | -greater(zero,growth_rate(E,F)). [resolve(7,b,3,a)].
% 0.50/0.79 20 -subpopulations(efficient_producers,first_movers,sk1,sk2) | greater_or_equal(growth_rate(first_movers,sk2),zero). [resolve(10,b,11,a)].
% 0.50/0.79 Derived: -subpopulations(efficient_producers,first_movers,sk1,sk2) | -greater(zero,growth_rate(first_movers,sk2)). [resolve(20,b,18,a)].
% 0.50/0.79 21 -subpopulations(efficient_producers,first_movers,A,sk2) | greater_or_equal(growth_rate(first_movers,sk2),zero) | -greater(zero,growth_rate(
% 0.50/0.79 WARNING: denials share constants (see output).
% 0.50/0.79
% 0.50/0.79 B,C)). [resolve(12,b,11,a)].
% 0.50/0.79 Derived: -subpopulations(efficient_producers,first_movers,A,sk2) | -greater(zero,growth_rate(B,C)) | -greater(zero,growth_rate(first_movers,sk2)). [resolve(21,b,18,a)].
% 0.50/0.79 22 -in_environment(sk1,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(8,a,2,a)].
% 0.50/0.79 23 -subpopulations(first_movers,efficient_producers,sk1,A) | in_environment(sk1,A). [resolve(1,a,2,a)].
% 0.50/0.79 24 -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) | -greater(zero,growth_rate(C,D)). [resolve(1,a,3,a)].
% 0.50/0.79 Derived: greater(zero,growth_rate(A,B)) | -greater(resilience(C),resilience(A)) | -greater(zero,growth_rate(C,B)) | -subpopulations(first_movers,efficient_producers,sk1,B). [resolve(22,a,23,b)].
% 0.50/0.79 25 -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) | -greater(zero,growth_rate(E,F)). [resolve(8,a,3,a)].
% 0.50/0.79 Derived: greater(zero,growth_rate(A,B)) | -greater(resilience(C),resilience(A)) | -greater(zero,growth_rate(C,B)) | -greater(zero,growth_rate(D,E)) | -subpopulations(first_movers,efficient_producers,F,B) | -greater(zero,growth_rate(V6,V7)). [resolve(25,a,24,b)].
% 0.50/0.79
% 0.50/0.79 ============================== end predicate elimination =============
% 0.50/0.79
% 0.50/0.79 Auto_denials:
% 0.50/0.79 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.50/0.79
% 0.50/0.79 WARNING, because some of the denials share constants,
% 0.50/0.79 some of the denials or their descendents may be subsumed,
% 0.50/0.79 preventing the target number of proofs from being found.
% 0.50/0.79 The shared constants are: efficient_producers, sk2, first_movers, zero.
% 0.50/0.79
% 0.50/0.79 Term ordering decisions:
% 0.50/0.79
% 0.50/0.79 % Assigning unary symbol resilience kb_weight 0 and highest precedence (9).
% 0.50/0.79 Function symbol KB weights: zero=1. efficient_producers=1. first_movers=1. sk1=1. sk2=1. growth_rate=1. resilience=0.
% 0.50/0.79
% 0.50/0.79 ============================== end of process initial clauses ========
% 0.50/0.79
% 0.50/0.79 ============================== CLAUSES FOR SEARCH ====================
% 0.50/0.79
% 0.50/0.79 ============================== end of clauses for search =============
% 0.50/0.79
% 0.50/0.79 ============================== SEARCH ================================
% 0.50/0.79
% 0.50/0.79 % Starting search at 0.01 seconds.
% 0.50/0.79
% 0.50/0.79 ============================== PROOF =================================
% 0.50/0.79 % SZS status Unsatisfiable
% 0.50/0.79 % SZS output start Refutation
% 0.50/0.79
% 0.50/0.79 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.50/0.79 % Length of proof is 24.
% 0.50/0.79 % Level of proof is 5.
% 0.50/0.79 % Maximum clause weight is 30.000.
% 0.50/0.79 % Given clauses 10.
% 0.50/0.79
% 0.50/0.79 1 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur_2) # label(axiom). [assumption].
% 0.50/0.79 2 environment(sk1) # label(prove_t5_12) # label(negated_conjecture). [assumption].
% 0.50/0.79 3 environment(A) | -greater(zero,growth_rate(B,C)) # label(mp_growth_rate_relationships_3) # label(axiom). [assumption].
% 0.50/0.79 4 -environment(A) | -subpopulations(B,C,A,D) | subpopulations(C,B,A,D) # label(mp_symmetry_of_subpopulations_1) # label(axiom). [assumption].
% 0.50/0.79 5 -environment(A) | -subpopulations(B,C,A,D) | -outcompetes(C,B,D) | greater_or_equal(growth_rate(C,D),zero) # label(d2_8) # label(hypothesis). [assumption].
% 0.50/0.79 6 -environment(A) | -subpopulations(B,C,A,D) | -outcompetes(C,B,D) | greater(zero,growth_rate(B,D)) # label(d2_9) # label(hypothesis). [assumption].
% 0.50/0.79 8 -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_11) # label(hypothesis). [assumption].
% 0.50/0.79 10 -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater_or_equal(growth_rate(B,C),zero). [resolve(5,a,2,a)].
% 0.50/0.79 11 outcompetes(first_movers,efficient_producers,sk2) # label(prove_t5_14) # label(negated_conjecture). [assumption].
% 0.50/0.79 13 -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater(zero,growth_rate(A,C)). [resolve(6,a,2,a)].
% 0.50/0.79 18 -greater_or_equal(growth_rate(A,B),zero) | -greater(zero,growth_rate(A,B)) # label(mp_growth_rate_relationships_5) # label(axiom). [assumption].
% 0.50/0.79 20 -subpopulations(efficient_producers,first_movers,sk1,sk2) | greater_or_equal(growth_rate(first_movers,sk2),zero). [resolve(10,b,11,a)].
% 0.50/0.79 24 -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) | -greater(zero,growth_rate(C,D)). [resolve(1,a,3,a)].
% 0.50/0.79 25 -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) | -greater(zero,growth_rate(E,F)). [resolve(8,a,3,a)].
% 0.50/0.79 26 greater(resilience(efficient_producers),resilience(first_movers)) # label(a2_10) # label(hypothesis). [assumption].
% 0.50/0.79 27 subpopulations(first_movers,efficient_producers,sk1,sk2) # label(prove_t5_13) # label(negated_conjecture). [assumption].
% 0.50/0.79 29 -subpopulations(A,B,sk1,C) | subpopulations(B,A,sk1,C). [resolve(4,a,2,a)].
% 0.50/0.79 31 -subpopulations(efficient_producers,first_movers,sk1,sk2) | greater(zero,growth_rate(efficient_producers,sk2)). [resolve(13,b,11,a)].
% 0.50/0.79 33 -subpopulations(efficient_producers,first_movers,sk1,sk2) | -greater(zero,growth_rate(first_movers,sk2)). [resolve(20,b,18,a)].
% 0.50/0.79 36 greater(zero,growth_rate(A,B)) | -greater(resilience(C),resilience(A)) | -greater(zero,growth_rate(C,B)) | -greater(zero,growth_rate(D,E)) | -subpopulations(first_movers,efficient_producers,F,B) | -greater(zero,growth_rate(V6,V7)). [resolve(25,a,24,b)].
% 0.50/0.79 37 subpopulations(efficient_producers,first_movers,sk1,sk2). [hyper(29,a,27,a)].
% 0.50/0.79 38 -greater(zero,growth_rate(first_movers,sk2)). [back_unit_del(33),unit_del(a,37)].
% 0.50/0.79 39 greater(zero,growth_rate(efficient_producers,sk2)). [back_unit_del(31),unit_del(a,37)].
% 0.50/0.79 40 $F. [hyper(36,b,26,a,c,39,a,d,39,a,e,27,a,f,39,a),unit_del(a,38)].
% 0.50/0.79
% 0.50/0.79 % SZS output end Refutation
% 0.50/0.79 ============================== end of proof ==========================
% 0.50/0.79 % Redundant proof: 41 $F. [hyper(36,b,26,a,c,39,a,d,39,a,e,27,a,f,39,a),unit_del(a,38)].
% 0.50/0.79 % Redundant proof: 42 $F. [hyper(36,b,26,a,c,39,a,d,39,a,e,27,a,f,39,a),unit_del(a,38)].
% 0.50/0.79 % Redundant proof: 43 $F. [hyper(35,b,26,a,c,39,a,d,27,a),unit_del(a,38)].
% 0.50/0.79
% 0.50/0.79 % Disable descendants (x means already disabled):
% 0.50/0.79 0x 18x 33x 34x 38
% 0.50/0.79
% 0.50/0.79 ============================== STATISTICS ============================
% 0.50/0.79
% 0.50/0.79 Given=15. Generated=46. Kept=19. proofs=1.
% 0.50/0.79 Usable=12. Sos=0. Demods=0. Limbo=0, Disabled=43. Hints=0.
% 0.50/0.79 Megabytes=0.06.
% 0.50/0.79 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.50/0.79
% 0.50/0.79 ============================== end of statistics =====================
% 0.50/0.79
% 0.50/0.79 ============================== end of search =========================
% 0.50/0.79
% 0.50/0.79 SEARCH FAILED
% 0.50/0.79
% 0.50/0.79 Exiting with 1 proof.
% 0.50/0.79
% 0.50/0.79 Process 3490 exit (sos_empty) Thu Jun 9 08:31:08 2022
% 0.50/0.79 Prover9 interrupted
%------------------------------------------------------------------------------