Average Error: 0.1 → 0.1
Time: 19.6s
Precision: 64
\[\left(x \cdot \log y - z\right) - y\]
↓
\[\left(x \cdot \log y - z\right) - y\]
\left(x \cdot \log y - z\right) - y
↓
\left(x \cdot \log y - z\right) - y
double f(double x, double y, double z) {
        double r28285 = x;
        double r28286 = y;
        double r28287 = log(r28286);
        double r28288 = r28285 * r28287;
        double r28289 = z;
        double r28290 = r28288 - r28289;
        double r28291 = r28290 - r28286;
        return r28291;
}
↓
double f(double x, double y, double z) {
        double r28292 = x;
        double r28293 = y;
        double r28294 = log(r28293);
        double r28295 = r28292 * r28294;
        double r28296 = z;
        double r28297 = r28295 - r28296;
        double r28298 = r28297 - r28293;
        return r28298;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(x \cdot \log y - z\right) - y\]

  2. Final simplification0.1

    \[\leadsto \left(x \cdot \log y - z\right) - y\]

Reproduce

herbie shell --seed 2019323 +o rules:numerics
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2"
  :precision binary64
  (- (- (* x (log y)) z) y))