Average Error: 0.0 → 0.0
Time: 2.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 r35033 = x;
        double r35034 = y;
        double r35035 = r35033 + r35034;
        double r35036 = z;
        double r35037 = r35035 - r35036;
        double r35038 = t;
        double r35039 = 2.0;
        double r35040 = r35038 * r35039;
        double r35041 = r35037 / r35040;
        return r35041;
}
↓
double f(double x, double y, double z, double t) {
        double r35042 = x;
        double r35043 = y;
        double r35044 = r35042 + r35043;
        double r35045 = z;
        double r35046 = r35044 - r35045;
        double r35047 = t;
        double r35048 = 2.0;
        double r35049 = r35047 * r35048;
        double r35050 = r35046 / r35049;
        return r35050;
}

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