Average Error: 0.1 → 0.1
Time: 2.3s
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 r33330 = x;
        double r33331 = y;
        double r33332 = r33330 + r33331;
        double r33333 = z;
        double r33334 = r33332 - r33333;
        double r33335 = t;
        double r33336 = 2.0;
        double r33337 = r33335 * r33336;
        double r33338 = r33334 / r33337;
        return r33338;
}
↓
double f(double x, double y, double z, double t) {
        double r33339 = x;
        double r33340 = y;
        double r33341 = r33339 + r33340;
        double r33342 = t;
        double r33343 = 2.0;
        double r33344 = r33342 * r33343;
        double r33345 = r33341 / r33344;
        double r33346 = z;
        double r33347 = r33346 / r33344;
        double r33348 = r33345 - r33347;
        return r33348;
}

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