Metrics for Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated

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)

sample433.0ms (14.5%)

Memory

20.5MiB live, 721.4MiB allocated

Samples

301.0ms

8 256×

valid

Precisions

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

ival-mult: 154.0ms (92.1% of total)

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

exact: 5.0ms (3% of total)

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

Bogosity

preprocess34.0ms (1.1%)

Memory

-42.5MiB live, 13.1MiB allocated

Algorithm

2×	egg-herbie

Rules

44×	`distribute-lft-neg-in`
40×	`associate-r`
32×	`distribute-lft-in`
24×	`cancel-sign-sub-inv`
22×	`distribute-rgt-neg-in`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	27	15
2	68	15
3	167	15
4	219	15
5	231	15
0	4	5
1	7	5
2	10	5
0	10	5

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* (* x 2) x)

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

Call 2

Inputs
(* (* x 2) x)
(* (* (neg x) 2) (neg x))
(neg (* (* (neg x) 2) (neg x)))

Outputs
(* (* x 2) x)
(* 2 (* x x))
(* (* (neg x) 2) (neg x))
(* 2 (* x x))
(neg (* (* (neg x) 2) (neg x)))
(* -2 (* x x))

Symmetry

(abs x)

explain42.0ms (1.4%)

Memory

26.9MiB live, 64.8MiB allocated

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

16.0ms

512×

valid

Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions

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

ival-mult: 6.0ms (82.6% of total)

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

exact: 0.0ms (0% of total)

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

eval0.0ms (0%)

Memory: 0.6MiB live, 0.6MiB allocated
Compiler: Compiled 6 to 4 computations (33.3% saved)

prune1.0ms (0%)

Memory

1.5MiB live, 1.5MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify3.0ms (0.1%)

Memory

5.3MiB live, 5.3MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 x #s(literal 2 binary64))
✓	cost-diff	0	(.f64 (.f64 x #s(literal 2 binary64)) x)

Rules

14×	`-lowering-.f32`
14×	`-lowering-.f64`
4×	`*-commutative`
4×	`associate-l`
2×	`associate-r`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
1	7	10
2	10	10
0	10	10

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

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

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

localize17.0ms (0.6%)

Memory

-15.1MiB live, 22.4MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(.f64 (.f64 x #s(literal 2 binary64)) x)
✓	accuracy	100.0%	(*.f64 x #s(literal 2 binary64))

Samples

11.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-mult: 3.0ms (86.7% of total)

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

exact: 0.0ms (0% of total)

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

series2.0ms (0.1%)

Memory

3.3MiB live, 3.3MiB allocated

Counts

2 → 24

Calls

Call 1

Inputs
#<alt (* (* x 2) x)>
#<alt (* x 2)>

Outputs
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 (pow x 2))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	0	(* (* x 2) x)
0.0ms	x	@	0	(* x 2)
0.0ms	x	@	inf	(* (* x 2) x)
0.0ms	x	@	-inf	(* x 2)
0.0ms	x	@	inf	(* x 2)

rewrite138.0ms (4.6%)

Memory

-15.1MiB live, 222.3MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

2 136×	`pow-lowering-pow.f64`
2 136×	`pow-lowering-pow.f32`
1 588×	`-lowering-.f32`
1 588×	`-lowering-.f64`
1 412×	`prod-exp`

Iterations

Useful iterations: 7 (0.0ms)

Iter	Nodes	Cost
0	4	10
1	7	10
2	10	10
3	11	10
4	18	10
5	34	10
6	90	10
7	279	2
8	1678	2
9	1703	2
10	1826	2
11	3043	2
0	8411	2

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

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

Outputs
#s(literal 2 binary64)
#s(literal 2 binary64)

simplify5.0ms (0.2%)

Memory

11.9MiB live, 11.9MiB allocated

Algorithm

1×	egg-herbie

Rules

14×	`-lowering-.f32`
14×	`-lowering-.f64`
4×	`*-commutative`
2×	`pow-lowering-pow.f64`
2×	`pow-lowering-pow.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	96
1	8	96
2	10	96
0	10	96

Stop Event

1×	iter limit
1×	saturated

Counts

24 → 24

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 6.3MiB live, 6.3MiB allocated
Compiler: Compiled 125 to 6 computations (95.2% saved)

prune2.0ms (0.1%)

Memory

5.7MiB live, 5.7MiB allocated

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

100.0%

Counts

27 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 12 to 9 computations (25% saved)

simplify3.0ms (0.1%)

Memory

6.7MiB live, 6.7MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 #s(literal 2 binary64) x)

Rules

4×	`-lowering-.f32`
4×	`-lowering-.f64`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	6
1	4	6
0	4	6

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
2
(* 2 x)
2
x

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

localize12.0ms (0.4%)

Memory

-12.6MiB live, 26.3MiB allocated

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(*.f64 #s(literal 2 binary64) x)

Samples

6.0ms

256×

valid

Compiler

Compiled 8 to 5 computations (37.5% saved)

Precisions

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

ival-mult: 2.0ms (95.2% of total)

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.8MiB live, 0.8MiB allocated

Counts

1 → 12

Calls

Call 1

Inputs
#<alt (* 2 x)>

Outputs
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>

Calls

3 calls:

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

rewrite9.0ms (0.3%)

Memory

-20.3MiB live, 19.1MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

4×	`-lowering-.f32`
4×	`-lowering-.f64`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	3
1	4	3
0	4	3

Stop Event

1×	iter limit
1×	saturated

Counts

1 → 2

Calls

Call 1

Inputs
(* 2 x)

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

simplify3.0ms (0.1%)

Memory

9.8MiB live, 9.8MiB allocated

Algorithm

1×	egg-herbie

Rules

4×	`-lowering-.f32`
4×	`-lowering-.f64`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	36
1	4	36
0	4	36

Stop Event

1×	iter limit
1×	saturated

Counts

12 → 12

Calls

Call 1

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

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

eval1.0ms (0%)

Memory: 3.6MiB live, 3.6MiB allocated
Compiler: Compiled 43 to 4 computations (90.7% saved)

prune2.0ms (0.1%)

Memory

5.2MiB live, 5.2MiB allocated

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	14	0	14
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	14	3	17

Accuracy

100.0%

Counts

17 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 22 to 14 computations (36.4% saved)

regimes4.0ms (0.1%)

Memory

9.9MiB live, 9.9MiB allocated

Counts

3 → 1

Calls

Call 1

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

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 8 to 5 computations (37.5% saved)

regimes2.0ms (0.1%)

Memory

4.7MiB live, 4.7MiB allocated

Counts

2 → 1

Calls

Call 1

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

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

Calls

1 calls:

2.0ms

Results

Accuracy	Segments	Branch
6.9%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

regimes2.0ms (0.1%)

Memory

-35.4MiB live, 4.0MiB allocated

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(literal 2 binary64)

Outputs
#s(literal 2 binary64)

Calls

1 calls:

2.0ms

Results

Accuracy	Segments	Branch
4.3%	1	`x`

Compiler

Compiled 2 to 1 computations (50% saved)

simplify7.0ms (0.2%)

Memory

15.2MiB live, 15.2MiB allocated

Algorithm

1×	egg-herbie

Rules

4×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	9
1	6	9

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness2.2s (74.6%)

Memory

-16.7MiB live, 226.7MiB allocated

Rules

2 136×	`pow-lowering-pow.f64`
2 136×	`pow-lowering-pow.f32`
1 588×	`-lowering-.f32`
1 588×	`-lowering-.f64`
1 412×	`prod-exp`

Iterations

Useful iterations: 7 (0.0ms)

Iter	Nodes	Cost
0	4	10
1	7	10
2	10	10
3	11	10
4	18	10
5	34	10
6	90	10
7	279	2
8	1678	2
9	1703	2
10	1826	2
11	3043	2
0	8411	2

Stop Event

1×	done
1×	iter limit
1×	node limit

Compiler

Compiled 10 to 4 computations (60% saved)

preprocess34.0ms (1.1%)

Memory: 6.6MiB live, 82.0MiB allocated
Remove: (abs x)
Compiler: Compiled 80 to 48 computations (40% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

sample433.0ms (14.5%)

preprocess34.0ms (1.1%)

explain42.0ms (1.4%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify3.0ms (0.1%)

localize17.0ms (0.6%)

series2.0ms (0.1%)

rewrite138.0ms (4.6%)

simplify5.0ms (0.2%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

simplify3.0ms (0.1%)

localize12.0ms (0.4%)

series0.0ms (0%)

rewrite9.0ms (0.3%)

simplify3.0ms (0.1%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes4.0ms (0.1%)

regimes2.0ms (0.1%)

regimes2.0ms (0.1%)

simplify7.0ms (0.2%)

soundness2.2s (74.6%)

preprocess34.0ms (1.1%)

end0.0ms (0%)

Profiling