Average Error: 0.1 → 0.1
Time: 12.5s
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 r25899 = x;
        double r25900 = y;
        double r25901 = log(r25900);
        double r25902 = r25899 * r25901;
        double r25903 = z;
        double r25904 = r25902 - r25903;
        double r25905 = r25904 - r25900;
        return r25905;
}
↓
double f(double x, double y, double z) {
        double r25906 = x;
        double r25907 = y;
        double r25908 = log(r25907);
        double r25909 = r25906 * r25908;
        double r25910 = z;
        double r25911 = r25909 - r25910;
        double r25912 = r25911 - r25907;
        return r25912;
}

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