%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT020+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:27:11 PM UTC 2026
% Result : Theorem 0.14s 0.60s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 5 unt; 0 def)
% Number of atoms : 149 ( 10 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 171 ( 67 ~; 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 : 74 ( 0 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_greater_or_equal,axiom,
! [X5,X6] :
( greater_or_equal(X5,X6)
=> ( X5 = X6
| greater(X5,X6) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mp_earliest_time_point) ).
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/sandbox/benchmark/theBenchmark.p',prove_l2) ).
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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',mp_initial_time) ).
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/sandbox/benchmark/theBenchmark.p',a8) ).
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/sandbox/benchmark/theBenchmark.p',l3) ).
fof(mp_time_point_occurs,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occurs) ).
fof(c_0_9,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_10,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_11,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]) ).
fof(c_0_12,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_13,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_14,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])])]) ).
cnf(c_0_15,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,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_10]) ).
fof(c_0_17,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_11])])])]) ).
fof(c_0_18,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_12])])]) ).
fof(c_0_19,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])])]) ).
cnf(c_0_20,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_13]) ).
cnf(c_0_21,plain,
( ~ environment(X1)
| greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,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_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,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_18]) ).
cnf(c_0_26,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_19]) ).
fof(c_0_27,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_28,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_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( greater(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_22,c_0_23]),c_0_24])]) ).
fof(c_0_30,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_31,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_25,c_0_26]) ).
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_17]) ).
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_27])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ in_environment(esk1_0,esk2_0)
| 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_28,c_0_29]),c_0_24])]) ).
cnf(c_0_35,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,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_31,c_0_23]),c_0_24])]),c_0_32]) ).
cnf(c_0_37,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_38,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_10]) ).
cnf(c_0_39,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_23]),c_0_24])]) ).
cnf(c_0_40,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_36,c_0_16]),c_0_37]) ).
cnf(c_0_41,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_38,c_0_39]),c_0_24])]) ).
cnf(c_0_42,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_40,c_0_41]),c_0_24])]) ).
cnf(c_0_43,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_42,c_0_16]),c_0_23]),c_0_24])]) ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_43]),c_0_24])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT020+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.53 % Computer : n003.cluster.edu
% 0.10/0.53 % Model : x86_64 x86_64
% 0.10/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.53 % Memory : 8046.5625MB
% 0.10/0.53 % OS : Linux 6.8.0-71-generic
% 0.10/0.53 % CPULimit : 300
% 0.10/0.53 % WCLimit : 300
% 0.10/0.53 % DateTime : Mon Sep 21 01:22:46 UTC 2026
% 0.10/0.53 % CPUTime :
% 0.10/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.57 Running first-order theorem proving
% 0.14/0.57 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.14/0.60 % Version: 3.5.1
% 0.14/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.60 % Starting sh5l with 300s (1) cores
% 0.14/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3090540 completed with status 0
% 0.14/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.60 % No SInE strategy applied
% 0.14/0.60 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.60 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3090547 completed with status 0
% 0.14/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.60 % No SInE strategy applied
% 0.14/0.60 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.60 % Preprocessing time : 0.001 s
% 0.14/0.60 % Presaturation interreduction done
% 0.14/0.60
% 0.14/0.60 % Proof found!
% 0.14/0.60 % SZS status Theorem
% 0.14/0.60 % SZS output start CNFRefutation
% See solution above
% 0.14/0.60 % Parsed axioms : 11
% 0.14/0.60 % Removed by relevancy pruning/SinE : 0
% 0.14/0.60 % Initial clauses : 14
% 0.14/0.60 % Removed in clause preprocessing : 0
% 0.14/0.60 % Initial clauses in saturation : 14
% 0.14/0.60 % Processed clauses : 68
% 0.14/0.60 % ...of these trivial : 0
% 0.14/0.60 % ...subsumed : 3
% 0.14/0.60 % ...remaining for further processing : 65
% 0.14/0.60 % Other redundant clauses eliminated : 0
% 0.14/0.60 % Clauses deleted for lack of memory : 0
% 0.14/0.60 % Backward-subsumed : 7
% 0.14/0.60 % Backward-rewritten : 17
% 0.14/0.60 % Generated clauses : 61
% 0.14/0.60 % ...of the previous two non-redundant : 52
% 0.14/0.60 % ...aggressively subsumed : 0
% 0.14/0.60 % Contextual simplify-reflections : 1
% 0.14/0.60 % Paramodulations : 61
% 0.14/0.60 % Factorizations : 0
% 0.14/0.60 % NegExts : 0
% 0.14/0.60 % Equation resolutions : 0
% 0.14/0.60 % Disequality decompositions : 0
% 0.14/0.60 % Total rewrite steps : 63
% 0.14/0.60 % ...of those cached : 60
% 0.14/0.60 % Propositional unsat checks : 0
% 0.14/0.60 % Propositional check models : 0
% 0.14/0.60 % Propositional check unsatisfiable : 0
% 0.14/0.60 % Propositional clauses : 0
% 0.14/0.60 % Propositional clauses after purity: 0
% 0.14/0.60 % Propositional unsat core size : 0
% 0.14/0.60 % Propositional preprocessing time : 0.000
% 0.14/0.60 % Propositional encoding time : 0.000
% 0.14/0.60 % Propositional solver time : 0.000
% 0.14/0.60 % Success case prop preproc time : 0.000
% 0.14/0.60 % Success case prop encoding time : 0.000
% 0.14/0.60 % Success case prop solver time : 0.000
% 0.14/0.60 % Current number of processed clauses : 27
% 0.14/0.60 % Positive orientable unit clauses : 3
% 0.14/0.60 % Positive unorientable unit clauses: 0
% 0.14/0.60 % Negative unit clauses : 2
% 0.14/0.60 % Non-unit-clauses : 22
% 0.14/0.60 % Current number of unprocessed clauses: 9
% 0.14/0.60 % ...number of literals in the above : 54
% 0.14/0.60 % Current number of archived formulas : 0
% 0.14/0.60 % Current number of archived clauses : 38
% 0.14/0.60 % Clause-clause subsumption calls (NU) : 305
% 0.14/0.60 % Rec. Clause-clause subsumption calls : 97
% 0.14/0.60 % Non-unit clause-clause subsumptions : 11
% 0.14/0.60 % Unit Clause-clause subsumption calls : 14
% 0.14/0.60 % Rewrite failures with RHS unbound : 0
% 0.14/0.60 % BW rewrite match attempts : 1
% 0.14/0.60 % BW rewrite match successes : 1
% 0.14/0.60 % Condensation attempts : 0
% 0.14/0.60 % Condensation successes : 0
% 0.14/0.60 % Termbank termtop insertions : 3357
% 0.14/0.60 % Search garbage collected termcells : 282
% 0.14/0.60
% 0.14/0.60 % -------------------------------------------------
% 0.14/0.60 % User time : 0.006 s
% 0.14/0.60 % System time : 0.004 s
% 0.14/0.60 % Total time : 0.010 s
% 0.14/0.60 % Maximum resident set size: 3648 pages
% 0.14/0.60
% 0.14/0.60 % -------------------------------------------------
% 0.14/0.60 % User time : 0.026 s
% 0.14/0.60 % System time : 0.008 s
% 0.14/0.60 % Total time : 0.034 s
% 0.14/0.60 % Maximum resident set size: 4608 pages
% 0.14/0.60 % E exiting
%------------------------------------------------------------------------------