Average Error: 0.1 → 0.1
Time: 17.6s
Precision: binary64
Cost: 832
\[\left(\left(x \cdot x + y \cdot y\right) + y \cdot y\right) + y \cdot y\]
↓
\[\left(x \cdot x + y \cdot \left(y + y\right)\right) + y \cdot y\]
\left(\left(x \cdot x + y \cdot y\right) + y \cdot y\right) + y \cdot y
↓
\left(x \cdot x + y \cdot \left(y + y\right)\right) + y \cdot y
(FPCore (x y) :precision binary64 (+ (+ (+ (* x x) (* y y)) (* y y)) (* y y)))
↓
(FPCore (x y) :precision binary64 (+ (+ (* x x) (* y (+ y y))) (* y y)))
double code(double x, double y) {
	return (((x * x) + (y * y)) + (y * y)) + (y * y);
}
↓
double code(double x, double y) {
	return ((x * x) + (y * (y + y))) + (y * 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.1
Target0.1
Herbie0.1
\[x \cdot x + y \cdot \left(y + \left(y + y\right)\right)\]
Alternative 1
Accuracy0.1
Cost960
\[y \cdot y + \left(y \cdot y + \left(y \cdot y + x \cdot x\right)\right)\]

Derivation

  1. Initial program 0.1

    \[\left(\left(x \cdot x + y \cdot y\right) + y \cdot y\right) + y \cdot y\]
  2. Using strategy rm

  3. Applied associate-+l+_binary64_126280.1

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

  4. Simplified0.1

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

  5. Final simplification0.1

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

Reproduce

herbie shell --seed 2020322 
(FPCore (x y)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, E"
  :precision binary64

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

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