
Time bar (total: 1.2s)
| 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 5 computations (28.6% saved)
| 534.0ms | 8 256× | 0 | valid |
ival-mult: 278.0ms (95.9% of total)ival-true: 6.0ms (2.1% of total)ival-assert: 3.0ms (1% of total)adjust: 2.0ms (0.7% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (*.f64 (*.f64 x x) x) |
| 0 | 0 | - | 0 | - | (*.f64 x x) |
| 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 |
| 17.0ms | 512× | 0 | valid |
Compiled 27 to 13 computations (51.9% saved)
ival-mult: 7.0ms (92.3% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 13 |
| 1 | 20 | 9 |
| 2 | 55 | 7 |
| 3 | 94 | 7 |
| 4 | 114 | 7 |
| 0 | 3 | 5 |
| 0 | 5 | 5 |
| 1 | 10 | 3 |
| 2 | 31 | 3 |
| 3 | 65 | 3 |
| 4 | 99 | 3 |
| 5 | 106 | 3 |
| 0 | 106 | 3 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(*.f64 (*.f64 x x) x) |
| Outputs |
|---|
(*.f64 (*.f64 x x) x) |
(pow.f64 x #s(literal 3 binary64)) |
(negabs x)
Compiled 5 to 3 computations (40% saved)
Compiled 0 to 1 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.8% | (*.f64 (*.f64 x x) x) |
Compiled 5 to 3 computations (40% saved)
| Inputs |
|---|
(*.f64 (*.f64 x x) x) |
(*.f64 x x) |
x |
| Outputs |
|---|
(pow x 3) |
(pow x 2) |
x |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 5.0ms | x | @ | -inf | ((* (* x x) x) (* x x) x) |
| 1.0ms | x | @ | inf | ((* (* x x) x) (* x x) x) |
| 1.0ms | x | @ | 0 | ((* (* x x) x) (* x x) x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 7 |
| 1 | 10 | 7 |
| 2 | 20 | 7 |
| 3 | 46 | 7 |
| 4 | 107 | 7 |
| 5 | 254 | 7 |
| 6 | 1222 | 7 |
| 7 | 3980 | 7 |
| 0 | 8016 | 7 |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(pow x 3) |
(pow x 2) |
x |
| Outputs |
|---|
(pow x 3) |
(pow.f64 x #s(literal 3 binary64)) |
(pow x 2) |
(*.f64 x x) |
x |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 9 |
| 0 | 5 | 7 |
| 1 | 14 | 7 |
| 2 | 50 | 7 |
| 0 | 205 | 7 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 (*.f64 x x) x) |
(*.f64 x x) |
x |
| Outputs |
|---|
(*.f64 (neg.f64 (pow.f64 x #s(literal 3/2 binary64))) (neg.f64 (pow.f64 x #s(literal 3/2 binary64)))) |
(*.f64 (fabs.f64 (pow.f64 x #s(literal 3/2 binary64))) (fabs.f64 (pow.f64 x #s(literal 3/2 binary64)))) |
(*.f64 (*.f64 x x) (neg.f64 x)) |
(*.f64 (*.f64 x x) x) |
(*.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64))) |
(*.f64 (neg.f64 x) (*.f64 x x)) |
(*.f64 x (*.f64 x x)) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 3 binary64)) |
(pow.f64 (*.f64 x x) #s(literal 3/2 binary64)) |
(pow.f64 (pow.f64 x #s(literal 3/2 binary64)) #s(literal 2 binary64)) |
(pow.f64 x #s(literal 3 binary64)) |
(neg.f64 (pow.f64 x #s(literal 3 binary64))) |
(exp.f64 (*.f64 (log.f64 x) #s(literal 3 binary64))) |
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 3 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 3 binary64)))) |
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x))) |
(*.f64 (neg.f64 x) (neg.f64 x)) |
(*.f64 (neg.f64 x) x) |
(*.f64 x (neg.f64 x)) |
(*.f64 x x) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64)) |
(pow.f64 (*.f64 x x) #s(literal 1 binary64)) |
(pow.f64 (neg.f64 x) #s(literal 2 binary64)) |
(pow.f64 x #s(literal 2 binary64)) |
(neg.f64 (*.f64 x x)) |
(sqrt.f64 (*.f64 (*.f64 x x) (*.f64 x x))) |
(fabs.f64 (*.f64 x x)) |
(exp.f64 (*.f64 (log.f64 (neg.f64 x)) #s(literal 2 binary64))) |
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) |
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))) |
x |
Compiled 226 to 68 computations (69.9% saved)
2 alts after pruning (1 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 33 | 1 | 34 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 33 | 2 | 35 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (pow.f64 x #s(literal 3 binary64)) |
| ✓ | 99.8% | (*.f64 (*.f64 x x) x) |
Compiled 8 to 6 computations (25% saved)
| Inputs |
|---|
(pow.f64 x #s(literal 3 binary64)) |
x |
#s(literal 3 binary64) |
| Outputs |
|---|
(pow x 3) |
x |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((pow x 3) x 3) |
| 1.0ms | x | @ | inf | ((pow x 3) x 3) |
| 0.0ms | x | @ | 0 | ((pow x 3) x 3) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 4 |
| 1 | 6 | 4 |
| 2 | 10 | 4 |
| 3 | 29 | 4 |
| 4 | 62 | 4 |
| 5 | 96 | 4 |
| 6 | 103 | 4 |
| 0 | 103 | 4 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(pow x 3) |
x |
| Outputs |
|---|
(pow x 3) |
(pow.f64 x #s(literal 3 binary64)) |
x |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 5 |
| 0 | 4 | 5 |
| 1 | 15 | 5 |
| 0 | 47 | 5 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(pow.f64 x #s(literal 3 binary64)) |
x |
#s(literal 3 binary64) |
| Outputs |
|---|
(*.f64 (neg.f64 (pow.f64 x #s(literal 3/2 binary64))) (neg.f64 (pow.f64 x #s(literal 3/2 binary64)))) |
(*.f64 (fabs.f64 (pow.f64 x #s(literal 3/2 binary64))) (fabs.f64 (pow.f64 x #s(literal 3/2 binary64)))) |
(*.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64))) |
(*.f64 (*.f64 x x) x) |
(*.f64 x (*.f64 x x)) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 3 binary64)) |
(pow.f64 (pow.f64 x #s(literal 3/2 binary64)) #s(literal 2 binary64)) |
(pow.f64 (*.f64 x x) #s(literal 3/2 binary64)) |
(pow.f64 x #s(literal 3 binary64)) |
(exp.f64 (*.f64 (log.f64 x) #s(literal 3 binary64))) |
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 3 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 3 binary64)))) |
x |
#s(literal 3 binary64) |
Compiled 82 to 27 computations (67.1% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 14 | 0 | 14 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 14 | 2 | 16 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (pow.f64 x #s(literal 3 binary64)) |
| ✓ | 99.8% | (*.f64 (*.f64 x x) x) |
Compiled 16 to 11 computations (31.3% saved)
| Inputs |
|---|
(*.f64 (*.f64 x x) x) |
(pow.f64 x #s(literal 3 binary64)) |
| Outputs |
|---|
(pow.f64 x #s(literal 3 binary64)) |
2 calls:
| 64.0ms | x |
| 1.0ms | (*.f64 (*.f64 x x) x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (*.f64 (*.f64 x x) x) |
| 100.0% | 1 | x |
Compiled 6 to 4 computations (33.3% saved)
Total 0.0b remaining (0%)
Threshold costs 0b (0%)
| Inputs |
|---|
(*.f64 (*.f64 x x) x) |
| Outputs |
|---|
(*.f64 (*.f64 x x) x) |
2 calls:
| 1.0ms | x |
| 1.0ms | (*.f64 (*.f64 x x) x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 99.8% | 1 | (*.f64 (*.f64 x x) x) |
| 99.8% | 1 | x |
Compiled 6 to 4 computations (33.3% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 8 |
| 1× | saturated |
| Inputs |
|---|
(pow.f64 x #s(literal 3 binary64)) |
(*.f64 (*.f64 x x) x) |
| Outputs |
|---|
(pow.f64 x #s(literal 3 binary64)) |
(*.f64 (*.f64 x x) x) |
| 1× | done |
Compiled 8 to 5 computations (37.5% saved)
(negabs x)
Compiled 44 to 34 computations (22.7% saved)
Loading profile data...