Average Error: 0.0 → 0.0
Time: 11.1s
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 r18018 = x;
        double r18019 = y;
        double r18020 = r18018 + r18019;
        double r18021 = z;
        double r18022 = r18020 - r18021;
        double r18023 = t;
        double r18024 = 2.0;
        double r18025 = r18023 * r18024;
        double r18026 = r18022 / r18025;
        return r18026;
}
↓
double f(double x, double y, double z, double t) {
        double r18027 = x;
        double r18028 = y;
        double r18029 = r18027 + r18028;
        double r18030 = z;
        double r18031 = r18029 - r18030;
        double r18032 = t;
        double r18033 = 2.0;
        double r18034 = r18032 * r18033;
        double r18035 = r18031 / r18034;
        return r18035;
}

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