Average Error: 0.1 → 0.1
Time: 2.3s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(x + y\right) - z}{t \cdot 2}
double code(double x, double y, double z, double t) {
	return (((x + y) - z) / (t * 2.0));
}
↓
double code(double x, double y, double z, double t) {
	return (((x + y) - z) / (t * 2.0));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\frac{\left(x + y\right) - z}{t \cdot 2}\]
  2. Using strategy rm

  3. Applied associate-/r*0.1

    \[\leadsto \color{blue}{\frac{\frac{\left(x + y\right) - z}{t}}{2}}\]
  4. Using strategy rm

  5. Applied div-inv0.4

    \[\leadsto \frac{\color{blue}{\left(\left(x + y\right) - z\right) \cdot \frac{1}{t}}}{2}\]

  6. Applied associate-/l*0.2

    \[\leadsto \color{blue}{\frac{\left(x + y\right) - z}{\frac{2}{\frac{1}{t}}}}\]

  7. Simplified0.1

    \[\leadsto \frac{\left(x + y\right) - z}{\color{blue}{t \cdot 2}}\]

  8. Final simplification0.1

    \[\leadsto \frac{\left(x + y\right) - z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2020078 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))