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

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

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

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

const: 0.0ms (0% of total)

sample1.8s (64.6%)

Results

1.1s	4024×	1	valid
208.0ms	2197×	0	valid
199.0ms	2035×	0	infinite

Precisions

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

backward-pass: 211.0ms (30.6% of total)

ival-add: 201.0ms (29.1% of total)

ival-mult: 145.0ms (21% of total)

ival-sub: 93.0ms (13.5% of total)

const: 39.0ms (5.7% of total)

Bogosity

preprocess352.0ms (12.5%)

Algorithm

1×	egg-herbie

Rules

3207×	`fma-neg`
1104×	`unsub-neg`
506×	`distribute-neg-in`
429×	`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	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 #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))

explain133.0ms (4.7%)

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
131	-	-	`(-.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))`

Results

18.0ms	174×	256	valid
46.0ms	160×	1024	valid
15.0ms	122×	256	infinite
8.0ms	42×	512	valid
5.0ms	14×	2048	valid

Compiler

Compiled 56 to 42 computations (25% saved)

Precisions

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

ival-add: 23.0ms (51% of total)

ival-mult: 14.0ms (31% of total)

ival-sub: 5.0ms (11.1% of total)

const: 4.0ms (8.9% of total)

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 #s(literal 2 binary64)))

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize28.0ms (1%)

Results

16.0ms	195×	256	valid
4.0ms	61×	256	infinite

Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions

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

ival-add: 3.0ms (54.7% of total)

ival-mult: 2.0ms (36.5% of total)

const: 1.0ms (18.2% of total)

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)

regimes4.0ms (0.2%)

Accuracy

Total -30.3b remaining (-∞%)

Threshold costs -30.3b (-∞%)

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:

1.0ms	x
1.0ms	(+.f64 x #s(literal 1 binary64))
1.0ms	(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #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×

saturated

Calls

Call 1

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

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

soundness453.0ms (16.1%)

Rules

3207×	`fma-neg`
1104×	`unsub-neg`
506×	`distribute-neg-in`
429×	`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	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×	done
1×	node limit

Compiler

Compiled 77 to 59 computations (23.4% saved)

preprocess21.0ms (0.7%)

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

Expanding a square

analyze0.0ms (0%)

sample1.8s (64.6%)

preprocess352.0ms (12.5%)

explain133.0ms (4.7%)

eval1.0ms (0%)

prune1.0ms (0%)

localize28.0ms (1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes4.0ms (0.2%)

simplify2.0ms (0.1%)

soundness453.0ms (16.1%)

preprocess21.0ms (0.7%)

end0.0ms (0%)

Profiling