TSTP Solution File: MGT023+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT023+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:53 EDT 2022
% Result : Theorem 0.46s 1.00s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT023+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 09:44:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 13660 was started by sandbox on n025.cluster.edu,
% 0.46/1.00 Thu Jun 9 09:44:21 2022
% 0.46/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13506_n025.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_13506_n025.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (3 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00 1 (all E all To (environment(E) & -greater(growth_rate(efficient_producers,To),growth_rate(first_movers,To)) & in_environment(E,To) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,To) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))) -> To = critical_point(E))) # label(d1) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/1.00 2 (all E (environment(E) & stable(E) -> (exists To (in_environment(E,To) & -greater(growth_rate(efficient_producers,To),growth_rate(first_movers,To)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,To) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))))))) # label(l12) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/1.00 3 -(all E (environment(E) & stable(E) -> in_environment(E,critical_point(E)))) # label(prove_l5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.00
% 0.46/1.00 ============================== end of process non-clausal formulas ===
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.00
% 0.46/1.00 ============================== PREDICATE ELIMINATION =================
% 0.46/1.00 4 -environment(A) | -stable(A) | -greater(growth_rate(efficient_producers,f2(A)),growth_rate(first_movers,f2(A))) # label(l12) # label(hypothesis). [clausify(2)].
% 0.46/1.00 5 environment(c1) # label(prove_l5) # label(negated_conjecture). [clausify(3)].
% 0.46/1.00 Derived: -stable(c1) | -greater(growth_rate(efficient_producers,f2(c1)),growth_rate(first_movers,f2(c1))). [resolve(4,a,5,a)].
% 0.46/1.00 6 -environment(A) | -stable(A) | in_environment(A,f2(A)) # label(l12) # label(hypothesis). [clausify(2)].
% 0.46/1.00 Derived: -stable(c1) | in_environment(c1,f2(c1)). [resolve(6,a,5,a)].
% 0.46/1.00 7 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater(B,f2(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l12) # label(hypothesis). [clausify(2)].
% 0.46/1.00 Derived: -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater(A,f2(c1)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(7,a,5,a)].
% 0.46/1.00 8 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | greater(f1(A,B),B) | critical_point(A) = B # label(d1) # label(hypothesis). [clausify(1)].
% 0.46/1.00 Derived: greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(c1,A) | greater(f1(c1,A),A) | critical_point(c1) = A. [resolve(8,a,5,a)].
% 0.46/1.00 9 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f1(A,B)) | critical_point(A) = B # label(d1) # label(hypothesis). [clausify(1)].
% 0.46/1.00 Derived: greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | critical_point(c1) = A. [resolve(9,a,5,a)].
% 0.46/1.00 10 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,f1(A,B)),growth_rate(first_movers,f1(A,B))) | critical_point(A) = B # label(d1) # label(hypothesis). [clausify(1)].
% 0.46/1.00 Derived: greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(c1,A) | -greater(growth_rate(efficient_producers,f1(c1,A)),growth_rate(first_movers,f1(c1,A))) | critical_point(c1) = A. [resolve(10,a,5,a)].
% 0.46/1.00
% 0.46/1.00 ============================== end predicate elimination =============
% 0.46/1.00
% 0.46/1.00 Auto_denials: (non-Horn, no changes).
% 0.46/1.00
% 0.46/1.00 Term ordering decisions:
% 0.46/1.00 Function symbol KB weights: efficient_producers=1. first_movers=1. c1=1. growth_rate=1. f1=1. critical_point=1. f2=1.
% 0.46/1.00
% 0.46/1.00 ============================== end of process initial clauses ========
% 0.46/1.00
% 0.46/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.00
% 0.46/1.00 ============================== end of clauses for search =============
% 0.46/1.00
% 0.46/1.00 ============================== SEARCH ================================
% 0.46/1.00
% 0.46/1.00 % Starting search at 0.01 seconds.
% 0.46/1.00
% 0.46/1.00 ============================== PROOF =================================
% 0.46/1.00 % SZS status Theorem
% 0.46/1.00 % SZS output start Refutation
% 0.46/1.00
% 0.46/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.00 % Length of proof is 28.
% 0.46/1.00 % Level of proof is 8.
% 0.46/1.00 % Maximum clause weight is 25.000.
% 0.46/1.00 % Given clauses 13.
% 0.46/1.00
% 0.46/1.00 1 (all E all To (environment(E) & -greater(growth_rate(efficient_producers,To),growth_rate(first_movers,To)) & in_environment(E,To) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,To) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))) -> To = critical_point(E))) # label(d1) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/1.00 2 (all E (environment(E) & stable(E) -> (exists To (in_environment(E,To) & -greater(growth_rate(efficient_producers,To),growth_rate(first_movers,To)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,To) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))))))) # label(l12) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/1.00 3 -(all E (environment(E) & stable(E) -> in_environment(E,critical_point(E)))) # label(prove_l5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.00 4 -environment(A) | -stable(A) | -greater(growth_rate(efficient_producers,f2(A)),growth_rate(first_movers,f2(A))) # label(l12) # label(hypothesis). [clausify(2)].
% 0.46/1.00 5 environment(c1) # label(prove_l5) # label(negated_conjecture). [clausify(3)].
% 0.46/1.00 6 -environment(A) | -stable(A) | in_environment(A,f2(A)) # label(l12) # label(hypothesis). [clausify(2)].
% 0.46/1.00 7 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater(B,f2(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l12) # label(hypothesis). [clausify(2)].
% 0.46/1.00 8 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | greater(f1(A,B),B) | critical_point(A) = B # label(d1) # label(hypothesis). [clausify(1)].
% 0.46/1.00 9 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f1(A,B)) | critical_point(A) = B # label(d1) # label(hypothesis). [clausify(1)].
% 0.46/1.00 10 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,f1(A,B)),growth_rate(first_movers,f1(A,B))) | critical_point(A) = B # label(d1) # label(hypothesis). [clausify(1)].
% 0.46/1.00 11 stable(c1) # label(prove_l5) # label(negated_conjecture). [clausify(3)].
% 0.46/1.00 12 -in_environment(c1,critical_point(c1)) # label(prove_l5) # label(negated_conjecture). [clausify(3)].
% 0.46/1.00 13 -stable(c1) | -greater(growth_rate(efficient_producers,f2(c1)),growth_rate(first_movers,f2(c1))). [resolve(4,a,5,a)].
% 0.46/1.00 14 -greater(growth_rate(efficient_producers,f2(c1)),growth_rate(first_movers,f2(c1))). [copy(13),unit_del(a,11)].
% 0.46/1.00 15 -stable(c1) | in_environment(c1,f2(c1)). [resolve(6,a,5,a)].
% 0.46/1.00 16 in_environment(c1,f2(c1)). [copy(15),unit_del(a,11)].
% 0.46/1.00 17 -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater(A,f2(c1)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(7,a,5,a)].
% 0.46/1.00 18 -subpopulations(first_movers,efficient_producers,c1,A) | -greater(A,f2(c1)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [copy(17),unit_del(a,11)].
% 0.46/1.00 19 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(c1,A) | greater(f1(c1,A),A) | critical_point(c1) = A. [resolve(8,a,5,a)].
% 0.46/1.00 20 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | critical_point(c1) = A. [resolve(9,a,5,a)].
% 0.46/1.00 21 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(c1,A) | -greater(growth_rate(efficient_producers,f1(c1,A)),growth_rate(first_movers,f1(c1,A))) | critical_point(c1) = A. [resolve(10,a,5,a)].
% 0.46/1.00 22 greater(f1(c1,f2(c1)),f2(c1)) | f2(c1) = critical_point(c1). [resolve(19,b,16,a),flip(c),unit_del(a,14)].
% 0.46/1.00 23 subpopulations(first_movers,efficient_producers,c1,f1(c1,f2(c1))) | f2(c1) = critical_point(c1). [resolve(20,b,16,a),flip(c),unit_del(a,14)].
% 0.46/1.00 24 -greater(growth_rate(efficient_producers,f1(c1,f2(c1))),growth_rate(first_movers,f1(c1,f2(c1)))) | f2(c1) = critical_point(c1). [resolve(21,b,16,a),flip(c),unit_del(a,14)].
% 0.46/1.00 25 f2(c1) = critical_point(c1) | -greater(f1(c1,f2(c1)),f2(c1)) | greater(growth_rate(efficient_producers,f1(c1,f2(c1))),growth_rate(first_movers,f1(c1,f2(c1)))). [resolve(23,a,18,a)].
% 0.46/1.00 26 f2(c1) = critical_point(c1) | greater(growth_rate(efficient_producers,f1(c1,f2(c1))),growth_rate(first_movers,f1(c1,f2(c1)))). [resolve(25,b,22,a),merge(c)].
% 0.46/1.00 27 f2(c1) = critical_point(c1). [resolve(26,b,24,a),merge(b)].
% 0.46/1.00 29 $F. [back_rewrite(16),rewrite([27(3)]),unit_del(a,12)].
% 0.46/1.00
% 0.46/1.00 % SZS output end Refutation
% 0.46/1.00 ============================== end of proof ==========================
% 0.46/1.00
% 0.46/1.00 ============================== STATISTICS ============================
% 0.46/1.00
% 0.46/1.00 Given=13. Generated=16. Kept=15. proofs=1.
% 0.46/1.00 Usable=6. Sos=0. Demods=1. Limbo=2, Disabled=22. Hints=0.
% 0.46/1.00 Megabytes=0.06.
% 0.46/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.00
% 0.46/1.00 ============================== end of statistics =====================
% 0.46/1.00
% 0.46/1.00 ============================== end of search =========================
% 0.46/1.00
% 0.46/1.00 THEOREM PROVED
% 0.46/1.00 % SZS status Theorem
% 0.46/1.00
% 0.46/1.00 Exiting with 1 proof.
% 0.46/1.00
% 0.46/1.00 Process 13660 exit (max_proofs) Thu Jun 9 09:44:21 2022
% 0.46/1.00 Prover9 interrupted
%------------------------------------------------------------------------------