Average Error: 0.1 → 0.1
Time: 12.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 r29281 = x;
        double r29282 = y;
        double r29283 = log(r29282);
        double r29284 = r29281 * r29283;
        double r29285 = z;
        double r29286 = r29284 - r29285;
        double r29287 = r29286 - r29282;
        return r29287;
}
↓
double f(double x, double y, double z) {
        double r29288 = x;
        double r29289 = y;
        double r29290 = log(r29289);
        double r29291 = r29288 * r29290;
        double r29292 = z;
        double r29293 = r29291 - r29292;
        double r29294 = r29293 - r29289;
        return r29294;
}

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