Average Error: 0.0 → 0.0
Time: 2.0s
Precision: 64
\[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y\]
↓
\[\left(y \cdot \left(x \cdot 2\right) + {y}^{2}\right) + x \cdot x\]
\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y
↓
\left(y \cdot \left(x \cdot 2\right) + {y}^{2}\right) + x \cdot x
double code(double x, double y) {
	return (((x * x) + ((x * 2.0) * y)) + (y * y));
}
↓
double code(double x, double y) {
	return (((y * (x * 2.0)) + pow(y, 2.0)) + (x * x));
}

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 + \left(x \cdot y\right) \cdot 2\right)\]

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{y \cdot \left(x \cdot 2 + y\right) + x \cdot x}\]
  3. Using strategy rm

  4. Applied distribute-lft-in0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020075 
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

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

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