%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT028+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 : n005.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.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 191 ( 0 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 267 ( 112 ~; 119 |; 27 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 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 : 56 ( 0 sgn 15 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_l10,conjecture,
! [X1] :
( ( stable(X1)
& environment(X1) )
=> ? [X5] :
( ! [X3] :
( ( greater_or_equal(X3,X5)
& subpopulations(first_movers,efficient_producers,X1,X3) )
=> greater(zero,growth_rate(first_movers,X3)) )
& greater(X5,appear(efficient_producers,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10) ).
fof(mp_first_movers_negative_growth,axiom,
! [X1] :
( ( ? [X2] :
( ! [X3] :
( ( greater_or_equal(X3,X2)
& subpopulations(first_movers,efficient_producers,X1,X3) )
=> greater(zero,growth_rate(first_movers,X3)) )
& in_environment(X1,X2) )
& stable(X1)
& environment(X1) )
=> ? [X4] :
( ! [X3] :
( ( greater_or_equal(X3,X4)
& subpopulations(first_movers,efficient_producers,X1,X3) )
=> greater(zero,growth_rate(first_movers,X3)) )
& greater(X4,appear(efficient_producers,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth) ).
fof(l11,hypothesis,
! [X1] :
( ( stable(X1)
& environment(X1) )
=> ? [X5] :
( ! [X3] :
( ( greater_or_equal(X3,X5)
& subpopulations(first_movers,efficient_producers,X1,X3) )
=> ( greater(zero,growth_rate(first_movers,X3))
& greater(growth_rate(efficient_producers,X3),zero) ) )
& in_environment(X1,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( stable(X1)
& environment(X1) )
=> ? [X5] :
( ! [X3] :
( ( greater_or_equal(X3,X5)
& subpopulations(first_movers,efficient_producers,X1,X3) )
=> greater(zero,growth_rate(first_movers,X3)) )
& greater(X5,appear(efficient_producers,X1)) ) ),
inference(assume_negation,[status(cth)],[prove_l10]) ).
fof(c_0_4,plain,
! [X12,X13,X16] :
( ( ~ stable(X12)
| ~ environment(X12)
| ~ in_environment(X12,X13)
| ~ greater(zero,growth_rate(first_movers,esk4_2(X12,X13)))
| greater(zero,growth_rate(first_movers,X16))
| ~ greater_or_equal(X16,esk5_1(X12))
| ~ subpopulations(first_movers,efficient_producers,X12,X16) )
& ( ~ stable(X12)
| ~ environment(X12)
| ~ in_environment(X12,X13)
| ~ greater(zero,growth_rate(first_movers,esk4_2(X12,X13)))
| greater(esk5_1(X12),appear(efficient_producers,X12)) )
& ( ~ stable(X12)
| ~ environment(X12)
| ~ in_environment(X12,X13)
| greater_or_equal(esk4_2(X12,X13),X13)
| greater(zero,growth_rate(first_movers,X16))
| ~ greater_or_equal(X16,esk5_1(X12))
| ~ subpopulations(first_movers,efficient_producers,X12,X16) )
& ( ~ stable(X12)
| ~ environment(X12)
| ~ in_environment(X12,X13)
| greater_or_equal(esk4_2(X12,X13),X13)
| greater(esk5_1(X12),appear(efficient_producers,X12)) )
& ( ~ stable(X12)
| ~ environment(X12)
| ~ in_environment(X12,X13)
| subpopulations(first_movers,efficient_producers,X12,esk4_2(X12,X13))
| greater(zero,growth_rate(first_movers,X16))
| ~ greater_or_equal(X16,esk5_1(X12))
| ~ subpopulations(first_movers,efficient_producers,X12,X16) )
& ( ~ stable(X12)
| ~ environment(X12)
| ~ in_environment(X12,X13)
| subpopulations(first_movers,efficient_producers,X12,esk4_2(X12,X13))
| greater(esk5_1(X12),appear(efficient_producers,X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_first_movers_negative_growth])])])])])]) ).
fof(c_0_5,hypothesis,
! [X6,X8] :
( ( ~ stable(X6)
| ~ environment(X6)
| ~ greater_or_equal(X8,esk1_1(X6))
| ~ subpopulations(first_movers,efficient_producers,X6,X8)
| greater(zero,growth_rate(first_movers,X8)) )
& ( ~ stable(X6)
| ~ environment(X6)
| ~ greater_or_equal(X8,esk1_1(X6))
| ~ subpopulations(first_movers,efficient_producers,X6,X8)
| greater(growth_rate(efficient_producers,X8),zero) )
& ( ~ stable(X6)
| ~ environment(X6)
| in_environment(X6,esk1_1(X6)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l11])])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X10] :
( ( ~ greater(X10,appear(efficient_producers,esk2_0))
| ~ greater(zero,growth_rate(first_movers,esk3_1(X10))) )
& ( ~ greater(X10,appear(efficient_producers,esk2_0))
| greater_or_equal(esk3_1(X10),X10) )
& ( ~ greater(X10,appear(efficient_producers,esk2_0))
| subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X10)) )
& stable(esk2_0)
& environment(esk2_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
cnf(c_0_7,plain,
( ~ stable(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| greater_or_equal(esk4_2(X1,X2),X2)
| greater(esk5_1(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ stable(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,X2))
| greater(esk5_1(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ stable(X1)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ greater_or_equal(X2,esk5_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater_or_equal(esk4_2(X1,X3),X3)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,esk2_0))
| greater_or_equal(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,esk2_0))
| ~ greater(zero,growth_rate(first_movers,esk3_1(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
( ~ stable(X2)
| ~ environment(X2)
| ~ greater_or_equal(X1,esk1_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater_or_equal(esk4_2(X1,esk1_1(X1)),esk1_1(X1))
| greater(esk5_1(X1),appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,esk1_1(X1)))
| greater(esk5_1(X1),appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,esk3_1(esk5_1(X1)))
| ~ greater(esk5_1(X1),appear(efficient_producers,esk2_0))
| greater_or_equal(esk4_2(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,esk2_0))
| subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
stable(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
environment(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( ~ stable(X1)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,esk4_2(X1,X2)))
| greater(esk5_1(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk5_1(X1),appear(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,esk4_2(X1,esk1_1(X1)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_22,plain,
( ~ stable(X1)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ greater_or_equal(X2,esk5_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,X3))
| greater(zero,growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( ~ in_environment(esk2_0,X1)
| ~ greater(esk5_1(esk2_0),appear(efficient_producers,esk2_0))
| greater_or_equal(esk4_2(esk2_0,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_24,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk5_1(X1),appear(efficient_producers,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,esk3_1(esk5_1(X1)))
| ~ greater(esk5_1(X1),appear(efficient_producers,esk2_0))
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_11]),c_0_12]) ).
cnf(c_0_26,hypothesis,
( ~ in_environment(esk2_0,X1)
| greater_or_equal(esk4_2(esk2_0,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
( ~ in_environment(esk2_0,X1)
| ~ greater(esk5_1(esk2_0),appear(efficient_producers,esk2_0))
| subpopulations(first_movers,efficient_producers,esk2_0,esk4_2(esk2_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_28,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(esk2_0,esk1_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,esk4_2(esk2_0,esk1_1(X1)))
| greater(zero,growth_rate(first_movers,esk4_2(esk2_0,esk1_1(X1)))) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_29,hypothesis,
( ~ in_environment(esk2_0,X1)
| subpopulations(first_movers,efficient_producers,esk2_0,esk4_2(esk2_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_18]),c_0_19])]) ).
cnf(c_0_30,plain,
( ~ stable(X1)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ greater(zero,growth_rate(first_movers,esk4_2(X1,X3)))
| ~ greater_or_equal(X2,esk5_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater(zero,growth_rate(first_movers,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_31,hypothesis,
( ~ in_environment(esk2_0,esk1_1(esk2_0))
| greater(zero,growth_rate(first_movers,esk4_2(esk2_0,esk1_1(esk2_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]),c_0_19])]) ).
cnf(c_0_32,hypothesis,
( ~ in_environment(esk2_0,esk1_1(esk2_0))
| ~ subpopulations(first_movers,efficient_producers,esk2_0,X1)
| ~ greater_or_equal(X1,esk5_1(esk2_0))
| 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_30,c_0_31]),c_0_18]),c_0_19])]) ).
cnf(c_0_33,hypothesis,
( ~ subpopulations(first_movers,efficient_producers,esk2_0,X1)
| ~ greater_or_equal(X1,esk5_1(esk2_0))
| 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_32,c_0_8]),c_0_18]),c_0_19])]) ).
cnf(c_0_34,negated_conjecture,
~ greater(esk5_1(esk2_0),appear(efficient_producers,esk2_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_11]),c_0_17]),c_0_12]) ).
cnf(c_0_35,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT028+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n005.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:22:04 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.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_1 with pid 2236924 completed with status 0
% 0.12/0.42 % Result found by new_bool_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 % (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: FGHNF-FFMF21-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 2236926 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 % Starting new_bool_1 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: FGHNF-FFMF21-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 Theorem
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 3
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 14
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 14
% 0.12/0.42 % Processed clauses : 39
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 3
% 0.12/0.42 % ...remaining for further processing : 36
% 0.12/0.42 % Other redundant clauses eliminated : 0
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 9
% 0.12/0.42 % Backward-rewritten : 0
% 0.12/0.42 % Generated clauses : 28
% 0.12/0.42 % ...of the previous two non-redundant : 27
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 8
% 0.12/0.42 % Paramodulations : 28
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 0
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 26
% 0.12/0.42 % ...of those cached : 24
% 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 : 27
% 0.12/0.42 % Positive orientable unit clauses : 2
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 2
% 0.12/0.42 % Non-unit-clauses : 23
% 0.12/0.42 % Current number of unprocessed clauses: 1
% 0.12/0.42 % ...number of literals in the above : 4
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 9
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 294
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 48
% 0.12/0.42 % Non-unit clause-clause subsumptions : 20
% 0.12/0.42 % Unit Clause-clause subsumption calls : 8
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 0
% 0.12/0.42 % BW rewrite match successes : 0
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 2448
% 0.12/0.42 % Search garbage collected termcells : 284
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.004 s
% 0.12/0.42 % System time : 0.004 s
% 0.12/0.42 % Total time : 0.008 s
% 0.12/0.42 % Maximum resident set size: 3636 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.005 s
% 0.12/0.42 % System time : 0.009 s
% 0.12/0.42 % Total time : 0.014 s
% 0.12/0.42 % Maximum resident set size: 4864 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------