Metrics for ln(1 + x)

start0.0ms (0%)

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

analyze1.0ms (0.1%)

Memory

3.7MiB live, 3.7MiB 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)

sample608.0ms (54.6%)

Memory

-35.4MiB live, 765.3MiB allocated; 196ms collecting garbage

Samples

340.0ms	8 256×	0	valid
0.0ms	1×	0	invalid

Precisions

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

ival-log1p: 132.0ms (99.1% of total)

adjust: 2.0ms (1.5% of total)

Bogosity

explain46.0ms (4.2%)

Memory

7.5MiB live, 99.8MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

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

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`log.f64`	`(log.f64 (+.f64 #s(literal 1 binary64) x))`	sensitivity	177	0

Confusion

	Predicted +	Predicted -
+	177	0
-	0	79

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	177	0	0
-	0	0	79

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	79
1	177

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

19.0ms

512×

valid

Compiler

Compiled 26 to 16 computations (38.5% saved)

Precisions

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

ival-log1p: 5.0ms (72.4% of total)

ival-add!: 2.0ms (29% of total)

adjust: 0.0ms (0% of total)

preprocess82.0ms (7.4%)

Memory

-37.2MiB live, 22.7MiB allocated; 36ms collecting garbage

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	8	15
1	12	15
2	15	15
3	29	15
4	72	15
5	317	13
6	2799	13
7	6260	13

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 17

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 x #s(hole binary64 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))
#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)

rewrite164.0ms (14.8%)

Memory

21.9MiB live, 159.9MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	82	260
0	83	235
1	482	221
0	4608	188

Stop Event

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

Counts

21 → 42

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 x #s(hole binary64 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))
#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 (log1p.f64 (*.f64 (neg.f64 x) x)) (log.f64 (-.f64 #s(literal 1 binary64) x)))
(-.f64 (log1p.f64 (pow.f64 x #s(literal 3 binary64))) (log1p.f64 (-.f64 (*.f64 x x) x)))
(log.f64 (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal -1 binary64)) x)
(*.f64 x (-.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal -1 binary64)))
(/.f64 (*.f64 (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64))) x) (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 (+.f64 (pow.f64 x #s(literal -3 binary64)) #s(literal 1 binary64)) x) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64))) (pow.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 x (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64)))) (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 x (+.f64 (pow.f64 x #s(literal -3 binary64)) #s(literal 1 binary64))) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64))) (pow.f64 x #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 (+.f64 (pow.f64 x #s(literal 3 binary64)) #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 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #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) (pow.f64 x #s(literal -1 binary64))))
(-.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 (pow.f64 x #s(literal 3 binary64)) (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 x x)
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (+.f64 (log.f64 x) (pow.f64 x #s(literal -1 binary64))))
#s(approx (log (+ 1 x)) (-.f64 (+.f64 (log.f64 x) (pow.f64 x #s(literal -1 binary64))) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (log (+ 1 x)) (-.f64 (fma.f64 (pow.f64 x #s(literal -3 binary64)) #s(literal 1/3 binary64) (+.f64 (log.f64 x) (pow.f64 x #s(literal -1 binary64)))) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (+ 1 x) x)
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64)))
#s(approx (log (+ 1 x)) (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))))
#s(approx (log (+ 1 x)) (+.f64 (-.f64 (pow.f64 x #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))) (log.f64 #s(literal -1 binary64))))
#s(approx (log (+ 1 x)) (-.f64 (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))) (/.f64 (-.f64 (/.f64 #s(literal 1/2 binary64) x) #s(literal 1 binary64)) x)))
#s(approx (log (+ 1 x)) (-.f64 (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))) (/.f64 (fma.f64 (/.f64 (-.f64 (/.f64 #s(literal 1/3 binary64) x) #s(literal 1/2 binary64)) x) #s(literal -1 binary64) #s(literal -1 binary64)) x)))

eval4.0ms (0.3%)

Memory: 8.7MiB live, 8.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 439 to 143 computations (67.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	35	2	37
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	36	2	38

Accuracy

100.0%

Counts

38 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(log1p.f64 x)
▶	70.0%	#s(approx (log (+ 1 x)) x)

Compiler

Compiled 8 to 7 computations (12.5% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 13

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)
x
(log1p.f64 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 x #s(hole binary64 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 (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
0.0ms	x	@	-inf	((log (+ 1 x)) x (log (+ 1 x)))
0.0ms	x	@	inf	((log (+ 1 x)) x (log (+ 1 x)))
0.0ms	x	@	0	((log (+ 1 x)) x (log (+ 1 x)))

rewrite152.0ms (13.7%)

Memory

-37.2MiB live, 108.5MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	75	206
0	75	185
1	460	171
0	4453	164

Stop Event

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

Counts

16 → 19

Calls

Call 1

Inputs
#s(approx (log (+ 1 x)) x)
x
(log1p.f64 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 x #s(hole binary64 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 (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
#s(approx (log (+ 1 x)) x)
x
(log1p.f64 x)
(-.f64 (log1p.f64 (*.f64 (neg.f64 x) x)) (log.f64 (-.f64 #s(literal 1 binary64) x)))
(-.f64 (log1p.f64 (pow.f64 x #s(literal 3 binary64))) (log1p.f64 (-.f64 (*.f64 x x) x)))
(log.f64 (-.f64 x #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 x x)
#s(approx (log (+ 1 x)) (log.f64 x))
#s(approx (log (+ 1 x)) (+.f64 (log.f64 x) (pow.f64 x #s(literal -1 binary64))))
#s(approx (log (+ 1 x)) (-.f64 (+.f64 (log.f64 x) (pow.f64 x #s(literal -1 binary64))) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (log (+ 1 x)) (-.f64 (fma.f64 (pow.f64 x #s(literal -3 binary64)) #s(literal 1/3 binary64) (+.f64 (log.f64 x) (pow.f64 x #s(literal -1 binary64)))) (/.f64 #s(literal 1/2 binary64) (*.f64 x x))))
#s(approx (log (+ 1 x)) (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))))
#s(approx (log (+ 1 x)) (+.f64 (-.f64 (pow.f64 x #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))) (log.f64 #s(literal -1 binary64))))
#s(approx (log (+ 1 x)) (-.f64 (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))) (/.f64 (-.f64 (/.f64 #s(literal 1/2 binary64) x) #s(literal 1 binary64)) x)))
#s(approx (log (+ 1 x)) (-.f64 (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))) (/.f64 (fma.f64 (/.f64 (-.f64 (/.f64 #s(literal 1/3 binary64) x) #s(literal 1/2 binary64)) x) #s(literal -1 binary64) #s(literal -1 binary64)) x)))

eval2.0ms (0.1%)

Memory: 1.9MiB live, 1.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 209 to 73 computations (65.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	16	0	16
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	16	2	18

Accuracy

100.0%

Counts

18 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(log1p.f64 x)
✓	70.0%	#s(approx (log (+ 1 x)) x)

Compiler

Compiled 20 to 16 computations (20% saved)

regimes4.0ms (0.4%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

Outputs
(log1p.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
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)

regimes3.0ms (0.2%)

Memory

7.1MiB live, 7.1MiB 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
70.0%	1	`(+.f64 #s(literal 1 binary64) x)`
70.0%	1	`(log.f64 (+.f64 #s(literal 1 binary64) x))`
70.0%	1	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

derivations29.0ms (2.6%)

Memory

-17.4MiB live, 29.4MiB allocated; 2ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 8 to 6 computations (25% saved)

preprocess13.0ms (1.2%)

Memory: 35.0MiB live, 35.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 24 to 20 computations (16.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze1.0ms (0.1%)

sample608.0ms (54.6%)

explain46.0ms (4.2%)

preprocess82.0ms (7.4%)

series2.0ms (0.2%)

rewrite164.0ms (14.8%)

eval4.0ms (0.3%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite152.0ms (13.7%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

regimes4.0ms (0.4%)

regimes3.0ms (0.2%)

derivations29.0ms (2.6%)

preprocess13.0ms (1.2%)

end0.0ms (0%)

Profiling