%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM924^1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 : Wed Sep 30 08:17:12 AM UTC 2026
% Result : Theorem 0.19s 0.30s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 40 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 28 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 292 ( 8 ~; 0 |; 0 &; 284 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_23,type,
one_one_int: int ).
thf(decl_25,type,
plus_plus_int: int > int > int ).
thf(decl_27,type,
times_times_int: int > int > int ).
thf(decl_29,type,
zero_zero_int: int ).
thf(decl_32,type,
bit0: int > int ).
thf(decl_33,type,
bit1: int > int ).
thf(decl_34,type,
pls: int ).
thf(decl_35,type,
number_number_of_int: int > int ).
thf(decl_36,type,
number_number_of_nat: int > nat ).
thf(decl_37,type,
ord_less_int: int > int > $o ).
thf(decl_41,type,
power_power_int: int > nat > int ).
thf(decl_44,type,
m: int ).
thf(decl_45,type,
s: int ).
thf(decl_46,type,
t: int ).
thf(conj_0,conjecture,
ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int,
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',conj_0) ).
thf(fact_105_zero__is__num__zero,axiom,
( zero_zero_int
= ( number_number_of_int @ pls ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_105_zero__is__num__zero) ).
thf(fact_24_number__of__is__id,axiom,
! [X14: int] :
( ( number_number_of_int @ X14 )
= X14 ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_24_number__of__is__id) ).
thf(fact_18_add__special_I3_J,axiom,
! [X11: int] :
( ( plus_plus_int @ ( number_number_of_int @ X11 ) @ one_one_int )
= ( number_number_of_int @ ( plus_plus_int @ X11 @ ( bit1 @ pls ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_18_add__special_I3_J) ).
thf(fact_17_add__special_I2_J,axiom,
! [X10: int] :
( ( plus_plus_int @ one_one_int @ ( number_number_of_int @ X10 ) )
= ( number_number_of_int @ ( plus_plus_int @ ( bit1 @ pls ) @ X10 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_17_add__special_I2_J) ).
thf(fact_104_zadd__commute,axiom,
! [X15: int,X13: int] :
( ( plus_plus_int @ X15 @ X13 )
= ( plus_plus_int @ X13 @ X15 ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_104_zadd__commute) ).
thf(fact_67_mult__Bit0,axiom,
! [X14: int,X17: int] :
( ( times_times_int @ ( bit0 @ X14 ) @ X17 )
= ( bit0 @ ( times_times_int @ X14 @ X17 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_67_mult__Bit0) ).
thf(fact_25_zmult__commute,axiom,
! [X15: int,X13: int] :
( ( times_times_int @ X15 @ X13 )
= ( times_times_int @ X13 @ X15 ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_25_zmult__commute) ).
thf(fact_3_t,axiom,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_3_t) ).
thf(fact_66_mult__Pls,axiom,
! [X13: int] :
( ( times_times_int @ pls @ X13 )
= pls ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_66_mult__Pls) ).
thf(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
file('/export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
thf(c_0_11,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_12,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
thf(c_0_14,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,plain,
( zero_zero_int
= ( number_number_of_int @ pls ) ),
inference(split_conjunct,[status(thm)],[fact_105_zero__is__num__zero]) ).
thf(c_0_16,plain,
! [X243: int] :
( ( number_number_of_int @ X243 )
= X243 ),
inference(variable_rename,[status(thm)],[fact_24_number__of__is__id]) ).
thf(c_0_17,plain,
! [X240: int] :
( ( plus_plus_int @ ( number_number_of_int @ X240 ) @ one_one_int )
= ( number_number_of_int @ ( plus_plus_int @ X240 @ ( bit1 @ pls ) ) ) ),
inference(variable_rename,[status(thm)],[fact_18_add__special_I3_J]) ).
thf(c_0_18,plain,
! [X239: int] :
( ( plus_plus_int @ one_one_int @ ( number_number_of_int @ X239 ) )
= ( number_number_of_int @ ( plus_plus_int @ ( bit1 @ pls ) @ X239 ) ) ),
inference(variable_rename,[status(thm)],[fact_17_add__special_I2_J]) ).
thf(c_0_19,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ ( number_number_of_int @ pls ) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
! [X1: int] :
( ( number_number_of_int @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,plain,
! [X388: int,X389: int] :
( ( plus_plus_int @ X388 @ X389 )
= ( plus_plus_int @ X389 @ X388 ) ),
inference(variable_rename,[status(thm)],[fact_104_zadd__commute]) ).
thf(c_0_22,plain,
! [X316: int,X317: int] :
( ( times_times_int @ ( bit0 @ X316 ) @ X317 )
= ( bit0 @ ( times_times_int @ X316 @ X317 ) ) ),
inference(variable_rename,[status(thm)],[fact_67_mult__Bit0]) ).
thf(c_0_23,plain,
! [X1: int] :
( ( plus_plus_int @ ( number_number_of_int @ X1 ) @ one_one_int )
= ( number_number_of_int @ ( plus_plus_int @ X1 @ ( bit1 @ pls ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_24,plain,
! [X244: int,X245: int] :
( ( times_times_int @ X244 @ X245 )
= ( times_times_int @ X245 @ X244 ) ),
inference(variable_rename,[status(thm)],[fact_25_zmult__commute]) ).
thf(c_0_25,plain,
! [X1: int] :
( ( plus_plus_int @ one_one_int @ ( number_number_of_int @ X1 ) )
= ( number_number_of_int @ ( plus_plus_int @ ( bit1 @ pls ) @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_26,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ pls ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_27,plain,
! [X2: int,X1: int] :
( ( plus_plus_int @ X1 @ X2 )
= ( plus_plus_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_28,plain,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
thf(c_0_29,plain,
! [X1: int,X2: int] :
( ( times_times_int @ ( bit0 @ X1 ) @ X2 )
= ( bit0 @ ( times_times_int @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_30,plain,
! [X1: int] :
( ( plus_plus_int @ X1 @ one_one_int )
= ( plus_plus_int @ X1 @ ( bit1 @ pls ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_20]),c_0_20]) ).
thf(c_0_31,plain,
! [X2: int,X1: int] :
( ( times_times_int @ X1 @ X2 )
= ( times_times_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_32,plain,
! [X1: int] :
( ( plus_plus_int @ one_one_int @ X1 )
= ( plus_plus_int @ ( bit1 @ pls ) @ X1 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_20]),c_0_20]) ).
thf(c_0_33,plain,
! [X315: int] :
( ( times_times_int @ pls @ X315 )
= pls ),
inference(variable_rename,[status(thm)],[fact_66_mult__Pls]) ).
thf(c_0_34,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ pls ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_35,plain,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
thf(c_0_36,plain,
( ( times_times_int @ t @ ( plus_plus_int @ ( bit1 @ pls ) @ ( bit0 @ ( bit0 @ ( times_times_int @ ( bit1 @ pls ) @ m ) ) ) ) )
= ( plus_plus_int @ ( bit1 @ pls ) @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_20]),c_0_29]),c_0_29]),c_0_30]),c_0_27]),c_0_31]),c_0_27]),c_0_32]) ).
thf(c_0_37,plain,
! [X1: int] :
( ( times_times_int @ pls @ X1 )
= pls ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_38,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( bit1 @ pls ) @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ pls ),
inference(rw,[status(thm)],[c_0_34,c_0_32]) ).
thf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_20]),c_0_29]),c_0_29]),c_0_30]),c_0_27]),c_0_31]),c_0_36]),c_0_20]),c_0_29]),c_0_29]),c_0_30]),c_0_27]),c_0_15]),c_0_20]),c_0_31]),c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924^1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 % Computer : n007.cluster.edu
% 0.07/0.20 % Model : x86_64 x86_64
% 0.07/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20 % Memory : 8046.5625MB
% 0.07/0.20 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Tue Sep 29 13:03:25 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running higher-order theorem proving
% 0.19/0.26 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.oUPiaq3564/E---3.1_3327017.p
% 0.19/0.30 % Version: 3.5.1-ho
% 0.19/0.30 % Preprocessing class: HSLSSMSMSSSNFFN.
% 0.19/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.30 % Starting sh3 with 1500s (5) cores
% 0.19/0.30 % Starting lpo1_def_fix with 300s (1) cores
% 0.19/0.30 % Starting lpo8_s with 300s (1) cores
% 0.19/0.30 % Starting lpo1_lambda_fix with 300s (1) cores
% 0.19/0.30 % sh3 with pid 3327030 completed with status 0
% 0.19/0.30 % Result found by sh3
% 0.19/0.30 % Preprocessing class: HSLSSMSMSSSNFFN.
% 0.19/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.30 % Starting sh3 with 1500s (5) cores
% 0.19/0.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.30 % No SInE strategy applied
% 0.19/0.30 % Search class: HGHSM-FFMM21-DFFFFFNN
% 0.19/0.30 % partial match(2): FGHSM-FFMM21-SFFFFFNN
% 0.19/0.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.30 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.30 % Starting sh3 with 151s (1) cores
% 0.19/0.30 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.30 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.19/0.30 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.19/0.30 % sh3 with pid 3327035 completed with status 0
% 0.19/0.30 % Result found by sh3
% 0.19/0.30 % Preprocessing class: HSLSSMSMSSSNFFN.
% 0.19/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.30 % Starting sh3 with 1500s (5) cores
% 0.19/0.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.30 % No SInE strategy applied
% 0.19/0.30 % Search class: HGHSM-FFMM21-DFFFFFNN
% 0.19/0.30 % partial match(2): FGHSM-FFMM21-SFFFFFNN
% 0.19/0.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.30 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.30 % Starting sh3 with 151s (1) cores
% 0.19/0.30 % Preprocessing time : 0.002 s
% 0.19/0.30 % Presaturation interreduction done
% 0.19/0.30
% 0.19/0.30 % Proof found!
% 0.19/0.30 % SZS status Theorem
% 0.19/0.30 % SZS output start CNFRefutation
% See solution above
% 0.19/0.30 % Parsed axioms : 133
% 0.19/0.30 % Removed by relevancy pruning/SinE : 0
% 0.19/0.30 % Initial clauses : 185
% 0.19/0.30 % Removed in clause preprocessing : 34
% 0.19/0.30 % Initial clauses in saturation : 151
% 0.19/0.30 % Processed clauses : 166
% 0.19/0.30 % ...of these trivial : 23
% 0.19/0.30 % ...subsumed : 15
% 0.19/0.30 % ...remaining for further processing : 127
% 0.19/0.30 % Other redundant clauses eliminated : 11
% 0.19/0.30 % Clauses deleted for lack of memory : 0
% 0.19/0.30 % Backward-subsumed : 1
% 0.19/0.30 % Backward-rewritten : 11
% 0.19/0.30 % Generated clauses : 7
% 0.19/0.30 % ...of the previous two non-redundant : 15
% 0.19/0.30 % ...aggressively subsumed : 0
% 0.19/0.30 % Contextual simplify-reflections : 1
% 0.19/0.30 % Paramodulations : 0
% 0.19/0.30 % Factorizations : 0
% 0.19/0.30 % NegExts : 0
% 0.19/0.30 % Equation resolutions : 11
% 0.19/0.30 % Disequality decompositions : 0
% 0.19/0.30 % Total rewrite steps : 266
% 0.19/0.30 % ...of those cached : 232
% 0.19/0.30 % Propositional unsat checks : 0
% 0.19/0.30 % Propositional check models : 0
% 0.19/0.30 % Propositional check unsatisfiable : 0
% 0.19/0.30 % Propositional clauses : 0
% 0.19/0.30 % Propositional clauses after purity: 0
% 0.19/0.30 % Propositional unsat core size : 0
% 0.19/0.30 % Propositional preprocessing time : 0.000
% 0.19/0.30 % Propositional encoding time : 0.000
% 0.19/0.30 % Propositional solver time : 0.000
% 0.19/0.30 % Success case prop preproc time : 0.000
% 0.19/0.30 % Success case prop encoding time : 0.000
% 0.19/0.30 % Success case prop solver time : 0.000
% 0.19/0.30 % Current number of processed clauses : 108
% 0.19/0.30 % Positive orientable unit clauses : 33
% 0.19/0.30 % Positive unorientable unit clauses: 3
% 0.19/0.30 % Negative unit clauses : 5
% 0.19/0.30 % Non-unit-clauses : 67
% 0.19/0.30 % Current number of unprocessed clauses: 0
% 0.19/0.30 % ...number of literals in the above : 0
% 0.19/0.30 % Current number of archived formulas : 0
% 0.19/0.30 % Current number of archived clauses : 12
% 0.19/0.30 % Clause-clause subsumption calls (NU) : 856
% 0.19/0.30 % Rec. Clause-clause subsumption calls : 801
% 0.19/0.30 % Non-unit clause-clause subsumptions : 15
% 0.19/0.30 % Unit Clause-clause subsumption calls : 12
% 0.19/0.30 % Rewrite failures with RHS unbound : 0
% 0.19/0.30 % BW rewrite match attempts : 22
% 0.19/0.30 % BW rewrite match successes : 16
% 0.19/0.30 % Condensation attempts : 0
% 0.19/0.30 % Condensation successes : 0
% 0.19/0.30 % Termbank termtop insertions : 11730
% 0.19/0.30 % Search garbage collected termcells : 1880
% 0.19/0.30
% 0.19/0.30 % -------------------------------------------------
% 0.19/0.30 % User time : 0.014 s
% 0.19/0.30 % System time : 0.005 s
% 0.19/0.30 % Total time : 0.019 s
% 0.19/0.30 % Maximum resident set size: 4052 pages
% 0.19/0.30
% 0.19/0.30 % -------------------------------------------------
% 0.19/0.30 % User time : 0.043 s
% 0.19/0.30 % System time : 0.017 s
% 0.19/0.30 % Total time : 0.060 s
% 0.19/0.30 % Maximum resident set size: 5120 pages
% 0.19/0.30 % E exiting
%------------------------------------------------------------------------------