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

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

  2. Final simplification0.2

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

Reproduce

herbie shell --seed 2020152 
(FPCore (x y)
  :name "(- (* (* x x) x) (* (* y y) y))"
  :precision binary64
  (- (* (* x x) x) (* (* y y) y)))