%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT039+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:26:51 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 14 unt; 0 def)
% Number of atoms : 248 ( 30 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 280 ( 109 ~; 137 |; 22 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 33 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp3_favoured_trategy,axiom,
! [X1] :
( ( ! [X2] :
( ( in_environment(X1,X2)
& environment(X2) )
=> selection_favors(efficient_producers,first_movers,end_time(X2)) )
& propagation_strategy(efficient_producers)
& propagation_strategy(first_movers)
& observational_period(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3_favoured_trategy) ).
fof(prove_t8,conjecture,
! [X1] :
( ( slow_change(X1)
& observational_period(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t8) ).
fof(mp_greater_or_equal,axiom,
! [X4,X5] :
( greater_or_equal(X4,X5)
<=> ( X4 = X5
| greater(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(mp_time_of_critical_point,axiom,
! [X2] :
( environment(X2)
=> greater_or_equal(critical_point(X2),start_time(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_of_critical_point) ).
fof(mp_organizational_sets1,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_organizational_sets1) ).
fof(mp_organizational_sets2,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_organizational_sets2) ).
fof(mp_greater_transitivity,axiom,
! [X4,X5,X6] :
( ( greater(X5,X6)
& greater(X4,X5) )
=> greater(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity) ).
fof(mp_environment_end_point,axiom,
! [X2,X3] :
( ( in_environment(X2,X3)
& environment(X2) )
=> greater_or_equal(end_time(X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_environment_end_point) ).
fof(mp4_critical_point,axiom,
! [X1] :
( ( slow_change(X1)
& observational_period(X1) )
=> ! [X2] :
( ( in_environment(X1,X2)
& environment(X2) )
=> ? [X3] :
( greater(X3,critical_point(X2))
& in_environment(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_critical_point) ).
fof(mp_time_in_environment,axiom,
! [X2,X3] :
( ( greater_or_equal(end_time(X2),X3)
& greater_or_equal(X3,start_time(X2))
& environment(X2) )
=> in_environment(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_in_environment) ).
fof(l8,hypothesis,
! [X2,X3] :
( ( greater(X3,critical_point(X2))
& in_environment(X2,X3)
& environment(X2) )
=> selection_favors(efficient_producers,first_movers,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8) ).
fof(c_0_11,plain,
! [X7] :
( ( selection_favors(efficient_producers,first_movers,X7)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X7)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X7))) )
& ( selection_favors(efficient_producers,first_movers,X7)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X7)
| in_environment(X7,esk1_1(X7)) )
& ( selection_favors(efficient_producers,first_movers,X7)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X7)
| environment(esk1_1(X7)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3_favoured_trategy])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( slow_change(X1)
& observational_period(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
inference(assume_negation,[status(cth)],[prove_t8]) ).
fof(c_0_13,plain,
! [X20,X21] :
( ( greater_or_equal(X20,X21)
| X20 != X21 )
& ( greater_or_equal(X20,X21)
| ~ greater(X20,X21) )
& ( X20 = X21
| greater(X20,X21)
| ~ greater_or_equal(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])])]) ).
fof(c_0_14,plain,
! [X16] :
( greater_or_equal(critical_point(X16),start_time(X16))
| ~ environment(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_of_critical_point])])]) ).
cnf(c_0_15,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| environment(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
propagation_strategy(first_movers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets1]) ).
cnf(c_0_17,plain,
propagation_strategy(efficient_producers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets2]) ).
fof(c_0_18,negated_conjecture,
( ~ selection_favors(efficient_producers,first_movers,esk3_0)
& slow_change(esk3_0)
& observational_period(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_19,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),start_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ observational_period(X1)
| environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
observational_period(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X17,X18,X19] :
( greater(X17,X19)
| ~ greater(X18,X19)
| ~ greater(X17,X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])])]) ).
cnf(c_0_25,plain,
( ~ environment(X1)
| greater(critical_point(X1),start_time(X1))
| start_time(X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
environment(esk1_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
fof(c_0_27,plain,
! [X14,X15] :
( greater_or_equal(end_time(X14),X15)
| ~ in_environment(X14,X15)
| ~ environment(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_end_point])])]) ).
cnf(c_0_28,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( greater(critical_point(esk1_1(esk3_0)),start_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_30,plain,
! [X9,X10] :
( ( ~ slow_change(X9)
| ~ observational_period(X9)
| ~ in_environment(X9,X10)
| ~ environment(X10)
| greater(esk2_2(X9,X10),critical_point(X10)) )
& ( ~ slow_change(X9)
| ~ observational_period(X9)
| ~ in_environment(X9,X10)
| ~ environment(X10)
| in_environment(X10,esk2_2(X9,X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4_critical_point])])])])])]) ).
cnf(c_0_31,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(end_time(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ greater(X1,critical_point(esk1_1(esk3_0)))
| greater(X1,start_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ~ slow_change(X1)
| ~ observational_period(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| greater(esk2_2(X1,X2),critical_point(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( ~ observational_period(X1)
| in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_16]),c_0_17])]) ).
cnf(c_0_36,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| greater(end_time(X1),X2)
| end_time(X1) = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_37,plain,
( ~ slow_change(X2)
| ~ observational_period(X2)
| ~ in_environment(X2,X1)
| ~ environment(X1)
| in_environment(X1,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_38,plain,
! [X12,X13] :
( in_environment(X12,X13)
| ~ greater_or_equal(end_time(X12),X13)
| ~ greater_or_equal(X13,start_time(X12))
| ~ environment(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_in_environment])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ observational_period(X1)
| ~ in_environment(X1,esk1_1(esk3_0))
| ~ slow_change(X1)
| greater(esk2_2(X1,esk1_1(esk3_0)),start_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
in_environment(esk3_0,esk1_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_22]),c_0_23]) ).
cnf(c_0_41,negated_conjecture,
slow_change(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_42,plain,
( ~ observational_period(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ slow_change(X1)
| greater(end_time(X2),esk2_2(X1,X2))
| esk2_2(X1,X2) = end_time(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( ~ greater_or_equal(end_time(X1),X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,negated_conjecture,
( greater(esk2_2(esk3_0,esk1_1(esk3_0)),start_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_22])]) ).
fof(c_0_47,hypothesis,
! [X24,X25] :
( selection_favors(efficient_producers,first_movers,X25)
| ~ greater(X25,critical_point(X24))
| ~ in_environment(X24,X25)
| ~ environment(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l8])])]) ).
cnf(c_0_48,plain,
( ~ observational_period(X3)
| ~ environment(X2)
| ~ in_environment(X3,X2)
| ~ slow_change(X3)
| ~ greater(X1,esk2_2(X3,X2))
| greater(X1,critical_point(X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_49,negated_conjecture,
( greater(end_time(esk1_1(esk3_0)),esk2_2(esk3_0,esk1_1(esk3_0)))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_41]),c_0_26]),c_0_22])]) ).
cnf(c_0_50,plain,
( ~ environment(X1)
| ~ greater(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),X2)
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ greater(X1,esk2_2(esk3_0,esk1_1(esk3_0)))
| greater(X1,start_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_46]) ).
cnf(c_0_53,hypothesis,
( ~ greater(X2,critical_point(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| selection_favors(efficient_producers,first_movers,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( greater(end_time(esk1_1(esk3_0)),critical_point(esk1_1(esk3_0)))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_41]),c_0_40]),c_0_26]),c_0_22])]) ).
cnf(c_0_55,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),start_time(X1))
| in_environment(X1,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( greater(end_time(esk1_1(esk3_0)),start_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_52,c_0_49]) ).
cnf(c_0_57,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_58,hypothesis,
( ~ in_environment(esk1_1(esk3_0),end_time(esk1_1(esk3_0)))
| selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk3_0)))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_26])]) ).
cnf(c_0_59,negated_conjecture,
( in_environment(esk1_1(esk3_0),end_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_26])]) ).
cnf(c_0_60,plain,
( ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_16]),c_0_17])]) ).
cnf(c_0_61,hypothesis,
( selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,hypothesis,
( ~ observational_period(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,esk2_2(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_34]),c_0_37]) ).
cnf(c_0_63,hypothesis,
( start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_22])]),c_0_23]) ).
cnf(c_0_64,plain,
( ~ environment(X2)
| ~ environment(X1)
| ~ in_environment(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),end_time(X2))
| in_environment(X1,end_time(X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_65,hypothesis,
( selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk3_0)))
| start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_41]),c_0_40]),c_0_26]),c_0_22])]) ).
cnf(c_0_66,plain,
( ~ environment(X1)
| ~ greater_or_equal(end_time(X1),critical_point(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_67,plain,
( ~ environment(X1)
| ~ in_environment(X1,start_time(X1))
| in_environment(X1,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_51]) ).
cnf(c_0_68,hypothesis,
start_time(esk1_1(esk3_0)) = critical_point(esk1_1(esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_65]),c_0_22])]),c_0_23]) ).
cnf(c_0_69,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),critical_point(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_44]) ).
cnf(c_0_70,hypothesis,
( ~ in_environment(esk1_1(esk3_0),critical_point(esk1_1(esk3_0)))
| in_environment(esk1_1(esk3_0),end_time(esk1_1(esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_26])]) ).
cnf(c_0_71,negated_conjecture,
( in_environment(esk1_1(esk3_0),critical_point(esk1_1(esk3_0)))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_54]),c_0_26])]) ).
cnf(c_0_72,negated_conjecture,
( in_environment(esk1_1(esk3_0),end_time(esk1_1(esk3_0)))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,hypothesis,
( selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk3_0)))
| esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_58,c_0_72]) ).
cnf(c_0_74,hypothesis,
esk2_2(esk3_0,esk1_1(esk3_0)) = end_time(esk1_1(esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_73]),c_0_22])]),c_0_23]) ).
cnf(c_0_75,hypothesis,
selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk3_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_74]),c_0_41]),c_0_40]),c_0_26]),c_0_22])]) ).
cnf(c_0_76,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_75]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT039+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:20:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4056965 completed with status 0
% 0.10/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGUSF-FFSS21-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4056970 completed with status 0
% 0.10/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGUSF-FFSS21-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43 % Presaturation interreduction done
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 12
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 19
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 19
% 0.10/0.44 % Processed clauses : 92
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 2
% 0.10/0.44 % ...remaining for further processing : 90
% 0.10/0.44 % Other redundant clauses eliminated : 1
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 5
% 0.10/0.44 % Backward-rewritten : 20
% 0.10/0.44 % Generated clauses : 100
% 0.10/0.44 % ...of the previous two non-redundant : 90
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 1
% 0.10/0.44 % Paramodulations : 99
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 1
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 111
% 0.10/0.44 % ...of those cached : 101
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 45
% 0.10/0.44 % Positive orientable unit clauses : 10
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 34
% 0.10/0.44 % Current number of unprocessed clauses: 33
% 0.10/0.44 % ...number of literals in the above : 112
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 44
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 588
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 197
% 0.10/0.44 % Non-unit clause-clause subsumptions : 8
% 0.10/0.44 % Unit Clause-clause subsumption calls : 55
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 6
% 0.10/0.44 % BW rewrite match successes : 2
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 4000
% 0.10/0.44 % Search garbage collected termcells : 314
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.012 s
% 0.10/0.44 % System time : 0.004 s
% 0.10/0.44 % Total time : 0.015 s
% 0.10/0.44 % Maximum resident set size: 3644 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.038 s
% 0.10/0.44 % System time : 0.012 s
% 0.10/0.44 % Total time : 0.050 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------