Average Error: 0.1 → 0.1
Time: 5.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 r25301 = x;
        double r25302 = y;
        double r25303 = log(r25302);
        double r25304 = r25301 * r25303;
        double r25305 = z;
        double r25306 = r25304 - r25305;
        double r25307 = r25306 - r25302;
        return r25307;
}
↓
double f(double x, double y, double z) {
        double r25308 = x;
        double r25309 = y;
        double r25310 = log(r25309);
        double r25311 = r25308 * r25310;
        double r25312 = z;
        double r25313 = r25311 - r25312;
        double r25314 = r25313 - r25309;
        return r25314;
}

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