Average Error: 0.1 → 0.1
Time: 13.7s
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 r31355 = x;
        double r31356 = y;
        double r31357 = log(r31356);
        double r31358 = r31355 * r31357;
        double r31359 = z;
        double r31360 = r31358 - r31359;
        double r31361 = r31360 - r31356;
        return r31361;
}
↓
double f(double x, double y, double z) {
        double r31362 = x;
        double r31363 = y;
        double r31364 = log(r31363);
        double r31365 = r31362 * r31364;
        double r31366 = z;
        double r31367 = r31365 - r31366;
        double r31368 = r31367 - r31363;
        return r31368;
}

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