TSTP Solution File: MGT036-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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.43s 0.97s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 10:20:37 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/0.97 ============================== Prover9 ===============================
% 0.43/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.97 Process 21383 was started by sandbox2 on n029.cluster.edu,
% 0.43/0.97 Thu Jun 9 10:20:37 2022
% 0.43/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21003_n029.cluster.edu".
% 0.43/0.97 ============================== end of head ===========================
% 0.43/0.97
% 0.43/0.97 ============================== INPUT =================================
% 0.43/0.97
% 0.43/0.97 % Reading from file /tmp/Prover9_21003_n029.cluster.edu
% 0.43/0.97
% 0.43/0.97 set(prolog_style_variables).
% 0.43/0.97 set(auto2).
% 0.43/0.97 % set(auto2) -> set(auto).
% 0.43/0.97 % set(auto) -> set(auto_inference).
% 0.43/0.97 % set(auto) -> set(auto_setup).
% 0.43/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.97 % set(auto) -> set(auto_limits).
% 0.43/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.97 % set(auto) -> set(auto_denials).
% 0.43/0.97 % set(auto) -> set(auto_process).
% 0.43/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.97 % set(auto2) -> assign(stats, some).
% 0.43/0.97 % set(auto2) -> clear(echo_input).
% 0.43/0.97 % set(auto2) -> set(quiet).
% 0.43/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.97 % set(auto2) -> clear(print_given).
% 0.43/0.97 assign(lrs_ticks,-1).
% 0.43/0.97 assign(sos_limit,10000).
% 0.43/0.97 assign(order,kbo).
% 0.43/0.97 set(lex_order_vars).
% 0.43/0.97 clear(print_given).
% 0.43/0.97
% 0.43/0.97 % formulas(sos). % not echoed (9 formulas)
% 0.43/0.97
% 0.43/0.97 ============================== end of input ==========================
% 0.43/0.97
% 0.43/0.97 % From the command line: assign(max_seconds, 300).
% 0.43/0.97
% 0.43/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.97
% 0.43/0.97 % Formulas that are not ordinary clauses:
% 0.43/0.97
% 0.43/0.97 ============================== end of process non-clausal formulas ===
% 0.43/0.97
% 0.43/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.97
% 0.43/0.97 ============================== PREDICATE ELIMINATION =================
% 0.43/0.97 1 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -outcompetes(first_movers,efficient_producers,B) # label(prove_t5_star_9) # label(negated_conjecture). [assumption].
% 0.43/0.97 2 environment(sk1) # label(a13_star_5) # label(hypothesis). [assumption].
% 0.43/0.97 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -outcompetes(first_movers,efficient_producers,A). [resolve(1,a,2,a)].
% 0.43/0.97 3 -environment(A) | -subpopulations(B,C,A,D) | subpopulations(C,B,A,D) # label(mp_symmetry_of_subpopulations_1) # label(axiom). [assumption].
% 0.43/0.97 Derived: -subpopulations(A,B,sk1,C) | subpopulations(B,A,sk1,C). [resolve(3,a,2,a)].
% 0.43/0.97 4 -environment(A) | -subpopulations(B,C,A,D) | -outcompetes(C,B,D) | greater_or_equal(growth_rate(C,D),zero) # label(d2_3) # label(hypothesis). [assumption].
% 0.43/0.97 Derived: -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater_or_equal(growth_rate(B,C),zero). [resolve(4,a,2,a)].
% 0.43/0.97 5 -environment(A) | -subpopulations(B,C,A,D) | -outcompetes(C,B,D) | greater(zero,growth_rate(B,D)) # label(d2_4) # label(hypothesis). [assumption].
% 0.43/0.97 Derived: -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater(zero,growth_rate(A,C)). [resolve(5,a,2,a)].
% 0.43/0.97 6 -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_2) # label(hypothesis). [assumption].
% 0.43/0.97 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(6,a,2,a)].
% 0.43/0.97 7 -subpopulations(A,B,sk1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(6,a,2,a)].
% 0.43/0.97 8 greater_or_equal(growth_rate(first_movers,sk2),zero) # label(a13_star_7) # label(hypothesis). [assumption].
% 0.43/0.97 9 -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater_or_equal(growth_rate(B,C),zero). [resolve(4,a,2,a)].
% 0.43/0.97 Derived: -subpopulations(A,first_movers,sk1,sk2) | -greater(zero,growth_rate(A,sk2)) | outcompetes(first_movers,A,sk2). [resolve(7,b,8,a)].
% 0.43/0.97 Derived: -subpopulations(A,B,sk1,C) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C) | -subpopulations(D,B,sk1,C) | -outcompetes(B,D,C). [resolve(7,b,9,c)].
% 0.43/0.97 10 -subpopulations(A,first_movers,sk1,sk2) | -greater(zero,growth_rate(A,sk2)) | outcompetes(first_movers,A,sk2). [resolve(7,b,8,a)].
% 0.43/0.97 11 greater(zero,growth_rate(efficient_producers,sk2)) # label(a13_star_8) # label(hypothesis). [assumption].
% 0.43/0.97 12 -subpopulations(A,B,sk1,C) | -outcompetes(B,A,C) | greater(zero,growth_rate(A,C)). [resolve(5,a,2,a)].
% 0.43/0.97 Derived: -subpopulations(efficient_producers,first_movers,sk1,sk2) | outcompetes(first_movers,efficient_producers,sk2). [resolve(10,b,11,a)].
% 0.43/0.97 Derived: -subpopulations(A,first_movers,sk1,sk2) | outcompetes(first_movers,A,sk2) | -subpopulations(A,B,sk1,sk2) | -outcompetes(B,A,sk2). [resolve(10,b,12,c)].
% 0.43/0.97 13 -subpopulations(A,B,sk1,C) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C) | -subpopulations(D,B,sk1,C) | -outcompetes(B,D,C). [resolve(7,b,9,c)].
% 0.43/0.97 Derived: -subpopulations(efficient_producers,A,sk1,sk2) | outcompetes(A,efficient_producers,sk2) | -subpopulations(B,A,sk1,sk2) | -outcompetes(A,B,sk2). [resolve(13,b,11,a)].
% 0.43/0.97 Derived: -subpopulations(A,B,sk1,C) | outcompetes(B,A,C) | -subpopulations(D,B,sk1,C) | -outcompetes(B,D,C) | -subpopulations(A,E,sk1,C) | -outcompetes(E,A,C). [resolve(13,b,12,c)].
% 0.43/0.97
% 0.43/0.97 ============================== end predicate elimination =============
% 0.43/0.97
% 0.43/0.97 Auto_denials: (no changes).
% 0.43/0.97
% 0.43/0.97 Term ordering decisions:
% 0.43/0.97 Function symbol KB weights: sk1=1. sk2=1. efficient_producers=1. first_movers=1.
% 0.43/0.97
% 0.43/0.97 ============================== end of process initial clauses ========
% 0.43/0.97
% 0.43/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.97
% 0.43/0.97 ============================== end of clauses for search =============
% 0.43/0.97
% 0.43/0.97 ============================== SEARCH ================================
% 0.43/0.97
% 0.43/0.97 % Starting search at 0.01 seconds.
% 0.43/0.97
% 0.43/0.97 ============================== PROOF =================================
% 0.43/0.97 % SZS status Unsatisfiable
% 0.43/0.97 % SZS output start Refutation
% 0.43/0.97
% 0.43/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.97 % Length of proof is 15.
% 0.43/0.97 % Level of proof is 5.
% 0.43/0.97 % Maximum clause weight is 10.000.
% 0.43/0.97 % Given clauses 3.
% 0.43/0.97
% 0.43/0.97 1 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -outcompetes(first_movers,efficient_producers,B) # label(prove_t5_star_9) # label(negated_conjecture). [assumption].
% 0.43/0.97 2 environment(sk1) # label(a13_star_5) # label(hypothesis). [assumption].
% 0.43/0.97 3 -environment(A) | -subpopulations(B,C,A,D) | subpopulations(C,B,A,D) # label(mp_symmetry_of_subpopulations_1) # label(axiom). [assumption].
% 0.43/0.97 6 -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_2) # label(hypothesis). [assumption].
% 0.43/0.97 7 -subpopulations(A,B,sk1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(6,a,2,a)].
% 0.43/0.97 8 greater_or_equal(growth_rate(first_movers,sk2),zero) # label(a13_star_7) # label(hypothesis). [assumption].
% 0.43/0.97 10 -subpopulations(A,first_movers,sk1,sk2) | -greater(zero,growth_rate(A,sk2)) | outcompetes(first_movers,A,sk2). [resolve(7,b,8,a)].
% 0.43/0.97 11 greater(zero,growth_rate(efficient_producers,sk2)) # label(a13_star_8) # label(hypothesis). [assumption].
% 0.43/0.97 14 subpopulations(first_movers,efficient_producers,sk1,sk2) # label(a13_star_6) # label(hypothesis). [assumption].
% 0.43/0.97 15 -subpopulations(first_movers,efficient_producers,sk1,A) | -outcompetes(first_movers,efficient_producers,A). [resolve(1,a,2,a)].
% 0.43/0.97 16 -subpopulations(A,B,sk1,C) | subpopulations(B,A,sk1,C). [resolve(3,a,2,a)].
% 0.43/0.97 17 -subpopulations(efficient_producers,first_movers,sk1,sk2) | outcompetes(first_movers,efficient_producers,sk2). [resolve(10,b,11,a)].
% 0.43/0.97 21 -outcompetes(first_movers,efficient_producers,sk2). [resolve(15,a,14,a)].
% 0.43/0.97 22 -subpopulations(efficient_producers,first_movers,sk1,sk2). [back_unit_del(17),unit_del(b,21)].
% 0.43/0.97 24 $F. [ur(16,a,14,a),unit_del(a,22)].
% 0.43/0.97
% 0.43/0.97 % SZS output end Refutation
% 0.43/0.97 ============================== end of proof ==========================
% 0.43/0.97
% 0.43/0.97 ============================== STATISTICS ============================
% 0.43/0.97
% 0.43/0.97 Given=3. Generated=12. Kept=10. proofs=1.
% 0.43/0.97 Usable=3. Sos=5. Demods=0. Limbo=1, Disabled=21. Hints=0.
% 0.43/0.97 Megabytes=0.04.
% 0.43/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.97
% 0.43/0.97 ============================== end of statistics =====================
% 0.43/0.97
% 0.43/0.97 ============================== end of search =========================
% 0.43/0.97
% 0.43/0.97 THEOREM PROVED
% 0.43/0.97 % SZS status Unsatisfiable
% 0.43/0.97
% 0.43/0.97 Exiting with 1 proof.
% 0.43/0.97
% 0.43/0.97 Process 21383 exit (max_proofs) Thu Jun 9 10:20:37 2022
% 0.43/0.97 Prover9 interrupted
%------------------------------------------------------------------------------