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)

sample422.0ms (60.9%)

Memory

9.6MiB live, 768.5MiB allocated; 119ms collecting garbage

Samples

228.0ms

8 256×

valid

Precisions

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

ival-mult!: 92.0ms (99.1% of total)

adjust: 1.0ms (1.1% of total)

Bogosity

explain38.0ms (5.4%)

Memory

-6.3MiB live, 87.8MiB allocated; 5ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x #s(literal 2 binary64)) x)`
-	-	`(*.f64 x #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Samples

14.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult!: 5.0ms (101.2% of total)

adjust: 0.0ms (0% of total)

preprocess79.0ms (11.5%)

Memory

-27.7MiB live, 18.1MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	23	15
2	64	15
3	160	15
4	267	15
5	1048	15
6	4663	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 10 to 8 computations (20% saved)

rewrite38.0ms (5.4%)

Memory

23.7MiB live, 74.1MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	11	10
0	30	10

Stop Event

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

Counts

4 → 13

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 64 to 21 computations (67.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	9	1	10
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	10	1	11

Accuracy

100.0%

Counts

11 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 3 computations (40% saved)

rewrite27.0ms (3.9%)

Memory

8.6MiB live, 55.4MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	9
0	5	7
1	17	7
0	107	7

Stop Event

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

Counts

3 → 37

Calls

Call 1

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

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

eval1.0ms (0.2%)

Memory: 5.0MiB live, 5.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 135 to 35 computations (74.1% saved)

prune3.0ms (0.4%)

Memory

-39.5MiB live, 3.1MiB allocated; 2ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	17	1	18
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	17	2	19

Accuracy

100.0%

Counts

19 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 5 computations (37.5% saved)

rewrite37.0ms (5.3%)

Memory

28.5MiB live, 66.9MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	2	4
0	3	4
1	14	4
0	90	4

Stop Event

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

Counts

2 → 9

Calls

Call 1

Inputs
(+.f64 x x)
x

Outputs
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)
x

eval1.0ms (0.1%)

Memory: 2.3MiB live, 2.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 59 to 19 computations (67.8% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	7	0	7
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	7	2	9

Accuracy

100.0%

Counts

9 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 11 computations (47.6% saved)

regimes3.0ms (0.4%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

2 calls:

1.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 6 to 5 computations (16.7% saved)

regimes17.0ms (2.4%)

Memory

-44.1MiB live, 21.2MiB allocated; 16ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(+.f64 x x)

Outputs
(+.f64 x x)

Calls

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

derivations2.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 8 to 3 computations (62.5% saved)

preprocess23.0ms (3.3%)

Memory: 8.8MiB live, 51.4MiB allocated; 12ms collecting garbage
Compiler: Compiled 52 to 32 computations (38.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample422.0ms (60.9%)

explain38.0ms (5.4%)

preprocess79.0ms (11.5%)

rewrite38.0ms (5.4%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

rewrite27.0ms (3.9%)

eval1.0ms (0.2%)

prune3.0ms (0.4%)

rewrite37.0ms (5.3%)

eval1.0ms (0.1%)

prune1.0ms (0.2%)

regimes3.0ms (0.4%)

regimes17.0ms (2.4%)

derivations2.0ms (0.3%)

preprocess23.0ms (3.3%)

end0.0ms (0%)

Profiling