
Time bar (total: 2.1s)
| 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 6 computations (14.3% saved)
| 778.0ms | 8 256× | 0 | valid |
ival-mult: 248.0ms (68.7% of total)ival-add: 101.0ms (28% of total)ival-true: 6.0ms (1.7% of total)ival-assert: 3.0ms (0.8% of total)adjust: 2.0ms (0.6% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (*.f64 x (+.f64 y y)) |
| 0 | 0 | - | 0 | - | (+.f64 y y) |
| 0 | 0 | - | 0 | - | 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 |
| 19.0ms | 512× | 0 | valid |
Compiled 29 to 16 computations (44.8% saved)
ival-mult: 4.0ms (55.9% of total)ival-add: 3.0ms (41.9% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 13 | 32 |
| 1 | 41 | 30 |
| 2 | 101 | 30 |
| 3 | 181 | 30 |
| 4 | 338 | 30 |
| 5 | 472 | 30 |
| 6 | 1241 | 30 |
| 7 | 3217 | 30 |
| 8 | 7707 | 30 |
| 0 | 4 | 5 |
| 0 | 6 | 5 |
| 1 | 13 | 5 |
| 2 | 29 | 5 |
| 3 | 57 | 5 |
| 4 | 124 | 5 |
| 5 | 240 | 5 |
| 6 | 941 | 5 |
| 7 | 4190 | 5 |
| 0 | 8541 | 5 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(*.f64 x (+.f64 y y)) |
| Outputs |
|---|
(*.f64 x (+.f64 y y)) |
(*.f64 (*.f64 #s(literal 2 binary64) y) x) |
(negabs x)
(negabs y)
(sort x y)
Compiled 5 to 4 computations (20% saved)
Compiled 0 to 2 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 x (+.f64 y y)) |
Compiled 5 to 4 computations (20% saved)
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (+.f64 y y) | |
| cost-diff | 0 | (*.f64 x (+.f64 y y)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 10 |
| 0 | 6 | 10 |
| 1 | 13 | 10 |
| 2 | 29 | 10 |
| 3 | 57 | 10 |
| 4 | 124 | 10 |
| 5 | 240 | 10 |
| 6 | 941 | 10 |
| 7 | 4190 | 10 |
| 0 | 8541 | 10 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 x (+.f64 y y)) |
x |
(+.f64 y y) |
y |
| Outputs |
|---|
(*.f64 x (+.f64 y y)) |
(*.f64 (*.f64 #s(literal 2 binary64) y) x) |
x |
(+.f64 y y) |
(*.f64 #s(literal 2 binary64) y) |
y |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (+.f64 y y) | |
| accuracy | 0.0 | (*.f64 x (+.f64 y y)) |
| 9.0ms | 256× | 0 | valid |
Compiled 12 to 6 computations (50% saved)
ival-mult: 2.0ms (60.1% of total)ival-add: 1.0ms (30% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
(*.f64 x (+.f64 y y)) |
(+.f64 y y) |
| Outputs |
|---|
#s(approx (* x (+ y y)) #s(hole binary64 (* 2 (* x y)))) |
#s(approx (+ y y) #s(hole binary64 (* 2 y))) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 38.0ms | x | @ | inf | ((* x (+ y y)) (+ y y)) |
| 1.0ms | y | @ | inf | ((* x (+ y y)) (+ y y)) |
| 1.0ms | y | @ | 0 | ((* x (+ y y)) (+ y y)) |
| 1.0ms | y | @ | -inf | ((* x (+ y y)) (+ y y)) |
| 1.0ms | x | @ | 0 | ((* x (+ y y)) (+ y y)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 10 | 18 |
| 1 | 22 | 18 |
| 2 | 45 | 18 |
| 3 | 102 | 18 |
| 4 | 236 | 18 |
| 5 | 815 | 18 |
| 6 | 4726 | 18 |
| 0 | 8144 | 18 |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
#s(approx (* x (+ y y)) #s(hole binary64 (* 2 (* x y)))) |
#s(approx (+ y y) #s(hole binary64 (* 2 y))) |
| Outputs |
|---|
#s(approx (* x (+ y y)) #s(hole binary64 (* 2 (* x y)))) |
#s(approx (* x (+ y y)) (*.f64 (*.f64 y x) #s(literal 2 binary64))) |
#s(approx (+ y y) #s(hole binary64 (* 2 y))) |
#s(approx (+ y y) (*.f64 #s(literal 2 binary64) y)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 8 |
| 0 | 6 | 8 |
| 1 | 22 | 8 |
| 0 | 137 | 8 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 x (+.f64 y y)) |
(+.f64 y y) |
| Outputs |
|---|
(*.f64 (*.f64 x #s(literal 2 binary64)) y) |
(*.f64 #s(literal 2 binary64) (*.f64 y x)) |
(*.f64 (*.f64 #s(literal 2 binary64) y) x) |
(*.f64 y (+.f64 x x)) |
(*.f64 x (*.f64 #s(literal 2 binary64) y)) |
(/.f64 (*.f64 #s(literal 0 binary64) x) #s(literal 0 binary64)) |
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) x) (fma.f64 y y #s(literal 0 binary64))) |
(/.f64 (*.f64 x #s(literal 0 binary64)) #s(literal 0 binary64)) |
(/.f64 (*.f64 x (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64))) |
(/.f64 (-.f64 (*.f64 (*.f64 y x) (*.f64 y x)) (*.f64 (*.f64 y x) (*.f64 y x))) (-.f64 (*.f64 y x) (*.f64 y x))) |
(/.f64 (+.f64 (pow.f64 (*.f64 y x) #s(literal 3 binary64)) (pow.f64 (*.f64 y x) #s(literal 3 binary64))) (fma.f64 (*.f64 y x) (*.f64 y x) (-.f64 (*.f64 (*.f64 y x) (*.f64 y x)) (*.f64 (*.f64 y x) (*.f64 y x))))) |
(fma.f64 y x (*.f64 y x)) |
(fma.f64 x y (*.f64 y x)) |
(-.f64 (*.f64 y x) (*.f64 (neg.f64 y) x)) |
(-.f64 (*.f64 y x) (*.f64 (neg.f64 x) y)) |
(+.f64 (*.f64 y x) (*.f64 y x)) |
(*.f64 #s(literal 2 binary64) y) |
(*.f64 y #s(literal 2 binary64)) |
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y #s(literal 0 binary64)))) |
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) |
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y #s(literal 0 binary64))) |
(-.f64 (/.f64 (*.f64 y y) #s(literal 0 binary64)) (/.f64 (*.f64 y y) #s(literal 0 binary64))) |
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64)))) |
(+.f64 y y) |
Compiled 249 to 67 computations (73.1% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 26 | 0 | 26 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 26 | 1 | 27 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (*.f64 x (+.f64 y y)) |
Compiled 10 to 8 computations (20% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 5 |
| 1× | saturated |
| Inputs |
|---|
(*.f64 x (+.f64 y y)) |
| Outputs |
|---|
(*.f64 x (+.f64 y y)) |
| 1× | done |
Compiled 5 to 4 computations (20% saved)
(sort x y)
(negabs y)
(negabs x)
Compiled 80 to 64 computations (20% saved)
Loading profile data...