Average Error: 0.1 → 0.1
Time: 14.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 r22617 = x;
        double r22618 = y;
        double r22619 = log(r22618);
        double r22620 = r22617 * r22619;
        double r22621 = z;
        double r22622 = r22620 - r22621;
        double r22623 = r22622 - r22618;
        return r22623;
}
↓
double f(double x, double y, double z) {
        double r22624 = x;
        double r22625 = y;
        double r22626 = log(r22625);
        double r22627 = r22624 * r22626;
        double r22628 = z;
        double r22629 = r22627 - r22628;
        double r22630 = r22629 - r22625;
        return r22630;
}

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