Metrics for ln(1 + x)

analyze2.0ms (0%)

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-add, time spent: 0.0ms, 0.0% of total-time

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

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

sample3.5s (86.2%)

Results

725.0ms	3932×	256	valid
1.9s	2741×	1024	valid
688.0ms	1408×	512	valid
122.0ms	174×	2048	valid
0.0ms	1×	1024	valid
0.0ms	1×	256	invalid

Precisions

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

Operation ival-log, time spent: 1.4s, 69.0% of total-time

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

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

Bogosity

preprocess417.0ms (10.1%)

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
172	-	-	`(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: 199.0ms

Operation ival-log, time spent: 118.0ms, 59.0% of total-time

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

Operation const, time spent: 3.0ms, 2.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)

localize87.0ms (2.1%)

Compiler: Compiled 5 to 3 computations (40% saved)
Precisions: Click to see histograms. Total time spent on operations: 117.0ms
Operation composed, time spent: 59.0ms, 50.0% of total-time
Operation ival-log, time spent: 51.0ms, 43.0% of total-time
Operation ival-add, time spent: 7.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%)

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)

regimes4.0ms (0.1%)

Accuracy

Total -39.9b remaining (-∞%)

Threshold costs -39.9b (-∞%)

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:

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

simplify4.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.3%)

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

preprocess41.0ms (1%)

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

analyze2.0ms (0%)

sample3.5s (86.2%)

preprocess417.0ms (10.1%)

eval0.0ms (0%)

prune1.0ms (0%)

localize87.0ms (2.1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes4.0ms (0.1%)

simplify4.0ms (0.1%)

soundness10.0ms (0.3%)

end0.0ms (0%)

preprocess41.0ms (1%)

Profiling