Average Error: 0.0 → 0.0
Time: 7.1s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[\left(x \cdot y + x \cdot y\right) + \left(x \cdot x + y \cdot y\right)\]
\left(x + y\right) \cdot \left(x + y\right)
↓
\left(x \cdot y + x \cdot y\right) + \left(x \cdot x + y \cdot y\right)
double f(double x, double y) {
        double r32261105 = x;
        double r32261106 = y;
        double r32261107 = r32261105 + r32261106;
        double r32261108 = r32261107 * r32261107;
        return r32261108;
}
↓
double f(double x, double y) {
        double r32261109 = x;
        double r32261110 = y;
        double r32261111 = r32261109 * r32261110;
        double r32261112 = r32261111 + r32261111;
        double r32261113 = r32261109 * r32261109;
        double r32261114 = r32261110 * r32261110;
        double r32261115 = r32261113 + r32261114;
        double r32261116 = r32261112 + r32261115;
        return r32261116;
}

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. Taylor expanded around 0 0.0

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

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

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

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

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