TSTP Solution File: KRS150+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS150+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Mon May 20 23:17:43 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 60 ( 24 unt; 0 def)
% Number of atoms : 209 ( 0 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 274 ( 125 ~; 94 |; 44 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC18(iV16560)
& cC16(iV16560)
& cowlThing(iV16560)
& cC14(iV16560)
& cC8(iV16560)
& cowlThing(iV16561)
& cC6(iV16561)
& cowlThing(iV16562)
& cC12(iV16562) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_5,axiom,
! [X1] :
( cC16(X1)
<=> ( cC14(X1)
& cC8(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X1] :
( cC18(X1)
<=> ( cTOP(X1)
& cC16(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_10,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC18(X1)
& cTOP(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_20,axiom,
~ cC10(iV16562),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
fof(axiom_3,axiom,
! [X1] :
( cC12(X1)
<=> ( ~ cC2(X1)
& ~ cC10(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_21,axiom,
~ cC2(iV16562),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_21) ).
fof(axiom_12,axiom,
cTEST(iV16560),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(axiom_16,axiom,
~ cC4(iV16561),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_16) ).
fof(axiom_8,axiom,
! [X1] :
( cC6(X1)
<=> ( ~ cC2(X1)
& ~ cC4(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_19,axiom,
~ cC2(iV16561),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).
fof(c_0_13,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC18(iV16560)
& cC16(iV16560)
& cowlThing(iV16560)
& cC14(iV16560)
& cC8(iV16560)
& cowlThing(iV16561)
& cC6(iV16561)
& cowlThing(iV16562)
& cC12(iV16562) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_14,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_15,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_16,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cC18(iV16560)
| ~ cC16(iV16560)
| ~ cowlThing(iV16560)
| ~ cC14(iV16560)
| ~ cC8(iV16560)
| ~ cowlThing(iV16561)
| ~ cC6(iV16561)
| ~ cowlThing(iV16562)
| ~ cC12(iV16562) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cC18(iV16560)
| ~ cC16(iV16560)
| ~ cowlThing(iV16560)
| ~ cC14(iV16560)
| ~ cC8(iV16560)
| ~ cowlThing(iV16561)
| ~ cC6(iV16561)
| ~ cowlThing(iV16562)
| ~ cC12(iV16562) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
fof(c_0_17,plain,
! [X21] :
( cowlThing(X21)
& ~ cowlNothing(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
fof(c_0_18,plain,
! [X20] :
( ( ~ xsd_string(X20)
| ~ xsd_integer(X20) )
& ( xsd_integer(X20)
| xsd_string(X20) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_19,plain,
! [X17] :
( ( cC14(X17)
| ~ cC16(X17) )
& ( cC8(X17)
| ~ cC16(X17) )
& ( ~ cC14(X17)
| ~ cC8(X17)
| cC16(X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])]) ).
fof(c_0_20,plain,
! [X18] :
( ( cTOP(X18)
| ~ cC18(X18) )
& ( cC16(X18)
| ~ cC18(X18) )
& ( ~ cTOP(X18)
| ~ cC16(X18)
| cC18(X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])]) ).
cnf(c_0_21,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cC18(iV16560)
| ~ cC16(iV16560)
| ~ cowlThing(iV16560)
| ~ cC14(iV16560)
| ~ cC8(iV16560)
| ~ cowlThing(iV16561)
| ~ cC6(iV16561)
| ~ cowlThing(iV16562)
| ~ cC12(iV16562) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( cC14(X1)
| ~ cC16(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( cC16(X1)
| ~ cC18(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ cC18(iV16560)
| ~ cC16(iV16560)
| ~ cowlThing(iV16560)
| ~ cC14(iV16560)
| ~ cC8(iV16560)
| ~ cowlThing(iV16561)
| ~ cC6(iV16561)
| ~ cowlThing(iV16562)
| ~ cC12(iV16562) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cC6(iV16561)
| ~ cC18(iV16560)
| ~ cC8(iV16560)
| ~ cC12(iV16562) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( xsd_string(esk2_0)
| ~ cC6(iV16561)
| ~ cC18(iV16560)
| ~ cC8(iV16560)
| ~ cC12(iV16562) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22]),c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]),c_0_25]),c_0_26]) ).
fof(c_0_31,plain,
! [X19] :
( ( cC18(X19)
| ~ cTEST(X19) )
& ( cTOP(X19)
| ~ cTEST(X19) )
& ( ~ cC18(X19)
| ~ cTOP(X19)
| cTEST(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])])]) ).
fof(c_0_32,plain,
~ cC10(iV16562),
inference(fof_simplification,[status(thm)],[axiom_20]) ).
fof(c_0_33,plain,
! [X1] :
( cC12(X1)
<=> ( ~ cC2(X1)
& ~ cC10(X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_34,plain,
~ cC2(iV16562),
inference(fof_simplification,[status(thm)],[axiom_21]) ).
cnf(c_0_35,negated_conjecture,
( ~ cC6(iV16561)
| ~ cC18(iV16560)
| ~ cC8(iV16560)
| ~ cC12(iV16562) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
( cC8(X1)
| ~ cC16(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,plain,
( cC18(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
cTEST(iV16560),
inference(split_conjunct,[status(thm)],[axiom_12]) ).
fof(c_0_39,plain,
~ cC10(iV16562),
inference(fof_nnf,[status(thm)],[c_0_32]) ).
fof(c_0_40,plain,
! [X5] :
( ( ~ cC2(X5)
| ~ cC12(X5) )
& ( ~ cC10(X5)
| ~ cC12(X5) )
& ( cC2(X5)
| cC10(X5)
| cC12(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
fof(c_0_41,plain,
~ cC2(iV16562),
inference(fof_nnf,[status(thm)],[c_0_34]) ).
fof(c_0_42,plain,
~ cC4(iV16561),
inference(fof_simplification,[status(thm)],[axiom_16]) ).
fof(c_0_43,plain,
! [X1] :
( cC6(X1)
<=> ( ~ cC2(X1)
& ~ cC4(X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_44,negated_conjecture,
( ~ cC6(iV16561)
| ~ cC18(iV16560)
| ~ cC12(iV16562) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26]) ).
cnf(c_0_45,plain,
cC18(iV16560),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
~ cC10(iV16562),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( cC2(X1)
| cC10(X1)
| cC12(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
~ cC2(iV16562),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_49,plain,
~ cC2(iV16561),
inference(fof_simplification,[status(thm)],[axiom_19]) ).
fof(c_0_50,plain,
~ cC4(iV16561),
inference(fof_nnf,[status(thm)],[c_0_42]) ).
fof(c_0_51,plain,
! [X11] :
( ( ~ cC2(X11)
| ~ cC6(X11) )
& ( ~ cC4(X11)
| ~ cC6(X11) )
& ( cC2(X11)
| cC4(X11)
| cC6(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])]) ).
cnf(c_0_52,negated_conjecture,
( ~ cC6(iV16561)
| ~ cC12(iV16562) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_53,plain,
cC12(iV16562),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
fof(c_0_54,plain,
~ cC2(iV16561),
inference(fof_nnf,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
~ cC4(iV16561),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( cC2(X1)
| cC4(X1)
| cC6(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,negated_conjecture,
~ cC6(iV16561),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_58,plain,
~ cC2(iV16561),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS150+1 : TPTP v8.2.0. Released v3.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 22:25:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # new_bool_1 with pid 25122 completed with status 0
% 0.22/0.52 # Result found by new_bool_1
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 25126 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 25
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 46
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 46
% 0.22/0.52 # Processed clauses : 96
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 3
% 0.22/0.52 # ...remaining for further processing : 93
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 3
% 0.22/0.52 # Backward-rewritten : 5
% 0.22/0.52 # Generated clauses : 23
% 0.22/0.52 # ...of the previous two non-redundant : 14
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 9
% 0.22/0.52 # Paramodulations : 23
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 19
% 0.22/0.52 # ...of those cached : 10
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 42
% 0.22/0.52 # Positive orientable unit clauses : 9
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 6
% 0.22/0.52 # Non-unit-clauses : 27
% 0.22/0.52 # Current number of unprocessed clauses: 7
% 0.22/0.52 # ...number of literals in the above : 16
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 51
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 888
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 740
% 0.22/0.52 # Non-unit clause-clause subsumptions : 13
% 0.22/0.52 # Unit Clause-clause subsumption calls : 39
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 5
% 0.22/0.52 # BW rewrite match successes : 5
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 2806
% 0.22/0.52 # Search garbage collected termcells : 535
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.010 s
% 0.22/0.52 # System time : 0.001 s
% 0.22/0.52 # Total time : 0.011 s
% 0.22/0.52 # Maximum resident set size: 1872 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.012 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.015 s
% 0.22/0.52 # Maximum resident set size: 1708 pages
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------