Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, A
Time bar (total: 1.4s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.7% | 0.3% | 0% | 0% | 0% | 0 |
| 100% | 99.7% | 0% | 0.3% | 0% | 0% | 0% | 1 |
Compiled 19 to 19 computations (0% saved)
| 18.0ms | 260× | 0 | valid |
ival-mult: 9.0ms (80.4% of total)ival-sub: 1.0ms (8.9% of total)ival-add: 1.0ms (8.9% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 20 | 0 | - | 0 | - | (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) |
| 4 | 0 | - | 0 | - | (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) |
| 1 | 0 | - | 0 | - | (*.f64 (*.f64 a #s(literal 27 binary64)) b) |
| 0 | 0 | - | 0 | - | a |
| 0 | 0 | - | 0 | - | t |
| 0 | 0 | - | 0 | - | (*.f64 a #s(literal 27 binary64)) |
| 0 | 0 | - | 0 | - | y |
| 0 | 0 | - | 0 | - | #s(literal 27 binary64) |
| 0 | 0 | - | 0 | - | (*.f64 x #s(literal 2 binary64)) |
| 0 | 0 | - | 0 | - | (*.f64 y #s(literal 9 binary64)) |
| 0 | 0 | - | 0 | - | #s(literal 9 binary64) |
| 0 | 0 | - | 0 | - | z |
| 0 | 0 | - | 0 | - | (*.f64 (*.f64 y #s(literal 9 binary64)) z) |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 0 | 0 | - | 0 | - | b |
| 0 | 0 | - | 0 | - | (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) |
| 0 | 0 | - | 0 | - | x |
| Operator | Subexpression | Explanation | Count | |
|---|---|---|---|---|
*.f64 | (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) | n*o | 9 | 0 |
+.f64 | (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) | nan-rescue | 4 | 0 |
| ↳ | (*.f64 (*.f64 y #s(literal 9 binary64)) z) | overflow | 42 | |
| ↳ | (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) | overflow | 51 | |
| ↳ | (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) | overflow | 51 | |
| ↳ | (*.f64 a #s(literal 27 binary64)) | overflow | 1 | |
| ↳ | (*.f64 (*.f64 a #s(literal 27 binary64)) b) | overflow | 31 | |
*.f64 | (*.f64 (*.f64 a #s(literal 27 binary64)) b) | n*o | 1 | 0 |
*.f64 | (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) | n*u | 1 | 0 |
| Predicted + | Predicted - | |
|---|---|---|
| + | 12 | 0 |
| - | 3 | 241 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 12 | 0 | 0 |
| - | 3 | 0 | 241 |
| number | freq |
|---|---|
| 0 | 241 |
| 1 | 15 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 1 | 0 | 0 |
| - | 0 | 0 | 0 |
| 257.0ms | 3 072× | 0 | valid |
Compiled 2 496 to 840 computations (66.3% saved)
ival-mult: 100.0ms (76% of total)ival-sub: 13.0ms (9.9% of total)ival-add: 11.0ms (8.4% of total)exact: 4.0ms (3% of total)ival-true: 2.0ms (1.5% of total)ival-assert: 1.0ms (0.8% of total)| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 122 | 477 |
| 1 | 444 | 459 |
| 2 | 1349 | 459 |
| 3 | 3158 | 459 |
| 4 | 5461 | 459 |
| 5 | 6769 | 459 |
| 6 | 7193 | 459 |
| 7 | 7242 | 459 |
| 8 | 7261 | 459 |
| 9 | 7696 | 459 |
| 0 | 17 | 17 |
| 0 | 25 | 17 |
| 1 | 45 | 17 |
| 2 | 118 | 17 |
| 3 | 345 | 17 |
| 4 | 631 | 17 |
| 5 | 926 | 17 |
| 6 | 1276 | 17 |
| 7 | 1599 | 17 |
| 8 | 1793 | 17 |
| 9 | 1795 | 17 |
| 10 | 1795 | 17 |
| 11 | 1795 | 17 |
| 12 | 1799 | 17 |
| 0 | 1799 | 15 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) |
| Outputs |
|---|
(+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) |
(fma.f64 (*.f64 #s(literal -9 binary64) t) (*.f64 z y) (fma.f64 (*.f64 b #s(literal 27 binary64)) a (*.f64 #s(literal 2 binary64) x))) |
(sort y z t)
(sort a b)
Compiled 17 to 17 computations (0% saved)
Compiled 0 to 6 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| 96.0% | (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) |
Compiled 34 to 34 computations (0% saved)
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 17 |
| 1 | 29 | 17 |
| 2 | 47 | 17 |
| 3 | 63 | 17 |
| 4 | 75 | 17 |
| 5 | 82 | 17 |
| 6 | 84 | 17 |
| 1× | saturated |
| Inputs |
|---|
(+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) |
| Outputs |
|---|
(+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) |
(+.f64 (*.f64 b (*.f64 #s(literal 27 binary64) a)) (-.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 t (*.f64 z (*.f64 #s(literal 9 binary64) y))))) |
| 1× | fuel |
Compiled 17 to 17 computations (0% saved)
Compiled 280 to 258 computations (7.9% saved)
Loading profile data...