Average Error: 0.1 → 0.1
Time: 1.1s
Precision: binary64
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]
\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
\left(x \cdot 2 + x \cdot x\right) + y \cdot y
(FPCore (x y) :precision binary64 (+ (+ (* x 2.0) (* x x)) (* y y)))
(FPCore (x y) :precision binary64 (+ (+ (* x 2.0) (* x x)) (* y y)))
double code(double x, double y) {
	return ((x * 2.0) + (x * x)) + (y * y);
}
double code(double x, double y) {
	return ((x * 2.0) + (x * x)) + (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
\[y \cdot y + \left(2 \cdot x + x \cdot x\right) \]

Derivation

  1. Initial program 0.1

    \[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]
  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2022068 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

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

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