math.square on complex, imaginary part

Time bar (total: 1.3s)

analyze0.0ms (0%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
ival-add: 0.0ms (0% of total)
ival-mult: 0.0ms (0% of total)
const: 0.0ms (0% of total)

sample817.0ms (64.4%)

Results
524.0ms7206×0valid
78.0ms1050×0infinite
Precisions
Click to see histograms. Total time spent on operations: 195.0ms
ival-mult: 140.0ms (71.6% of total)
ival-add: 44.0ms (22.5% of total)
const: 8.0ms (4.1% of total)
backward-pass: 4.0ms (2% of total)
Bogosity

preprocess289.0ms (22.8%)

Algorithm
1×egg-herbie
Rules
223×fma-define
93×fma-neg
34×distribute-lft-neg-in
30×associate-*r*
28×unsub-neg
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
022205
150141
292133
3239133
4465133
5718133
6720133
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))
(neg.f64 (+.f64 (*.f64 (neg.f64 re) im) (*.f64 im (neg.f64 re))))
(neg.f64 (+.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))
(*.f64 im (*.f64 re #s(literal 2 binary64)))
(+.f64 (*.f64 re im) (*.f64 im re))
(*.f64 im (*.f64 re #s(literal 2 binary64)))
(+.f64 (*.f64 (neg.f64 re) im) (*.f64 im (neg.f64 re)))
(*.f64 re (*.f64 im #s(literal -2 binary64)))
(+.f64 (*.f64 re (neg.f64 im)) (*.f64 (neg.f64 im) re))
(*.f64 re (*.f64 im #s(literal -2 binary64)))
(neg.f64 (+.f64 (*.f64 (neg.f64 re) im) (*.f64 im (neg.f64 re))))
(*.f64 im (*.f64 re #s(literal 2 binary64)))
(neg.f64 (+.f64 (*.f64 re (neg.f64 im)) (*.f64 (neg.f64 im) re)))
(*.f64 im (*.f64 re #s(literal 2 binary64)))
(+.f64 (*.f64 im re) (*.f64 re im))
(*.f64 im (*.f64 re #s(literal 2 binary64)))
Symmetry

(negabs re)

(negabs im)

(sort re im)

explain61.0ms (4.8%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-im
00-0-re
00-0-(+.f64 (*.f64 re im) (*.f64 im re))
00-0-(*.f64 re im)
00-0-(*.f64 im re)
Results
37.0ms454×256valid
4.0ms58×256infinite
Compiler

Compiled 45 to 17 computations (62.2% saved)

Precisions
Click to see histograms. Total time spent on operations: 11.0ms
ival-mult: 8.0ms (76.1% of total)
ival-add: 2.0ms (19% of total)
const: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(*.f64 im (*.f64 re #s(literal 2 binary64)))
Compiler

Compiled 7 to 5 computations (28.6% saved)

localize28.0ms (2.2%)

Results
19.0ms227×256valid
2.0ms29×256infinite
Compiler

Compiled 14 to 9 computations (35.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-mult: 5.0ms (85.9% of total)
const: 1.0ms (17.2% of total)

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)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(*.f64 im (*.f64 re #s(literal 2 binary64)))
Compiler

Compiled 21 to 13 computations (38.1% saved)

regimes4.0ms (0.3%)

Accuracy

Total -0.0b remaining (-∞%)

Threshold costs -0b (-∞%)

Counts
2 → 1
Calls
Call 1
Inputs
(*.f64 im (*.f64 re #s(literal 2 binary64)))
(+.f64 (*.f64 re im) (*.f64 im re))
Outputs
(*.f64 im (*.f64 re #s(literal 2 binary64)))
Calls

3 calls:

1.0ms
im
1.0ms
re
1.0ms
(+.f64 (*.f64 re im) (*.f64 im re))
Results
AccuracySegmentsBranch
100.0%1re
100.0%1im
100.0%1(+.f64 (*.f64 re im) (*.f64 im re))
Compiler

Compiled 15 to 9 computations (40% saved)

simplify2.0ms (0.1%)

Algorithm
1×egg-herbie
Rules
2×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01019
11219
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 im (*.f64 re #s(literal 2 binary64)))
Outputs
(*.f64 im (*.f64 re #s(literal 2 binary64)))

soundness38.0ms (3%)

Rules
223×fma-define
93×fma-neg
34×distribute-lft-neg-in
30×associate-*r*
28×unsub-neg
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
022205
150141
292133
3239133
4465133
5718133
6720133
Stop Event
1×done
1×saturated
Compiler

Compiled 38 to 18 computations (52.6% saved)

preprocess26.0ms (2%)

Remove

(sort re im)

(negabs im)

(negabs re)

Compiler

Compiled 116 to 80 computations (31% saved)

end0.0ms (0%)

Profiling

Loading profile data...