TSTP Solution File: MGT036+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT036+3 : TPTP v8.1.0. Released v2.0.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:59 EDT 2022
% Result : Theorem 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT036+3 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % 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 07:57:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 12259 was started by sandbox2 on n023.cluster.edu,
% 0.43/0.99 Thu Jun 9 07:57:38 2022
% 0.43/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12106_n023.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_12106_n023.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (4 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99 1 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) -> subpopulations(S2,S1,E,T))) # label(mp_symmetry_of_subpopulations) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 2 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) -> (greater_or_equal(growth_rate(S2,T),zero) & greater(zero,growth_rate(S1,T)) <-> outcompetes(S2,S1,T)))) # label(d2) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.99 3 (exists E exists T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(growth_rate(first_movers,T),zero) & greater(zero,growth_rate(efficient_producers,T)))) # label(a13_star) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.99 4 -(exists E exists T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & outcompetes(first_movers,efficient_producers,T))) # label(prove_t5_star) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 5 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -outcompetes(first_movers,efficient_producers,B) # label(prove_t5_star) # label(negated_conjecture). [clausify(4)].
% 0.43/0.99 6 environment(c1) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -outcompetes(first_movers,efficient_producers,A). [resolve(5,a,6,a)].
% 0.43/0.99 7 -environment(A) | -subpopulations(B,C,A,D) | subpopulations(C,B,A,D) # label(mp_symmetry_of_subpopulations) # label(axiom). [clausify(1)].
% 0.43/0.99 Derived: -subpopulations(A,B,c1,C) | subpopulations(B,A,c1,C). [resolve(7,a,6,a)].
% 0.43/0.99 8 -environment(A) | -subpopulations(B,C,A,D) | greater_or_equal(growth_rate(C,D),zero) | -outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(2)].
% 0.43/0.99 Derived: -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(B,C),zero) | -outcompetes(B,A,C). [resolve(8,a,6,a)].
% 0.43/0.99 9 -environment(A) | -subpopulations(B,C,A,D) | greater(zero,growth_rate(B,D)) | -outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(2)].
% 0.43/0.99 Derived: -subpopulations(A,B,c1,C) | greater(zero,growth_rate(A,C)) | -outcompetes(B,A,C). [resolve(9,a,6,a)].
% 0.43/0.99 10 -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) # label(hypothesis). [clausify(2)].
% 0.43/0.99 Derived: -subpopulations(A,B,c1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(10,a,6,a)].
% 0.43/0.99 11 -subpopulations(A,B,c1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(10,a,6,a)].
% 0.43/0.99 12 greater_or_equal(growth_rate(first_movers,c2),zero) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 13 -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(B,C),zero) | -outcompetes(B,A,C). [resolve(8,a,6,a)].
% 0.43/0.99 Derived: -subpopulations(A,first_movers,c1,c2) | -greater(zero,growth_rate(A,c2)) | outcompetes(first_movers,A,c2). [resolve(11,b,12,a)].
% 0.43/0.99 Derived: -subpopulations(A,B,c1,C) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C) | -subpopulations(D,B,c1,C) | -outcompetes(B,D,C). [resolve(11,b,13,b)].
% 0.43/0.99 14 -subpopulations(A,first_movers,c1,c2) | -greater(zero,growth_rate(A,c2)) | outcompetes(first_movers,A,c2). [resolve(11,b,12,a)].
% 0.43/0.99 15 greater(zero,growth_rate(efficient_producers,c2)) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 16 -subpopulations(A,B,c1,C) | greater(zero,growth_rate(A,C)) | -outcompetes(B,A,C). [resolve(9,a,6,a)].
% 0.43/0.99 Derived: -subpopulations(efficient_producers,first_movers,c1,c2) | outcompetes(first_movers,efficient_producers,c2). [resolve(14,b,15,a)].
% 0.43/0.99 Derived: -subpopulations(A,first_movers,c1,c2) | outcompetes(first_movers,A,c2) | -subpopulations(A,B,c1,c2) | -outcompetes(B,A,c2). [resolve(14,b,16,b)].
% 0.43/0.99 17 -subpopulations(A,B,c1,C) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C) | -subpopulations(D,B,c1,C) | -outcompetes(B,D,C). [resolve(11,b,13,b)].
% 0.43/0.99 Derived: -subpopulations(efficient_producers,A,c1,c2) | outcompetes(A,efficient_producers,c2) | -subpopulations(B,A,c1,c2) | -outcompetes(A,B,c2). [resolve(17,b,15,a)].
% 0.43/0.99 Derived: -subpopulations(A,B,c1,C) | outcompetes(B,A,C) | -subpopulations(D,B,c1,C) | -outcompetes(B,D,C) | -subpopulations(A,E,c1,C) | -outcompetes(E,A,C). [resolve(17,b,16,b)].
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights: efficient_producers=1. first_movers=1. c1=1. c2=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Theorem
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 19.
% 0.43/0.99 % Level of proof is 6.
% 0.43/0.99 % Maximum clause weight is 10.000.
% 0.43/0.99 % Given clauses 3.
% 0.43/0.99
% 0.43/0.99 1 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) -> subpopulations(S2,S1,E,T))) # label(mp_symmetry_of_subpopulations) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 2 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) -> (greater_or_equal(growth_rate(S2,T),zero) & greater(zero,growth_rate(S1,T)) <-> outcompetes(S2,S1,T)))) # label(d2) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.99 3 (exists E exists T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(growth_rate(first_movers,T),zero) & greater(zero,growth_rate(efficient_producers,T)))) # label(a13_star) # label(hypothesis) # label(non_clause). [assumption].
% 0.43/0.99 4 -(exists E exists T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & outcompetes(first_movers,efficient_producers,T))) # label(prove_t5_star) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99 5 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -outcompetes(first_movers,efficient_producers,B) # label(prove_t5_star) # label(negated_conjecture). [clausify(4)].
% 0.43/0.99 6 environment(c1) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 7 -environment(A) | -subpopulations(B,C,A,D) | subpopulations(C,B,A,D) # label(mp_symmetry_of_subpopulations) # label(axiom). [clausify(1)].
% 0.43/0.99 10 -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) # label(hypothesis). [clausify(2)].
% 0.43/0.99 11 -subpopulations(A,B,c1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(10,a,6,a)].
% 0.43/0.99 12 greater_or_equal(growth_rate(first_movers,c2),zero) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 14 -subpopulations(A,first_movers,c1,c2) | -greater(zero,growth_rate(A,c2)) | outcompetes(first_movers,A,c2). [resolve(11,b,12,a)].
% 0.43/0.99 15 greater(zero,growth_rate(efficient_producers,c2)) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 18 subpopulations(first_movers,efficient_producers,c1,c2) # label(a13_star) # label(hypothesis). [clausify(3)].
% 0.43/0.99 19 -subpopulations(first_movers,efficient_producers,c1,A) | -outcompetes(first_movers,efficient_producers,A). [resolve(5,a,6,a)].
% 0.43/0.99 20 -subpopulations(A,B,c1,C) | subpopulations(B,A,c1,C). [resolve(7,a,6,a)].
% 0.43/0.99 21 -subpopulations(efficient_producers,first_movers,c1,c2) | outcompetes(first_movers,efficient_producers,c2). [resolve(14,b,15,a)].
% 0.43/0.99 25 -outcompetes(first_movers,efficient_producers,c2). [resolve(19,a,18,a)].
% 0.43/0.99 26 -subpopulations(efficient_producers,first_movers,c1,c2). [back_unit_del(21),unit_del(b,25)].
% 0.43/0.99 28 $F. [ur(20,a,18,a),unit_del(a,26)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=3. Generated=12. Kept=10. proofs=1.
% 0.43/0.99 Usable=3. Sos=5. Demods=0. Limbo=1, Disabled=21. Hints=0.
% 0.43/0.99 Megabytes=0.04.
% 0.43/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Theorem
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 12259 exit (max_proofs) Thu Jun 9 07:57:38 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------