neg log
Time bar (total: 1.9s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 0 |
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 1 |
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 2 |
| 0% | 0% | 50% | 0% | 0% | 50% | 0% | 3 |
| 33.3% | 12.5% | 25% | 0% | 0% | 62.5% | 0% | 4 |
| 60% | 18.7% | 12.5% | 0% | 0% | 68.7% | 0% | 5 |
| 77.8% | 21.9% | 6.2% | 0% | 0% | 71.8% | 0% | 6 |
| 88.2% | 23.4% | 3.1% | 0% | 0% | 73.4% | 0% | 7 |
| 93.9% | 24.2% | 1.6% | 0% | 0% | 74.2% | 0% | 8 |
| 96.9% | 24.6% | 0.8% | 0% | 0% | 74.6% | 0% | 9 |
| 98.4% | 24.8% | 0.4% | 0% | 0% | 74.8% | 0% | 10 |
| 99.2% | 24.9% | 0.2% | 0% | 0% | 74.9% | 0% | 11 |
| 99.6% | 24.9% | 0.1% | 0% | 0% | 74.9% | 0% | 12 |
Compiled 18 to 15 computations (16.7% saved)
| 387.0ms | 8 256× | 0 | valid-baseline |
| 380.0ms | 8 256× | 0 | valid-rival |
| 312.0ms | 8 256× | 0 | valid-sollya |
| 0ms | 16× | 0 | sollya-faithful-roduning |
| 0ms | 8 240× | 0 | sollya-correct-roduning |
| 1× | egg-herbie |
| 18× | sub-neg |
| 16× | fma-define |
| 11× | +-commutative |
| 7× | associate-+l- |
| 6× | neg-mul-1 |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 100 |
| 1 | 35 | 92 |
| 2 | 56 | 92 |
| 3 | 82 | 92 |
| 4 | 111 | 92 |
| 5 | 125 | 92 |
| 6 | 137 | 92 |
| 7 | 148 | 92 |
| 8 | 152 | 92 |
| 1× | saturated |
| Inputs |
|---|
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal 1 binary64)))) |
(neg.f64 (neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal 1 binary64))))) |
| Outputs |
|---|
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
(neg.f64 (log.f64 (+.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))) |
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
(neg.f64 (log.f64 (+.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))) |
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal 1 binary64)))) |
(neg.f64 (log.f64 (+.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal -1 binary64)))) |
(neg.f64 (log.f64 (+.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64)))) |
(neg.f64 (neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal 1 binary64))))) |
(log.f64 (+.f64 (/.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal -1 binary64))) |
(log.f64 (+.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64))) |
Compiled 8 to 6 computations (25% saved)
Compiled 1 to 1 computations (0% saved)
| Status | Accuracy | Program |
|---|---|---|
| 100.0% | (neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
Compiled 16 to 12 computations (25% saved)
| 1× | egg-herbie |
| 5× | neg-mul-1 |
| 4× | unsub-neg |
| 3× | sub-neg |
| 3× | 1-exp |
| 3× | *-commutative |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 11 | 24 |
| 1 | 21 | 24 |
| 2 | 26 | 24 |
| 3 | 32 | 24 |
| 4 | 39 | 24 |
| 5 | 48 | 24 |
| 1× | saturated |
| Inputs |
|---|
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
| Outputs |
|---|
(neg.f64 (log.f64 (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 1 binary64)))) |
(neg.f64 (log.f64 (+.f64 (/.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))) |
| 1× | fuel |
Compiled 8 to 7 computations (12.5% saved)
Compiled 32 to 26 computations (18.8% saved)
Loading profile data...