Average Error: 0.1 → 0.1
Time: 16.4s
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 r28301 = x;
        double r28302 = y;
        double r28303 = log(r28302);
        double r28304 = r28301 * r28303;
        double r28305 = z;
        double r28306 = r28304 - r28305;
        double r28307 = r28306 - r28302;
        return r28307;
}
↓
double f(double x, double y, double z) {
        double r28308 = x;
        double r28309 = y;
        double r28310 = log(r28309);
        double r28311 = r28308 * r28310;
        double r28312 = z;
        double r28313 = r28311 - r28312;
        double r28314 = r28313 - r28309;
        return r28314;
}

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