TSTP Solution File: MGT039+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:23:01 EDT 2022
% Result : Theorem 0.63s 0.95s
% Output : Refutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n029.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 08:05:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.63/0.95 ============================== Prover9 ===============================
% 0.63/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.63/0.95 Process 947 was started by sandbox on n029.cluster.edu,
% 0.63/0.95 Thu Jun 9 08:05:07 2022
% 0.63/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_585_n029.cluster.edu".
% 0.63/0.95 ============================== end of head ===========================
% 0.63/0.95
% 0.63/0.95 ============================== INPUT =================================
% 0.63/0.95
% 0.63/0.95 % Reading from file /tmp/Prover9_585_n029.cluster.edu
% 0.63/0.95
% 0.63/0.95 set(prolog_style_variables).
% 0.63/0.95 set(auto2).
% 0.63/0.95 % set(auto2) -> set(auto).
% 0.63/0.95 % set(auto) -> set(auto_inference).
% 0.63/0.95 % set(auto) -> set(auto_setup).
% 0.63/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.63/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.63/0.95 % set(auto) -> set(auto_limits).
% 0.63/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.63/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.63/0.95 % set(auto) -> set(auto_denials).
% 0.63/0.95 % set(auto) -> set(auto_process).
% 0.63/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.63/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.63/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.63/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.63/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.63/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.63/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.63/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.63/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.63/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.63/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.63/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.63/0.95 % set(auto2) -> assign(stats, some).
% 0.63/0.95 % set(auto2) -> clear(echo_input).
% 0.63/0.95 % set(auto2) -> set(quiet).
% 0.63/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.63/0.95 % set(auto2) -> clear(print_given).
% 0.63/0.95 assign(lrs_ticks,-1).
% 0.63/0.95 assign(sos_limit,10000).
% 0.63/0.95 assign(order,kbo).
% 0.63/0.95 set(lex_order_vars).
% 0.63/0.95 clear(print_given).
% 0.63/0.95
% 0.63/0.95 % formulas(sos). % not echoed (12 formulas)
% 0.63/0.95
% 0.63/0.95 ============================== end of input ==========================
% 0.63/0.95
% 0.63/0.95 % From the command line: assign(max_seconds, 300).
% 0.63/0.95
% 0.63/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.63/0.95
% 0.63/0.95 % Formulas that are not ordinary clauses:
% 0.63/0.95 1 (all P (observational_period(P) & propagation_strategy(first_movers) & propagation_strategy(efficient_producers) & (all E (environment(E) & in_environment(P,E) -> selection_favors(efficient_producers,first_movers,end_time(E)))) -> selection_favors(efficient_producers,first_movers,P))) # label(mp3_favoured_trategy) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 2 (all P (observational_period(P) & slow_change(P) -> (all E (environment(E) & in_environment(P,E) -> (exists T (in_environment(E,T) & greater(T,critical_point(E)))))))) # label(mp4_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 3 (all E all T (environment(E) & greater_or_equal(T,start_time(E)) & greater_or_equal(end_time(E),T) -> in_environment(E,T))) # label(mp_time_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 4 (all E all T (environment(E) & in_environment(E,T) -> greater_or_equal(end_time(E),T))) # label(mp_environment_end_point) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 5 (all E (environment(E) -> greater_or_equal(critical_point(E),start_time(E)))) # label(mp_time_of_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 6 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 7 (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.63/0.95 8 (all E all T (environment(E) & greater(T,start_time(E)) & -greater(T,end_time(E)) -> greater_or_equal(end_time(E),T))) # label(mp_beginning_and_ending) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 9 (all E all T (environment(E) & in_environment(E,T) & greater(T,critical_point(E)) -> selection_favors(efficient_producers,first_movers,T))) # label(l8) # label(hypothesis) # label(non_clause). [assumption].
% 0.63/0.95 10 -(all P (observational_period(P) & slow_change(P) -> selection_favors(efficient_producers,first_movers,P))) # label(prove_t8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.63/0.95
% 0.63/0.95 ============================== end of process non-clausal formulas ===
% 0.63/0.95
% 0.63/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.63/0.95
% 0.63/0.95 ============================== PREDICATE ELIMINATION =================
% 0.63/0.95 11 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(1)].
% 0.63/0.95 12 observational_period(c1) # label(prove_t8) # label(negated_conjecture). [clausify(10)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(11,a,12,a)].
% 0.63/0.95 13 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(1)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(c1,f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(13,a,12,a)].
% 0.63/0.95 14 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,f2(A,B)) # label(mp4_critical_point) # label(axiom). [clausify(2)].
% 0.63/0.95 Derived: -slow_change(c1) | -environment(A) | -in_environment(c1,A) | in_environment(A,f2(c1,A)). [resolve(14,a,12,a)].
% 0.63/0.95 15 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(f2(A,B),critical_point(B)) # label(mp4_critical_point) # label(axiom). [clausify(2)].
% 0.63/0.95 Derived: -slow_change(c1) | -environment(A) | -in_environment(c1,A) | greater(f2(c1,A),critical_point(A)). [resolve(15,a,12,a)].
% 0.63/0.95 16 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(1)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(c1))) | selection_favors(efficient_producers,first_movers,c1). [resolve(16,a,12,a)].
% 0.63/0.95 17 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(11,a,12,a)].
% 0.63/0.95 18 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point) # label(axiom). [clausify(5)].
% 0.63/0.95 19 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point) # label(axiom). [clausify(4)].
% 0.63/0.95 20 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater_or_equal(end_time(A),B) | in_environment(A,B) # label(mp_time_in_environment) # label(axiom). [clausify(3)].
% 0.63/0.95 21 -environment(A) | -in_environment(A,B) | -greater(B,critical_point(A)) | selection_favors(efficient_producers,first_movers,B) # label(l8) # label(hypothesis). [clausify(9)].
% 0.63/0.95 22 -environment(A) | -greater(B,start_time(A)) | greater(B,end_time(A)) | greater_or_equal(end_time(A),B) # label(mp_beginning_and_ending) # label(axiom). [clausify(8)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | greater_or_equal(critical_point(f1(c1)),start_time(f1(c1))). [resolve(17,c,18,a)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | greater_or_equal(end_time(f1(c1)),A). [resolve(17,c,19,a)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater_or_equal(A,start_time(f1(c1))) | -greater_or_equal(end_time(f1(c1)),A) | in_environment(f1(c1),A). [resolve(17,c,20,a)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater(A,critical_point(f1(c1))) | selection_favors(efficient_producers,first_movers,A). [resolve(17,c,21,a)].
% 0.63/0.95 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater(A,start_time(f1(c1))) | greater(A,end_time(f1(c1))) | greater_or_equal(end_time(f1(c1)),A). [resolve(17,c,22,a)].
% 0.63/0.95 23 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | in_environment(A,f2(c1,A)). [resolve(14,a,12,a)].
% 0.63/0.95 Derived: -slow_change(c1) | -in_environment(c1,f1(c1)) | in_environment(f1(c1),f2(c1,f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(23,b,17,c)].
% 0.63/0.95 24 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | greater(f2(c1,A),critical_point(A)). [resolve(15,a,12,a)].
% 0.63/0.95 Derived: -slow_change(c1) | -in_environment(c1,f1(c1)) | greater(f2(c1,f1(c1)),critical_point(f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(24,b,17,c)].
% 0.63/0.95
% 0.63/0.95 ============================== end predicate elimination =============
% 0.63/0.95
% 0.63/0.95 Auto_denials: (non-Horn, no changes).
% 0.63/0.95
% 0.63/0.95 Term ordering decisions:
% 0.63/0.95 Function symbol KB weights: efficient_producers=1. first_movers=1. c1=1. f2=1. end_time=1. critical_point=1. start_time=1. f1=1.
% 0.63/0.95
% 0.63/0.95 ============================== end of process initial clauses ========
% 0.63/0.95
% 0.63/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.63/0.95
% 0.63/0.95 ============================== end of clauses for search =============
% 0.63/0.95
% 0.63/0.95 ============================== SEARCH ================================
% 0.63/0.95
% 0.63/0.95 % Starting search at 0.01 seconds.
% 0.63/0.95
% 0.63/0.95 ============================== PROOF =================================
% 0.63/0.95 % SZS status Theorem
% 0.63/0.95 % SZS output start Refutation
% 0.63/0.95
% 0.63/0.95 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.63/0.95 % Length of proof is 67.
% 0.63/0.95 % Level of proof is 18.
% 0.63/0.95 % Maximum clause weight is 22.000.
% 0.63/0.95 % Given clauses 57.
% 0.63/0.95
% 0.63/0.95 1 (all P (observational_period(P) & propagation_strategy(first_movers) & propagation_strategy(efficient_producers) & (all E (environment(E) & in_environment(P,E) -> selection_favors(efficient_producers,first_movers,end_time(E)))) -> selection_favors(efficient_producers,first_movers,P))) # label(mp3_favoured_trategy) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 2 (all P (observational_period(P) & slow_change(P) -> (all E (environment(E) & in_environment(P,E) -> (exists T (in_environment(E,T) & greater(T,critical_point(E)))))))) # label(mp4_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 3 (all E all T (environment(E) & greater_or_equal(T,start_time(E)) & greater_or_equal(end_time(E),T) -> in_environment(E,T))) # label(mp_time_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 4 (all E all T (environment(E) & in_environment(E,T) -> greater_or_equal(end_time(E),T))) # label(mp_environment_end_point) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 5 (all E (environment(E) -> greater_or_equal(critical_point(E),start_time(E)))) # label(mp_time_of_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 6 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.63/0.95 7 (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.63/0.95 9 (all E all T (environment(E) & in_environment(E,T) & greater(T,critical_point(E)) -> selection_favors(efficient_producers,first_movers,T))) # label(l8) # label(hypothesis) # label(non_clause). [assumption].
% 0.63/0.95 10 -(all P (observational_period(P) & slow_change(P) -> selection_favors(efficient_producers,first_movers,P))) # label(prove_t8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.63/0.95 11 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(1)].
% 0.63/0.95 12 observational_period(c1) # label(prove_t8) # label(negated_conjecture). [clausify(10)].
% 0.63/0.95 13 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(1)].
% 0.63/0.95 14 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,f2(A,B)) # label(mp4_critical_point) # label(axiom). [clausify(2)].
% 0.63/0.95 15 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(f2(A,B),critical_point(B)) # label(mp4_critical_point) # label(axiom). [clausify(2)].
% 0.63/0.95 16 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(1)].
% 0.63/0.95 17 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(11,a,12,a)].
% 0.63/0.95 18 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point) # label(axiom). [clausify(5)].
% 0.63/0.95 19 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point) # label(axiom). [clausify(4)].
% 0.63/0.95 20 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater_or_equal(end_time(A),B) | in_environment(A,B) # label(mp_time_in_environment) # label(axiom). [clausify(3)].
% 0.63/0.95 21 -environment(A) | -in_environment(A,B) | -greater(B,critical_point(A)) | selection_favors(efficient_producers,first_movers,B) # label(l8) # label(hypothesis). [clausify(9)].
% 0.63/0.95 23 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | in_environment(A,f2(c1,A)). [resolve(14,a,12,a)].
% 0.63/0.95 24 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | greater(f2(c1,A),critical_point(A)). [resolve(15,a,12,a)].
% 0.63/0.95 25 propagation_strategy(first_movers) # label(mp_organizational_sets1) # label(axiom). [assumption].
% 0.63/0.95 26 propagation_strategy(efficient_producers) # label(mp_organizational_sets2) # label(axiom). [assumption].
% 0.63/0.95 27 slow_change(c1) # label(prove_t8) # label(negated_conjecture). [clausify(10)].
% 0.63/0.95 28 -selection_favors(efficient_producers,first_movers,c1) # label(prove_t8) # label(negated_conjecture). [clausify(10)].
% 0.63/0.95 29 greater_or_equal(A,B) | -greater(A,B) # label(mp_greater_or_equal) # label(axiom). [clausify(7)].
% 0.63/0.95 30 greater_or_equal(A,B) | B != A # label(mp_greater_or_equal) # label(axiom). [clausify(7)].
% 0.63/0.95 31 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp_greater_transitivity) # label(axiom). [clausify(6)].
% 0.63/0.95 32 -greater_or_equal(A,B) | greater(A,B) | B = A # label(mp_greater_or_equal) # label(axiom). [clausify(7)].
% 0.63/0.95 33 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(c1,f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(13,a,12,a)].
% 0.63/0.95 34 in_environment(c1,f1(c1)). [copy(33),unit_del(a,25),unit_del(b,26),unit_del(d,28)].
% 0.63/0.95 35 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(c1))) | selection_favors(efficient_producers,first_movers,c1). [resolve(16,a,12,a)].
% 0.63/0.95 36 -selection_favors(efficient_producers,first_movers,end_time(f1(c1))). [copy(35),unit_del(a,25),unit_del(b,26),unit_del(d,28)].
% 0.63/0.95 37 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | greater_or_equal(critical_point(f1(c1)),start_time(f1(c1))). [resolve(17,c,18,a)].
% 0.63/0.95 38 greater_or_equal(critical_point(f1(c1)),start_time(f1(c1))). [copy(37),unit_del(a,25),unit_del(b,26),unit_del(c,28)].
% 0.63/0.96 39 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | greater_or_equal(end_time(f1(c1)),A). [resolve(17,c,19,a)].
% 0.63/0.96 40 -in_environment(f1(c1),A) | greater_or_equal(end_time(f1(c1)),A). [copy(39),unit_del(a,25),unit_del(b,26),unit_del(c,28)].
% 0.63/0.96 41 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater_or_equal(A,start_time(f1(c1))) | -greater_or_equal(end_time(f1(c1)),A) | in_environment(f1(c1),A). [resolve(17,c,20,a)].
% 0.63/0.96 42 -greater_or_equal(A,start_time(f1(c1))) | -greater_or_equal(end_time(f1(c1)),A) | in_environment(f1(c1),A). [copy(41),unit_del(a,25),unit_del(b,26),unit_del(c,28)].
% 0.63/0.96 43 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater(A,critical_point(f1(c1))) | selection_favors(efficient_producers,first_movers,A). [resolve(17,c,21,a)].
% 0.63/0.96 44 -in_environment(f1(c1),A) | -greater(A,critical_point(f1(c1))) | selection_favors(efficient_producers,first_movers,A). [copy(43),unit_del(a,25),unit_del(b,26),unit_del(c,28)].
% 0.63/0.96 47 -slow_change(c1) | -in_environment(c1,f1(c1)) | in_environment(f1(c1),f2(c1,f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(23,b,17,c)].
% 0.63/0.96 48 in_environment(f1(c1),f2(c1,f1(c1))). [copy(47),unit_del(a,27),unit_del(b,34),unit_del(d,25),unit_del(e,26),unit_del(f,28)].
% 0.63/0.96 49 -slow_change(c1) | -in_environment(c1,f1(c1)) | greater(f2(c1,f1(c1)),critical_point(f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(24,b,17,c)].
% 0.63/0.96 50 greater(f2(c1,f1(c1)),critical_point(f1(c1))). [copy(49),unit_del(a,27),unit_del(b,34),unit_del(d,25),unit_del(e,26),unit_del(f,28)].
% 0.63/0.96 51 greater_or_equal(A,A). [xx_res(30,b)].
% 0.63/0.96 52 greater(critical_point(f1(c1)),start_time(f1(c1))) | start_time(f1(c1)) = critical_point(f1(c1)). [resolve(38,a,32,a)].
% 0.63/0.96 54 selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(48,a,44,a),unit_del(a,50)].
% 0.63/0.96 55 greater_or_equal(end_time(f1(c1)),f2(c1,f1(c1))). [resolve(48,a,40,a)].
% 0.63/0.96 56 -greater(A,f2(c1,f1(c1))) | greater(A,critical_point(f1(c1))). [resolve(50,a,31,b)].
% 0.63/0.96 59 -greater_or_equal(end_time(f1(c1)),start_time(f1(c1))) | in_environment(f1(c1),end_time(f1(c1))). [resolve(51,a,42,b)].
% 0.63/0.96 61 greater(end_time(f1(c1)),f2(c1,f1(c1))) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(55,a,32,a)].
% 0.63/0.96 63 start_time(f1(c1)) = critical_point(f1(c1)) | -greater(A,critical_point(f1(c1))) | greater(A,start_time(f1(c1))). [resolve(52,a,31,b)].
% 0.63/0.96 66 f2(c1,f1(c1)) = end_time(f1(c1)) | greater(end_time(f1(c1)),critical_point(f1(c1))). [resolve(61,a,56,a)].
% 0.63/0.96 74 f2(c1,f1(c1)) = end_time(f1(c1)) | greater_or_equal(end_time(f1(c1)),critical_point(f1(c1))). [resolve(66,b,29,b)].
% 0.63/0.96 79 start_time(f1(c1)) = critical_point(f1(c1)) | greater(end_time(f1(c1)),start_time(f1(c1))) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(63,b,66,b)].
% 0.63/0.96 83 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | greater_or_equal(end_time(f1(c1)),start_time(f1(c1))). [resolve(79,b,29,b)].
% 0.63/0.96 85 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | in_environment(f1(c1),end_time(f1(c1))). [resolve(83,c,59,a)].
% 0.63/0.96 91 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(end_time(f1(c1)),critical_point(f1(c1))). [resolve(85,c,44,a),unit_del(d,36)].
% 0.63/0.96 92 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(91,c,66,b),merge(c)].
% 0.63/0.96 96 start_time(f1(c1)) = critical_point(f1(c1)). [para(92(b,1),54(a,3)),unit_del(b,36)].
% 0.63/0.96 97 -greater_or_equal(end_time(f1(c1)),critical_point(f1(c1))) | in_environment(f1(c1),end_time(f1(c1))). [back_rewrite(59),rewrite([96(6)])].
% 0.63/0.96 100 in_environment(f1(c1),end_time(f1(c1))) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(97,a,74,b)].
% 0.63/0.96 101 f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(end_time(f1(c1)),critical_point(f1(c1))). [resolve(100,a,44,a),unit_del(c,36)].
% 0.63/0.96 102 f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(101,b,66,b),merge(b)].
% 0.63/0.96 106 $F. [back_rewrite(54),rewrite([102(6)]),unit_del(a,36)].
% 0.63/0.96
% 0.63/0.96 % SZS output end Refutation
% 0.63/0.96 ============================== end of proof ==========================
% 0.63/0.96
% 0.63/0.96 ============================== STATISTICS ============================
% 0.63/0.96
% 0.63/0.96 Given=57. Generated=126. Kept=72. proofs=1.
% 0.63/0.96 Usable=20. Sos=0. Demods=2. Limbo=4, Disabled=79. Hints=0.
% 0.63/0.96 Megabytes=0.13.
% 0.63/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.63/0.96
% 0.63/0.96 ============================== end of statistics =====================
% 0.63/0.96
% 0.63/0.96 ============================== end of search =========================
% 0.63/0.96
% 0.63/0.96 THEOREM PROVED
% 0.63/0.96 % SZS status Theorem
% 0.63/0.96
% 0.63/0.96 Exiting with 1 proof.
% 0.63/0.96
% 0.63/0.96 Process 947 exit (max_proofs) Thu Jun 9 08:05:07 2022
% 0.63/0.96 Prover9 interrupted
%------------------------------------------------------------------------------