Average Error: 0.0 → 0.0

Time: 5.4s

Precision: 64

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

↓

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

\left(x + y\right) \cdot \left(x + y\right)

↓

\left(x + y\right) \cdot \left(x + y\right)

double code(double x, double y) {
	return ((double) (((double) (x + y)) * ((double) (x + y))));
}

↓

double code(double x, double y) {
	return ((double) (((double) (x + y)) * ((double) (x + y))));
}

Error

The X axis uses an exponential scale — Bits error versus `x`

Try it out

In
Out

Enter valid numbers for all inputs

Target

Original	0.0
Target	0.0
Herbie	0.0

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

Derivation

Initial program 0.0
\[\left(x + y\right) \cdot \left(x + y\right)\]
Final simplification0.0
\[\leadsto \left(x + y\right) \cdot \left(x + y\right)\]

Reproduce

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