Average Error: 0.0 → 0.0
Time: 8.5s
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 r28545087 = x;
        double r28545088 = y;
        double r28545089 = r28545087 + r28545088;
        double r28545090 = r28545089 * r28545089;
        return r28545090;
}
↓
double f(double x, double y) {
        double r28545091 = x;
        double r28545092 = y;
        double r28545093 = r28545092 + r28545091;
        double r28545094 = r28545091 * r28545093;
        double r28545095 = r28545093 * r28545092;
        double r28545096 = r28545094 + r28545095;
        return r28545096;
}

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 2019192 +o rules:numerics
(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)))