Average Error: 0.0 → 0.0
Time: 59.8s
Precision: 64
\[x \cdot e^{y \cdot y}\]
↓
\[e^{y \cdot y} \cdot x\]
x \cdot e^{y \cdot y}
↓
e^{y \cdot y} \cdot x
double f(double x, double y) {
        double r35783620 = x;
        double r35783621 = y;
        double r35783622 = r35783621 * r35783621;
        double r35783623 = exp(r35783622);
        double r35783624 = r35783620 * r35783623;
        return r35783624;
}
↓
double f(double x, double y) {
        double r35783625 = y;
        double r35783626 = r35783625 * r35783625;
        double r35783627 = exp(r35783626);
        double r35783628 = x;
        double r35783629 = r35783627 * r35783628;
        return r35783629;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 0.0

    \[x \cdot e^{y \cdot y}\]

  2. Final simplification0.0

    \[\leadsto e^{y \cdot y} \cdot x\]

Reproduce

herbie shell --seed 2019200 
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"

  :herbie-target
  (* x (pow (exp y) y))

  (* x (exp (* y y))))