Metrics for math.square on complex, imaginary part

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 10 to 6 computations (40% saved)

sample775.0ms (82.2%)

Results

622.0ms	7164×	body	256	valid
83.0ms	1092×	body	256	infinite

Bogosity

preprocess69.0ms (7.3%)

Algorithm

1×	egg-herbie

Rules

136×	`fma-def`
47×	`associate-r`
42×	`*-commutative`
39×	`associate-+r+`
39×	`associate--r+`

Problems

256×

No Errors

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	20	151
1	36	103
2	59	95
3	125	95
4	253	95
5	501	95
6	691	95
7	790	95

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (.f64 re im) (.f64 im re))
(+.f64 (.f64 re im) (.f64 im re))
(+.f64 (.f64 (neg.f64 re) im) (.f64 im (neg.f64 re)))
(+.f64 (.f64 re (neg.f64 im)) (.f64 (neg.f64 im) re))
(+.f64 (.f64 im re) (.f64 re im))

Outputs
(+.f64 (.f64 re im) (.f64 im re))
(fma.f64 re im (*.f64 re im))
(.f64 2 (.f64 re im))
(.f64 re (.f64 2 im))
(.f64 im (.f64 re 2))
(+.f64 (.f64 re im) (.f64 im re))
(fma.f64 re im (*.f64 re im))
(.f64 2 (.f64 re im))
(.f64 re (.f64 2 im))
(.f64 im (.f64 re 2))
(+.f64 (.f64 (neg.f64 re) im) (.f64 im (neg.f64 re)))
(fma.f64 re (neg.f64 im) (*.f64 re (neg.f64 im)))
(.f64 2 (.f64 re (neg.f64 im)))
(.f64 re (.f64 im -2))
(+.f64 (.f64 re (neg.f64 im)) (.f64 (neg.f64 im) re))
(fma.f64 re (neg.f64 im) (*.f64 re (neg.f64 im)))
(.f64 2 (.f64 re (neg.f64 im)))
(.f64 re (.f64 im -2))
(+.f64 (.f64 im re) (.f64 re im))
(fma.f64 re im (*.f64 re im))
(.f64 2 (.f64 re im))
(.f64 re (.f64 2 im))
(.f64 im (.f64 re 2))

Symmetry

(sort re im)

Compiler

Compiled 27 to 11 computations (59.3% saved)

eval1.0ms (0.1%)

Compiler: Compiled 23 to 12 computations (47.8% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 re (.f64 2 im))
▶	100.0%	(.f64 re (.f64 2 im))

Compiler

Compiled 14 to 10 computations (28.6% saved)

localize22.0ms (2.3%)

Compiler: Compiled 14 to 9 computations (35.7% 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

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 re (.f64 2 im))

Compiler

Compiled 21 to 13 computations (38.1% saved)

regimes11.0ms (1.1%)

Accuracy

Total -0.0b remaining (-∞%)

Threshold costs -0b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 re (.f64 2 im))
(+.f64 (.f64 re im) (.f64 im re))

Outputs
(.f64 re (.f64 2 im))

Calls

3 calls:

5.0ms	im
3.0ms	re
3.0ms	(+.f64 (.f64 re im) (.f64 im re))

Results

Accuracy	Segments	Branch
100.0%	1	`re`
100.0%	1	`im`
100.0%	1	`(+.f64 (.f64 re im) (.f64 im re))`

Compiler

Compiled 29 to 17 computations (41.4% saved)

simplify3.0ms (0.3%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	19
1	12	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(.f64 re (.f64 2 im))

Outputs
(.f64 re (.f64 2 im))

Compiler

Compiled 7 to 5 computations (28.6% saved)

soundness42.0ms (4.4%)

Rules

136×	`fma-def`
47×	`associate-r`
42×	`*-commutative`
39×	`associate-+r+`
39×	`associate--r+`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	20	151
1	36	103
2	59	95
3	125	95
4	253	95
5	501	95
6	691	95
7	790	95

Stop Event

1×

saturated

Compiler

Compiled 26 to 11 computations (57.7% saved)

end0.0ms (0%)

preprocess18.0ms (1.9%)

Remove: (sort re im)
Compiler: Compiled 46 to 30 computations (34.8% saved)

analyze0.0ms (0%)

sample775.0ms (82.2%)

preprocess69.0ms (7.3%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

localize22.0ms (2.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes11.0ms (1.1%)

simplify3.0ms (0.3%)

soundness42.0ms (4.4%)

end0.0ms (0%)

preprocess18.0ms (1.9%)

Profiling