%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n028.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:00 EDT 2022

% Result   : Unsatisfiable 0.43s 1.02s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n028.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:01:47 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.43/1.01  ============================== Prover9 ===============================
% 0.43/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01  Process 4941 was started by sandbox on n028.cluster.edu,
% 0.43/1.01  Thu Jun  9 10:01:48 2022
% 0.43/1.01  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4608_n028.cluster.edu".
% 0.43/1.01  ============================== end of head ===========================
% 0.43/1.01  
% 0.43/1.01  ============================== INPUT =================================
% 0.43/1.01  
% 0.43/1.01  % Reading from file /tmp/Prover9_4608_n028.cluster.edu
% 0.43/1.01  
% 0.43/1.01  set(prolog_style_variables).
% 0.43/1.01  set(auto2).
% 0.43/1.01      % set(auto2) -> set(auto).
% 0.43/1.01      % set(auto) -> set(auto_inference).
% 0.43/1.01      % set(auto) -> set(auto_setup).
% 0.43/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01      % set(auto) -> set(auto_limits).
% 0.43/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01      % set(auto) -> set(auto_denials).
% 0.43/1.01      % set(auto) -> set(auto_process).
% 0.43/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01      % set(auto2) -> assign(stats, some).
% 0.43/1.01      % set(auto2) -> clear(echo_input).
% 0.43/1.01      % set(auto2) -> set(quiet).
% 0.43/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01      % set(auto2) -> clear(print_given).
% 0.43/1.01  assign(lrs_ticks,-1).
% 0.43/1.01  assign(sos_limit,10000).
% 0.43/1.01  assign(order,kbo).
% 0.43/1.01  set(lex_order_vars).
% 0.43/1.01  clear(print_given).
% 0.43/1.01  
% 0.43/1.01  % formulas(sos).  % not echoed (19 formulas)
% 0.43/1.01  
% 0.43/1.01  ============================== end of input ==========================
% 0.43/1.01  
% 0.43/1.01  % From the command line: assign(max_seconds, 300).
% 0.43/1.01  
% 0.43/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01  
% 0.43/1.01  % Formulas that are not ordinary clauses:
% 0.43/1.01  
% 0.43/1.01  ============================== end of process non-clausal formulas ===
% 0.43/1.01  
% 0.43/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01  
% 0.43/1.01  ============================== PREDICATE ELIMINATION =================
% 0.43/1.01  1 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_20) # label(axiom).  [assumption].
% 0.43/1.01  2 observational_period(sk3) # label(prove_t8_36) # label(negated_conjecture).  [assumption].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(1,a,2,a)].
% 0.43/1.01  3 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_21) # label(axiom).  [assumption].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(sk3,sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(3,a,2,a)].
% 0.43/1.01  4 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,sk2(B,A)) # label(mp4_critical_point_23) # label(axiom).  [assumption].
% 0.43/1.01  Derived: -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | in_environment(A,sk2(A,sk3)).  [resolve(4,a,2,a)].
% 0.43/1.01  5 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(sk2(B,A),critical_point(B)) # label(mp4_critical_point_24) # label(axiom).  [assumption].
% 0.43/1.01  Derived: -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | greater(sk2(A,sk3),critical_point(A)).  [resolve(5,a,2,a)].
% 0.43/1.01  6 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_22) # label(axiom).  [assumption].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(6,a,2,a)].
% 0.43/1.01  7 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(1,a,2,a)].
% 0.43/1.01  8 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point_29) # label(axiom).  [assumption].
% 0.43/1.01  9 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point_28) # label(axiom).  [assumption].
% 0.43/1.01  10 -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_27) # label(axiom).  [assumption].
% 0.43/1.01  11 -environment(A) | -in_environment(A,B) | -greater(B,critical_point(A)) | selection_favors(efficient_producers,first_movers,B) # label(l8_35) # label(hypothesis).  [assumption].
% 0.43/1.01  12 -environment(A) | -greater(B,start_time(A)) | greater(B,end_time(A)) | greater_or_equal(end_time(A),B) # label(mp_beginning_and_ending_34) # label(axiom).  [assumption].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))).  [resolve(7,c,8,a)].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | greater_or_equal(end_time(sk1(sk3)),A).  [resolve(7,c,9,a)].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -greater_or_equal(A,start_time(sk1(sk3))) | -greater_or_equal(end_time(sk1(sk3)),A) | in_environment(sk1(sk3),A).  [resolve(7,c,10,a)].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | -greater(A,critical_point(sk1(sk3))) | selection_favors(efficient_producers,first_movers,A).  [resolve(7,c,11,a)].
% 0.43/1.01  Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -greater(A,start_time(sk1(sk3))) | greater(A,end_time(sk1(sk3))) | greater_or_equal(end_time(sk1(sk3)),A).  [resolve(7,c,12,a)].
% 0.43/1.01  13 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | in_environment(A,sk2(A,sk3)).  [resolve(4,a,2,a)].
% 0.43/1.01  Derived: -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | in_environment(sk1(sk3),sk2(sk1(sk3),sk3)) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(13,b,7,c)].
% 0.43/1.01  14 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | greater(sk2(A,sk3),critical_point(A)).  [resolve(5,a,2,a)].
% 0.43/1.01  Derived: -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(14,b,7,c)].
% 0.43/1.01  
% 0.43/1.01  ============================== end predicate elimination =============
% 0.43/1.01  
% 0.43/1.01  Auto_denials:  (non-Horn, no changes).
% 0.43/1.01  
% 0.43/1.01  Term ordering decisions:
% 0.43/1.01  Function symbol KB weights:  sk3=1. efficient_producers=1. first_movers=1. sk2=1. sk1=1. end_time=1. critical_point=1. start_time=1.
% 0.43/1.01  
% 0.43/1.01  ============================== end of process initial clauses ========
% 0.43/1.01  
% 0.43/1.01  ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.01  
% 0.43/1.01  ============================== end of clauses for search =============
% 0.43/1.01  
% 0.43/1.01  ============================== SEARCH ================================
% 0.43/1.01  
% 0.43/1.01  % Starting search at 0.01 seconds.
% 0.43/1.02  
% 0.43/1.02  ============================== PROOF =================================
% 0.43/1.02  % SZS status Unsatisfiable
% 0.43/1.02  % SZS output start Refutation
% 0.43/1.02  
% 0.43/1.02  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.02  % Length of proof is 58.
% 0.43/1.02  % Level of proof is 17.
% 0.43/1.02  % Maximum clause weight is 22.000.
% 0.43/1.02  % Given clauses 57.
% 0.43/1.02  
% 0.43/1.02  1 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_20) # label(axiom).  [assumption].
% 0.43/1.02  2 observational_period(sk3) # label(prove_t8_36) # label(negated_conjecture).  [assumption].
% 0.43/1.02  3 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_21) # label(axiom).  [assumption].
% 0.43/1.02  4 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,sk2(B,A)) # label(mp4_critical_point_23) # label(axiom).  [assumption].
% 0.43/1.02  5 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(sk2(B,A),critical_point(B)) # label(mp4_critical_point_24) # label(axiom).  [assumption].
% 0.43/1.02  6 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_22) # label(axiom).  [assumption].
% 0.43/1.02  7 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(1,a,2,a)].
% 0.43/1.02  8 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point_29) # label(axiom).  [assumption].
% 0.43/1.02  9 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point_28) # label(axiom).  [assumption].
% 0.43/1.02  10 -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_27) # label(axiom).  [assumption].
% 0.43/1.02  11 -environment(A) | -in_environment(A,B) | -greater(B,critical_point(A)) | selection_favors(efficient_producers,first_movers,B) # label(l8_35) # label(hypothesis).  [assumption].
% 0.43/1.02  13 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | in_environment(A,sk2(A,sk3)).  [resolve(4,a,2,a)].
% 0.43/1.02  14 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | greater(sk2(A,sk3),critical_point(A)).  [resolve(5,a,2,a)].
% 0.43/1.02  15 propagation_strategy(first_movers) # label(mp_organizational_sets1_25) # label(axiom).  [assumption].
% 0.43/1.02  16 propagation_strategy(efficient_producers) # label(mp_organizational_sets2_26) # label(axiom).  [assumption].
% 0.43/1.02  17 slow_change(sk3) # label(prove_t8_37) # label(negated_conjecture).  [assumption].
% 0.43/1.02  18 -selection_favors(efficient_producers,first_movers,sk3) # label(prove_t8_38) # label(negated_conjecture).  [assumption].
% 0.43/1.02  19 -greater(A,B) | greater_or_equal(A,B) # label(mp_greater_or_equal_32) # label(axiom).  [assumption].
% 0.43/1.02  20 A != B | greater_or_equal(A,B) # label(mp_greater_or_equal_33) # label(axiom).  [assumption].
% 0.43/1.02  21 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp_greater_transitivity_30) # label(axiom).  [assumption].
% 0.43/1.02  22 -greater_or_equal(A,B) | greater(A,B) | A = B # label(mp_greater_or_equal_31) # label(axiom).  [assumption].
% 0.43/1.02  23 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(sk3,sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(3,a,2,a)].
% 0.43/1.02  24 in_environment(sk3,sk1(sk3)).  [copy(23),unit_del(a,15),unit_del(b,16),unit_del(d,18)].
% 0.43/1.02  25 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(6,a,2,a)].
% 0.43/1.02  26 -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))).  [copy(25),unit_del(a,15),unit_del(b,16),unit_del(d,18)].
% 0.43/1.02  27 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))).  [resolve(7,c,8,a)].
% 0.43/1.02  28 greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))).  [copy(27),unit_del(a,15),unit_del(b,16),unit_del(c,18)].
% 0.43/1.02  29 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | greater_or_equal(end_time(sk1(sk3)),A).  [resolve(7,c,9,a)].
% 0.43/1.02  30 -in_environment(sk1(sk3),A) | greater_or_equal(end_time(sk1(sk3)),A).  [copy(29),unit_del(a,15),unit_del(b,16),unit_del(c,18)].
% 0.43/1.02  31 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -greater_or_equal(A,start_time(sk1(sk3))) | -greater_or_equal(end_time(sk1(sk3)),A) | in_environment(sk1(sk3),A).  [resolve(7,c,10,a)].
% 0.43/1.02  32 -greater_or_equal(A,start_time(sk1(sk3))) | -greater_or_equal(end_time(sk1(sk3)),A) | in_environment(sk1(sk3),A).  [copy(31),unit_del(a,15),unit_del(b,16),unit_del(c,18)].
% 0.43/1.02  33 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | -greater(A,critical_point(sk1(sk3))) | selection_favors(efficient_producers,first_movers,A).  [resolve(7,c,11,a)].
% 0.43/1.02  34 -in_environment(sk1(sk3),A) | -greater(A,critical_point(sk1(sk3))) | selection_favors(efficient_producers,first_movers,A).  [copy(33),unit_del(a,15),unit_del(b,16),unit_del(c,18)].
% 0.43/1.02  37 -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | in_environment(sk1(sk3),sk2(sk1(sk3),sk3)) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(13,b,7,c)].
% 0.43/1.02  38 in_environment(sk1(sk3),sk2(sk1(sk3),sk3)).  [copy(37),unit_del(a,17),unit_del(b,24),unit_del(d,15),unit_del(e,16),unit_del(f,18)].
% 0.43/1.02  39 -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3).  [resolve(14,b,7,c)].
% 0.43/1.02  40 greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))).  [copy(39),unit_del(a,17),unit_del(b,24),unit_del(d,15),unit_del(e,16),unit_del(f,18)].
% 0.43/1.02  41 greater_or_equal(A,A).  [xx_res(20,a)].
% 0.43/1.02  42 greater(critical_point(sk1(sk3)),start_time(sk1(sk3))) | start_time(sk1(sk3)) = critical_point(sk1(sk3)).  [resolve(28,a,22,a),flip(b)].
% 0.43/1.02  44 selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)).  [resolve(38,a,34,a),unit_del(a,40)].
% 0.43/1.02  45 greater_or_equal(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)).  [resolve(38,a,30,a)].
% 0.43/1.02  46 -greater(A,sk2(sk1(sk3),sk3)) | greater(A,critical_point(sk1(sk3))).  [resolve(40,a,21,b)].
% 0.43/1.02  49 -greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))) | in_environment(sk1(sk3),end_time(sk1(sk3))).  [resolve(41,a,32,b)].
% 0.43/1.02  51 greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)).  [resolve(45,a,22,a),flip(b)].
% 0.43/1.02  53 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | -greater(A,critical_point(sk1(sk3))) | greater(A,start_time(sk1(sk3))).  [resolve(42,a,21,b)].
% 0.43/1.02  56 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(end_time(sk1(sk3)),critical_point(sk1(sk3))).  [resolve(51,a,46,a)].
% 0.43/1.02  64 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))).  [resolve(56,b,19,a)].
% 0.43/1.02  69 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | greater(end_time(sk1(sk3)),start_time(sk1(sk3))) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)).  [resolve(53,b,56,b)].
% 0.43/1.02  73 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))).  [resolve(69,b,19,a)].
% 0.43/1.02  75 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | in_environment(sk1(sk3),end_time(sk1(sk3))).  [resolve(73,c,49,a)].
% 0.43/1.02  81 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(end_time(sk1(sk3)),critical_point(sk1(sk3))).  [resolve(75,c,34,a),unit_del(d,26)].
% 0.43/1.02  82 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)).  [resolve(81,c,56,b),merge(c)].
% 0.43/1.02  86 start_time(sk1(sk3)) = critical_point(sk1(sk3)).  [para(82(b,1),44(a,3)),unit_del(b,26)].
% 0.43/1.02  87 -greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))) | in_environment(sk1(sk3),end_time(sk1(sk3))).  [back_rewrite(49),rewrite([86(6)])].
% 0.43/1.02  90 in_environment(sk1(sk3),end_time(sk1(sk3))) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)).  [resolve(87,a,64,b)].
% 0.43/1.02  91 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(end_time(sk1(sk3)),critical_point(sk1(sk3))).  [resolve(90,a,34,a),unit_del(c,26)].
% 0.43/1.02  92 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)).  [resolve(91,b,56,b),merge(b)].
% 0.43/1.02  96 $F.  [back_rewrite(44),rewrite([92(6)]),unit_del(a,26)].
% 0.43/1.02  
% 0.43/1.02  % SZS output end Refutation
% 0.43/1.02  ============================== end of proof ==========================
% 0.43/1.02  
% 0.43/1.02  ============================== STATISTICS ============================
% 0.43/1.02  
% 0.43/1.02  Given=57. Generated=126. Kept=72. proofs=1.
% 0.43/1.02  Usable=20. Sos=0. Demods=2. Limbo=4, Disabled=79. Hints=0.
% 0.43/1.02  Megabytes=0.11.
% 0.43/1.02  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.02  
% 0.43/1.02  ============================== end of statistics =====================
% 0.43/1.02  
% 0.43/1.02  ============================== end of search =========================
% 0.43/1.02  
% 0.43/1.02  THEOREM PROVED
% 0.43/1.02  % SZS status Unsatisfiable
% 0.43/1.02  
% 0.43/1.02  Exiting with 1 proof.
% 0.43/1.02  
% 0.43/1.02  Process 4941 exit (max_proofs) Thu Jun  9 10:01:48 2022
% 0.43/1.02  Prover9 interrupted
%------------------------------------------------------------------------------