Average Error: 0.1 → 0.1
Time: 17.3s
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 r32578 = x;
        double r32579 = y;
        double r32580 = log(r32579);
        double r32581 = r32578 * r32580;
        double r32582 = z;
        double r32583 = r32581 - r32582;
        double r32584 = r32583 - r32579;
        return r32584;
}
↓
double f(double x, double y, double z) {
        double r32585 = x;
        double r32586 = y;
        double r32587 = log(r32586);
        double r32588 = r32585 * r32587;
        double r32589 = z;
        double r32590 = r32588 - r32589;
        double r32591 = r32590 - r32586;
        return r32591;
}

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