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

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.1
\[\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. Using strategy rm

  3. Applied sub-neg_binary64_123470.0

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

  4. Applied distribute-rgt-in_binary64_123040.0

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

  5. Simplified0.0

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

  6. Simplified0.1

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

  7. Final simplification0.1

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

Reproduce

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

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

  (* 2.0 (- (* x x) (* x y))))