Average Error: 0.1 → 0.1
Time: 4.7s
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 r31257 = x;
        double r31258 = y;
        double r31259 = log(r31258);
        double r31260 = r31257 * r31259;
        double r31261 = z;
        double r31262 = r31260 - r31261;
        double r31263 = r31262 - r31258;
        return r31263;
}
↓
double f(double x, double y, double z) {
        double r31264 = x;
        double r31265 = y;
        double r31266 = log(r31265);
        double r31267 = r31264 * r31266;
        double r31268 = z;
        double r31269 = r31267 - r31268;
        double r31270 = r31269 - r31265;
        return r31270;
}

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