%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT028-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 : n016.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:06 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.52s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 6 unt; 15 nHn; 53 RR)
% Number of literals : 207 ( 0 equ; 143 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_first_movers_negative_growth_2,axiom,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| greater_or_equal(sk1(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_2) ).
cnf(l11_7,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk3(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_7) ).
cnf(mp_first_movers_negative_growth_1,axiom,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_1) ).
cnf(mp_first_movers_negative_growth_4,axiom,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3))
| greater_or_equal(sk1(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_4) ).
cnf(prove_l10_13,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| greater_or_equal(sk5(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_13) ).
cnf(prove_l10_14,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk5(X1)))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_14) ).
cnf(l11_9,hypothesis,
( ~ greater_or_equal(X2,sk3(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',l11_9) ).
cnf(prove_l10_12,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| subpopulations(first_movers,efficient_producers,sk4,sk5(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_12) ).
cnf(mp_first_movers_negative_growth_5,axiom,
( ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_5) ).
cnf(mp_first_movers_negative_growth_3,axiom,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_3) ).
cnf(prove_l10_11,negated_conjecture,
stable(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_11) ).
cnf(prove_l10_10,negated_conjecture,
environment(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_10) ).
cnf(mp_first_movers_negative_growth_6,axiom,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_6) ).
cnf(c_0_13,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| greater_or_equal(sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_2]) ).
cnf(c_0_14,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk3(X1)) ),
inference(fof_simplification,[status(thm)],[l11_7]) ).
cnf(c_0_15,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_1]) ).
cnf(c_0_16,plain,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3))
| greater_or_equal(sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| greater_or_equal(sk5(X1),X1) ),
inference(fof_simplification,[status(thm)],[prove_l10_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk5(X1)))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
inference(fof_simplification,[status(thm)],[prove_l10_14]) ).
cnf(c_0_19,hypothesis,
( ~ greater_or_equal(X2,sk3(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(fof_simplification,[status(thm)],[l11_9]) ).
cnf(c_0_20,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| greater_or_equal(sk1(X2,X1),X2) ),
c_0_13 ).
cnf(c_0_21,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,sk3(X1)) ),
c_0_14 ).
cnf(c_0_22,plain,
( ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
c_0_15 ).
cnf(c_0_23,plain,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3))
| greater_or_equal(sk1(X2,X1),X2) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| greater_or_equal(sk5(X1),X1) ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk5(X1)))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| subpopulations(first_movers,efficient_producers,sk4,sk5(X1)) ),
inference(fof_simplification,[status(thm)],[prove_l10_12]) ).
cnf(c_0_27,plain,
( ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_5]) ).
cnf(c_0_28,hypothesis,
( ~ greater_or_equal(X2,sk3(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2)) ),
c_0_19 ).
cnf(c_0_29,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| greater_or_equal(sk1(sk3(X1),X1),sk3(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| subpopulations(first_movers,efficient_producers,X1,sk1(sk3(X1),X1))
| greater(sk2(X1),appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_31,plain,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_3]) ).
cnf(c_0_32,negated_conjecture,
( ~ environment(X2)
| ~ stable(X2)
| ~ in_environment(X2,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,sk5(sk2(X2)))
| ~ greater(sk2(X2),appear(efficient_producers,sk4))
| greater_or_equal(sk1(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| subpopulations(first_movers,efficient_producers,sk4,sk5(X1)) ),
c_0_26 ).
cnf(c_0_34,negated_conjecture,
stable(sk4),
prove_l10_11 ).
cnf(c_0_35,negated_conjecture,
environment(sk4),
prove_l10_10 ).
cnf(c_0_36,plain,
( ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
c_0_27 ).
cnf(c_0_37,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(sk2(X1),appear(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,sk1(sk3(X1),X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_38,plain,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
c_0_31 ).
cnf(c_0_39,negated_conjecture,
( ~ in_environment(sk4,X1)
| ~ greater(sk2(sk4),appear(efficient_producers,sk4))
| greater_or_equal(sk1(X1,sk4),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_40,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]) ).
cnf(c_0_41,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,sk5(sk2(X1)))
| ~ greater(sk2(X1),appear(efficient_producers,sk4))
| subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_25]) ).
cnf(c_0_42,hypothesis,
( ~ in_environment(sk4,X1)
| greater_or_equal(sk1(X1,sk4),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34]),c_0_35])]) ).
cnf(c_0_43,negated_conjecture,
( ~ in_environment(sk4,X1)
| ~ greater(sk2(sk4),appear(efficient_producers,sk4))
| subpopulations(first_movers,efficient_producers,sk4,sk1(X1,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_44,plain,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_6]) ).
cnf(c_0_45,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(sk4,sk3(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,sk1(sk3(X1),sk4))
| greater(zero,growth_rate(first_movers,sk1(sk3(X1),sk4))) ),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_46,hypothesis,
( ~ in_environment(sk4,X1)
| subpopulations(first_movers,efficient_producers,sk4,sk1(X1,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_34]),c_0_35])]) ).
cnf(c_0_47,plain,
( ~ greater_or_equal(X3,sk2(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X3)) ),
c_0_44 ).
cnf(c_0_48,hypothesis,
( ~ in_environment(sk4,sk3(sk4))
| greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_34]),c_0_35])]) ).
cnf(c_0_49,hypothesis,
( ~ in_environment(sk4,sk3(sk4))
| ~ subpopulations(first_movers,efficient_producers,sk4,X1)
| ~ greater_or_equal(X1,sk2(sk4))
| greater(zero,growth_rate(first_movers,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34]),c_0_35])]) ).
cnf(c_0_50,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,sk4,X1)
| ~ greater_or_equal(X1,sk2(sk4))
| greater(zero,growth_rate(first_movers,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_21]),c_0_34]),c_0_35])]) ).
cnf(c_0_51,negated_conjecture,
~ greater(sk2(sk4),appear(efficient_producers,sk4)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_24]),c_0_33]),c_0_25]) ).
cnf(c_0_52,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_40]),c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT028-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n016.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 01:26:54 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.49 Running first-order theorem proving
% 0.24/0.49 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.24/0.52 % Version: 3.5.1
% 0.24/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.52 % Starting sh5l with 300s (1) cores
% 0.24/0.52 % new_bool_3 with pid 1271786 completed with status 0
% 0.24/0.52 % Result found by new_bool_3
% 0.24/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.52 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.24/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.52 % SubtermCWHack with pid 1271794 completed with status 0
% 0.24/0.52 % Result found by SubtermCWHack
% 0.24/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.52 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.24/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.52 % Preprocessing time : 0.001 s
% 0.24/0.52
% 0.24/0.52 % Proof found!
% 0.24/0.52 % SZS status Unsatisfiable
% 0.24/0.52 % SZS output start CNFRefutation
% See solution above
% 0.24/0.52 % Parsed axioms : 14
% 0.24/0.52 % Removed by relevancy pruning/SinE : 0
% 0.24/0.52 % Initial clauses : 14
% 0.24/0.52 % Removed in clause preprocessing : 0
% 0.24/0.52 % Initial clauses in saturation : 14
% 0.24/0.52 % Processed clauses : 37
% 0.24/0.52 % ...of these trivial : 0
% 0.24/0.52 % ...subsumed : 2
% 0.24/0.52 % ...remaining for further processing : 35
% 0.24/0.52 % Other redundant clauses eliminated : 0
% 0.24/0.52 % Clauses deleted for lack of memory : 0
% 0.24/0.52 % Backward-subsumed : 9
% 0.24/0.52 % Backward-rewritten : 0
% 0.24/0.52 % Generated clauses : 27
% 0.24/0.52 % ...of the previous two non-redundant : 26
% 0.24/0.52 % ...aggressively subsumed : 0
% 0.24/0.52 % Contextual simplify-reflections : 7
% 0.24/0.52 % Paramodulations : 27
% 0.24/0.52 % Factorizations : 0
% 0.24/0.52 % NegExts : 0
% 0.24/0.52 % Equation resolutions : 0
% 0.24/0.52 % Disequality decompositions : 0
% 0.24/0.52 % Total rewrite steps : 24
% 0.24/0.52 % ...of those cached : 22
% 0.24/0.52 % Propositional unsat checks : 0
% 0.24/0.52 % Propositional check models : 0
% 0.24/0.52 % Propositional check unsatisfiable : 0
% 0.24/0.52 % Propositional clauses : 0
% 0.24/0.52 % Propositional clauses after purity: 0
% 0.24/0.52 % Propositional unsat core size : 0
% 0.24/0.52 % Propositional preprocessing time : 0.000
% 0.24/0.52 % Propositional encoding time : 0.000
% 0.24/0.52 % Propositional solver time : 0.000
% 0.24/0.52 % Success case prop preproc time : 0.000
% 0.24/0.52 % Success case prop encoding time : 0.000
% 0.24/0.52 % Success case prop solver time : 0.000
% 0.24/0.52 % Current number of processed clauses : 26
% 0.24/0.52 % Positive orientable unit clauses : 2
% 0.24/0.52 % Positive unorientable unit clauses: 0
% 0.24/0.52 % Negative unit clauses : 2
% 0.24/0.52 % Non-unit-clauses : 22
% 0.24/0.52 % Current number of unprocessed clauses: 2
% 0.24/0.52 % ...number of literals in the above : 7
% 0.24/0.52 % Current number of archived formulas : 0
% 0.24/0.52 % Current number of archived clauses : 9
% 0.24/0.52 % Clause-clause subsumption calls (NU) : 300
% 0.24/0.52 % Rec. Clause-clause subsumption calls : 36
% 0.24/0.52 % Non-unit clause-clause subsumptions : 18
% 0.24/0.52 % Unit Clause-clause subsumption calls : 12
% 0.24/0.52 % Rewrite failures with RHS unbound : 0
% 0.24/0.52 % BW rewrite match attempts : 0
% 0.24/0.52 % BW rewrite match successes : 0
% 0.24/0.52 % Condensation attempts : 0
% 0.24/0.52 % Condensation successes : 0
% 0.24/0.52 % Termbank termtop insertions : 2060
% 0.24/0.52 % Search garbage collected termcells : 59
% 0.24/0.52
% 0.24/0.52 % -------------------------------------------------
% 0.24/0.52 % User time : 0.004 s
% 0.24/0.52 % System time : 0.002 s
% 0.24/0.52 % Total time : 0.006 s
% 0.24/0.52 % Maximum resident set size: 3592 pages
% 0.24/0.52
% 0.24/0.52 % -------------------------------------------------
% 0.24/0.52 % User time : 0.005 s
% 0.24/0.52 % System time : 0.007 s
% 0.24/0.52 % Total time : 0.012 s
% 0.24/0.52 % Maximum resident set size: 4608 pages
% 0.24/0.52 % E exiting
%------------------------------------------------------------------------------