TSTP Solution File: MGT020-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT020-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:52 EDT 2022
% Result : Unsatisfiable 0.48s 1.04s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : MGT020-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Thu Jun 9 12:15:10 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.48/1.03 ============================== Prover9 ===============================
% 0.48/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.03 Process 6024 was started by sandbox2 on n019.cluster.edu,
% 0.48/1.03 Thu Jun 9 12:15:10 2022
% 0.48/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5870_n019.cluster.edu".
% 0.48/1.03 ============================== end of head ===========================
% 0.48/1.03
% 0.48/1.03 ============================== INPUT =================================
% 0.48/1.03
% 0.48/1.03 % Reading from file /tmp/Prover9_5870_n019.cluster.edu
% 0.48/1.03
% 0.48/1.03 set(prolog_style_variables).
% 0.48/1.03 set(auto2).
% 0.48/1.03 % set(auto2) -> set(auto).
% 0.48/1.03 % set(auto) -> set(auto_inference).
% 0.48/1.03 % set(auto) -> set(auto_setup).
% 0.48/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.03 % set(auto) -> set(auto_limits).
% 0.48/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.03 % set(auto) -> set(auto_denials).
% 0.48/1.03 % set(auto) -> set(auto_process).
% 0.48/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.03 % set(auto2) -> assign(stats, some).
% 0.48/1.03 % set(auto2) -> clear(echo_input).
% 0.48/1.03 % set(auto2) -> set(quiet).
% 0.48/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.03 % set(auto2) -> clear(print_given).
% 0.48/1.03 assign(lrs_ticks,-1).
% 0.48/1.03 assign(sos_limit,10000).
% 0.48/1.03 assign(order,kbo).
% 0.48/1.03 set(lex_order_vars).
% 0.48/1.03 clear(print_given).
% 0.48/1.03
% 0.48/1.03 % formulas(sos). % not echoed (14 formulas)
% 0.48/1.03
% 0.48/1.03 ============================== end of input ==========================
% 0.48/1.03
% 0.48/1.03 % From the command line: assign(max_seconds, 300).
% 0.48/1.03
% 0.48/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.03
% 0.48/1.03 % Formulas that are not ordinary clauses:
% 0.48/1.03
% 0.48/1.03 ============================== end of process non-clausal formulas ===
% 0.48/1.03
% 0.48/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.03
% 0.48/1.03 ============================== PREDICATE ELIMINATION =================
% 0.48/1.03 1 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l3_22) # label(axiom). [assumption].
% 0.48/1.03 2 environment(sk1) # label(prove_l2_33) # label(negated_conjecture). [assumption].
% 0.48/1.03 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(1,a,2,a)].
% 0.48/1.03 3 -environment(A) | greater_or_equal(initial_FM_EP(A),start_time(A)) # label(mp_initial_time_27) # label(axiom). [assumption].
% 0.48/1.03 Derived: greater_or_equal(initial_FM_EP(sk1),start_time(sk1)). [resolve(3,a,2,a)].
% 0.48/1.03 4 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occurs_26) # label(axiom). [assumption].
% 0.48/1.03 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | in_environment(sk1,A). [resolve(4,a,2,a)].
% 0.48/1.03 5 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater_or_equal(B,initial_FM_EP(A)) # label(mp_earliest_time_point_24) # label(axiom). [assumption].
% 0.48/1.03 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | greater_or_equal(A,initial_FM_EP(sk1)). [resolve(5,a,2,a)].
% 0.48/1.03 6 -environment(A) | greater(disbanding_rate(first_movers,initial_FM_EP(A)),disbanding_rate(efficient_producers,initial_FM_EP(A))) # label(a8_31) # label(hypothesis). [assumption].
% 0.48/1.03 Derived: greater(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1))). [resolve(6,a,2,a)].
% 0.48/1.03 7 -environment(A) | -in_environment(A,initial_FM_EP(A)) | subpopulations(first_movers,efficient_producers,A,initial_FM_EP(A)) # label(mp_earliest_time_point_23) # label(axiom). [assumption].
% 0.48/1.04 Derived: -in_environment(sk1,initial_FM_EP(sk1)) | subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)). [resolve(7,a,2,a)].
% 0.48/1.04 8 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater(C,B) | -in_environment(A,C) | in_environment(A,B) # label(mp_times_in_order_28) # label(axiom). [assumption].
% 0.48/1.04 Derived: -greater_or_equal(A,start_time(sk1)) | -greater(B,A) | -in_environment(sk1,B) | in_environment(sk1,A). [resolve(8,a,2,a)].
% 0.48/1.04 9 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(D,B) | -greater_or_equal(C,D) | subpopulations(first_movers,efficient_producers,A,D) # label(a10_32) # label(hypothesis). [assumption].
% 0.48/1.04 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -subpopulations(first_movers,efficient_producers,sk1,B) | -greater_or_equal(C,A) | -greater_or_equal(B,C) | subpopulations(first_movers,efficient_producers,sk1,C). [resolve(9,a,2,a)].
% 0.48/1.04 10 -environment(A) | -greater_or_equal(B,C) | -greater_or_equal(D,B) | -subpopulations(first_movers,efficient_producers,A,D) | -greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)) | decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) | greater(disbanding_rate(first_movers,D),disbanding_rate(efficient_producers,D)) # label(mp_positive_function_difference_25) # label(axiom). [assumption].
% 0.48/1.04 Derived: -greater_or_equal(A,B) | -greater_or_equal(C,A) | -subpopulations(first_movers,efficient_producers,sk1,C) | -greater(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)) | decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))) | greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)). [resolve(10,a,2,a)].
% 0.48/1.04
% 0.48/1.04 ============================== end predicate elimination =============
% 0.48/1.04
% 0.48/1.04 Auto_denials: (non-Horn, no changes).
% 0.48/1.04
% 0.48/1.04 Term ordering decisions:
% 0.48/1.04 Function symbol KB weights: sk1=1. efficient_producers=1. first_movers=1. sk2=1. disbanding_rate=1. difference=1. initial_FM_EP=1. start_time=1.
% 0.48/1.04
% 0.48/1.04 ============================== end of process initial clauses ========
% 0.48/1.04
% 0.48/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.48/1.04
% 0.48/1.04 ============================== end of clauses for search =============
% 0.48/1.04
% 0.48/1.04 ============================== SEARCH ================================
% 0.48/1.04
% 0.48/1.04 % Starting search at 0.01 seconds.
% 0.48/1.04
% 0.48/1.04 ============================== PROOF =================================
% 0.48/1.04 % SZS status Unsatisfiable
% 0.48/1.04 % SZS output start Refutation
% 0.48/1.04
% 0.48/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.48/1.04 % Length of proof is 35.
% 0.48/1.04 % Level of proof is 10.
% 0.48/1.04 % Maximum clause weight is 33.000.
% 0.48/1.04 % Given clauses 42.
% 0.48/1.04
% 0.48/1.04 1 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) # label(l3_22) # label(axiom). [assumption].
% 0.48/1.04 2 environment(sk1) # label(prove_l2_33) # label(negated_conjecture). [assumption].
% 0.48/1.04 3 -environment(A) | greater_or_equal(initial_FM_EP(A),start_time(A)) # label(mp_initial_time_27) # label(axiom). [assumption].
% 0.48/1.04 4 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occurs_26) # label(axiom). [assumption].
% 0.48/1.04 5 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater_or_equal(B,initial_FM_EP(A)) # label(mp_earliest_time_point_24) # label(axiom). [assumption].
% 0.48/1.04 6 -environment(A) | greater(disbanding_rate(first_movers,initial_FM_EP(A)),disbanding_rate(efficient_producers,initial_FM_EP(A))) # label(a8_31) # label(hypothesis). [assumption].
% 0.48/1.04 7 -environment(A) | -in_environment(A,initial_FM_EP(A)) | subpopulations(first_movers,efficient_producers,A,initial_FM_EP(A)) # label(mp_earliest_time_point_23) # label(axiom). [assumption].
% 0.48/1.04 8 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater(C,B) | -in_environment(A,C) | in_environment(A,B) # label(mp_times_in_order_28) # label(axiom). [assumption].
% 0.48/1.04 10 -environment(A) | -greater_or_equal(B,C) | -greater_or_equal(D,B) | -subpopulations(first_movers,efficient_producers,A,D) | -greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)) | decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))) | greater(disbanding_rate(first_movers,D),disbanding_rate(efficient_producers,D)) # label(mp_positive_function_difference_25) # label(axiom). [assumption].
% 0.48/1.04 11 subpopulations(first_movers,efficient_producers,sk1,sk2) # label(prove_l2_34) # label(negated_conjecture). [assumption].
% 0.48/1.04 12 -greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)) # label(prove_l2_35) # label(negated_conjecture). [assumption].
% 0.48/1.04 14 -greater_or_equal(A,B) | greater(A,B) | A = B # label(mp_greater_or_equal_30) # label(axiom). [assumption].
% 0.48/1.04 15 -subpopulations(first_movers,efficient_producers,sk1,A) | -decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(1,a,2,a)].
% 0.48/1.04 16 greater_or_equal(initial_FM_EP(sk1),start_time(sk1)). [resolve(3,a,2,a)].
% 0.48/1.04 17 -subpopulations(first_movers,efficient_producers,sk1,A) | in_environment(sk1,A). [resolve(4,a,2,a)].
% 0.48/1.04 18 -subpopulations(first_movers,efficient_producers,sk1,A) | greater_or_equal(A,initial_FM_EP(sk1)). [resolve(5,a,2,a)].
% 0.48/1.04 19 greater(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1))). [resolve(6,a,2,a)].
% 0.48/1.04 20 -in_environment(sk1,initial_FM_EP(sk1)) | subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)). [resolve(7,a,2,a)].
% 0.48/1.04 21 -greater_or_equal(A,start_time(sk1)) | -greater(B,A) | -in_environment(sk1,B) | in_environment(sk1,A). [resolve(8,a,2,a)].
% 0.48/1.04 23 -greater_or_equal(A,B) | -greater_or_equal(C,A) | -subpopulations(first_movers,efficient_producers,sk1,C) | -greater(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)) | decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))) | greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C)). [resolve(10,a,2,a)].
% 0.48/1.04 25 -decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))). [resolve(15,a,11,a)].
% 0.48/1.04 27 in_environment(sk1,sk2). [resolve(17,a,11,a)].
% 0.48/1.04 28 greater_or_equal(sk2,initial_FM_EP(sk1)). [resolve(18,a,11,a)].
% 0.48/1.04 33 -greater_or_equal(A,B) | -greater_or_equal(sk2,A) | -greater(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)) | decreases(difference(disbanding_rate(first_movers,A),disbanding_rate(efficient_producers,A))). [resolve(23,c,11,a),unit_del(e,12)].
% 0.48/1.04 35 -greater_or_equal(A,start_time(sk1)) | -greater(sk2,A) | in_environment(sk1,A). [resolve(27,a,21,c)].
% 0.48/1.04 36 greater(sk2,initial_FM_EP(sk1)) | initial_FM_EP(sk1) = sk2. [resolve(28,a,14,a),flip(b)].
% 0.48/1.04 37 -greater_or_equal(sk2,sk2). [ur(23,a,28,a,c,11,a,d,19,a,e,25,a,f,12,a)].
% 0.48/1.04 42 -greater(sk2,initial_FM_EP(sk1)) | in_environment(sk1,initial_FM_EP(sk1)). [resolve(35,a,16,a)].
% 0.48/1.04 43 in_environment(sk1,initial_FM_EP(sk1)) | initial_FM_EP(sk1) = sk2. [resolve(42,a,36,a)].
% 0.48/1.04 45 initial_FM_EP(sk1) = sk2 | subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)). [resolve(43,a,20,a)].
% 0.48/1.04 49 initial_FM_EP(sk1) = sk2 | greater_or_equal(initial_FM_EP(sk1),initial_FM_EP(sk1)). [resolve(45,b,18,a)].
% 0.48/1.04 50 initial_FM_EP(sk1) = sk2 | -decreases(difference(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1)))). [resolve(45,b,15,a)].
% 0.48/1.04 58 decreases(difference(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1)))) | initial_FM_EP(sk1) = sk2. [resolve(33,a,49,b),unit_del(a,28),unit_del(b,19)].
% 0.48/1.04 61 initial_FM_EP(sk1) = sk2. [resolve(58,a,50,b),merge(b)].
% 0.48/1.04 68 $F. [back_rewrite(28),rewrite([61(3)]),unit_del(a,37)].
% 0.48/1.04
% 0.48/1.04 % SZS output end Refutation
% 0.48/1.04 ============================== end of proof ==========================
% 0.48/1.04
% 0.48/1.04 ============================== STATISTICS ============================
% 0.48/1.04
% 0.48/1.04 Given=42. Generated=82. Kept=57. proofs=1.
% 0.48/1.04 Usable=23. Sos=0. Demods=1. Limbo=7, Disabled=50. Hints=0.
% 0.48/1.04 Megabytes=0.10.
% 0.48/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.48/1.04
% 0.48/1.04 ============================== end of statistics =====================
% 0.48/1.04
% 0.48/1.04 ============================== end of search =========================
% 0.48/1.04
% 0.48/1.04 THEOREM PROVED
% 0.48/1.04 % SZS status Unsatisfiable
% 0.48/1.04
% 0.48/1.04 Exiting with 1 proof.
% 0.48/1.04
% 0.48/1.04 Process 6024 exit (max_proofs) Thu Jun 9 12:15:10 2022
% 0.48/1.04 Prover9 interrupted
%------------------------------------------------------------------------------