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