Average Error: 0.1 → 0.1
Time: 18.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 r31324 = x;
        double r31325 = y;
        double r31326 = log(r31325);
        double r31327 = r31324 * r31326;
        double r31328 = z;
        double r31329 = r31327 - r31328;
        double r31330 = r31329 - r31325;
        return r31330;
}
↓
double f(double x, double y, double z) {
        double r31331 = x;
        double r31332 = y;
        double r31333 = log(r31332);
        double r31334 = r31331 * r31333;
        double r31335 = z;
        double r31336 = r31334 - r31335;
        double r31337 = r31336 - r31332;
        return r31337;
}

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