Metrics for tanhf (example 3.4)

analyze136.0ms (4.4%)

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)

Precisions

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

ival-cos: 19.0ms (33.7% of total)

ival-sub: 16.0ms (28.4% of total)

ival-sin: 13.0ms (23.1% of total)

ival-div: 6.0ms (10.7% of total)

const: 2.0ms (3.6% of total)

backward-pass: 1.0ms (1.8% of total)

sample2.5s (80.8%)

Results

646.0ms	4256×	0	valid
415.0ms	2092×	1	valid
1.1s	1905×	2	valid
2.0ms	3×	3	valid

Precisions

Click to see histograms. Total time spent on operations: 1.9s

ival-cos: 1.1s (56.2% of total)

ival-sin: 330.0ms (17.1% of total)

backward-pass: 226.0ms (11.7% of total)

ival-sub: 155.0ms (8.1% of total)

ival-div: 116.0ms (6% of total)

const: 17.0ms (0.9% of total)

Bogosity

preprocess55.0ms (1.8%)

Algorithm

1×	egg-herbie

Rules

199×	`fma-define`
83×	`fma-neg`
47×	`times-frac`
47×	`div-sub`
37×	`distribute-rgt-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	17	60
1	46	60
2	85	56
3	191	56
4	470	56
5	815	56
6	981	56

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 (neg.f64 x))) (sin.f64 (neg.f64 x)))
(neg.f64 (/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 (neg.f64 x))) (sin.f64 (neg.f64 x))))

Outputs
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))
(tan.f64 (/.f64 x #s(literal 2 binary64)))
(tan.f64 (*.f64 x #s(literal 1/2 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))
(tan.f64 (/.f64 x #s(literal 2 binary64)))
(tan.f64 (*.f64 x #s(literal 1/2 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 (neg.f64 x))) (sin.f64 (neg.f64 x)))
(tan.f64 (/.f64 (neg.f64 x) #s(literal 2 binary64)))
(neg.f64 (tan.f64 (/.f64 x #s(literal 2 binary64))))
(tan.f64 (*.f64 x #s(literal -1/2 binary64)))
(neg.f64 (/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 (neg.f64 x))) (sin.f64 (neg.f64 x))))
(tan.f64 (/.f64 x #s(literal 2 binary64)))
(tan.f64 (*.f64 x #s(literal 1/2 binary64)))

Symmetry

(negabs x)

explain221.0ms (7.2%)

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Underpredictions	Example	Subexpression
86	1	(8.464670072903256e-162)	2	(1.6268837900757984e+144)	`(-.f64 #s(literal 1 binary64) (cos.f64 x))`
48	0	-	2	(8.464670072903256e-162)	`(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))`
0	0	-	0	-	`x`
0	0	-	0	-	`(sin.f64 x)`
0	0	-	0	-	`#s(literal 1 binary64)`
0	0	-	0	-	`(cos.f64 x)`

Results

107.0ms	260×	0	valid
38.0ms	160×	1	valid
44.0ms	90×	2	valid
2.0ms	2×	3	valid

Compiler

Compiled 46 to 26 computations (43.5% saved)

Precisions

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

ival-sin: 85.0ms (53.1% of total)

ival-cos: 46.0ms (28.7% of total)

ival-sub: 10.0ms (6.2% of total)

backward-pass: 9.0ms (5.6% of total)

ival-div: 7.0ms (4.4% of total)

const: 2.0ms (1.2% of total)

eval0.0ms (0%)

Compiler: Compiled 9 to 7 computations (22.2% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

localize27.0ms (0.9%)

Results

17.0ms

256×

valid

Compiler

Compiled 11 to 8 computations (27.3% saved)

Precisions

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

ival-tan: 5.0ms (51.6% of total)

ival-div: 4.0ms (41.3% of total)

const: 1.0ms (10.3% of total)

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

eval0.0ms (0%)

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

prune2.0ms (0.1%)

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

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(tan.f64 (/.f64 x #s(literal 2 binary64)))

Compiler

Compiled 17 to 13 computations (23.5% saved)

regimes3.0ms (0.1%)

Accuracy

Total -30.6b remaining (-∞%)

Threshold costs -30.6b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(tan.f64 (/.f64 x #s(literal 2 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))

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

Calls

2 calls:

1.0ms	x
1.0ms	(/.f64 (-.f64 #s(literal 1 binary64) (cos.f64 x)) (sin.f64 x))

Results

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

Compiler

Compiled 10 to 7 computations (30% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	14

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness47.0ms (1.6%)

Rules

199×	`fma-define`
83×	`fma-neg`
47×	`times-frac`
47×	`div-sub`
37×	`distribute-rgt-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	17	60
1	46	60
2	85	56
3	191	56
4	470	56
5	815	56
6	981	56

Stop Event

1×	done
1×	saturated

Compiler

Compiled 17 to 13 computations (23.5% saved)

preprocess93.0ms (3.1%)

Remove: (negabs x)
Compiler: Compiled 56 to 44 computations (21.4% saved)

tanhf (example 3.4)

analyze136.0ms (4.4%)

sample2.5s (80.8%)

preprocess55.0ms (1.8%)

explain221.0ms (7.2%)

eval0.0ms (0%)

prune1.0ms (0%)

localize27.0ms (0.9%)

eval0.0ms (0%)

prune2.0ms (0.1%)

regimes3.0ms (0.1%)

simplify2.0ms (0.1%)

soundness47.0ms (1.6%)

preprocess93.0ms (3.1%)

end0.0ms (0%)

Profiling