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

sample1.8s (85.7%)

Results

1.4s	5293×	1	valid
247.0ms	2962×	0	valid
0.0ms	4×	0	invalid
0.0ms	1×	0	valid

Precisions

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

Operation ival-log, time spent: 868.0ms, 80.0% of total-time

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

Operation backward-pass, time spent: 94.0ms, 9.0% of total-time

Operation const, time spent: 18.0ms, 2.0% of total-time

Bogosity

preprocess186.0ms (8.9%)

Algorithm

1×	egg-herbie

Rules

10×	`sub-neg`
8×	`fma-define`
7×	`+-commutative`
5×	`associate-+l-`
4×	`associate--r+`

FPErrors

Click to see full error table

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

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	74	44
6	91	44
7	95	44

Stop Event

1×

saturated

Calls

Call 1

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

Outputs
(log.f64 (+.f64 #s(literal 1 binary64) x))
(log1p.f64 x)
(log.f64 (+.f64 #s(literal 1 binary64) x))
(log1p.f64 x)
(log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)))
(log1p.f64 (neg.f64 x))
(neg.f64 (log.f64 (+.f64 #s(literal 1 binary64) (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: 73.0ms

Operation ival-log, time spent: 60.0ms, 82.0% of total-time

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

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

eval0.0ms (0%)

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

prune1.0ms (0%)

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)

localize55.0ms (2.6%)

Compiler: Compiled 5 to 3 computations (40% saved)
Precisions: Click to see histograms. Total time spent on operations: 70.0ms
Operation composed, time spent: 35.0ms, 50.0% of total-time
Operation ival-log, time spent: 29.0ms, 42.0% of total-time
Operation ival-add, time spent: 4.0ms, 6.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.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%	(log1p.f64 x)

Compiler

Compiled 10 to 7 computations (30% saved)

regimes5.0ms (0.2%)

Accuracy

Total -38.2b remaining (-∞%)

Threshold costs -38.2b (-∞%)

Counts

2 → 1

Calls

Call 1

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

Outputs
(log1p.f64 x)

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
100.0%	1	`(+.f64 #s(literal 1 binary64) 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)

soundness10.0ms (0.5%)

Rules

10×	`sub-neg`
8×	`fma-define`
7×	`+-commutative`
5×	`associate-+l-`
4×	`associate--r+`

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	74	44
6	91	44
7	95	44

Stop Event

1×

saturated

Compiler

Compiled 7 to 5 computations (28.6% saved)

end0.0ms (0%)

preprocess35.0ms (1.7%)

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

analyze2.0ms (0.1%)

sample1.8s (85.7%)

preprocess186.0ms (8.9%)

eval0.0ms (0%)

prune1.0ms (0%)

localize55.0ms (2.6%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes5.0ms (0.2%)

simplify2.0ms (0.1%)

soundness10.0ms (0.5%)

end0.0ms (0%)

preprocess35.0ms (1.7%)

Profiling