Average Error: 0.0 → 0.0
Time: 696.0ms
Precision: binary64
\[\left(a - n\right) + \left(b - n\right)\]
↓
\[\left(a - n\right) + \left(b - n\right)\]
\left(a - n\right) + \left(b - n\right)
↓
\left(a - n\right) + \left(b - n\right)
double code(double a, double n, double b) {
	return ((double) (((double) (a - n)) + ((double) (b - n))));
}
↓
double code(double a, double n, double b) {
	return ((double) (((double) (a - n)) + ((double) (b - n))));
}

Error

Bits error versus a

Bits error versus n

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(a - n\right) + \left(b - n\right)\]

  2. Final simplification0.0

    \[\leadsto \left(a - n\right) + \left(b - n\right)\]

Reproduce

herbie shell --seed 2020153 
(FPCore (a n b)
  :name "(+ (- a n) (- b n))"
  :precision binary64
  (+ (- a n) (- b n)))