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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

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)

sample362.0ms (22.1%)

Memory

19.7MiB live, 759.0MiB allocated

Samples

226.0ms

8 256×

valid

Precisions

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

ival-sub: 42.0ms (44.3% of total)

ival-add: 42.0ms (44.3% of total)

ival-true: 5.0ms (5.3% of total)

...in/eval/compile.rkt:110:19: 3.0ms (3.2% of total)

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

Bogosity

preprocess69.0ms (4.2%)

Memory

-24.5MiB live, 89.8MiB allocated

Algorithm

1×	egg-herbie

Rules

148×	`fmm-def`
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))

explain60.0ms (3.7%)

Memory

26.3MiB live, 111.7MiB allocated

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

33.0ms

512×

valid

Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions

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

ival-add: 4.0ms (58% of total)

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

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

...in/eval/compile.rkt:110:19: 0.0ms (0% of total)

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

eval0.0ms (0%)

Memory: 1.4MiB live, 1.4MiB allocated
Compiler: Compiled 14 to 7 computations (50% saved)

prune297.0ms (18.2%)

Memory

-35.9MiB live, 3.3MiB allocated

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)

simplify19.0ms (1.2%)

Memory

3.9MiB live, 43.5MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

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

Rules

85×	`fmm-def`
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)

localize13.0ms (0.8%)

Memory

34.3MiB live, 34.2MiB allocated

Localize:

Found 2 expressions of interest:

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

Samples

7.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-sub: 1.0ms (35.2% of total)

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

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

...in/eval/compile.rkt:110:19: 0.0ms (0% of total)

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

series4.0ms (0.2%)

Memory

-35.0MiB live, 6.8MiB allocated

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
2.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)

rewrite389.0ms (23.8%)

Memory

-23.1MiB live, 323.9MiB allocated

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)

simplify30.0ms (1.8%)

Memory

19.0MiB live, 58.4MiB allocated

Algorithm

1×	egg-herbie

Rules

82×	`fma-define`
29×	`fmm-def`
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%)

Memory: 11.4MiB live, 11.4MiB allocated
Compiler: Compiled 125 to 73 computations (41.6% saved)

prune9.0ms (0.5%)

Memory

-16.2MiB live, 23.1MiB allocated

Pruning

6 alts after pruning (5 fresh and 1 done)

	Pruned	Kept	Total
New	32	5	37
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	6	38

Accuracy

100.0%

Counts

38 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	2.5%	(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
▶	2.5%	(-.f64 #s(literal 64 binary64) #s(literal 1 binary64))
▶	10.0%	(-.f64 #s(literal 5/6 binary64) #s(literal 1 binary64))
▶	10.3%	(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
▶	51.2%	#s(literal -1 binary64)

Compiler

Compiled 42 to 40 computations (4.8% saved)

simplify6.0ms (0.4%)

Memory

11.7MiB live, 11.7MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 4 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 64 binary64) #s(literal 1 binary64))
✓	cost-diff	128	(-.f64 #s(literal 5/6 binary64) #s(literal 1 binary64))
✓	cost-diff	128	(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))

Rules

3× 1-exp

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	13
1	22	13

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 5/6 binary64) #s(literal 1 binary64))
#s(literal 5/6 binary64)
#s(literal 1 binary64)
(-.f64 #s(literal 64 binary64) #s(literal 1 binary64))
#s(literal 64 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 5/6 binary64) #s(literal 1 binary64))
#s(literal -1/6 binary64)
#s(literal 5/6 binary64)
#s(literal 1 binary64)
(-.f64 #s(literal 64 binary64) #s(literal 1 binary64))
#s(literal 63 binary64)
#s(literal 64 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)

localize112.0ms (6.9%)

Memory

-24.6MiB live, 55.2MiB allocated

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(-.f64 #s(literal 512 binary64) #s(literal 1 binary64))
✓	accuracy	100.0%	(-.f64 #s(literal 64 binary64) #s(literal 1 binary64))
✓	accuracy	98.4%	(-.f64 #s(literal 5/6 binary64) #s(literal 1 binary64))
✓	accuracy	100.0%	(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))

Samples

17.0ms

256×

valid

Compiler

Compiled 23 to 13 computations (43.5% saved)

Precisions

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

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

...in/eval/compile.rkt:111:19: 3.0ms (35.4% of total)

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

...in/eval/compile.rkt:110:19: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.1MiB live, 0.1MiB allocated

Counts

4 → 0

Calls

Call 1

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

Outputs

rewrite74.0ms (4.5%)

Memory

-1.1MiB live, 38.0MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

3× 1-exp

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	4
1	21	4

Stop Event

1×

saturated

Counts

4 → 4

Calls

Call 1

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

Outputs
#s(literal -4 binary64)
#s(literal -1/6 binary64)
#s(literal 63 binary64)
#s(literal 511 binary64)

simplify6.0ms (0.3%)

Memory

12.9MiB live, 12.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4

Stop Event

1×

saturated

Counts

4 → 4

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -1/6 binary64)
#s(literal 63 binary64)
#s(literal 511 binary64)

Outputs
#s(literal -4 binary64)
#s(literal -1/6 binary64)
#s(literal 63 binary64)
#s(literal 511 binary64)

eval1.0ms (0%)

Memory: 1.9MiB live, 1.9MiB allocated
Compiler: Compiled 5 to 5 computations (0% saved)

prune3.0ms (0.2%)

Memory

8.7MiB live, 8.7MiB allocated

Pruning

7 alts after pruning (4 fresh and 3 done)

	Pruned	Kept	Total
New	0	4	4
Fresh	0	0	0
Picked	3	2	5
Done	0	1	1
Total	3	7	10

Accuracy

100.0%

Counts

10 → 7

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	10.0%	(-.f64 #s(literal 5/6 binary64) #s(literal 1 binary64))
▶	2.5%	#s(literal 511 binary64)
▶	2.5%	#s(literal 63 binary64)
▶	10.0%	#s(literal -1/6 binary64)
✓	51.2%	#s(literal -1 binary64)
▶	10.3%	#s(literal -4 binary64)

Compiler

Compiled 20 to 18 computations (10% saved)

simplify6.0ms (0.4%)

Memory

-29.0MiB live, 10.7MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	4

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -1/6 binary64)
#s(literal 63 binary64)
#s(literal 511 binary64)

Outputs
#s(literal -4 binary64)
#s(literal -1/6 binary64)
#s(literal 63 binary64)
#s(literal 511 binary64)

localize14.0ms (0.9%)

Memory

36.0MiB live, 36.0MiB allocated

Samples

9.0ms

256×

valid

Compiler

Compiled 6 to 7 computations (-16.7% saved)

Precisions

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

...in/eval/compile.rkt:111:19: 3.0ms (79.5% of total)

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

...in/eval/compile.rkt:110:19: 0.0ms (0% of total)

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

eval0.0ms (0%)

Memory: 0.6MiB live, 0.6MiB allocated
Compiler: Compiled 1 to 1 computations (0% saved)

prune5.0ms (0.3%)

Memory

-28.7MiB live, 10.7MiB allocated

Pruning

7 alts after pruning (0 fresh and 7 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	4	4
Done	3	3
Total	7	7

Accuracy

100.0%

Counts

7 → 7

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	10.0%	(-.f64 #s(literal 5/6 binary64) #s(literal 1 binary64))
✓	2.5%	#s(literal 511 binary64)
✓	2.5%	#s(literal 63 binary64)
✓	10.0%	#s(literal -1/6 binary64)
✓	51.2%	#s(literal -1 binary64)
✓	10.3%	#s(literal -4 binary64)

Compiler

Compiled 43 to 35 computations (18.6% saved)

regimes16.0ms (1%)

Memory

-1.1MiB live, 39.4MiB allocated

Counts

10 → 1

Calls

Call 1

Inputs
#s(literal -4 binary64)
#s(literal -1 binary64)
#s(literal -1/6 binary64)
#s(literal 63 binary64)
#s(literal 511 binary64)
(-.f64 #s(literal -3 binary64) #s(literal 1 binary64))
(-.f64 #s(literal 5/6 binary64) #s(literal 1 binary64))
(-.f64 #s(literal 64 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:

8.0ms	x
4.0ms	(+.f64 x 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)

regimes4.0ms (0.3%)

Memory

15.2MiB live, 15.2MiB allocated

Counts

9 → 1

Calls

Call 1

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

Outputs
#s(literal -1 binary64)

Calls

1 calls:

4.0ms

Results

Accuracy	Segments	Branch
51.2%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

regimes2.0ms (0.1%)

Memory

5.8MiB live, 5.8MiB allocated

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.2%)

Memory

10.1MiB live, 10.1MiB allocated

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	10	21
1	18	21
2	21	21
3	24	21

Stop Event

1×

saturated

Calls

Call 1

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

soundness88.0ms (5.4%)

Memory

-22.1MiB live, 94.9MiB allocated

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	15	4
1	21	4
0	8	20
1	94	20
2	1404	20

Stop Event

1×	done
1×	node limit
1×	saturated

Compiler

Compiled 13 to 10 computations (23.1% saved)

preprocess39.0ms (2.4%)

Memory: -11.7MiB live, 108.9MiB allocated
Compiler: Compiled 28 to 18 computations (35.7% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

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

analyze0.0ms (0%)

sample362.0ms (22.1%)

preprocess69.0ms (4.2%)

explain60.0ms (3.7%)

eval0.0ms (0%)

prune297.0ms (18.2%)

simplify19.0ms (1.2%)

localize13.0ms (0.8%)

series4.0ms (0.2%)

rewrite389.0ms (23.8%)

simplify30.0ms (1.8%)

eval4.0ms (0.3%)

prune9.0ms (0.5%)

simplify6.0ms (0.4%)

localize112.0ms (6.9%)

series0.0ms (0%)

rewrite74.0ms (4.5%)

simplify6.0ms (0.3%)

eval1.0ms (0%)

prune3.0ms (0.2%)

simplify6.0ms (0.4%)

localize14.0ms (0.9%)

eval0.0ms (0%)

prune5.0ms (0.3%)

regimes16.0ms (1%)

regimes4.0ms (0.3%)

regimes2.0ms (0.1%)

simplify3.0ms (0.2%)

soundness88.0ms (5.4%)

preprocess39.0ms (2.4%)

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