Cancel like terms
Time bar (total: 980.0ms)
| 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 7 to 6 computations (14.3% saved)
| 417.0ms | 3 786× | 1 | valid |
| 97.0ms | 4 470× | 0 | valid |
adjust: 306.0ms (82.1% of total)ival-add!: 39.0ms (10.5% of total)ival-sub!: 28.0ms (7.5% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 120 | 8 | (-110395666.61322953) | 0 | - | (-.f64 (+.f64 #s(literal 1 binary64) x) x) |
| 0 | 0 | - | 0 | - | (+.f64 #s(literal 1 binary64) x) |
| 0 | 0 | - | 0 | - | #s(literal 1 binary64) |
| 0 | 0 | - | 0 | - | x |
| Operator | Subexpression | Explanation | Count | |
|---|---|---|---|---|
-.f64 | (-.f64 (+.f64 #s(literal 1 binary64) x) x) | cancellation | 128 | 0 |
| Predicted + | Predicted - | |
|---|---|---|
| + | 120 | 0 |
| - | 8 | 128 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 120 | 0 | 0 |
| - | 8 | 0 | 128 |
| number | freq |
|---|---|
| 0 | 128 |
| 1 | 128 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 1 | 0 | 0 |
| - | 0 | 0 | 0 |
| 17.0ms | 230× | 1 | valid |
| 7.0ms | 282× | 0 | valid |
Compiled 29 to 16 computations (44.8% saved)
adjust: 9.0ms (69.1% of total)ival-add!: 2.0ms (15.4% of total)ival-sub!: 2.0ms (15.4% of total)Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 8 | 18 |
| 1 | 16 | 3 |
| 2 | 31 | 3 |
| 3 | 128 | 3 |
| 4 | 788 | 3 |
| 5 | 3523 | 3 |
| 1× | node-limit |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 54.6% | (-.f64 (+.f64 #s(literal 1 binary64) x) x) |
(abs x)
Compiled 10 to 8 computations (20% saved)
| Inputs |
|---|
(-.f64 (+.f64 #s(literal 1 binary64) x) x) |
(+.f64 #s(literal 1 binary64) x) |
#s(literal 1 binary64) |
x |
| Outputs |
|---|
#s(approx (- (+ 1 x) x) #s(hole binary64 1)) |
#s(approx (+ 1 x) #s(hole binary64 1)) |
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (+ 1 x) #s(hole binary64 x)) |
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x))))) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 1.0ms | x | @ | -inf | ((- (+ 1 x) x) (+ 1 x) 1 x) |
| 0.0ms | x | @ | inf | ((- (+ 1 x) x) (+ 1 x) 1 x) |
| 0.0ms | x | @ | 0 | ((- (+ 1 x) x) (+ 1 x) 1 x) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 15 | 48 |
| 0 | 16 | 40 |
| 1 | 67 | 36 |
| 0 | 519 | 36 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | node-limit |
| 1× | iter-limit |
| Inputs |
|---|
(-.f64 (+.f64 #s(literal 1 binary64) x) x) |
(+.f64 #s(literal 1 binary64) x) |
#s(literal 1 binary64) |
x |
#s(approx (- (+ 1 x) x) #s(hole binary64 1)) |
#s(approx (+ 1 x) #s(hole binary64 1)) |
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x))) |
#s(approx x #s(hole binary64 x)) |
#s(approx (+ 1 x) #s(hole binary64 x)) |
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x))))) |
| Outputs |
|---|
#s(literal 1 binary64) |
(*.f64 (-.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal -1 binary64)) x) |
(*.f64 x (-.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal -1 binary64))) |
(/.f64 (*.f64 (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64))) x) (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64)))) |
(/.f64 (*.f64 (+.f64 (pow.f64 x #s(literal -3 binary64)) #s(literal 1 binary64)) x) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64))) (pow.f64 x #s(literal -1 binary64)))) |
(/.f64 (*.f64 x (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64)))) (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64)))) |
(/.f64 (*.f64 x (+.f64 (pow.f64 x #s(literal -3 binary64)) #s(literal 1 binary64))) (-.f64 (+.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64))) (pow.f64 x #s(literal -1 binary64)))) |
(/.f64 (-.f64 (*.f64 x x) #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) |
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1 binary64) x))) |
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))) |
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 #s(literal 1 binary64) x)) |
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x))) |
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))) |
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1 binary64) x))) |
(-.f64 x (*.f64 (neg.f64 x) (pow.f64 x #s(literal -1 binary64)))) |
(-.f64 x (*.f64 (neg.f64 (pow.f64 x #s(literal -1 binary64))) x)) |
(-.f64 x #s(literal -1 binary64)) |
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))) |
(+.f64 x #s(literal 1 binary64)) |
(+.f64 #s(literal 1 binary64) x) |
#s(literal 1 binary64) |
x |
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
#s(approx (+ 1 x) #s(literal 1 binary64)) |
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64))) |
#s(approx x x) |
#s(approx (+ 1 x) x) |
#s(approx (+ 1 x) (-.f64 x #s(literal -1 binary64))) |
Compiled 291 to 92 computations (68.4% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 27 | 1 | 28 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 28 | 1 | 29 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | #s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
Compiled 7 to 6 computations (14.3% saved)
| Inputs |
|---|
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
#s(literal 1 binary64) |
| Outputs |
|---|
#s(approx (- (+ 1 x) x) #s(hole binary64 1)) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | 0 | ((- (+ 1 x) x) 1) |
| 0.0ms | x | @ | inf | ((- (+ 1 x) x) 1) |
| 0.0ms | x | @ | -inf | ((- (+ 1 x) x) 1) |
Useful iterations: 1 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 15 |
| 0 | 5 | 15 |
| 1 | 34 | 7 |
| 0 | 307 | 7 |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | iter-limit |
| 1× | unsound |
| 1× | saturated |
| Inputs |
|---|
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
#s(literal 1 binary64) |
#s(approx (- (+ 1 x) x) #s(hole binary64 1)) |
| Outputs |
|---|
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
#s(literal 1 binary64) |
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
Compiled 14 to 6 computations (57.1% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 2 | 0 | 2 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 2 | 1 | 3 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | #s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
Compiled 19 to 14 computations (26.3% saved)
Total -29.0b remaining (-∞%)
Threshold costs -29b (-∞%)
| Inputs |
|---|
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
(-.f64 (+.f64 #s(literal 1 binary64) x) x) |
| Outputs |
|---|
#s(approx (- (+ 1 x) x) #s(literal 1 binary64)) |
2 calls:
| 1.0ms | x |
| 1.0ms | (-.f64 (+.f64 #s(literal 1 binary64) x) x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | (-.f64 (+.f64 #s(literal 1 binary64) x) x) |
| 100.0% | 1 | x |
Compiled 6 to 5 computations (16.7% saved)
| 1× | done |
Compiled 7 to 6 computations (14.3% saved)
(abs x)
Compiled 38 to 32 computations (15.8% saved)
Loading profile data...