TSTP Solution File: ITP256_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP256_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:54 EDT 2024
% Result : Theorem 59.44s 22.85s
% Output : CNFRefutation 59.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 43
% Syntax : Number of formulae : 64 ( 18 unt; 35 typ; 0 def)
% Number of atoms : 56 ( 13 equ)
% Maximal formula atoms : 12 ( 1 avg)
% Number of connectives : 49 ( 22 ~; 15 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 13 ( 12 usr)
% Number of type conns : 22 ( 13 >; 9 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 10 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort2,type,
nat: $tType ).
tff(decl_sort3,type,
fun_nat_fun_nat_bool: $tType ).
tff(decl_sort4,type,
fun_nat_bool: $tType ).
tff(decl_sort5,type,
fun_nat_nat: $tType ).
tff(decl_sort6,type,
set_VEBT_VEBT: $tType ).
tff(decl_sort7,type,
vEBT_VEBT: $tType ).
tff(decl_sort8,type,
fun_VE3763956218935105199t_bool: $tType ).
tff(decl_sort9,type,
fun_VE7346385682144900493T_bool: $tType ).
tff(decl_sort10,type,
bool: $tType ).
tff(decl_sort11,type,
list_VEBT_VEBT: $tType ).
tff(decl_sort12,type,
fun_se448528567104302406T_bool: $tType ).
tff(decl_1258,type,
set_VEBT_VEBT2: list_VEBT_VEBT > set_VEBT_VEBT ).
tff(decl_1308,type,
nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1399,type,
size_s6755466524823107622T_VEBT: list_VEBT_VEBT > nat ).
tff(decl_1492,type,
ord_less_nat: fun_nat_fun_nat_bool ).
tff(decl_1868,type,
vEBT_V8194947554948674370ptions: fun_VE3763956218935105199t_bool ).
tff(decl_1869,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1878,type,
vEBT_invar_vebt: vEBT_VEBT > fun_nat_bool ).
tff(decl_1882,type,
vEBT_vebt_delete: ( vEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_2013,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_2015,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_2041,type,
aa_nat_fun_nat_bool: ( fun_nat_fun_nat_bool * nat ) > fun_nat_bool ).
tff(decl_2043,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_2177,type,
aa_set8260762808118238015T_bool: ( fun_se448528567104302406T_bool * set_VEBT_VEBT ) > bool ).
tff(decl_2181,type,
aa_VEB4832260192069861672t_bool: ( fun_VE3763956218935105199t_bool * vEBT_VEBT ) > fun_nat_bool ).
tff(decl_2183,type,
aa_VEB289770264548726718T_bool: ( fun_VE7346385682144900493T_bool * vEBT_VEBT ) > fun_se448528567104302406T_bool ).
tff(decl_2407,type,
fFalse: bool ).
tff(decl_2409,type,
fTrue: bool ).
tff(decl_2469,type,
member_VEBT_VEBT: fun_VE7346385682144900493T_bool ).
tff(decl_2474,type,
pp: bool > $o ).
tff(decl_2477,type,
ma: nat ).
tff(decl_2480,type,
na: nat ).
tff(decl_2482,type,
treeList: list_VEBT_VEBT ).
tff(decl_2483,type,
xa: nat ).
tff(conj_0,conjecture,
pp(aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))),na)),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',conj_0) ).
tff(fact_23__C4_OIH_C_I1_J,axiom,
! [X11: vEBT_VEBT] :
( pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X11),set_VEBT_VEBT2(treeList)))
=> ( pp(aa_nat_bool(vEBT_invar_vebt(X11),na))
& ! [X13: nat,X14: nat] :
( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_delete(X11,X13)),X14))
<=> ( ( X13 != X14 )
& pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X11),X14)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',fact_23__C4_OIH_C_I1_J) ).
tff(fact_137_nth__mem,axiom,
! [X7: nat,X16: list_VEBT_VEBT] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X7),size_s6755466524823107622T_VEBT(X16)))
=> pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,nth_VEBT_VEBT(X16,X7)),set_VEBT_VEBT2(X16))) ),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',fact_137_nth__mem) ).
tff(fact_2_True,axiom,
xa = ma,
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',fact_2_True) ).
tff(help_If_3_1_If_001t__Product____Type__Oprod_It__Code____Numeral__Ointeger_Mt__Code____Numeral__Ointeger_J_T,axiom,
! [X19725: bool] :
( ( X19725 = fTrue )
| ( X19725 = fFalse ) ),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',help_If_3_1_If_001t__Product____Type__Oprod_It__Code____Numeral__Ointeger_Mt__Code____Numeral__Ointeger_J_T) ).
tff(help_fFalse_1_1_U,axiom,
~ pp(fFalse),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',help_fFalse_1_1_U) ).
tff(help_fTrue_1_1_U,axiom,
pp(fTrue),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',help_fTrue_1_1_U) ).
tff(fact_8__092_060open_062high_Ax_An_A_060_Alength_AtreeList_092_060close_062,axiom,
pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),size_s6755466524823107622T_VEBT(treeList))),
file('/export/starexec/sandbox2/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p',fact_8__092_060open_062high_Ax_An_A_060_Alength_AtreeList_092_060close_062) ).
tff(c_0_8,negated_conjecture,
~ pp(aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))),na)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
tff(c_0_9,plain,
! [X11: vEBT_VEBT] :
( pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X11),set_VEBT_VEBT2(treeList)))
=> ( pp(aa_nat_bool(vEBT_invar_vebt(X11),na))
& ! [X13: nat,X14: nat] :
( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_delete(X11,X13)),X14))
<=> ( ( X13 != X14 )
& pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X11),X14)) ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_23__C4_OIH_C_I1_J]) ).
tff(c_0_10,negated_conjecture,
~ pp(aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))),na)),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
tff(c_0_11,plain,
! [X19744: vEBT_VEBT,X19745: nat,X19746: nat] :
( ( pp(aa_nat_bool(vEBT_invar_vebt(X19744),na))
| ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X19744),set_VEBT_VEBT2(treeList))) )
& ( ( X19745 != X19746 )
| ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_delete(X19744,X19745)),X19746))
| ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X19744),set_VEBT_VEBT2(treeList))) )
& ( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X19744),X19746))
| ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_delete(X19744,X19745)),X19746))
| ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X19744),set_VEBT_VEBT2(treeList))) )
& ( ( X19745 = X19746 )
| ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X19744),X19746))
| pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_delete(X19744,X19745)),X19746))
| ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X19744),set_VEBT_VEBT2(treeList))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
tff(c_0_12,plain,
! [X20420: nat,X20421: list_VEBT_VEBT] :
( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X20420),size_s6755466524823107622T_VEBT(X20421)))
| pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,nth_VEBT_VEBT(X20421,X20420)),set_VEBT_VEBT2(X20421))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_137_nth__mem])])]) ).
tcf(c_0_13,negated_conjecture,
~ pp(aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))),na)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_14,plain,
xa = ma,
inference(split_conjunct,[status(thm)],[fact_2_True]) ).
tff(c_0_15,plain,
! [X22033: bool] :
( ( X22033 = fTrue )
| ( X22033 = fFalse ) ),
inference(variable_rename,[status(thm)],[help_If_3_1_If_001t__Product____Type__Oprod_It__Code____Numeral__Ointeger_Mt__Code____Numeral__Ointeger_J_T]) ).
tff(c_0_16,plain,
~ pp(fFalse),
inference(fof_simplification,[status(thm)],[help_fFalse_1_1_U]) ).
tcf(c_0_17,plain,
! [X1: vEBT_VEBT] :
( pp(aa_nat_bool(vEBT_invar_vebt(X1),na))
| ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X1),set_VEBT_VEBT2(treeList))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,plain,
! [X2: nat,X5: list_VEBT_VEBT] :
( pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,nth_VEBT_VEBT(X5,X2)),set_VEBT_VEBT2(X5)))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X2),size_s6755466524823107622T_VEBT(X5))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_19,negated_conjecture,
~ pp(aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,ma),na))),na)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_20,plain,
! [X19: bool] :
( ( X19 = fTrue )
| ( X19 = fFalse ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_21,plain,
pp(fTrue),
inference(split_conjunct,[status(thm)],[help_fTrue_1_1_U]) ).
tcf(c_0_22,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),size_s6755466524823107622T_VEBT(treeList))),
inference(split_conjunct,[status(thm)],[fact_8__092_060open_062high_Ax_An_A_060_Alength_AtreeList_092_060close_062]) ).
tff(c_0_23,plain,
~ pp(fFalse),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
tcf(c_0_24,plain,
! [X2: nat] :
( pp(aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,X2)),na))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X2),size_s6755466524823107622T_VEBT(treeList))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_25,negated_conjecture,
aa_nat_bool(vEBT_invar_vebt(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,ma),na))),na) = fFalse,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
tcf(c_0_26,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,ma),na)),size_s6755466524823107622T_VEBT(treeList))),
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
tcf(c_0_27,plain,
~ pp(fFalse),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 8.04/8.13 % Problem : ITP256_1 : TPTP v8.1.2. Released v8.0.0.
% 8.04/8.15 % Command : run_E %s %d THM
% 8.16/8.35 % Computer : n019.cluster.edu
% 8.16/8.35 % Model : x86_64 x86_64
% 8.16/8.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 8.16/8.35 % Memory : 8042.1875MB
% 8.16/8.35 % OS : Linux 3.10.0-693.el7.x86_64
% 8.16/8.35 % CPULimit : 300
% 8.16/8.35 % WCLimit : 300
% 8.16/8.35 % DateTime : Fri May 3 12:49:52 EDT 2024
% 8.16/8.35 % CPUTime :
% 16.11/16.32 Running first-order theorem proving
% 16.11/16.32 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/tmp/tmp.FjO6xSAUKI/E---3.1_20130.p
% 59.44/22.85 # Version: 3.1.0
% 59.44/22.85 # Preprocessing class: FMLLSMLLSSSNFFN.
% 59.44/22.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.44/22.85 # Starting new_bool_3 with 900s (3) cores
% 59.44/22.85 # Starting new_bool_1 with 900s (3) cores
% 59.44/22.85 # Starting sh5l with 300s (1) cores
% 59.44/22.85 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 59.44/22.85 # new_bool_1 with pid 20210 completed with status 0
% 59.44/22.85 # Result found by new_bool_1
% 59.44/22.85 # Preprocessing class: FMLLSMLLSSSNFFN.
% 59.44/22.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.44/22.85 # Starting new_bool_3 with 900s (3) cores
% 59.44/22.85 # Starting new_bool_1 with 900s (3) cores
% 59.44/22.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 59.44/22.85 # Search class: FGHSM-SMLM32-DFFFFFNN
% 59.44/22.85 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 59.44/22.85 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 59.44/22.85 # Starting new_bool_1 with 91s (1) cores
% 59.44/22.85 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 59.44/22.85 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 20218 completed with status 0
% 59.44/22.85 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 59.44/22.85 # Preprocessing class: FMLLSMLLSSSNFFN.
% 59.44/22.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.44/22.85 # Starting new_bool_3 with 900s (3) cores
% 59.44/22.85 # Starting new_bool_1 with 900s (3) cores
% 59.44/22.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 59.44/22.85 # Search class: FGHSM-SMLM32-DFFFFFNN
% 59.44/22.85 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 59.44/22.85 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 59.44/22.85 # Starting new_bool_1 with 91s (1) cores
% 59.44/22.85 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 59.44/22.85 # Preprocessing time : 0.090 s
% 59.44/22.85
% 59.44/22.85 # Proof found!
% 59.44/22.85 # SZS status Theorem
% 59.44/22.85 # SZS output start CNFRefutation
% See solution above
% 59.44/22.85 # Parsed axioms : 13287
% 59.44/22.85 # Removed by relevancy pruning/SinE : 11760
% 59.44/22.85 # Initial clauses : 5929
% 59.44/22.85 # Removed in clause preprocessing : 1816
% 59.44/22.85 # Initial clauses in saturation : 4113
% 59.44/22.85 # Processed clauses : 5252
% 59.44/22.85 # ...of these trivial : 118
% 59.44/22.85 # ...subsumed : 1585
% 59.44/22.85 # ...remaining for further processing : 3549
% 59.44/22.85 # Other redundant clauses eliminated : 2576
% 59.44/22.85 # Clauses deleted for lack of memory : 0
% 59.44/22.85 # Backward-subsumed : 23
% 59.44/22.85 # Backward-rewritten : 42
% 59.44/22.85 # Generated clauses : 62213
% 59.44/22.85 # ...of the previous two non-redundant : 55898
% 59.44/22.85 # ...aggressively subsumed : 0
% 59.44/22.85 # Contextual simplify-reflections : 60
% 59.44/22.85 # Paramodulations : 60270
% 59.44/22.85 # Factorizations : 22
% 59.44/22.85 # NegExts : 0
% 59.44/22.85 # Equation resolutions : 2600
% 59.44/22.85 # Disequality decompositions : 0
% 59.44/22.85 # Total rewrite steps : 18622
% 59.44/22.85 # ...of those cached : 16762
% 59.44/22.85 # Propositional unsat checks : 0
% 59.44/22.85 # Propositional check models : 0
% 59.44/22.85 # Propositional check unsatisfiable : 0
% 59.44/22.85 # Propositional clauses : 0
% 59.44/22.85 # Propositional clauses after purity: 0
% 59.44/22.85 # Propositional unsat core size : 0
% 59.44/22.85 # Propositional preprocessing time : 0.000
% 59.44/22.85 # Propositional encoding time : 0.000
% 59.44/22.85 # Propositional solver time : 0.000
% 59.44/22.85 # Success case prop preproc time : 0.000
% 59.44/22.85 # Success case prop encoding time : 0.000
% 59.44/22.85 # Success case prop solver time : 0.000
% 59.44/22.85 # Current number of processed clauses : 2479
% 59.44/22.85 # Positive orientable unit clauses : 246
% 59.44/22.85 # Positive unorientable unit clauses: 6
% 59.44/22.85 # Negative unit clauses : 140
% 59.44/22.85 # Non-unit-clauses : 2087
% 59.44/22.85 # Current number of unprocessed clauses: 54617
% 59.44/22.85 # ...number of literals in the above : 249765
% 59.44/22.85 # Current number of archived formulas : 0
% 59.44/22.85 # Current number of archived clauses : 65
% 59.44/22.85 # Clause-clause subsumption calls (NU) : 5865942
% 59.44/22.85 # Rec. Clause-clause subsumption calls : 267805
% 59.44/22.85 # Non-unit clause-clause subsumptions : 1015
% 59.44/22.85 # Unit Clause-clause subsumption calls : 126501
% 59.44/22.85 # Rewrite failures with RHS unbound : 0
% 59.44/22.85 # BW rewrite match attempts : 2889
% 59.44/22.85 # BW rewrite match successes : 82
% 59.44/22.85 # Condensation attempts : 0
% 59.44/22.85 # Condensation successes : 0
% 59.44/22.85 # Termbank termtop insertions : 2514149
% 59.44/22.85 # Search garbage collected termcells : 188088
% 59.44/22.85
% 59.44/22.85 # -------------------------------------------------
% 59.44/22.85 # User time : 5.496 s
% 59.44/22.85 # System time : 0.107 s
% 59.44/22.85 # Total time : 5.603 s
% 59.44/22.85 # Maximum resident set size: 41908 pages
% 59.44/22.85
% 59.44/22.85 # -------------------------------------------------
% 59.44/22.85 # User time : 16.350 s
% 59.44/22.85 # System time : 0.181 s
% 59.44/22.85 # Total time : 16.531 s
% 59.44/22.85 # Maximum resident set size: 30496 pages
% 59.44/22.85 % E---3.1 exiting
% 59.44/22.85 % E exiting
%------------------------------------------------------------------------------