math.square on complex, imaginary part
Time bar (total: 1.2s)
| 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 |
Compiled 9 to 7 computations (22.2% saved)
| 449.0ms | 8 256× | 0 | valid |
ival-mult: 135.0ms (71.5% of total)ival-add: 49.0ms (26% of total)ival-assert: 3.0ms (1.6% of total)adjust: 2.0ms (1.1% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (*.f64 im re) |
| 0 | 0 | - | 0 | - | (+.f64 (*.f64 re im) (*.f64 im re)) |
| 0 | 0 | - | 0 | - | (*.f64 re im) |
| 0 | 0 | - | 0 | - | re |
| 0 | 0 | - | 0 | - | im |
| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 0 |
| - | 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 256 |
| number | freq |
|---|---|
| 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 1 |
| 339.0ms | 512× | 0 | valid |
Compiled 41 to 19 computations (53.7% saved)
ival-mult: 7.0ms (71% of total)ival-add: 2.0ms (20.3% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 19 | 44 |
| 1 | 40 | 32 |
| 2 | 85 | 30 |
| 3 | 158 | 30 |
| 4 | 222 | 30 |
| 5 | 320 | 30 |
| 6 | 752 | 30 |
| 7 | 1604 | 30 |
| 8 | 3580 | 30 |
| 0 | 8 | 7 |
| 0 | 14 | 7 |
| 0 | 14 | 7 |
| 1× | saturated |
| 1× | saturated |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
| Outputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
(negabs re)
(negabs im)
(sort re im)
Compiled 7 to 5 computations (28.6% saved)
Compiled 0 to 2 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (+.f64 (*.f64 re im) (*.f64 im re)) |
Compiled 7 to 5 computations (28.6% saved)
| Inputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
(*.f64 re im) |
re |
im |
(*.f64 im re) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
#s(approx (* re im) #s(hole binary64 (* im re))) |
#s(approx re #s(hole binary64 re)) |
#s(approx (* im re) #s(hole binary64 (* im re))) |
#s(approx im #s(hole binary64 im)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | im | @ | -inf | ((+ (* re im) (* im re)) (* re im) re im (* im re)) |
| 1.0ms | re | @ | -inf | ((+ (* re im) (* im re)) (* re im) re im (* im re)) |
| 1.0ms | re | @ | inf | ((+ (* re im) (* im re)) (* re im) re im (* im re)) |
| 1.0ms | im | @ | inf | ((+ (* re im) (* im re)) (* re im) re im (* im re)) |
| 1.0ms | re | @ | 0 | ((+ (* re im) (* im re)) (* re im) re im (* im re)) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 22 | 54 |
| 1 | 36 | 50 |
| 2 | 38 | 50 |
| 3 | 39 | 50 |
| 0 | 39 | 48 |
| 1 | 70 | 36 |
| 0 | 218 | 36 |
| 1× | saturated |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | saturated |
| Inputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
(*.f64 re im) |
re |
im |
(*.f64 im re) |
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
#s(approx (* re im) #s(hole binary64 (* im re))) |
#s(approx re #s(hole binary64 re)) |
#s(approx (* im re) #s(hole binary64 (* im re))) |
#s(approx im #s(hole binary64 im)) |
| Outputs |
|---|
(+.f64 (*.f64 im re) (*.f64 im re)) |
#s(literal 2 binary64) |
(*.f64 im re) |
(*.f64 re im) |
re |
im |
(*.f64 im re) |
(*.f64 re im) |
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(approx (* im re) (*.f64 im re)) |
#s(approx re re) |
#s(approx (* im re) (*.f64 im re)) |
#s(approx im im) |
Compiled 106 to 23 computations (78.3% saved)
2 alts after pruning (1 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 13 | 1 | 14 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 13 | 2 | 15 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (+.f64 (*.f64 re im) (*.f64 im re)) |
| ▶ | 5.1% | #s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
Compiled 16 to 12 computations (25% saved)
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 9.0ms | im | @ | -inf | ((+ (* re im) (* im re)) 2) |
| 0.0ms | re | @ | -inf | ((+ (* re im) (* im re)) 2) |
| 0.0ms | re | @ | inf | ((+ (* re im) (* im re)) 2) |
| 0.0ms | re | @ | 0 | ((+ (* re im) (* im re)) 2) |
| 0.0ms | im | @ | inf | ((+ (* re im) (* im re)) 2) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 25 |
| 1 | 24 | 25 |
| 2 | 25 | 25 |
| 0 | 25 | 15 |
| 1 | 56 | 7 |
| 0 | 204 | 7 |
| 1× | saturated |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | saturated |
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
#s(approx (+ (* re im) (* im re)) #s(hole binary64 (* 2 (* im re)))) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
Compiled 18 to 7 computations (61.1% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 2 | 0 | 2 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 2 | 2 | 4 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (+.f64 (*.f64 re im) (*.f64 im re)) |
| ✓ | 5.1% | #s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
Compiled 32 to 22 computations (31.3% saved)
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
(+.f64 (*.f64 re im) (*.f64 im re)) |
| Outputs |
|---|
(+.f64 (*.f64 re im) (*.f64 im re)) |
3 calls:
| 1.0ms | im |
| 1.0ms | re |
| 1.0ms | (+.f64 (*.f64 re im) (*.f64 im re)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (+.f64 (*.f64 re im) (*.f64 im re)) |
| 100.0% | 1 | re |
| 100.0% | 1 | im |
Compiled 9 to 9 computations (0% saved)
Total -0.0b remaining (-0%)
Threshold costs -0b (-0%)
| 1× | done |
| Inputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
| Outputs |
|---|
#s(approx (+ (* re im) (* im re)) #s(literal 2 binary64)) |
3 calls:
| 1.0ms | im |
| 1.0ms | re |
| 1.0ms | (+.f64 (*.f64 re im) (*.f64 im re)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 5.1% | 1 | (+.f64 (*.f64 re im) (*.f64 im re)) |
| 5.1% | 1 | re |
| 5.1% | 1 | im |
Compiled 25 to 19 computations (24% saved)
(sort re im)
(negabs im)
(negabs re)
Compiled 172 to 120 computations (30.2% saved)
Loading profile data...