
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)
| 632.0ms | 8 256× | 0 | valid |
ival-mult: 169.0ms (58.9% of total)ival-div: 103.0ms (35.9% of total)ival-true: 5.0ms (1.7% of total)exact: 5.0ms (1.7% of total)ival-assert: 3.0ms (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 |
| 20.0ms | 512× | 0 | valid |
Compiled 31 to 19 computations (38.7% saved)
ival-mult: 4.0ms (47% of total)ival-div: 3.0ms (35.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 x y) | |
| accuracy | 0.015625 | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 10.0ms | 256× | 0 | valid |
Compiled 13 to 7 computations (46.2% saved)
ival-div: 2.0ms (51.5% of total)ival-mult: 2.0ms (51.5% 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 |
|---|
(* 1/2 (* x y)) |
(* 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 | y | @ | -inf | ((/ (* x y) 2) (* x y)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 8 |
| 1 | 9 | 8 |
| 2 | 16 | 8 |
| 3 | 18 | 8 |
| 0 | 18 | 8 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* 1/2 (* x y)) |
(* x y) |
| Outputs |
|---|
(* 1/2 (* x y)) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(* 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)
2 alts after pruning (2 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 10 | 2 | 12 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 11 | 2 | 13 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 (/.f64 y #s(literal 2 binary64)) x) |
| ▶ | 100.0% | #s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
Compiled 16 to 14 computations (12.5% saved)
Found 5 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (/.f64 y #s(literal 2 binary64)) | |
| cost-diff | 0 | (*.f64 (/.f64 y #s(literal 2 binary64)) x) | |
| cost-diff | 0 | (*.f64 y x) | |
| cost-diff | 0 | (*.f64 (*.f64 y x) #s(literal 1/2 binary64)) | |
| cost-diff | 0 | #s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 11 | 33 |
| 0 | 15 | 33 |
| 1 | 22 | 33 |
| 2 | 34 | 33 |
| 3 | 49 | 33 |
| 4 | 77 | 33 |
| 5 | 183 | 33 |
| 6 | 1117 | 33 |
| 7 | 5326 | 33 |
| 0 | 8044 | 33 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 y x) |
y |
x |
#s(literal 1/2 binary64) |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(/.f64 y #s(literal 2 binary64)) |
y |
#s(literal 2 binary64) |
x |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
#s(approx (/ (* x y) 2) (*.f64 (*.f64 #s(literal 1/2 binary64) x) y)) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 (*.f64 #s(literal 1/2 binary64) x) y) |
(*.f64 y x) |
y |
x |
#s(literal 1/2 binary64) |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(*.f64 (*.f64 #s(literal 1/2 binary64) x) y) |
(/.f64 y #s(literal 2 binary64)) |
(*.f64 #s(literal 1/2 binary64) y) |
y |
#s(literal 2 binary64) |
x |
Found 5 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (/.f64 y #s(literal 2 binary64)) | |
| accuracy | 0.0 | (*.f64 (/.f64 y #s(literal 2 binary64)) x) | |
| accuracy | 0.0 | (*.f64 y x) | |
| accuracy | 0.0 | #s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) | |
| accuracy | 0.015625 | (*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
| 17.0ms | 256× | 0 | valid |
Compiled 29 to 12 computations (58.6% saved)
ival-mult: 6.0ms (61.2% of total)ival-div: 3.0ms (30.6% 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 (*.f64 y x) #s(literal 1/2 binary64))) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 y x) |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(/.f64 y #s(literal 2 binary64)) |
| Outputs |
|---|
(* 1/2 (* x y)) |
(* x y) |
(* 1/2 y) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | y | @ | -inf | ((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2)) |
| 1.0ms | y | @ | inf | ((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2)) |
| 0.0ms | x | @ | -inf | ((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2)) |
| 0.0ms | y | @ | 0 | ((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2)) |
| 0.0ms | x | @ | 0 | ((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 11 |
| 1 | 11 | 11 |
| 2 | 16 | 11 |
| 0 | 16 | 11 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* 1/2 (* x y)) |
(* x y) |
(* 1/2 y) |
| Outputs |
|---|
(* 1/2 (* x y)) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
(* x y) |
(*.f64 y x) |
(* 1/2 y) |
(*.f64 #s(literal 1/2 binary64) y) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 11 | 27 |
| 0 | 15 | 27 |
| 1 | 29 | 27 |
| 0 | 70 | 27 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 y x) |
(*.f64 (/.f64 y #s(literal 2 binary64)) x) |
(/.f64 y #s(literal 2 binary64)) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 #s(literal 1/2 binary64) (*.f64 y x))) |
(*.f64 (*.f64 #s(literal 1/2 binary64) y) x) |
(*.f64 (*.f64 #s(literal 1/2 binary64) x) y) |
(*.f64 #s(literal 1/2 binary64) (*.f64 y x)) |
(*.f64 (*.f64 y x) #s(literal 1/2 binary64)) |
(*.f64 y (*.f64 #s(literal 1/2 binary64) x)) |
(*.f64 x (*.f64 y #s(literal 1/2 binary64))) |
(*.f64 y x) |
(*.f64 x y) |
(*.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 (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 (neg.f64 y) #s(literal 2 binary64))) |
(neg.f64 (/.f64 y #s(literal -2 binary64))) |
Compiled 200 to 61 computations (69.5% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 23 | 1 | 24 |
| Fresh | 0 | 0 | 0 |
| Picked | 2 | 0 | 2 |
| Done | 0 | 0 | 0 |
| Total | 25 | 1 | 26 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
Compiled 9 to 8 computations (11.1% saved)
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (*.f64 #s(literal 1/2 binary64) y) | |
| cost-diff | 0 | #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) | |
| cost-diff | 0 | (*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 22 |
| 0 | 10 | 22 |
| 1 | 14 | 22 |
| 2 | 17 | 22 |
| 3 | 23 | 22 |
| 4 | 45 | 22 |
| 5 | 128 | 22 |
| 6 | 689 | 22 |
| 7 | 4950 | 22 |
| 0 | 8359 | 22 |
| 1× | iter limit |
| 1× | node limit |
| 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 |
| Outputs |
|---|
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
(*.f64 x #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))) |
#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 |
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) | |
| accuracy | 0.0 | (*.f64 #s(literal 1/2 binary64) y) | |
| accuracy | 0.0 | #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) |
| 106.0ms | 256× | 0 | valid |
Compiled 16 to 9 computations (43.8% saved)
ival-div: 80.0ms (96.1% of total)ival-mult: 3.0ms (3.6% 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 #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) |
| Outputs |
|---|
(* 1/2 (* x y)) |
(* 1/2 y) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | y | @ | inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y)) |
| 0.0ms | y | @ | -inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y)) |
| 0.0ms | y | @ | 0 | ((* (/ y 2) x) (/ y 2) (* 1/2 y)) |
| 0.0ms | x | @ | 0 | ((* (/ y 2) x) (/ y 2) (* 1/2 y)) |
| 0.0ms | x | @ | inf | ((* (/ y 2) x) (/ y 2) (* 1/2 y)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 8 |
| 1 | 11 | 8 |
| 2 | 16 | 8 |
| 0 | 16 | 8 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* 1/2 (* x y)) |
(* 1/2 y) |
| Outputs |
|---|
(* 1/2 (* x y)) |
(*.f64 (*.f64 x y) #s(literal 1/2 binary64)) |
(* 1/2 y) |
(*.f64 #s(literal 1/2 binary64) y) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 19 |
| 0 | 10 | 19 |
| 1 | 18 | 19 |
| 0 | 39 | 19 |
| 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) |
| 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)) |
Compiled 56 to 16 computations (71.4% 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 39 to 26 computations (33.3% saved)
| Inputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
(*.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 | y |
| 2.0ms | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 2.0ms | x |
| 2.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 (*.f64 y x) #s(literal 1/2 binary64))) |
| Outputs |
|---|
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
4 calls:
| 1.0ms | (*.f64 x y) |
| 1.0ms | (/.f64 (*.f64 x y) #s(literal 2 binary64)) |
| 1.0ms | y |
| 1.0ms | x |
| 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 | 13 | 20 |
| 1 | 17 | 20 |
| 2 | 23 | 20 |
| 3 | 37 | 20 |
| 4 | 77 | 20 |
| 5 | 415 | 20 |
| 6 | 3627 | 20 |
| 1× | node limit |
| Inputs |
|---|
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
| Outputs |
|---|
(*.f64 #s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y)) x) |
#s(approx (/ (* x y) 2) (*.f64 (*.f64 y x) #s(literal 1/2 binary64))) |
| 1× | done |
Compiled 20 to 13 computations (35% saved)
(sort x y)
(negabs x)
(negabs y)
Compiled 104 to 84 computations (19.2% saved)
Loading profile data...