Average Error: 0.1 → 0.1
Time: 9.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 r31579 = x;
        double r31580 = y;
        double r31581 = log(r31580);
        double r31582 = r31579 * r31581;
        double r31583 = z;
        double r31584 = r31582 - r31583;
        double r31585 = r31584 - r31580;
        return r31585;
}
↓
double f(double x, double y, double z) {
        double r31586 = x;
        double r31587 = y;
        double r31588 = log(r31587);
        double r31589 = r31586 * r31588;
        double r31590 = z;
        double r31591 = r31589 - r31590;
        double r31592 = r31591 - r31587;
        return r31592;
}

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