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