%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT026-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of clauses : 64 ( 13 unt; 9 nHn; 64 RR)
% Number of literals : 198 ( 18 equ; 130 neg)
% Maximal clause size : 6 ( 3 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 : 107 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_greater_or_equal_36,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_36) ).
cnf(mp_critical_point_after_EP_34,axiom,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_critical_point_after_EP_34) ).
cnf(t6_41,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/sandbox/benchmark/theBenchmark.p',t6_41) ).
cnf(mp_greater_or_equal_37,axiom,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_37) ).
cnf(mp_greater_transitivity_35,axiom,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity_35) ).
cnf(d1_40,hypothesis,
( ~ greater(X3,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| X2 != critical_point(X1)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_40) ).
cnf(prove_l8_44,negated_conjecture,
greater(sk2,critical_point(sk1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_44) ).
cnf(prove_l8_43,negated_conjecture,
in_environment(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_43) ).
cnf(prove_l8_42,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_42) ).
cnf(mp_non_empty_fm_and_ep_30,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/sandbox/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep_30) ).
cnf(mp1_high_growth_rates_28,axiom,
( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| selection_favors(X3,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp1_high_growth_rates_28) ).
cnf(prove_l8_45,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l8_45) ).
cnf(mp_first_movers_exist_31,axiom,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(cardinality_at_time(first_movers,X2),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_first_movers_exist_31) ).
cnf(mp2_favour_members_29,axiom,
( 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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp2_favour_members_29) ).
cnf(mp_subpopulations_32,axiom,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_subpopulations_32) ).
cnf(mp_subpopulations_33,axiom,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_subpopulations_33) ).
cnf(c_0_16,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_36]) ).
cnf(c_0_17,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),appear(efficient_producers,X1)) ),
inference(fof_simplification,[status(thm)],[mp_critical_point_after_EP_34]) ).
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(fof_simplification,[status(thm)],[t6_41]) ).
cnf(c_0_19,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_37]) ).
cnf(c_0_20,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(fof_simplification,[status(thm)],[mp_greater_transitivity_35]) ).
cnf(c_0_21,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),appear(efficient_producers,X1)) ),
c_0_17 ).
cnf(c_0_23,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_18 ).
cnf(c_0_24,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
c_0_19 ).
cnf(c_0_25,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_20 ).
cnf(c_0_26,plain,
( ~ environment(X1)
| greater(critical_point(X1),appear(efficient_producers,X1))
| appear(efficient_producers,X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,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_23,c_0_24]) ).
cnf(c_0_28,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_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
( ~ greater(X3,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| X2 != critical_point(X1)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ),
inference(fof_simplification,[status(thm)],[d1_40]) ).
cnf(c_0_30,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_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
greater(sk2,critical_point(sk1)),
prove_l8_44 ).
cnf(c_0_32,negated_conjecture,
in_environment(sk1,sk2),
prove_l8_43 ).
cnf(c_0_33,negated_conjecture,
environment(sk1),
prove_l8_42 ).
cnf(c_0_34,hypothesis,
( ~ greater(X3,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| X2 != critical_point(X1)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ),
c_0_29 ).
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(fof_simplification,[status(thm)],[mp_non_empty_fm_and_ep_30]) ).
cnf(c_0_36,negated_conjecture,
( greater(cardinality_at_time(efficient_producers,sk2),zero)
| appear(efficient_producers,sk1) = critical_point(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_37,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_34]) ).
cnf(c_0_38,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_35 ).
cnf(c_0_39,hypothesis,
( ~ greater(X1,critical_point(sk1))
| ~ in_environment(sk1,X1)
| greater(cardinality_at_time(efficient_producers,X1),zero)
| greater(cardinality_at_time(efficient_producers,sk2),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_36]),c_0_33])]) ).
cnf(c_0_40,plain,
( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| selection_favors(X3,X2,X4) ),
inference(fof_simplification,[status(thm)],[mp1_high_growth_rates_28]) ).
cnf(c_0_41,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_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
greater(cardinality_at_time(efficient_producers,sk2),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_32])]) ).
cnf(c_0_43,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk2),
inference(fof_simplification,[status(thm)],[prove_l8_45]) ).
cnf(c_0_44,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(cardinality_at_time(first_movers,X2),zero) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_exist_31]) ).
cnf(c_0_45,plain,
( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
| ~ subpopulations(X2,X3,X1,X4)
| ~ environment(X1)
| selection_favors(X3,X2,X4) ),
c_0_40 ).
cnf(c_0_46,negated_conjecture,
( ~ greater(cardinality_at_time(first_movers,sk2),zero)
| greater(growth_rate(efficient_producers,sk2),growth_rate(first_movers,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_32]),c_0_42]),c_0_33])]) ).
cnf(c_0_47,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk2),
c_0_43 ).
cnf(c_0_48,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(cardinality_at_time(first_movers,X2),zero) ),
c_0_44 ).
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(fof_simplification,[status(thm)],[mp2_favour_members_29]) ).
cnf(c_0_50,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_subpopulations_32]) ).
cnf(c_0_51,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,sk2)
| ~ greater(cardinality_at_time(first_movers,sk2),zero) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_52,negated_conjecture,
greater_or_equal(cardinality_at_time(first_movers,sk2),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_33])]) ).
cnf(c_0_53,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) ),
c_0_49 ).
cnf(c_0_54,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
c_0_50 ).
cnf(c_0_55,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_subpopulations_33]) ).
cnf(c_0_56,negated_conjecture,
( ~ environment(X1)
| ~ greater(cardinality_at_time(first_movers,sk2),zero)
| ~ in_environment(X1,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_38]),c_0_42])]) ).
cnf(c_0_57,negated_conjecture,
( greater(cardinality_at_time(first_movers,sk2),zero)
| cardinality_at_time(first_movers,sk2) = zero ),
inference(spm,[status(thm)],[c_0_21,c_0_52]) ).
cnf(c_0_58,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_53,c_0_54]) ).
cnf(c_0_59,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
c_0_55 ).
cnf(c_0_60,negated_conjecture,
( ~ environment(X1)
| ~ in_environment(X1,sk2)
| cardinality_at_time(first_movers,sk2) = zero ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,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_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
cardinality_at_time(first_movers,sk2) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_32]),c_0_33])]) ).
cnf(c_0_63,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_61,c_0_32]),c_0_62]),c_0_42]),c_0_33])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT026-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 01:25:08 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % new_bool_3 with pid 1064271 completed with status 0
% 0.12/0.42 % Result found by new_bool_3
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % SubtermCWHack with pid 1064277 completed with status 0
% 0.12/0.42 % Result found by SubtermCWHack
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Unsatisfiable
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 18
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 18
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 18
% 0.12/0.42 % Processed clauses : 66
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 7
% 0.12/0.42 % ...remaining for further processing : 59
% 0.12/0.42 % Other redundant clauses eliminated : 3
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 3
% 0.12/0.42 % Backward-rewritten : 12
% 0.12/0.42 % Generated clauses : 57
% 0.12/0.42 % ...of the previous two non-redundant : 57
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 0
% 0.12/0.42 % Paramodulations : 54
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 3
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 46
% 0.12/0.42 % ...of those cached : 40
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 41
% 0.12/0.42 % Positive orientable unit clauses : 6
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 2
% 0.12/0.42 % Non-unit-clauses : 33
% 0.12/0.42 % Current number of unprocessed clauses: 3
% 0.12/0.42 % ...number of literals in the above : 13
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 15
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 355
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 119
% 0.12/0.42 % Non-unit clause-clause subsumptions : 6
% 0.12/0.42 % Unit Clause-clause subsumption calls : 27
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 2
% 0.12/0.42 % BW rewrite match successes : 2
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 2199
% 0.12/0.42 % Search garbage collected termcells : 69
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.004 s
% 0.12/0.42 % System time : 0.003 s
% 0.12/0.42 % Total time : 0.007 s
% 0.12/0.42 % Maximum resident set size: 3648 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.006 s
% 0.12/0.42 % System time : 0.006 s
% 0.12/0.42 % Total time : 0.013 s
% 0.12/0.42 % Maximum resident set size: 4864 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------