%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT033+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:27 PM UTC 2026
% Result : CounterSatisfiable 0.16s 0.46s
% Output : Saturation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_17ERROR: Could not build tree for root c_0_22ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_19,plain,
( ~ greater_or_equal(X4,X2)
| ~ greater_or_equal(X3,X4)
| ~ in_environment(X1,X3)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| in_environment(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_20,plain,
( ~ environment(X1)
| greater_or_equal(appear(first_movers,X1),start_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
cnf(c_0_22,hypothesis,
( ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| X2 = first_movers
| X2 = efficient_producers ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_23,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| greater(cardinality_at_time(esk3_2(X1,X2),X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_26,plain,
( ~ environment(X2)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ in_environment(X1,start_time(X2))
| ~ greater_or_equal(X3,appear(first_movers,X2))
| in_environment(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]),
[final] ).
cnf(c_0_27,negated_conjecture,
greater_or_equal(esk2_0,appear(first_movers,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_28,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_31,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| subpopulation(esk3_2(X1,X2),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_33,hypothesis,
( ~ in_environment(X1,appear(an_organisation,X1))
| ~ environment(X1)
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]),
[final] ).
cnf(c_0_34,plain,
( ~ in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| in_environment(X1,appear(an_organisation,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
cnf(c_0_35,negated_conjecture,
( ~ environment(X1)
| ~ in_environment(X1,esk2_0)
| ~ in_environment(X1,start_time(esk1_0))
| in_environment(X1,appear(first_movers,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[final] ).
cnf(c_0_36,plain,
( ~ environment(X1)
| in_environment(X1,start_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]),
[final] ).
cnf(c_0_37,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_38,hypothesis,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| esk3_2(X1,X2) = first_movers
| esk3_2(X1,X2) = efficient_producers ),
inference(spm,[status(thm)],[c_0_30,c_0_31]),
[final] ).
cnf(c_0_39,hypothesis,
( ~ greater_or_equal(X2,appear(an_organisation,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_40,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,appear(first_movers,X1))
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[final] ).
cnf(c_0_41,negated_conjecture,
in_environment(esk1_0,appear(first_movers,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_28])]),
[final] ).
cnf(c_0_42,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(an_organisation,X1))
| esk3_2(X1,X2) = efficient_producers
| esk3_2(X1,X2) = first_movers ),
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[final] ).
cnf(c_0_43,hypothesis,
appear(an_organisation,esk1_0) = appear(first_movers,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28])]),
[final] ).
cnf(c_0_47,hypothesis,
( ~ in_environment(esk1_0,X1)
| ~ greater_or_equal(X1,appear(first_movers,esk1_0))
| esk3_2(esk1_0,X1) = first_movers
| esk3_2(esk1_0,X1) = efficient_producers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_28])]),
[final] ).
cnf(c_0_48,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_44]),
[final] ).
cnf(c_0_49,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_50,plain,
( ~ greater(appear(X3,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| cardinality_at_time(X3,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_51,negated_conjecture,
greater(appear(efficient_producers,esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_52,negated_conjecture,
( esk3_2(esk1_0,esk2_0) = efficient_producers
| esk3_2(esk1_0,esk2_0) = first_movers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_27]),c_0_37])]),
[final] ).
cnf(c_0_53,plain,
( ~ environment(X3)
| ~ subpopulation(X1,X3,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ in_environment(X3,X2)
| cardinality_at_time(efficient_producers,X2) != zero
| selection_favors(X1,efficient_producers,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]),
[final] ).
cnf(c_0_54,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_55,negated_conjecture,
cardinality_at_time(efficient_producers,esk2_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_37]),c_0_28])]),
[final] ).
cnf(c_0_57,plain,
( ~ environment(X2)
| ~ greater(cardinality_at_time(first_movers,X1),zero)
| ~ in_environment(X2,X1)
| cardinality_at_time(efficient_producers,X1) != zero
| selection_favors(first_movers,efficient_producers,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_58,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_62,negated_conjecture,
~ greater(cardinality_at_time(first_movers,esk2_0),zero),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_37]),c_0_55]),c_0_28])]),c_0_58]),
[final] ).
cnf(c_0_65,plain,
( ~ environment(X3)
| ~ subpopulation(X1,X3,X2)
| ~ greater(cardinality_at_time(X1,X2),zero)
| ~ in_environment(X3,X2)
| cardinality_at_time(first_movers,X2) != zero
| selection_favors(X1,first_movers,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_54]),
[final] ).
cnf(c_0_69,plain,
( ~ greater(cardinality_at_time(X1,X2),zero)
| cardinality_at_time(X1,t) != zero ),
inference(split_conjunct,[status(thm)],[c_0_64]),
[final] ).
cnf(c_0_71,plain,
( ~ environment(X2)
| ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ in_environment(X2,X1)
| cardinality_at_time(efficient_producers,X1) != zero
| selection_favors(efficient_producers,efficient_producers,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_49]),
[final] ).
cnf(c_0_72,plain,
( ~ environment(X2)
| ~ greater(cardinality_at_time(first_movers,X1),zero)
| ~ in_environment(X2,X1)
| cardinality_at_time(first_movers,X1) != zero
| selection_favors(first_movers,first_movers,X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_54]),
[final] ).
cnf(c_0_73,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_65,c_0_49]),
[final] ).
cnf(c_0_74,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_75,hypothesis,
subpopulation(efficient_producers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_39]),c_0_43]),c_0_27]),c_0_37]),c_0_28])]),
[final] ).
cnf(c_0_76,hypothesis,
greater(zero,zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_39]),c_0_43]),c_0_27]),c_0_37]),c_0_28])]),
[final] ).
cnf(c_0_80,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| ~ in_environment(X1,appear(first_movers,X1))
| cardinality_at_time(first_movers,appear(an_organisation,X1)) != zero
| selection_favors(first_movers,first_movers,appear(an_organisation,X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_34]),
[final] ).
cnf(c_0_81,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| ~ in_environment(X1,appear(first_movers,X1))
| cardinality_at_time(first_movers,appear(an_organisation,X1)) != zero
| selection_favors(efficient_producers,first_movers,appear(an_organisation,X1)) ),
inference(spm,[status(thm)],[c_0_73,c_0_34]),
[final] ).
cnf(c_0_82,plain,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| cardinality_at_time(first_movers,X2) != zero
| selection_favors(esk3_2(X1,X2),first_movers,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_31]),c_0_23]),c_0_74]),
[final] ).
cnf(c_0_83,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| ~ in_environment(X1,appear(first_movers,X1))
| cardinality_at_time(efficient_producers,appear(an_organisation,X1)) != zero
| selection_favors(first_movers,efficient_producers,appear(an_organisation,X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_34]),
[final] ).
cnf(c_0_84,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| ~ in_environment(X1,appear(first_movers,X1))
| cardinality_at_time(efficient_producers,appear(an_organisation,X1)) != zero
| selection_favors(efficient_producers,efficient_producers,appear(an_organisation,X1)) ),
inference(spm,[status(thm)],[c_0_71,c_0_34]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ~ greater(cardinality_at_time(first_movers,appear(first_movers,esk1_0)),zero)
| cardinality_at_time(first_movers,appear(first_movers,esk1_0)) != zero
| selection_favors(first_movers,first_movers,appear(first_movers,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_41]),c_0_28])]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ greater(cardinality_at_time(efficient_producers,appear(first_movers,esk1_0)),zero)
| cardinality_at_time(first_movers,appear(first_movers,esk1_0)) != zero
| selection_favors(efficient_producers,first_movers,appear(first_movers,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_41]),c_0_28])]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ~ greater(cardinality_at_time(first_movers,appear(first_movers,esk1_0)),zero)
| cardinality_at_time(efficient_producers,appear(first_movers,esk1_0)) != zero
| selection_favors(first_movers,efficient_producers,appear(first_movers,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_41]),c_0_28])]),
[final] ).
cnf(c_0_88,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(first_movers,start_time(X1)),zero)
| cardinality_at_time(first_movers,start_time(X1)) != zero
| selection_favors(first_movers,first_movers,start_time(X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_36]),
[final] ).
cnf(c_0_89,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(efficient_producers,start_time(X1)),zero)
| cardinality_at_time(first_movers,start_time(X1)) != zero
| selection_favors(efficient_producers,first_movers,start_time(X1)) ),
inference(spm,[status(thm)],[c_0_73,c_0_36]),
[final] ).
cnf(c_0_90,plain,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| cardinality_at_time(efficient_producers,X2) != zero
| selection_favors(esk3_2(X1,X2),efficient_producers,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_31]),c_0_23]),c_0_74]),
[final] ).
cnf(c_0_91,hypothesis,
( ~ subpopulation(X1,esk1_0,esk2_0)
| ~ greater(cardinality_at_time(X1,esk2_0),zero)
| selection_favors(X1,efficient_producers,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_75]),c_0_55]),c_0_28])]),
[final] ).
cnf(c_0_92,hypothesis,
( cardinality_at_time(first_movers,esk2_0) != zero
| selection_favors(efficient_producers,first_movers,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_75]),c_0_37]),c_0_55]),c_0_76]),c_0_28])]),
[final] ).
cnf(c_0_93,plain,
( ~ environment(X2)
| ~ subpopulation(X1,X2,X3)
| ~ greater(number_of_organizations(X2,X3),zero)
| ~ greater(cardinality_at_time(X1,X3),zero)
| cardinality_at_time(esk3_2(X2,X3),X3) != zero
| selection_favors(X1,esk3_2(X2,X3),X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_31]),
[final] ).
cnf(c_0_94,negated_conjecture,
( ~ greater(cardinality_at_time(efficient_producers,appear(first_movers,esk1_0)),zero)
| cardinality_at_time(efficient_producers,appear(first_movers,esk1_0)) != zero
| selection_favors(efficient_producers,efficient_producers,appear(first_movers,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_41]),c_0_28])]),
[final] ).
cnf(c_0_95,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(first_movers,start_time(X1)),zero)
| cardinality_at_time(efficient_producers,start_time(X1)) != zero
| selection_favors(first_movers,efficient_producers,start_time(X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_36]),
[final] ).
cnf(c_0_96,plain,
( ~ environment(X1)
| ~ greater(cardinality_at_time(efficient_producers,start_time(X1)),zero)
| cardinality_at_time(efficient_producers,start_time(X1)) != zero
| selection_favors(efficient_producers,efficient_producers,start_time(X1)) ),
inference(spm,[status(thm)],[c_0_71,c_0_36]),
[final] ).
cnf(c_0_97,hypothesis,
( ~ greater(appear(first_movers,esk1_0),X1)
| ~ in_environment(esk1_0,X1)
| cardinality_at_time(an_organisation,X1) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_28])]),
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ in_environment(X1,appear(first_movers,esk1_0))
| ~ greater_or_equal(X2,esk2_0)
| in_environment(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]),
[final] ).
cnf(c_0_99,plain,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| cardinality_at_time(esk3_2(X1,X2),t) != zero ),
inference(spm,[status(thm)],[c_0_69,c_0_23]),
[final] ).
cnf(c_0_100,negated_conjecture,
cardinality_at_time(efficient_producers,t) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_76])]),
[final] ).
cnf(c_0_101,hypothesis,
efficient_producers != first_movers,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_39]),c_0_43]),c_0_27]),c_0_37]),c_0_28])]),
[final] ).
cnf(c_0_102,negated_conjecture,
selection_favors(efficient_producers,efficient_producers,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_76])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT033+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n004.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 01:21:49 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.46 % Version: 3.5.1
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % sh5l with pid 1953347 completed with status 1
% 0.16/0.46 % Result found by sh5l
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.46 % SubtermCWHack with pid 1953348 completed with status 1
% 0.16/0.46 % Result found by SubtermCWHack
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.46 % Preprocessing time : 0.002 s
% 0.16/0.46
% 0.16/0.46 % No proof found!
% 0.16/0.46 % SZS status CounterSatisfiable
% 0.16/0.46 % SZS output start Saturation
% See solution above
% 0.16/0.46 % Parsed axioms : 14
% 0.16/0.46 % Removed by relevancy pruning/SinE : 0
% 0.16/0.46 % Initial clauses : 20
% 0.16/0.46 % Removed in clause preprocessing : 0
% 0.16/0.46 % Initial clauses in saturation : 20
% 0.16/0.46 % Processed clauses : 83
% 0.16/0.46 % ...of these trivial : 0
% 0.16/0.46 % ...subsumed : 10
% 0.16/0.46 % ...remaining for further processing : 73
% 0.16/0.46 % Other redundant clauses eliminated : 0
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 5
% 0.16/0.46 % Backward-rewritten : 6
% 0.16/0.46 % Generated clauses : 75
% 0.16/0.46 % ...of the previous two non-redundant : 72
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 4
% 0.16/0.46 % Paramodulations : 74
% 0.16/0.46 % Factorizations : 1
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 0
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 103
% 0.16/0.46 % ...of those cached : 94
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 62
% 0.16/0.46 % Positive orientable unit clauses : 10
% 0.16/0.46 % Positive unorientable unit clauses: 0
% 0.16/0.46 % Negative unit clauses : 4
% 0.16/0.46 % Non-unit-clauses : 48
% 0.16/0.46 % Current number of unprocessed clauses: 0
% 0.16/0.46 % ...number of literals in the above : 0
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 11
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 589
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 94
% 0.16/0.46 % Non-unit clause-clause subsumptions : 14
% 0.16/0.46 % Unit Clause-clause subsumption calls : 84
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 5
% 0.16/0.46 % BW rewrite match successes : 2
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 4002
% 0.16/0.46 % Search garbage collected termcells : 352
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.010 s
% 0.16/0.46 % System time : 0.003 s
% 0.16/0.46 % Total time : 0.012 s
% 0.16/0.46 % Maximum resident set size: 3648 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.010 s
% 0.16/0.46 % System time : 0.009 s
% 0.16/0.46 % Total time : 0.019 s
% 0.16/0.46 % Maximum resident set size: 4864 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------