Metrics for Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample870.0ms (35.3%)

Memory

7.8MiB live, 1 192.5MiB allocated; 220ms collecting garbage

Samples

661.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 261.0ms

ival-mult: 243.0ms (93.3% of total)

ival-true: 6.0ms (2.3% of total)

exact: 6.0ms (2.3% of total)

ival-assert: 3.0ms (1.2% of total)

adjust: 2.0ms (0.8% of total)

Bogosity

explain56.0ms (2.3%)

Memory

5.9MiB live, 104.1MiB allocated; 10ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x #s(literal 2 binary64)) x)`
-	-	`(*.f64 x #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

18.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

Click to see histograms. Total time spent on operations: 8.0ms

ival-mult: 7.0ms (89.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess270.0ms (11%)

Memory

-6.7MiB live, 176.9MiB allocated; 54ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	23	15
2	64	15
3	160	15
4	266	15
5	1046	15
6	4662	15
0	4	5
0	6	5
1	11	5
2	22	5
3	58	5
4	146	5
5	651	5
6	4384	5
0	8013	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 (.f64 #s(literal 2 binary64) x) x)

Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.0MiB live, 1.0MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) x)

Compiler

Compiled 5 to 4 computations (20% saved)

simplify138.0ms (5.6%)

Memory

25.7MiB live, 110.3MiB allocated; 31ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x #s(literal 2 binary64))
cost-diff	0	(.f64 (.f64 x #s(literal 2 binary64)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	11	10
2	22	10
3	58	10
4	146	10
5	651	10
6	4384	10
0	8013	10

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(*.f64 x #s(literal 2 binary64))
x
#s(literal 2 binary64)

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 (.f64 #s(literal 2 binary64) x) x)
(*.f64 x #s(literal 2 binary64))
(*.f64 #s(literal 2 binary64) x)
x
#s(literal 2 binary64)

localize57.0ms (2.3%)

Memory

-13.9MiB live, 43.0MiB allocated; 29ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(.f64 (.f64 x #s(literal 2 binary64)) x)
accuracy	0.0	(*.f64 x #s(literal 2 binary64))

Samples

53.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

Click to see histograms. Total time spent on operations: 34.0ms

ival-mult: 33.0ms (97.4% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series3.0ms (0.1%)

Memory

5.1MiB live, 5.1MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(*.f64 x #s(literal 2 binary64))

Outputs
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x 2) #s(hole binary64 (* 2 x)))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (* x 2) x) (* x 2))
1.0ms	x	@	0	((* (* x 2) x) (* x 2))
1.0ms	x	@	inf	((* (* x 2) x) (* x 2))

simplify168.0ms (6.8%)

Memory

-2.1MiB live, 183.0MiB allocated; 49ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	18
1	18	18
2	38	18
3	117	18
4	281	18
5	991	18
6	4423	18
0	8033	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x 2) #s(hole binary64 (* 2 x)))

Outputs
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* (* x 2) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (* x 2) #s(hole binary64 (* 2 x)))
#s(approx (* x 2) (*.f64 #s(literal 2 binary64) x))

rewrite30.0ms (1.2%)

Memory

-1.4MiB live, 43.8MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	11	8
0	30	8

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

2 → 11

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(*.f64 x #s(literal 2 binary64))

Outputs
(.f64 (.f64 x x) #s(literal 2 binary64))
(.f64 (.f64 #s(literal 2 binary64) x) x)
(.f64 #s(literal 2 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x))
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) x) (.f64 #s(literal 1 binary64) x))
(+.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)))
(+.f64 x x)

eval1.0ms (0.1%)

Memory: 3.2MiB live, 3.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 89 to 29 computations (67.4% saved)

prune1.0ms (0%)

Memory

2.8MiB live, 2.8MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	12	1	13
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	13	1	14

Accuracy

100.0%

Counts

14 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 x x) x)

Compiler

Compiled 5 to 3 computations (40% saved)

simplify118.0ms (4.8%)

Memory

9.3MiB live, 154.9MiB allocated; 25ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x x)
cost-diff	0	(*.f64 (+.f64 x x) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	9
0	5	9
1	8	9
2	15	9
3	29	9
4	96	9
5	243	9
6	843	9
7	4304	9
0	8083	9

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)
x

Outputs
(*.f64 (+.f64 x x) x)
(.f64 (.f64 #s(literal 2 binary64) x) x)
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x

localize16.0ms (0.6%)

Memory

-10.6MiB live, 33.9MiB allocated; 8ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 x x)
accuracy	0.0	(*.f64 (+.f64 x x) x)

Samples

12.0ms

256×

valid

Compiler

Compiled 11 to 5 computations (54.5% saved)

Precisions

Click to see histograms. Total time spent on operations: 3.0ms

ival-mult: 2.0ms (57.2% of total)

ival-add: 1.0ms (28.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series2.0ms (0.1%)

Memory

5.1MiB live, 5.1MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)

Outputs
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((* (+ x x) x) (+ x x))
1.0ms	x	@	-inf	((* (+ x x) x) (+ x x))
0.0ms	x	@	0	((* (+ x x) x) (+ x x))

simplify279.0ms (11.3%)

Memory

-27.3MiB live, 166.1MiB allocated; 159ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	18
1	17	18
2	37	18
3	116	18
4	280	18
5	992	18
6	4427	18
0	8075	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))

Outputs
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* (+ x x) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))

rewrite27.0ms (1.1%)

Memory

8.3MiB live, 53.5MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	8
0	5	6
1	17	6
0	105	6

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

2 → 36

Calls

Call 1

Inputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)

Outputs
(.f64 #s(literal 2 binary64) (.f64 x x))
(*.f64 #s(literal 2 binary64) x)
(.f64 (.f64 #s(literal 2 binary64) x) x)
(*.f64 x #s(literal 2 binary64))
(.f64 x (.f64 #s(literal 2 binary64) x))
(/.f64 (*.f64 #s(literal 0 binary64) x) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) x) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 x (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x))
(fma.f64 x x (*.f64 x x))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 (.f64 x x) (.f64 x x))
(+.f64 x x)
(.f64 #s(literal 2 binary64) (.f64 x x))
(*.f64 #s(literal 2 binary64) x)
(.f64 (.f64 #s(literal 2 binary64) x) x)
(*.f64 x #s(literal 2 binary64))
(.f64 x (.f64 #s(literal 2 binary64) x))
(/.f64 (*.f64 #s(literal 0 binary64) x) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) x) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 x (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x))
(fma.f64 x x (*.f64 x x))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 (.f64 x x) (.f64 x x))
(+.f64 x x)

eval2.0ms (0.1%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 155 to 40 computations (74.2% saved)

prune1.0ms (0%)

Memory

3.0MiB live, 3.0MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	19	1	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	19	2	21

Accuracy

100.0%

Counts

21 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	6.9%	(+.f64 x x)
✓	100.0%	(*.f64 (+.f64 x x) x)

Compiler

Compiled 8 to 5 computations (37.5% saved)

simplify101.0ms (4.1%)

Memory

5.9MiB live, 107.4MiB allocated; 10ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	2	4
0	3	4
1	5	4
2	8	4
3	15	4
4	33	4
5	72	4
6	278	4
7	1737	4
0	8118	4

Stop Event

1×	iter limit
1×	node limit
1×	iter limit

Calls

Call 1

Inputs
(+.f64 x x)
x

Outputs
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x

localize10.0ms (0.4%)

Memory

-19.5MiB live, 26.5MiB allocated; 3ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 x x)

Samples

6.0ms

256×

valid

Compiler

Compiled 6 to 4 computations (33.3% saved)

Precisions

Click to see histograms. Total time spent on operations: 2.0ms

ival-add: 2.0ms (102.8% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series1.0ms (0%)

Memory

2.8MiB live, 2.8MiB allocated; 0ms collecting garbage

Counts

1 → 1

Calls

Call 1

Inputs
(+.f64 x x)

Outputs
#s(approx (+ x x) #s(hole binary64 (* 2 x)))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	((+ x x))
0.0ms	x	@	-inf	((+ x x))
0.0ms	x	@	0	((+ x x))

simplify108.0ms (4.4%)

Memory

26.6MiB live, 212.8MiB allocated; 29ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	9	7
2	16	7
3	34	7
4	73	7
5	314	7
6	1763	7
0	8150	7

Stop Event

1×	iter limit
1×	node limit

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x x) #s(hole binary64 (* 2 x)))

Outputs
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))

rewrite66.0ms (2.7%)

Memory

-16.6MiB live, 72.1MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	2	3
0	3	3
1	14	3
0	88	3

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

1 → 8

Calls

Call 1

Inputs
(+.f64 x x)

Outputs
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval1.0ms (0%)

Memory: 2.6MiB live, 2.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 69 to 22 computations (68.1% saved)

prune1.0ms (0.1%)

Memory

5.9MiB live, 5.9MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	9	2	11

Accuracy

100.0%

Counts

11 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	6.9%	(+.f64 x x)
✓	100.0%	(*.f64 (+.f64 x x) x)

Compiler

Compiled 21 to 11 computations (47.6% saved)

regimes5.0ms (0.2%)

Memory

13.3MiB live, 13.3MiB allocated; 0ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs
(+.f64 x x)
(*.f64 (+.f64 x x) x)
(.f64 (.f64 x #s(literal 2 binary64)) x)

Outputs
(*.f64 (+.f64 x x) x)

Calls

2 calls:

2.0ms	(.f64 (.f64 x #s(literal 2 binary64)) x)
2.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`(.f64 (.f64 x #s(literal 2 binary64)) x)`
100.0%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes4.0ms (0.2%)

Memory

11.3MiB live, 11.3MiB allocated; 0ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
(+.f64 x x)

Outputs
(+.f64 x x)

Calls

2 calls:

2.0ms	x
2.0ms	(.f64 (.f64 x #s(literal 2 binary64)) x)

Results

Accuracy	Segments	Branch
6.9%	1	`(.f64 (.f64 x #s(literal 2 binary64)) x)`
6.9%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify25.0ms (1%)

Memory

-16.8MiB live, 41.1MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	8

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)

Outputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)

derivations3.0ms (0.1%)

Memory

5.7MiB live, 5.7MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 8 to 3 computations (62.5% saved)

preprocess100.0ms (4%)

Memory: -20.0MiB live, 70.5MiB allocated; 9ms collecting garbage
Remove: (abs x)
Compiler: Compiled 46 to 28 computations (39.1% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample870.0ms (35.3%)

explain56.0ms (2.3%)

preprocess270.0ms (11%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify138.0ms (5.6%)

localize57.0ms (2.3%)

series3.0ms (0.1%)

simplify168.0ms (6.8%)

rewrite30.0ms (1.2%)

eval1.0ms (0.1%)

prune1.0ms (0%)

simplify118.0ms (4.8%)

localize16.0ms (0.6%)

series2.0ms (0.1%)

simplify279.0ms (11.3%)

rewrite27.0ms (1.1%)

eval2.0ms (0.1%)

prune1.0ms (0%)

simplify101.0ms (4.1%)

localize10.0ms (0.4%)

series1.0ms (0%)

simplify108.0ms (4.4%)

rewrite66.0ms (2.7%)

eval1.0ms (0%)

prune1.0ms (0.1%)

regimes5.0ms (0.2%)

regimes4.0ms (0.2%)

simplify25.0ms (1%)

derivations3.0ms (0.1%)

preprocess100.0ms (4%)

end0.0ms (0%)

Profiling