Average Error: 0.0 → 0.0
Time: 16.6s
Precision: 64
\[e^{\left(x + y \cdot \log y\right) - z}\]
↓
\[e^{\left(x + y \cdot \log y\right) - z}\]
e^{\left(x + y \cdot \log y\right) - z}
↓
e^{\left(x + y \cdot \log y\right) - z}
double f(double x, double y, double z) {
        double r179004 = x;
        double r179005 = y;
        double r179006 = log(r179005);
        double r179007 = r179005 * r179006;
        double r179008 = r179004 + r179007;
        double r179009 = z;
        double r179010 = r179008 - r179009;
        double r179011 = exp(r179010);
        return r179011;
}
↓
double f(double x, double y, double z) {
        double r179012 = x;
        double r179013 = y;
        double r179014 = log(r179013);
        double r179015 = r179013 * r179014;
        double r179016 = r179012 + r179015;
        double r179017 = z;
        double r179018 = r179016 - r179017;
        double r179019 = exp(r179018);
        return r179019;
}

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

Target

Original0.0
Target0.0
Herbie0.0
\[e^{\left(x - z\right) + \log y \cdot y}\]

Derivation

  1. Initial program 0.0

    \[e^{\left(x + y \cdot \log y\right) - z}\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019303 +o rules:numerics
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson.Internal:probability from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (exp (+ (- x z) (* (log y) y)))

  (exp (- (+ x (* y (log y))) z)))