Metrics for Cancel like terms

analyze0.0ms (0%)

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)

Precisions

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

Operation ival-sub, time spent: 0.0ms, 0.0% of total-time

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample843.0ms (70%)

Results

422.0ms	5296×	256	valid
259.0ms	1919×	1024	valid
103.0ms	1040×	512	valid
0.0ms	1×	256	valid

Precisions

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

Operation ival-add, time spent: 88.0ms, 49.0% of total-time

Operation ival-sub, time spent: 71.0ms, 40.0% of total-time

Operation const, time spent: 19.0ms, 11.0% of total-time

Bogosity

preprocess305.0ms (25.3%)

Algorithm

1×	egg-herbie

Rules

28×	`fma-neg`
21×	`sub-neg`
13×	`fma-define`
10×	`distribute-lft-neg-in`
10×	`associate-+l-`

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
115	6	(29533.188466881158)	-	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`
0	0	-	-	`x`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`(+.f64 #s(literal 1 binary64) x)`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	84
1	33	4
2	91	4
3	130	4
4	177	4
5	203	4
6	215	4
7	219	4

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(-.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (neg.f64 x))
(neg.f64 (-.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (neg.f64 x)))

Outputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) (-.f64 x x))
#s(literal 1 binary64)
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) (-.f64 x x))
#s(literal 1 binary64)
(-.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (neg.f64 x))
(+.f64 #s(literal 1 binary64) (-.f64 x x))
#s(literal 1 binary64)
(neg.f64 (-.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (neg.f64 x)))
(neg.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) (neg.f64 x)))
#s(literal -1 binary64)

Symmetry

(abs x)

Compiler

Compiled 30 to 20 computations (33.3% saved)

Precisions

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

Operation ival-add, time spent: 10.0ms, 63.0% of total-time

Operation ival-sub, time spent: 4.0ms, 25.0% of total-time

Operation const, time spent: 2.0ms, 13.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 2 to 2 computations (0% saved)

localize16.0ms (1.3%)

Compiler: Compiled 3 to 3 computations (0% saved)
Precisions: Click to see histograms. Total time spent on operations: 0.0ms
Operation const, time spent: 0.0ms, 0.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

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 1 binary64)

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes2.0ms (0.2%)

Accuracy

Total -27.9b remaining (-∞%)

Threshold costs -27.9b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(literal 1 binary64)
(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Outputs
#s(literal 1 binary64)

Calls

2 calls:

2.0ms	x
1.0ms	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`

Compiler

Compiled 8 to 5 computations (37.5% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

3× 1-exp

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
1	8	1

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
#s(literal 1 binary64)

Outputs
#s(literal 1 binary64)

Compiler

Compiled 2 to 2 computations (0% saved)

soundness15.0ms (1.2%)

Rules

28×	`fma-neg`
21×	`sub-neg`
13×	`fma-define`
10×	`distribute-lft-neg-in`
10×	`associate-+l-`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	84
1	33	4
2	91	4
3	130	4
4	177	4
5	203	4
6	215	4
7	219	4

Stop Event

1×

saturated

Compiler

Compiled 15 to 11 computations (26.7% saved)

end0.0ms (0%)

preprocess19.0ms (1.6%)

Remove: (abs x)
Compiler: Compiled 24 to 20 computations (16.7% saved)

analyze0.0ms (0%)

sample843.0ms (70%)

preprocess305.0ms (25.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize16.0ms (1.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes2.0ms (0.2%)

simplify2.0ms (0.1%)

soundness15.0ms (1.2%)

end0.0ms (0%)

preprocess19.0ms (1.6%)

Profiling