Average Error: 0.1 → 0.1
Time: 23.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 r34168 = x;
        double r34169 = y;
        double r34170 = log(r34169);
        double r34171 = r34168 * r34170;
        double r34172 = z;
        double r34173 = r34171 - r34172;
        double r34174 = r34173 - r34169;
        return r34174;
}
↓
double f(double x, double y, double z) {
        double r34175 = x;
        double r34176 = y;
        double r34177 = log(r34176);
        double r34178 = r34175 * r34177;
        double r34179 = z;
        double r34180 = r34178 - r34179;
        double r34181 = r34180 - r34176;
        return r34181;
}

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