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.5MiB live, 0.5MiB 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)

sample1.0s (46%)

Memory

32.8MiB live, 1 163.3MiB allocated; 525ms collecting garbage

Samples

778.0ms

8 256×

valid

Precisions

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

ival-mult: 225.0ms (93% of total)

ival-true: 6.0ms (2.5% of total)

exact: 5.0ms (2.1% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain86.0ms (3.9%)

Memory

-8.5MiB live, 84.7MiB allocated; 9ms 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

64.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 53.0ms (98% 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)

preprocess206.0ms (9.4%)

Memory

16.3MiB live, 157.4MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	19	10
2	59	10
3	147	10
4	253	10
5	852	10
6	4490	10
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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.7MiB live, 0.7MiB 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.1%)

Memory

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

simplify177.0ms (8.1%)

Memory

1.0MiB live, 179.3MiB allocated; 50ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	21
1	19	21
2	39	21
3	118	21
4	282	21
5	995	21
6	4430	21
0	8052	21

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 3

Calls

Call 1

Inputs
#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
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* (* x 2) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (* x 2) #s(hole binary64 (* 2 x)))
#s(approx (* x 2) (*.f64 #s(literal 2 binary64) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)

rewrite43.0ms (2%)

Memory

-45.9MiB live, 65.9MiB allocated; 30ms 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)

eval3.0ms (0.1%)

Memory: 8.3MiB live, 8.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 118 to 33 computations (72% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accuracy

100.0%

Counts

19 → 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)

series2.0ms (0.1%)

Memory

5.5MiB live, 5.5MiB 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)
0.0ms	x	@	0	((* (+ x x) x) (+ x x) x)

simplify224.0ms (10.2%)

Memory

36.6MiB live, 220.5MiB allocated; 54ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	21
1	18	21
2	38	21
3	117	21
4	279	21
5	979	21
6	4412	21
0	8099	21

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 3

Calls

Call 1

Inputs
#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(approx (* (+ x x) x) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* (+ x x) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)

rewrite109.0ms (5%)

Memory

2.2MiB live, 42.5MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	9
0	5	7
1	17	7
0	105	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

eval2.0ms (0.1%)

Memory: 3.3MiB live, 3.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 191 to 47 computations (75.4% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	25	1	26
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	25	2	27

Accuracy

100.0%

Counts

27 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 5 computations (37.5% saved)

series66.0ms (3%)

Memory

-36.6MiB live, 7.4MiB allocated; 12ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
(+.f64 x x)
x

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

Calls

3 calls:

Time	Variable		Point	Expression
62.0ms	x	@	inf	((+ x x) x)
4.0ms	x	@	-inf	((+ x x) x)
0.0ms	x	@	0	((+ x x) x)

simplify182.0ms (8.3%)

Memory

5.9MiB live, 109.9MiB allocated; 37ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	10	10
2	17	10
3	35	10
4	74	10
5	321	10
6	1775	10
0	8163	10

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

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

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

rewrite30.0ms (1.4%)

Memory

-11.5MiB live, 34.9MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	2	4
0	3	4
1	14	4
0	88	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%)

Memory: 2.8MiB live, 2.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 85 to 25 computations (70.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	13	0	13
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	13	2	15

Accuracy

100.0%

Counts

15 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 11 computations (47.6% saved)

regimes3.0ms (0.1%)

Memory

9.1MiB live, 9.1MiB 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:

2.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)

regimes2.0ms (0.1%)

Memory

6.8MiB live, 6.8MiB allocated; 0ms 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:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify13.0ms (0.6%)

Memory

-21.0MiB live, 23.0MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	8

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations2.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 8 to 3 computations (62.5% saved)

preprocess23.0ms (1%)

Memory: -3.5MiB live, 42.3MiB allocated; 7ms collecting garbage
Remove: (abs x)
Compiler: Compiled 46 to 28 computations (39.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.0s (46%)

explain86.0ms (3.9%)

preprocess206.0ms (9.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.1%)

simplify177.0ms (8.1%)

rewrite43.0ms (2%)

eval3.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.1%)

simplify224.0ms (10.2%)

rewrite109.0ms (5%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series66.0ms (3%)

simplify182.0ms (8.3%)

rewrite30.0ms (1.4%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes3.0ms (0.1%)

regimes2.0ms (0.1%)

simplify13.0ms (0.6%)

derivations2.0ms (0.1%)

preprocess23.0ms (1%)

end0.0ms (0%)

Profiling