Average Error: 0.1 → 0.1
Time: 17.4s
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 r30934 = x;
        double r30935 = y;
        double r30936 = log(r30935);
        double r30937 = r30934 * r30936;
        double r30938 = z;
        double r30939 = r30937 - r30938;
        double r30940 = r30939 - r30935;
        return r30940;
}
↓
double f(double x, double y, double z) {
        double r30941 = x;
        double r30942 = y;
        double r30943 = log(r30942);
        double r30944 = r30941 * r30943;
        double r30945 = z;
        double r30946 = r30944 - r30945;
        double r30947 = r30946 - r30942;
        return r30947;
}

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