%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT026+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 : n010.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 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 8 unt; 0 def)
% Number of atoms : 213 ( 21 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 260 ( 106 ~; 107 |; 32 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 106 ( 0 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_greater_or_equal,axiom,
! [X5,X6] :
( greater_or_equal(X5,X6)
<=> ( X5 = X6
| greater(X5,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(mp_critical_point_after_EP,axiom,
! [X1] :
( environment(X1)
=> greater_or_equal(critical_point(X1),appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_critical_point_after_EP) ).
fof(t6,hypothesis,
! [X1,X4] :
( ( greater_or_equal(X4,appear(efficient_producers,X1))
& in_environment(X1,X4)
& environment(X1) )
=> greater(cardinality_at_time(efficient_producers,X4),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6) ).
fof(mp_greater_transitivity,axiom,
! [X5,X6,X7] :
( ( greater(X6,X7)
& greater(X5,X6) )
=> greater(X5,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity) ).
fof(prove_l8,conjecture,
! [X1,X4] :
( ( greater(X4,critical_point(X1))
& in_environment(X1,X4)
& environment(X1) )
=> selection_favors(efficient_producers,first_movers,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l8) ).
fof(d1,hypothesis,
! [X1,X8] :
( ( X8 = critical_point(X1)
& environment(X1) )
=> ( ! [X4] :
( ( greater(X4,X8)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4)) )
& ~ greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1) ).
fof(mp_non_empty_fm_and_ep,axiom,
! [X1,X4] :
( ( greater(cardinality_at_time(efficient_producers,X4),zero)
& greater(cardinality_at_time(first_movers,X4),zero)
& in_environment(X1,X4)
& environment(X1) )
=> subpopulations(first_movers,efficient_producers,X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep) ).
fof(mp1_high_growth_rates,axiom,
! [X1,X2,X3,X4] :
( ( greater(growth_rate(X3,X4),growth_rate(X2,X4))
& subpopulations(X2,X3,X1,X4)
& environment(X1) )
=> selection_favors(X3,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp1_high_growth_rates) ).
fof(mp_first_movers_exist,axiom,
! [X1,X4] :
( ( in_environment(X1,X4)
& environment(X1) )
=> greater_or_equal(cardinality_at_time(first_movers,X4),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_exist) ).
fof(mp2_favour_members,axiom,
! [X1,X2,X3,X4] :
( ( cardinality_at_time(X3,X4) = zero
& greater(cardinality_at_time(X2,X4),zero)
& subpopulation(X3,X1,X4)
& subpopulation(X2,X1,X4)
& environment(X1) )
=> selection_favors(X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp2_favour_members) ).
fof(mp_subpopulations,axiom,
! [X1,X4] :
( ( in_environment(X1,X4)
& environment(X1) )
=> ( subpopulation(efficient_producers,X1,X4)
& subpopulation(first_movers,X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations) ).
fof(c_0_11,plain,
! [X28,X29] :
( ( greater_or_equal(X28,X29)
| X28 != X29 )
& ( greater_or_equal(X28,X29)
| ~ greater(X28,X29) )
& ( X28 = X29
| greater(X28,X29)
| ~ greater_or_equal(X28,X29) ) ),
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,
! [X27] :
( greater_or_equal(critical_point(X27),appear(efficient_producers,X27))
| ~ environment(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_critical_point_after_EP])])]) ).
fof(c_0_13,hypothesis,
! [X12,X13] :
( greater(cardinality_at_time(efficient_producers,X13),zero)
| ~ greater_or_equal(X13,appear(efficient_producers,X12))
| ~ in_environment(X12,X13)
| ~ environment(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6])])]) ).
fof(c_0_14,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])])]) ).
cnf(c_0_15,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,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_18,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ environment(X1)
| greater(critical_point(X1),appear(efficient_producers,X1))
| appear(efficient_producers,X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X4] :
( ( greater(X4,critical_point(X1))
& in_environment(X1,X4)
& environment(X1) )
=> selection_favors(efficient_producers,first_movers,X4) ),
inference(assume_negation,[status(cth)],[prove_l8]) ).
fof(c_0_22,hypothesis,
! [X1,X8] :
( ( X8 = critical_point(X1)
& environment(X1) )
=> ( ! [X4] :
( ( greater(X4,X8)
& subpopulations(first_movers,efficient_producers,X1,X4) )
=> greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4)) )
& ~ greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8)) ) ),
inference(fof_simplification,[status(thm)],[d1]) ).
cnf(c_0_23,hypothesis,
( ~ environment(X2)
| ~ greater(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1)
| greater(cardinality_at_time(efficient_producers,X1),zero) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ environment(X1)
| ~ greater(X2,critical_point(X1))
| greater(X2,appear(efficient_producers,X1))
| appear(efficient_producers,X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,negated_conjecture,
( ~ selection_favors(efficient_producers,first_movers,esk2_0)
& greater(esk2_0,critical_point(esk1_0))
& in_environment(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_21])])])]) ).
fof(c_0_26,hypothesis,
! [X9,X10,X11] :
( ( X10 != critical_point(X9)
| ~ environment(X9)
| greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11))
| ~ greater(X11,X10)
| ~ subpopulations(first_movers,efficient_producers,X9,X11) )
& ( X10 != critical_point(X9)
| ~ environment(X9)
| ~ greater(growth_rate(efficient_producers,X10),growth_rate(first_movers,X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])]) ).
cnf(c_0_27,hypothesis,
( ~ environment(X1)
| ~ greater(X2,critical_point(X1))
| ~ in_environment(X1,X2)
| greater(cardinality_at_time(efficient_producers,X2),zero)
| appear(efficient_producers,X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
greater(esk2_0,critical_point(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,hypothesis,
( X3 != critical_point(X1)
| ~ environment(X1)
| ~ greater(X2,X3)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X25,X26] :
( subpopulations(first_movers,efficient_producers,X25,X26)
| ~ greater(cardinality_at_time(efficient_producers,X26),zero)
| ~ greater(cardinality_at_time(first_movers,X26),zero)
| ~ in_environment(X25,X26)
| ~ environment(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_non_empty_fm_and_ep])])]) ).
cnf(c_0_33,negated_conjecture,
( greater(cardinality_at_time(efficient_producers,esk2_0),zero)
| appear(efficient_producers,esk1_0) = critical_point(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_34,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ greater(X1,critical_point(X2))
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_35,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_32]) ).
cnf(c_0_36,hypothesis,
( ~ greater(X1,critical_point(esk1_0))
| ~ in_environment(esk1_0,X1)
| greater(cardinality_at_time(efficient_producers,X1),zero)
| greater(cardinality_at_time(efficient_producers,esk2_0),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_30])]) ).
fof(c_0_37,plain,
! [X19,X20,X21,X22] :
( selection_favors(X21,X20,X22)
| ~ greater(growth_rate(X21,X22),growth_rate(X20,X22))
| ~ subpopulations(X20,X21,X19,X22)
| ~ environment(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp1_high_growth_rates])])]) ).
cnf(c_0_38,hypothesis,
( ~ environment(X2)
| ~ greater(X1,critical_point(X2))
| ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater(cardinality_at_time(first_movers,X1),zero)
| ~ in_environment(X2,X1)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
greater(cardinality_at_time(efficient_producers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_29])]) ).
fof(c_0_40,plain,
! [X23,X24] :
( greater_or_equal(cardinality_at_time(first_movers,X24),zero)
| ~ in_environment(X23,X24)
| ~ environment(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_first_movers_exist])])]) ).
cnf(c_0_41,plain,
( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| selection_favors(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ greater(cardinality_at_time(first_movers,esk2_0),zero)
| greater(growth_rate(efficient_producers,esk2_0),growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_29]),c_0_39]),c_0_30])]) ).
cnf(c_0_43,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_44,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(cardinality_at_time(first_movers,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_45,plain,
! [X30,X31,X32,X33] :
( selection_favors(X31,X32,X33)
| cardinality_at_time(X32,X33) != zero
| ~ greater(cardinality_at_time(X31,X33),zero)
| ~ subpopulation(X32,X30,X33)
| ~ subpopulation(X31,X30,X33)
| ~ environment(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp2_favour_members])])]) ).
fof(c_0_46,plain,
! [X34,X35] :
( ( ~ in_environment(X34,X35)
| ~ environment(X34)
| subpopulation(efficient_producers,X34,X35) )
& ( ~ in_environment(X34,X35)
| ~ environment(X34)
| subpopulation(first_movers,X34,X35) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_subpopulations])])])]) ).
cnf(c_0_47,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,esk2_0)
| ~ greater(cardinality_at_time(first_movers,esk2_0),zero) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
greater_or_equal(cardinality_at_time(first_movers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_29]),c_0_30])]) ).
cnf(c_0_49,plain,
( cardinality_at_time(X4,X3) != zero
| ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X4,X1,X3)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| selection_favors(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( ~ environment(X1)
| ~ greater(cardinality_at_time(first_movers,esk2_0),zero)
| ~ in_environment(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_39])]) ).
cnf(c_0_52,negated_conjecture,
( greater(cardinality_at_time(first_movers,esk2_0),zero)
| cardinality_at_time(first_movers,esk2_0) = zero ),
inference(spm,[status(thm)],[c_0_15,c_0_48]) ).
cnf(c_0_53,plain,
( ~ environment(X3)
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ subpopulation(X1,X3,X2)
| ~ in_environment(X3,X2)
| cardinality_at_time(first_movers,X2) != zero
| selection_favors(X1,first_movers,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,negated_conjecture,
( ~ environment(X1)
| ~ in_environment(X1,esk2_0)
| cardinality_at_time(first_movers,esk2_0) = zero ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ environment(X2)
| ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ in_environment(X2,X1)
| cardinality_at_time(first_movers,X1) != zero
| selection_favors(efficient_producers,first_movers,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
cardinality_at_time(first_movers,esk2_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_29]),c_0_30])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_29]),c_0_57]),c_0_39]),c_0_30])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT026+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.11/0.36 % Computer : n010.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:21:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/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.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_3 with pid 3948139 completed with status 0
% 0.14/0.43 % Result found by new_bool_3
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 3948142 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 11
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 18
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 18
% 0.14/0.43 % Processed clauses : 66
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 7
% 0.14/0.43 % ...remaining for further processing : 59
% 0.14/0.43 % Other redundant clauses eliminated : 3
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 3
% 0.14/0.43 % Backward-rewritten : 12
% 0.14/0.43 % Generated clauses : 57
% 0.14/0.43 % ...of the previous two non-redundant : 57
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 54
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 3
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 46
% 0.14/0.43 % ...of those cached : 40
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 41
% 0.14/0.43 % Positive orientable unit clauses : 6
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 2
% 0.14/0.43 % Non-unit-clauses : 33
% 0.14/0.43 % Current number of unprocessed clauses: 3
% 0.14/0.43 % ...number of literals in the above : 13
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 15
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 355
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 119
% 0.14/0.43 % Non-unit clause-clause subsumptions : 6
% 0.14/0.43 % Unit Clause-clause subsumption calls : 27
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 2
% 0.14/0.43 % BW rewrite match successes : 2
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 3127
% 0.14/0.43 % Search garbage collected termcells : 331
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.007 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.010 s
% 0.14/0.43 % Maximum resident set size: 3648 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.010 s
% 0.14/0.43 % System time : 0.006 s
% 0.14/0.43 % Total time : 0.016 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------