Metrics for ln(1 + x)

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze1.0ms (0.1%)

Memory

2.0MiB live, 2.0MiB allocated; 0ms collecting garbage

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 4 computations (33.3% saved)

sample570.0ms (40.2%)

Memory

30.2MiB live, 756.2MiB allocated; 229ms collecting garbage

Samples

312.0ms	8 256×	0	valid
0.0ms	3×	0	invalid

Precisions

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

ival-log1p: 131.0ms (98.8% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

preprocess139.0ms (9.8%)

Memory

-29.6MiB live, 62.1MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	8	15
1	15	15
2	26	15
3	72	15
4	392	13
5	3683	13

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	38.6%	(log.f64 (+.f64 #s(literal 1 binary64) x))

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

4.1MiB live, 4.1MiB allocated; 0ms collecting garbage

Counts

4 → 15

Calls

Call 1

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

Outputs
#s(approx (log (+ 1 x)) #s(hole binary64 x))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* -1/2 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* 1/3 x) 1/2))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* x (+ 1/3 (* -1/4 x))) 1/2))))))
#s(approx (+ 1 x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x)))
#s(approx (log (+ 1 x)) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (* -1 (log (/ 1 x))) (/ 1 x))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (/ 1 x)) (/ 1/2 (pow x 2)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (+ (/ 1 x) (* 1/3 (/ 1 (pow x 3))))) (/ 1/2 (pow x 2)))))
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* 1/2 (/ 1 x)) 1) x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* -1 (/ (- (* 1/3 (/ 1 x)) 1/2) x)) 1) x))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((log (+ 1 x)) (+ 1 x) 1 x)
1.0ms	x	@	inf	((log (+ 1 x)) (+ 1 x) 1 x)
0.0ms	x	@	0	((log (+ 1 x)) (+ 1 x) 1 x)

rewrite242.0ms (17.1%)

Memory

16.4MiB live, 164.4MiB allocated; 104ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	80	252
0	81	227
1	481	213
0	4573	180

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

19 → 40

Calls

Call 1

Inputs
(log.f64 (+.f64 #s(literal 1 binary64) x))
(+.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
#s(approx (log (+ 1 x)) #s(hole binary64 x))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* -1/2 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* 1/3 x) 1/2))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* x (+ 1/3 (* -1/4 x))) 1/2))))))
#s(approx (+ 1 x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x)))
#s(approx (log (+ 1 x)) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (* -1 (log (/ 1 x))) (/ 1 x))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (/ 1 x)) (/ 1/2 (pow x 2)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (+ (/ 1 x) (* 1/3 (/ 1 (pow x 3))))) (/ 1/2 (pow x 2)))))
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* 1/2 (/ 1 x)) 1) x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* -1 (/ (- (* 1/3 (/ 1 x)) 1/2) x)) 1) x))))))

Outputs
(log1p.f64 x)
(-.f64 (log.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (log.f64 (-.f64 #s(literal 1 binary64) x)))
(-.f64 (log.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64))) (log.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(log.f64 (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) x)
(*.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(/.f64 (.f64 x (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (.f64 x x)))) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))
(/.f64 (.f64 x (+.f64 (/.f64 #s(literal 1 binary64) (.f64 (*.f64 x x) x)) #s(literal 1 binary64))) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (.f64 x x))) x) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))
(/.f64 (.f64 (+.f64 (/.f64 #s(literal 1 binary64) (.f64 (*.f64 x x) x)) #s(literal 1 binary64)) x) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (-.f64 (*.f64 x x) #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1 binary64) x)))
(/.f64 (neg.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(/.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1 binary64) x)))
(-.f64 x (*.f64 (neg.f64 x) (/.f64 #s(literal 1 binary64) x)))
(-.f64 x (*.f64 (/.f64 #s(literal -1 binary64) x) x))
(-.f64 x #s(literal -1 binary64))
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))) (/.f64 (.f64 (.f64 x x) x) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(+.f64 x #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 (fma.f64 #s(literal 1/3 binary64) x #s(literal -1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 (fma.f64 (fma.f64 #s(literal -1/4 binary64) x #s(literal 1/3 binary64)) x #s(literal -1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (+ 1 x) #s(literal 1 binary64))
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64)))
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (+.f64 (log.f64 x) (/.f64 #s(literal 1 binary64) x)))
#s(approx (log (+ 1 x)) (-.f64 (+.f64 (log.f64 x) (/.f64 #s(literal 1 binary64) x)) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (log (+ 1 x)) (-.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal -1/3 binary64) (.f64 (.f64 x x) x)) (log.f64 x))) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64)))
#s(approx (log (+ 1 x)) (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))))
#s(approx (log (+ 1 x)) (+.f64 (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) x)))
#s(approx (log (+ 1 x)) (-.f64 (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))) (/.f64 (-.f64 (/.f64 #s(literal 1/2 binary64) x) #s(literal 1 binary64)) x)))
#s(approx (log (+ 1 x)) (-.f64 (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))) (/.f64 (-.f64 (/.f64 (-.f64 (/.f64 #s(literal 1/3 binary64) x) #s(literal 1/2 binary64)) (neg.f64 x)) #s(literal 1 binary64)) x)))

eval3.0ms (0.2%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 239 to 135 computations (43.5% saved)

prune3.0ms (0.2%)

Memory

6.1MiB live, 6.1MiB allocated; 0ms collecting garbage

Pruning

5 alts after pruning (5 fresh and 0 done)

	Pruned	Kept	Total
New	31	5	36
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	32	5	37

Accuracy

100.0%

Counts

37 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(log1p.f64 x)
▶	38.6%	(log.f64 (-.f64 x #s(literal -1 binary64)))
▶	66.7%	#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
▶	32.3%	#s(approx (log (+ 1 x)) (log.f64 x))
▶	67.6%	#s(approx (log (+ 1 x)) x)

Compiler

Compiled 52 to 52 computations (0% saved)

series57.0ms (4%)

Memory

-1.0MiB live, 95.5MiB allocated; 19ms collecting garbage

Counts

13 → 22

Calls

Call 1

Inputs
(log1p.f64 x)
x
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))
(log.f64 x)
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
(*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x)
(fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64))
#s(literal -1/2 binary64)
#s(literal 1 binary64)
(log.f64 (-.f64 x #s(literal -1 binary64)))
(-.f64 x #s(literal -1 binary64))
#s(literal -1 binary64)

Outputs
#s(approx (log (+ 1 x)) #s(hole binary64 x))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* -1/2 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* 1/3 x) 1/2))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* x (+ 1/3 (* -1/4 x))) 1/2))))))
#s(approx (log x) #s(hole binary64 (log x)))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 1))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (+ 1 (* -1/2 x))))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (log (+ 1 x)) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (* -1 (log (/ 1 x))) (/ 1 x))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (/ 1 x)) (/ 1/2 (pow x 2)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (+ (/ 1 x) (* 1/3 (/ 1 (pow x 3))))) (/ 1/2 (pow x 2)))))
#s(approx (* (+ (* -1/2 x) 1) x) #s(hole binary64 (* -1/2 (pow x 2))))
#s(approx (* (+ (* -1/2 x) 1) x) #s(hole binary64 (* (pow x 2) (- (/ 1 x) 1/2))))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (* -1/2 x)))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (* x (- (/ 1 x) 1/2))))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* 1/2 (/ 1 x)) 1) x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* -1 (/ (- (* 1/3 (/ 1 x)) 1/2) x)) 1) x))))))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (* -1 (* x (- 1/2 (/ 1 x))))))

Calls

3 calls:

Time	Variable		Point	Expression
24.0ms	x	@	0	((log (+ 1 x)) x (log (+ 1 x)) (log (+ 1 x)) (log x) (log (+ 1 x)) (* (+ (* -1/2 x) 1) x) (+ (* -1/2 x) 1) -1/2 1 (log (- x -1)) (- x -1) -1)
17.0ms	x	@	-inf	((log (+ 1 x)) x (log (+ 1 x)) (log (+ 1 x)) (log x) (log (+ 1 x)) (* (+ (* -1/2 x) 1) x) (+ (* -1/2 x) 1) -1/2 1 (log (- x -1)) (- x -1) -1)
15.0ms	x	@	inf	((log (+ 1 x)) x (log (+ 1 x)) (log (+ 1 x)) (log x) (log (+ 1 x)) (* (+ (* -1/2 x) 1) x) (+ (* -1/2 x) 1) -1/2 1 (log (- x -1)) (- x -1) -1)

Time

Variable

Point

Expression

24.0ms

((log (+ 1 x)) x (log (+ 1 x)) (log (+ 1 x)) (log x) (log (+ 1 x)) (* (+ (* -1/2 x) 1) x) (+ (* -1/2 x) 1) -1/2 1 (log (- x -1)) (- x -1) -1)

17.0ms

-inf

((log (+ 1 x)) x (log (+ 1 x)) (log (+ 1 x)) (log x) (log (+ 1 x)) (* (+ (* -1/2 x) 1) x) (+ (* -1/2 x) 1) -1/2 1 (log (- x -1)) (- x -1) -1)

15.0ms

inf

((log (+ 1 x)) x (log (+ 1 x)) (log (+ 1 x)) (log x) (log (+ 1 x)) (* (+ (* -1/2 x) 1) x) (+ (* -1/2 x) 1) -1/2 1 (log (- x -1)) (- x -1) -1)

rewrite167.0ms (11.8%)

Memory

-17.6MiB live, 117.3MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	104	340
0	110	308
1	551	296
0	5030	290

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

35 → 117

Calls

Call 1

Inputs
(log1p.f64 x)
x
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))
(log.f64 x)
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
(*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x)
(fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64))
#s(literal -1/2 binary64)
#s(literal 1 binary64)
(log.f64 (-.f64 x #s(literal -1 binary64)))
(-.f64 x #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (log (+ 1 x)) #s(hole binary64 x))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* -1/2 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* 1/3 x) 1/2))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (* x (+ 1 (* x (- (* x (+ 1/3 (* -1/4 x))) 1/2))))))
#s(approx (log x) #s(hole binary64 (log x)))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 1))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (+ 1 (* -1/2 x))))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (log (+ 1 x)) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (* -1 (log (/ 1 x))) (/ 1 x))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (/ 1 x)) (/ 1/2 (pow x 2)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (- (+ (* -1 (log (/ 1 x))) (+ (/ 1 x) (* 1/3 (/ 1 (pow x 3))))) (/ 1/2 (pow x 2)))))
#s(approx (* (+ (* -1/2 x) 1) x) #s(hole binary64 (* -1/2 (pow x 2))))
#s(approx (* (+ (* -1/2 x) 1) x) #s(hole binary64 (* (pow x 2) (- (/ 1 x) 1/2))))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (* -1/2 x)))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (* x (- (/ 1 x) 1/2))))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (/ 1 x)))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* 1/2 (/ 1 x)) 1) x))))))
#s(approx (log (+ 1 x)) #s(hole binary64 (+ (log -1) (+ (* -1 (log (/ -1 x))) (* -1 (/ (- (* -1 (/ (- (* 1/3 (/ 1 x)) 1/2) x)) 1) x))))))
#s(approx (+ (* -1/2 x) 1) #s(hole binary64 (* -1 (* x (- 1/2 (/ 1 x))))))

Outputs
(log1p.f64 x)
(-.f64 (log.f64 (fma.f64 x x #s(literal -1 binary64))) (log.f64 (+.f64 #s(literal -1 binary64) x)))
(-.f64 (log.f64 (-.f64 (.f64 (.f64 x x) x) #s(literal -1 binary64))) (log.f64 (fma.f64 x x (-.f64 #s(literal 1 binary64) x))))
(-.f64 (log.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (log.f64 (-.f64 #s(literal 1 binary64) x)))
(-.f64 (log.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64))) (log.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(log.f64 (-.f64 x #s(literal -1 binary64)))
x
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))
(*.f64 (neg.f64 (log.f64 x)) #s(literal -1 binary64))
(*.f64 #s(literal -1 binary64) (neg.f64 (log.f64 x)))
(neg.f64 (*.f64 (neg.f64 (log.f64 x)) #s(literal 1 binary64)))
(neg.f64 (*.f64 (log.f64 x) #s(literal -1 binary64)))
(neg.f64 (*.f64 #s(literal 1 binary64) (neg.f64 (log.f64 x))))
(neg.f64 (neg.f64 (log.f64 x)))
(log.f64 x)
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
(*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x)
(*.f64 x (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)))
(/.f64 (.f64 x (fma.f64 #s(literal 1/4 binary64) (.f64 x x) #s(literal -1 binary64))) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)))
(/.f64 (.f64 x (-.f64 #s(literal 1 binary64) (.f64 #s(literal 1/4 binary64) (.f64 x x)))) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x)))
(/.f64 (.f64 x (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64))) (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x))))
(/.f64 (.f64 x (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64))) (fma.f64 (.f64 #s(literal -1/2 binary64) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64)))
(/.f64 (.f64 (fma.f64 #s(literal 1/4 binary64) (.f64 x x) #s(literal -1 binary64)) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)))
(/.f64 (.f64 (-.f64 #s(literal 1 binary64) (.f64 #s(literal 1/4 binary64) (.f64 x x))) x) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x)))
(/.f64 (.f64 (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64)) x) (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x))))
(/.f64 (.f64 (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64)) x) (fma.f64 (.f64 #s(literal -1/2 binary64) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64)))
(/.f64 (-.f64 (.f64 x x) (.f64 (.f64 (.f64 x x) #s(literal -1/2 binary64)) (.f64 (.f64 x x) #s(literal -1/2 binary64)))) (-.f64 x (.f64 (.f64 x x) #s(literal -1/2 binary64))))
(/.f64 (fma.f64 (.f64 x x) x (pow.f64 (.f64 (.f64 x x) #s(literal -1/2 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 (.f64 (.f64 x x) #s(literal -1/2 binary64)) (.f64 (.f64 x x) #s(literal -1/2 binary64))) (.f64 x (.f64 (*.f64 x x) #s(literal -1/2 binary64))))))
(fma.f64 (*.f64 x x) #s(literal -1/2 binary64) x)
(fma.f64 (*.f64 #s(literal -1/2 binary64) x) x x)
(fma.f64 #s(literal -1/2 binary64) (*.f64 x x) x)
(fma.f64 x (*.f64 #s(literal -1/2 binary64) x) x)
(-.f64 x (.f64 (neg.f64 x) (.f64 #s(literal -1/2 binary64) x)))
(-.f64 x (.f64 (.f64 #s(literal 1/2 binary64) x) x))
(+.f64 (.f64 (.f64 x x) #s(literal -1/2 binary64)) x)
(+.f64 x (.f64 (.f64 x x) #s(literal -1/2 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (pow.f64 (.f64 #s(literal 1/2 binary64) x) #s(literal 3 binary64))) (+.f64 #s(literal 1 binary64) (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (.f64 #s(literal 1 binary64) (.f64 #s(literal 1/2 binary64) x)))))
(/.f64 (neg.f64 (fma.f64 #s(literal 1/4 binary64) (*.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64))))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (.f64 #s(literal 1/4 binary64) (.f64 x x)))) (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x))))
(/.f64 (neg.f64 (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64))) (neg.f64 (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x)))))
(/.f64 (neg.f64 (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64))) (neg.f64 (fma.f64 (*.f64 #s(literal -1/2 binary64) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64))))
(/.f64 (fma.f64 #s(literal 1/4 binary64) (*.f64 x x) #s(literal -1 binary64)) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 #s(literal 1/4 binary64) (.f64 x x))) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x)))
(/.f64 (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64)) (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x))))
(/.f64 (fma.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x) #s(literal 1 binary64)) (fma.f64 (*.f64 #s(literal -1/2 binary64) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64)))
(fma.f64 (.f64 (.f64 #s(literal -1/2 binary64) x) #s(literal -1 binary64)) #s(literal -1 binary64) #s(literal 1 binary64))
(fma.f64 (*.f64 #s(literal -1/2 binary64) x) #s(literal 1 binary64) #s(literal 1 binary64))
(fma.f64 #s(literal -1 binary64) (.f64 #s(literal -1 binary64) (.f64 #s(literal -1/2 binary64) x)) #s(literal 1 binary64))
(fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x) #s(literal 1 binary64))
(fma.f64 x #s(literal -1/2 binary64) #s(literal 1 binary64))
(-.f64 (/.f64 (.f64 #s(literal 1/4 binary64) (.f64 x x)) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64))))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x))) (/.f64 (.f64 #s(literal 1/4 binary64) (.f64 x x)) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x))))
(-.f64 (*.f64 #s(literal -1/2 binary64) x) #s(literal -1 binary64))
(-.f64 #s(literal 1 binary64) (*.f64 (neg.f64 x) #s(literal -1/2 binary64)))
(-.f64 #s(literal 1 binary64) (*.f64 #s(literal 1/2 binary64) x))
(+.f64 (/.f64 (.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x)) (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (-.f64 #s(literal 1 binary64) (.f64 #s(literal -1/2 binary64) x)))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 1/4 binary64) (.f64 x x) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x)))))
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 #s(literal -1/2 binary64) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64))) (/.f64 (.f64 #s(literal -1/8 binary64) (.f64 (.f64 x x) x)) (fma.f64 (*.f64 #s(literal -1/2 binary64) x) (fma.f64 #s(literal -1/2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64))))
(+.f64 (*.f64 #s(literal -1/2 binary64) x) #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) (*.f64 #s(literal -1/2 binary64) x))
#s(literal -1/2 binary64)
#s(literal 1 binary64)
(log1p.f64 x)
(-.f64 (log.f64 (fma.f64 x x #s(literal -1 binary64))) (log.f64 (+.f64 #s(literal -1 binary64) x)))
(-.f64 (log.f64 (-.f64 (.f64 (.f64 x x) x) #s(literal -1 binary64))) (log.f64 (fma.f64 x x (-.f64 #s(literal 1 binary64) x))))
(-.f64 (log.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (log.f64 (-.f64 #s(literal 1 binary64) x)))
(-.f64 (log.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64))) (log.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(log.f64 (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)) x)
(*.f64 x (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(/.f64 (.f64 x (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (.f64 x x)))) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))
(/.f64 (.f64 x (+.f64 (/.f64 #s(literal 1 binary64) (.f64 (*.f64 x x) x)) #s(literal 1 binary64))) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (.f64 x x))) x) (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) x)))
(/.f64 (.f64 (+.f64 (/.f64 #s(literal 1 binary64) (.f64 (*.f64 x x) x)) #s(literal 1 binary64)) x) (fma.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1 binary64) x)))
(/.f64 (neg.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1 binary64))) (neg.f64 (+.f64 #s(literal -1 binary64) x)))
(/.f64 (neg.f64 (-.f64 (.f64 (.f64 x x) x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x (-.f64 #s(literal 1 binary64) x))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (+.f64 #s(literal -1 binary64) x))
(/.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(/.f64 (fma.f64 (*.f64 x x) x #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(/.f64 (-.f64 (.f64 (.f64 x x) x) #s(literal -1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) (+.f64 #s(literal -1 binary64) x)) (/.f64 #s(literal 1 binary64) (+.f64 #s(literal -1 binary64) x)))
(-.f64 (/.f64 (.f64 (.f64 x x) x) (fma.f64 x x (-.f64 #s(literal 1 binary64) x))) (/.f64 #s(literal -1 binary64) (fma.f64 x x (-.f64 #s(literal 1 binary64) x))))
(-.f64 x (*.f64 (neg.f64 x) (/.f64 #s(literal 1 binary64) x)))
(-.f64 x (*.f64 (/.f64 #s(literal -1 binary64) x) x))
(-.f64 x #s(literal -1 binary64))
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))) (/.f64 (.f64 (.f64 x x) x) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(+.f64 #s(literal 1 binary64) x)
(+.f64 x #s(literal 1 binary64))
#s(literal -1 binary64)
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 (fma.f64 #s(literal 1/3 binary64) x #s(literal -1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 (fma.f64 (fma.f64 #s(literal -1/4 binary64) x #s(literal 1/3 binary64)) x #s(literal -1/2 binary64)) x #s(literal 1 binary64)) x))
#s(approx (log x) (log.f64 x))
#s(approx (+ (* -1/2 x) 1) #s(literal 1 binary64))
#s(approx (+ (* -1/2 x) 1) (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (+.f64 (log.f64 x) (/.f64 #s(literal 1 binary64) x)))
#s(approx (log (+ 1 x)) (-.f64 (+.f64 (log.f64 x) (/.f64 #s(literal 1 binary64) x)) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (log (+ 1 x)) (-.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) (-.f64 (/.f64 #s(literal -1/3 binary64) (.f64 (.f64 x x) x)) (log.f64 x))) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (* (+ (* -1/2 x) 1) x) (.f64 (.f64 x x) #s(literal -1/2 binary64)))
#s(approx (* (+ (* -1/2 x) 1) x) (.f64 (.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1/2 binary64)) x) x))
#s(approx (+ (* -1/2 x) 1) (*.f64 #s(literal -1/2 binary64) x))
#s(approx (+ (* -1/2 x) 1) (*.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1/2 binary64)) x))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (log (+ 1 x)) (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))))
#s(approx (log (+ 1 x)) (+.f64 (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) x)))
#s(approx (log (+ 1 x)) (-.f64 (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))) (/.f64 (-.f64 (/.f64 #s(literal 1/2 binary64) x) #s(literal 1 binary64)) x)))
#s(approx (log (+ 1 x)) (-.f64 (log.f64 (*.f64 (/.f64 #s(literal 1 binary64) (/.f64 #s(literal -1 binary64) x)) #s(literal -1 binary64))) (/.f64 (-.f64 (/.f64 (-.f64 (/.f64 #s(literal 1/3 binary64) x) #s(literal 1/2 binary64)) (neg.f64 x)) #s(literal 1 binary64)) x)))
#s(approx (+ (* -1/2 x) 1) (*.f64 (neg.f64 x) (-.f64 #s(literal 1/2 binary64) (/.f64 #s(literal 1 binary64) x))))

eval9.0ms (0.6%)

Memory: 13.7MiB live, 13.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 669 to 367 computations (45.1% saved)

prune4.0ms (0.3%)

Memory

5.9MiB live, 5.9MiB allocated; 0ms collecting garbage

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	94	0	94
Fresh	0	0	0
Picked	0	5	5
Done	0	0	0
Total	94	5	99

Accuracy

100.0%

Counts

99 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(log1p.f64 x)
✓	38.6%	(log.f64 (-.f64 x #s(literal -1 binary64)))
✓	66.7%	#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
✓	32.3%	#s(approx (log (+ 1 x)) (log.f64 x))
✓	67.6%	#s(approx (log (+ 1 x)) x)

Compiler

Compiled 48 to 44 computations (8.3% saved)

regimes6.0ms (0.4%)

Memory

9.2MiB live, 9.2MiB allocated; 0ms collecting garbage

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
(log.f64 (-.f64 x #s(literal -1 binary64)))
(log.f64 (+.f64 #s(literal 1 binary64) x))
(log1p.f64 x)

Outputs
(log1p.f64 x)

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 #s(literal 1 binary64) x)`
100.0%	1	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
100.0%	1	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

regimes5.0ms (0.4%)

Memory

8.3MiB live, 8.3MiB allocated; 0ms collecting garbage

Counts

5 → 2

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
(log.f64 (-.f64 x #s(literal -1 binary64)))
(log.f64 (+.f64 #s(literal 1 binary64) x))

Outputs
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
(log.f64 (-.f64 x #s(literal -1 binary64)))

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
99.2%	2	`(+.f64 #s(literal 1 binary64) x)`
99.2%	2	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
99.2%	2	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

regimes24.0ms (1.7%)

Memory

-40.4MiB live, 12.1MiB allocated; 7ms collecting garbage

Counts

3 → 2

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))

Outputs
#s(approx (log (+ 1 x)) (*.f64 (fma.f64 #s(literal -1/2 binary64) x #s(literal 1 binary64)) x))
#s(approx (log (+ 1 x)) (log.f64 x))

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
97.9%	2	`(+.f64 #s(literal 1 binary64) x)`
97.9%	2	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
97.9%	2	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

regimes3.0ms (0.2%)

Memory

8.0MiB live, 8.0MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))

Outputs
#s(approx (log (+ 1 x)) x)
#s(approx (log (+ 1 x)) (log.f64 x))

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
97.3%	2	`(+.f64 #s(literal 1 binary64) x)`
97.3%	2	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
97.3%	2	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

regimes3.0ms (0.2%)

Memory

7.0MiB live, 7.0MiB allocated; 0ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)

Outputs
#s(approx (log (+ 1 x)) x)

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
67.6%	1	`(+.f64 #s(literal 1 binary64) x)`
67.6%	1	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
67.6%	1	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

bsearch7.0ms (0.5%)

Memory

10.7MiB live, 10.7MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
6.0ms	1.1411780440538272e-6	2.164179791103847e-5

Samples

3.0ms

112×

valid

Compiler

Compiled 98 to 111 computations (-13.3% saved)

Precisions

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

ival-log1p: 1.0ms (108% of total)

adjust: 0.0ms (0% of total)

bsearch12.0ms (0.8%)

Memory

-28.6MiB live, 14.9MiB allocated; 6ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
11.0ms	0.203413457814216	1191.8910849482404

Samples

7.0ms

128×

valid

Compiler

Compiled 127 to 142 computations (-11.8% saved)

Precisions

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

ival-log1p: 1.0ms (72.6% of total)

adjust: 0.0ms (0% of total)

bsearch6.0ms (0.4%)

Memory

10.3MiB live, 10.3MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
6.0ms	0.203413457814216	1191.8910849482404

Samples

3.0ms

96×

valid

Compiler

Compiled 95 to 110 computations (-15.8% saved)

Precisions

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

ival-log1p: 1.0ms (99.2% of total)

adjust: 0.0ms (0% of total)

derivations99.0ms (7%)

Memory

-1.9MiB live, 84.5MiB allocated; 16ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 29 to 25 computations (13.8% saved)

preprocess53.0ms (3.7%)

Memory: 25.9MiB live, 82.2MiB allocated; 11ms collecting garbage
Compiler: Compiled 48 to 38 computations (20.8% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze1.0ms (0.1%)

sample570.0ms (40.2%)

preprocess139.0ms (9.8%)

series2.0ms (0.2%)

rewrite242.0ms (17.1%)

eval3.0ms (0.2%)

prune3.0ms (0.2%)

series57.0ms (4%)

rewrite167.0ms (11.8%)

eval9.0ms (0.6%)

prune4.0ms (0.3%)

regimes6.0ms (0.4%)

regimes5.0ms (0.4%)

regimes24.0ms (1.7%)

regimes3.0ms (0.2%)

regimes3.0ms (0.2%)

bsearch7.0ms (0.5%)

bsearch12.0ms (0.8%)

bsearch6.0ms (0.4%)

derivations99.0ms (7%)

preprocess53.0ms (3.7%)

end0.0ms (0%)

Profiling