Average Error: 0.1 → 0.0
Time: 2.2s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\frac{\left(x + y\right) - z}{t}}{2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\frac{\left(x + y\right) - z}{t}}{2}
double f(double x, double y, double z, double t) {
        double r45056 = x;
        double r45057 = y;
        double r45058 = r45056 + r45057;
        double r45059 = z;
        double r45060 = r45058 - r45059;
        double r45061 = t;
        double r45062 = 2.0;
        double r45063 = r45061 * r45062;
        double r45064 = r45060 / r45063;
        return r45064;
}
↓
double f(double x, double y, double z, double t) {
        double r45065 = x;
        double r45066 = y;
        double r45067 = r45065 + r45066;
        double r45068 = z;
        double r45069 = r45067 - r45068;
        double r45070 = t;
        double r45071 = r45069 / r45070;
        double r45072 = 2.0;
        double r45073 = r45071 / r45072;
        return r45073;
}

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. Using strategy rm

  3. Applied associate-/r*0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020033 +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)))