Average Error: 0.1 → 0.1
Time: 12.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 r22879 = x;
        double r22880 = y;
        double r22881 = r22879 + r22880;
        double r22882 = z;
        double r22883 = r22881 - r22882;
        double r22884 = t;
        double r22885 = 2.0;
        double r22886 = r22884 * r22885;
        double r22887 = r22883 / r22886;
        return r22887;
}
↓
double f(double x, double y, double z, double t) {
        double r22888 = x;
        double r22889 = y;
        double r22890 = r22888 + r22889;
        double r22891 = z;
        double r22892 = r22890 - r22891;
        double r22893 = t;
        double r22894 = 2.0;
        double r22895 = r22893 * r22894;
        double r22896 = r22892 / r22895;
        return r22896;
}

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

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

  2. Final simplification0.1

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

Reproduce

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