%------------------------------------------------------------------------------
% File : E---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 : n011.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:05 PM UTC 2026
% Result : Theorem 0.14s 5.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 4 unt; 0 def)
% Number of atoms : 249 ( 13 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 316 ( 127 ~; 149 |; 28 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 : 95 ( 0 sgn 38 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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_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(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_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(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(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_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(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(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,
! [X14,X15,X16] :
( in_environment(X14,X16)
| ~ greater(X16,X15)
| ~ in_environment(X14,X15)
| ~ stable(X14)
| ~ environment(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_long_stable_environments])])]) ).
fof(c_0_10,plain,
! [X17] :
( in_environment(X17,appear(efficient_producers,X17))
| ~ stable(X17)
| ~ environment(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_EP_in_stable_environments])])]) ).
cnf(c_0_11,plain,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,hypothesis,
! [X25,X27] :
( ( ~ stable(X25)
| ~ environment(X25)
| greater(zero,growth_rate(first_movers,X27))
| ~ greater_or_equal(X27,esk2_1(X25))
| ~ subpopulations(first_movers,efficient_producers,X25,X27) )
& ( ~ stable(X25)
| ~ environment(X25)
| greater(esk2_1(X25),appear(efficient_producers,X25)) ) ),
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_14,plain,
! [X9,X10] :
( ( contracts_from(X10,first_movers)
| ~ in_environment(X9,X10)
| ~ stable(X9)
| ~ environment(X9)
| ~ greater(zero,growth_rate(first_movers,esk1_2(X9,X10))) )
& ( contracts_from(X10,first_movers)
| ~ in_environment(X9,X10)
| ~ stable(X9)
| ~ environment(X9)
| greater_or_equal(esk1_2(X9,X10),X10) )
& ( contracts_from(X10,first_movers)
| ~ in_environment(X9,X10)
| ~ stable(X9)
| ~ environment(X9)
| greater(cardinality_at_time(first_movers,esk1_2(X9,X10)),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])])])])]) ).
cnf(c_0_15,plain,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(X2,appear(efficient_producers,X1))
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(esk2_1(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X18,X19,X20] :
( greater(X18,X20)
| ~ greater(X19,X20)
| ~ greater(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])])]) ).
fof(c_0_18,plain,
! [X21,X22] :
( ( greater_or_equal(X21,X22)
| X21 != X22 )
& ( greater_or_equal(X21,X22)
| ~ greater(X21,X22) )
& ( X21 = X22
| greater(X21,X22)
| ~ greater_or_equal(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])])]) ).
cnf(c_0_19,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater_or_equal(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| in_environment(X1,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater_or_equal(esk1_2(X1,esk2_1(X1)),esk2_1(X1))
| contracts_from(esk2_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk2_1(X2))
| greater(X1,appear(efficient_producers,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk1_2(X1,esk2_1(X1)),esk2_1(X1))
| contracts_from(esk2_1(X1),first_movers)
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X12,X13] :
( subpopulations(first_movers,efficient_producers,X12,X13)
| ~ greater(cardinality_at_time(efficient_producers,X13),zero)
| ~ greater(cardinality_at_time(first_movers,X13),zero)
| ~ in_environment(X12,X13)
| ~ environment(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_non_empty_fm_and_ep])])]) ).
cnf(c_0_27,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(X2,esk2_1(X1))
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_28,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater(cardinality_at_time(first_movers,esk1_2(X1,X2)),zero) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_29,hypothesis,
! [X23,X24] :
( greater(cardinality_at_time(efficient_producers,X24),zero)
| ~ greater_or_equal(X24,appear(efficient_producers,X23))
| ~ in_environment(X23,X24)
| ~ environment(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6])])]) ).
cnf(c_0_30,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk1_2(X1,esk2_1(X1)),appear(efficient_producers,X1))
| contracts_from(esk2_1(X1),first_movers)
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,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_26]) ).
cnf(c_0_33,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| in_environment(X1,esk1_2(X1,esk2_1(X1)))
| contracts_from(esk2_1(X1),first_movers)
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_34,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(first_movers,esk1_2(X1,esk2_1(X1))),zero)
| contracts_from(esk2_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_35,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_29]) ).
cnf(c_0_36,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater_or_equal(esk1_2(X1,esk2_1(X1)),appear(efficient_producers,X1))
| contracts_from(esk2_1(X1),first_movers)
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(cardinality_at_time(efficient_producers,esk1_2(X1,esk2_1(X1))),zero)
| contracts_from(esk2_1(X1),first_movers)
| subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,esk2_1(X1)))
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(efficient_producers,esk1_2(X1,esk2_1(X1))),zero)
| contracts_from(esk2_1(X1),first_movers)
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]) ).
cnf(c_0_39,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| ~ greater(zero,growth_rate(first_movers,esk1_2(X1,X2)))
| contracts_from(X2,first_movers) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater_or_equal(esk2_1(X1),appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_41,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X2,esk2_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| contracts_from(esk2_1(X1),first_movers)
| subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,esk2_1(X1)))
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(zero,growth_rate(first_movers,esk1_2(X1,esk2_1(X1))))
| contracts_from(esk2_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_44,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(efficient_producers,esk2_1(X1)),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_40]),c_0_20]) ).
cnf(c_0_45,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| contracts_from(esk2_1(X1),first_movers)
| esk1_2(X1,esk2_1(X1)) = esk2_1(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_23]),c_0_43]) ).
fof(c_0_46,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_47,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)
| subpopulations(first_movers,efficient_producers,X1,esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_44]) ).
cnf(c_0_48,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(first_movers,esk2_1(X1)),zero)
| contracts_from(esk2_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_34,c_0_45]) ).
cnf(c_0_49,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_50,negated_conjecture,
! [X29] :
( ( ~ contracts_from(X29,first_movers)
| ~ greater(X29,appear(efficient_producers,esk3_0)) )
& stable(esk3_0)
& environment(esk3_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_46])])])])]) ).
cnf(c_0_51,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| contracts_from(esk2_1(X1),first_movers)
| subpopulations(first_movers,efficient_producers,X1,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_53,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(zero,growth_rate(first_movers,esk2_1(X1)))
| contracts_from(esk2_1(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_43,c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| contracts_from(esk2_1(X1),first_movers) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_51]),c_0_52])]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(esk2_1(X1),appear(efficient_producers,esk3_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
stable(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,negated_conjecture,
environment(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_16]),c_0_57]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT027+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.09/5.37 % Computer : n011.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.38 % DateTime : Mon Sep 21 01:22:31 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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/5.45 % Version: 3.5.1
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 664948 completed with status 0
% 0.14/5.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.45 % No SInE strategy applied
% 0.14/5.45 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.45 % new_bool_3 with pid 664957 completed with status 0
% 0.14/5.45 % Result found by new_bool_3
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.45 % No SInE strategy applied
% 0.14/5.45 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.45 % Preprocessing time : 0.001 s
% 0.14/5.45 % Presaturation interreduction done
% 0.14/5.45
% 0.14/5.45 % Proof found!
% 0.14/5.45 % SZS status Theorem
% 0.14/5.45 % SZS output start CNFRefutation
% See solution above
% 0.14/5.45 % Parsed axioms : 9
% 0.14/5.45 % Removed by relevancy pruning/SinE : 0
% 0.14/5.45 % Initial clauses : 16
% 0.14/5.45 % Removed in clause preprocessing : 0
% 0.14/5.45 % Initial clauses in saturation : 16
% 0.14/5.45 % Processed clauses : 102
% 0.14/5.45 % ...of these trivial : 0
% 0.14/5.45 % ...subsumed : 12
% 0.14/5.45 % ...remaining for further processing : 90
% 0.14/5.45 % Other redundant clauses eliminated : 1
% 0.14/5.45 % Clauses deleted for lack of memory : 0
% 0.14/5.45 % Backward-subsumed : 24
% 0.14/5.45 % Backward-rewritten : 0
% 0.14/5.45 % Generated clauses : 79
% 0.14/5.45 % ...of the previous two non-redundant : 77
% 0.14/5.45 % ...aggressively subsumed : 0
% 0.14/5.45 % Contextual simplify-reflections : 11
% 0.14/5.45 % Paramodulations : 78
% 0.14/5.45 % Factorizations : 0
% 0.14/5.45 % NegExts : 0
% 0.14/5.45 % Equation resolutions : 1
% 0.14/5.45 % Disequality decompositions : 0
% 0.14/5.45 % Total rewrite steps : 4
% 0.14/5.45 % ...of those cached : 1
% 0.14/5.45 % Propositional unsat checks : 0
% 0.14/5.45 % Propositional check models : 0
% 0.14/5.45 % Propositional check unsatisfiable : 0
% 0.14/5.45 % Propositional clauses : 0
% 0.14/5.45 % Propositional clauses after purity: 0
% 0.14/5.45 % Propositional unsat core size : 0
% 0.14/5.45 % Propositional preprocessing time : 0.000
% 0.14/5.45 % Propositional encoding time : 0.000
% 0.14/5.45 % Propositional solver time : 0.000
% 0.14/5.45 % Success case prop preproc time : 0.000
% 0.14/5.45 % Success case prop encoding time : 0.000
% 0.14/5.45 % Success case prop solver time : 0.000
% 0.14/5.45 % Current number of processed clauses : 49
% 0.14/5.45 % Positive orientable unit clauses : 3
% 0.14/5.45 % Positive unorientable unit clauses: 0
% 0.14/5.45 % Negative unit clauses : 0
% 0.14/5.45 % Non-unit-clauses : 46
% 0.14/5.45 % Current number of unprocessed clauses: 7
% 0.14/5.45 % ...number of literals in the above : 40
% 0.14/5.45 % Current number of archived formulas : 0
% 0.14/5.45 % Current number of archived clauses : 40
% 0.14/5.45 % Clause-clause subsumption calls (NU) : 1322
% 0.14/5.45 % Rec. Clause-clause subsumption calls : 194
% 0.14/5.45 % Non-unit clause-clause subsumptions : 47
% 0.14/5.45 % Unit Clause-clause subsumption calls : 0
% 0.14/5.45 % Rewrite failures with RHS unbound : 0
% 0.14/5.45 % BW rewrite match attempts : 0
% 0.14/5.45 % BW rewrite match successes : 0
% 0.14/5.45 % Condensation attempts : 0
% 0.14/5.45 % Condensation successes : 0
% 0.14/5.45 % Termbank termtop insertions : 4749
% 0.14/5.45 % Search garbage collected termcells : 354
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.009 s
% 0.14/5.45 % System time : 0.004 s
% 0.14/5.45 % Total time : 0.013 s
% 0.14/5.45 % Maximum resident set size: 3644 pages
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.042 s
% 0.14/5.45 % System time : 0.011 s
% 0.14/5.45 % Total time : 0.052 s
% 0.14/5.45 % Maximum resident set size: 4864 pages
% 0.14/5.45 % E exiting
%------------------------------------------------------------------------------