Average Error: 0.1 → 0.1
Time: 10.3s
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 r39900 = x;
        double r39901 = y;
        double r39902 = log(r39901);
        double r39903 = r39900 * r39902;
        double r39904 = z;
        double r39905 = r39903 - r39904;
        double r39906 = r39905 - r39901;
        return r39906;
}
↓
double f(double x, double y, double z) {
        double r39907 = x;
        double r39908 = y;
        double r39909 = log(r39908);
        double r39910 = r39907 * r39909;
        double r39911 = z;
        double r39912 = r39910 - r39911;
        double r39913 = r39912 - r39908;
        return r39913;
}

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 2019297 
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2"
  :precision binary64
  (- (- (* x (log y)) z) y))