Average Error: 0.0 → 0.0
Time: 9.3s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[\left(x + y\right) \cdot x + \left(x + y\right) \cdot y\]
\left(x + y\right) \cdot \left(x + y\right)
↓
\left(x + y\right) \cdot x + \left(x + y\right) \cdot y
double f(double x, double y) {
        double r388179 = x;
        double r388180 = y;
        double r388181 = r388179 + r388180;
        double r388182 = r388181 * r388181;
        return r388182;
}
↓
double f(double x, double y) {
        double r388183 = x;
        double r388184 = y;
        double r388185 = r388183 + r388184;
        double r388186 = r388185 * r388183;
        double r388187 = r388185 * r388184;
        double r388188 = r388186 + r388187;
        return r388188;
}

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-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019325 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f3 from sbv-4.4"
  :precision binary64

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

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