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

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

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

  4. Applied associate-*r*_binary640.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020224 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, B"
  :precision binary64

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

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