Average Error: 0.1 → 0.1
Time: 11.0s
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 r25120 = x;
        double r25121 = y;
        double r25122 = log(r25121);
        double r25123 = r25120 * r25122;
        double r25124 = z;
        double r25125 = r25123 - r25124;
        double r25126 = r25125 - r25121;
        return r25126;
}
↓
double f(double x, double y, double z) {
        double r25127 = x;
        double r25128 = y;
        double r25129 = log(r25128);
        double r25130 = r25127 * r25129;
        double r25131 = z;
        double r25132 = r25130 - r25131;
        double r25133 = r25132 - r25128;
        return r25133;
}

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