Average Error: 0.1 → 0.1
Time: 17.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 r31715 = x;
        double r31716 = y;
        double r31717 = log(r31716);
        double r31718 = r31715 * r31717;
        double r31719 = z;
        double r31720 = r31718 - r31719;
        double r31721 = r31720 - r31716;
        return r31721;
}
↓
double f(double x, double y, double z) {
        double r31722 = x;
        double r31723 = y;
        double r31724 = log(r31723);
        double r31725 = r31722 * r31724;
        double r31726 = z;
        double r31727 = r31725 - r31726;
        double r31728 = r31727 - r31723;
        return r31728;
}

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