Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2

Time bar (total: 1.4s)

analyze0.0ms (0%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
0%0%100%0%0%0%0%1
100%50%0%0%0%50%0%2
Compiler

Compiled 6 to 4 computations (33.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
ival-log: 0.0ms (0% of total)
ival-mult: 0.0ms (0% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

sample1.1s (74%)

Results
886.0ms8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 202.0ms
ival-log: 109.0ms (54% of total)
ival-mult: 83.0ms (41.1% of total)
const: 7.0ms (3.5% of total)
backward-pass: 3.0ms (1.5% of total)
Bogosity

preprocess23.0ms (1.6%)

Algorithm
2×egg-herbie
Rules
180×fnmadd-define
162×fma-define
120×fnmsub-define
120×fmsub-define
84×sum3-define
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0717
12115
24115
311715
424915
552115
661715
762715
864015
966015
1066815
034
144
044
Stop Event
1×iter limit
1×saturated
1×saturated
Calls
Call 1
Inputs
(* x (log x))
Outputs
(* x (log x))
(*.f64 x (log.f64 x))
Call 2
Inputs
(* x (log x))
(* (neg x) (log (neg x)))
(neg (* (neg x) (log (neg x))))
Outputs
(* x (log x))
(* (neg x) (log (neg x)))
(neg (* (neg x) (log (neg x))))
(* x (log (neg x)))

explain42.0ms (2.9%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-x
00-0-(*.f64 x (log.f64 x))
00-0-(log.f64 x)
Results
25.0ms512×0valid
Compiler

Compiled 23 to 11 computations (52.2% saved)

Precisions
Click to see histograms. Total time spent on operations: 12.0ms
ival-log: 7.0ms (59.7% of total)
ival-mult: 4.0ms (34.1% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 5 to 3 computations (40% saved)

prune1.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
▶99.6%
(*.f64 x (log.f64 x))
Compiler

Compiled 5 to 3 computations (40% saved)

simplify3.0ms (0.2%)

Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(log.f64 x)
✓cost-diff0
(*.f64 x (log.f64 x))
Rules
4×*-lowering-*.f32
4×*-lowering-*.f64
2×*-commutative
2×log-lowering-log.f64
2×log-lowering-log.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
037
147
047
Stop Event
1×iter limit
1×saturated
Calls
Call 1
Inputs
(* x (log x))
x
(log x)
Outputs
(* x (log x))
(*.f64 x (log.f64 x))
x
(log x)
(log.f64 x)

localize18.0ms (1.2%)

Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓accuracy100.0%
(log.f64 x)
✓accuracy99.6%
(*.f64 x (log.f64 x))
Results
12.0ms256×0valid
Compiler

Compiled 9 to 4 computations (55.6% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-log: 3.0ms (49.4% of total)
ival-mult: 2.0ms (32.9% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

series143.0ms (9.9%)

Counts
2 → 24
Calls
Call 1
Inputs
#<alt (* x (log x))>
#<alt (log x)>
Outputs
#<alt (* x (log x))>
#<alt (* x (log x))>
#<alt (* x (log x))>
#<alt (* x (log x))>
#<alt (* -1 (* x (log (/ 1 x))))>
#<alt (* -1 (* x (log (/ 1 x))))>
#<alt (* -1 (* x (log (/ 1 x))))>
#<alt (* -1 (* x (log (/ 1 x))))>
#<alt (* x (+ (log -1) (* -1 (log (/ -1 x)))))>
#<alt (* x (+ (log -1) (* -1 (log (/ -1 x)))))>
#<alt (* x (+ (log -1) (* -1 (log (/ -1 x)))))>
#<alt (* x (+ (log -1) (* -1 (log (/ -1 x)))))>
#<alt (log x)>
#<alt (log x)>
#<alt (log x)>
#<alt (log x)>
#<alt (* -1 (log (/ 1 x)))>
#<alt (* -1 (log (/ 1 x)))>
#<alt (* -1 (log (/ 1 x)))>
#<alt (* -1 (log (/ 1 x)))>
#<alt (+ (log -1) (* -1 (log (/ -1 x))))>
#<alt (+ (log -1) (* -1 (log (/ -1 x))))>
#<alt (+ (log -1) (* -1 (log (/ -1 x))))>
#<alt (+ (log -1) (* -1 (log (/ -1 x))))>
Calls

6 calls:

TimeVariablePointExpression
95.0ms
x
@0
(* x (log x))
41.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)

rewrite36.0ms (2.5%)

Algorithm
1×batch-egg-rewrite
Rules
4×*-lowering-*.f32
4×*-lowering-*.f64
2×*-commutative
2×log-lowering-log.f64
2×log-lowering-log.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
036
146
046
Stop Event
1×iter limit
1×saturated
Counts
2 → 3
Calls
Call 1
Inputs
(* x (log x))
(log x)
Outputs
(*.f64 x (log.f64 x))
(*.f64 (log.f64 x) x)
(log.f64 x)

simplify50.0ms (3.4%)

Algorithm
1×egg-herbie
Rules
992×sum5-define
642×fnmadd-define
524×fma-define
436×sum3-define
392×fma-lowering-fma.f32
Iterations

Useful iterations: 6 (0.0ms)

IterNodesCost
016120
138112
269112
3119112
4185112
5398112
6940104
72415104
82516104
92540104
102556104
02556104
Stop Event
1×iter limit
1×saturated
Counts
24 → 24
Calls
Call 1
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 (/.f64 #s(literal -1 binary64) x))))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 x (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 x (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x))))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 x (-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) 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 (/.f64 #s(literal -1 binary64) x)))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 #s(literal -1 binary64)) (log.f64 (/.f64 #s(literal -1 binary64) x)))

eval2.0ms (0.1%)

Compiler

Compiled 149 to 10 computations (93.3% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New27027
Fresh000
Picked011
Done000
Total27128
Accuracy
99.6%
Counts
28 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓99.6%
(*.f64 x (log.f64 x))
Compiler

Compiled 10 to 6 computations (40% saved)

simplify6.0ms (0.4%)

Algorithm
1×egg-herbie
Rules
2×*-commutative_binary64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
034
144
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 x (log.f64 x))
Outputs
(*.f64 x (log.f64 x))

soundness0.0ms (0%)

Stop Event
1×done
Compiler

Compiled 5 to 3 computations (40% saved)

preprocess49.0ms (3.4%)

Compiler

Compiled 20 to 12 computations (40% saved)

end0.0ms (0%)

Profiling

Loading profile data...