Average Error: 0.1 → 0.1
Time: 4.0s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r256 = x;
        double r257 = y;
        double r258 = r256 + r257;
        double r259 = z;
        double r260 = r258 - r259;
        double r261 = t;
        double r262 = 2.0;
        double r263 = r261 * r262;
        double r264 = r260 / r263;
        return r264;
}
↓
double f(double x, double y, double z, double t) {
        double r265 = x;
        double r266 = y;
        double r267 = r265 + r266;
        double r268 = t;
        double r269 = 2.0;
        double r270 = r268 * r269;
        double r271 = r267 / r270;
        double r272 = z;
        double r273 = r272 / r270;
        double r274 = r271 - r273;
        return r274;
}

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

    \[\leadsto \color{blue}{\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}}\]

  4. Final simplification0.1

    \[\leadsto \frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

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