Average Error: 0.0 → 0.0
Time: 8.2s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[x \cdot \left(y + x\right) + \left(y + x\right) \cdot y\]
\left(x + y\right) \cdot \left(x + y\right)
↓
x \cdot \left(y + x\right) + \left(y + x\right) \cdot y
double f(double x, double y) {
        double r35117248 = x;
        double r35117249 = y;
        double r35117250 = r35117248 + r35117249;
        double r35117251 = r35117250 * r35117250;
        return r35117251;
}
↓
double f(double x, double y) {
        double r35117252 = x;
        double r35117253 = y;
        double r35117254 = r35117253 + r35117252;
        double r35117255 = r35117252 * r35117254;
        double r35117256 = r35117254 * r35117253;
        double r35117257 = r35117255 + r35117256;
        return r35117257;
}

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

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(x + y\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019179 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f3 from sbv-4.4"

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

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