TSTP Solution File: MGT021+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT021+1 : TPTP v8.1.0. Released v2.0.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 : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT021+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 10:17:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 7521 was started by sandbox on n019.cluster.edu,
% 0.44/0.99 Thu Jun 9 10:17:25 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7362_n019.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_7362_n019.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (7 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> in_environment(E,T))) # label(mp_time_point_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater(number_of_organizations(E,T),zero))) # label(mp_environment_not_empty) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all X (increases(X) -> -decreases(X))) # label(mp_increase_not_decrease) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 (all X all Y (greater_or_equal(X,Y) -> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 5 (all E all T (environment(E) & in_environment(E,T) & greater(number_of_organizations(E,T),zero) -> (greater(equilibrium(E),T) -> decreases(resources(E,T))) & (-greater(equilibrium(E),T) -> constant(resources(E,T))))) # label(a3) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.99 6 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> (decreases(resources(E,T)) -> increases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))) & (constant(resources(E,T)) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))))) # label(l4) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.99 7 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))))) # label(prove_l3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 8 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(resources(A,B)) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l4) # label(hypothesis). [clausify(6)].
% 0.44/0.99 9 environment(c1) # label(prove_l3) # label(negated_conjecture). [clausify(7)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(resources(c1,A)) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(8,a,9,a)].
% 0.44/0.99 10 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_in_environment) # label(axiom). [clausify(1)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(10,a,9,a)].
% 0.44/0.99 11 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(number_of_organizations(A,B),zero) # label(mp_environment_not_empty) # label(axiom). [clausify(2)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | greater(number_of_organizations(c1,A),zero). [resolve(11,a,9,a)].
% 0.44/0.99 12 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a3) # label(hypothesis). [clausify(5)].
% 0.44/0.99 Derived: -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | -greater(equilibrium(c1),A) | decreases(resources(c1,A)). [resolve(12,a,9,a)].
% 0.44/0.99 13 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3) # label(hypothesis). [clausify(5)].
% 0.44/0.99 Derived: -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | greater(equilibrium(c1),A) | constant(resources(c1,A)). [resolve(13,a,9,a)].
% 0.44/0.99 14 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(resources(A,B)) | increases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l4) # label(hypothesis). [clausify(6)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(resources(c1,A)) | increases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(14,a,9,a)].
% 0.44/0.99 15 -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(resources(c1,A)) | increases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(14,a,9,a)].
% 0.44/0.99 16 -increases(A) | -decreases(A) # label(mp_increase_not_decrease) # label(axiom). [clausify(3)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(resources(c1,A)) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(15,c,16,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99
% 0.44/0.99 % Assigning unary symbol equilibrium kb_weight 0 and highest precedence (15).
% 0.44/0.99 Function symbol KB weights: efficient_producers=1. first_movers=1. zero=1. c1=1. c2=1. number_of_organizations=1. disbanding_rate=1. resources=1. difference=1. equilibrium=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 29.
% 0.44/0.99 % Level of proof is 5.
% 0.44/0.99 % Maximum clause weight is 17.000.
% 0.44/0.99 % Given clauses 11.
% 0.44/0.99
% 0.44/0.99 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> in_environment(E,T))) # label(mp_time_point_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater(number_of_organizations(E,T),zero))) # label(mp_environment_not_empty) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all X (increases(X) -> -decreases(X))) # label(mp_increase_not_decrease) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 5 (all E all T (environment(E) & in_environment(E,T) & greater(number_of_organizations(E,T),zero) -> (greater(equilibrium(E),T) -> decreases(resources(E,T))) & (-greater(equilibrium(E),T) -> constant(resources(E,T))))) # label(a3) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.99 6 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> (decreases(resources(E,T)) -> increases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))) & (constant(resources(E,T)) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T)))))) # label(l4) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/0.99 7 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -decreases(difference(disbanding_rate(first_movers,T),disbanding_rate(efficient_producers,T))))) # label(prove_l3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 8 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(resources(A,B)) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l4) # label(hypothesis). [clausify(6)].
% 0.44/0.99 9 environment(c1) # label(prove_l3) # label(negated_conjecture). [clausify(7)].
% 0.44/0.99 10 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_in_environment) # label(axiom). [clausify(1)].
% 0.44/0.99 11 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(number_of_organizations(A,B),zero) # label(mp_environment_not_empty) # label(axiom). [clausify(2)].
% 0.44/0.99 12 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a3) # label(hypothesis). [clausify(5)].
% 0.44/0.99 13 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3) # label(hypothesis). [clausify(5)].
% 0.44/0.99 14 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(resources(A,B)) | increases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l4) # label(hypothesis). [clausify(6)].
% 0.44/0.99 15 -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(resources(c1,A)) | increases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(14,a,9,a)].
% 0.44/0.99 16 -increases(A) | -decreases(A) # label(mp_increase_not_decrease) # label(axiom). [clausify(3)].
% 0.44/0.99 17 subpopulations(first_movers,efficient_producers,c1,c2) # label(prove_l3) # label(negated_conjecture). [clausify(7)].
% 0.44/0.99 18 decreases(difference(disbanding_rate(first_movers,c2),disbanding_rate(efficient_producers,c2))) # label(prove_l3) # label(negated_conjecture). [clausify(7)].
% 0.44/0.99 19 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(resources(c1,A)) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(8,a,9,a)].
% 0.44/0.99 20 -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(10,a,9,a)].
% 0.44/0.99 21 -subpopulations(first_movers,efficient_producers,c1,A) | greater(number_of_organizations(c1,A),zero). [resolve(11,a,9,a)].
% 0.44/0.99 22 -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | -greater(equilibrium(c1),A) | decreases(resources(c1,A)). [resolve(12,a,9,a)].
% 0.44/0.99 23 -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | greater(equilibrium(c1),A) | constant(resources(c1,A)). [resolve(13,a,9,a)].
% 0.44/0.99 24 -subpopulations(first_movers,efficient_producers,c1,A) | -decreases(resources(c1,A)) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(15,c,16,a)].
% 0.44/0.99 25 -constant(resources(c1,c2)). [resolve(19,a,17,a),unit_del(b,18)].
% 0.44/0.99 26 in_environment(c1,c2). [resolve(20,a,17,a)].
% 0.44/0.99 27 greater(number_of_organizations(c1,c2),zero). [resolve(21,a,17,a)].
% 0.44/0.99 28 -decreases(resources(c1,c2)). [resolve(24,a,17,a),unit_del(b,18)].
% 0.44/0.99 29 greater(equilibrium(c1),c2). [resolve(26,a,23,a),unit_del(a,27),unit_del(c,25)].
% 0.44/0.99 30 $F. [resolve(26,a,22,a),unit_del(a,27),unit_del(b,29),unit_del(c,28)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=11. Generated=16. Kept=13. proofs=1.
% 0.44/0.99 Usable=11. Sos=1. Demods=0. Limbo=1, Disabled=18. Hints=0.
% 0.44/0.99 Megabytes=0.06.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 7521 exit (max_proofs) Thu Jun 9 10:17:25 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------