Average Error: 0.0 → 0.0
Time: 10.4s
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 r34381 = x;
        double r34382 = y;
        double r34383 = r34381 + r34382;
        double r34384 = z;
        double r34385 = r34383 - r34384;
        double r34386 = t;
        double r34387 = 2.0;
        double r34388 = r34386 * r34387;
        double r34389 = r34385 / r34388;
        return r34389;
}
↓
double f(double x, double y, double z, double t) {
        double r34390 = x;
        double r34391 = y;
        double r34392 = r34390 + r34391;
        double r34393 = z;
        double r34394 = r34392 - r34393;
        double r34395 = t;
        double r34396 = 2.0;
        double r34397 = r34395 * r34396;
        double r34398 = r34394 / r34397;
        return r34398;
}

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 2019323 +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)))