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)

sample733.0ms (42.7%)

Memory

30.9MiB live, 1 039.9MiB allocated; 289ms collecting garbage

Samples

455.0ms

8 256×

valid

Precisions

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

ival-mult: 243.0ms (94.2% of total)

ival-true: 5.0ms (1.9% of total)

exact: 5.0ms (1.9% of total)

adjust: 3.0ms (1.2% of total)

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

Bogosity

explain48.0ms (2.8%)

Memory

-3.7MiB live, 135.2MiB allocated; 16ms 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

17.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 6.0ms (80.9% 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)

preprocess273.0ms (15.9%)

Memory

-2.0MiB live, 211.9MiB allocated; 111ms 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.0MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.8MiB live, 0.8MiB 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.2%)

Memory

6.2MiB live, 6.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
(* 2 (pow x 2))
(* 2 x)
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)

simplify157.0ms (9.1%)

Memory

15.1MiB live, 198.6MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	9
1	12	9
2	33	9
3	112	9
4	275	9
5	987	9
6	4420	9
0	8036	9

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 2

Calls

Call 1

Inputs
(* 2 (pow x 2))
(* 2 x)
x

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

rewrite29.0ms (1.7%)

Memory

9.9MiB live, 56.1MiB allocated; 5ms 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)

eval5.0ms (0.3%)

Memory: -48.9MiB live, 3.9MiB allocated; 8ms collecting garbage
Compiler: Compiled 104 to 29 computations (72.1% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	15	1	16
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	16	1	17

Accuracy

100.0%

Counts

17 → 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

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

Counts

3 → 3

Calls

Call 1

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

Outputs
(* 2 (pow x 2))
(* 2 x)
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)

simplify153.0ms (8.9%)

Memory

39.3MiB live, 172.9MiB allocated; 26ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	9
1	12	9
2	33	9
3	112	9
4	275	9
5	987	9
6	4420	9
0	8036	9

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 2

Calls

Call 1

Inputs
(* 2 (pow x 2))
(* 2 x)
x

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

rewrite34.0ms (2%)

Memory

-30.4MiB live, 24.2MiB allocated; 9ms 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: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 170 to 42 computations (75.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	22	1	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	22	2	24

Accuracy

100.0%

Counts

24 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 5 computations (37.5% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
(+.f64 x x)
x

Outputs
(* 2 x)
x

Calls

3 calls:

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

simplify181.0ms (10.6%)

Memory

6.0MiB live, 90.8MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	4
1	7	4
2	14	4
3	32	4
4	71	4
5	274	4
6	1726	4
0	8116	4

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 1

Calls

Call 1

Inputs
(* 2 x)
x

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

rewrite28.0ms (1.6%)

Memory

-10.1MiB live, 33.8MiB allocated; 13ms 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.1%)

Memory: 2.0MiB live, 2.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 75 to 22 computations (70.7% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

100.0%

Counts

13 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 11 computations (47.6% saved)

regimes3.0ms (0.2%)

Memory

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

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify8.0ms (0.5%)

Memory

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

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

Stop Event

1×

done

Compiler

Compiled 8 to 3 computations (62.5% saved)

preprocess47.0ms (2.7%)

Memory: -29.4MiB live, 35.0MiB allocated; 31ms 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%)

sample733.0ms (42.7%)

explain48.0ms (2.8%)

preprocess273.0ms (15.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.2%)

simplify157.0ms (9.1%)

rewrite29.0ms (1.7%)

eval5.0ms (0.3%)

prune3.0ms (0.2%)

series2.0ms (0.1%)

simplify153.0ms (8.9%)

rewrite34.0ms (2%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

simplify181.0ms (10.6%)

rewrite28.0ms (1.6%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

regimes2.0ms (0.1%)

simplify8.0ms (0.5%)

derivations2.0ms (0.1%)

preprocess47.0ms (2.7%)

end0.0ms (0%)

Profiling