Average Error: 0.0 → 0.0
Time: 2.6s
Precision: binary64
\[\left(x + y\right) \cdot \left(x + y\right)\]
↓
\[x \cdot x + y \cdot \left(x + \left(x + y\right)\right)\]
\left(x + y\right) \cdot \left(x + y\right)
↓
x \cdot x + y \cdot \left(x + \left(x + y\right)\right)
(FPCore (x y) :precision binary64 (* (+ x y) (+ x y)))
↓
(FPCore (x y) :precision binary64 (+ (* x x) (* y (+ x (+ x y)))))
double code(double x, double y) {
	return (x + y) * (x + y);
}
↓
double code(double x, double y) {
	return (x * x) + (y * (x + (x + y)));
}

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-rgt-in_binary64_189010.0

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

  5. Applied distribute-rgt-in_binary64_189010.0

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

  6. Applied associate-+l+_binary64_188840.0

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

  7. Simplified0.0

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

  8. Final simplification0.0

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

Reproduce

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

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

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