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

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated

analyze0.0ms (0%)

Memory

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

sample630.0ms (20.5%)

Memory

6.9MiB live, 1 013.2MiB allocated

Samples

445.0ms

8 256×

valid

Precisions

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

ival-mult: 151.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

explain114.0ms (3.7%)

Memory

-12.2MiB live, 64.5MiB 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

89.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 (88.7% of total)

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

exact: 0.0ms (0% of total)

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

preprocess15.0ms (0.5%)

Memory

15.0MiB live, 15.0MiB allocated

Algorithm

1×	egg-herbie

Rules

46×	`distribute-lft-neg-in`
38×	`associate-r`
32×	`distribute-lft-in`
24×	`cancel-sign-sub-inv`
24×	`distribute-rgt-neg-in`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	23	10
2	63	10
3	164	10
4	216	10
5	228	10
0	4	5
0	6	5
1	9	5
2	12	5
0	12	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

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.3MiB live, 0.3MiB allocated
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.7MiB live, 0.7MiB allocated

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)

simplify3.0ms (0.1%)

Memory

2.8MiB live, 2.8MiB 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×	`lower-*.f32`
10×	`lower-*.f64`
4×	`*-commutative`
4×	`lift-*.f64`
4×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	9	10
2	12	10
0	12	10

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

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

localize42.0ms (1.4%)

Memory

-18.8MiB live, 17.5MiB allocated

Localize:

Found 2 expressions of interest:

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

Samples

37.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-mult: 32.0ms (98.7% of total)

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

exact: 0.0ms (0% of total)

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

series3.0ms (0.1%)

Memory

4.7MiB live, 4.7MiB allocated

Counts

2 → 24

Calls

Call 1

Inputs
#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())
#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())

Inputs

#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())

#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())

Outputs
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (.f64 (.f64 x #s(literal 2 binary64)) x) (patch (.f64 (.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 x #s(literal 2 binary64)) (patch (.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ())

Calls

3 calls:

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

simplify3.0ms (0.1%)

Memory

4.5MiB live, 4.5MiB allocated

Algorithm

1×	egg-herbie

Rules

14×	`lower-*.f64`
14×	`lower-*.f32`
4×	`*-commutative`
2×	`lower-pow.f64`
2×	`associate-r`

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

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

rewrite88.0ms (2.9%)

Memory

2.7MiB live, 78.1MiB allocated

Rules

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

Iterations

Useful iterations: 7 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	10
1	9	10
2	12	10
3	13	10
4	20	10
5	36	10
6	92	10
7	279	2
8	1686	2
9	1711	2
10	1834	2
11	3049	2
0	8392	2

Stop Event

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

Counts

2 → 2

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 5.9MiB live, 5.9MiB allocated
Compiler: Compiled 148 to 9 computations (93.9% saved)

prune3.0ms (0.1%)

Memory

6.5MiB live, 6.5MiB 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)
▶	7.1%	(*.f64 #s(literal 2 binary64) x)
▶	4.3%	#s(literal 2 binary64)

Compiler

Compiled 9 to 9 computations (0% saved)

simplify3.0ms (0.1%)

Memory

5.5MiB live, 5.5MiB 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×	`lower-*.f32`
2×	`*-commutative`
2×	`lower-*.f64`
2×	`lift-*.f64`

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize14.0ms (0.4%)

Memory

-13.8MiB live, 22.3MiB allocated

Localize:

Found 1 expressions of interest:

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

Samples

10.0ms

256×

valid

Compiler

Compiled 8 to 5 computations (37.5% saved)

Precisions

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

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

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

exact: 0.0ms (0% of total)

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

series1.0ms (0%)

Memory

1.2MiB live, 1.2MiB allocated

Counts

1 → 12

Calls

Call 1

Inputs
#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())

Outputs
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor 0 x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())
#s(alt (* 2 x) (taylor -inf x) (#s(alt (.f64 #s(literal 2 binary64) x) (patch (.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ())

Calls

3 calls:

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

simplify3.0ms (0.1%)

Memory

2.5MiB live, 2.5MiB allocated

Algorithm

1×	egg-herbie

Rules

4×	`lower-*.f64`
4×	`lower-*.f32`
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 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))
(* 2 x)
(*.f64 x #s(literal 2 binary64))

rewrite6.0ms (0.2%)

Memory

5.0MiB live, 5.0MiB allocated

Rules

4×	`lower-*.f32`
2×	`lower-*.f64`
2×	`*-commutative`
2×	`lift-*.f64`

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

1 → 2

Calls

Call 1

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

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

eval1.0ms (0%)

Memory: 2.1MiB live, 2.1MiB allocated
Compiler: Compiled 54 to 5 computations (90.7% saved)

prune3.0ms (0.1%)

Memory

4.6MiB live, 4.6MiB 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)
✓	7.1%	(*.f64 #s(literal 2 binary64) x)
✓	4.3%	#s(literal 2 binary64)

Compiler

Compiled 18 to 14 computations (22.2% saved)

regimes12.0ms (0.4%)

Memory

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

9.0ms	x
3.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 6 to 5 computations (16.7% saved)

regimes6.0ms (0.2%)

Memory

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

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes5.0ms (0.2%)

Memory

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

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify51.0ms (1.7%)

Memory

-4.0MiB live, 52.0MiB allocated

Algorithm

1×	egg-herbie

Rules

4×	`-commutative-binary64-.f64`

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

soundness2.0s (65.8%)

Memory

-27.4MiB live, 86.9MiB allocated

Rules

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

Iterations

Useful iterations: 7 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	10
1	9	10
2	12	10
3	13	10
4	20	10
5	36	10
6	92	10
7	279	2
8	1686	2
9	1711	2
10	1834	2
11	3049	2
0	8392	2

Stop Event

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

Compiler

Compiled 9 to 4 computations (55.6% saved)

preprocess41.0ms (1.3%)

Memory: 5.6MiB live, 85.9MiB allocated
Remove: (abs x)
Compiler: Compiled 58 to 40 computations (31% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze0.0ms (0%)

sample630.0ms (20.5%)

explain114.0ms (3.7%)

preprocess15.0ms (0.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.1%)

localize42.0ms (1.4%)

series3.0ms (0.1%)

simplify3.0ms (0.1%)

rewrite88.0ms (2.9%)

eval2.0ms (0.1%)

prune3.0ms (0.1%)

simplify3.0ms (0.1%)

localize14.0ms (0.4%)

series1.0ms (0%)

simplify3.0ms (0.1%)

rewrite6.0ms (0.2%)

eval1.0ms (0%)

prune3.0ms (0.1%)

regimes12.0ms (0.4%)

regimes6.0ms (0.2%)

regimes5.0ms (0.2%)

simplify51.0ms (1.7%)

soundness2.0s (65.8%)

preprocess41.0ms (1.3%)

end0.0ms (0%)

Profiling