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)

sample604.0ms (52.7%)

Memory

18.3MiB live, 886.8MiB allocated; 165ms collecting garbage

Samples

414.0ms

8 256×

valid

Precisions

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

ival-mult: 130.0ms (93.3% of total)

exact: 6.0ms (4.3% of total)

adjust: 2.0ms (1.4% of total)

ival-assert: 2.0ms (1.4% of total)

Bogosity

explain121.0ms (10.6%)

Memory

-14.4MiB live, 104.6MiB allocated; 27ms 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

34.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 (81.6% 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)

preprocess203.0ms (17.7%)

Memory

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

prune0.0ms (0%)

Memory

1.2MiB live, 1.2MiB 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

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

rewrite72.0ms (6.3%)

Memory

1.3MiB live, 64.6MiB allocated; 46ms 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 → 22

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))) (+.f64 (.f64 (.f64 x x) (.f64 x x)) (-.f64 (.f64 (.f64 x x) (.f64 x x)) (.f64 (.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))) (+.f64 (.f64 x x) (-.f64 (.f64 x x) (*.f64 x x))))
(+.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)

eval2.0ms (0.2%)

Memory: 3.2MiB live, 3.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 231 to 54 computations (76.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	23	1	24
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	24	1	25

Accuracy

100.0%

Counts

25 → 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.2%)

Memory

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

rewrite37.0ms (3.2%)

Memory

-20.2MiB live, 29.1MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	30
0	13	32
1	35	12
0	178	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)

eval1.0ms (0.1%)

Memory: 2.2MiB live, 2.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 44 to 13 computations (70.5% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

100.0%

Counts

9 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 12 to 8 computations (33.3% saved)

series1.0ms (0.1%)

Memory

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

rewrite34.0ms (3%)

Memory

-15.0MiB live, 31.5MiB allocated; 3ms 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.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 14 to 5 computations (64.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
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.4%	#s(approx (* (+ x x) x) #s(literal 2 binary64))

Compiler

Compiled 29 to 17 computations (41.4% saved)

regimes3.0ms (0.3%)

Memory

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

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)

regimes2.0ms (0.2%)

Memory

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify40.0ms (3.5%)

Memory

-12.7MiB live, 34.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	12
1	11	12
2	19	12
3	40	12
4	146	12
5	1044	12
6	4231	12

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations3.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 12 to 7 computations (41.7% saved)

preprocess12.0ms (1.1%)

Memory: 20.6MiB live, 20.6MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 44 to 28 computations (36.4% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample604.0ms (52.7%)

explain121.0ms (10.6%)

preprocess203.0ms (17.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.3%)

rewrite72.0ms (6.3%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite37.0ms (3.2%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite34.0ms (3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.3%)

regimes2.0ms (0.2%)

simplify40.0ms (3.5%)

derivations3.0ms (0.3%)

preprocess12.0ms (1.1%)

end0.0ms (0%)

Profiling