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 r21295 = x;
        double r21296 = y;
        double r21297 = log(r21296);
        double r21298 = r21295 * r21297;
        double r21299 = z;
        double r21300 = r21298 - r21299;
        double r21301 = r21300 - r21296;
        return r21301;
}
↓
double f(double x, double y, double z) {
        double r21302 = x;
        double r21303 = y;
        double r21304 = log(r21303);
        double r21305 = r21302 * r21304;
        double r21306 = z;
        double r21307 = r21305 - r21306;
        double r21308 = r21307 - r21303;
        return r21308;
}

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