
Time bar (total: 1.3s)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 0% | 100% | 0% | 0% | 0% | 0 |
| 0% | 0% | 0% | 100% | 0% | 0% | 0% | 1 |
| 0% | 0% | 0% | 100% | 0% | 0% | 0% | 2 |
| 25% | 0% | 0% | 100% | 0% | 0% | 0% | 3 |
| 62.5% | 0% | 0% | 100% | 0% | 0% | 0% | 4 |
| 81.3% | 0% | 0% | 100% | 0% | 0% | 0% | 5 |
| 90.6% | 0% | 0% | 100% | 0% | 0% | 0% | 6 |
| 95.3% | 0% | 0% | 100% | 0% | 0% | 0% | 7 |
| 97.7% | 0% | 0% | 100% | 0% | 0% | 0% | 8 |
| 98.8% | 0% | 0% | 100% | 0% | 0% | 0% | 9 |
| 99.4% | 0% | 0% | 100% | 0% | 0% | 0% | 10 |
| 99.7% | 0% | 0% | 100% | 0% | 0% | 0% | 11 |
| 99.9% | 0% | 0% | 100% | 0% | 0% | 0% | 12 |
Compiled 15 to 12 computations (20% saved)
| 523.0ms | 8 217× | 0 | valid |
| 2.0ms | 39× | 1 | valid |
ival-div!: 310.0ms (82.4% of total)ival-mult!: 44.0ms (11.7% of total)ival-sub!: 19.0ms (5.1% of total)adjust: 2.0ms (0.5% of total)ival-assert: 0.0ms (0% of total)ival-and: 0.0ms (0% of total)ival-<=: 0.0ms (0% of total)Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 11 | 21 |
| 1 | 47 | 21 |
| 2 | 131 | 21 |
| 3 | 299 | 21 |
| 4 | 1982 | 21 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 87.9% | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
(abs x)
Compiled 12 to 12 computations (0% saved)
| Inputs |
|---|
(/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
#s(literal 10 binary64) |
(-.f64 #s(literal 1 binary64) (*.f64 x x)) |
#s(literal 1 binary64) |
(*.f64 x x) |
x |
| Outputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 10)) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* 10 (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))))) |
#s(approx (- 1 (* x x)) #s(hole binary64 1)) |
#s(approx (- 1 (* x x)) #s(hole binary64 (+ 1 (* -1 (pow x 2))))) |
#s(approx (* x x) #s(hole binary64 (pow x 2))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ -10 (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))) 10) (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 4))) (+ 10 (* 10 (/ 1 (pow x 2))))) (pow x 2)))) |
#s(approx (- 1 (* x x)) #s(hole binary64 (* -1 (pow x 2)))) |
#s(approx (- 1 (* x x)) #s(hole binary64 (* (pow x 2) (- (/ 1 (pow x 2)) 1)))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | inf | ((/ 10 (- 1 (* x x))) 10 (- 1 (* x x)) 1 (* x x) x) |
| 1.0ms | x | @ | -inf | ((/ 10 (- 1 (* x x))) 10 (- 1 (* x x)) 1 (* x x) x) |
| 1.0ms | x | @ | 0 | ((/ 10 (- 1 (* x x))) 10 (- 1 (* x x)) 1 (* x x) x) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 51 | 250 |
| 0 | 54 | 230 |
| 1 | 318 | 227 |
| 2 | 2205 | 227 |
| 1× | iter-limit |
| 1× | unsound |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
(/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
#s(literal 10 binary64) |
(-.f64 #s(literal 1 binary64) (*.f64 x x)) |
#s(literal 1 binary64) |
(*.f64 x x) |
x |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 10)) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* 10 (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))))) |
#s(approx (- 1 (* x x)) #s(hole binary64 1)) |
#s(approx (- 1 (* x x)) #s(hole binary64 (+ 1 (* -1 (pow x 2))))) |
#s(approx (* x x) #s(hole binary64 (pow x 2))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ -10 (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))) 10) (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 4))) (+ 10 (* 10 (/ 1 (pow x 2))))) (pow x 2)))) |
#s(approx (- 1 (* x x)) #s(hole binary64 (* -1 (pow x 2)))) |
#s(approx (- 1 (* x x)) #s(hole binary64 (* (pow x 2) (- (/ 1 (pow x 2)) 1)))) |
| Outputs |
|---|
(/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
#s(literal 10 binary64) |
(-.f64 #s(literal 1 binary64) (*.f64 x x)) |
#s(literal 1 binary64) |
(*.f64 x x) |
x |
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
#s(approx (- 1 (* x x)) #s(literal 1 binary64)) |
#s(approx (- 1 (* x x)) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
#s(approx (* x x) (*.f64 x x)) |
#s(approx x x) |
#s(approx (- 1 (* x x)) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
Compiled 29 to 22 computations (24.1% saved)
2 alts after pruning (1 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 4 | 1 | 5 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 4 | 2 | 6 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 87.9% | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
| ▶ | 9.3% | #s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
Compiled 14 to 14 computations (0% saved)
| Inputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
#s(literal 10 binary64) |
| Outputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 10)) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* 10 (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ -10 (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))) 10) (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 4))) (+ 10 (* 10 (/ 1 (pow x 2))))) (pow x 2)))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | inf | ((/ 10 (- 1 (* x x))) 10) |
| 0.0ms | x | @ | -inf | ((/ 10 (- 1 (* x x))) 10) |
| 0.0ms | x | @ | 0 | ((/ 10 (- 1 (* x x))) 10) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 38 | 184 |
| 0 | 38 | 173 |
| 1 | 259 | 170 |
| 2 | 1917 | 170 |
| 1× | iter-limit |
| 1× | unsound |
| 1× | node-limit |
| 1× | saturated |
| Inputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
#s(literal 10 binary64) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 10)) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* 10 (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (+ 10 (* (pow x 2) (+ 10 (* (pow x 2) (+ 10 (* 10 (pow x 2))))))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ -10 (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 2))) 10) (pow x 2)))) |
#s(approx (/ 10 (- 1 (* x x))) #s(hole binary64 (/ (- (* -1 (/ (+ 10 (* 10 (/ 1 (pow x 2)))) (pow x 4))) (+ 10 (* 10 (/ 1 (pow x 2))))) (pow x 2)))) |
| Outputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
#s(literal 10 binary64) |
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
Compiled 0 to 1 computations (-∞% saved)
2 alts after pruning (0 fresh and 2 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 0 | 0 | 0 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 1 | 1 |
| Total | 0 | 2 | 2 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 87.9% | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
| ✓ | 9.3% | #s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
Compiled 26 to 26 computations (0% saved)
| Inputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
(/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
| Outputs |
|---|
(/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
4 calls:
| 1.0ms | (*.f64 x x) |
| 1.0ms | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
| 1.0ms | (-.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 1.0ms | x |
| Accuracy | Segments | Branch |
|---|---|---|
| 87.9% | 1 | (*.f64 x x) |
| 87.9% | 1 | (-.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 87.9% | 1 | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
| 87.9% | 1 | x |
Compiled 13 to 13 computations (0% saved)
Total -0.0b remaining (-0%)
Threshold costs -0b (-0%)
| Inputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
| Outputs |
|---|
#s(approx (/ 10 (- 1 (* x x))) #s(literal 10 binary64)) |
4 calls:
| 1.0ms | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
| 1.0ms | (-.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 1.0ms | (*.f64 x x) |
| 1.0ms | x |
| Accuracy | Segments | Branch |
|---|---|---|
| 9.3% | 1 | (*.f64 x x) |
| 9.3% | 1 | x |
| 9.3% | 1 | (-.f64 #s(literal 1 binary64) (*.f64 x x)) |
| 9.3% | 1 | (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) |
Compiled 13 to 13 computations (0% saved)
| 1× | done |
Compiled 12 to 12 computations (0% saved)
(abs x)
Compiled 46 to 46 computations (0% saved)
Loading profile data...