Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2
Time bar (total: 899.0ms)
| 1× | search |
| Probability | Valid | Unknown | Precondition | Infinite | Domain | Can't | Iter |
|---|---|---|---|---|---|---|---|
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 0 |
| 0% | 0% | 100% | 0% | 0% | 0% | 0% | 1 |
| 100% | 50% | 0% | 0% | 0% | 50% | 0% | 2 |
Compiled 6 to 5 computations (16.7% saved)
| 422.0ms | 8 256× | 0 | valid |
ival-log: 159.0ms (58% of total)ival-mult: 106.0ms (38.7% of total)ival-true: 6.0ms (2.2% of total)ival-assert: 3.0ms (1.1% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (log.f64 x) |
| 0 | 0 | - | 0 | - | (*.f64 x (log.f64 x)) |
| 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 23 to 13 computations (43.5% saved)
ival-log: 7.0ms (65.7% of total)ival-mult: 3.0ms (28.1% of total)ival-true: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| 1× | egg-herbie |
| 32× | distribute-lft-neg-in |
| 18× | associate-*r* |
| 18× | cancel-sign-sub-inv |
| 16× | unsub-neg |
| 16× | distribute-rgt-neg-in |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 5 | 13 |
| 1 | 18 | 11 |
| 2 | 38 | 11 |
| 3 | 104 | 11 |
| 4 | 144 | 11 |
| 5 | 155 | 11 |
| 6 | 157 | 11 |
| 0 | 3 | 4 |
| 0 | 5 | 4 |
| 1 | 6 | 4 |
| 0 | 6 | 4 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(*.f64 x (log.f64 x)) |
| Outputs |
|---|
(*.f64 x (log.f64 x)) |
Compiled 5 to 3 computations (40% saved)
Compiled 1 to 1 computations (0% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 99.6% | (*.f64 x (log.f64 x)) |
Compiled 5 to 3 computations (40% saved)
| 1× | egg-herbie |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | (log.f64 x) | |
| cost-diff | 0 | (*.f64 x (log.f64 x)) |
| 4× | lower-*.f32 |
| 2× | *-commutative |
| 2× | lower-*.f64 |
| 2× | lift-*.f64 |
| 2× | lift-log.f64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 7 |
| 0 | 5 | 7 |
| 1 | 6 | 7 |
| 0 | 6 | 7 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 x (log.f64 x)) |
x |
(log.f64 x) |
| Outputs |
|---|
(*.f64 x (log.f64 x)) |
x |
(log.f64 x) |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0 | (log.f64 x) | |
| accuracy | 0.23828125 | (*.f64 x (log.f64 x)) |
| 10.0ms | 256× | 0 | valid |
Compiled 9 to 5 computations (44.4% saved)
ival-log: 3.0ms (57.9% of total)ival-mult: 2.0ms (38.6% of total)ival-true: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ()) |
#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ()) |
| Outputs |
|---|
#s(alt (* x (log x)) (taylor 0 x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (log x)) (taylor 0 x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (log x)) (taylor 0 x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (log x)) (taylor 0 x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (* x (log (/ 1 x)))) (taylor inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (* x (log (/ 1 x)))) (taylor inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (* x (log (/ 1 x)))) (taylor inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (* x (log (/ 1 x)))) (taylor inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (* x (+ (log -1) (* -1 (log (/ -1 x))))) (taylor -inf x) (#s(alt (*.f64 x (log.f64 x)) (patch (*.f64 x (log.f64 x)) #<representation binary64>) () ())) ()) |
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (log x) (taylor 0 x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (* -1 (log (/ 1 x))) (taylor inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
#s(alt (+ (log -1) (* -1 (log (/ -1 x)))) (taylor -inf x) (#s(alt (log.f64 x) (patch (log.f64 x) #<representation binary64>) () ())) ()) |
6 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 64.0ms | x | @ | 0 | (* x (log x)) |
| 36.0ms | x | @ | -inf | (* x (log x)) |
| 7.0ms | x | @ | inf | (* x (log x)) |
| 0.0ms | x | @ | 0 | (log x) |
| 0.0ms | x | @ | -inf | (log x) |
| 1× | egg-herbie |
| 320× | lower-fma.f64 |
| 320× | lower-fma.f32 |
| 224× | lower-*.f64 |
| 224× | lower-*.f32 |
| 104× | unsub-neg |
Useful iterations: 6 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 16 | 120 |
| 1 | 37 | 112 |
| 2 | 63 | 112 |
| 3 | 104 | 112 |
| 4 | 167 | 112 |
| 5 | 298 | 112 |
| 6 | 553 | 104 |
| 7 | 612 | 104 |
| 8 | 616 | 104 |
| 9 | 620 | 104 |
| 0 | 620 | 104 |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(* x (log x)) |
(* x (log x)) |
(* x (log x)) |
(* x (log x)) |
(* -1 (* x (log (/ 1 x)))) |
(* -1 (* x (log (/ 1 x)))) |
(* -1 (* x (log (/ 1 x)))) |
(* -1 (* x (log (/ 1 x)))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(log x) |
(log x) |
(log x) |
(log x) |
(* -1 (log (/ 1 x))) |
(* -1 (log (/ 1 x))) |
(* -1 (log (/ 1 x))) |
(* -1 (log (/ 1 x))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
| Outputs |
|---|
(* x (log x)) |
(*.f64 x (log.f64 x)) |
(* x (log x)) |
(*.f64 x (log.f64 x)) |
(* x (log x)) |
(*.f64 x (log.f64 x)) |
(* x (log x)) |
(*.f64 x (log.f64 x)) |
(* -1 (* x (log (/ 1 x)))) |
(*.f64 x (log.f64 x)) |
(* -1 (* x (log (/ 1 x)))) |
(*.f64 x (log.f64 x)) |
(* -1 (* x (log (/ 1 x)))) |
(*.f64 x (log.f64 x)) |
(* -1 (* x (log (/ 1 x)))) |
(*.f64 x (log.f64 x)) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(*.f64 x (+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x)))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(*.f64 x (+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x)))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(*.f64 x (+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x)))) |
(* x (+ (log -1) (* -1 (log (/ -1 x))))) |
(*.f64 x (+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x)))) |
(log x) |
(log.f64 x) |
(log x) |
(log.f64 x) |
(log x) |
(log.f64 x) |
(log x) |
(log.f64 x) |
(* -1 (log (/ 1 x))) |
(log.f64 x) |
(* -1 (log (/ 1 x))) |
(log.f64 x) |
(* -1 (log (/ 1 x))) |
(log.f64 x) |
(* -1 (log (/ 1 x))) |
(log.f64 x) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x))) |
(+ (log -1) (* -1 (log (/ -1 x)))) |
(+.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (neg.f64 x))) |
| 4× | lower-*.f32 |
| 2× | lower-*.f64 |
| 2× | *-commutative |
| 2× | lift-*.f64 |
| 2× | lift-log.f64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 6 |
| 0 | 5 | 6 |
| 1 | 6 | 6 |
| 0 | 6 | 6 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 x (log.f64 x)) |
(log.f64 x) |
| Outputs |
|---|
(*.f64 x (log.f64 x)) |
(*.f64 (log.f64 x) x) |
(log.f64 x) |
Compiled 165 to 10 computations (93.9% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 27 | 0 | 27 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 27 | 1 | 28 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 99.6% | (*.f64 x (log.f64 x)) |
Compiled 10 to 6 computations (40% saved)
| 1× | egg-herbie |
| 2× | *-commutative_binary64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 3 | 4 |
| 1 | 4 | 4 |
| 1× | saturated |
| Inputs |
|---|
(*.f64 x (log.f64 x)) |
| Outputs |
|---|
(*.f64 x (log.f64 x)) |
| 1× | done |
Compiled 5 to 3 computations (40% saved)
Compiled 20 to 12 computations (40% saved)
Loading profile data...