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

1.0MiB live, 1.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
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample607.0ms (62.3%)

Memory

3.6MiB live, 843.7MiB allocated; 172ms collecting garbage

Samples

404.0ms

8 256×

valid

Precisions

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

ival-mult: 122.0ms (91.5% of total)

exact: 6.0ms (4.5% of total)

ival-assert: 3.0ms (2.3% of total)

adjust: 2.0ms (1.5% of total)

Bogosity

explain46.0ms (4.7%)

Memory

29.1MiB live, 74.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

18.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 7.0ms (89% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess194.0ms (19.9%)

Memory

3.4MiB live, 196.3MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	23	15
2	64	15
3	160	15
4	266	15
5	1046	15
6	4662	15
0	4	5
0	6	5
1	11	5
2	22	5
3	58	5
4	146	5
5	651	5
6	4384	5
0	8013	5

Stop Event

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

Calls

Call 1

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

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) x)
(.f64 (.f64 #s(literal 2 binary64) x) x)

Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

series3.0ms (0.3%)

Memory

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

rewrite57.0ms (5.9%)

Memory

-25.2MiB live, 69.4MiB allocated; 17ms 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 #s(literal 2 binary64) x) x)
(.f64 #s(literal 2 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal 2 binary64) 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 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.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 #s(literal 1 binary64) (.f64 x x)) (.f64 #s(literal 1 binary64) (.f64 x x)))
(+.f64 (.f64 (.f64 x x) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal 1 binary64)))
(+.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 #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)
#s(approx (* (* x 2) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (* x 2) (*.f64 #s(literal 2 binary64) x))
#s(approx x x)

eval3.0ms (0.3%)

Memory: 5.9MiB live, 5.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 297 to 67 computations (77.4% saved)

prune7.0ms (0.7%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	32	0	32
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	32	1	33

Accuracy

100.0%

Counts

33 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 8 computations (20% saved)

simplify43.0ms (4.4%)

Memory

-15.8MiB live, 27.7MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5
1	6	5
2	9	5
3	15	5
4	47	5
5	368	5
6	3459	5

Stop Event

1×	node limit

Calls

Call 1

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

Outputs
(.f64 (.f64 x #s(literal 2 binary64)) x)

derivations0.0ms (0%)

Memory

0.3MiB live, 0.4MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess14.0ms (1.4%)

Memory: 26.0MiB live, 26.0MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 50 to 40 computations (20% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample607.0ms (62.3%)

explain46.0ms (4.7%)

preprocess194.0ms (19.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.3%)

rewrite57.0ms (5.9%)

eval3.0ms (0.3%)

prune7.0ms (0.7%)

simplify43.0ms (4.4%)

derivations0.0ms (0%)

preprocess14.0ms (1.4%)

end0.0ms (0%)

Profiling