TSTP Solution File: SWV455+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:47:01 EDT 2023
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 227 ( 86 equ)
% Maximal formula atoms : 46 ( 8 avg)
% Number of connectives : 321 ( 121 ~; 62 |; 93 &)
% ( 2 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 138 ( 18 sgn; 109 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ~ ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X17,X18] :
( host(X5) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X7)
& setIn(X7,alive)
& setIn(X18,alive)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X7))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4fXBnZQHdN/E---3.1_8033.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.4fXBnZQHdN/E---3.1_8033.p',axiom_46) ).
fof(c_0_2,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
<=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_3,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ~ ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ~ ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X17,X18] :
( host(X5) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X7)
& setIn(X7,alive)
& setIn(X18,alive)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X7))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_2]) ).
fof(c_0_4,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( epred1_3(esk5_0,esk7_0,esk6_0)
& setIn(esk6_0,alive)
& ~ leq(host(esk6_0),host(esk7_0))
& ( index(ldr,host(esk6_0)) != host(esk7_0)
| index(status,host(esk6_0)) != norm )
& ( index(status,host(esk6_0)) != wait
| host(esk7_0) != host(index(elid,host(esk6_0))) )
& ( ~ leq(host(esk6_0),esk8_0)
| index(status,host(esk6_0)) != elec_1 )
& ( leq(s(zero),esk8_0)
| index(status,host(esk6_0)) != elec_1 )
& ( ~ setIn(esk8_0,index(down,host(esk6_0)))
| index(status,host(esk6_0)) != elec_1 )
& ( esk8_0 != host(esk7_0)
| index(status,host(esk6_0)) != elec_1 )
& host(esk6_0) != host(esk9_0)
& host(esk6_0) = host(esk11_0)
& host(esk11_0) != host(esk9_0)
& setIn(esk9_0,alive)
& setIn(esk11_0,alive)
& host(esk10_0) = host(esk9_0)
& host(esk12_0) = host(esk11_0)
& elem(m_Down(esk10_0),esk5_0)
& elem(m_Down(esk12_0),queue(host(esk9_0))) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X157,X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178] :
( ( ~ setIn(X161,alive)
| ~ elem(m_Down(X161),queue(host(X160)))
| ~ epred1_3(X159,X158,X157) )
& ( ~ elem(m_Down(X163),queue(host(X162)))
| ~ setIn(X163,alive)
| ~ epred1_3(X159,X158,X157) )
& ( ~ elem(m_Down(X165),queue(host(X164)))
| host(X165) != host(X164)
| ~ epred1_3(X159,X158,X157) )
& ( ~ elem(m_Halt(X167),queue(host(X166)))
| ~ leq(host(X166),host(X167))
| ~ epred1_3(X159,X158,X157) )
& ( ~ elem(m_Ack(X170,X168),queue(host(X169)))
| ~ leq(host(X168),host(X170))
| ~ epred1_3(X159,X158,X157) )
& ( setIn(X171,alive)
| ~ leq(X172,X171)
| host(X172) != host(X171)
| ~ setIn(X172,alive)
| ~ epred1_3(X159,X158,X157) )
& ( X174 = X173
| host(X174) != host(X173)
| ~ setIn(X173,alive)
| ~ setIn(X174,alive)
| ~ epred1_3(X159,X158,X157) )
& ( host(X177) = host(X175)
| ~ setIn(X175,alive)
| ~ setIn(X177,alive)
| host(X176) != host(X175)
| host(X178) != host(X177)
| ~ elem(m_Down(X178),queue(host(X175)))
| ~ elem(m_Down(X176),queue(host(X177)))
| ~ epred1_3(X159,X158,X157) )
& ( queue(host(X157)) = cons(m_Down(X158),X159)
| ~ epred1_3(X159,X158,X157) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,negated_conjecture,
host(esk12_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
host(esk6_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( host(X1) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| host(X3) != host(X2)
| host(X4) != host(X1)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ epred1_3(X5,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
elem(m_Down(esk12_0),queue(host(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
host(esk12_0) = host(esk6_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
setIn(esk9_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( host(X1) = host(esk9_0)
| host(esk9_0) != host(X2)
| host(X1) != host(esk6_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
queue(host(esk6_0)) = cons(m_Down(esk7_0),esk5_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
host(esk6_0) != host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_19,plain,
! [X100,X101,X102] :
( ( ~ elem(X100,cons(X101,X102))
| X100 = X101
| elem(X100,X102) )
& ( X100 != X101
| elem(X100,cons(X101,X102)) )
& ( ~ elem(X100,X102)
| elem(X100,cons(X101,X102)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_20,negated_conjecture,
( host(esk9_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),cons(m_Down(esk7_0),esk5_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_21,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( host(esk9_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
elem(m_Down(esk10_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
host(esk10_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n022.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 : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 03:15:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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/tmp/tmp.4fXBnZQHdN/E---3.1_8033.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8152 completed with status 0
% 0.21/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 8159 completed with status 0
% 0.21/0.54 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.21/0.54 # Preprocessing time : 0.005 s
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 67
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 123
% 0.21/0.54 # Removed in clause preprocessing : 6
% 0.21/0.54 # Initial clauses in saturation : 117
% 0.21/0.54 # Processed clauses : 606
% 0.21/0.54 # ...of these trivial : 28
% 0.21/0.54 # ...subsumed : 246
% 0.21/0.54 # ...remaining for further processing : 332
% 0.21/0.54 # Other redundant clauses eliminated : 9
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 31
% 0.21/0.54 # Backward-rewritten : 8
% 0.21/0.54 # Generated clauses : 1925
% 0.21/0.54 # ...of the previous two non-redundant : 1586
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 3
% 0.21/0.54 # Paramodulations : 1891
% 0.21/0.54 # Factorizations : 2
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 31
% 0.21/0.54 # Total rewrite steps : 551
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 288
% 0.21/0.54 # Positive orientable unit clauses : 49
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 69
% 0.21/0.54 # Non-unit-clauses : 170
% 0.21/0.54 # Current number of unprocessed clauses: 1086
% 0.21/0.54 # ...number of literals in the above : 3408
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 40
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 7000
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 4397
% 0.21/0.54 # Non-unit clause-clause subsumptions : 130
% 0.21/0.54 # Unit Clause-clause subsumption calls : 2656
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 44
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 28362
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.060 s
% 0.21/0.54 # System time : 0.008 s
% 0.21/0.54 # Total time : 0.068 s
% 0.21/0.54 # Maximum resident set size: 2096 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.308 s
% 0.21/0.54 # System time : 0.023 s
% 0.21/0.54 # Total time : 0.331 s
% 0.21/0.54 # Maximum resident set size: 1764 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------