TSTP Solution File: SYN037-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN037-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Tue May 21 07:56:26 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 22
% Syntax : Number of clauses : 89 ( 5 unt; 51 nHn; 48 RR)
% Number of literals : 291 ( 0 equ; 133 neg)
% Maximal clause size : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-1 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 76 ( 51 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10,negated_conjecture,
( m1
| p(cx)
| ~ m3
| ~ p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_9,negated_conjecture,
( m1
| p(X1)
| ~ m3
| ~ p(cx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_21,negated_conjecture,
( m2
| p(cv) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_4,negated_conjecture,
( m3
| p(cx)
| ~ m1
| ~ p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_19,negated_conjecture,
( m2
| ~ p(cvv) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_3,negated_conjecture,
( m3
| p(X1)
| ~ m1
| ~ p(cx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_15,negated_conjecture,
( m2
| m3
| q(cw)
| ~ q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_6,negated_conjecture,
( q(cw)
| ~ m2
| ~ m3
| ~ q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_14,negated_conjecture,
( m2
| m3
| q(X1)
| ~ q(cw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_22,negated_conjecture,
( m1
| q(cu) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_5,negated_conjecture,
( q(X1)
| ~ m2
| ~ m3
| ~ q(cw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_20,negated_conjecture,
( m1
| ~ q(cuu) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_18,negated_conjecture,
( p(X2)
| ~ m2
| ~ p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_16,negated_conjecture,
( m1
| m3
| p(X1)
| p(fy3(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_13,negated_conjecture,
( m1
| m3
| ~ p(X1)
| ~ p(fy3(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_17,negated_conjecture,
( q(X2)
| ~ m1
| ~ q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_12,negated_conjecture,
( m2
| q(X1)
| q(fz2(X1))
| ~ m3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_11,negated_conjecture,
( m2
| ~ m3
| ~ q(X1)
| ~ q(fz2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_2,negated_conjecture,
( p(X1)
| p(fy(X1))
| ~ m1
| ~ m3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
( ~ m1
| ~ m3
| ~ p(X1)
| ~ p(fy(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_7,negated_conjecture,
( m3
| ~ m2
| ~ q(X1)
| ~ q(fz5(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_8,negated_conjecture,
( m3
| q(X1)
| q(fz5(X1))
| ~ m2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(c_0_22,negated_conjecture,
( m1
| p(cx)
| ~ m3
| ~ p(X1) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_23,negated_conjecture,
( m1
| p(X1)
| ~ m3
| ~ p(cx) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_24,negated_conjecture,
( m1
| p(cx)
| ~ m3
| ~ p(X1) ),
c_0_22 ).
cnf(c_0_25,negated_conjecture,
( m2
| p(cv) ),
clause_21 ).
cnf(c_0_26,negated_conjecture,
( m3
| p(cx)
| ~ m1
| ~ p(X1) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_27,negated_conjecture,
( m2
| ~ p(cvv) ),
inference(fof_simplification,[status(thm)],[clause_19]) ).
cnf(c_0_28,negated_conjecture,
( m1
| p(X1)
| ~ m3
| ~ p(cx) ),
c_0_23 ).
cnf(c_0_29,negated_conjecture,
( m2
| p(cx)
| m1
| ~ m3 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( m3
| p(X1)
| ~ m1
| ~ p(cx) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_31,negated_conjecture,
( m3
| p(cx)
| ~ m1
| ~ p(X1) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
( m2
| m3
| q(cw)
| ~ q(X1) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_33,negated_conjecture,
( m2
| ~ p(cvv) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
( m2
| p(X1)
| m1
| ~ m3 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( m3
| p(X1)
| ~ m1
| ~ p(cx) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( m2
| p(cx)
| m3
| ~ m1 ),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
( q(cw)
| ~ m2
| ~ m3
| ~ q(X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_38,negated_conjecture,
( m2
| m3
| q(X1)
| ~ q(cw) ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_39,negated_conjecture,
( m2
| m3
| q(cw)
| ~ q(X1) ),
c_0_32 ).
cnf(c_0_40,negated_conjecture,
( m1
| q(cu) ),
clause_22 ).
cnf(c_0_41,negated_conjecture,
( m2
| m1
| ~ m3 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( m2
| p(X1)
| m3
| ~ m1 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( q(X1)
| ~ m2
| ~ m3
| ~ q(cw) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_44,negated_conjecture,
( q(cw)
| ~ m2
| ~ m3
| ~ q(X1) ),
c_0_37 ).
cnf(c_0_45,negated_conjecture,
( m1
| ~ q(cuu) ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_46,negated_conjecture,
( m2
| m3
| q(X1)
| ~ q(cw) ),
c_0_38 ).
cnf(c_0_47,negated_conjecture,
( q(cw)
| m2
| m1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( m2
| m3
| ~ m1 ),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( q(X1)
| ~ m2
| ~ m3
| ~ q(cw) ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
( q(cw)
| m1
| ~ m2
| ~ m3 ),
inference(spm,[status(thm)],[c_0_44,c_0_40]) ).
cnf(c_0_51,negated_conjecture,
( p(X2)
| ~ m2
| ~ p(X1) ),
inference(fof_simplification,[status(thm)],[clause_18]) ).
cnf(c_0_52,negated_conjecture,
( m1
| ~ q(cuu) ),
c_0_45 ).
cnf(c_0_53,negated_conjecture,
( q(X1)
| m2
| m3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( q(X1)
| m1
| ~ m3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_41]) ).
cnf(c_0_55,negated_conjecture,
( p(X2)
| ~ m2
| ~ p(X1) ),
c_0_51 ).
cnf(c_0_56,negated_conjecture,
( m1
| m3
| p(X1)
| p(fy3(X1)) ),
clause_16 ).
cnf(c_0_57,negated_conjecture,
( m2
| m3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_48]) ).
cnf(c_0_58,negated_conjecture,
( m1
| ~ m3 ),
inference(spm,[status(thm)],[c_0_52,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( m1
| m3
| ~ p(X1)
| ~ p(fy3(X1)) ),
inference(fof_simplification,[status(thm)],[clause_13]) ).
cnf(c_0_60,negated_conjecture,
( p(X1)
| p(X2)
| m1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( q(X2)
| ~ m1
| ~ q(X1) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_62,negated_conjecture,
( m1
| m3
| ~ p(X1)
| ~ p(fy3(X1)) ),
c_0_59 ).
cnf(c_0_63,negated_conjecture,
( p(X1)
| m1 ),
inference(ef,[status(thm)],[c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( q(X2)
| ~ m1
| ~ q(X1) ),
c_0_61 ).
cnf(c_0_65,negated_conjecture,
m1,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_63]),c_0_58]) ).
cnf(c_0_66,negated_conjecture,
( m2
| q(X1)
| q(fz2(X1))
| ~ m3 ),
inference(fof_simplification,[status(thm)],[clause_12]) ).
cnf(c_0_67,negated_conjecture,
( m2
| ~ m3
| ~ q(X1)
| ~ q(fz2(X1)) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_68,negated_conjecture,
( q(X1)
| ~ q(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_69,negated_conjecture,
( m2
| q(X1)
| q(fz2(X1))
| ~ m3 ),
c_0_66 ).
cnf(c_0_70,negated_conjecture,
( m2
| ~ m3
| ~ q(X1)
| ~ q(fz2(X1)) ),
c_0_67 ).
cnf(c_0_71,negated_conjecture,
( q(X1)
| m2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_57]),c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( p(X1)
| p(fy(X1))
| ~ m1
| ~ m3 ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_73,negated_conjecture,
( ~ m1
| ~ m3
| ~ p(X1)
| ~ p(fy(X1)) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_74,negated_conjecture,
m2,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_57]),c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( p(X1)
| p(fy(X1))
| ~ m1
| ~ m3 ),
c_0_72 ).
cnf(c_0_76,negated_conjecture,
( ~ m1
| ~ m3
| ~ p(X1)
| ~ p(fy(X1)) ),
c_0_73 ).
cnf(c_0_77,negated_conjecture,
( p(X1)
| ~ p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_74])]) ).
cnf(c_0_78,negated_conjecture,
( p(fy(X1))
| p(X1)
| ~ m3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_65])]) ).
cnf(c_0_79,negated_conjecture,
( m3
| ~ m2
| ~ q(X1)
| ~ q(fz5(X1)) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_80,negated_conjecture,
( m3
| q(X1)
| q(fz5(X1))
| ~ m2 ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_81,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ m3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_65])]) ).
cnf(c_0_82,negated_conjecture,
( p(X1)
| ~ m3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( m3
| ~ m2
| ~ q(X1)
| ~ q(fz5(X1)) ),
c_0_79 ).
cnf(c_0_84,negated_conjecture,
( m3
| q(X1)
| q(fz5(X1))
| ~ m2 ),
c_0_80 ).
cnf(c_0_85,negated_conjecture,
~ m3,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( m3
| ~ q(fz5(X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_74])]),c_0_68]) ).
cnf(c_0_87,negated_conjecture,
q(fz5(X1)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_74])]),c_0_85]),c_0_68]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN037-2 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 14:27:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_3 with pid 11601 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 0.20/0.48 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 11607 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 22
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 22
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 22
% 0.20/0.48 # Processed clauses : 77
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 5
% 0.20/0.48 # ...remaining for further processing : 72
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 27
% 0.20/0.48 # Backward-rewritten : 17
% 0.20/0.48 # Generated clauses : 101
% 0.20/0.48 # ...of the previous two non-redundant : 55
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 16
% 0.20/0.48 # Paramodulations : 99
% 0.20/0.48 # Factorizations : 2
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 17
% 0.20/0.48 # ...of those cached : 14
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 6
% 0.20/0.48 # Positive orientable unit clauses : 3
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 2
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 66
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 92
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 63
% 0.20/0.48 # Non-unit clause-clause subsumptions : 43
% 0.20/0.48 # Unit Clause-clause subsumption calls : 6
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 3
% 0.20/0.48 # BW rewrite match successes : 3
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1918
% 0.20/0.48 # Search garbage collected termcells : 52
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.009 s
% 0.20/0.48 # Maximum resident set size: 1596 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.005 s
% 0.20/0.48 # Total time : 0.012 s
% 0.20/0.48 # Maximum resident set size: 1704 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------