Metrics for tanhf (example 3.4)

analyze155.0ms (3.1%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
0%	0%	100%	0%	0%	0%	0%	2
25%	25%	75%	0%	0%	0%	0%	3
37.5%	37.5%	62.5%	0%	0%	0%	0%	4
43.8%	43.7%	56.2%	0%	0%	0%	0%	5
46.9%	46.9%	53.1%	0%	0%	0%	0%	6
48.4%	48.4%	51.5%	0%	0%	0%	0%	7
49.2%	49.2%	50.8%	0%	0%	0%	0%	8
49.6%	49.6%	50.4%	0%	0%	0%	0%	9
49.8%	49.8%	50.2%	0%	0%	0%	0%	10
49.9%	49.9%	50.1%	0%	0%	0%	0%	11
50%	49.9%	50%	0%	0%	0%	0%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample4.6s (92.6%)

Results

2.4s	2043×	body	2048	valid
1.3s	3149×	body	1024	valid
430.0ms	1569×	body	512	valid
333.0ms	1380×	body	256	valid
114.0ms	112×	body	4096	valid
7.0ms	3×	body	8192	valid

Bogosity

preprocess67.0ms (1.4%)

Algorithm

1×	egg-herbie

Rules

924×	`fma-def`
316×	`div-sub`
266×	`times-frac`
188×	`associate-/r*`
134×	`sub-neg`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	14	26
1	34	26
2	50	22
3	84	22
4	156	22
5	291	22
6	607	22
7	1285	22
8	1706	22
9	1787	22
10	1842	22
11	1923	22
12	1963	22

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))
(/.f64 (-.f64 1 (cos.f64 (neg.f64 x))) (sin.f64 (neg.f64 x)))

Outputs
(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))
(tan.f64 (/.f64 x 2))
(tan.f64 (*.f64 x 1/2))
(/.f64 (-.f64 1 (cos.f64 (neg.f64 x))) (sin.f64 (neg.f64 x)))
(tan.f64 (/.f64 (neg.f64 x) 2))
(tan.f64 (neg.f64 (/.f64 x 2)))
(tan.f64 (*.f64 -1/2 x))
(tan.f64 (*.f64 x -1/2))

Compiler

Compiled 9 to 7 computations (22.2% saved)

simplify17.0ms (0.3%)

Algorithm

1×	egg-herbie

Rules

472×	`fma-def`
54×	`div-sub`
48×	`associate-/l*`
48×	`unsub-neg`
44×	`sub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

Stop Event

1×

saturated

Counts

1 → 2

Calls

Call 1

Inputs
(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))

Outputs
(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))
(tan.f64 (/.f64 x 2))

eval1.0ms (0%)

Compiler: Compiled 12 to 9 computations (25% saved)

prune1.0ms (0%)

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accurracy

100.0%

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(tan.f64 (/.f64 x 2))
▶	100.0%	(tan.f64 (/.f64 x 2))

Compiler

Compiled 10 to 8 computations (20% saved)

localize43.0ms (0.9%)

Compiler: Compiled 11 to 8 computations (27.3% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accurracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(tan.f64 (/.f64 x 2))

Compiler

Compiled 17 to 13 computations (23.5% saved)

regimes7.0ms (0.1%)

Accuracy

Total -27.2b remaining (-∞%)

Threshold costs -27.2b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(tan.f64 (/.f64 x 2))
(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))

Outputs
(tan.f64 (/.f64 x 2))

Calls

2 calls:

4.0ms	x
2.0ms	(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(/.f64 (-.f64 1 (cos.f64 x)) (sin.f64 x))`

Compiler

Compiled 22 to 16 computations (27.3% saved)

simplify4.0ms (0.1%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	11

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(tan.f64 (/.f64 x 2))

Outputs
(tan.f64 (/.f64 x 2))

Compiler

Compiled 5 to 4 computations (20% saved)

soundness38.0ms (0.8%)

Rules

472×	`fma-def`
54×	`div-sub`
48×	`associate-/l*`
48×	`unsub-neg`
44×	`sub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

Stop Event

1×

saturated

Compiler

Compiled 12 to 9 computations (25% saved)

end0.0ms (0%)

preprocess32.0ms (0.6%)

Compiler: Compiled 36 to 28 computations (22.2% saved)

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

analyze155.0ms (3.1%)

sample4.6s (92.6%)

preprocess67.0ms (1.4%)

simplify17.0ms (0.3%)

eval1.0ms (0%)

prune1.0ms (0%)

localize43.0ms (0.9%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes7.0ms (0.1%)

simplify4.0ms (0.1%)

soundness38.0ms (0.8%)

end0.0ms (0%)

preprocess32.0ms (0.6%)

Profiling

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11

Iter	Nodes	Cost
0	9	11
1	19	11
2	25	11
3	36	11
4	59	11
5	82	11
6	120	11
7	189	11
8	334	11
9	535	11
10	677	11
11	725	11