Bouland and Aaronson, Equation (25)
Time bar (total: 715.0ms)
| 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 33 to 20 computations (39.4% saved)
| 23.0ms | 260× | 0 | valid |
ival-mult: 9.0ms (51.4% of total)ival-add: 4.0ms (22.8% of total)ival-sub: 2.0ms (11.4% of total)ival-pow2: 2.0ms (11.4% 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)| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 66 |
| - | 77 | 113 |
| 267.0ms | 3 072× | 0 | valid |
Compiled 1 140 to 696 computations (38.9% saved)
ival-mult: 95.0ms (47.8% of total)ival-add: 44.0ms (22.1% of total)ival-pow2: 27.0ms (13.6% of total)ival-sub: 24.0ms (12.1% of total)exact: 4.0ms (2% of total)ival-true: 3.0ms (1.5% of total)adjust: 1.0ms (0.5% of total)ival-assert: 1.0ms (0.5% of total)| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 47 | 159 |
| 1 | 171 | 157 |
| 2 | 671 | 155 |
| 3 | 2845 | 155 |
| 4 | 6808 | 155 |
| 0 | 19 | 31 |
| 0 | 32 | 31 |
| 1 | 70 | 31 |
| 2 | 188 | 31 |
| 3 | 587 | 31 |
| 4 | 1955 | 31 |
| 5 | 3491 | 31 |
| 0 | 8062 | 26 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(-.f64 (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) #s(literal 1 binary64)) |
| Outputs |
|---|
(-.f64 (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) #s(literal 1 binary64)) |
(fma.f64 (fma.f64 #s(literal 4 binary64) a #s(literal 4 binary64)) (*.f64 a a) (fma.f64 (fma.f64 #s(literal -12 binary64) a #s(literal 4 binary64)) (*.f64 b b) (-.f64 (pow.f64 (fma.f64 b b (*.f64 a a)) #s(literal 2 binary64)) #s(literal 1 binary64)))) |
(abs b)
Compiled 31 to 19 computations (38.7% saved)
Compiled 0 to 2 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| 74.1% | (-.f64 (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) #s(literal 1 binary64)) |
Compiled 62 to 38 computations (38.7% saved)
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 19 | 31 |
| 1 | 37 | 31 |
| 2 | 51 | 31 |
| 3 | 62 | 31 |
| 4 | 79 | 31 |
| 5 | 102 | 31 |
| 6 | 104 | 31 |
| 1× | saturated |
| Inputs |
|---|
(-.f64 (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) #s(literal 1 binary64)) |
| Outputs |
|---|
(-.f64 (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) #s(literal 1 binary64)) |
(-.f64 (+.f64 (*.f64 (+.f64 (*.f64 (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)) (*.f64 b b)) (*.f64 (+.f64 #s(literal 1 binary64) a) (*.f64 a a))) #s(literal 4 binary64)) (pow.f64 (+.f64 (*.f64 b b) (*.f64 a a)) #s(literal 2 binary64))) #s(literal 1 binary64)) |
| 1× | fuel |
Compiled 31 to 19 computations (38.7% saved)
(abs b)
Compiled 248 to 152 computations (38.7% saved)
Loading profile data...