Metrics for Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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)

sample661.0ms (48.4%)

Memory

29.0MiB live, 874.7MiB allocated; 275ms collecting garbage

Samples

441.0ms

8 256×

valid

Precisions

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

ival-add: 121.0ms (51.2% of total)

ival-sub: 104.0ms (44% of total)

exact: 6.0ms (2.5% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain203.0ms (14.9%)

Memory

-26.3MiB live, 74.2MiB allocated; 43ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 x x)`
-	-	`#s(literal 1 binary64)`
-	-	`(-.f64 (+.f64 x x) #s(literal 1 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

175.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-add: 64.0ms (94.8% of total)

ival-sub: 3.0ms (4.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)

preprocess206.0ms (15.1%)

Memory

31.0MiB live, 172.6MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	18	16
2	32	16
3	63	16
4	186	16
5	879	15
0	4	5
0	6	5
1	12	5
2	18	5
3	34	5
4	107	5
5	595	5
6	5537	5
0	8040	4

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))

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

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Compiler

Compiled 5 to 4 computations (20% saved)

series2.0ms (0.1%)

Memory

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

Counts

4 → 7

Calls

Call 1

Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)

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

Calls

3 calls:

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

rewrite37.0ms (2.7%)

Memory

-15.9MiB live, 29.6MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	75
0	24	74
0	100	74

Stop Event

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

Counts

11 → 18

Calls

Call 1

Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))

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

eval2.0ms (0.1%)

Memory: 3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 186 to 54 computations (71% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

100.0%

Counts

21 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	50.8%	#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
▶	51.1%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 17 computations (19% saved)

series2.0ms (0.1%)

Memory

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

Counts

6 → 7

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite60.0ms (4.4%)

Memory

-15.5MiB live, 29.9MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	87
0	23	86
0	97	86

Stop Event

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

Counts

13 → 17

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (* 2 x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))

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

eval1.0ms (0.1%)

Memory: 4.0MiB live, 4.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 171 to 42 computations (75.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	14	1	15
Fresh	0	0	0
Picked	1	1	2
Done	0	1	1
Total	15	3	18

Accuracy

100.0%

Counts

18 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	50.8%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.1%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 16 computations (23.8% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 7

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x

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

Calls

3 calls:

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

rewrite67.0ms (4.9%)

Memory

-19.2MiB live, 24.7MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	78
0	24	77
0	99	77

Stop Event

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

Counts

10 → 14

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))

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

eval2.0ms (0.1%)

Memory: 2.1MiB live, 2.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 175 to 42 computations (76% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	15	0	15
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	15	3	18

Accuracy

100.0%

Counts

18 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	50.8%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.1%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes6.0ms (0.4%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))

Calls

3 calls:

2.0ms	x
2.0ms	(+.f64 x x)
2.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

3 → 3

Calls

Call 1

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

Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))

Calls

3 calls:

1.0ms	x
1.0ms	(+.f64 x x)
1.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
98.3%	3	`(+.f64 x x)`
98.3%	3	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
98.3%	3	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Calls

3 calls:

1.0ms	x
1.0ms	(+.f64 x x)
1.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
51.1%	1	`(+.f64 x x)`
51.1%	1	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
51.1%	1	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch49.0ms (3.6%)

Memory

4.7MiB live, 57.2MiB allocated; 13ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
10.0ms	3.3862716131579187e-10	456872564.0656754
36.0ms	-3616.8788720455555	-0.00018304646780511715

Samples

10.0ms

304×

valid

Compiler

Compiled 312 to 274 computations (12.2% saved)

Precisions

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

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

ival-sub: 1.0ms (28.3% 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)

simplify34.0ms (2.5%)

Memory

-36.5MiB live, 52.5MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	37
1	26	37
2	35	37
3	63	37
4	154	37
5	1149	37

Stop Event

1×	node limit

Calls

Call 1

Inputs

(-.f64 (+.f64 x x) #s(literal 1 binary64))

(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))

#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -1/2 binary64)) (not (<=.f64 x #s(literal 1/2 binary64)))) #s(approx (- (+ x x) 1) (+.f64 x x)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

derivations2.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess15.0ms (1.1%)

Memory: 32.9MiB live, 32.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 84 to 42 computations (50% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample661.0ms (48.4%)

explain203.0ms (14.9%)

preprocess206.0ms (15.1%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

rewrite37.0ms (2.7%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.1%)

rewrite60.0ms (4.4%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite67.0ms (4.9%)

eval2.0ms (0.1%)

prune2.0ms (0.2%)

regimes6.0ms (0.4%)

regimes5.0ms (0.3%)

regimes3.0ms (0.2%)

bsearch49.0ms (3.6%)

simplify34.0ms (2.5%)

derivations2.0ms (0.1%)

preprocess15.0ms (1.1%)

end0.0ms (0%)

Profiling