Metrics for Expression 2, p15

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	25%	75%	0%	0%	0%	0
100%	25%	0%	75%	0%	0%	0%	1

Compiler

Compiled 13 to 9 computations (30.8% saved)

sample1.2s (49.3%)

Memory

48.2MiB live, 1 173.5MiB allocated; 360ms collecting garbage

Samples

590.0ms

8 256×

valid

Precisions

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

ival-<=: 98.0ms (38.9% of total)

ival-mult: 82.0ms (32.6% of total)

ival-add: 45.0ms (17.9% of total)

ival-and: 11.0ms (4.4% of total)

exact: 10.0ms (4% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain84.0ms (3.5%)

Memory

-16.4MiB live, 72.4MiB allocated; 23ms collecting garbage

FPErrors

Click to see full error table

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

39.0ms

512×

valid

Compiler

Compiled 27 to 13 computations (51.9% saved)

Precisions

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

ival-mult: 4.0ms (60.1% of total)

ival-add: 2.0ms (30.1% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess196.0ms (8.2%)

Memory

13.6MiB live, 297.7MiB allocated; 38ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	18
1	32	17
2	79	15
3	125	15
4	220	15
5	542	15
6	1517	15
7	7495	15
0	3	5
0	5	5
1	15	5
2	39	5
3	76	5
4	129	5
5	338	5
6	1182	5
0	8208	4

Stop Event

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

Calls

Call 1

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

Outputs
(+.f64 x (*.f64 x x))
(fma.f64 x x x)

Compiler

Compiled 5 to 3 computations (40% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 3 computations (40% saved)

simplify142.0ms (5.9%)

Memory

4.8MiB live, 237.4MiB allocated; 66ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x x)
cost-diff	1	(+.f64 x (*.f64 x x))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	9
0	5	9
1	15	9
2	39	9
3	76	9
4	129	9
5	338	9
6	1182	9
0	8208	8

Stop Event

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

Calls

Call 1

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

Outputs
(+.f64 x (*.f64 x x))
(fma.f64 x x x)
x
(*.f64 x x)

localize12.0ms (0.5%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 x (*.f64 x x))
accuracy	0.0	(*.f64 x x)

Samples

8.0ms

256×

valid

Compiler

Compiled 11 to 5 computations (54.5% saved)

Precisions

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

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

ival-add: 1.0ms (30.7% of total)

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

adjust: 0.0ms (0% of total)

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

series2.0ms (0.1%)

Memory

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

Counts

2 → 5

Calls

Call 1

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

Outputs
#s(approx (+ x (* x x)) #s(hole binary64 x))
#s(approx (+ x (* x x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))

Calls

3 calls:

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

simplify120.0ms (5%)

Memory

21.9MiB live, 108.3MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	45
1	44	45
2	125	45
3	396	45
4	2153	45
5	7644	45
0	8923	39

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) #s(hole binary64 x))
#s(approx (+ x (* x x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))

Outputs
#s(approx (+ x (* x x)) #s(hole binary64 x))
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ x (* x x)) (fma.f64 x x x))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (* x x) (*.f64 x x))
#s(approx (+ x (* x x)) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) (*.f64 x x))
#s(approx (+ x (* x x)) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (+ x (* x x)) (fma.f64 x x x))

rewrite59.0ms (2.5%)

Memory

-36.0MiB live, 58.0MiB allocated; 35ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	8
0	5	8
1	29	8
0	219	7

Stop Event

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

Counts

2 → 37

Calls

Call 1

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

Outputs
(*.f64 (+.f64 #s(literal 1 binary64) x) x)
(*.f64 x (+.f64 #s(literal 1 binary64) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x x)) (-.f64 (.f64 x x) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 x) x) #s(literal 3 binary64))) (fma.f64 x x (+.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x (*.f64 (neg.f64 x) x)))))
(/.f64 (neg.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64)))) (neg.f64 (-.f64 x (.f64 x x))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(/.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64))) (-.f64 x (.f64 x x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64))) (+.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 (*.f64 x x) (pow.f64 x #s(literal 3 binary64)))))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64))) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64))))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) x)
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) x)
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) x)
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) x)
(fma.f64 (neg.f64 x) (neg.f64 x) x)
(fma.f64 (fabs.f64 x) (fabs.f64 x) x)
(fma.f64 x x x)
(-.f64 (/.f64 (.f64 x x) (-.f64 x (.f64 x x))) (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 x (*.f64 x x))))
(-.f64 x (*.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 x (*.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 x (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))) (/.f64 (pow.f64 x #s(literal 6 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(+.f64 (*.f64 x x) x)
(+.f64 x (*.f64 (neg.f64 (neg.f64 x)) x))
(+.f64 x (*.f64 x x))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))

eval4.0ms (0.2%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 394 to 100 computations (74.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	39	2	41
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	40	2	42

Accuracy

100.0%

Counts

42 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x x x)
▶	97.7%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 11 to 6 computations (45.5% saved)

simplify136.0ms (5.6%)

Memory

31.5MiB live, 166.3MiB allocated; 44ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(fma.f64 x x x)
cost-diff	0	#s(approx (+ x (* x x)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	13
0	6	12
1	15	12
2	39	12
3	76	12
4	129	12
5	338	12
6	1186	12
0	8212	12

Stop Event

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

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
x
(fma.f64 x x x)
x

Outputs
#s(approx (+ x (* x x)) x)
x
(fma.f64 x x x)
x

localize20.0ms (0.8%)

Memory

-18.6MiB live, 25.5MiB allocated; 10ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(fma.f64 x x x)
accuracy	1.45228302903124	#s(approx (+ x (* x x)) x)

Samples

15.0ms

256×

valid

Compiler

Compiled 14 to 6 computations (57.1% saved)

Precisions

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

ival-add: 2.0ms (44.9% of total)

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

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

adjust: 0.0ms (0% of total)

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

series1.0ms (0%)

Memory

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

Counts

2 → 8

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
(fma.f64 x x x)

Outputs
#s(approx (+ x (* x x)) #s(hole binary64 x))
#s(approx (+ x (* x x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ (* x x) x) #s(hole binary64 x))
#s(approx (+ (* x x) x) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ x (* x x)) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (+ (* x x) x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) x) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))

Calls

3 calls:

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

simplify162.0ms (6.8%)

Memory

16.6MiB live, 157.8MiB allocated; 70ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	76
1	48	76
2	129	76
3	394	76
4	2153	76
5	7623	76
0	8902	64

Stop Event

1×	iter limit
1×	node limit

Counts

8 → 8

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) #s(hole binary64 x))
#s(approx (+ x (* x x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ (* x x) x) #s(hole binary64 x))
#s(approx (+ (* x x) x) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ x (* x x)) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (+ (* x x) x) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) x) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))

Outputs
#s(approx (+ x (* x x)) #s(hole binary64 x))
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ x (* x x)) (fma.f64 x x x))
#s(approx (+ (* x x) x) #s(hole binary64 x))
#s(approx (+ x (* x x)) x)
#s(approx (+ (* x x) x) #s(hole binary64 (* x (+ 1 x))))
#s(approx (+ x (* x x)) (fma.f64 x x x))
#s(approx (+ x (* x x)) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) (*.f64 x x))
#s(approx (+ x (* x x)) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (+ x (* x x)) (fma.f64 x x x))
#s(approx (+ (* x x) x) #s(hole binary64 (pow x 2)))
#s(approx (+ x (* x x)) (*.f64 x x))
#s(approx (+ (* x x) x) #s(hole binary64 (* (pow x 2) (+ 1 (/ 1 x)))))
#s(approx (+ x (* x x)) (fma.f64 x x x))

rewrite42.0ms (1.7%)

Memory

9.9MiB live, 55.3MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	6	10
1	37	10
0	295	10

Stop Event

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

Counts

2 → 29

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
(fma.f64 x x x)

Outputs
#s(approx (+ x (* x x)) x)
(*.f64 (+.f64 #s(literal 1 binary64) x) x)
(*.f64 x (+.f64 #s(literal 1 binary64) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 x) x) #s(literal 3 binary64))) (fma.f64 x x (+.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x (*.f64 (neg.f64 x) x)))))
(/.f64 (neg.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64)))) (neg.f64 (-.f64 x (.f64 x x))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x x))) (neg.f64 (-.f64 (.f64 x x) x)))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 6 binary64)))) (neg.f64 (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 6 binary64)))) (neg.f64 (fma.f64 x (-.f64 x (*.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(/.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64))) (-.f64 x (.f64 x x)))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x x)) (-.f64 (.f64 x x) x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 6 binary64))) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 6 binary64))) (fma.f64 x (-.f64 x (*.f64 x x)) (pow.f64 x #s(literal 4 binary64))))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) x)
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) x)
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) x)
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) x)
(fma.f64 (neg.f64 x) (neg.f64 x) x)
(fma.f64 (fabs.f64 x) (fabs.f64 x) x)
(fma.f64 x x x)
(-.f64 (/.f64 (.f64 x x) (-.f64 x (.f64 x x))) (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 x (*.f64 x x))))
(-.f64 (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 (.f64 x x) x)) (/.f64 (.f64 x x) (-.f64 (*.f64 x x) x)))
(-.f64 x (*.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 x (*.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 x (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))) (/.f64 (pow.f64 x #s(literal 6 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(+.f64 (/.f64 (pow.f64 x #s(literal 6 binary64)) (fma.f64 x (-.f64 x (.f64 x x)) (pow.f64 x #s(literal 4 binary64)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x (.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(+.f64 (*.f64 x x) x)
(+.f64 x (*.f64 (neg.f64 (neg.f64 x)) x))
(+.f64 x (*.f64 x x))

eval9.0ms (0.4%)

Memory: -33.2MiB live, 12.2MiB allocated; 7ms collecting garbage
Compiler: Compiled 375 to 81 computations (78.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	31	0	31
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	31	2	33

Accuracy

100.0%

Counts

33 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x x x)
✓	97.7%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 27 to 13 computations (51.9% saved)

regimes3.0ms (0.1%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
(fma.f64 x x x)
(+.f64 x (*.f64 x x))

Outputs
(fma.f64 x x x)

Calls

2 calls:

1.0ms	(+.f64 x (*.f64 x x))
1.0ms	x

Results

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

regimes2.0ms (0.1%)

Memory

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

Outputs
#s(approx (+ x (* x x)) x)

Calls

2 calls:

1.0ms	(+.f64 x (*.f64 x x))
1.0ms	x

Results

Accuracy	Segments	Branch
97.7%	1	`(+.f64 x (*.f64 x x))`
97.7%	1	`x`

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify87.0ms (3.6%)

Memory

-13.3MiB live, 32.9MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
1	15	11
2	39	11
3	76	11
4	129	11
5	419	11
6	2483	11

Stop Event

1×	node limit

Calls

Call 1

Inputs
(fma.f64 x x x)
#s(approx (+ x (* x x)) x)

Outputs
(fma.f64 x x x)
#s(approx (+ x (* x x)) x)

derivations107.0ms (4.5%)

Memory

0.5MiB live, 69.1MiB allocated; 46ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 11 to 5 computations (54.5% saved)

preprocess29.0ms (1.2%)

Memory: -6.8MiB live, 40.3MiB allocated; 9ms collecting garbage
Compiler: Compiled 42 to 24 computations (42.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.2s (49.3%)

explain84.0ms (3.5%)

preprocess196.0ms (8.2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify142.0ms (5.9%)

localize12.0ms (0.5%)

series2.0ms (0.1%)

simplify120.0ms (5%)

rewrite59.0ms (2.5%)

eval4.0ms (0.2%)

prune1.0ms (0.1%)

simplify136.0ms (5.6%)

localize20.0ms (0.8%)

series1.0ms (0%)

simplify162.0ms (6.8%)

rewrite42.0ms (1.7%)

eval9.0ms (0.4%)

prune1.0ms (0.1%)

regimes3.0ms (0.1%)

regimes2.0ms (0.1%)

simplify87.0ms (3.6%)

derivations107.0ms (4.5%)

preprocess29.0ms (1.2%)

end0.0ms (0%)

Profiling