Numeric.Interval.Internal:scale from intervals-0.7.1, B
Time bar (total: 933.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)
| 317.0ms | 8 256× | 0 | valid |
ival-mult!: 66.0ms (62.7% of total)ival-div!: 38.0ms (36.1% of total)adjust: 2.0ms (1.9% of total)Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 15 | 32 |
| 1 | 40 | 30 |
| 2 | 81 | 30 |
| 3 | 142 | 30 |
| 4 | 248 | 30 |
| 5 | 1080 | 30 |
| 6 | 4889 | 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 | y | @ | 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 y x) #s(literal -2 binary64))) |
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #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 45 to 34 computations (24.4% saved)
2 alts after pruning (2 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 11 | 2 | 13 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 12 | 2 | 14 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 (/.f64 y #s(literal 2 binary64)) x) |
| ▶ | 100.0% | #s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
Compiled 14 to 14 computations (0% saved)
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
#s(literal 1/2 binary64) |
(*.f64 y x) |
y |
x |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(/.f64 y #s(literal 2 binary64)) |
#s(literal 2 binary64) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* y x) #s(hole binary64 (* x y))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx y #s(hole binary64 y)) |
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y))) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2) |
| 1.0ms | y | @ | -inf | ((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2) |
| 1.0ms | y | @ | inf | ((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2) |
| 1.0ms | x | @ | inf | ((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2) |
| 0.0ms | y | @ | 0 | ((/ (* x y) 2) (* 1/2 (* y x)) 1/2 (* y x) y x (* (/ y 2) x) (/ y 2) 2) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 24 | 84 |
| 0 | 29 | 84 |
| 1 | 47 | 84 |
| 0 | 85 | 84 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
#s(literal 1/2 binary64) |
(*.f64 y x) |
y |
x |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(/.f64 y #s(literal 2 binary64)) |
#s(literal 2 binary64) |
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* y x) #s(hole binary64 (* x y))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx y #s(hole binary64 y)) |
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y))) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
(*.f64 (*.f64 #s(literal 1/2 binary64) x) y) |
(*.f64 (*.f64 #s(literal 1/2 binary64) y) x) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
(*.f64 y (*.f64 #s(literal 1/2 binary64) x)) |
(*.f64 x (*.f64 #s(literal 1/2 binary64) y)) |
#s(literal 1/2 binary64) |
(*.f64 y x) |
(*.f64 x y) |
y |
x |
(*.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 y x) #s(literal -2 binary64))) |
(neg.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64))) |
(/.f64 (neg.f64 (neg.f64 y)) #s(literal 2 binary64)) |
(/.f64 (neg.f64 y) #s(literal -2 binary64)) |
(/.f64 y #s(literal 2 binary64)) |
(neg.f64 (/.f64 y #s(literal -2 binary64))) |
(neg.f64 (/.f64 (neg.f64 y) #s(literal 2 binary64))) |
#s(literal 2 binary64) |
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
#s(approx (* 1/2 (* y x)) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
#s(approx (* y x) (*.f64 y x)) |
#s(approx x x) |
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
#s(approx y y) |
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) |
Compiled 95 to 72 computations (24.2% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 24 | 1 | 25 |
| Fresh | 0 | 0 | 0 |
| Picked | 2 | 0 | 2 |
| Done | 0 | 0 | 0 |
| Total | 26 | 1 | 27 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
Compiled 8 to 8 computations (0% saved)
| Inputs |
|---|
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) |
(*.f64 #s(literal 1/2 binary64) y) |
#s(literal 1/2 binary64) |
y |
x |
| Outputs |
|---|
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y))) |
#s(approx (* 1/2 y) #s(hole binary64 (* 1/2 y))) |
#s(approx y #s(hole binary64 y)) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x) |
| 1.0ms | y | @ | -inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x) |
| 0.0ms | x | @ | inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x) |
| 0.0ms | x | @ | -inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x) |
| 0.0ms | y | @ | 0 | ((* (/ y 2) x) (/ y 2) (* 1/2 y) 1/2 y x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 17 | 53 |
| 0 | 18 | 53 |
| 1 | 33 | 53 |
| 0 | 67 | 53 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | iter-limit |
| Inputs |
|---|
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) |
(*.f64 #s(literal 1/2 binary64) y) |
#s(literal 1/2 binary64) |
y |
x |
#s(approx (* (/ y 2) x) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (/ y 2) #s(hole binary64 (* 1/2 y))) |
#s(approx (* 1/2 y) #s(hole binary64 (* 1/2 y))) |
#s(approx y #s(hole binary64 y)) |
| Outputs |
|---|
(*.f64 x #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))) |
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) |
(*.f64 #s(literal 1/2 binary64) y) |
(*.f64 y #s(literal 1/2 binary64)) |
#s(literal 1/2 binary64) |
y |
x |
#s(approx (* (/ y 2) x) (*.f64 (*.f64 x y) #s(literal 1/2 binary64))) |
#s(approx x x) |
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) |
#s(approx (* 1/2 y) (*.f64 #s(literal 1/2 binary64) y)) |
#s(approx y y) |
Compiled 31 to 26 computations (16.1% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 6 | 0 | 6 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 6 | 1 | 7 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
Compiled 26 to 26 computations (0% saved)
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| Outputs |
|---|
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
4 calls:
| 4.0ms | x |
| 2.0ms | y |
| 1.0ms | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 1.0ms | (*.f64 x y) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (*.f64 x y) |
| 100.0% | 1 | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 100.0% | 1 | x |
| 100.0% | 1 | y |
Compiled 10 to 12 computations (-20% saved)
Total 0.0b remaining (0%)
Threshold costs 0b (0%)
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
4 calls:
| 1.0ms | x |
| 1.0ms | (*.f64 x y) |
| 1.0ms | y |
| 1.0ms | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (*.f64 x y) |
| 100.0% | 1 | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 100.0% | 1 | x |
| 100.0% | 1 | y |
Compiled 10 to 12 computations (-20% saved)
| 1× | done |
Compiled 13 to 13 computations (0% saved)
(sort x y)
(negabs y)
(negabs x)
Compiled 120 to 120 computations (0% saved)
Loading profile data...