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

sample2.2s (68.4%)

Results

231.0ms	2163×	0	valid
227.0ms	2032×	0	infinite
665.0ms	1591×	4	valid
340.0ms	970×	3	valid
150.0ms	854×	1	valid
153.0ms	645×	2	valid
0.0ms	1×	4	valid
0.0ms	1×	6	exit

Precisions

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

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

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

Operation ival-mult, time spent: 161.0ms, 16.0% of total-time

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

Bogosity

preprocess529.0ms (16.5%)

Algorithm

1×	egg-herbie

Rules

6414×	`fma-neg`
2208×	`unsub-neg`
1012×	`distribute-neg-in`
858×	`sub-neg`
608×	`fma-define`

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
127	-	-	`(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)`
0	-	-	`x`
0	-	-	`(*.f64 (+.f64 x 1) (+.f64 x 1))`
0	-	-	`(+.f64 x 1)`
0	-	-	`1`

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	3792	76
6	4939	76
7	5788	76
8	6213	76
9	6453	76
10	6456	76
11	6456	76
12	6577	76
13	6664	76
14	6837	76
15	6837	76

Stop Event

1×	node limit

Calls

Call 1

Inputs
(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)
(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)
(-.f64 (*.f64 (+.f64 (neg.f64 x) 1) (+.f64 (neg.f64 x) 1)) 1)
(neg.f64 (-.f64 (*.f64 (+.f64 (neg.f64 x) 1) (+.f64 (neg.f64 x) 1)) 1))

Outputs
(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)
(fma.f64 (+.f64 x 1) (+.f64 x 1) -1)
(*.f64 (+.f64 x 2) (+.f64 x 0))
(*.f64 x (+.f64 x 2))
(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)
(fma.f64 (+.f64 x 1) (+.f64 x 1) -1)
(*.f64 (+.f64 x 2) (+.f64 x 0))
(*.f64 x (+.f64 x 2))
(-.f64 (*.f64 (+.f64 (neg.f64 x) 1) (+.f64 (neg.f64 x) 1)) 1)
(fma.f64 (+.f64 1 (neg.f64 x)) (+.f64 1 (neg.f64 x)) -1)
(fma.f64 (-.f64 1 x) (-.f64 1 x) -1)
(*.f64 (neg.f64 x) (-.f64 2 x))
(*.f64 x (+.f64 x -2))
(neg.f64 (-.f64 (*.f64 (+.f64 (neg.f64 x) 1) (+.f64 (neg.f64 x) 1)) 1))
(neg.f64 (fma.f64 (+.f64 1 (neg.f64 x)) (+.f64 1 (neg.f64 x)) -1))
(neg.f64 (fma.f64 (-.f64 1 x) (-.f64 1 x) -1))
(*.f64 (neg.f64 x) (neg.f64 (-.f64 2 x)))
(*.f64 x (-.f64 2 x))

Compiler

Compiled 56 to 42 computations (25% saved)

Precisions

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

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

Operation ival-mult, time spent: 18.0ms, 17.0% of total-time

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

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

eval1.0ms (0%)

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 2))

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize25.0ms (0.8%)

Compiler: Compiled 12 to 8 computations (33.3% saved)
Precisions: Click to see histograms. Total time spent on operations: 9.0ms
Operation ival-add, time spent: 5.0ms, 57.0% of total-time
Operation ival-mult, time spent: 2.0ms, 23.0% of total-time
Operation const, time spent: 1.0ms, 11.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 2))

Compiler

Compiled 21 to 15 computations (28.6% saved)

regimes10.0ms (0.3%)

Accuracy

Total -29.5b remaining (-∞%)

Threshold costs -29.5b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 x (+.f64 x 2))
(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)

Outputs
(*.f64 x (+.f64 x 2))

Calls

4 calls:

3.0ms	(+.f64 x 1)
3.0ms	x
2.0ms	(-.f64 (*.f64 (+.f64 x 1) (+.f64 x 1)) 1)
2.0ms	(*.f64 (+.f64 x 1) (+.f64 x 1))

Results

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

Compiler

Compiled 24 to 18 computations (25% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative`
2×	`+-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 2))

Outputs
(*.f64 x (+.f64 x 2))

Compiler

Compiled 6 to 4 computations (33.3% saved)

soundness417.0ms (13%)

Rules

6414×	`fma-neg`
2208×	`unsub-neg`
1012×	`distribute-neg-in`
858×	`sub-neg`
608×	`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	3792	76
6	4939	76
7	5788	76
8	6213	76
9	6453	76
10	6456	76
11	6456	76
12	6577	76
13	6664	76
14	6837	76
15	6837	76

Stop Event

1×	node limit

Compiler

Compiled 71 to 55 computations (22.5% saved)

end0.0ms (0%)

preprocess25.0ms (0.8%)

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

analyze0.0ms (0%)

sample2.2s (68.4%)

preprocess529.0ms (16.5%)

eval1.0ms (0%)

prune1.0ms (0%)

localize25.0ms (0.8%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes10.0ms (0.3%)

simplify2.0ms (0.1%)

soundness417.0ms (13%)

end0.0ms (0%)

preprocess25.0ms (0.8%)

Profiling