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

analyze0.0ms (0%)

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 5 computations (28.6% saved)

Precisions

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

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

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample543.0ms (45.3%)

Results

357.0ms

8256×

valid

Precisions

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

ival-add: 56.0ms (48.6% of total)

ival-sub: 45.0ms (39.1% of total)

const: 11.0ms (9.5% of total)

backward-pass: 3.0ms (2.6% of total)

Bogosity

preprocess92.0ms (7.7%)

Algorithm

1×	egg-herbie

Rules

148×	`fma-neg`
32×	`fma-define`
32×	`sub-neg`
31×	`cancel-sign-sub-inv`
24×	`associate-+l-`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	13	76
1	35	60
2	94	52
3	211	48
4	361	48
5	488	48
6	525	48
7	542	48
8	544	48

Stop Event

1×

saturated

Calls

Call 1

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

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

explain41.0ms (3.4%)

FPErrors

Click to see full error table

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

Results

23.0ms

512×

valid

Compiler

Compiled 30 to 14 computations (53.3% saved)

Precisions

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

ival-sub: 3.0ms (42.7% of total)

ival-add: 3.0ms (42.7% of total)

const: 1.0ms (14.2% of total)

backward-pass: 0.0ms (0% of total)

eval1.0ms (0%)

Compiler: Compiled 14 to 7 computations (50% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize40.0ms (3.3%)

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	-6272	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	cost-diff	0	(+.f64 x x)
✓	accuracy	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	accuracy	100.0%	(+.f64 x x)

Rules

85×	`fma-neg`
18×	`sub-neg`
15×	`cancel-sign-sub`
13×	`cancel-sign-sub-inv`
10×	`fma-define`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	31
1	21	27
2	27	27
3	33	27
4	37	27
5	46	27
6	77	27
7	171	27
8	272	27
9	325	27
10	337	27
11	338	27

Stop Event

1×

saturated

Calls

Call 1

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

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

Results

10.0ms

256×

valid

Compiler

Compiled 12 to 5 computations (58.3% saved)

Precisions

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

ival-sub: 2.0ms (56% of total)

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

series6.0ms (0.5%)

Counts

2 → 24

Calls

Call 1

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

Outputs
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt #s(literal -1 binary64)>
#<alt (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))>
#<alt (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))>
#<alt (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))>
#<alt (*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))>
#<alt (*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))>
#<alt (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))>
#<alt (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))>

Calls

6 calls:

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

rewrite196.0ms (16.3%)

Algorithm

1×	batch-egg-rewrite

Rules

684×	`prod-diff`
367×	`log1p-expm1-u`
367×	`expm1-log1p-u`
348×	`add-exp-log`
335×	`add-log-exp`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	20
1	94	20
2	1404	20

Stop Event

1×	node limit

Counts

2 → 64

Calls

Call 1

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

Outputs
#s(literal -3 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal -1/2 binary64)
#s(literal -1/3 binary64)
#s(literal 0 binary64)
#s(literal 1/9 binary64)
#s(literal 1/6 binary64)
#s(literal 1/4 binary64)
#s(literal 1/3 binary64)
#s(literal 1/2 binary64)
#s(literal 2/3 binary64)
#s(literal 3/4 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
#s(literal 4/3 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 7/3 binary64)
#s(literal 5/2 binary64)
#s(literal 3 binary64)
#s(literal 10/3 binary64)
#s(literal 7/2 binary64)
#s(literal 4 binary64)
#s(literal 9/2 binary64)
#s(literal 5 binary64)
#s(literal 6 binary64)
#s(literal 8 binary64)
#s(literal 9 binary64)
#s(literal 16 binary64)
#s(literal 64 binary64)
#s(literal 512 binary64)
#s(literal -3 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal -1/2 binary64)
#s(literal -1/3 binary64)
#s(literal 0 binary64)
#s(literal 1/9 binary64)
#s(literal 1/6 binary64)
#s(literal 1/4 binary64)
#s(literal 1/3 binary64)
#s(literal 1/2 binary64)
#s(literal 2/3 binary64)
#s(literal 3/4 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
#s(literal 4/3 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 7/3 binary64)
#s(literal 5/2 binary64)
#s(literal 3 binary64)
#s(literal 10/3 binary64)
#s(literal 7/2 binary64)
#s(literal 4 binary64)
#s(literal 9/2 binary64)
#s(literal 5 binary64)
#s(literal 6 binary64)
#s(literal 8 binary64)
#s(literal 9 binary64)
#s(literal 16 binary64)
#s(literal 64 binary64)
#s(literal 512 binary64)

simplify29.0ms (2.4%)

Algorithm

1×	egg-herbie

Rules

82×	`fma-define`
29×	`fma-neg`
21×	`distribute-rgt-in`
20×	`distribute-lft-in`
18×	`sub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	45	313
1	65	313
2	101	313
3	168	313
4	189	313
5	251	313
6	330	313
7	365	313
8	384	313
9	422	313
10	423	313

Stop Event

1×

saturated

Counts

88 → 37

Calls

Call 1

Inputs
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
#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 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))
(*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))
(*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))
(*.f64 #s(literal 2 binary64) x)
(.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))
(.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))
(.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))
#s(literal -3 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal -1/2 binary64)
#s(literal -1/3 binary64)
#s(literal 0 binary64)
#s(literal 1/9 binary64)
#s(literal 1/6 binary64)
#s(literal 1/4 binary64)
#s(literal 1/3 binary64)
#s(literal 1/2 binary64)
#s(literal 2/3 binary64)
#s(literal 3/4 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
#s(literal 4/3 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 7/3 binary64)
#s(literal 5/2 binary64)
#s(literal 3 binary64)
#s(literal 10/3 binary64)
#s(literal 7/2 binary64)
#s(literal 4 binary64)
#s(literal 9/2 binary64)
#s(literal 5 binary64)
#s(literal 6 binary64)
#s(literal 8 binary64)
#s(literal 9 binary64)
#s(literal 16 binary64)
#s(literal 64 binary64)
#s(literal 512 binary64)
#s(literal -3 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal -1/2 binary64)
#s(literal -1/3 binary64)
#s(literal 0 binary64)
#s(literal 1/9 binary64)
#s(literal 1/6 binary64)
#s(literal 1/4 binary64)
#s(literal 1/3 binary64)
#s(literal 1/2 binary64)
#s(literal 2/3 binary64)
#s(literal 3/4 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
#s(literal 4/3 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 7/3 binary64)
#s(literal 5/2 binary64)
#s(literal 3 binary64)
#s(literal 10/3 binary64)
#s(literal 7/2 binary64)
#s(literal 4 binary64)
#s(literal 9/2 binary64)
#s(literal 5 binary64)
#s(literal 6 binary64)
#s(literal 8 binary64)
#s(literal 9 binary64)
#s(literal 16 binary64)
#s(literal 64 binary64)
#s(literal 512 binary64)

Outputs
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) x)
#s(literal -1 binary64)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(*.f64 x (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)
(.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(.f64 #s(literal -1 binary64) (.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64))))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
#s(literal -3 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal -1/2 binary64)
#s(literal -1/3 binary64)
#s(literal 0 binary64)
#s(literal 1/9 binary64)
#s(literal 1/6 binary64)
#s(literal 1/4 binary64)
#s(literal 1/3 binary64)
#s(literal 1/2 binary64)
#s(literal 2/3 binary64)
#s(literal 3/4 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
#s(literal 4/3 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 7/3 binary64)
#s(literal 5/2 binary64)
#s(literal 3 binary64)
#s(literal 10/3 binary64)
#s(literal 7/2 binary64)
#s(literal 4 binary64)
#s(literal 9/2 binary64)
#s(literal 5 binary64)
#s(literal 6 binary64)
#s(literal 8 binary64)
#s(literal 9 binary64)
#s(literal 16 binary64)
#s(literal 64 binary64)
#s(literal 512 binary64)
#s(literal -3 binary64)
#s(literal -2 binary64)
#s(literal -1 binary64)
#s(literal -1/2 binary64)
#s(literal -1/3 binary64)
#s(literal 0 binary64)
#s(literal 1/9 binary64)
#s(literal 1/6 binary64)
#s(literal 1/4 binary64)
#s(literal 1/3 binary64)
#s(literal 1/2 binary64)
#s(literal 2/3 binary64)
#s(literal 3/4 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
#s(literal 4/3 binary64)
#s(literal 3/2 binary64)
#s(literal 2 binary64)
#s(literal 7/3 binary64)
#s(literal 5/2 binary64)
#s(literal 3 binary64)
#s(literal 10/3 binary64)
#s(literal 7/2 binary64)
#s(literal 4 binary64)
#s(literal 9/2 binary64)
#s(literal 5 binary64)
#s(literal 6 binary64)
#s(literal 8 binary64)
#s(literal 9 binary64)
#s(literal 16 binary64)
#s(literal 64 binary64)
#s(literal 512 binary64)

eval4.0ms (0.3%)

Compiler: Compiled 125 to 73 computations (41.6% saved)

prune9.0ms (0.7%)

Pruning

5 alts after pruning (4 fresh and 1 done)

	Pruned	Kept	Total
New	33	4	37
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	33	5	38

Accuracy

100.0%

Counts

38 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	2.3%	(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
▶	12.3%	(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
▶	10.3%	(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
▶	50.8%	#s(literal -1 binary64)

Compiler

Compiled 20 to 18 computations (10% saved)

localize33.0ms (2.7%)

Algorithm

1×	egg-herbie

Localize:

Found 6 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	128	(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
✓	cost-diff	128	(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
✓	cost-diff	128	(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
✓	accuracy	100.0%	(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
✓	accuracy	100.0%	(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
✓	accuracy	100.0%	(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))

Rules

3× 1-exp

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	10
1	19	10

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal -1 binary64)
(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
#s(literal -3 binary64)
#s(literal 1 binary64)
(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
#s(literal -1/3 binary64)
#s(literal 1 binary64)
(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
#s(literal 512 binary64)
#s(literal 1 binary64)

Outputs
#s(literal -1 binary64)
(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
#s(literal -4 binary64)
#s(literal -3 binary64)
#s(literal 1 binary64)
(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
#s(literal -4/3 binary64)
#s(literal -1/3 binary64)
#s(literal 1 binary64)
(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
#s(literal 511 binary64)
#s(literal 512 binary64)
#s(literal 1 binary64)

Results

18.0ms

256×

valid

Compiler

Compiled 18 to 10 computations (44.4% saved)

Precisions

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

ival-sub: 4.0ms (84.7% of total)

const: 1.0ms (21.2% of total)

backward-pass: 0.0ms (0% of total)

series1.0ms (0.1%)

Counts

3 → 0

Calls

Call 1

Inputs
#<alt (-.f64 #s(literal -3 binary64) #s(literal 1 binary64))>
#<alt (-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))>
#<alt (-.f64 #s(literal 512 binary64) #s(literal 1 binary64))>

Outputs

rewrite25.0ms (2.1%)

Algorithm

1×	batch-egg-rewrite

Rules

3× 1-exp

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	3
1	18	3

Stop Event

1×

saturated

Counts

3 → 3

Calls

Call 1

Inputs
(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))

Outputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal 511 binary64)

simplify5.0ms (0.4%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3

Stop Event

1×

saturated

Counts

3 → 3

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal 511 binary64)

Outputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal 511 binary64)

eval0.0ms (0%)

Compiler: Compiled 4 to 4 computations (0% saved)

prune2.0ms (0.2%)

Pruning

5 alts after pruning (3 fresh and 2 done)

	Pruned	Kept	Total
New	0	3	3
Fresh	0	0	0
Picked	3	1	4
Done	0	1	1
Total	3	5	8

Accuracy

100.0%

Counts

8 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	2.3%	#s(literal 511 binary64)
✓	50.8%	#s(literal -1 binary64)
▶	12.3%	#s(literal -4/3 binary64)
▶	10.3%	#s(literal -4 binary64)

Compiler

Compiled 14 to 12 computations (14.3% saved)

localize21.0ms (1.7%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal 511 binary64)

Outputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal 511 binary64)

Results

10.0ms

256×

valid

Compiler

Compiled 5 to 5 computations (0% saved)

Precisions

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune3.0ms (0.2%)

Pruning

5 alts after pruning (0 fresh and 5 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	3	3
Done	2	2
Total	5	5

Accuracy

100.0%

Counts

5 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	2.3%	#s(literal 511 binary64)
✓	50.8%	#s(literal -1 binary64)
✓	12.3%	#s(literal -4/3 binary64)
✓	10.3%	#s(literal -4 binary64)

Compiler

Compiled 33 to 26 computations (21.2% saved)

regimes10.0ms (0.8%)

Counts

8 → 1

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal -1 binary64)
#s(literal 511 binary64)
(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
(-.f64 (+.f64 x x) #s(literal 1 binary64))

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 12 to 7 computations (41.7% saved)

regimes6.0ms (0.5%)

Counts

7 → 1

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)
#s(literal -1 binary64)
#s(literal 511 binary64)
(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal -1/3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))

Outputs
#s(literal -1 binary64)

Calls

1 calls:

6.0ms

Results

Accuracy	Segments	Branch
50.8%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

regimes2.0ms (0.2%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -4/3 binary64)

Outputs
#s(literal -4/3 binary64)

Calls

1 calls:

2.0ms

Results

Accuracy	Segments	Branch
12.3%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

regimes1.0ms (0.1%)

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(literal -4 binary64)

Outputs
#s(literal -4 binary64)

Calls

1 calls:

1.0ms

Results

Accuracy	Segments	Branch
10.3%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

simplify3.0ms (0.3%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
2×	`sub-neg`
1×	`*-rgt-identity`
1×	`*-commutative`
1×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	22
1	19	22
2	22	22
3	25	22

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness91.0ms (7.6%)

Rules

684×	`prod-diff`
367×	`log1p-expm1-u`
367×	`expm1-log1p-u`
348×	`add-exp-log`
335×	`add-log-exp`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	3
1	18	3
0	8	20
1	94	20
2	1404	20

Stop Event

1×	done
1×	node limit
1×	saturated

Compiler

Compiled 19 to 16 computations (15.8% saved)

preprocess34.0ms (2.8%)

Compiler: Compiled 30 to 20 computations (33.3% saved)

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

analyze0.0ms (0%)

sample543.0ms (45.3%)

preprocess92.0ms (7.7%)

explain41.0ms (3.4%)

eval1.0ms (0%)

prune1.0ms (0.1%)

localize40.0ms (3.3%)

series6.0ms (0.5%)

rewrite196.0ms (16.3%)

simplify29.0ms (2.4%)

eval4.0ms (0.3%)

prune9.0ms (0.7%)

localize33.0ms (2.7%)

series1.0ms (0.1%)

rewrite25.0ms (2.1%)

simplify5.0ms (0.4%)

eval0.0ms (0%)

prune2.0ms (0.2%)

localize21.0ms (1.7%)

eval0.0ms (0%)

prune3.0ms (0.2%)

regimes10.0ms (0.8%)

regimes6.0ms (0.5%)

regimes2.0ms (0.2%)

regimes1.0ms (0.1%)

simplify3.0ms (0.3%)

soundness91.0ms (7.6%)

preprocess34.0ms (2.8%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	8	31
1	21	27
2	27	27
3	33	27
4	37	27
5	46	27
6	77	27
7	171	27
8	272	27
9	325	27
10	337	27
11	338	27

Iter	Nodes	Cost
0	45	313
1	65	313
2	101	313
3	168	313
4	189	313
5	251	313
6	330	313
7	365	313
8	384	313
9	422	313
10	423	313

Iter	Nodes	Cost
0	8	31
1	21	27
2	27	27
3	33	27
4	37	27
5	46	27
6	77	27
7	171	27
8	272	27
9	325	27
10	337	27
11	338	27

Iter	Nodes	Cost
0	45	313
1	65	313
2	101	313
3	168	313
4	189	313
5	251	313
6	330	313
7	365	313
8	384	313
9	422	313
10	423	313

Iter	Nodes	Cost
0	8	31
1	21	27
2	27	27
3	33	27
4	37	27
5	46	27
6	77	27
7	171	27
8	272	27
9	325	27
10	337	27
11	338	27

Iter	Nodes	Cost
0	45	313
1	65	313
2	101	313
3	168	313
4	189	313
5	251	313
6	330	313
7	365	313
8	384	313
9	422	313
10	423	313