%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT020+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 : n012.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:03 PM UTC 2026
% Result : Theorem 0.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 5 unt; 0 def)
% Number of atoms : 148 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 172 ( 68 ~; 68 |; 20 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_positive_function_difference,axiom,
! [X1,X2,X3,X4] :
( ( greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
& subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X2)
& greater_or_equal(X2,X3)
& environment(X1) )
=> ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
=> greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_function_difference) ).
fof(mp_times_in_order,axiom,
! [X1,X3,X4] :
( ( in_environment(X1,X4)
& greater(X4,X3)
& greater_or_equal(X3,start_time(X1))
& environment(X1) )
=> in_environment(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_times_in_order) ).
fof(mp_initial_time,axiom,
! [X1] :
( environment(X1)
=> greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_initial_time) ).
fof(mp_greater_or_equal,axiom,
! [X5,X6] :
( greater_or_equal(X5,X6)
=> ( X5 = X6
| greater(X5,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(mp_earliest_time_point,axiom,
! [X1,X2] :
( environment(X1)
=> ( ( subpopulations(first_movers,efficient_producers,X1,X2)
=> greater_or_equal(X2,initial_FM_EP(X1)) )
& ( in_environment(X1,initial_FM_EP(X1))
=> subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point) ).
fof(a8,hypothesis,
! [X1] :
( environment(X1)
=> greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a8) ).
fof(prove_l2,conjecture,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2) ).
fof(mp_time_point_occurs,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occurs) ).
fof(l3,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3) ).
fof(c_0_9,plain,
! [X1,X2,X3,X4] :
( ( greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
& subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X2)
& greater_or_equal(X2,X3)
& environment(X1) )
=> ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
=> greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4)) ) ),
inference(fof_simplification,[status(thm)],[mp_positive_function_difference]) ).
fof(c_0_10,plain,
! [X19,X20,X21] :
( in_environment(X19,X20)
| ~ in_environment(X19,X21)
| ~ greater(X21,X20)
| ~ greater_or_equal(X20,start_time(X19))
| ~ environment(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_times_in_order])])]) ).
fof(c_0_11,plain,
! [X18] :
( greater_or_equal(initial_FM_EP(X18),start_time(X18))
| ~ environment(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_initial_time])])]) ).
fof(c_0_12,plain,
! [X25,X26] :
( X25 = X26
| greater(X25,X26)
| ~ greater_or_equal(X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])]) ).
fof(c_0_13,plain,
! [X10,X11] :
( ( ~ environment(X10)
| greater_or_equal(X11,initial_FM_EP(X10))
| ~ subpopulations(first_movers,efficient_producers,X10,X11) )
& ( ~ environment(X10)
| subpopulations(first_movers,efficient_producers,X10,initial_FM_EP(X10))
| ~ in_environment(X10,initial_FM_EP(X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_earliest_time_point])])])]) ).
fof(c_0_14,plain,
! [X12,X13,X14,X15] :
( greater(disbanding_rate(first_movers,X15),disbanding_rate(efficient_producers,X15))
| decreases(difference(disbanding_rate(first_movers,X13),disbanding_rate(efficient_producers,X13)))
| ~ greater(disbanding_rate(first_movers,X14),disbanding_rate(efficient_producers,X14))
| ~ subpopulations(first_movers,efficient_producers,X12,X15)
| ~ greater_or_equal(X15,X13)
| ~ greater_or_equal(X13,X14)
| ~ environment(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_15,hypothesis,
! [X27] :
( greater(disbanding_rate(first_movers,initial_FM_EP(X27)),disbanding_rate(efficient_producers,initial_FM_EP(X27)))
| ~ environment(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a8])])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> greater(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)) ),
inference(assume_negation,[status(cth)],[prove_l2]) ).
cnf(c_0_17,plain,
( ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ environment(X1)
| greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| greater_or_equal(X2,initial_FM_EP(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X16,X17] :
( in_environment(X16,X17)
| ~ subpopulations(first_movers,efficient_producers,X16,X17)
| ~ environment(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occurs])])]) ).
cnf(c_0_22,plain,
( ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater_or_equal(X4,X2)
| ~ greater_or_equal(X2,X3)
| ~ environment(X1)
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,hypothesis,
( ~ environment(X1)
| greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,negated_conjecture,
( ~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& environment(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_25,plain,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(fof_simplification,[status(thm)],[l3]) ).
cnf(c_0_26,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(X2,initial_FM_EP(X1))
| in_environment(X1,initial_FM_EP(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(X1,initial_FM_EP(X2))
| X1 = initial_FM_EP(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,hypothesis,
( ~ environment(X3)
| ~ environment(X4)
| ~ subpopulations(first_movers,efficient_producers,X4,X1)
| ~ greater_or_equal(X1,X2)
| ~ greater_or_equal(X2,initial_FM_EP(X3))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X8,X9] :
( ~ decreases(difference(disbanding_rate(first_movers,X9),disbanding_rate(efficient_producers,X9)))
| ~ subpopulations(first_movers,efficient_producers,X8,X9)
| ~ environment(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
cnf(c_0_34,plain,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| in_environment(X2,initial_FM_EP(X2))
| X1 = initial_FM_EP(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( ~ environment(X2)
| ~ greater_or_equal(esk2_0,X1)
| ~ greater_or_equal(X1,initial_FM_EP(X2))
| decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_36,plain,
( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( ~ environment(X1)
| ~ in_environment(X1,initial_FM_EP(X1))
| subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,negated_conjecture,
( in_environment(esk1_0,initial_FM_EP(esk1_0))
| initial_FM_EP(esk1_0) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ greater_or_equal(esk2_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_20]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk1_0,initial_FM_EP(esk1_0))
| initial_FM_EP(esk1_0) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
( ~ greater_or_equal(esk2_0,initial_FM_EP(esk1_0))
| initial_FM_EP(esk1_0) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
initial_FM_EP(esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_20]),c_0_30]),c_0_31])]) ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_42]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT020+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 21 01:20:53 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1294504 completed with status 0
% 0.07/0.34 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.34 % No SInE strategy applied
% 0.07/0.34 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.07/0.34 % Starting new_bool_3 with 136s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 136s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1294509 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.34 % No SInE strategy applied
% 0.07/0.34 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Theorem
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.35 % Parsed axioms : 11
% 0.07/0.35 % Removed by relevancy pruning/SinE : 0
% 0.07/0.35 % Initial clauses : 14
% 0.07/0.35 % Removed in clause preprocessing : 0
% 0.07/0.35 % Initial clauses in saturation : 14
% 0.07/0.35 % Processed clauses : 61
% 0.07/0.35 % ...of these trivial : 0
% 0.07/0.35 % ...subsumed : 3
% 0.07/0.35 % ...remaining for further processing : 58
% 0.07/0.35 % Other redundant clauses eliminated : 0
% 0.07/0.35 % Clauses deleted for lack of memory : 0
% 0.07/0.35 % Backward-subsumed : 12
% 0.07/0.35 % Backward-rewritten : 16
% 0.07/0.35 % Generated clauses : 78
% 0.07/0.35 % ...of the previous two non-redundant : 66
% 0.07/0.35 % ...aggressively subsumed : 0
% 0.07/0.35 % Contextual simplify-reflections : 2
% 0.07/0.35 % Paramodulations : 78
% 0.07/0.35 % Factorizations : 0
% 0.07/0.35 % NegExts : 0
% 0.07/0.35 % Equation resolutions : 0
% 0.07/0.35 % Disequality decompositions : 0
% 0.07/0.35 % Total rewrite steps : 65
% 0.07/0.35 % ...of those cached : 62
% 0.07/0.35 % Propositional unsat checks : 0
% 0.07/0.35 % Propositional check models : 0
% 0.07/0.35 % Propositional check unsatisfiable : 0
% 0.07/0.35 % Propositional clauses : 0
% 0.07/0.35 % Propositional clauses after purity: 0
% 0.07/0.35 % Propositional unsat core size : 0
% 0.07/0.35 % Propositional preprocessing time : 0.000
% 0.07/0.35 % Propositional encoding time : 0.000
% 0.07/0.35 % Propositional solver time : 0.000
% 0.07/0.35 % Success case prop preproc time : 0.000
% 0.07/0.35 % Success case prop encoding time : 0.000
% 0.07/0.35 % Success case prop solver time : 0.000
% 0.07/0.35 % Current number of processed clauses : 30
% 0.07/0.35 % Positive orientable unit clauses : 3
% 0.07/0.35 % Positive unorientable unit clauses: 0
% 0.07/0.35 % Negative unit clauses : 2
% 0.07/0.35 % Non-unit-clauses : 25
% 0.07/0.35 % Current number of unprocessed clauses: 17
% 0.07/0.35 % ...number of literals in the above : 98
% 0.07/0.35 % Current number of archived formulas : 0
% 0.07/0.35 % Current number of archived clauses : 28
% 0.07/0.35 % Clause-clause subsumption calls (NU) : 373
% 0.07/0.35 % Rec. Clause-clause subsumption calls : 132
% 0.07/0.35 % Non-unit clause-clause subsumptions : 17
% 0.07/0.35 % Unit Clause-clause subsumption calls : 22
% 0.07/0.35 % Rewrite failures with RHS unbound : 0
% 0.07/0.35 % BW rewrite match attempts : 1
% 0.07/0.35 % BW rewrite match successes : 1
% 0.07/0.35 % Condensation attempts : 0
% 0.07/0.35 % Condensation successes : 0
% 0.07/0.35 % Termbank termtop insertions : 3659
% 0.07/0.35 % Search garbage collected termcells : 282
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.007 s
% 0.07/0.35 % System time : 0.001 s
% 0.07/0.35 % Total time : 0.008 s
% 0.07/0.35 % Maximum resident set size: 3648 pages
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.021 s
% 0.07/0.35 % System time : 0.006 s
% 0.07/0.35 % Total time : 0.027 s
% 0.07/0.35 % Maximum resident set size: 4864 pages
% 0.07/0.35 % E exiting
%------------------------------------------------------------------------------