Metrics for Main:bigenough1 from B

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB 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%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 5 computations (28.6% saved)

sample756.0ms (36.6%)

Memory

26.7MiB live, 864.9MiB allocated; 216ms collecting garbage

Samples

398.0ms

8 256×

valid

Precisions

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

ival-mult: 73.0ms (47.8% of total)

ival-add: 68.0ms (44.5% of total)

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

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

adjust: 2.0ms (1.3% of total)

Bogosity

explain49.0ms (2.4%)

Memory

5.6MiB live, 104.1MiB allocated; 14ms 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

16.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 (57.6% of total)

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

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

adjust: 0.0ms (0% of total)

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

preprocess218.0ms (10.6%)

Memory

-0.0MiB live, 154.6MiB allocated; 34ms 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.7MiB live, 0.7MiB 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)

simplify135.0ms (6.5%)

Memory

5.4MiB live, 134.1MiB allocated; 26ms 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)

localize17.0ms (0.8%)

Memory

-30.8MiB live, 29.6MiB allocated; 12ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 x x)
accuracy	0.0078125	(+.f64 x (*.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% of total)

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

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

adjust: 0.0ms (0% of total)

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

series18.0ms (0.9%)

Memory

16.7MiB live, 16.7MiB 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
16.0ms	x	@	0	((+ x (* x x)) (* x x))
1.0ms	x	@	inf	((+ x (* x x)) (* x x))
0.0ms	x	@	-inf	((+ x (* x x)) (* x x))

simplify153.0ms (7.4%)

Memory

11.7MiB live, 138.1MiB allocated; 30ms 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))

rewrite48.0ms (2.3%)

Memory

-12.3MiB live, 94.5MiB allocated; 15ms 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: 9.1MiB live, 9.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 394 to 100 computations (74.6% saved)

prune2.0ms (0.1%)

Memory

4.5MiB live, 4.5MiB 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)
▶	50.4%	#s(approx (+ x (* x x)) (*.f64 x x))
▶	52.0%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 20 to 11 computations (45% saved)

simplify147.0ms (7.1%)

Memory

-9.4MiB live, 177.6MiB allocated; 20ms 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

localize14.0ms (0.7%)

Memory

17.0MiB live, 17.0MiB 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	31.772239096733422	#s(approx (+ x (* x x)) (*.f64 x x))
accuracy	30.748334123551178	#s(approx (+ x (* x x)) x)

Samples

9.0ms

256×

valid

Compiler

Compiled 23 to 6 computations (73.9% saved)

Precisions

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

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

ival-mult: 2.0ms (47% 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

2.1MiB live, 2.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))

simplify295.0ms (14.3%)

Memory

-14.7MiB live, 146.0MiB allocated; 115ms 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))

rewrite46.0ms (2.2%)

Memory

-18.8MiB live, 30.1MiB allocated; 12ms 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: 7.9MiB live, 7.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 548 to 113 computations (79.4% saved)

prune3.0ms (0.1%)

Memory

6.7MiB live, 6.6MiB 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)
✓	50.4%	#s(approx (+ x (* x x)) (*.f64 x x))
✓	52.0%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 45 to 19 computations (57.8% saved)

regimes4.0ms (0.2%)

Memory

8.8MiB live, 8.8MiB 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.1%)

Memory

8.2MiB live, 8.2MiB 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	x
1.0ms	(+.f64 x (*.f64 x x))

Results

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

regimes5.0ms (0.2%)

Memory

-39.9MiB live, 5.7MiB allocated; 3ms 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:

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

Results

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	0.015019988322304188	8999.65157968812

Compiler

Compiled 8 to 7 computations (12.5% saved)

simplify36.0ms (1.7%)

Memory

12.5MiB live, 55.3MiB allocated; 7ms 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 5764607523034235/288230376151711744 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 5764607523034235/288230376151711744 binary64)) #s(approx (+ x ( x x)) x) #s(approx (+ x (* x x)) (*.f64 x x)))
#s(approx (+ x (* x x)) x)

derivations88.0ms (4.3%)

Memory

-10.1MiB live, 90.6MiB allocated; 13ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 35 to 11 computations (68.6% saved)

preprocess19.0ms (0.9%)

Memory: 25.9MiB live, 25.9MiB 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%)

sample756.0ms (36.6%)

explain49.0ms (2.4%)

preprocess218.0ms (10.6%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify135.0ms (6.5%)

localize17.0ms (0.8%)

series18.0ms (0.9%)

simplify153.0ms (7.4%)

rewrite48.0ms (2.3%)

eval4.0ms (0.2%)

prune2.0ms (0.1%)

simplify147.0ms (7.1%)

localize14.0ms (0.7%)

series1.0ms (0.1%)

simplify295.0ms (14.3%)

rewrite46.0ms (2.2%)

eval4.0ms (0.2%)

prune3.0ms (0.1%)

regimes4.0ms (0.2%)

regimes3.0ms (0.1%)

regimes5.0ms (0.2%)

bsearch0.0ms (0%)

simplify36.0ms (1.7%)

derivations88.0ms (4.3%)

preprocess19.0ms (0.9%)

end0.0ms (0%)

Profiling