Average Error: 0.0 → 0.0
Time: 1.1s
Precision: binary64
\[\left(d - b \cdot b\right) - R \cdot R\]
↓
\[\left(d - b \cdot b\right) - R \cdot R\]
\left(d - b \cdot b\right) - R \cdot R
↓
\left(d - b \cdot b\right) - R \cdot R
double code(double d, double b, double R) {
	return ((double) (((double) (d - ((double) (b * b)))) - ((double) (R * R))));
}
↓
double code(double d, double b, double R) {
	return ((double) (((double) (d - ((double) (b * b)))) - ((double) (R * R))));
}

Error

Bits error versus d

Bits error versus b

Bits error versus R

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(d - b \cdot b\right) - R \cdot R\]

  2. Final simplification0.0

    \[\leadsto \left(d - b \cdot b\right) - R \cdot R\]

Reproduce

herbie shell --seed 2020153 
(FPCore (d b R)
  :name "(- (- d (* b b)) (* R R))"
  :precision binary64
  (- (- d (* b b)) (* R R)))