Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A
Time bar (total: 2.7s)
| 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)
| 279.0ms | 8 256× | 0 | valid |
ival-mult: 134.0ms (91.1% of total)ival-true: 5.0ms (3.4% of total)exact: 4.0ms (2.7% of total)ival-assert: 3.0ms (2% 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 |
| 18.0ms | 512× | 0 | valid |
Compiled 30 to 16 computations (46.7% saved)
ival-mult: 7.0ms (93.7% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| 1× | egg-herbie |
| 46× | distribute-lft-neg-in |
| 38× | associate-*r* |
| 32× | distribute-lft-in |
| 24× | cancel-sign-sub-inv |
| 24× | distribute-rgt-neg-in |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 15 |
| 1 | 23 | 10 |
| 2 | 63 | 10 |
| 3 | 164 | 10 |
| 4 | 216 | 10 |
| 5 | 228 | 10 |
| 0 | 4 | 5 |
| 0 | 6 | 5 |
| 1 | 9 | 5 |
| 2 | 12 | 5 |
| 0 | 12 | 5 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x (*.f64 x #s(literal 2 binary64))) |
(abs x)
Compiled 6 to 4 computations (33.3% saved)
Compiled 1 to 1 computations (0% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
Compiled 6 to 4 computations (33.3% saved)
| 1× | egg-herbie |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (*.f64 x #s(literal 2 binary64)) | |
| cost-diff | 0 | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| 14× | lower-*.f32 |
| 10× | lower-*.f64 |
| 4× | *-commutative |
| 4× | lift-*.f64 |
| 4× | associate-*l* |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 10 |
| 0 | 6 | 10 |
| 1 | 9 | 10 |
| 2 | 12 | 10 |
| 0 | 12 | 10 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x #s(literal 2 binary64)) |
x |
#s(literal 2 binary64) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x (*.f64 x #s(literal 2 binary64))) |
(*.f64 x #s(literal 2 binary64)) |
x |
#s(literal 2 binary64) |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0 | (*.f64 (*.f64 x #s(literal 2 binary64)) x) | |
| accuracy | 0 | (*.f64 x #s(literal 2 binary64)) |
| 8.0ms | 256× | 0 | valid |
Compiled 12 to 6 computations (50% saved)
ival-mult: 3.0ms (86% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ()) |
#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ()) |
| Outputs |
|---|
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor 0 x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 (pow x 2)) (taylor -inf x) (#s(alt (*.f64 (*.f64 x #s(literal 2 binary64)) x) (patch (*.f64 (*.f64 x #s(literal 2 binary64)) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 x #s(literal 2 binary64)) (patch (*.f64 x #s(literal 2 binary64)) #<representation binary64>) () ())) ()) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | 0 | (* (* x 2) x) |
| 0.0ms | x | @ | 0 | (* x 2) |
| 0.0ms | x | @ | inf | (* (* x 2) x) |
| 0.0ms | x | @ | -inf | (* x 2) |
| 0.0ms | x | @ | inf | (* x 2) |
| 1× | egg-herbie |
| 14× | lower-*.f64 |
| 14× | lower-*.f32 |
| 4× | *-commutative |
| 2× | lower-pow.f64 |
| 2× | associate-*r* |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 96 |
| 1 | 8 | 96 |
| 2 | 10 | 96 |
| 0 | 10 | 96 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 (pow x 2)) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
| Outputs |
|---|
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 (pow x 2)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
| 2 136× | lower-pow.f64 |
| 2 136× | lower-pow.f32 |
| 1 588× | lower-*.f64 |
| 1 588× | lower-*.f32 |
| 1 412× | prod-exp |
Useful iterations: 7 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 8 |
| 0 | 6 | 10 |
| 1 | 9 | 10 |
| 2 | 12 | 10 |
| 3 | 13 | 10 |
| 4 | 20 | 10 |
| 5 | 36 | 10 |
| 6 | 92 | 10 |
| 7 | 279 | 2 |
| 8 | 1686 | 2 |
| 9 | 1711 | 2 |
| 10 | 1834 | 2 |
| 11 | 3049 | 2 |
| 0 | 8392 | 2 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x #s(literal 2 binary64)) |
| Outputs |
|---|
#s(literal 2 binary64) |
#s(literal 2 binary64) |
Compiled 149 to 6 computations (96% saved)
3 alts after pruning (2 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 24 | 2 | 26 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 24 | 3 | 27 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| ▶ | 7.1% | (*.f64 #s(literal 2 binary64) x) |
| ▶ | 4.2% | #s(literal 2 binary64) |
Compiled 12 to 9 computations (25% saved)
| 1× | egg-herbie |
Found 1 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (*.f64 #s(literal 2 binary64) x) |
| 4× | lower-*.f32 |
| 2× | *-commutative |
| 2× | lower-*.f64 |
| 2× | lift-*.f64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 6 |
| 0 | 4 | 6 |
| 1 | 5 | 6 |
| 0 | 5 | 6 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
#s(literal 2 binary64) |
(*.f64 #s(literal 2 binary64) x) |
#s(literal 2 binary64) |
x |
| Outputs |
|---|
#s(literal 2 binary64) |
(*.f64 #s(literal 2 binary64) x) |
#s(literal 2 binary64) |
x |
Found 1 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0 | (*.f64 #s(literal 2 binary64) x) |
| 6.0ms | 256× | 0 | valid |
Compiled 8 to 5 computations (37.5% saved)
ival-mult: 2.0ms (94.4% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ()) |
| Outputs |
|---|
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor 0 x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
#s(alt (* 2 x) (taylor -inf x) (#s(alt (*.f64 #s(literal 2 binary64) x) (patch (*.f64 #s(literal 2 binary64) x) #<representation binary64>) () ())) ()) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | inf | (* 2 x) |
| 0.0ms | x | @ | -inf | (* 2 x) |
| 0.0ms | x | @ | 0 | (* 2 x) |
| 1× | egg-herbie |
| 4× | lower-*.f64 |
| 4× | lower-*.f32 |
| 2× | *-commutative |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 36 |
| 1 | 4 | 36 |
| 0 | 4 | 36 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
(* 2 x) |
| Outputs |
|---|
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
(* 2 x) |
(*.f64 #s(literal 2 binary64) x) |
| 4× | lower-*.f32 |
| 2× | lower-*.f64 |
| 2× | *-commutative |
| 2× | lift-*.f64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 3 |
| 0 | 4 | 3 |
| 1 | 5 | 3 |
| 0 | 5 | 3 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 #s(literal 2 binary64) x) |
| Outputs |
|---|
(*.f64 #s(literal 2 binary64) x) |
(*.f64 x #s(literal 2 binary64)) |
Compiled 55 to 4 computations (92.7% saved)
3 alts after pruning (0 fresh and 3 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 14 | 0 | 14 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 2 | 2 |
| Done | 0 | 1 | 1 |
| Total | 14 | 3 | 17 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| ✓ | 7.1% | (*.f64 #s(literal 2 binary64) x) |
| ✓ | 4.2% | #s(literal 2 binary64) |
Compiled 22 to 14 computations (36.4% saved)
| Inputs |
|---|
#s(literal 2 binary64) |
(*.f64 #s(literal 2 binary64) x) |
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
2 calls:
| 2.0ms | x |
| 2.0ms | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | x |
| 100.0% | 1 | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
Compiled 8 to 5 computations (37.5% saved)
| Inputs |
|---|
#s(literal 2 binary64) |
(*.f64 #s(literal 2 binary64) x) |
| Outputs |
|---|
(*.f64 #s(literal 2 binary64) x) |
2 calls:
| 2.0ms | x |
| 1.0ms | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 7.1% | 1 | x |
| 7.1% | 1 | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
Compiled 8 to 5 computations (37.5% saved)
Total -0.0b remaining (-0%)
Threshold costs -0b (-0%)
| Inputs |
|---|
#s(literal 2 binary64) |
| Outputs |
|---|
#s(literal 2 binary64) |
2 calls:
| 1.0ms | x |
| 1.0ms | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 4.2% | 1 | x |
| 4.2% | 1 | (*.f64 (*.f64 x #s(literal 2 binary64)) x) |
Compiled 8 to 5 computations (37.5% saved)
| 1× | egg-herbie |
| 4× | *-commutative_binary64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 9 |
| 1 | 6 | 9 |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 #s(literal 2 binary64) x) |
#s(literal 2 binary64) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) x) |
(*.f64 x (*.f64 x #s(literal 2 binary64))) |
(*.f64 #s(literal 2 binary64) x) |
(*.f64 x #s(literal 2 binary64)) |
#s(literal 2 binary64) |
| 2 136× | lower-pow.f64 |
| 2 136× | lower-pow.f32 |
| 1 588× | lower-*.f64 |
| 1 588× | lower-*.f32 |
| 1 412× | prod-exp |
Useful iterations: 7 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 8 |
| 0 | 6 | 10 |
| 1 | 9 | 10 |
| 2 | 12 | 10 |
| 3 | 13 | 10 |
| 4 | 20 | 10 |
| 5 | 36 | 10 |
| 6 | 92 | 10 |
| 7 | 279 | 2 |
| 8 | 1686 | 2 |
| 9 | 1711 | 2 |
| 10 | 1834 | 2 |
| 11 | 3049 | 2 |
| 0 | 8392 | 2 |
| 1× | done |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
Compiled 22 to 12 computations (45.5% saved)
(abs x)
Compiled 80 to 48 computations (40% saved)
Loading profile data...