Metrics for ENA, Section 1.4, Exercise 4b, n=2

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	25.7%	74.3%	0%	0%	0%	0
100%	25.7%	0%	74.3%	0%	0%	0%	1

Compiler

Compiled 26 to 19 computations (26.9% saved)

sample2.0s (89.8%)

Results

1.4s	6174×	body	256	valid
372.0ms	1023×	body	1024	valid
239.0ms	1036×	body	512	valid
8.0ms	23×	body	2048	valid

Bogosity

preprocess51.0ms (2.3%)

Algorithm

1×	egg-herbie

Rules

1358×	`fma-def`
852×	`unswap-sqr`
758×	`distribute-lft-out`
646×	`distribute-lft-neg-in`
640×	`associate-r`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	23	116
1	64	100
2	168	100
3	714	76
4	4082	76

Stop Event

1×	node limit

Calls

Call 1

Inputs
(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))
(-.f64 (pow.f64 (+.f64 (neg.f64 x) eps) 2) (pow.f64 (neg.f64 x) 2))
(-.f64 (pow.f64 (+.f64 x (neg.f64 eps)) 2) (pow.f64 x 2))
(-.f64 (pow.f64 (+.f64 eps x) 2) (pow.f64 eps 2))

Outputs
(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))
(-.f64 (pow.f64 (+.f64 x eps) 2) (*.f64 x x))
(*.f64 eps (+.f64 x (+.f64 x eps)))
(-.f64 (pow.f64 (+.f64 (neg.f64 x) eps) 2) (pow.f64 (neg.f64 x) 2))
(-.f64 (pow.f64 (+.f64 eps (neg.f64 x)) 2) (pow.f64 (neg.f64 x) 2))
(-.f64 (pow.f64 (-.f64 eps x) 2) (*.f64 x x))
(.f64 eps (+.f64 eps (.f64 x -2)))
(-.f64 (pow.f64 (+.f64 x (neg.f64 eps)) 2) (pow.f64 x 2))
(-.f64 (pow.f64 (+.f64 eps (neg.f64 x)) 2) (pow.f64 (neg.f64 x) 2))
(-.f64 (pow.f64 (-.f64 eps x) 2) (*.f64 x x))
(.f64 eps (+.f64 eps (.f64 x -2)))
(-.f64 (pow.f64 (+.f64 eps x) 2) (pow.f64 eps 2))
(-.f64 (pow.f64 (+.f64 x eps) 2) (*.f64 eps eps))
(*.f64 x (+.f64 x (+.f64 eps eps)))

Compiler

Compiled 13 to 10 computations (23.1% saved)

simplify31.0ms (1.4%)

Algorithm

1×	egg-herbie

Rules

1174×	`distribute-lft-in`
1074×	`distribute-rgt-in`
1026×	`cancel-sign-sub-inv`
942×	`fma-def`
940×	`fma-neg`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	9	25
1	21	25
2	52	25
3	164	25
4	652	15
5	2899	15

Stop Event

1×	node limit

Counts

1 → 3

Calls

Call 1

Inputs
(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))

Outputs
(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))
(-.f64 (pow.f64 (+.f64 x eps) 2) (*.f64 x x))
(*.f64 eps (fma.f64 2 x eps))

eval1.0ms (0%)

Compiler: Compiled 26 to 15 computations (42.3% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	2	1	3
Fresh	1	0	1
Picked	0	0	0
Done	0	0	0
Total	3	1	4

Accurracy

100.0%

Counts

4 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 eps (fma.f64 2 x eps))
▶	100.0%	(*.f64 eps (fma.f64 2 x eps))

Compiler

Compiled 16 to 10 computations (37.5% saved)

localize29.0ms (1.3%)

Compiler: Compiled 16 to 9 computations (43.8% saved)

eval0.0ms (0%)

Compiler: Compiled 2 to 2 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

Accurracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 eps (fma.f64 2 x eps))

Compiler

Compiled 25 to 16 computations (36% saved)

regimes9.0ms (0.4%)

Accuracy

Total -13.4b remaining (-∞%)

Threshold costs -13.4b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 eps (fma.f64 2 x eps))
(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))

Outputs
(*.f64 eps (fma.f64 2 x eps))

Calls

3 calls:

3.0ms	(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))
3.0ms	eps
3.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`eps`
100.0%	1	`(-.f64 (pow.f64 (+.f64 x eps) 2) (pow.f64 x 2))`

Compiler

Compiled 34 to 23 computations (32.4% saved)

simplify4.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	15
1	9	15

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 eps (fma.f64 2 x eps))

Outputs
(*.f64 eps (fma.f64 2 x eps))

Compiler

Compiled 8 to 5 computations (37.5% saved)

soundness81.0ms (3.6%)

Rules

1174×	`distribute-lft-in`
1074×	`distribute-rgt-in`
1026×	`cancel-sign-sub-inv`
942×	`fma-def`
940×	`fma-neg`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	9	25
1	21	25
2	52	25
3	164	25
4	652	15
5	2899	15

Stop Event

1×	node limit

Compiler

Compiled 120 to 40 computations (66.7% saved)

end0.0ms (0%)

preprocess21.0ms (0.9%)

Compiler: Compiled 38 to 26 computations (31.6% saved)

analyze0.0ms (0%)

sample2.0s (89.8%)

preprocess51.0ms (2.3%)

simplify31.0ms (1.4%)

eval1.0ms (0%)

prune1.0ms (0.1%)

localize29.0ms (1.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes9.0ms (0.4%)

simplify4.0ms (0.2%)

soundness81.0ms (3.6%)

end0.0ms (0%)

preprocess21.0ms (0.9%)

Profiling