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

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{x \cdot x - y \cdot y}\]

  3. Final simplification0.0

    \[\leadsto x \cdot x - y \cdot y\]

Reproduce

herbie shell --seed 2020181 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))