%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT027-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of clauses : 69 ( 10 unt; 19 nHn; 69 RR)
% Number of literals : 231 ( 10 equ; 151 neg)
% Maximal clause size : 7 ( 3 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 : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_long_stable_environments_28,axiom,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_long_stable_environments_28) ).
cnf(l10_35,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10_35) ).
cnf(mp_contracts_from_25,axiom,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater_or_equal(sk1(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from_25) ).
cnf(mp_EP_in_stable_environments_29,axiom,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_EP_in_stable_environments_29) ).
cnf(prove_l9_39,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,sk3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9_39) ).
cnf(prove_l9_38,negated_conjecture,
stable(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9_38) ).
cnf(prove_l9_37,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9_37) ).
cnf(mp_contracts_from_24,axiom,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater(cardinality_at_time(first_movers,sk1(X2,X1)),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from_24) ).
cnf(mp_greater_transitivity_30,axiom,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity_30) ).
cnf(mp_greater_or_equal_31,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_31) ).
cnf(l10_36,hypothesis,
( ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10_36) ).
cnf(t6_34,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_34) ).
cnf(mp_greater_or_equal_32,axiom,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_32) ).
cnf(mp_non_empty_fm_and_ep_27,axiom,
( ~ 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) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep_27) ).
cnf(mp_contracts_from_26,axiom,
( ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from_26) ).
cnf(c_0_15,plain,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
inference(fof_simplification,[status(thm)],[mp_long_stable_environments_28]) ).
cnf(c_0_16,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
inference(fof_simplification,[status(thm)],[l10_35]) ).
cnf(c_0_17,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater_or_equal(sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_contracts_from_25]) ).
cnf(c_0_18,plain,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater_or_equal(sk1(X2,X1),X2) ),
c_0_17 ).
cnf(c_0_21,hypothesis,
( ~ environment(X2)
| ~ environment(X1)
| ~ stable(X2)
| ~ stable(X1)
| ~ in_environment(X1,appear(efficient_producers,X2))
| in_environment(X1,sk2(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(efficient_producers,X1)) ),
inference(fof_simplification,[status(thm)],[mp_EP_in_stable_environments_29]) ).
cnf(c_0_23,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,sk3)) ),
inference(fof_simplification,[status(thm)],[prove_l9_39]) ).
cnf(c_0_24,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,appear(efficient_producers,X1))
| contracts_from(sk2(X1),first_movers)
| greater_or_equal(sk1(sk2(X1),X2),sk2(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(efficient_producers,X1)) ),
c_0_22 ).
cnf(c_0_26,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,sk3)) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
stable(sk3),
prove_l9_38 ).
cnf(c_0_28,negated_conjecture,
environment(sk3),
prove_l9_37 ).
cnf(c_0_29,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers)
| greater(cardinality_at_time(first_movers,sk1(X2,X1)),zero) ),
inference(fof_simplification,[status(thm)],[mp_contracts_from_24]) ).
cnf(c_0_30,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(fof_simplification,[status(thm)],[mp_greater_transitivity_30]) ).
cnf(c_0_31,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_31]) ).
cnf(c_0_32,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| contracts_from(sk2(X1),first_movers)
| greater_or_equal(sk1(sk2(X1),X1),sk2(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
~ contracts_from(sk2(sk3),first_movers),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_27]),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,sk1(X2,X1)),zero) ),
c_0_29 ).
cnf(c_0_35,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_30 ).
cnf(c_0_36,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
greater_or_equal(sk1(sk2(sk3),sk3),sk2(sk3)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_28])]),c_0_33]) ).
cnf(c_0_38,hypothesis,
( ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(fof_simplification,[status(thm)],[l10_36]) ).
cnf(c_0_39,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ stable(X1)
| ~ stable(X2)
| ~ in_environment(X2,appear(efficient_producers,X1))
| greater(cardinality_at_time(first_movers,sk1(sk2(X1),X2)),zero)
| contracts_from(sk2(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_40,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero) ),
inference(fof_simplification,[status(thm)],[t6_34]) ).
cnf(c_0_41,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_32]) ).
cnf(c_0_42,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,sk2(X2))
| greater(X1,appear(efficient_producers,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
( greater(sk1(sk2(sk3),sk3),sk2(sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,hypothesis,
( ~ greater_or_equal(X2,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2)) ),
c_0_38 ).
cnf(c_0_45,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(fof_simplification,[status(thm)],[mp_non_empty_fm_and_ep_27]) ).
cnf(c_0_46,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(first_movers,sk1(sk2(X1),X1)),zero)
| contracts_from(sk2(X1),first_movers) ),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_47,hypothesis,
( ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero) ),
c_0_40 ).
cnf(c_0_48,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
c_0_41 ).
cnf(c_0_49,hypothesis,
( greater(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_27]),c_0_28])]) ).
cnf(c_0_50,plain,
( ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers) ),
inference(fof_simplification,[status(thm)],[mp_contracts_from_26]) ).
cnf(c_0_51,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3))
| greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_27]),c_0_28])]) ).
cnf(c_0_52,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) ),
c_0_45 ).
cnf(c_0_53,negated_conjecture,
greater(cardinality_at_time(first_movers,sk1(sk2(sk3),sk3)),zero),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_27]),c_0_28])]),c_0_33]) ).
cnf(c_0_54,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_47,c_0_48]) ).
cnf(c_0_55,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,appear(efficient_producers,sk3))
| in_environment(X1,sk1(sk2(sk3),sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(spm,[status(thm)],[c_0_18,c_0_49]) ).
cnf(c_0_56,plain,
( ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| contracts_from(X2,first_movers) ),
c_0_50 ).
cnf(c_0_57,hypothesis,
( ~ in_environment(sk3,sk1(sk2(sk3),sk3))
| ~ greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero)
| greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_28])]),c_0_53])]) ).
cnf(c_0_58,hypothesis,
( ~ in_environment(sk3,sk1(sk2(sk3),sk3))
| greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero)
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_49]),c_0_28])]) ).
cnf(c_0_59,hypothesis,
( in_environment(sk3,sk1(sk2(sk3),sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_25]),c_0_27]),c_0_28])]) ).
cnf(c_0_60,hypothesis,
( ~ in_environment(sk3,sk2(sk3))
| ~ in_environment(sk3,sk1(sk2(sk3),sk3))
| ~ greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_27]),c_0_28])]),c_0_33]) ).
cnf(c_0_61,hypothesis,
( greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero)
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,hypothesis,
( ~ in_environment(sk3,sk2(sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_59]) ).
cnf(c_0_63,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,sk2(X1))
| greater(cardinality_at_time(efficient_producers,sk2(X1)),zero) ),
inference(spm,[status(thm)],[c_0_54,c_0_19]) ).
cnf(c_0_64,hypothesis,
( ~ in_environment(sk3,sk2(sk3))
| ~ greater(cardinality_at_time(efficient_producers,sk2(sk3)),zero) ),
inference(spm,[status(thm)],[c_0_60,c_0_62]) ).
cnf(c_0_65,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(cardinality_at_time(efficient_producers,sk2(X1)),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_21]),c_0_25]) ).
cnf(c_0_66,hypothesis,
~ in_environment(sk3,sk2(sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_27]),c_0_28])]) ).
cnf(c_0_67,hypothesis,
~ in_environment(sk3,appear(efficient_producers,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_21]),c_0_27]),c_0_28])]) ).
cnf(c_0_68,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_25]),c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT027-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.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:21:58 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1709725 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1709731 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44 % Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 16
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 16
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 16
% 0.15/0.44 % Processed clauses : 107
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 2
% 0.15/0.44 % ...remaining for further processing : 105
% 0.15/0.44 % Other redundant clauses eliminated : 1
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 6
% 0.15/0.44 % Backward-rewritten : 0
% 0.15/0.44 % Generated clauses : 97
% 0.15/0.44 % ...of the previous two non-redundant : 94
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 7
% 0.15/0.44 % Paramodulations : 96
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 1
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 40
% 0.15/0.44 % ...of those cached : 36
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 82
% 0.15/0.44 % Positive orientable unit clauses : 5
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 3
% 0.15/0.44 % Non-unit-clauses : 74
% 0.15/0.44 % Current number of unprocessed clauses: 14
% 0.15/0.44 % ...number of literals in the above : 80
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 22
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 1468
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 326
% 0.15/0.44 % Non-unit clause-clause subsumptions : 11
% 0.15/0.44 % Unit Clause-clause subsumption calls : 99
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 5
% 0.15/0.44 % BW rewrite match successes : 0
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 4100
% 0.15/0.44 % Search garbage collected termcells : 62
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.007 s
% 0.15/0.44 % System time : 0.004 s
% 0.15/0.44 % Total time : 0.011 s
% 0.15/0.44 % Maximum resident set size: 3644 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.029 s
% 0.15/0.44 % System time : 0.018 s
% 0.15/0.44 % Total time : 0.046 s
% 0.15/0.44 % Maximum resident set size: 4608 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------