Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, C
Time bar (total: 1.5s)
| 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)
| 19.0ms | 260× | 0 | valid |
ival-mult: 5.0ms (44% of total)ival-div: 3.0ms (26.4% of total)ival-add: 2.0ms (17.6% of total)ival-sub: 1.0ms (8.8% of total)ival-true: 0.0ms (0% of total)adjust: 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 |
|---|---|---|---|---|---|
| 5 | 0 | - | 0 | - | (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) |
| 5 | 0 | - | 0 | - | (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) |
| 0 | 0 | - | 0 | - | a |
| 0 | 0 | - | 0 | - | t |
| 0 | 0 | - | 0 | - | (*.f64 x y) |
| 0 | 0 | - | 0 | - | c |
| 0 | 0 | - | 0 | - | y |
| 0 | 0 | - | 0 | - | #s(literal 16 binary64) |
| 0 | 0 | - | 0 | - | (/.f64 (*.f64 z t) #s(literal 16 binary64)) |
| 0 | 0 | - | 0 | - | (*.f64 z t) |
| 0 | 0 | - | 0 | - | (+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) |
| 0 | 0 | - | 0 | - | z |
| 0 | 0 | - | 0 | - | #s(literal 4 binary64) |
| 0 | 0 | - | 0 | - | (/.f64 (*.f64 a b) #s(literal 4 binary64)) |
| 0 | 0 | - | 0 | - | (*.f64 a b) |
| 0 | 0 | - | 0 | - | b |
| 0 | 0 | - | 0 | - | x |
| Operator | Subexpression | Explanation | Count | |
|---|---|---|---|---|
+.f64 | (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) | nan-rescue | 5 | 0 |
| ↳ | (*.f64 x y) | overflow | 33 | |
| ↳ | (/.f64 (*.f64 z t) #s(literal 16 binary64)) | overflow | 38 | |
| ↳ | (*.f64 z t) | overflow | 38 | |
-.f64 | (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) | nan-rescue | 5 | 0 |
| ↳ | (/.f64 (*.f64 z t) #s(literal 16 binary64)) | overflow | 38 | |
| ↳ | (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) | overflow | 64 | |
| ↳ | (*.f64 x y) | overflow | 33 | |
| ↳ | (*.f64 z t) | overflow | 38 | |
| ↳ | (/.f64 (*.f64 a b) #s(literal 4 binary64)) | overflow | 43 | |
| ↳ | (*.f64 a b) | overflow | 43 |
| Predicted + | Predicted - | |
|---|---|---|
| + | 9 | 0 |
| - | 0 | 247 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 9 | 0 | 0 |
| - | 0 | 0 | 247 |
| number | freq |
|---|---|
| 0 | 247 |
| 1 | 8 |
| 2 | 1 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 1 | 0 | 0 |
| - | 0 | 0 | 0 |
| 265.0ms | 3 072× | 0 | valid |
Compiled 2 712 to 840 computations (69% saved)
ival-mult: 55.0ms (41.6% of total)ival-div: 34.0ms (25.7% of total)ival-add: 24.0ms (18.2% of total)ival-sub: 12.0ms (9.1% of total)exact: 3.0ms (2.3% of total)ival-true: 2.0ms (1.5% of total)adjust: 1.0ms (0.8% of total)ival-assert: 1.0ms (0.8% of total)| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 166 | 614 |
| 1 | 475 | 605 |
| 2 | 1302 | 595 |
| 3 | 3620 | 595 |
| 4 | 6066 | 595 |
| 0 | 17 | 17 |
| 0 | 25 | 17 |
| 1 | 40 | 17 |
| 2 | 85 | 17 |
| 3 | 175 | 17 |
| 4 | 328 | 17 |
| 5 | 647 | 17 |
| 6 | 1078 | 17 |
| 7 | 1661 | 17 |
| 8 | 2024 | 17 |
| 9 | 2114 | 17 |
| 10 | 2151 | 17 |
| 11 | 2151 | 17 |
| 12 | 2151 | 17 |
| 13 | 2152 | 17 |
| 0 | 2152 | 14 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) |
| Outputs |
|---|
(+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) |
(fma.f64 #s(literal 1/16 binary64) (*.f64 t z) (fma.f64 #s(literal -1/4 binary64) (*.f64 b a) (fma.f64 y x c))) |
(sort x y)
(sort z t)
(sort a b)
Compiled 17 to 17 computations (0% saved)
Compiled 0 to 7 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| 96.5% | (+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) |
Compiled 34 to 34 computations (0% saved)
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 17 |
| 1 | 24 | 17 |
| 2 | 33 | 17 |
| 3 | 45 | 17 |
| 4 | 54 | 17 |
| 5 | 60 | 17 |
| 6 | 62 | 17 |
| 1× | saturated |
| Inputs |
|---|
(+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) |
| Outputs |
|---|
(+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) |
(+.f64 c (-.f64 (+.f64 (/.f64 (*.f64 t z) #s(literal 16 binary64)) (*.f64 y x)) (/.f64 (*.f64 b a) #s(literal 4 binary64)))) |
| 1× | fuel |
Compiled 17 to 17 computations (0% saved)
(sort a b)
(sort z t)
(sort x y)
Compiled 272 to 272 computations (0% saved)
Loading profile data...