Average Error: 0.1 → 0.1
Time: 1.7s
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 r51178 = x;
        double r51179 = y;
        double r51180 = r51178 + r51179;
        double r51181 = z;
        double r51182 = r51180 - r51181;
        double r51183 = t;
        double r51184 = 2.0;
        double r51185 = r51183 * r51184;
        double r51186 = r51182 / r51185;
        return r51186;
}
↓
double f(double x, double y, double z, double t) {
        double r51187 = x;
        double r51188 = y;
        double r51189 = r51187 + r51188;
        double r51190 = z;
        double r51191 = r51189 - r51190;
        double r51192 = t;
        double r51193 = 2.0;
        double r51194 = r51192 * r51193;
        double r51195 = r51191 / r51194;
        return r51195;
}

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 2020057 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))