Average Error: 0.0 → 0.0
Time: 1.5s
Precision: binary64
\[\left({r}^{2} - 1\right) + {b}^{2}\]
↓
\[\left({r}^{2} - 1\right) + {b}^{2}\]
\left({r}^{2} - 1\right) + {b}^{2}
↓
\left({r}^{2} - 1\right) + {b}^{2}
double code(double r, double b) {
	return ((double) (((double) (((double) pow(r, 2.0)) - 1.0)) + ((double) pow(b, 2.0))));
}
↓
double code(double r, double b) {
	return ((double) (((double) (((double) pow(r, 2.0)) - 1.0)) + ((double) pow(b, 2.0))));
}

Error

Bits error versus r

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left({r}^{2} - 1\right) + {b}^{2}\]

  2. Final simplification0.0

    \[\leadsto \left({r}^{2} - 1\right) + {b}^{2}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (r b)
  :name "(+ (- (pow r 2) 1) (pow b 2))"
  :precision binary64
  (+ (- (pow r 2.0) 1.0) (pow b 2.0)))