Average Error: 0.1 → 0.1
Time: 5.6s
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 r25725 = x;
        double r25726 = y;
        double r25727 = log(r25726);
        double r25728 = r25725 * r25727;
        double r25729 = z;
        double r25730 = r25728 - r25729;
        double r25731 = r25730 - r25726;
        return r25731;
}
↓
double f(double x, double y, double z) {
        double r25732 = x;
        double r25733 = y;
        double r25734 = log(r25733);
        double r25735 = r25732 * r25734;
        double r25736 = z;
        double r25737 = r25735 - r25736;
        double r25738 = r25737 - r25733;
        return r25738;
}

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