Average Error: 0.0 → 0.0
Time: 1.3s
Precision: 64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[{x}^{2} + \left({y}^{2} + 2 \cdot \left(x \cdot y\right)\right)\]
\left(x + y\right) \cdot \left(x + y\right)
↓
{x}^{2} + \left({y}^{2} + 2 \cdot \left(x \cdot y\right)\right)
double f(double x, double y) {
        double r652847 = x;
        double r652848 = y;
        double r652849 = r652847 + r652848;
        double r652850 = r652849 * r652849;
        return r652850;
}
↓
double f(double x, double y) {
        double r652851 = x;
        double r652852 = 2.0;
        double r652853 = pow(r652851, r652852);
        double r652854 = y;
        double r652855 = pow(r652854, r652852);
        double r652856 = r652851 * r652854;
        double r652857 = r652852 * r652856;
        double r652858 = r652855 + r652857;
        double r652859 = r652853 + r652858;
        return r652859;
}

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

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

  7. Final simplification0.0

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

Reproduce

herbie shell --seed 2020060 
(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)))