Average Error: 0.1 → 0.1
Time: 14.9s
Precision: 64
\[\left(x \cdot \log y - z\right) - y\]
↓
\[x \cdot \log y + \left(-\left(y + z\right)\right)\]
\left(x \cdot \log y - z\right) - y
↓
x \cdot \log y + \left(-\left(y + z\right)\right)
double f(double x, double y, double z) {
        double r25729 = x;
        double r25730 = y;
        double r25731 = log(r25730);
        double r25732 = r25729 * r25731;
        double r25733 = z;
        double r25734 = r25732 - r25733;
        double r25735 = r25734 - r25730;
        return r25735;
}
↓
double f(double x, double y, double z) {
        double r25736 = x;
        double r25737 = y;
        double r25738 = log(r25737);
        double r25739 = r25736 * r25738;
        double r25740 = z;
        double r25741 = r25737 + r25740;
        double r25742 = -r25741;
        double r25743 = r25739 + r25742;
        return r25743;
}

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. Using strategy rm

  3. Applied sub-neg0.1

    \[\leadsto \color{blue}{\left(x \cdot \log y + \left(-z\right)\right)} - y\]

  4. Applied associate--l+0.1

    \[\leadsto \color{blue}{x \cdot \log y + \left(\left(-z\right) - y\right)}\]

  5. Simplified0.1

    \[\leadsto x \cdot \log y + \color{blue}{\left(-\left(y + z\right)\right)}\]

  6. Final simplification0.1

    \[\leadsto x \cdot \log y + \left(-\left(y + z\right)\right)\]

Reproduce

herbie shell --seed 2019305 
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2"
  :precision binary64
  (- (- (* x (log y)) z) y))