Average Error: 0.0 → 0.0
Time: 2.6s
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 r27911 = x;
        double r27912 = y;
        double r27913 = r27911 + r27912;
        double r27914 = z;
        double r27915 = r27913 - r27914;
        double r27916 = t;
        double r27917 = 2.0;
        double r27918 = r27916 * r27917;
        double r27919 = r27915 / r27918;
        return r27919;
}
↓
double f(double x, double y, double z, double t) {
        double r27920 = x;
        double r27921 = y;
        double r27922 = r27920 + r27921;
        double r27923 = z;
        double r27924 = r27922 - r27923;
        double r27925 = t;
        double r27926 = 2.0;
        double r27927 = r27925 * r27926;
        double r27928 = r27924 / r27927;
        return r27928;
}

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