
Time bar (total: 4.1s)
| 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)
| 856.0ms | 8256× | 0 | valid-rival |
| 593.0ms | 8255× | 0 | valid-sollya |
| 5.0ms | 1× | 0 | exit-sollya |
| 1× | egg-herbie |
| 68× | fma-neg |
| 24× | sub-neg |
| 22× | fma-define |
| 14× | *-commutative |
| 13× | distribute-lft-neg-in |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 25 | 177 |
| 1 | 52 | 161 |
| 2 | 98 | 161 |
| 3 | 189 | 161 |
| 4 | 266 | 161 |
| 5 | 318 | 161 |
| 6 | 346 | 161 |
| 7 | 358 | 161 |
| 8 | 359 | 161 |
| 1× | saturated |
| Inputs |
|---|
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 a (neg.f64 b))) #s(literal 2 binary64)) |
(neg.f64 (/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal 2 binary64))) |
(neg.f64 (/.f64 (fabs.f64 (-.f64 a (neg.f64 b))) #s(literal 2 binary64))) |
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64)) |
| Outputs |
|---|
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64)) |
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64)) |
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64)) |
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64)) |
(/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (+.f64 a b)) #s(literal 2 binary64)) |
(*.f64 (fabs.f64 (+.f64 a b)) #s(literal 1/2 binary64)) |
(/.f64 (fabs.f64 (-.f64 a (neg.f64 b))) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (+.f64 a b)) #s(literal 2 binary64)) |
(*.f64 (fabs.f64 (+.f64 a b)) #s(literal 1/2 binary64)) |
(neg.f64 (/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal 2 binary64))) |
(/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal -2 binary64)) |
(/.f64 (fabs.f64 (+.f64 a b)) #s(literal -2 binary64)) |
(*.f64 (fabs.f64 (+.f64 a b)) #s(literal -1/2 binary64)) |
(neg.f64 (/.f64 (fabs.f64 (-.f64 a (neg.f64 b))) #s(literal 2 binary64))) |
(/.f64 (fabs.f64 (-.f64 (neg.f64 a) b)) #s(literal -2 binary64)) |
(/.f64 (fabs.f64 (+.f64 a b)) #s(literal -2 binary64)) |
(*.f64 (fabs.f64 (+.f64 a b)) #s(literal -1/2 binary64)) |
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64)) |
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64)) |
(sort a b)
Compiled 8 to 6 computations (25% saved)
Compiled 2 to 2 computations (0% saved)
| Status | Accuracy | Program |
|---|---|---|
| 100.0% | (/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
Compiled 16 to 12 computations (25% saved)
| 1× | egg-herbie |
| 4× | sub-neg |
| 4× | +-commutative |
| 2× | *-commutative |
| 2× | neg-sub0 |
| 2× | neg-mul-1 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 12 | 23 |
| 1 | 16 | 23 |
| 2 | 23 | 23 |
| 3 | 28 | 23 |
| 4 | 31 | 23 |
| 5 | 32 | 23 |
| 1× | saturated |
| Inputs |
|---|
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
| Outputs |
|---|
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64)) |
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64)) |
| 1× | fuel |
Compiled 8 to 6 computations (25% saved)
(sort a b)
Compiled 64 to 48 computations (25% saved)
Loading profile data...