
Time bar (total: 2.4s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 0 |
| 100% | 100% | 0% | 0% | 0% | 0% | 0% | 1 |
Compiled 8 to 7 computations (12.5% saved)
| 505.0ms | 8 256× | 0 | valid |
ival-sqrt: 126.0ms (40.7% of total)ival-pow2: 106.0ms (34.2% of total)ival-mult: 61.0ms (19.7% of total)ival-true: 6.0ms (1.9% of total)exact: 5.0ms (1.6% of total)ival-assert: 3.0ms (1% of total)adjust: 2.0ms (0.6% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 124 | 0 | - | 2 | (-1.7018849600979206e-160) | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 0 | 0 | - | 0 | - | (pow.f64 x #s(literal 2 binary64)) |
| 0 | 0 | - | 0 | - | #s(literal 2 binary64) |
| 0 | 0 | - | 0 | - | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| 0 | 0 | - | 0 | - | x |
| Operator | Subexpression | Explanation | Count | |
|---|---|---|---|---|
sqrt.f64 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) | oflow-rescue | 64 | 0 |
| ↳ | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) | overflow | 64 | |
| ↳ | (pow.f64 x #s(literal 2 binary64)) | overflow | 64 | |
sqrt.f64 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) | uflow-rescue | 58 | 0 |
| ↳ | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) | underflow | 58 | |
| ↳ | (pow.f64 x #s(literal 2 binary64)) | underflow | 58 |
| Predicted + | Predicted - | |
|---|---|---|
| + | 122 | 2 |
| - | 0 | 132 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 122 | 0 | 2 |
| - | 0 | 0 | 132 |
| number | freq |
|---|---|
| 0 | 134 |
| 1 | 122 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 1 | 0 | 0 |
| - | 0 | 0 | 0 |
| 25.0ms | 512× | 0 | valid |
Compiled 42 to 19 computations (54.8% saved)
ival-pow2: 6.0ms (43.8% of total)ival-mult: 3.0ms (21.9% of total)ival-sqrt: 3.0ms (21.9% 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 | 10 | 20 |
| 1 | 18 | 19 |
| 2 | 55 | 19 |
| 3 | 167 | 19 |
| 4 | 408 | 19 |
| 5 | 1304 | 19 |
| 6 | 5101 | 19 |
| 0 | 5 | 6 |
| 0 | 8 | 6 |
| 1 | 13 | 6 |
| 2 | 34 | 6 |
| 3 | 106 | 6 |
| 4 | 358 | 6 |
| 5 | 1096 | 6 |
| 6 | 4530 | 6 |
| 0 | 8083 | 3 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| Outputs |
|---|
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
(hypot.f64 x x) |
(abs x)
Compiled 6 to 5 computations (16.7% saved)
Compiled 0 to 1 computations (-∞% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 55.0% | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
Compiled 6 to 5 computations (16.7% saved)
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (pow.f64 x #s(literal 2 binary64)) | |
| cost-diff | 0 | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) | |
| cost-diff | 3 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 16 |
| 0 | 8 | 16 |
| 1 | 13 | 16 |
| 2 | 34 | 16 |
| 3 | 106 | 16 |
| 4 | 358 | 16 |
| 5 | 1096 | 16 |
| 6 | 4530 | 16 |
| 0 | 8083 | 13 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
#s(literal 2 binary64) |
(pow.f64 x #s(literal 2 binary64)) |
x |
| Outputs |
|---|
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
(hypot.f64 x x) |
(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
(*.f64 (*.f64 x x) #s(literal 2 binary64)) |
#s(literal 2 binary64) |
(pow.f64 x #s(literal 2 binary64)) |
(*.f64 x x) |
x |
Found 3 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (pow.f64 x #s(literal 2 binary64)) | |
| accuracy | 0.00390625 | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) | |
| accuracy | 28.795561539218873 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 12.0ms | 256× | 0 | valid |
Compiled 18 to 7 computations (61.1% saved)
ival-pow2: 3.0ms (45.8% of total)ival-mult: 2.0ms (30.5% of total)ival-sqrt: 2.0ms (30.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 |
|---|
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
(pow.f64 x #s(literal 2 binary64)) |
| Outputs |
|---|
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (* 2 (pow x 2)) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (pow x 2) #s(hole binary64 (pow x 2))) |
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | inf | ((sqrt (* 2 (pow x 2))) (* 2 (pow x 2)) (pow x 2)) |
| 1.0ms | x | @ | 0 | ((sqrt (* 2 (pow x 2))) (* 2 (pow x 2)) (pow x 2)) |
| 1.0ms | x | @ | -inf | ((sqrt (* 2 (pow x 2))) (* 2 (pow x 2)) (pow x 2)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 13 | 41 |
| 1 | 23 | 41 |
| 2 | 55 | 41 |
| 3 | 130 | 41 |
| 4 | 411 | 41 |
| 5 | 1319 | 41 |
| 6 | 4910 | 41 |
| 0 | 8131 | 35 |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (* 2 (pow x 2)) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (pow x 2) #s(hole binary64 (pow x 2))) |
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
| Outputs |
|---|
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (* 2 (pow x 2))) (*.f64 x (sqrt.f64 #s(literal 2 binary64)))) |
#s(approx (* 2 (pow x 2)) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (* 2 (pow x 2)) (*.f64 (*.f64 x x) #s(literal 2 binary64))) |
#s(approx (pow x 2) #s(hole binary64 (pow x 2))) |
#s(approx (pow x 2) (*.f64 x x)) |
#s(approx (sqrt (* 2 (pow x 2))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
#s(approx (sqrt (* 2 (pow x 2))) (*.f64 (neg.f64 x) (sqrt.f64 #s(literal 2 binary64)))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 14 |
| 0 | 8 | 14 |
| 1 | 24 | 12 |
| 0 | 105 | 11 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
(*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
(pow.f64 x #s(literal 2 binary64)) |
| Outputs |
|---|
(*.f64 (pow.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1/4 binary64)) (pow.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1/4 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(*.f64 x (sqrt.f64 #s(literal 2 binary64))) |
(pow.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1/2 binary64)) |
(sqrt.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64))) |
(hypot.f64 (neg.f64 x) (neg.f64 x)) |
(hypot.f64 (neg.f64 x) (exp.f64 (log.f64 x))) |
(hypot.f64 (neg.f64 x) x) |
(hypot.f64 (exp.f64 (log.f64 x)) (neg.f64 x)) |
(hypot.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x))) |
(hypot.f64 (exp.f64 (log.f64 x)) x) |
(hypot.f64 x (neg.f64 x)) |
(hypot.f64 x (exp.f64 (log.f64 x))) |
(hypot.f64 x x) |
(exp.f64 (*.f64 (log.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64))) #s(literal 1/2 binary64))) |
(*.f64 (*.f64 #s(literal 2 binary64) x) x) |
(*.f64 (*.f64 x x) #s(literal 2 binary64)) |
(*.f64 x (*.f64 x #s(literal 2 binary64))) |
(*.f64 x (+.f64 x x)) |
(*.f64 #s(literal 2 binary64) (*.f64 x x)) |
(/.f64 (-.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (*.f64 (*.f64 x x) (*.f64 x x))) (-.f64 (*.f64 x x) (*.f64 x x))) |
(/.f64 (+.f64 (pow.f64 (*.f64 x x) #s(literal 3 binary64)) (pow.f64 (*.f64 x x) #s(literal 3 binary64))) (fma.f64 (*.f64 x x) (*.f64 x x) (-.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (*.f64 (*.f64 x x) (*.f64 x x))))) |
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x)) |
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (*.f64 x x)) |
(fma.f64 #s(literal 1 binary64) (*.f64 x x) (*.f64 #s(literal 1 binary64) (*.f64 x x))) |
(fma.f64 (*.f64 x x) #s(literal 1 binary64) (*.f64 (*.f64 x x) #s(literal 1 binary64))) |
(fma.f64 x x (*.f64 x x)) |
(-.f64 (*.f64 x x) (*.f64 (neg.f64 x) x)) |
(+.f64 (*.f64 #s(literal 1 binary64) (*.f64 x x)) (*.f64 #s(literal 1 binary64) (*.f64 x x))) |
(+.f64 (*.f64 (*.f64 x x) #s(literal 1 binary64)) (*.f64 (*.f64 x x) #s(literal 1 binary64))) |
(+.f64 (*.f64 x x) (*.f64 x x)) |
(*.f64 (neg.f64 x) (neg.f64 x)) |
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x))) |
(*.f64 x x) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64)) |
(pow.f64 (*.f64 x x) #s(literal 1 binary64)) |
(pow.f64 x #s(literal 2 binary64)) |
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) |
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))) |
Compiled 382 to 108 computations (71.7% saved)
3 alts after pruning (3 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 40 | 3 | 43 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 41 | 3 | 44 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (hypot.f64 x x) |
| ▶ | 99.3% | (*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
| ▶ | 55.0% | (sqrt.f64 (*.f64 x (+.f64 x x))) |
Compiled 13 to 10 computations (23.1% saved)
Found 6 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (hypot.f64 x x) | |
| cost-diff | 0 | (sqrt.f64 #s(literal 2 binary64)) | |
| cost-diff | 0 | (*.f64 (sqrt.f64 #s(literal 2 binary64)) x) | |
| cost-diff | 0 | (+.f64 x x) | |
| cost-diff | 0 | (*.f64 x (+.f64 x x)) | |
| cost-diff | 3 | (sqrt.f64 (*.f64 x (+.f64 x x))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 27 |
| 0 | 16 | 24 |
| 1 | 28 | 24 |
| 2 | 66 | 24 |
| 3 | 158 | 24 |
| 4 | 375 | 24 |
| 5 | 1046 | 24 |
| 6 | 4322 | 24 |
| 0 | 8762 | 24 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
(sqrt.f64 (*.f64 x (+.f64 x x))) |
(*.f64 x (+.f64 x x)) |
x |
(+.f64 x x) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 #s(literal 2 binary64)) |
#s(literal 2 binary64) |
x |
(hypot.f64 x x) |
x |
| Outputs |
|---|
(sqrt.f64 (*.f64 x (+.f64 x x))) |
(hypot.f64 x x) |
(*.f64 x (+.f64 x x)) |
(*.f64 (*.f64 #s(literal 2 binary64) x) x) |
x |
(+.f64 x x) |
(*.f64 #s(literal 2 binary64) x) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 #s(literal 2 binary64)) |
#s(literal 2 binary64) |
x |
(hypot.f64 x x) |
x |
Found 6 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0078125 | (hypot.f64 x x) | |
| accuracy | 0.0 | (sqrt.f64 #s(literal 2 binary64)) | |
| accuracy | 0.41796875 | (*.f64 (sqrt.f64 #s(literal 2 binary64)) x) | |
| accuracy | 0.0 | (+.f64 x x) | |
| accuracy | 0.0 | (*.f64 x (+.f64 x x)) | |
| accuracy | 28.795561539218873 | (sqrt.f64 (*.f64 x (+.f64 x x))) |
| 20.0ms | 256× | 0 | valid |
Compiled 34 to 10 computations (70.6% saved)
ival-hypot: 4.0ms (32.3% of total)ival-mult: 3.0ms (24.2% of total)ival-sqrt: 3.0ms (24.2% of total)ival-add: 1.0ms (8.1% 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 |
|---|
(sqrt.f64 (*.f64 x (+.f64 x x))) |
(*.f64 x (+.f64 x x)) |
(+.f64 x x) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 #s(literal 2 binary64)) |
(hypot.f64 x x) |
| Outputs |
|---|
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (+ x x) #s(hole binary64 (* 2 x))) |
#s(approx (* (sqrt 2) x) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((sqrt (* x (+ x x))) (* x (+ x x)) (+ x x) (* (sqrt 2) x) (sqrt 2) (sqrt (+ (* x x) (* x x)))) |
| 1.0ms | x | @ | inf | ((sqrt (* x (+ x x))) (* x (+ x x)) (+ x x) (* (sqrt 2) x) (sqrt 2) (sqrt (+ (* x x) (* x x)))) |
| 1.0ms | x | @ | 0 | ((sqrt (* x (+ x x))) (* x (+ x x)) (+ x x) (* (sqrt 2) x) (sqrt 2) (sqrt (+ (* x x) (* x x)))) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 23 | 73 |
| 1 | 42 | 73 |
| 2 | 102 | 73 |
| 3 | 235 | 73 |
| 4 | 474 | 73 |
| 5 | 1329 | 73 |
| 6 | 5607 | 73 |
| 0 | 8178 | 61 |
| 1× | iter limit |
| 1× | node limit |
| Inputs |
|---|
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (+ x x) #s(hole binary64 (* 2 x))) |
#s(approx (* (sqrt 2) x) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
| Outputs |
|---|
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x)) |
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2)))) |
#s(approx (* x (+ x x)) (*.f64 (*.f64 #s(literal 2 binary64) x) x)) |
#s(approx (+ x x) #s(hole binary64 (* 2 x))) |
#s(approx (+ x x) (*.f64 #s(literal 2 binary64) x)) |
#s(approx (* (sqrt 2) x) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (* (sqrt 2) x) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x)) |
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* x (sqrt 2)))) |
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) x)) |
#s(approx (sqrt (* x (+ x x))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) (neg.f64 x))) |
#s(approx (sqrt (+ (* x x) (* x x))) #s(hole binary64 (* -1 (* x (sqrt 2))))) |
#s(approx (sqrt (* x (+ x x))) (*.f64 (sqrt.f64 #s(literal 2 binary64)) (neg.f64 x))) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 23 |
| 0 | 16 | 19 |
| 1 | 51 | 12 |
| 0 | 350 | 12 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(sqrt.f64 (*.f64 x (+.f64 x x))) |
(*.f64 x (+.f64 x x)) |
(+.f64 x x) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 #s(literal 2 binary64)) |
(hypot.f64 x x) |
| Outputs |
|---|
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64))) |
(*.f64 (sqrt.f64 x) (sqrt.f64 #s(literal 2 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (*.f64 x x) #s(literal 1/2 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x)) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (fabs.f64 x)) |
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64)) |
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 6 binary64)))) (sqrt.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 0 binary64)))) |
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64))) |
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64)))) |
(sqrt.f64 #s(literal 2 binary64)) |
(hypot.f64 x x) |
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64))) |
#s(literal 2 binary64) |
#s(literal 2 binary64) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(*.f64 x (sqrt.f64 #s(literal 2 binary64))) |
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64))) |
(*.f64 (sqrt.f64 x) (sqrt.f64 #s(literal 2 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (*.f64 x x) #s(literal 1/2 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x)) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (fabs.f64 x)) |
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64)) |
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 6 binary64)))) (sqrt.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 0 binary64)))) |
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64))) |
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64)))) |
(sqrt.f64 #s(literal 2 binary64)) |
(hypot.f64 x x) |
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64))) |
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64))) |
(*.f64 (sqrt.f64 x) (sqrt.f64 #s(literal 2 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (pow.f64 (*.f64 x x) #s(literal 1/2 binary64))) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x)) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (fabs.f64 x)) |
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64)) |
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 6 binary64)))) (sqrt.f64 (+.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 0 binary64)))) |
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64))) |
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64)))) |
(sqrt.f64 #s(literal 2 binary64)) |
(hypot.f64 x x) |
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64))) |
Compiled 137 to 59 computations (56.9% saved)
4 alts after pruning (1 fresh and 3 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 19 | 1 | 20 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 3 | 3 |
| Done | 0 | 0 | 0 |
| Total | 19 | 4 | 23 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (hypot.f64 x x) |
| ✓ | 99.3% | (*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
| ✓ | 55.0% | (sqrt.f64 (*.f64 x (+.f64 x x))) |
| ▶ | 5.5% | (sqrt.f64 #s(literal 2 binary64)) |
Compiled 15 to 13 computations (13.3% saved)
Found 1 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (sqrt.f64 #s(literal 2 binary64)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 2 | 3 |
| 0 | 3 | 3 |
| 1 | 5 | 3 |
| 2 | 8 | 3 |
| 3 | 13 | 3 |
| 4 | 33 | 3 |
| 5 | 110 | 3 |
| 6 | 563 | 3 |
| 7 | 4677 | 3 |
| 0 | 8408 | 3 |
| 1× | iter limit |
| 1× | node limit |
| 1× | iter limit |
| Inputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
#s(literal 2 binary64) |
| Outputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
#s(literal 2 binary64) |
Found 1 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0.0 | (sqrt.f64 #s(literal 2 binary64)) |
| 8.0ms | 256× | 0 | valid |
Compiled 5 to 5 computations (0% saved)
ival-sqrt: 4.0ms (93.9% 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 |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
| Outputs |
|---|
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | 0 | ((sqrt 2)) |
| 0.0ms | x | @ | inf | ((sqrt 2)) |
| 0.0ms | x | @ | -inf | ((sqrt 2)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 0 | 0 |
| 1× | saturated |
| 1× | saturated |
| Inputs |
|---|
| Outputs |
|---|
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 2 | 2 |
| 0 | 3 | 2 |
| 1 | 7 | 2 |
| 0 | 25 | 2 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
| Outputs |
|---|
(*.f64 (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64)) (pow.f64 #s(literal 2 binary64) #s(literal 1/4 binary64))) |
(pow.f64 #s(literal 2 binary64) #s(literal 1/2 binary64)) |
(sqrt.f64 #s(literal 2 binary64)) |
(exp.f64 (*.f64 (log.f64 #s(literal 2 binary64)) #s(literal 1/2 binary64))) |
Compiled 17 to 11 computations (35.3% saved)
4 alts after pruning (0 fresh and 4 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 4 | 0 | 4 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 3 | 3 |
| Total | 4 | 4 | 8 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | (hypot.f64 x x) |
| ✓ | 99.3% | (*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
| ✓ | 55.0% | (sqrt.f64 (*.f64 x (+.f64 x x))) |
| ✓ | 5.5% | (sqrt.f64 #s(literal 2 binary64)) |
Compiled 36 to 24 computations (33.3% saved)
| Inputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 (*.f64 x (+.f64 x x))) |
(hypot.f64 x x) |
(sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| Outputs |
|---|
(hypot.f64 x x) |
4 calls:
| 2.0ms | x |
| 2.0ms | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 2.0ms | (pow.f64 x #s(literal 2 binary64)) |
| 2.0ms | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (pow.f64 x #s(literal 2 binary64)) |
| 100.0% | 1 | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| 100.0% | 1 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 100.0% | 1 | x |
Compiled 15 to 13 computations (13.3% saved)
| Inputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 (*.f64 x (+.f64 x x))) |
| Outputs |
|---|
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
4 calls:
| 12.0ms | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 2.0ms | x |
| 1.0ms | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| 1.0ms | (pow.f64 x #s(literal 2 binary64)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 99.3% | 1 | (pow.f64 x #s(literal 2 binary64)) |
| 99.3% | 1 | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| 99.3% | 1 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 99.3% | 1 | x |
Compiled 15 to 13 computations (13.3% saved)
Total -0.0b remaining (-0%)
Threshold costs -0b (-0%)
| Inputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
| Outputs |
|---|
(sqrt.f64 #s(literal 2 binary64)) |
4 calls:
| 1.0ms | x |
| 1.0ms | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 1.0ms | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| 1.0ms | (pow.f64 x #s(literal 2 binary64)) |
| Accuracy | Segments | Branch |
|---|---|---|
| 5.5% | 1 | (pow.f64 x #s(literal 2 binary64)) |
| 5.5% | 1 | (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64))) |
| 5.5% | 1 | (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 2 binary64)))) |
| 5.5% | 1 | x |
Compiled 15 to 13 computations (13.3% saved)
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 9 |
| 1 | 7 | 9 |
| 2 | 10 | 9 |
| 3 | 16 | 9 |
| 4 | 48 | 9 |
| 5 | 370 | 9 |
| 6 | 3460 | 9 |
| 1× | node limit |
| Inputs |
|---|
(hypot.f64 x x) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 #s(literal 2 binary64)) |
| Outputs |
|---|
(hypot.f64 x x) |
(*.f64 (sqrt.f64 #s(literal 2 binary64)) x) |
(sqrt.f64 #s(literal 2 binary64)) |
| 1× | done |
Compiled 9 to 5 computations (44.4% saved)
(abs x)
Compiled 36 to 24 computations (33.3% saved)
Loading profile data...