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 r33570 = x;
        double r33571 = y;
        double r33572 = log(r33571);
        double r33573 = r33570 * r33572;
        double r33574 = z;
        double r33575 = r33573 - r33574;
        double r33576 = r33575 - r33571;
        return r33576;
}
↓
double f(double x, double y, double z) {
        double r33577 = x;
        double r33578 = y;
        double r33579 = log(r33578);
        double r33580 = r33577 * r33579;
        double r33581 = z;
        double r33582 = r33580 - r33581;
        double r33583 = r33582 - r33578;
        return r33583;
}

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