Average Error: 0.1 → 0.1
Time: 4.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 r22420 = x;
        double r22421 = y;
        double r22422 = log(r22421);
        double r22423 = r22420 * r22422;
        double r22424 = z;
        double r22425 = r22423 - r22424;
        double r22426 = r22425 - r22421;
        return r22426;
}
↓
double f(double x, double y, double z) {
        double r22427 = x;
        double r22428 = y;
        double r22429 = log(r22428);
        double r22430 = r22427 * r22429;
        double r22431 = z;
        double r22432 = r22430 - r22431;
        double r22433 = r22432 - r22428;
        return r22433;
}

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