Average Error: 0.1 → 0.1
Time: 5.1s
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 r20955 = x;
        double r20956 = y;
        double r20957 = log(r20956);
        double r20958 = r20955 * r20957;
        double r20959 = z;
        double r20960 = r20958 - r20959;
        double r20961 = r20960 - r20956;
        return r20961;
}
↓
double f(double x, double y, double z) {
        double r20962 = x;
        double r20963 = y;
        double r20964 = log(r20963);
        double r20965 = r20962 * r20964;
        double r20966 = z;
        double r20967 = r20965 - r20966;
        double r20968 = r20967 - r20963;
        return r20968;
}

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