Average Error: 0.1 → 0.1
Time: 10.8s
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 r25929 = x;
        double r25930 = y;
        double r25931 = log(r25930);
        double r25932 = r25929 * r25931;
        double r25933 = z;
        double r25934 = r25932 - r25933;
        double r25935 = r25934 - r25930;
        return r25935;
}
↓
double f(double x, double y, double z) {
        double r25936 = x;
        double r25937 = y;
        double r25938 = log(r25937);
        double r25939 = r25936 * r25938;
        double r25940 = z;
        double r25941 = r25939 - r25940;
        double r25942 = r25941 - r25937;
        return r25942;
}

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