Time bar (total: 1.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 7 to 6 computations (14.3% saved)
531.0ms | 8 256× | 0 | valid |
ival-mult
: 223.0ms (93.1% of total)exact
: 10.0ms (4.2% of total)adjust
: 3.0ms (1.3% of total)ival-assert
: 3.0ms (1.3% of total)Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
---|---|---|---|---|---|
0 | 0 | - | 0 | - | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
0 | 0 | - | 0 | - | #s(literal 3 binary64) |
0 | 0 | - | 0 | - | (*.f64 x #s(literal 3 binary64)) |
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 |
38.0ms | 512× | 0 | valid |
Compiled 29 to 16 computations (44.8% saved)
ival-mult
: 20.0ms (91.6% of total)ival-true
: 1.0ms (4.6% 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 | 8 | 18 |
1 | 21 | 15 |
2 | 49 | 15 |
3 | 70 | 15 |
4 | 85 | 15 |
5 | 123 | 15 |
6 | 145 | 15 |
0 | 4 | 5 |
0 | 6 | 5 |
1 | 9 | 5 |
2 | 12 | 5 |
3 | 16 | 5 |
4 | 37 | 5 |
5 | 73 | 5 |
6 | 105 | 5 |
7 | 123 | 5 |
8 | 123 | 5 |
0 | 123 | 5 |
1× | iter limit |
1× | saturated |
1× | iter limit |
1× | saturated |
Inputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Outputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
(*.f64 (*.f64 #s(literal 3 binary64) x) x) |
(abs x)
Compiled 5 to 4 computations (20% saved)
Compiled 0 to 1 computations (-∞% saved)
Status | Accuracy | Program |
---|---|---|
▶ | 99.7% | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Compiled 5 to 4 computations (20% saved)
Inputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
(*.f64 x #s(literal 3 binary64)) |
x |
#s(literal 3 binary64) |
Outputs |
---|
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2)))) |
#s(approx (* x 3) #s(hole binary64 (* 3 x))) |
#s(approx x #s(hole binary64 x)) |
3 calls:
Time | Variable | Point | Expression | |
---|---|---|---|---|
2.0ms | x | @ | -inf | ((* (* x 3) x) (* x 3) x 3) |
2.0ms | x | @ | inf | ((* (* x 3) x) (* x 3) x 3) |
1.0ms | x | @ | 0 | ((* (* x 3) x) (* x 3) x 3) |
Useful iterations: 0 (0.0ms)
Iter | Nodes | Cost |
---|---|---|
0 | 13 | 31 |
0 | 15 | 31 |
1 | 28 | 31 |
0 | 73 | 31 |
1× | iter limit |
1× | iter limit |
1× | iter limit |
1× | unsound |
1× | iter limit |
Inputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
(*.f64 x #s(literal 3 binary64)) |
x |
#s(literal 3 binary64) |
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2)))) |
#s(approx (* x 3) #s(hole binary64 (* 3 x))) |
#s(approx x #s(hole binary64 x)) |
Outputs |
---|
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
(*.f64 (*.f64 #s(literal 3 binary64) x) x) |
(*.f64 #s(literal 3 binary64) (*.f64 x x)) |
(*.f64 x (*.f64 #s(literal 3 binary64) x)) |
(*.f64 #s(literal 3 binary64) x) |
(*.f64 x #s(literal 3 binary64)) |
x |
#s(literal 3 binary64) |
#s(approx (* (* x 3) x) (*.f64 (*.f64 x x) #s(literal 3 binary64))) |
#s(approx (* x 3) (*.f64 #s(literal 3 binary64) x)) |
#s(approx x x) |
Compiled 79 to 20 computations (74.7% saved)
2 alts after pruning (1 fresh and 1 done)
Pruned | Kept | Total | |
---|---|---|---|
New | 12 | 1 | 13 |
Fresh | 0 | 0 | 0 |
Picked | 0 | 1 | 1 |
Done | 0 | 0 | 0 |
Total | 12 | 2 | 14 |
Status | Accuracy | Program |
---|---|---|
▶ | 99.7% | (*.f64 (*.f64 x x) #s(literal 3 binary64)) |
✓ | 99.7% | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Compiled 10 to 8 computations (20% saved)
Inputs |
---|
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
(*.f64 x x) |
x |
#s(literal 3 binary64) |
Outputs |
---|
#s(approx (* (* x x) 3) #s(hole binary64 (* 3 (pow x 2)))) |
#s(approx (* x x) #s(hole binary64 (pow x 2))) |
#s(approx x #s(hole binary64 x)) |
3 calls:
Time | Variable | Point | Expression | |
---|---|---|---|---|
1.0ms | x | @ | -inf | ((* (* x x) 3) (* x x) x 3) |
1.0ms | x | @ | inf | ((* (* x x) 3) (* x x) x 3) |
1.0ms | x | @ | 0 | ((* (* x x) 3) (* x x) x 3) |
Useful iterations: 0 (0.0ms)
Iter | Nodes | Cost |
---|---|---|
0 | 12 | 31 |
0 | 14 | 31 |
1 | 31 | 31 |
0 | 97 | 31 |
1× | iter limit |
1× | iter limit |
1× | iter limit |
1× | unsound |
1× | iter limit |
Inputs |
---|
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
(*.f64 x x) |
x |
#s(literal 3 binary64) |
#s(approx (* (* x x) 3) #s(hole binary64 (* 3 (pow x 2)))) |
#s(approx (* x x) #s(hole binary64 (pow x 2))) |
#s(approx x #s(hole binary64 x)) |
Outputs |
---|
(*.f64 (*.f64 #s(literal 3 binary64) (neg.f64 x)) (neg.f64 x)) |
(*.f64 (*.f64 #s(literal 3 binary64) (fabs.f64 x)) (fabs.f64 x)) |
(*.f64 (*.f64 #s(literal 3 binary64) x) x) |
(*.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 3 binary64))) |
(*.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 3 binary64))) |
(*.f64 #s(literal 3 binary64) (*.f64 x x)) |
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
(*.f64 x (*.f64 #s(literal 3 binary64) x)) |
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x))) |
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x))) |
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x))) |
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x))) |
(*.f64 (neg.f64 x) (neg.f64 x)) |
(*.f64 (fabs.f64 x) (fabs.f64 x)) |
(*.f64 x x) |
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64)) |
(pow.f64 (neg.f64 x) #s(literal 2 binary64)) |
(pow.f64 (fabs.f64 x) #s(literal 2 binary64)) |
(pow.f64 (*.f64 x x) #s(literal 1 binary64)) |
(pow.f64 x #s(literal 2 binary64)) |
(neg.f64 (*.f64 (neg.f64 x) x)) |
(neg.f64 (*.f64 x (neg.f64 x))) |
(fabs.f64 (*.f64 x x)) |
(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)))) |
x |
#s(literal 3 binary64) |
#s(approx (* (* x x) 3) (*.f64 #s(literal 3 binary64) (*.f64 x x))) |
#s(approx (* x x) (*.f64 x x)) |
#s(approx x x) |
Compiled 223 to 73 computations (67.3% saved)
2 alts after pruning (0 fresh and 2 done)
Pruned | Kept | Total | |
---|---|---|---|
New | 32 | 0 | 32 |
Fresh | 0 | 0 | 0 |
Picked | 0 | 1 | 1 |
Done | 0 | 1 | 1 |
Total | 32 | 2 | 34 |
Status | Accuracy | Program |
---|---|---|
✓ | 99.7% | (*.f64 (*.f64 x x) #s(literal 3 binary64)) |
✓ | 99.7% | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Compiled 20 to 14 computations (30% saved)
Inputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
Outputs |
---|
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
2 calls:
2.0ms | x |
2.0ms | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Accuracy | Segments | Branch |
---|---|---|
99.7% | 1 | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
99.7% | 1 | x |
Compiled 6 to 5 computations (16.7% saved)
Total 0.0b remaining (0%)
Threshold costs 0b (0%)
Inputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Outputs |
---|
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
2 calls:
2.0ms | x |
1.0ms | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Accuracy | Segments | Branch |
---|---|---|
99.7% | 1 | (*.f64 (*.f64 x #s(literal 3 binary64)) x) |
99.7% | 1 | x |
Compiled 6 to 5 computations (16.7% saved)
Useful iterations: 0 (0.0ms)
Iter | Nodes | Cost |
---|---|---|
0 | 6 | 10 |
1× | saturated |
Inputs |
---|
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
Outputs |
---|
(*.f64 (*.f64 x x) #s(literal 3 binary64)) |
(*.f64 (*.f64 x #s(literal 3 binary64)) x) |
1× | done |
Compiled 10 to 6 computations (40% saved)
(abs x)
Compiled 50 to 36 computations (28% saved)
Loading profile data...