%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT024+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:27:12 PM UTC 2026
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 13 unt; 0 def)
% Number of atoms : 259 ( 39 equ)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 302 ( 101 ~; 139 |; 43 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_l6,conjecture,
! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ( ( greater(zero,growth_rate(first_movers,X2))
& greater(growth_rate(efficient_producers,X2),zero) )
| ( greater(zero,growth_rate(efficient_producers,X2))
& greater(growth_rate(first_movers,X2),zero) )
| ( growth_rate(efficient_producers,X2) = zero
& growth_rate(first_movers,X2) = zero ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6) ).
fof(mp_equilibrium,axiom,
! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& environment(X1) )
=> ~ greater(equilibrium(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_equilibrium) ).
fof(a3,hypothesis,
! [X1,X2] :
( ( greater(number_of_organizations(X1,X2),zero)
& in_environment(X1,X2)
& environment(X1) )
=> ( ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) )
& ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3) ).
fof(mp_positive_number_of_organizations,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_number_of_organizations) ).
fof(mp_time_point_occur,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occur) ).
fof(a6,hypothesis,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) )
& ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a6) ).
fof(l7,hypothesis,
! [X1,X2] :
( ( constant(number_of_organizations(X1,X2))
& subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ( ( greater(zero,growth_rate(first_movers,X2))
& greater(growth_rate(efficient_producers,X2),zero) )
| ( greater(zero,growth_rate(efficient_producers,X2))
& greater(growth_rate(first_movers,X2),zero) )
| ( growth_rate(efficient_producers,X2) = zero
& growth_rate(first_movers,X2) = zero ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ( ( greater(zero,growth_rate(first_movers,X2))
& greater(growth_rate(efficient_producers,X2),zero) )
| ( greater(zero,growth_rate(efficient_producers,X2))
& greater(growth_rate(first_movers,X2),zero) )
| ( growth_rate(efficient_producers,X2) = zero
& growth_rate(first_movers,X2) = zero ) ) ),
inference(assume_negation,[status(cth)],[prove_l6]) ).
fof(c_0_8,plain,
! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& environment(X1) )
=> ~ greater(equilibrium(X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_equilibrium]) ).
fof(c_0_9,hypothesis,
! [X1,X2] :
( ( greater(number_of_organizations(X1,X2),zero)
& in_environment(X1,X2)
& environment(X1) )
=> ( ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) )
& ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a3]) ).
fof(c_0_10,plain,
! [X5,X6] :
( greater(number_of_organizations(X5,X6),zero)
| ~ subpopulations(first_movers,efficient_producers,X5,X6)
| ~ environment(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_positive_number_of_organizations])])]) ).
fof(c_0_11,negated_conjecture,
( ( ~ greater(zero,growth_rate(first_movers,esk2_0))
| ~ greater(growth_rate(efficient_producers,esk2_0),zero) )
& ( ~ greater(zero,growth_rate(efficient_producers,esk2_0))
| ~ greater(growth_rate(first_movers,esk2_0),zero) )
& ( growth_rate(efficient_producers,esk2_0) != zero
| growth_rate(first_movers,esk2_0) != zero )
& greater_or_equal(esk2_0,equilibrium(esk1_0))
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& environment(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( in_environment(X3,X4)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ environment(X3) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])])]) ).
fof(c_0_13,plain,
! [X7,X8] :
( ~ greater(equilibrium(X7),X8)
| ~ greater_or_equal(X8,equilibrium(X7))
| ~ environment(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,hypothesis,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) )
& ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a6]) ).
fof(c_0_15,hypothesis,
! [X9,X10] :
( ( ~ greater(number_of_organizations(X9,X10),zero)
| ~ in_environment(X9,X10)
| ~ environment(X9)
| constant(resources(X9,X10))
| greater(equilibrium(X9),X10) )
& ( ~ greater(number_of_organizations(X9,X10),zero)
| ~ in_environment(X9,X10)
| ~ environment(X9)
| decreases(resources(X9,X10))
| ~ greater(equilibrium(X9),X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_16,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ greater(equilibrium(X1),X2)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
greater_or_equal(esk2_0,equilibrium(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,hypothesis,
! [X11,X12] :
( ( ~ in_environment(X11,X12)
| ~ environment(X11)
| constant(number_of_organizations(X11,X12))
| ~ constant(resources(X11,X12)) )
& ( ~ in_environment(X11,X12)
| ~ environment(X11)
| ~ decreases(number_of_organizations(X11,X12))
| ~ decreases(resources(X11,X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_23,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(resources(X1,X2))
| greater(equilibrium(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
greater(number_of_organizations(esk1_0,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
~ greater(equilibrium(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).
fof(c_0_27,hypothesis,
! [X13,X14] :
( ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(efficient_producers,X14) = zero
| greater(zero,growth_rate(efficient_producers,X14))
| greater(zero,growth_rate(first_movers,X14)) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(efficient_producers,X14) = zero
| greater(zero,growth_rate(efficient_producers,X14))
| greater(growth_rate(efficient_producers,X14),zero) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(efficient_producers,X14) = zero
| greater(growth_rate(first_movers,X14),zero)
| greater(zero,growth_rate(first_movers,X14)) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(efficient_producers,X14) = zero
| greater(growth_rate(first_movers,X14),zero)
| greater(growth_rate(efficient_producers,X14),zero) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(first_movers,X14) = zero
| greater(zero,growth_rate(efficient_producers,X14))
| greater(zero,growth_rate(first_movers,X14)) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(first_movers,X14) = zero
| greater(zero,growth_rate(efficient_producers,X14))
| greater(growth_rate(efficient_producers,X14),zero) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(first_movers,X14) = zero
| greater(growth_rate(first_movers,X14),zero)
| greater(zero,growth_rate(first_movers,X14)) )
& ( ~ constant(number_of_organizations(X13,X14))
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13)
| growth_rate(first_movers,X14) = zero
| greater(growth_rate(first_movers,X14),zero)
| greater(growth_rate(efficient_producers,X14),zero) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l7])])])]) ).
cnf(c_0_28,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ constant(resources(X1,X2))
| constant(number_of_organizations(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,hypothesis,
constant(resources(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_18])]),c_0_26]) ).
cnf(c_0_30,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(growth_rate(first_movers,X1),zero)
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
constant(number_of_organizations(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_18])]) ).
cnf(c_0_32,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(growth_rate(first_movers,X1),zero)
| greater(growth_rate(efficient_producers,X1),zero) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ greater(zero,growth_rate(efficient_producers,esk2_0))
| ~ greater(growth_rate(first_movers,esk2_0),zero) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,hypothesis,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(growth_rate(first_movers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_36,hypothesis,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_37,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(growth_rate(efficient_producers,X1),zero) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(efficient_producers,X1) = zero
| greater(growth_rate(first_movers,X1),zero)
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(efficient_producers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,esk2_0))
| ~ greater(growth_rate(efficient_producers,esk2_0),zero) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,hypothesis,
( greater(growth_rate(first_movers,esk2_0),zero)
| greater(growth_rate(efficient_producers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_42,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| growth_rate(first_movers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,hypothesis,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(growth_rate(efficient_producers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_44,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(efficient_producers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(growth_rate(efficient_producers,X1),zero) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_45,hypothesis,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(growth_rate(first_movers,esk2_0),zero)
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_46,hypothesis,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_47,negated_conjecture,
( greater(growth_rate(first_movers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(first_movers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_42]) ).
cnf(c_0_49,hypothesis,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(growth_rate(efficient_producers,esk2_0),zero)
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_17]),c_0_18])]) ).
cnf(c_0_50,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) != zero
| growth_rate(first_movers,esk2_0) != zero ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_52,negated_conjecture,
growth_rate(first_movers,esk2_0) = zero,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_49]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
growth_rate(efficient_producers,esk2_0) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ greater(zero,zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_52]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_52]),c_0_54]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT024+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:19:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 % Version: 3.5.1
% 0.16/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 % Starting sh5l with 300s (1) cores
% 0.16/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4055416 completed with status 0
% 0.16/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.43 % No SInE strategy applied
% 0.16/0.43 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.43 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.16/0.43 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.43 % 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 4055424 completed with status 0
% 0.16/0.43 % Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.16/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.43 % No SInE strategy applied
% 0.16/0.43 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.43 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.16/0.43 % Preprocessing time : 0.001 s
% 0.16/0.43 % Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 % Proof found!
% 0.16/0.43 % SZS status Theorem
% 0.16/0.43 % SZS output start CNFRefutation
% See solution above
% 0.16/0.43 % Parsed axioms : 7
% 0.16/0.43 % Removed by relevancy pruning/SinE : 0
% 0.16/0.43 % Initial clauses : 21
% 0.16/0.43 % Removed in clause preprocessing : 0
% 0.16/0.43 % Initial clauses in saturation : 21
% 0.16/0.43 % Processed clauses : 65
% 0.16/0.43 % ...of these trivial : 0
% 0.16/0.43 % ...subsumed : 1
% 0.16/0.43 % ...remaining for further processing : 63
% 0.16/0.43 % Other redundant clauses eliminated : 0
% 0.16/0.43 % Clauses deleted for lack of memory : 0
% 0.16/0.43 % Backward-subsumed : 7
% 0.16/0.43 % Backward-rewritten : 7
% 0.16/0.43 % Generated clauses : 20
% 0.16/0.43 % ...of the previous two non-redundant : 24
% 0.16/0.43 % ...aggressively subsumed : 0
% 0.16/0.43 % Contextual simplify-reflections : 6
% 0.16/0.43 % Paramodulations : 19
% 0.16/0.43 % Factorizations : 0
% 0.16/0.43 % NegExts : 0
% 0.16/0.43 % Equation resolutions : 0
% 0.16/0.43 % Disequality decompositions : 0
% 0.16/0.43 % Total rewrite steps : 34
% 0.16/0.43 % ...of those cached : 29
% 0.16/0.43 % Propositional unsat checks : 0
% 0.16/0.43 % Propositional check models : 0
% 0.16/0.43 % Propositional check unsatisfiable : 0
% 0.16/0.43 % Propositional clauses : 0
% 0.16/0.43 % Propositional clauses after purity: 0
% 0.16/0.43 % Propositional unsat core size : 0
% 0.16/0.43 % Propositional preprocessing time : 0.000
% 0.16/0.43 % Propositional encoding time : 0.000
% 0.16/0.43 % Propositional solver time : 0.000
% 0.16/0.43 % Success case prop preproc time : 0.000
% 0.16/0.43 % Success case prop encoding time : 0.000
% 0.16/0.43 % Success case prop solver time : 0.000
% 0.16/0.43 % Current number of processed clauses : 27
% 0.16/0.43 % Positive orientable unit clauses : 9
% 0.16/0.43 % Positive unorientable unit clauses: 0
% 0.16/0.43 % Negative unit clauses : 3
% 0.16/0.43 % Non-unit-clauses : 15
% 0.16/0.43 % Current number of unprocessed clauses: 1
% 0.16/0.43 % ...number of literals in the above : 2
% 0.16/0.43 % Current number of archived formulas : 0
% 0.16/0.43 % Current number of archived clauses : 36
% 0.16/0.43 % Clause-clause subsumption calls (NU) : 329
% 0.16/0.43 % Rec. Clause-clause subsumption calls : 36
% 0.16/0.43 % Non-unit clause-clause subsumptions : 13
% 0.16/0.43 % Unit Clause-clause subsumption calls : 22
% 0.16/0.43 % Rewrite failures with RHS unbound : 0
% 0.16/0.43 % BW rewrite match attempts : 1
% 0.16/0.43 % BW rewrite match successes : 1
% 0.16/0.43 % Condensation attempts : 0
% 0.16/0.43 % Condensation successes : 0
% 0.16/0.43 % Termbank termtop insertions : 2808
% 0.16/0.43 % Search garbage collected termcells : 308
% 0.16/0.43
% 0.16/0.43 % -------------------------------------------------
% 0.16/0.43 % User time : 0.008 s
% 0.16/0.43 % System time : 0.001 s
% 0.16/0.43 % Total time : 0.009 s
% 0.16/0.43 % Maximum resident set size: 3640 pages
% 0.16/0.43
% 0.16/0.43 % -------------------------------------------------
% 0.16/0.43 % User time : 0.023 s
% 0.16/0.43 % System time : 0.010 s
% 0.16/0.43 % Total time : 0.033 s
% 0.16/0.43 % Maximum resident set size: 4864 pages
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------