Metrics for Commute and associate

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 13 to 10 computations (23.1% saved)

sample2.1s (73%)

Memory

34.2MiB live, 1 376.4MiB allocated

Samples

1.2s	5 903×	2	valid
175.0ms	1 784×	1	valid
99.0ms	564×	3	valid
0.0ms	5×	0	valid

Precisions

Click to see histograms. Total time spent on operations: 1.1s

ival-add: 759.0ms (67.3% of total)

adjust: 198.0ms (17.6% of total)

ival-sub: 163.0ms (14.4% of total)

ival-true: 5.0ms (0.4% of total)

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

Bogosity

preprocess215.0ms (7.4%)

Memory

-9.4MiB live, 30.3MiB allocated

Algorithm

1×	egg-herbie

Rules

1 242×	`associate-+r+`
1 197×	`associate-+r-`
1 191×	`associate-+l+`
848×	`fmm-def`
670×	`fma-define`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	46	539
1	140	11
2	551	11
3	1745	11
4	3207	11
5	3915	11
6	3926	11
7	3934	11
8	3934	11
9	4316	11
10	4316	11
11	4316	11
12	4316	11

Stop Event

1×	node limit

Calls

Call 1

Inputs
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))
(-.f64 (+.f64 (+.f64 (neg.f64 x) y) z) (+.f64 (neg.f64 x) (+.f64 y z)))
(-.f64 (+.f64 (+.f64 x (neg.f64 y)) z) (+.f64 x (+.f64 (neg.f64 y) z)))
(-.f64 (+.f64 (+.f64 x y) (neg.f64 z)) (+.f64 x (+.f64 y (neg.f64 z))))
(neg.f64 (-.f64 (+.f64 (+.f64 (neg.f64 x) y) z) (+.f64 (neg.f64 x) (+.f64 y z))))
(neg.f64 (-.f64 (+.f64 (+.f64 x (neg.f64 y)) z) (+.f64 x (+.f64 (neg.f64 y) z))))
(neg.f64 (-.f64 (+.f64 (+.f64 x y) (neg.f64 z)) (+.f64 x (+.f64 y (neg.f64 z)))))
(-.f64 (+.f64 (+.f64 y x) z) (+.f64 y (+.f64 x z)))
(-.f64 (+.f64 (+.f64 z y) x) (+.f64 z (+.f64 y x)))
(-.f64 (+.f64 (+.f64 x z) y) (+.f64 x (+.f64 z y)))

Outputs
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 (neg.f64 x) y) z) (+.f64 (neg.f64 x) (+.f64 y z)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 x (neg.f64 y)) z) (+.f64 x (+.f64 (neg.f64 y) z)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 x y) (neg.f64 z)) (+.f64 x (+.f64 y (neg.f64 z))))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(neg.f64 (-.f64 (+.f64 (+.f64 (neg.f64 x) y) z) (+.f64 (neg.f64 x) (+.f64 y z))))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(neg.f64 (-.f64 (+.f64 (+.f64 x (neg.f64 y)) z) (+.f64 x (+.f64 (neg.f64 y) z))))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(neg.f64 (-.f64 (+.f64 (+.f64 x y) (neg.f64 z)) (+.f64 x (+.f64 y (neg.f64 z)))))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 y x) z) (+.f64 y (+.f64 x z)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 z y) x) (+.f64 z (+.f64 y x)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 x z) y) (+.f64 x (+.f64 z y)))
(+.f64 (+.f64 x y) (-.f64 z (+.f64 y (+.f64 x z))))
#s(literal 0 binary64)

Symmetry

(abs x)

(abs y)

(abs z)

(negabs x)

(negabs y)

(negabs z)

(sort x y z)

explain136.0ms (4.7%)

Memory

26.0MiB live, 216.1MiB allocated

FPErrors

Click to see full error table

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

50.0ms	360×	2	valid
11.0ms	118×	1	valid
7.0ms	34×	3	valid

Compiler

Compiled 92 to 36 computations (60.9% saved)

Precisions

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

ival-add: 24.0ms (57.8% of total)

adjust: 12.0ms (28.9% of total)

ival-sub: 5.0ms (12% of total)

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

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

eval0.0ms (0%)

Memory: 0.9MiB live, 0.9MiB allocated
Compiler: Compiled 15 to 9 computations (40% saved)

prune1.0ms (0%)

Memory

2.0MiB live, 2.0MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(literal 0 binary64)

Compiler

Compiled 4 to 4 computations (0% saved)

simplify7.0ms (0.2%)

Memory

-27.0MiB live, 4.1MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

localize7.0ms (0.2%)

Memory

14.0MiB live, 14.0MiB allocated

Samples

5.0ms

256×

valid

Compiler

Compiled 3 to 6 computations (-100% saved)

Precisions

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

...in/eval/compile.rkt:76:19: 0.0ms (0% of total)

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

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

eval0.0ms (0%)

Memory: 0.3MiB live, 0.3MiB allocated
Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

Memory

1.9MiB live, 1.9MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(literal 0 binary64)

Compiler

Compiled 19 to 13 computations (31.6% saved)

regimes6.0ms (0.2%)

Memory

14.1MiB live, 14.1MiB allocated

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))

Outputs
#s(literal 0 binary64)

Calls

4 calls:

1.0ms	z
1.0ms	y
1.0ms	x
1.0ms	(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`
100.0%	1	`(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))`

Compiler

Compiled 26 to 17 computations (34.6% saved)

simplify5.0ms (0.2%)

Memory

-41.6MiB live, 0.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

soundness371.0ms (12.8%)

Memory

3.0MiB live, 66.7MiB allocated

Rules

1 242×	`associate-+r+`
1 197×	`associate-+r-`
1 191×	`associate-+l+`
848×	`fmm-def`
670×	`fma-define`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	46	539
1	140	11
2	551	11
3	1745	11
4	3207	11
5	3915	11
6	3926	11
7	3934	11
8	3934	11
9	4316	11
10	4316	11
11	4316	11
12	4316	11

Stop Event

1×	done
1×	node limit

Compiler

Compiled 52 to 18 computations (65.4% saved)

preprocess37.0ms (1.3%)

Memory

25.2MiB live, 89.1MiB allocated

Remove

(sort x y z)

(negabs z)

(negabs y)

(negabs x)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 148 to 136 computations (8.1% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

sample2.1s (73%)

preprocess215.0ms (7.4%)

explain136.0ms (4.7%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify7.0ms (0.2%)

localize7.0ms (0.2%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes6.0ms (0.2%)

simplify5.0ms (0.2%)

soundness371.0ms (12.8%)

preprocess37.0ms (1.3%)

end0.0ms (0%)

Profiling