Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, C
Time bar (total: 939.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 0 |
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 1 |
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 2 |
| 50% | 50% | 50% | 0.1% | 0% | 0% | 0% | 3 |
| 50% | 50% | 50% | 0.1% | 0% | 0% | 0% | 4 |
| 75% | 74.9% | 25% | 0.1% | 0% | 0% | 0% | 5 |
| 75% | 74.9% | 25% | 0.1% | 0% | 0% | 0% | 6 |
| 87.5% | 87.4% | 12.5% | 0.1% | 0% | 0% | 0% | 7 |
| 87.5% | 87.4% | 12.5% | 0.1% | 0% | 0% | 0% | 8 |
| 93.8% | 93.7% | 6.2% | 0.1% | 0% | 0% | 0% | 9 |
| 93.8% | 93.7% | 6.2% | 0.1% | 0% | 0% | 0% | 10 |
| 96.9% | 96.8% | 3.1% | 0.1% | 0% | 0% | 0% | 11 |
| 96.9% | 96.8% | 3.1% | 0.1% | 0% | 0% | 0% | 12 |
Compiled 8 to 6 computations (25% saved)
ival-mult: 2.0ms (69.9% of total)ival-div: 1.0ms (35% of total)const: 0.0ms (0% of total)backward-pass: 0.0ms (0% of total)| 440.0ms | 8256× | 0 | valid |
ival-div: 102.0ms (51.8% of total)ival-mult: 82.0ms (41.6% of total)const: 10.0ms (5.1% of total)backward-pass: 3.0ms (1.5% of total)| 1× | egg-herbie |
| 564× | fma-define |
| 258× | times-frac |
| 165× | associate-*l* |
| 159× | fma-neg |
| 151× | associate-*r* |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 20 | 141 |
| 1 | 48 | 133 |
| 2 | 110 | 133 |
| 3 | 337 | 133 |
| 4 | 1010 | 133 |
| 5 | 1741 | 133 |
| 6 | 2336 | 133 |
| 7 | 2535 | 133 |
| 8 | 2589 | 133 |
| 9 | 2669 | 133 |
| 1× | saturated |
| Inputs |
|---|
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
(/.f64 (neg.f64 x) (*.f64 y #s(literal 2 binary64))) |
(/.f64 x (*.f64 (neg.f64 y) #s(literal 2 binary64))) |
(neg.f64 (/.f64 (neg.f64 x) (*.f64 y #s(literal 2 binary64)))) |
(neg.f64 (/.f64 x (*.f64 (neg.f64 y) #s(literal 2 binary64)))) |
(/.f64 y (*.f64 x #s(literal 2 binary64))) |
| Outputs |
|---|
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
(*.f64 x (/.f64 #s(literal 1/2 binary64) y)) |
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
(*.f64 x (/.f64 #s(literal 1/2 binary64) y)) |
(/.f64 (neg.f64 x) (*.f64 y #s(literal 2 binary64))) |
(*.f64 #s(literal -1/2 binary64) (/.f64 x y)) |
(/.f64 x (*.f64 y #s(literal -2 binary64))) |
(*.f64 x (/.f64 #s(literal -1/2 binary64) y)) |
(/.f64 x (*.f64 (neg.f64 y) #s(literal 2 binary64))) |
(/.f64 (neg.f64 x) (*.f64 y #s(literal 2 binary64))) |
(*.f64 #s(literal -1/2 binary64) (/.f64 x y)) |
(/.f64 x (*.f64 y #s(literal -2 binary64))) |
(*.f64 x (/.f64 #s(literal -1/2 binary64) y)) |
(neg.f64 (/.f64 (neg.f64 x) (*.f64 y #s(literal 2 binary64)))) |
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
(*.f64 x (/.f64 #s(literal 1/2 binary64) y)) |
(neg.f64 (/.f64 x (*.f64 (neg.f64 y) #s(literal 2 binary64)))) |
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
(*.f64 x (/.f64 #s(literal 1/2 binary64) y)) |
(/.f64 y (*.f64 x #s(literal 2 binary64))) |
(*.f64 (/.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 y (/.f64 #s(literal 1/2 binary64) x)) |
(negabs x)
(negabs y)
| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
| 0 | 0 | - | 0 | - | x |
| 0 | 0 | - | 0 | - | (*.f64 y #s(literal 2 binary64)) |
| 0 | 0 | - | 0 | - | y |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 29.0ms | 512× | 0 | valid |
Compiled 35 to 23 computations (34.3% saved)
ival-mult: 7.0ms (57.4% of total)ival-div: 4.0ms (32.8% of total)const: 1.0ms (8.2% of total)backward-pass: 0.0ms (0% of total)Compiled 7 to 5 computations (28.6% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
Compiled 7 to 5 computations (28.6% saved)
| 17.0ms | 256× | 0 | valid |
Compiled 14 to 9 computations (35.7% saved)
ival-mult: 3.0ms (48.8% of total)ival-div: 2.0ms (32.5% of total)const: 1.0ms (16.3% of total)backward-pass: 0.0ms (0% of total)Compiled 2 to 2 computations (0% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 0 | 0 | 0 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 0 | 1 | 1 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
Compiled 14 to 10 computations (28.6% saved)
| 1× | egg-herbie |
| 1× | *-commutative |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 10 | 19 |
| 1 | 11 | 19 |
| 1× | saturated |
| Inputs |
|---|
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
| Outputs |
|---|
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
| 1× | done |
Compiled 7 to 5 computations (28.6% saved)
(negabs y)
(negabs x)
Compiled 84 to 60 computations (28.6% saved)
Loading profile data...