Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[x \cdot \left(x + y\right) + y \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(x + y\right)
↓
x \cdot \left(x + y\right) + y \cdot \left(x + y\right)
double f(double x, double y) {
        double r607064 = x;
        double r607065 = y;
        double r607066 = r607064 + r607065;
        double r607067 = r607066 * r607066;
        return r607067;
}
↓
double f(double x, double y) {
        double r607068 = x;
        double r607069 = y;
        double r607070 = r607068 + r607069;
        double r607071 = r607068 * r607070;
        double r607072 = r607069 * r607070;
        double r607073 = r607071 + r607072;
        return r607073;
}

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. Simplified0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020001 +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)))