TSTP Solution File: SWC253-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC253-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 04:24:58 EDT 2024
% Result : Unsatisfiable 0.53s 0.59s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 79 ( 18 unt; 31 nHn; 79 RR)
% Number of literals : 215 ( 87 equ; 112 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_12,negated_conjecture,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_19,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_20,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_21,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_22,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_25,negated_conjecture,
neq(sk2,nil),
c_0_19 ).
cnf(c_0_26,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_27,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_21 ).
cnf(c_0_30,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_24 ).
cnf(c_0_32,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_33,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_34,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_35,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_26 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_38,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_39,negated_conjecture,
( tl(app(sk1,X1)) = app(tl(sk1),X1)
| sk1 = nil
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_40,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(app(sk1,tl(sk4)))
| ~ ssList(tl(sk4)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])])])]) ).
cnf(c_0_42,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_34 ).
cnf(c_0_43,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_45,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_37 ).
cnf(c_0_46,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_38 ).
cnf(c_0_47,negated_conjecture,
( tl(app(sk1,tl(sk4))) = app(tl(sk1),tl(sk4))
| sk4 = nil
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_28])]) ).
cnf(c_0_49,negated_conjecture,
( sk4 = nil
| neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_43,c_0_30]) ).
cnf(c_0_50,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_51,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_52,plain,
( X1 = nil
| app(X1,X2) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_36])]) ).
cnf(c_0_53,negated_conjecture,
( app(tl(sk1),tl(sk4)) = tl(sk4)
| sk1 = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( sk1 = nil
| ssList(tl(sk1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_55,negated_conjecture,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_56,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_57,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_50 ).
cnf(c_0_58,negated_conjecture,
( cons(hd(sk1),tl(sk1)) = sk1
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_51,c_0_28]) ).
cnf(c_0_59,negated_conjecture,
( tl(sk1) = nil
| sk4 = nil
| sk1 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_40]) ).
cnf(c_0_60,negated_conjecture,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
c_0_55 ).
cnf(c_0_61,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_56 ).
cnf(c_0_62,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| sk4 = nil
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
~ singletonP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_33])]) ).
cnf(c_0_65,negated_conjecture,
( sk1 = nil
| ssItem(hd(sk1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_28]) ).
cnf(c_0_66,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_67,negated_conjecture,
( sk1 = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_28])]),c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_66 ).
cnf(c_0_69,negated_conjecture,
( cons(hd(sk4),tl(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_51,c_0_30]) ).
cnf(c_0_70,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_61,c_0_30]) ).
cnf(c_0_71,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_72,negated_conjecture,
( app(nil,tl(sk4)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_67]),c_0_40]),c_0_49]) ).
cnf(c_0_73,negated_conjecture,
( sk4 = nil
| tl(sk4) != sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_40]),c_0_70]) ).
cnf(c_0_74,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_72]),c_0_40]),c_0_73]) ).
cnf(c_0_76,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_77,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_33,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC253-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:31:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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/benchmark/theBenchmark.p
% 0.53/0.59 # Version: 3.1.0
% 0.53/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.53/0.59 # Starting sh5l with 300s (1) cores
% 0.53/0.59 # new_bool_3 with pid 3453 completed with status 0
% 0.53/0.59 # Result found by new_bool_3
% 0.53/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.59 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.53/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.53/0.59 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3456 completed with status 0
% 0.53/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.59 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.53/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.53/0.59 # Preprocessing time : 0.003 s
% 0.53/0.59 # Presaturation interreduction done
% 0.53/0.59
% 0.53/0.59 # Proof found!
% 0.53/0.59 # SZS status Unsatisfiable
% 0.53/0.59 # SZS output start CNFRefutation
% See solution above
% 0.53/0.59 # Parsed axioms : 197
% 0.53/0.59 # Removed by relevancy pruning/SinE : 127
% 0.53/0.59 # Initial clauses : 70
% 0.53/0.59 # Removed in clause preprocessing : 0
% 0.53/0.59 # Initial clauses in saturation : 70
% 0.53/0.59 # Processed clauses : 371
% 0.53/0.59 # ...of these trivial : 5
% 0.53/0.59 # ...subsumed : 59
% 0.53/0.59 # ...remaining for further processing : 307
% 0.53/0.59 # Other redundant clauses eliminated : 16
% 0.53/0.59 # Clauses deleted for lack of memory : 0
% 0.53/0.59 # Backward-subsumed : 11
% 0.53/0.59 # Backward-rewritten : 99
% 0.53/0.59 # Generated clauses : 1408
% 0.53/0.59 # ...of the previous two non-redundant : 1367
% 0.53/0.59 # ...aggressively subsumed : 0
% 0.53/0.59 # Contextual simplify-reflections : 21
% 0.53/0.59 # Paramodulations : 1389
% 0.53/0.59 # Factorizations : 0
% 0.53/0.59 # NegExts : 0
% 0.53/0.59 # Equation resolutions : 21
% 0.53/0.59 # Disequality decompositions : 0
% 0.53/0.59 # Total rewrite steps : 540
% 0.53/0.59 # ...of those cached : 531
% 0.53/0.59 # Propositional unsat checks : 0
% 0.53/0.59 # Propositional check models : 0
% 0.53/0.59 # Propositional check unsatisfiable : 0
% 0.53/0.59 # Propositional clauses : 0
% 0.53/0.59 # Propositional clauses after purity: 0
% 0.53/0.59 # Propositional unsat core size : 0
% 0.53/0.59 # Propositional preprocessing time : 0.000
% 0.53/0.59 # Propositional encoding time : 0.000
% 0.53/0.59 # Propositional solver time : 0.000
% 0.53/0.59 # Success case prop preproc time : 0.000
% 0.53/0.59 # Success case prop encoding time : 0.000
% 0.53/0.59 # Success case prop solver time : 0.000
% 0.53/0.59 # Current number of processed clauses : 128
% 0.53/0.59 # Positive orientable unit clauses : 9
% 0.53/0.59 # Positive unorientable unit clauses: 0
% 0.53/0.59 # Negative unit clauses : 2
% 0.53/0.59 # Non-unit-clauses : 117
% 0.53/0.59 # Current number of unprocessed clauses: 1119
% 0.53/0.59 # ...number of literals in the above : 5492
% 0.53/0.59 # Current number of archived formulas : 0
% 0.53/0.59 # Current number of archived clauses : 169
% 0.53/0.59 # Clause-clause subsumption calls (NU) : 7628
% 0.53/0.59 # Rec. Clause-clause subsumption calls : 2533
% 0.53/0.59 # Non-unit clause-clause subsumptions : 90
% 0.53/0.59 # Unit Clause-clause subsumption calls : 224
% 0.53/0.59 # Rewrite failures with RHS unbound : 0
% 0.53/0.59 # BW rewrite match attempts : 2
% 0.53/0.59 # BW rewrite match successes : 2
% 0.53/0.59 # Condensation attempts : 0
% 0.53/0.59 # Condensation successes : 0
% 0.53/0.59 # Termbank termtop insertions : 30894
% 0.53/0.59 # Search garbage collected termcells : 863
% 0.53/0.59
% 0.53/0.59 # -------------------------------------------------
% 0.53/0.59 # User time : 0.053 s
% 0.53/0.59 # System time : 0.010 s
% 0.53/0.59 # Total time : 0.063 s
% 0.53/0.59 # Maximum resident set size: 2076 pages
% 0.53/0.59
% 0.53/0.59 # -------------------------------------------------
% 0.53/0.59 # User time : 0.061 s
% 0.53/0.59 # System time : 0.013 s
% 0.53/0.59 # Total time : 0.073 s
% 0.53/0.59 # Maximum resident set size: 1876 pages
% 0.53/0.59 % E---3.1 exiting
% 0.53/0.59 % E exiting
%------------------------------------------------------------------------------