Average Error: 5.8 → 5.8
Time: 11.7s
Precision: 64
\[x \cdot \left(1 + y \cdot y\right)\]
↓
\[x \cdot \left(1 + y \cdot y\right)\]
x \cdot \left(1 + y \cdot y\right)
↓
x \cdot \left(1 + y \cdot y\right)
double f(double x, double y) {
        double r330498 = x;
        double r330499 = 1.0;
        double r330500 = y;
        double r330501 = r330500 * r330500;
        double r330502 = r330499 + r330501;
        double r330503 = r330498 * r330502;
        return r330503;
}
↓
double f(double x, double y) {
        double r330504 = x;
        double r330505 = 1.0;
        double r330506 = y;
        double r330507 = r330506 * r330506;
        double r330508 = r330505 + r330507;
        double r330509 = r330504 * r330508;
        return r330509;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original5.8
Target0.1
Herbie5.8
\[x + \left(x \cdot y\right) \cdot y\]

Derivation

  1. Initial program 5.8

    \[x \cdot \left(1 + y \cdot y\right)\]

  2. Final simplification5.8

    \[\leadsto x \cdot \left(1 + y \cdot y\right)\]

Reproduce

herbie shell --seed 2019325 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:everywhere from integration-0.2.1"
  :precision binary64

  :herbie-target
  (+ x (* (* x y) y))

  (* x (+ 1 (* y y))))