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 r27225 = x;
        double r27226 = y;
        double r27227 = r27225 + r27226;
        double r27228 = z;
        double r27229 = r27227 - r27228;
        double r27230 = t;
        double r27231 = 2.0;
        double r27232 = r27230 * r27231;
        double r27233 = r27229 / r27232;
        return r27233;
}
↓
double f(double x, double y, double z, double t) {
        double r27234 = x;
        double r27235 = y;
        double r27236 = r27234 + r27235;
        double r27237 = z;
        double r27238 = r27236 - r27237;
        double r27239 = t;
        double r27240 = 2.0;
        double r27241 = r27239 * r27240;
        double r27242 = r27238 / r27241;
        return r27242;
}

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