
Time bar (total: 954.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 0 |
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 1 |
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 2 |
| 50% | 50% | 50% | 0.1% | 0% | 0% | 0% | 3 |
| 50% | 50% | 50% | 0.1% | 0% | 0% | 0% | 4 |
| 75% | 74.9% | 25% | 0.1% | 0% | 0% | 0% | 5 |
| 75% | 74.9% | 25% | 0.1% | 0% | 0% | 0% | 6 |
| 87.5% | 87.4% | 12.5% | 0.1% | 0% | 0% | 0% | 7 |
| 87.5% | 87.4% | 12.5% | 0.1% | 0% | 0% | 0% | 8 |
| 93.8% | 93.7% | 6.2% | 0.1% | 0% | 0% | 0% | 9 |
| 93.8% | 93.7% | 6.2% | 0.1% | 0% | 0% | 0% | 10 |
| 96.9% | 96.8% | 3.1% | 0.1% | 0% | 0% | 0% | 11 |
| 96.9% | 96.8% | 3.1% | 0.1% | 0% | 0% | 0% | 12 |
Compiled 7 to 7 computations (0% saved)
| 405.0ms | 8 256× | 0 | valid |
ival-mult!: 167.0ms (77.6% of total)ival-div!: 47.0ms (21.8% of total)adjust: 2.0ms (0.9% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | y |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 0 | 0 | - | 0 | - | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
| 0 | 0 | - | 0 | - | x |
| 0 | 0 | - | 0 | - | (*.f64 y #s(literal 2 binary64)) |
| 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 |
| 37.0ms | 512× | 0 | valid |
Compiled 31 to 19 computations (38.7% saved)
ival-div!: 7.0ms (60.4% of total)ival-mult!: 4.0ms (34.5% of total)adjust: 0.0ms (0% of total)Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 14 | 32 |
| 1 | 34 | 30 |
| 2 | 76 | 30 |
| 3 | 163 | 30 |
| 4 | 383 | 30 |
| 5 | 1577 | 30 |
| 6 | 6399 | 30 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
(negabs x)
(negabs y)
Compiled 10 to 10 computations (0% saved)
| Inputs |
|---|
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
x |
(*.f64 y #s(literal 2 binary64)) |
y |
#s(literal 2 binary64) |
| Outputs |
|---|
#s(approx (/ x (* y 2)) #s(hole binary64 (* 1/2 (/ x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (* y 2) #s(hole binary64 (* 2 y))) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 3.0ms | y | @ | inf | ((/ x (* y 2)) x (* y 2) y 2) |
| 2.0ms | x | @ | -inf | ((/ x (* y 2)) x (* y 2) y 2) |
| 2.0ms | x | @ | inf | ((/ x (* y 2)) x (* y 2) y 2) |
| 2.0ms | y | @ | -inf | ((/ x (* y 2)) x (* y 2) y 2) |
| 1.0ms | y | @ | 0 | ((/ x (* y 2)) x (* y 2) y 2) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 15 | 35 |
| 0 | 16 | 35 |
| 1 | 29 | 35 |
| 0 | 84 | 35 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
x |
(*.f64 y #s(literal 2 binary64)) |
y |
#s(literal 2 binary64) |
#s(approx (/ x (* y 2)) #s(hole binary64 (* 1/2 (/ x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (* y 2) #s(hole binary64 (* 2 y))) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(/.f64 (/.f64 x #s(literal 2 binary64)) y) |
(/.f64 (neg.f64 (/.f64 x y)) #s(literal -2 binary64)) |
(/.f64 (neg.f64 (neg.f64 x)) (neg.f64 (*.f64 #s(literal -2 binary64) y))) |
(/.f64 (neg.f64 x) (*.f64 #s(literal -2 binary64) y)) |
(/.f64 (/.f64 x y) #s(literal 2 binary64)) |
(/.f64 x (*.f64 #s(literal 2 binary64) y)) |
(neg.f64 (/.f64 (neg.f64 x) (*.f64 #s(literal 2 binary64) y))) |
(neg.f64 (/.f64 x (*.f64 #s(literal -2 binary64) y))) |
x |
(*.f64 #s(literal 2 binary64) y) |
(*.f64 y #s(literal 2 binary64)) |
(/.f64 (-.f64 (*.f64 y y) (*.f64 y y)) (-.f64 y y)) |
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y (-.f64 (*.f64 y y) (*.f64 y y)))) |
(fma.f64 #s(literal 1 binary64) y (*.f64 #s(literal 1 binary64) y)) |
(fma.f64 y #s(literal 1 binary64) (*.f64 y #s(literal 1 binary64))) |
(+.f64 (*.f64 #s(literal 1 binary64) y) (*.f64 #s(literal 1 binary64) y)) |
(+.f64 (*.f64 y #s(literal 1 binary64)) (*.f64 y #s(literal 1 binary64))) |
(+.f64 y y) |
y |
#s(literal 2 binary64) |
#s(approx (/ x (* y 2)) (*.f64 (/.f64 x y) #s(literal 1/2 binary64))) |
#s(approx x x) |
#s(approx (* y 2) (*.f64 #s(literal 2 binary64) y)) |
#s(approx y y) |
Compiled 179 to 61 computations (65.9% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 23 | 1 | 24 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 24 | 1 | 25 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (/.f64 x (+.f64 y y)) |
Compiled 5 to 4 computations (20% saved)
| Inputs |
|---|
(/.f64 x (+.f64 y y)) |
x |
(+.f64 y y) |
y |
| Outputs |
|---|
#s(approx (/ x (+ y y)) #s(hole binary64 (* 1/2 (/ x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (+ y y) #s(hole binary64 (* 2 y))) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | -inf | ((/ x (+ y y)) x (+ y y) y) |
| 1.0ms | y | @ | inf | ((/ x (+ y y)) x (+ y y) y) |
| 0.0ms | x | @ | -inf | ((/ x (+ y y)) x (+ y y) y) |
| 0.0ms | x | @ | inf | ((/ x (+ y y)) x (+ y y) y) |
| 0.0ms | y | @ | 0 | ((/ x (+ y y)) x (+ y y) y) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 15 | 34 |
| 0 | 16 | 34 |
| 0 | 37 | 34 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(/.f64 x (+.f64 y y)) |
x |
(+.f64 y y) |
y |
#s(approx (/ x (+ y y)) #s(hole binary64 (* 1/2 (/ x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (+ y y) #s(hole binary64 (* 2 y))) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(/.f64 (neg.f64 x) (neg.f64 (*.f64 #s(literal 2 binary64) y))) |
(/.f64 x (*.f64 #s(literal 2 binary64) y)) |
x |
(*.f64 #s(literal 2 binary64) y) |
(*.f64 y #s(literal 2 binary64)) |
(/.f64 (-.f64 (*.f64 y y) (*.f64 y y)) (-.f64 y y)) |
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y (-.f64 (*.f64 y y) (*.f64 y y)))) |
(+.f64 y y) |
y |
#s(approx (/ x (+ y y)) (*.f64 (/.f64 x y) #s(literal 1/2 binary64))) |
#s(approx x x) |
#s(approx (+ y y) (*.f64 #s(literal 2 binary64) y)) |
#s(approx y y) |
Compiled 116 to 38 computations (67.2% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 15 | 0 | 15 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 15 | 1 | 16 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (/.f64 x (+.f64 y y)) |
Compiled 15 to 11 computations (26.7% saved)
Total 0.0b remaining (0%)
Threshold costs 0b (0%)
| Inputs |
|---|
(/.f64 x (+.f64 y y)) |
(/.f64 x (*.f64 y #s(literal 2 binary64))) |
| Outputs |
|---|
(/.f64 x (+.f64 y y)) |
4 calls:
| 26.0ms | (*.f64 y #s(literal 2 binary64)) |
| 1.0ms | x |
| 1.0ms | y |
| 1.0ms | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (*.f64 y #s(literal 2 binary64)) |
| 100.0% | 1 | (/.f64 x (*.f64 y #s(literal 2 binary64))) |
| 100.0% | 1 | x |
| 100.0% | 1 | y |
Compiled 10 to 13 computations (-30% saved)
| 1× | done |
Compiled 5 to 4 computations (20% saved)
(negabs y)
(negabs x)
Compiled 40 to 34 computations (15% saved)
Loading profile data...