Average Error: 0.0 → 0.0
Time: 3.0s
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 f(double x, double y, double z, double t) {
        double r42212 = x;
        double r42213 = y;
        double r42214 = r42212 + r42213;
        double r42215 = z;
        double r42216 = r42214 - r42215;
        double r42217 = t;
        double r42218 = 2.0;
        double r42219 = r42217 * r42218;
        double r42220 = r42216 / r42219;
        return r42220;
}
↓
double f(double x, double y, double z, double t) {
        double r42221 = x;
        double r42222 = y;
        double r42223 = r42221 + r42222;
        double r42224 = z;
        double r42225 = r42223 - r42224;
        double r42226 = t;
        double r42227 = 2.0;
        double r42228 = r42226 * r42227;
        double r42229 = r42225 / r42228;
        return r42229;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

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