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 r38206 = x;
        double r38207 = y;
        double r38208 = log(r38207);
        double r38209 = r38206 * r38208;
        double r38210 = z;
        double r38211 = r38209 - r38210;
        double r38212 = r38211 - r38207;
        return r38212;
}
↓
double f(double x, double y, double z) {
        double r38213 = x;
        double r38214 = y;
        double r38215 = log(r38214);
        double r38216 = r38213 * r38215;
        double r38217 = z;
        double r38218 = r38216 - r38217;
        double r38219 = r38218 - r38214;
        return r38219;
}

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 
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2"
  :precision binary64
  (- (- (* x (log y)) z) y))