%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT027+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 : n014.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:13 PM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 5 unt; 0 def)
% Number of atoms : 305 ( 14 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 427 ( 184 ~; 203 |; 28 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn 38 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_greater_transitivity,axiom,
! [X6,X7,X8] :
( ( greater(X7,X8)
& greater(X6,X7) )
=> greater(X6,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity) ).
fof(l10,hypothesis,
! [X1] :
( ( stable(X1)
& environment(X1) )
=> ? [X2] :
( ! [X3] :
( ( greater_or_equal(X3,X2)
& subpopulations(first_movers,efficient_producers,X1,X3) )
=> greater(zero,growth_rate(first_movers,X3)) )
& greater(X2,appear(efficient_producers,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10) ).
fof(mp_greater_or_equal,axiom,
! [X6,X7] :
( greater_or_equal(X6,X7)
<=> ( X6 = X7
| greater(X6,X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(mp_contracts_from,axiom,
! [X1,X2] :
( ( ! [X3] :
( ( greater_or_equal(X3,X2)
& greater(cardinality_at_time(first_movers,X3),zero) )
=> greater(zero,growth_rate(first_movers,X3)) )
& in_environment(X1,X2)
& stable(X1)
& environment(X1) )
=> contracts_from(X2,first_movers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from) ).
fof(t6,hypothesis,
! [X1,X3] :
( ( greater_or_equal(X3,appear(efficient_producers,X1))
& in_environment(X1,X3)
& environment(X1) )
=> greater(cardinality_at_time(efficient_producers,X3),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6) ).
fof(mp_long_stable_environments,axiom,
! [X1,X4,X5] :
( ( greater(X5,X4)
& in_environment(X1,X4)
& stable(X1)
& environment(X1) )
=> in_environment(X1,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_long_stable_environments) ).
fof(mp_non_empty_fm_and_ep,axiom,
! [X1,X3] :
( ( greater(cardinality_at_time(efficient_producers,X3),zero)
& greater(cardinality_at_time(first_movers,X3),zero)
& in_environment(X1,X3)
& environment(X1) )
=> subpopulations(first_movers,efficient_producers,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep) ).
fof(mp_EP_in_stable_environments,axiom,
! [X1] :
( ( stable(X1)
& environment(X1) )
=> in_environment(X1,appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_EP_in_stable_environments) ).
fof(prove_l9,conjecture,
! [X1] :
( ( stable(X1)
& environment(X1) )
=> ? [X2] :
( contracts_from(X2,first_movers)
& greater(X2,appear(efficient_producers,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9) ).
fof(c_0_9,plain,
! [X16,X17,X18] :
( greater(X16,X18)
| ~ greater(X17,X18)
| ~ greater(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])])]) ).
fof(c_0_10,hypothesis,
! [X11,X13] :
( ( ~ stable(X11)
| ~ environment(X11)
| greater(zero,growth_rate(first_movers,X13))
| ~ greater_or_equal(X13,esk1_1(X11))
| ~ subpopulations(first_movers,efficient_producers,X11,X13) )
& ( ~ stable(X11)
| ~ environment(X11)
| greater(esk1_1(X11),appear(efficient_producers,X11)) ) ),
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)],[l10])])])])])]) ).
fof(c_0_11,plain,
! [X25,X26] :
( ( greater_or_equal(X25,X26)
| X25 != X26 )
& ( greater_or_equal(X25,X26)
| ~ greater(X25,X26) )
& ( X25 = X26
| greater(X25,X26)
| ~ greater_or_equal(X25,X26) ) ),
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_12,plain,
! [X19,X20] :
( ( contracts_from(X20,first_movers)
| ~ in_environment(X19,X20)
| ~ stable(X19)
| ~ environment(X19)
| ~ greater(zero,growth_rate(first_movers,esk3_2(X19,X20))) )
& ( contracts_from(X20,first_movers)
| ~ in_environment(X19,X20)
| ~ stable(X19)
| ~ environment(X19)
| greater_or_equal(esk3_2(X19,X20),X20) )
& ( contracts_from(X20,first_movers)
| ~ in_environment(X19,X20)
| ~ stable(X19)
| ~ environment(X19)
| greater(cardinality_at_time(first_movers,esk3_2(X19,X20)),zero) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_contracts_from])])])])]) ).
fof(c_0_13,hypothesis,
! [X9,X10] :
( greater(cardinality_at_time(efficient_producers,X10),zero)
| ~ greater_or_equal(X10,appear(efficient_producers,X9))
| ~ in_environment(X9,X10)
| ~ environment(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6])])]) ).
cnf(c_0_14,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(esk1_1(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater_or_equal(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk1_1(X2))
| greater(X1,appear(efficient_producers,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| greater(esk3_2(X1,X2),X2)
| contracts_from(X2,first_movers)
| esk3_2(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X27,X28,X29] :
( in_environment(X27,X29)
| ~ greater(X29,X28)
| ~ in_environment(X27,X28)
| ~ stable(X27)
| ~ environment(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_long_stable_environments])])]) ).
cnf(c_0_23,hypothesis,
( ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater(X1,appear(efficient_producers,X2))
| greater(cardinality_at_time(efficient_producers,X1),zero) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X1,esk1_1(X2))
| greater(esk3_2(X1,esk1_1(X2)),appear(efficient_producers,X2))
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X2,esk1_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| ~ greater(zero,growth_rate(first_movers,esk3_2(X1,X2)))
| contracts_from(X2,first_movers) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_28,plain,
! [X22,X23] :
( subpopulations(first_movers,efficient_producers,X22,X23)
| ~ greater(cardinality_at_time(efficient_producers,X23),zero)
| ~ greater(cardinality_at_time(first_movers,X23),zero)
| ~ in_environment(X22,X23)
| ~ environment(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_non_empty_fm_and_ep])])]) ).
cnf(c_0_29,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X1,esk1_1(X2))
| ~ in_environment(X2,esk3_2(X1,esk1_1(X2)))
| greater(cardinality_at_time(efficient_producers,esk3_2(X1,esk1_1(X2))),zero)
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ environment(X1)
| ~ environment(X3)
| ~ stable(X1)
| ~ stable(X3)
| ~ in_environment(X1,X2)
| ~ in_environment(X3,X2)
| in_environment(X3,esk3_2(X1,X2))
| contracts_from(X2,first_movers)
| esk3_2(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
fof(c_0_31,plain,
! [X24] :
( in_environment(X24,appear(efficient_producers,X24))
| ~ stable(X24)
| ~ environment(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_EP_in_stable_environments])])]) ).
cnf(c_0_32,hypothesis,
( ~ environment(X2)
| ~ environment(X1)
| ~ stable(X2)
| ~ stable(X1)
| ~ in_environment(X2,esk1_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,esk3_2(X2,esk1_1(X1)))
| contracts_from(esk1_1(X1),first_movers) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_27]) ).
cnf(c_0_33,plain,
( ~ greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater(cardinality_at_time(first_movers,esk3_2(X1,X2)),zero) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,esk1_1(X2))
| ~ in_environment(X1,esk1_1(X2))
| greater(cardinality_at_time(efficient_producers,esk3_2(X1,esk1_1(X2))),zero)
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,hypothesis,
( ~ environment(X2)
| ~ environment(X1)
| ~ stable(X2)
| ~ stable(X1)
| ~ in_environment(X1,appear(efficient_producers,X2))
| in_environment(X1,esk1_1(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_37,plain,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,hypothesis,
( ~ environment(X2)
| ~ environment(X1)
| ~ stable(X2)
| ~ stable(X1)
| ~ in_environment(X2,esk1_1(X1))
| ~ in_environment(X1,esk3_2(X2,esk1_1(X1)))
| ~ greater(cardinality_at_time(efficient_producers,esk3_2(X2,esk1_1(X1))),zero)
| contracts_from(esk1_1(X1),first_movers) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_39,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X1,esk1_1(X2))
| greater(cardinality_at_time(efficient_producers,esk3_2(X1,esk1_1(X2))),zero)
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X1,esk1_1(X2))
| ~ in_environment(X2,esk3_2(X1,esk1_1(X2)))
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_43,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,esk1_1(X1))
| greater(cardinality_at_time(efficient_producers,esk1_1(X1)),zero) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_44,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,esk1_1(X2))
| ~ in_environment(X1,esk1_1(X2))
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_45,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,esk1_1(X1))
| greater(zero,growth_rate(first_movers,esk1_1(X1))) ),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_46,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(efficient_producers,esk1_1(X1)),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_37]) ).
cnf(c_0_47,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X1,esk1_1(X2))
| contracts_from(esk1_1(X2),first_movers)
| esk3_2(X1,esk1_1(X2)) = esk1_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_37]) ).
cnf(c_0_48,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,esk1_1(X1))
| ~ greater(cardinality_at_time(first_movers,esk1_1(X1)),zero)
| greater(zero,growth_rate(first_movers,esk1_1(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_33]),c_0_46]) ).
fof(c_0_49,negated_conjecture,
~ ! [X1] :
( ( stable(X1)
& environment(X1) )
=> ? [X2] :
( contracts_from(X2,first_movers)
& greater(X2,appear(efficient_producers,X1)) ) ),
inference(assume_negation,[status(cth)],[prove_l9]) ).
cnf(c_0_50,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,esk1_1(X1))
| ~ greater(zero,growth_rate(first_movers,esk1_1(X1)))
| contracts_from(esk1_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_27,c_0_47]) ).
cnf(c_0_51,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(cardinality_at_time(first_movers,esk1_1(X1)),zero)
| greater(zero,growth_rate(first_movers,esk1_1(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_37]) ).
cnf(c_0_52,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,esk1_1(X1))
| greater(cardinality_at_time(first_movers,esk1_1(X1)),zero)
| contracts_from(esk1_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_34,c_0_47]) ).
fof(c_0_53,negated_conjecture,
! [X15] :
( ( ~ contracts_from(X15,first_movers)
| ~ greater(X15,appear(efficient_producers,esk2_0)) )
& stable(esk2_0)
& environment(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])])])]) ).
cnf(c_0_54,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,esk1_1(X1))
| contracts_from(esk1_1(X1),first_movers) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
stable(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
environment(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,appear(efficient_producers,X1))
| contracts_from(esk1_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_54,c_0_36]) ).
cnf(c_0_59,negated_conjecture,
~ contracts_from(esk1_1(esk2_0),first_movers),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_15]),c_0_56]),c_0_57])]) ).
cnf(c_0_60,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| contracts_from(esk1_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_58,c_0_37]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT027+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:22:21 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.14/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_1 with pid 2853825 completed with status 0
% 0.14/0.44 % Result found by new_bool_1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 2853833 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Theorem
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 9
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 16
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 16
% 0.14/0.44 % Processed clauses : 69
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 1
% 0.14/0.44 % ...remaining for further processing : 68
% 0.14/0.44 % Other redundant clauses eliminated : 1
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 18
% 0.14/0.44 % Backward-rewritten : 0
% 0.14/0.44 % Generated clauses : 80
% 0.14/0.44 % ...of the previous two non-redundant : 77
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 8
% 0.14/0.44 % Paramodulations : 79
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 1
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 7
% 0.14/0.44 % ...of those cached : 4
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 49
% 0.14/0.44 % Positive orientable unit clauses : 3
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 1
% 0.14/0.44 % Non-unit-clauses : 45
% 0.14/0.44 % Current number of unprocessed clauses: 24
% 0.14/0.44 % ...number of literals in the above : 251
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 18
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 1114
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 162
% 0.14/0.44 % Non-unit clause-clause subsumptions : 27
% 0.14/0.44 % Unit Clause-clause subsumption calls : 1
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 0
% 0.14/0.44 % BW rewrite match successes : 0
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 5122
% 0.14/0.44 % Search garbage collected termcells : 356
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.008 s
% 0.14/0.44 % System time : 0.002 s
% 0.14/0.44 % Total time : 0.011 s
% 0.14/0.44 % Maximum resident set size: 3644 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.008 s
% 0.14/0.44 % System time : 0.008 s
% 0.14/0.44 % Total time : 0.016 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------