Average Error: 0.0 → 0.0
Time: 20.8s
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 r18233201 = x;
        double r18233202 = y;
        double r18233203 = log(r18233202);
        double r18233204 = r18233202 * r18233203;
        double r18233205 = r18233201 + r18233204;
        double r18233206 = z;
        double r18233207 = r18233205 - r18233206;
        double r18233208 = exp(r18233207);
        return r18233208;
}
↓
double f(double x, double y, double z) {
        double r18233209 = x;
        double r18233210 = y;
        double r18233211 = log(r18233210);
        double r18233212 = r18233210 * r18233211;
        double r18233213 = r18233209 + r18233212;
        double r18233214 = z;
        double r18233215 = r18233213 - r18233214;
        double r18233216 = exp(r18233215);
        return r18233216;
}

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

  3. Applied +-commutative0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019171 
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson.Internal:probability from math-functions-0.1.5.2"

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

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