
Time bar (total: 2.5s)
| 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)
| 626.0ms | 8 256× | 0 | valid |
ival-mult: 192.0ms (69.6% of total)ival-div: 67.0ms (24.3% of total)ival-true: 6.0ms (2.2% of total)exact: 5.0ms (1.8% of total)ival-assert: 3.0ms (1.1% of total)adjust: 2.0ms (0.7% 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 |
| 22.0ms | 512× | 0 | valid |
Compiled 31 to 19 computations (38.7% saved)
ival-mult: 5.0ms (50.3% of total)ival-div: 3.0ms (30.2% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 13 | 30 |
| 1 | 31 | 27 |
| 2 | 70 | 25 |
| 3 | 152 | 25 |
| 4 | 247 | 25 |
| 5 | 420 | 25 |
| 6 | 1523 | 25 |
| 7 | 4833 | 25 |
| 0 | 5 | 5 |
| 0 | 7 | 5 |
| 1 | 12 | 5 |
| 2 | 18 | 5 |
| 3 | 31 | 5 |
| 4 | 59 | 5 |
| 5 | 163 | 5 |
| 6 | 1040 | 5 |
| 7 | 5503 | 5 |
| 0 | 8410 | 5 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| Outputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(/.f64 (*.f64 y x) #s(literal 2 binary64)) |
(negabs y)
(negabs x)
(sort x y)
Compiled 5 to 5 computations (0% saved)
Compiled 0 to 2 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
Compiled 5 to 5 computations (0% saved)
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (*.f64 x y) | |
| cost-diff | 0 | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 11 |
| 0 | 7 | 11 |
| 1 | 12 | 11 |
| 2 | 18 | 11 |
| 3 | 31 | 11 |
| 4 | 59 | 11 |
| 5 | 163 | 11 |
| 6 | 1040 | 11 |
| 7 | 5503 | 11 |
| 0 | 8410 | 11 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(*.f64 x y) |
x |
y |
#s(literal 2 binary64) |
| Outputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(/.f64 (*.f64 y x) #s(literal 2 binary64)) |
(*.f64 x y) |
(*.f64 y x) |
x |
y |
#s(literal 2 binary64) |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (/.f64 (*.f64 x y) #s(literal 2 binary64)) | |
| accuracy | 0.0 | (*.f64 x y) |
| 14.0ms | 256× | 0 | valid |
Compiled 13 to 7 computations (46.2% saved)
ival-div: 2.0ms (49.2% of total)ival-mult: 2.0ms (49.2% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
(*.f64 x y) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* x y) #s(hole binary64 (* x y))) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | 0 | ((/ (* x y) 2) (* x y)) |
| 1.0ms | x | @ | 0 | ((/ (* x y) 2) (* x y)) |
| 1.0ms | x | @ | inf | ((/ (* x y) 2) (* x y)) |
| 1.0ms | y | @ | -inf | ((/ (* x y) 2) (* x y)) |
| 1.0ms | x | @ | -inf | ((/ (* x y) 2) (* x y)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 18 |
| 1 | 17 | 18 |
| 2 | 30 | 18 |
| 3 | 45 | 18 |
| 4 | 73 | 18 |
| 5 | 179 | 18 |
| 6 | 1094 | 18 |
| 7 | 5305 | 18 |
| 0 | 8025 | 18 |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (* x y) #s(hole binary64 (* x y))) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
#s(approx (* x y) #s(hole binary64 (* x y))) |
#s(approx (* x y) (*.f64 y x)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 8 |
| 0 | 7 | 8 |
| 1 | 16 | 8 |
| 0 | 47 | 8 |
| 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) |
| 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) |
Compiled 76 to 30 computations (60.5% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 11 | 1 | 12 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 12 | 1 | 13 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | #s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
Compiled 11 to 9 computations (18.2% saved)
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (*.f64 y x) | |
| cost-diff | 0 | (*.f64 #s(literal 1/2 binary64) (*.f64 y x)) | |
| cost-diff | 0 | #s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 22 |
| 0 | 11 | 22 |
| 1 | 19 | 22 |
| 2 | 32 | 22 |
| 3 | 47 | 22 |
| 4 | 75 | 22 |
| 5 | 181 | 22 |
| 6 | 1096 | 22 |
| 7 | 5305 | 22 |
| 0 | 8025 | 22 |
| 1× | iter limit |
| 1× | node limit |
| 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 |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
#s(approx (/ (* x y) 2) (*.f64 (*.f64 #s(literal 1/2 binary64) x) y)) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
(*.f64 (*.f64 #s(literal 1/2 binary64) x) y) |
#s(literal 1/2 binary64) |
(*.f64 y x) |
y |
x |
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (*.f64 y x) | |
| accuracy | 0.0 | (*.f64 #s(literal 1/2 binary64) (*.f64 y x)) | |
| accuracy | 0.0 | #s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
| 205.0ms | 256× | 0 | valid |
Compiled 18 to 10 computations (44.4% saved)
ival-mult: 40.0ms (95% of total)ival-div: 2.0ms (4.8% of total)ival-true: 0.0ms (0% of total)adjust: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
(*.f64 y x) |
| 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))) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((/ (* x y) 2) (* 1/2 (* y x)) (* y x)) |
| 0.0ms | y | @ | -inf | ((/ (* x y) 2) (* 1/2 (* y x)) (* y x)) |
| 0.0ms | y | @ | inf | ((/ (* x y) 2) (* 1/2 (* y x)) (* y x)) |
| 0.0ms | x | @ | 0 | ((/ (* x y) 2) (* 1/2 (* y x)) (* y x)) |
| 0.0ms | x | @ | inf | ((/ (* x y) 2) (* 1/2 (* y x)) (* y x)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 12 | 29 |
| 1 | 23 | 29 |
| 2 | 35 | 29 |
| 3 | 48 | 29 |
| 4 | 76 | 29 |
| 5 | 182 | 29 |
| 6 | 1097 | 29 |
| 7 | 5307 | 29 |
| 0 | 8024 | 29 |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
#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))) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y)))) |
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
#s(approx (* y x) #s(hole binary64 (* x y))) |
#s(approx (* y x) (*.f64 y x)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 19 |
| 0 | 11 | 19 |
| 1 | 24 | 19 |
| 0 | 62 | 19 |
| 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)) |
(*.f64 y x) |
| 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 x #s(literal 1/2 binary64))) |
(*.f64 x (*.f64 #s(literal 1/2 binary64) y)) |
(*.f64 y x) |
(*.f64 x y) |
Compiled 125 to 29 computations (76.8% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 11 | 0 | 11 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 11 | 1 | 12 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | #s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
Compiled 27 to 21 computations (22.2% 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))) |
(/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
4 calls:
| 1.0ms | y |
| 1.0ms | x |
| 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)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 9 | 11 |
| 1 | 14 | 11 |
| 2 | 20 | 11 |
| 3 | 34 | 11 |
| 4 | 74 | 11 |
| 5 | 412 | 11 |
| 6 | 3631 | 11 |
| 1× | node limit |
| 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))) |
| 1× | done |
Compiled 11 to 9 computations (18.2% saved)
(sort x y)
(negabs x)
(negabs y)
Compiled 98 to 82 computations (16.3% saved)
Loading profile data...