Metrics for Main:bigenough1 from B

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.7MiB live, 0.7MiB 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 5 computations (28.6% saved)

sample689.0ms (37.8%)

Memory

2.3MiB live, 675.1MiB allocated; 240ms collecting garbage

Samples

494.0ms

8 256×

valid

Precisions

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

ival-mult: 177.0ms (76.4% of total)

ival-add: 43.0ms (18.6% of total)

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

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

adjust: 2.0ms (0.9% of total)

Bogosity

explain53.0ms (2.9%)

Memory

3.4MiB live, 93.3MiB allocated; 16ms 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

22.0ms

512×

valid

Compiler

Compiled 27 to 13 computations (51.9% saved)

Precisions

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

ival-mult: 9.0ms (72.7% of total)

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

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

adjust: 0.0ms (0% of total)

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

preprocess217.0ms (11.9%)

Memory

-20.2MiB live, 230.5MiB allocated; 30ms 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.1MiB live, 0.1MiB 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
▶	100.0%	(+.f64 x (*.f64 x x))

Compiler

Compiled 5 to 3 computations (40% saved)

simplify147.0ms (8.1%)

Memory

18.1MiB live, 108.5MiB allocated; 9ms 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)

localize14.0ms (0.8%)

Memory

-19.3MiB live, 24.7MiB allocated; 5ms 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

10.0ms

256×

valid

Compiler

Compiled 11 to 5 computations (54.5% saved)

Precisions

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

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

ival-add: 1.0ms (28.1% 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.3MiB live, 2.3MiB 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))

simplify137.0ms (7.5%)

Memory

6.7MiB live, 106.6MiB allocated; 10ms 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))

rewrite38.0ms (2.1%)

Memory

-5.1MiB live, 39.1MiB allocated; 6ms 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: 8.2MiB live, 8.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 394 to 100 computations (74.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	38	3	41
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	39	3	42

Accuracy

100.0%

Counts

42 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 11 computations (45% saved)

simplify198.0ms (10.9%)

Memory

-25.9MiB live, 123.1MiB allocated; 29ms collecting garbage

Localize:

Found 4 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	26
0	9	24
1	18	24
2	42	24
3	79	24
4	132	24
5	341	24
6	1188	24
0	8209	24

Stop Event

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

Calls

Call 1

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

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

localize15.0ms (0.8%)

Memory

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

Localize:

Found 4 expressions of interest:

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

Samples

10.0ms

256×

valid

Compiler

Compiled 23 to 6 computations (73.9% saved)

Precisions

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

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

ival-mult: 2.0ms (42.4% 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.1%)

Memory

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

Counts

4 → 9

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))
(*.f64 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) #s(hole binary64 (pow x 2)))
#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)) (* x x) (+ (* x x) x))
0.0ms	x	@	-inf	((+ x (* x x)) (+ x (* x x)) (* x x) (+ (* x x) x))
0.0ms	x	@	0	((+ x (* x x)) (+ x (* x x)) (* x x) (+ (* x x) x))

simplify106.0ms (5.8%)

Memory

9.2MiB live, 95.4MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	83
1	50	83
2	131	83
3	402	83
4	2160	83
5	7671	83
0	8001	71

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 9

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

rewrite59.0ms (3.2%)

Memory

-36.3MiB live, 23.2MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	23
0	9	21
1	40	21
0	298	21

Stop Event

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

Counts

4 → 43

Calls

Call 1

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

Outputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x 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)))
(*.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 (pow.f64 x #s(literal 4 binary64)) (.f64 x x))) (neg.f64 (-.f64 (.f64 x 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 (fma.f64 x (-.f64 x (*.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(/.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 (pow.f64 x #s(literal 4 binary64)) (.f64 x x)) (-.f64 (.f64 x x) x))
(/.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))) (fma.f64 x (-.f64 x (*.f64 x x)) (pow.f64 x #s(literal 4 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 (pow.f64 x #s(literal 4 binary64)) (-.f64 (.f64 x x) x)) (/.f64 (.f64 x x) (-.f64 (*.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 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 (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))

eval4.0ms (0.2%)

Memory: 6.7MiB live, 6.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 548 to 113 computations (79.4% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	47	0	47
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	47	3	50

Accuracy

100.0%

Counts

50 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 45 to 19 computations (57.8% saved)

regimes4.0ms (0.2%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

Outputs
(fma.f64 x x x)

Calls

2 calls:

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

regimes3.0ms (0.2%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

2 calls:

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

Results

Accuracy	Segments	Branch
97.8%	2	`(+.f64 x (*.f64 x x))`
97.8%	3	`x`

Compiler

Compiled 6 to 4 computations (33.3% saved)

regimes2.0ms (0.1%)

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)) 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
54.3%	1	`x`
54.3%	1	`(+.f64 x (*.f64 x x))`

Compiler

Compiled 6 to 4 computations (33.3% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	0.0008363900375326115	162207.26471753107

Compiler

Compiled 8 to 7 computations (12.5% saved)

simplify35.0ms (1.9%)

Memory

-33.2MiB live, 57.0MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	35
1	21	35
2	45	35
3	82	35
4	135	35
5	430	35
6	2499	35

Stop Event

1×	node limit

Calls

Call 1

Inputs
(fma.f64 x x x)
(if (<=.f64 (+.f64 x (.f64 x x)) #s(literal 1152921504606847/1152921504606846976 binary64)) #s(approx (+ x ( x x)) x) #s(approx (+ x (* x x)) (*.f64 x x)))
#s(approx (+ x (* x x)) x)

Outputs
(fma.f64 x x x)
(if (<=.f64 (+.f64 x (.f64 x x)) #s(literal 1152921504606847/1152921504606846976 binary64)) #s(approx (+ x ( x x)) x) #s(approx (+ x (* x x)) (*.f64 x x)))
#s(approx (+ x (* x x)) x)

derivations77.0ms (4.2%)

Memory

-6.3MiB live, 40.8MiB allocated; 2ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 35 to 11 computations (68.6% saved)

preprocess14.0ms (0.7%)

Memory: 14.8MiB live, 14.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 80 to 28 computations (65% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample689.0ms (37.8%)

explain53.0ms (2.9%)

preprocess217.0ms (11.9%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify147.0ms (8.1%)

localize14.0ms (0.8%)

series2.0ms (0.1%)

simplify137.0ms (7.5%)

rewrite38.0ms (2.1%)

eval4.0ms (0.2%)

prune2.0ms (0.1%)

simplify198.0ms (10.9%)

localize15.0ms (0.8%)

series1.0ms (0.1%)

simplify106.0ms (5.8%)

rewrite59.0ms (3.2%)

eval4.0ms (0.2%)

prune3.0ms (0.2%)

regimes4.0ms (0.2%)

regimes3.0ms (0.2%)

regimes2.0ms (0.1%)

bsearch0.0ms (0%)

simplify35.0ms (1.9%)

derivations77.0ms (4.2%)

preprocess14.0ms (0.7%)

end0.0ms (0%)

Profiling