FastMath test1
Time bar (total: 534.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 9 to 8 computations (11.1% saved)
| 293.0ms | 8 256× | 0 | valid |
ival-mult!: 76.0ms (75.7% of total)ival-add!: 23.0ms (22.9% of total)adjust: 1.0ms (1% of total)Useful iterations: 2 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 11 | 10 |
| 1 | 33 | 10 |
| 2 | 86 | 9 |
| 3 | 98 | 9 |
| 1× | saturated |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.6% | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
(negabs d)
Compiled 14 to 12 computations (14.3% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 27 |
| 1× | iter-limit |
| Inputs |
|---|
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
(*.f64 d #s(literal 10 binary64)) |
d |
#s(literal 10 binary64) |
(*.f64 d #s(literal 20 binary64)) |
#s(literal 20 binary64) |
| Outputs |
|---|
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d)) |
#s(approx (* d 10) (*.f64 #s(literal 10 binary64) d)) |
#s(approx d d) |
#s(approx (* d 20) (*.f64 #s(literal 20 binary64) d)) |
3 calls:
| Time | Variable | Point |
|---|---|---|
| 1.0ms | d | -inf |
| 1.0ms | d | inf |
| 1.0ms | d | 0 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 16 |
| 0 | 9 | 12 |
| 1 | 20 | 12 |
| 2 | 48 | 12 |
| 3 | 87 | 12 |
| 4 | 112 | 12 |
| 5 | 114 | 12 |
| 0 | 114 | 12 |
| 1× | iter-limit |
| 1× | saturated |
| 1× | iter-limit |
| Inputs |
|---|
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
(*.f64 d #s(literal 10 binary64)) |
d |
#s(literal 10 binary64) |
(*.f64 d #s(literal 20 binary64)) |
#s(literal 20 binary64) |
| Outputs |
|---|
(*.f64 #s(literal -30 binary64) (neg.f64 d)) |
(*.f64 #s(literal 30 binary64) d) |
(*.f64 (neg.f64 d) #s(literal -30 binary64)) |
(*.f64 d #s(literal 30 binary64)) |
(neg.f64 (*.f64 #s(literal -30 binary64) d)) |
(fma.f64 #s(literal -10 binary64) (neg.f64 d) (*.f64 #s(literal 20 binary64) d)) |
(fma.f64 #s(literal -20 binary64) (neg.f64 d) (*.f64 #s(literal 10 binary64) d)) |
(fma.f64 (neg.f64 d) #s(literal -10 binary64) (*.f64 #s(literal 20 binary64) d)) |
(fma.f64 (neg.f64 d) #s(literal -20 binary64) (*.f64 #s(literal 10 binary64) d)) |
(fma.f64 #s(literal 20 binary64) d (*.f64 #s(literal 10 binary64) d)) |
(fma.f64 #s(literal 10 binary64) d (*.f64 #s(literal 20 binary64) d)) |
(fma.f64 d #s(literal 20 binary64) (*.f64 #s(literal 10 binary64) d)) |
(fma.f64 d #s(literal 10 binary64) (*.f64 #s(literal 20 binary64) d)) |
(-.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal -10 binary64) d)) |
(-.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal -20 binary64) d)) |
(+.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 10 binary64) d)) |
(+.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 20 binary64) d)) |
(*.f64 #s(literal -10 binary64) (neg.f64 d)) |
(*.f64 (neg.f64 d) #s(literal -10 binary64)) |
(*.f64 #s(literal 10 binary64) d) |
(*.f64 d #s(literal 10 binary64)) |
(neg.f64 (*.f64 #s(literal -10 binary64) d)) |
d |
#s(literal 10 binary64) |
(*.f64 #s(literal -20 binary64) (neg.f64 d)) |
(*.f64 (neg.f64 d) #s(literal -20 binary64)) |
(*.f64 #s(literal 20 binary64) d) |
(*.f64 d #s(literal 20 binary64)) |
(neg.f64 (*.f64 #s(literal -20 binary64) d)) |
#s(literal 20 binary64) |
Compiled 204 to 60 computations (70.6% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 28 | 1 | 29 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 29 | 1 | 30 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 d #s(literal 30 binary64)) |
Compiled 3 to 3 computations (0% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 10 |
| 1× | iter-limit |
| Inputs |
|---|
(*.f64 d #s(literal 30 binary64)) |
d |
#s(literal 30 binary64) |
| Outputs |
|---|
#s(approx (* d 30) (*.f64 #s(literal 30 binary64) d)) |
#s(approx d d) |
3 calls:
| Time | Variable | Point |
|---|---|---|
| 0.0ms | d | inf |
| 0.0ms | d | -inf |
| 0.0ms | d | 0 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 5 |
| 0 | 4 | 5 |
| 1 | 5 | 5 |
| 0 | 5 | 5 |
| 1× | iter-limit |
| 1× | saturated |
| 1× | iter-limit |
| Inputs |
|---|
(*.f64 d #s(literal 30 binary64)) |
d |
#s(literal 30 binary64) |
| Outputs |
|---|
(*.f64 #s(literal 30 binary64) d) |
(*.f64 d #s(literal 30 binary64)) |
d |
#s(literal 30 binary64) |
Compiled 15 to 8 computations (46.7% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 3 | 0 | 3 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 3 | 1 | 4 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 d #s(literal 30 binary64)) |
Compiled 3 to 3 computations (0% saved)
Total -0.3b remaining (-∞%)
Threshold costs -0.3b (-∞%)
| Inputs |
|---|
(*.f64 d #s(literal 30 binary64)) |
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| Outputs |
|---|
(*.f64 d #s(literal 30 binary64)) |
2 calls:
| 1.0ms | d |
| 1.0ms | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64))) |
| 100.0% | 1 | d |
Compiled 18 to 15 computations (16.7% saved)
| 1× | done |
Compiled 3 to 3 computations (0% saved)
(negabs d)
Compiled 19 to 18 computations (5.3% saved)
Loading profile data...