Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A
Time bar (total: 970.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 0 |
| 100% | 100% | 0% | 0% | 0% | 0% | 0% | 1 |
Compiled 7 to 6 computations (14.3% saved)
| 313.0ms | 8 256× | 0 | valid |
ival-mult: 145.0ms (93.1% of total)exact: 6.0ms (3.9% of total)ival-assert: 3.0ms (1.9% of total)adjust: 2.0ms (1.3% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| 0 | 0 | - | 0 | - | (*.f64 x #s(literal 2 binary64)) |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 0 | 0 | - | 0 | - | x |
| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 0 |
| - | 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 256 |
| number | freq |
|---|---|
| 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 1 |
| 51.0ms | 512× | 0 | valid |
Compiled 29 to 16 computations (44.8% saved)
ival-mult: 40.0ms (96.7% 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)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 18 |
| 1 | 23 | 15 |
| 2 | 64 | 15 |
| 3 | 160 | 15 |
| 4 | 266 | 15 |
| 5 | 1046 | 15 |
| 6 | 4662 | 15 |
| 0 | 4 | 5 |
| 0 | 6 | 5 |
| 1 | 11 | 5 |
| 2 | 22 | 5 |
| 3 | 58 | 5 |
| 4 | 146 | 5 |
| 5 | 651 | 5 |
| 6 | 4384 | 5 |
| 0 | 8013 | 5 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 (*.f64 #s(literal 2 binary64) x) x) |
(abs x)
Compiled 5 to 4 computations (20% saved)
Compiled 0 to 1 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
Compiled 5 to 4 computations (20% saved)
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x #s(literal 2 binary64)) |
x |
#s(literal 2 binary64) |
| Outputs |
|---|
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (* x 2) #s(hole binary64 (* 2 x))) |
#s(approx x #s(hole binary64 x)) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((* (* x 2) x) (* x 2) x 2) |
| 1.0ms | x | @ | inf | ((* (* x 2) x) (* x 2) x 2) |
| 1.0ms | x | @ | 0 | ((* (* x 2) x) (* x 2) x 2) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 12 | 31 |
| 0 | 14 | 31 |
| 1 | 29 | 31 |
| 0 | 99 | 31 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x #s(literal 2 binary64)) |
x |
#s(literal 2 binary64) |
#s(approx (* (* x 2) x) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (* x 2) #s(hole binary64 (* 2 x))) |
#s(approx x #s(hole binary64 x)) |
| Outputs |
|---|
(*.f64 (*.f64 x x) #s(literal 2 binary64)) |
(*.f64 (*.f64 #s(literal 2 binary64) x) x) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(*.f64 x (*.f64 #s(literal 2 binary64) x)) |
(/.f64 (-.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (*.f64 (*.f64 x x) (*.f64 x x))) (-.f64 (*.f64 x x) (*.f64 x x))) |
(/.f64 (+.f64 (pow.f64 (*.f64 x x) #s(literal 3 binary64)) (pow.f64 (*.f64 x x) #s(literal 3 binary64))) (+.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (-.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (*.f64 (*.f64 x x) (*.f64 x x))))) |
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x)) |
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x)) |
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (*.f64 x x)) |
(fma.f64 #s(literal 1 binary64) (*.f64 x x) (*.f64 #s(literal 1 binary64) (*.f64 x x))) |
(fma.f64 (*.f64 x x) #s(literal 1 binary64) (*.f64 (*.f64 x x) #s(literal 1 binary64))) |
(fma.f64 x x (*.f64 x x)) |
(-.f64 (*.f64 x x) (*.f64 (neg.f64 x) x)) |
(+.f64 (*.f64 #s(literal 1 binary64) (*.f64 x x)) (*.f64 #s(literal 1 binary64) (*.f64 x x))) |
(+.f64 (*.f64 (*.f64 x x) #s(literal 1 binary64)) (*.f64 (*.f64 x x) #s(literal 1 binary64))) |
(+.f64 (*.f64 x x) (*.f64 x x)) |
(*.f64 #s(literal 2 binary64) x) |
(*.f64 x #s(literal 2 binary64)) |
(/.f64 (-.f64 (*.f64 x x) (*.f64 x x)) (-.f64 x x)) |
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (neg.f64 x) (neg.f64 x) (-.f64 (*.f64 x x) (*.f64 x x)))) |
(fma.f64 #s(literal 1 binary64) x (*.f64 #s(literal 1 binary64) x)) |
(fma.f64 x #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64))) |
(+.f64 (*.f64 #s(literal 1 binary64) x) (*.f64 #s(literal 1 binary64) x)) |
(+.f64 (*.f64 x #s(literal 1 binary64)) (*.f64 x #s(literal 1 binary64))) |
(+.f64 x x) |
x |
#s(literal 2 binary64) |
#s(approx (* (* x 2) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x)) |
#s(approx (* x 2) (*.f64 #s(literal 2 binary64) x)) |
#s(approx x x) |
Compiled 300 to 67 computations (77.7% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 32 | 0 | 32 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 32 | 1 | 33 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
Compiled 10 to 8 computations (20% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 5 |
| 1 | 6 | 5 |
| 2 | 9 | 5 |
| 3 | 15 | 5 |
| 4 | 47 | 5 |
| 5 | 368 | 5 |
| 6 | 3459 | 5 |
| 1× | node limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| 1× | done |
Compiled 5 to 4 computations (20% saved)
(abs x)
Compiled 40 to 32 computations (20% saved)
Loading profile data...