Metrics for Expression 2, p15

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample916.0ms (55%)

Memory

-19.1MiB live, 1 323.2MiB allocated; 368ms collecting garbage

Samples

551.0ms

8 256×

valid

Precisions

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

ival-mult: 129.0ms (49.8% of total)

ival-add: 54.0ms (20.8% of total)

ival-<=: 49.0ms (18.9% of total)

ival-and: 12.0ms (4.6% of total)

exact: 10.0ms (3.9% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain64.0ms (3.8%)

Memory

11.7MiB live, 146.9MiB allocated; 36ms 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

24.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% of total)

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

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

adjust: 0.0ms (0% of total)

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

preprocess166.0ms (9.9%)

Memory

12.1MiB live, 242.6MiB allocated; 52ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	13
1	23	12
2	61	10
3	91	10
4	159	10
5	405	10
6	1340	10
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.0MiB live, 0.0MiB 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)

series2.0ms (0.1%)

Memory

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

Counts

3 → 6

Calls

Call 1

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

simplify173.0ms (10.4%)

Memory

20.0MiB live, 163.3MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	48
1	45	48
2	126	48
3	391	48
4	2144	48
5	7644	48
0	8923	42

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

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 #s(hole binary64 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 #s(hole binary64 x))
#s(approx 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))

rewrite62.0ms (3.7%)

Memory

-3.3MiB live, 96.9MiB allocated; 51ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

3 → 38

Calls

Call 1

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

eval8.0ms (0.5%)

Memory: -27.3MiB live, 18.5MiB allocated; 6ms collecting garbage
Compiler: Compiled 430 to 106 computations (75.3% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	45	2	47
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	46	2	48

Accuracy

100.0%

Counts

48 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 11 to 6 computations (45.5% saved)

series1.0ms (0.1%)

Memory

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

Counts

3 → 9

Calls

Call 1

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

simplify126.0ms (7.6%)

Memory

8.9MiB live, 196.2MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	79
1	49	79
2	130	79
3	401	79
4	2152	79
5	7669	79
0	8001	67

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 #s(hole binary64 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 #s(hole binary64 x))
#s(approx 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))

rewrite44.0ms (2.6%)

Memory

7.5MiB live, 89.4MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

3 → 30

Calls

Call 1

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

Outputs
#s(approx (+ x (* 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))

eval3.0ms (0.2%)

Memory: 11.4MiB live, 11.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 421 to 86 computations (79.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	39	0	39
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	39	2	41

Accuracy

100.0%

Counts

41 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 27 to 13 computations (51.9% saved)

regimes3.0ms (0.2%)

Memory

10.8MiB live, 10.8MiB 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	x
1.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)

regimes10.0ms (0.6%)

Memory

-51.5MiB live, 10.8MiB allocated; 11ms 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:

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

Results

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify32.0ms (1.9%)

Memory

4.0MiB live, 50.4MiB allocated; 7ms 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)

derivations37.0ms (2.2%)

Memory

-4.4MiB live, 41.3MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 11 to 5 computations (54.5% saved)

preprocess14.0ms (0.8%)

Memory: 33.7MiB live, 33.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 42 to 24 computations (42.9% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample916.0ms (55%)

explain64.0ms (3.8%)

preprocess166.0ms (9.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify173.0ms (10.4%)

rewrite62.0ms (3.7%)

eval8.0ms (0.5%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

simplify126.0ms (7.6%)

rewrite44.0ms (2.6%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

regimes3.0ms (0.2%)

regimes10.0ms (0.6%)

simplify32.0ms (1.9%)

derivations37.0ms (2.2%)

preprocess14.0ms (0.8%)

end0.0ms (0%)

Profiling