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

ival-add: 0.0ms (0% of total)

ival-log: 0.0ms (0% of total)

const: 0.0ms (0% of total)

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

sample3.3s (83.1%)

Results

159.0ms	3596×	0	valid
463.0ms	2322×	1	valid
979.0ms	1649×	5	exit
612.0ms	1493×	2	valid
97.0ms	286×	4	valid
451.0ms	284×	5	valid
96.0ms	275×	3	valid
0.0ms	1×	0	invalid

Precisions

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

ival-log: 1.5s (65.1% of total)

ival-add: 607.0ms (25.8% of total)

backward-pass: 183.0ms (7.8% of total)

const: 32.0ms (1.4% of total)

Bogosity

preprocess51.0ms (1.3%)

Algorithm

1×	egg-herbie

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

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

explain548.0ms (14%)

FPErrors

Click to see full error table

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

Results

13.0ms	222×	0	valid
28.0ms	144×	1	valid
42.0ms	100×	2	valid
9.0ms	18×	5	valid
6.0ms	14×	4	valid
4.0ms	14×	3	valid

Compiler

Compiled 27 to 20 computations (25.9% saved)

Precisions

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

ival-log: 46.0ms (65.1% of total)

ival-add: 12.0ms (17% of total)

backward-pass: 11.0ms (15.6% of total)

const: 2.0ms (2.8% of total)

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)

localize13.0ms (0.3%)

Results

10.0ms

256×

valid

Compiler

Compiled 5 to 3 computations (40% saved)

Precisions

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

ival-log1p: 4.0ms (92% of total)

const: 0.0ms (0% of total)

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

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)

regimes3.0ms (0.1%)

Accuracy

Total -35.0b remaining (-∞%)

Threshold costs -35b (-∞%)

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:

1.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×

saturated

Calls

Call 1

Inputs
(log1p.f64 x)

Outputs
(log1p.f64 x)

soundness11.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×	done
1×	saturated

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess29.0ms (0.7%)

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

ln(1 + x)

analyze2.0ms (0.1%)

sample3.3s (83.1%)

preprocess51.0ms (1.3%)

explain548.0ms (14%)

eval0.0ms (0%)

prune1.0ms (0%)

localize13.0ms (0.3%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes3.0ms (0.1%)

simplify2.0ms (0.1%)

soundness11.0ms (0.3%)

preprocess29.0ms (0.7%)

end0.0ms (0%)

Profiling