Average Error: 0.1 → 0.1
Time: 8.9s
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 r23794 = x;
        double r23795 = y;
        double r23796 = log(r23795);
        double r23797 = r23794 * r23796;
        double r23798 = z;
        double r23799 = r23797 - r23798;
        double r23800 = r23799 - r23795;
        return r23800;
}
↓
double f(double x, double y, double z) {
        double r23801 = x;
        double r23802 = y;
        double r23803 = log(r23802);
        double r23804 = r23801 * r23803;
        double r23805 = z;
        double r23806 = r23804 - r23805;
        double r23807 = r23806 - r23802;
        return r23807;
}

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