Average Error: 0.0 → 0.0
Time: 7.6s
Precision: 64
\[\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y\]
↓
\[y \cdot y + \left(2.0 + x\right) \cdot x\]
\left(x \cdot 2.0 + x \cdot x\right) + y \cdot y
↓
y \cdot y + \left(2.0 + x\right) \cdot x
double f(double x, double y) {
        double r24453337 = x;
        double r24453338 = 2.0;
        double r24453339 = r24453337 * r24453338;
        double r24453340 = r24453337 * r24453337;
        double r24453341 = r24453339 + r24453340;
        double r24453342 = y;
        double r24453343 = r24453342 * r24453342;
        double r24453344 = r24453341 + r24453343;
        return r24453344;
}
↓
double f(double x, double y) {
        double r24453345 = y;
        double r24453346 = r24453345 * r24453345;
        double r24453347 = 2.0;
        double r24453348 = x;
        double r24453349 = r24453347 + r24453348;
        double r24453350 = r24453349 * r24453348;
        double r24453351 = r24453346 + r24453350;
        return r24453351;
}

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
\[y \cdot y + \left(2.0 \cdot x + x \cdot x\right)\]

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019165 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"

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

  (+ (+ (* x 2.0) (* x x)) (* y y)))