Numeric.Interval.Internal:scale from intervals-0.7.1, B
Time bar (total: 874.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 99.9% | 0.1% | 0% | 0% | 0% | 0 |
| 100% | 99.9% | 0% | 0.1% | 0% | 0% | 0% | 1 |
Compiled 7 to 7 computations (0% saved)
| 397.0ms | 8 256× | 0 | valid |
ival-mult!: 128.0ms (68.6% of total)ival-div!: 57.0ms (30.5% of total)adjust: 2.0ms (1.1% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | y |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 0 | 0 | - | 0 | - | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 0 | 0 | - | 0 | - | (*.f64 x y) |
| 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 |
| 50.0ms | 512× | 0 | valid |
Compiled 31 to 19 computations (38.7% saved)
ival-div!: 32.0ms (89.9% of total)ival-mult!: 3.0ms (8.4% of total)adjust: 0.0ms (0% of total)Useful iterations: 2 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 15 | 32 |
| 1 | 32 | 32 |
| 2 | 70 | 30 |
| 3 | 150 | 30 |
| 4 | 245 | 30 |
| 5 | 418 | 30 |
| 6 | 1518 | 30 |
| 7 | 4830 | 30 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(negabs x)
(negabs y)
(sort x y)
Compiled 10 to 10 computations (0% saved)
| Inputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(*.f64 x y) |
x |
y |
#s(literal 2 binary64) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* x y) #s(hole binary64 (* x y))) |
#s(approx x #s(hole binary64 x)) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((/ (* x y) 2) (* x y) x y 2) |
| 1.0ms | x | @ | inf | ((/ (* x y) 2) (* x y) x y 2) |
| 1.0ms | y | @ | -inf | ((/ (* x y) 2) (* x y) x y 2) |
| 1.0ms | y | @ | inf | ((/ (* x y) 2) (* x y) x y 2) |
| 1.0ms | x | @ | 0 | ((/ (* x y) 2) (* x y) x y 2) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 13 | 35 |
| 0 | 14 | 35 |
| 1 | 26 | 35 |
| 0 | 64 | 35 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(*.f64 x y) |
x |
y |
#s(literal 2 binary64) |
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* x y) #s(hole binary64 (* x y))) |
#s(approx x #s(hole binary64 x)) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(*.f64 y (/.f64 x #s(literal 2 binary64))) |
(*.f64 x (/.f64 y #s(literal 2 binary64))) |
(/.f64 (neg.f64 (*.f64 (neg.f64 x) y)) #s(literal 2 binary64)) |
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64)) |
(/.f64 (*.f64 y x) #s(literal 2 binary64)) |
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64))) |
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64))) |
(*.f64 y x) |
(*.f64 x y) |
x |
y |
#s(literal 2 binary64) |
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
#s(approx (* x y) (*.f64 y x)) |
#s(approx x x) |
#s(approx y y) |
Compiled 80 to 34 computations (57.5% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 12 | 0 | 12 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 12 | 1 | 13 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
Compiled 10 to 10 computations (0% saved)
| 1× | done |
Compiled 5 to 5 computations (0% saved)
(sort x y)
(negabs y)
(negabs x)
Compiled 50 to 50 computations (0% saved)
Loading profile data...