Metrics for ln(1 + x)

analyze2.0ms (0.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
50%	50%	50%	0%	0%	0%	0%	2
66.7%	50%	25%	0%	0%	25%	0%	3
83.3%	62.5%	12.5%	0%	0%	25%	0%	4
91.7%	68.7%	6.2%	0%	0%	25%	0%	5
95.8%	71.8%	3.1%	0%	0%	25%	0%	6
97.9%	73.4%	1.6%	0%	0%	25%	0%	7
99%	74.2%	0.8%	0%	0%	25%	0%	8
99.5%	74.6%	0.4%	0%	0%	25%	0%	9
99.7%	74.8%	0.2%	0%	0%	25%	0%	10
99.9%	74.9%	0.1%	0%	0%	25%	0%	11
99.9%	74.9%	0%	0%	0%	25%	0%	12

Compiler

Compiled 6 to 5 computations (16.7% saved)

Precisions

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

Operation ival-log, time spent: 1.0ms, 136.0% of total-time

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample3.0s (85.8%)

Results

533.0ms	3988×	256	valid
1.6s	2748×	1024	valid
471.0ms	1336×	512	valid
105.0ms	183×	2048	valid
0.0ms	2×	256	invalid
0.0ms	1×	256	valid

Precisions

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

Operation ival-log, time spent: 1.6s, 88.0% of total-time

Operation ival-add, time spent: 188.0ms, 10.0% of total-time

Operation const, time spent: 27.0ms, 1.0% of total-time

Bogosity

preprocess269.0ms (7.7%)

Algorithm

1×	egg-herbie

Rules

76×	`fma-neg`
42×	`sub-neg`
32×	`fma-define`
22×	`cancel-sign-sub-inv`
20×	`associate-+l-`

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
168	-	-	`(log.f64 (+.f64 1 x))`
0	-	-	`x`
0	-	-	`(+.f64 1 x)`
0	-	-	`1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

Stop Event

1×

saturated

Calls

Call 1

Inputs
(log.f64 (+.f64 1 x))
(log.f64 (+.f64 1 x))
(log.f64 (+.f64 1 (neg.f64 x)))
(neg.f64 (log.f64 (+.f64 1 (neg.f64 x))))

Outputs
(log.f64 (+.f64 1 x))
(log1p.f64 x)
(log.f64 (+.f64 1 x))
(log1p.f64 x)
(log.f64 (+.f64 1 (neg.f64 x)))
(log1p.f64 (neg.f64 x))
(neg.f64 (log.f64 (+.f64 1 (neg.f64 x))))
(neg.f64 (log1p.f64 (neg.f64 x)))

Compiler

Compiled 27 to 20 computations (25.9% saved)

Precisions

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

Operation ival-log, time spent: 75.0ms, 81.0% of total-time

Operation ival-add, time spent: 14.0ms, 15.0% of total-time

Operation const, time spent: 3.0ms, 3.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 3 to 2 computations (33.3% saved)

prune3.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(log1p.f64 x)

Compiler

Compiled 3 to 2 computations (33.3% saved)

localize67.0ms (1.9%)

Compiler: Compiled 5 to 3 computations (40% saved)
Precisions: Click to see histograms. Total time spent on operations: 92.0ms
Operation composed, time spent: 47.0ms, 51.0% of total-time
Operation ival-log, time spent: 41.0ms, 45.0% of total-time
Operation ival-add, time spent: 3.0ms, 3.0% of total-time
Operation const, time spent: 1.0ms, 1.0% of total-time

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

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(log1p.f64 x)

Compiler

Compiled 10 to 7 computations (30% saved)

regimes11.0ms (0.3%)

Accuracy

Total -38.4b remaining (-∞%)

Threshold costs -38.4b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(log1p.f64 x)
(log.f64 (+.f64 1 x))

Outputs
(log1p.f64 x)

Calls

3 calls:

6.0ms	(+.f64 1 x)
3.0ms	x
2.0ms	(log.f64 (+.f64 1 x))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(log.f64 (+.f64 1 x))`
100.0%	1	`(+.f64 1 x)`

Compiler

Compiled 11 to 8 computations (27.3% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(log1p.f64 x)

Outputs
(log1p.f64 x)

Compiler

Compiled 3 to 2 computations (33.3% saved)

soundness26.0ms (0.7%)

Rules

76×	`fma-neg`
42×	`sub-neg`
32×	`fma-define`
22×	`cancel-sign-sub-inv`
20×	`associate-+l-`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

Stop Event

1×

saturated

Compiler

Compiled 7 to 5 computations (28.6% saved)

end0.0ms (0%)

preprocess111.0ms (3.2%)

Compiler: Compiled 56 to 42 computations (25% saved)

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

analyze2.0ms (0.1%)

sample3.0s (85.8%)

preprocess269.0ms (7.7%)

eval0.0ms (0%)

prune3.0ms (0.1%)

localize67.0ms (1.9%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes11.0ms (0.3%)

simplify2.0ms (0.1%)

soundness26.0ms (0.7%)

end0.0ms (0%)

preprocess111.0ms (3.2%)

Profiling

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44

Iter	Nodes	Cost
0	13	44
1	28	44
2	37	44
3	46	44
4	60	44
5	77	44
6	110	44
7	145	44
8	161	44
9	184	44
10	198	44
11	233	44
12	248	44
13	253	44
14	254	44