Metrics for FastMath repmul

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.8MiB live, 0.8MiB 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 9 to 6 computations (33.3% saved)

sample888.0ms (37.6%)

Memory

20.0MiB live, 1 216.8MiB allocated; 296ms collecting garbage

Samples

598.0ms

8 256×

valid

Precisions

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

ival-mult: 320.0ms (96.7% of total)

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

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

adjust: 2.0ms (0.6% of total)

Bogosity

explain94.0ms (4%)

Memory

-54.0MiB live, 158.9MiB allocated; 40ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`d1`
-	-	`(.f64 (.f64 d1 d1) d1)`
-	-	`(.f64 (.f64 (*.f64 d1 d1) d1) d1)`
-	-	`(*.f64 d1 d1)`

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

21.0ms

512×

valid

Compiler

Compiled 43 to 16 computations (62.8% saved)

Precisions

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

ival-mult: 10.0ms (97.6% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess264.0ms (11.2%)

Memory

31.2MiB live, 220.1MiB allocated; 27ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	25	13
2	115	9
3	233	7
4	305	7
5	309	7
6	319	7
7	351	7
8	534	7
9	2157	7
10	5292	7
0	4	7
0	7	7
1	14	5
2	55	3
3	186	3
4	278	3
5	282	3
6	292	3
7	324	3
8	507	3
9	2128	3
10	5277	3
0	8050	3

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Outputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(pow.f64 d1 #s(literal 4 binary64))

Symmetry

(abs d1)

Compiler

Compiled 7 to 4 computations (42.9% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Compiler

Compiled 7 to 4 computations (42.9% saved)

simplify182.0ms (7.7%)

Memory

-32.4MiB live, 153.4MiB allocated; 28ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score
cost-diff	0	(*.f64 d1 d1)
cost-diff	2	(.f64 (.f64 d1 d1) d1)
cost-diff	2	(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	4	16
0	7	16
1	14	12
2	55	10
3	186	10
4	278	10
5	282	10
6	292	10
7	324	10
8	507	10
9	2128	10
10	5277	10
0	8050	10

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(.f64 (.f64 d1 d1) d1)
(*.f64 d1 d1)
d1

Outputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(pow.f64 d1 #s(literal 4 binary64))
(.f64 (.f64 d1 d1) d1)
(pow.f64 d1 #s(literal 3 binary64))
(*.f64 d1 d1)
d1

localize14.0ms (0.6%)

Memory

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

Localize:

Found 3 expressions of interest:

New	Metric	Score
accuracy	0.0	(*.f64 d1 d1)
accuracy	0.07421875	(.f64 (.f64 (*.f64 d1 d1) d1) d1)
accuracy	0.078125	(.f64 (.f64 d1 d1) d1)

Samples

10.0ms

256×

valid

Compiler

Compiled 18 to 6 computations (66.7% saved)

Precisions

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

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

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

adjust: 0.0ms (0% of total)

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

series4.0ms (0.2%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(.f64 (.f64 d1 d1) d1)
(*.f64 d1 d1)

Outputs
(pow d1 4)
(pow d1 3)
(pow d1 2)

Calls

3 calls:

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

simplify143.0ms (6%)

Memory

-45.8MiB live, 100.6MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	9
1	12	9
2	22	9
3	48	9
4	112	9
5	258	9
6	1231	9
7	3992	9
0	8013	9

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 3

Calls

Call 1

Inputs
(pow d1 4)
(pow d1 3)
(pow d1 2)

Outputs
(pow d1 4)
(pow.f64 d1 #s(literal 4 binary64))
(pow d1 3)
(pow.f64 d1 #s(literal 3 binary64))
(pow d1 2)
(*.f64 d1 d1)

rewrite29.0ms (1.2%)

Memory

25.8MiB live, 70.8MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	15
0	7	11
1	18	9
0	78	9

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

3 → 39

Calls

Call 1

Inputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(.f64 (.f64 d1 d1) d1)
(*.f64 d1 d1)

Outputs
(.f64 (.f64 (*.f64 d1 d1) (neg.f64 d1)) (neg.f64 d1))
(.f64 (.f64 (*.f64 d1 d1) (fabs.f64 d1)) (fabs.f64 d1))
(.f64 (.f64 (neg.f64 d1) (fabs.f64 d1)) (*.f64 (neg.f64 d1) (fabs.f64 d1)))
(.f64 (.f64 (neg.f64 d1) d1) (*.f64 (neg.f64 d1) d1))
(.f64 (.f64 (fabs.f64 d1) (neg.f64 d1)) (*.f64 (fabs.f64 d1) (neg.f64 d1)))
(.f64 (.f64 (fabs.f64 d1) d1) (*.f64 (fabs.f64 d1) d1))
(.f64 (.f64 d1 (neg.f64 d1)) (*.f64 d1 (neg.f64 d1)))
(.f64 (.f64 d1 (fabs.f64 d1)) (*.f64 d1 (fabs.f64 d1)))
(.f64 (neg.f64 (.f64 d1 d1)) (neg.f64 (*.f64 d1 d1)))
(.f64 (neg.f64 d1) (.f64 (neg.f64 d1) (*.f64 d1 d1)))
(.f64 (fabs.f64 d1) (.f64 (fabs.f64 d1) (*.f64 d1 d1)))
(*.f64 (pow.f64 d1 #s(literal 3 binary64)) d1)
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 (pow.f64 d1 #s(literal 3 binary64)))
(pow.f64 (*.f64 d1 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 4 binary64))
(.f64 (.f64 d1 (neg.f64 d1)) (neg.f64 d1))
(.f64 (.f64 d1 (fabs.f64 d1)) (fabs.f64 d1))
(*.f64 (pow.f64 d1 #s(literal 3/2 binary64)) (pow.f64 d1 #s(literal 3/2 binary64)))
(.f64 (neg.f64 d1) (.f64 (neg.f64 d1) d1))
(.f64 (fabs.f64 d1) (.f64 (fabs.f64 d1) d1))
(.f64 (.f64 d1 d1) d1)
(.f64 d1 (.f64 d1 d1))
(pow.f64 d1 #s(literal 3 binary64))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 3 binary64)))
(*.f64 (pow.f64 d1 #s(literal 1 binary64)) (pow.f64 d1 #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 d1)) (neg.f64 (neg.f64 d1)))
(*.f64 (neg.f64 (fabs.f64 d1)) (neg.f64 (fabs.f64 d1)))
(*.f64 (fabs.f64 (fabs.f64 d1)) (fabs.f64 (fabs.f64 d1)))
(*.f64 (neg.f64 d1) (neg.f64 d1))
(*.f64 (fabs.f64 d1) (fabs.f64 d1))
(*.f64 d1 d1)
(pow.f64 (neg.f64 d1) #s(literal 2 binary64))
(pow.f64 (fabs.f64 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 d1) d1))
(neg.f64 (*.f64 d1 (neg.f64 d1)))
(fabs.f64 (*.f64 d1 d1))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 2 binary64)))

eval4.0ms (0.2%)

Memory: 16.5MiB live, 16.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 359 to 109 computations (69.6% saved)

prune5.0ms (0.2%)

Memory

-30.7MiB live, 13.0MiB allocated; 6ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	40	2	42
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	40	3	43

Accuracy

100.0%

Counts

43 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(pow.f64 d1 #s(literal 4 binary64))
✓	99.9%	(.f64 (.f64 (*.f64 d1 d1) d1) d1)
▶	99.8%	(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Compiler

Compiled 17 to 10 computations (41.2% saved)

simplify217.0ms (9.2%)

Memory

26.9MiB live, 269.3MiB allocated; 54ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score
cost-diff	0	(pow.f64 d1 #s(literal 4 binary64))
cost-diff	0	(*.f64 d1 d1)
cost-diff	4	(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	5	16
0	8	20
1	20	16
2	69	12
3	207	12
4	310	12
5	314	12
6	324	12
7	356	12
8	539	12
9	2160	12
10	5372	12
0	8145	12

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 d1)
d1
(pow.f64 d1 #s(literal 4 binary64))
d1
#s(literal 4 binary64)

Outputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(pow.f64 d1 #s(literal 4 binary64))
(*.f64 d1 d1)
d1
(pow.f64 d1 #s(literal 4 binary64))
d1
#s(literal 4 binary64)

localize20.0ms (0.8%)

Memory

16.8MiB live, 60.7MiB allocated; 8ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score
accuracy	0.0	(pow.f64 d1 #s(literal 4 binary64))
accuracy	0.0	(*.f64 d1 d1)
accuracy	0.12175751953688403	(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Samples

15.0ms

256×

valid

Compiler

Compiled 18 to 7 computations (61.1% saved)

Precisions

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

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

ival-pow: 3.0ms (31.8% 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)

series23.0ms (1%)

Memory

-40.2MiB live, 6.3MiB allocated; 4ms collecting garbage

Counts

3 → 2

Calls

Call 1

Inputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 d1)
(pow.f64 d1 #s(literal 4 binary64))

Outputs
(pow d1 4)
(pow d1 2)

Calls

3 calls:

Time	Variable		Point	Expression
21.0ms	d1	@	0	((* (* d1 d1) (* d1 d1)) (* d1 d1) (pow d1 4))
1.0ms	d1	@	inf	((* (* d1 d1) (* d1 d1)) (* d1 d1) (pow d1 4))
1.0ms	d1	@	-inf	((* (* d1 d1) (* d1 d1)) (* d1 d1) (pow d1 4))

simplify249.0ms (10.5%)

Memory

7.1MiB live, 195.9MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	6
1	8	6
2	17	6
3	35	6
4	74	6
5	164	6
6	641	6
7	5022	6
0	8316	6

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

Inputs
(pow d1 4)
(pow d1 2)

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

rewrite21.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	13
0	8	9
1	27	9
0	109	9

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

3 → 61

Calls

Call 1

Inputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 d1)
(pow.f64 d1 #s(literal 4 binary64))

Outputs
(.f64 (.f64 (*.f64 d1 d1) (neg.f64 d1)) (neg.f64 d1))
(.f64 (.f64 (*.f64 d1 d1) (fabs.f64 d1)) (fabs.f64 d1))
(.f64 (.f64 (neg.f64 d1) (fabs.f64 d1)) (*.f64 (neg.f64 d1) (fabs.f64 d1)))
(.f64 (.f64 (fabs.f64 d1) (neg.f64 d1)) (*.f64 (fabs.f64 d1) (neg.f64 d1)))
(.f64 (.f64 (fabs.f64 d1) d1) (*.f64 (fabs.f64 d1) d1))
(.f64 (.f64 d1 (fabs.f64 d1)) (*.f64 d1 (fabs.f64 d1)))
(.f64 (pow.f64 (.f64 d1 d1) #s(literal 1 binary64)) (pow.f64 (*.f64 d1 d1) #s(literal 1 binary64)))
(*.f64 (pow.f64 d1 #s(literal 3 binary64)) d1)
(.f64 (.f64 (neg.f64 d1) d1) (*.f64 (neg.f64 d1) d1))
(.f64 (neg.f64 d1) (.f64 (neg.f64 d1) (*.f64 d1 d1)))
(.f64 (fabs.f64 d1) (.f64 (fabs.f64 d1) (*.f64 d1 d1)))
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 (pow.f64 d1 #s(literal 3 binary64)))
(pow.f64 (exp.f64 (log.f64 d1)) #s(literal 4 binary64))
(pow.f64 (*.f64 (neg.f64 d1) d1) #s(literal 2 binary64))
(pow.f64 (*.f64 d1 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 4 binary64))
(neg.f64 (.f64 (.f64 (neg.f64 d1) d1) (*.f64 d1 d1)))
(neg.f64 (.f64 (.f64 d1 d1) (*.f64 (neg.f64 d1) d1)))
(fabs.f64 (pow.f64 d1 #s(literal 4 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 d1 d1)) #s(literal 2 binary64)))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 d1) #s(literal 4 binary64))) (sinh.f64 (.f64 (log.f64 d1) #s(literal 4 binary64))))
(*.f64 (pow.f64 d1 #s(literal 1 binary64)) (pow.f64 d1 #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 d1)) (neg.f64 (neg.f64 d1)))
(*.f64 (neg.f64 (fabs.f64 d1)) (neg.f64 (fabs.f64 d1)))
(*.f64 (fabs.f64 (fabs.f64 d1)) (fabs.f64 (fabs.f64 d1)))
(*.f64 (neg.f64 d1) (neg.f64 d1))
(*.f64 (fabs.f64 d1) (fabs.f64 d1))
(*.f64 d1 d1)
(pow.f64 (neg.f64 d1) #s(literal 2 binary64))
(pow.f64 (fabs.f64 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 d1) d1))
(sqrt.f64 (pow.f64 d1 #s(literal 4 binary64)))
(fabs.f64 (*.f64 (neg.f64 d1) d1))
(fabs.f64 (*.f64 d1 d1))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 2 binary64)))
(.f64 (.f64 (*.f64 d1 d1) (neg.f64 d1)) (neg.f64 d1))
(.f64 (.f64 (*.f64 d1 d1) (fabs.f64 d1)) (fabs.f64 d1))
(.f64 (.f64 (neg.f64 d1) (fabs.f64 d1)) (*.f64 (neg.f64 d1) (fabs.f64 d1)))
(.f64 (.f64 (fabs.f64 d1) (neg.f64 d1)) (*.f64 (fabs.f64 d1) (neg.f64 d1)))
(.f64 (.f64 (fabs.f64 d1) d1) (*.f64 (fabs.f64 d1) d1))
(.f64 (.f64 d1 (fabs.f64 d1)) (*.f64 d1 (fabs.f64 d1)))
(.f64 (pow.f64 (.f64 d1 d1) #s(literal 1 binary64)) (pow.f64 (*.f64 d1 d1) #s(literal 1 binary64)))
(*.f64 (pow.f64 d1 #s(literal 3 binary64)) d1)
(.f64 (.f64 (neg.f64 d1) d1) (*.f64 (neg.f64 d1) d1))
(.f64 (neg.f64 d1) (.f64 (neg.f64 d1) (*.f64 d1 d1)))
(.f64 (fabs.f64 d1) (.f64 (fabs.f64 d1) (*.f64 d1 d1)))
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 (pow.f64 d1 #s(literal 3 binary64)))
(pow.f64 (exp.f64 (log.f64 d1)) #s(literal 4 binary64))
(pow.f64 (*.f64 (neg.f64 d1) d1) #s(literal 2 binary64))
(pow.f64 (*.f64 d1 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 4 binary64))
(neg.f64 (.f64 (.f64 (neg.f64 d1) d1) (*.f64 d1 d1)))
(neg.f64 (.f64 (.f64 d1 d1) (*.f64 (neg.f64 d1) d1)))
(fabs.f64 (pow.f64 d1 #s(literal 4 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 d1 d1)) #s(literal 2 binary64)))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 d1) #s(literal 4 binary64))) (sinh.f64 (.f64 (log.f64 d1) #s(literal 4 binary64))))

eval44.0ms (1.9%)

Memory: -29.6MiB live, 16.5MiB allocated; 7ms collecting garbage
Compiler: Compiled 480 to 104 computations (78.3% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	56	0	56
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	56	3	59

Accuracy

100.0%

Counts

59 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(pow.f64 d1 #s(literal 4 binary64))
✓	99.9%	(.f64 (.f64 (*.f64 d1 d1) d1) d1)
✓	99.8%	(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Compiler

Compiled 34 to 17 computations (50% saved)

regimes3.0ms (0.1%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(pow.f64 d1 #s(literal 4 binary64))

Outputs
(pow.f64 d1 #s(literal 4 binary64))

Calls

2 calls:

2.0ms	d1
1.0ms	(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Results

Accuracy	Segments	Branch
100.0%	1	`(.f64 (.f64 (*.f64 d1 d1) d1) d1)`
100.0%	1	`d1`

Compiler

Compiled 8 to 5 computations (37.5% saved)

regimes2.0ms (0.1%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))
(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Outputs
(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Calls

2 calls:

1.0ms	d1
1.0ms	(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Results

Accuracy	Segments	Branch
99.9%	1	`(.f64 (.f64 (*.f64 d1 d1) d1) d1)`
99.9%	1	`d1`

Compiler

Compiled 8 to 5 computations (37.5% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Outputs
(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Calls

2 calls:

1.0ms	d1
1.0ms	(.f64 (.f64 (*.f64 d1 d1) d1) d1)

Results

Accuracy	Segments	Branch
99.8%	1	`(.f64 (.f64 (*.f64 d1 d1) d1) d1)`
99.8%	1	`d1`

Compiler

Compiled 8 to 5 computations (37.5% saved)

simplify48.0ms (2%)

Memory

-27.9MiB live, 26.8MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	17

Stop Event

1×

saturated

Calls

Call 1

Inputs
(pow.f64 d1 #s(literal 4 binary64))
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(.f64 (.f64 d1 d1) (*.f64 d1 d1))

Outputs
(pow.f64 d1 #s(literal 4 binary64))
(.f64 (.f64 (*.f64 d1 d1) d1) d1)
(.f64 (.f64 d1 d1) (*.f64 d1 d1))

derivations20.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	15
0	7	11
1	18	9
0	78	9

Stop Event

1×	done
1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Compiler

Compiled 17 to 7 computations (58.8% saved)

preprocess84.0ms (3.6%)

Memory: -24.5MiB live, 66.9MiB allocated; 7ms collecting garbage
Remove: (abs d1)
Compiler: Compiled 66 to 40 computations (39.4% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample888.0ms (37.6%)

explain94.0ms (4%)

preprocess264.0ms (11.2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify182.0ms (7.7%)

localize14.0ms (0.6%)

series4.0ms (0.2%)

simplify143.0ms (6%)

rewrite29.0ms (1.2%)

eval4.0ms (0.2%)

prune5.0ms (0.2%)

simplify217.0ms (9.2%)

localize20.0ms (0.8%)

series23.0ms (1%)

simplify249.0ms (10.5%)

rewrite21.0ms (0.9%)

eval44.0ms (1.9%)

prune3.0ms (0.1%)

regimes3.0ms (0.1%)

regimes2.0ms (0.1%)

regimes2.0ms (0.1%)

simplify48.0ms (2%)

derivations20.0ms (0.8%)

preprocess84.0ms (3.6%)

end0.0ms (0%)

Profiling