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

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020198 
(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))))