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

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

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample612.0ms (79.7%)

Results

311.0ms	3871×	1	valid
135.0ms	4385×	0	valid

Precisions

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

ival-add: 137.0ms (54.4% of total)

ival-sub: 62.0ms (24.6% of total)

backward-pass: 41.0ms (16.3% of total)

const: 12.0ms (4.8% of total)

Bogosity

preprocess40.0ms (5.2%)

Algorithm

1×	egg-herbie

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

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)

explain53.0ms (6.9%)

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
135	2	(1389.2975275119354)	-	`(-.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)`

Results

22.0ms	266×	1	valid
10.0ms	246×	0	valid

Compiler

Compiled 30 to 14 computations (53.3% saved)

Precisions

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

ival-add: 5.0ms (37.6% of total)

ival-sub: 4.0ms (30.1% of total)

backward-pass: 3.0ms (22.6% of total)

const: 1.0ms (7.5% of total)

eval0.0ms (0%)

Compiler: Compiled 7 to 4 computations (42.9% 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)

simplify6.0ms (0.7%)

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×

saturated

Calls

Call 1

Inputs
#s(literal 1 binary64)

Outputs
#s(literal 1 binary64)

localize14.0ms (1.9%)

Results

11.0ms

256×

valid

Compiler

Compiled 3 to 3 computations (0% saved)

Precisions

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

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 6 computations (33.3% saved)

regimes3.0ms (0.4%)

Accuracy

Total -32.7b remaining (-∞%)

Threshold costs -32.7b (-∞%)

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:

1.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.2%)

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×

saturated

Calls

Call 1

Inputs
#s(literal 1 binary64)

Outputs
#s(literal 1 binary64)

soundness15.0ms (1.9%)

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×	done
1×	saturated

Compiler

Compiled 17 to 10 computations (41.2% saved)

preprocess21.0ms (2.8%)

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

Cancel like terms

analyze0.0ms (0%)

sample612.0ms (79.7%)

preprocess40.0ms (5.2%)

explain53.0ms (6.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify6.0ms (0.7%)

localize14.0ms (1.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.4%)

simplify2.0ms (0.2%)

soundness15.0ms (1.9%)

preprocess21.0ms (2.8%)

end0.0ms (0%)

Profiling