Average Error: 0.1 → 0.1
Time: 4.9s
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 r29417 = x;
        double r29418 = y;
        double r29419 = log(r29418);
        double r29420 = r29417 * r29419;
        double r29421 = z;
        double r29422 = r29420 - r29421;
        double r29423 = r29422 - r29418;
        return r29423;
}
↓
double f(double x, double y, double z) {
        double r29424 = x;
        double r29425 = y;
        double r29426 = log(r29425);
        double r29427 = r29424 * r29426;
        double r29428 = z;
        double r29429 = r29427 - r29428;
        double r29430 = r29429 - r29425;
        return r29430;
}

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 2020002 +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))