Average Error: 0.1 → 0.1
Time: 4.8s
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 r20746 = x;
        double r20747 = y;
        double r20748 = log(r20747);
        double r20749 = r20746 * r20748;
        double r20750 = z;
        double r20751 = r20749 - r20750;
        double r20752 = r20751 - r20747;
        return r20752;
}
↓
double f(double x, double y, double z) {
        double r20753 = x;
        double r20754 = y;
        double r20755 = log(r20754);
        double r20756 = r20753 * r20755;
        double r20757 = z;
        double r20758 = r20756 - r20757;
        double r20759 = r20758 - r20754;
        return r20759;
}

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