Metrics for Expanding a square

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 11 to 9 computations (18.2% 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 ival-mult, time spent: 0.0ms, 0.0% of total-time

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

sample1.3s (53.4%)

Results

262.0ms	2920×	256	valid
224.0ms	2081×	256	infinite
459.0ms	2069×	1024	valid
157.0ms	1044×	512	valid
33.0ms	141×	2048	valid
0.0ms	1×	1024	valid

Precisions

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

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

Operation ival-mult, time spent: 146.0ms, 29.0% of total-time

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

Operation const, time spent: 34.0ms, 7.0% of total-time

Bogosity

preprocess634.0ms (26.7%)

Algorithm

1×	egg-herbie

Rules

3207×	`fmm-def`
1038×	`unsub-neg`
503×	`distribute-neg-in`
426×	`sub-neg`
304×	`fma-define`

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
121	-	-	`(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))`
0	-	-	`x`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)))`
0	-	-	`(+.f64 x #s(literal 1 binary64))`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	15	128
1	51	108
2	146	88
3	488	76
4	2177	76
5	3786	76
6	4927	76
7	5774	76
8	6199	76
9	6439	76
10	6442	76
11	6442	76
12	6563	76
13	6650	76
14	6823	76
15	6823	76

Stop Event

1×	node limit

Calls

Call 1

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

Outputs
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(fma.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(*.f64 (+.f64 x #s(literal 2 binary64)) (+.f64 x #s(literal 0 binary64)))
(*.f64 x (+.f64 x #s(literal 2 binary64)))
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(fma.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(*.f64 (+.f64 x #s(literal 2 binary64)) (+.f64 x #s(literal 0 binary64)))
(*.f64 x (+.f64 x #s(literal 2 binary64)))
(-.f64 (*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (+.f64 (neg.f64 x) #s(literal 1 binary64))) #s(literal 1 binary64))
(fma.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (+.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))
(*.f64 (neg.f64 x) (-.f64 #s(literal 2 binary64) x))
(*.f64 x (+.f64 x #s(literal -2 binary64)))
(neg.f64 (-.f64 (*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (+.f64 (neg.f64 x) #s(literal 1 binary64))) #s(literal 1 binary64)))
(neg.f64 (fma.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (+.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal -1 binary64)))
(neg.f64 (fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 (-.f64 #s(literal 2 binary64) x)))
(*.f64 x (-.f64 #s(literal 2 binary64) x))

Compiler

Compiled 56 to 42 computations (25% saved)

Precisions

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

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

Operation ival-mult, time spent: 13.0ms, 29.0% of total-time

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

Operation const, time spent: 4.0ms, 9.0% of total-time

eval3.0ms (0.1%)

Compiler: Compiled 21 to 15 computations (28.6% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 x (+.f64 x #s(literal 2 binary64)))

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize23.0ms (1%)

Compiler: Compiled 12 to 8 computations (33.3% saved)
Precisions: Click to see histograms. Total time spent on operations: 6.0ms
Operation ival-add, time spent: 3.0ms, 53.0% of total-time
Operation ival-mult, time spent: 2.0ms, 35.0% of total-time
Operation const, time spent: 1.0ms, 18.0% of total-time

eval0.0ms (0%)

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

prune1.0ms (0%)

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%	(*.f64 x (+.f64 x #s(literal 2 binary64)))

Compiler

Compiled 21 to 15 computations (28.6% saved)

regimes5.0ms (0.2%)

Accuracy

Total -28.4b remaining (-∞%)

Threshold costs -28.4b (-∞%)

Counts

2 → 1

Calls

Call 1

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

Outputs
(*.f64 x (+.f64 x #s(literal 2 binary64)))

Calls

4 calls:

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

Results

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

Compiler

Compiled 24 to 18 computations (25% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

1×	`*-commutative`
1×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	19
1	10	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 x (+.f64 x #s(literal 2 binary64)))

Outputs
(*.f64 x (+.f64 x #s(literal 2 binary64)))

Compiler

Compiled 6 to 4 computations (33.3% saved)

soundness411.0ms (17.3%)

Rules

3207×	`fmm-def`
1038×	`unsub-neg`
503×	`distribute-neg-in`
426×	`sub-neg`
304×	`fma-define`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	15	128
1	51	108
2	146	88
3	488	76
4	2177	76
5	3786	76
6	4927	76
7	5774	76
8	6199	76
9	6439	76
10	6442	76
11	6442	76
12	6563	76
13	6650	76
14	6823	76
15	6823	76

Stop Event

1×	node limit

Compiler

Compiled 71 to 55 computations (22.5% saved)

end0.0ms (0%)

preprocess25.0ms (1%)

Compiler: Compiled 32 to 24 computations (25% saved)

analyze0.0ms (0%)

sample1.3s (53.4%)

preprocess634.0ms (26.7%)

eval3.0ms (0.1%)

prune1.0ms (0%)

localize23.0ms (1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes5.0ms (0.2%)

simplify2.0ms (0.1%)

soundness411.0ms (17.3%)

end0.0ms (0%)

preprocess25.0ms (1%)

Profiling