Metrics for Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample614.0ms (51.6%)

Memory

8.9MiB live, 863.8MiB allocated; 174ms collecting garbage

Samples

442.0ms

8 256×

valid

Precisions

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

ival-mult!: 264.0ms (99.6% of total)

adjust: 2.0ms (0.8% of total)

Bogosity

preprocess354.0ms (29.8%)

Memory

-25.4MiB live, 64.0MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	23	15
2	66	15
3	169	15
4	319	15
5	2034	15
6	7598	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) x)

Symmetry

(abs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series3.0ms (0.3%)

Memory

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

Counts

4 → 3

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(*.f64 x #s(literal 2 binary64))
x
#s(literal 2 binary64)

Outputs
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x 2) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (* x 2) x) (* x 2) x 2)
1.0ms	x	@	inf	((* (* x 2) x) (* x 2) x 2)
1.0ms	x	@	0	((* (* x 2) x) (* x 2) x 2)

rewrite37.0ms (3.1%)

Memory

-1.6MiB live, 98.7MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	31
0	14	31
1	29	31
0	99	31

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

7 → 30

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(*.f64 x #s(literal 2 binary64))
x
#s(literal 2 binary64)
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x 2) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

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

eval2.0ms (0.2%)

Memory: 9.5MiB live, 9.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 127 to 64 computations (49.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	26	1	27
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	27	1	28

Accuracy

100.0%

Counts

28 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 x x) x)

Compiler

Compiled 3 to 3 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)
x

Outputs
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (+ x x) x) (+ x x) x)
1.0ms	x	@	inf	((* (+ x x) x) (+ x x) x)
1.0ms	x	@	0	((* (+ x x) x) (+ x x) x)

rewrite41.0ms (3.4%)

Memory

-14.3MiB live, 73.2MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	30
0	14	32
1	36	12
0	179	12

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

6 → 6

Calls

Call 1

Inputs
(*.f64 (+.f64 x x) x)
(+.f64 x x)
x
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx x #s(hole binary64 x))

Outputs
#s(literal 2 binary64)
#s(literal 2 binary64)
x
#s(approx (* (+ x x) x) #s(literal 2 binary64))
#s(approx (* (+ x x) x) #s(literal 2 binary64))
#s(approx x x)

eval0.0ms (0%)

Memory: 2.2MiB live, 2.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 10 to 8 computations (20% saved)

prune1.0ms (0.1%)

Memory

4.0MiB live, 3.9MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	2	1	3
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	2	2	4

Accuracy

100.0%

Counts

4 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 x x) x)
▶	4.1%	#s(approx (* (+ x x) x) #s(literal 2 binary64))

Compiler

Compiled 8 to 8 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (* (+ x x) x) #s(literal 2 binary64))
#s(literal 2 binary64)

Outputs
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	((* (+ x x) x) 2)
0.0ms	x	@	-inf	((* (+ x x) x) 2)
0.0ms	x	@	0	((* (+ x x) x) 2)

rewrite97.0ms (8.1%)

Memory

-11.2MiB live, 67.0MiB allocated; 103ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	19
0	8	15
1	29	7
0	166	7

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	saturated

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (* (+ x x) x) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))

Outputs
#s(approx (* (+ x x) x) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (* (+ x x) x) #s(literal 2 binary64))

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	1	1
Total	2	2

Accuracy

100.0%

Counts

2 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 x x) x)
✓	4.1%	#s(approx (* (+ x x) x) #s(literal 2 binary64))

Compiler

Compiled 18 to 17 computations (5.6% saved)

regimes12.0ms (1%)

Memory

-41.0MiB live, 11.9MiB allocated; 9ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (* (+ x x) x) #s(literal 2 binary64))
(*.f64 (+.f64 x x) x)
(.f64 (.f64 x #s(literal 2 binary64)) x)

Outputs
(*.f64 (+.f64 x x) x)

Calls

2 calls:

11.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 2 binary64)) x)

Results

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

Compiler

Compiled 5 to 5 computations (0% saved)

regimes2.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 (* (+ x x) x) #s(literal 2 binary64))

Outputs
#s(approx (* (+ x x) x) #s(literal 2 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 2 binary64)) x)

Results

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

Compiler

Compiled 5 to 5 computations (0% saved)

derivations3.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 7 computations (0% saved)

preprocess17.0ms (1.4%)

Memory: 6.3MiB live, 51.0MiB allocated; 3ms collecting garbage
Remove: (abs x)
Compiler: Compiled 27 to 27 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample614.0ms (51.6%)

preprocess354.0ms (29.8%)

series3.0ms (0.3%)

rewrite37.0ms (3.1%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite41.0ms (3.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite97.0ms (8.1%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes12.0ms (1%)

regimes2.0ms (0.2%)

derivations3.0ms (0.2%)

preprocess17.0ms (1.4%)

end0.0ms (0%)

Profiling