Average Error: 0.1 → 0.1
Time: 2.9s
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 r38321 = x;
        double r38322 = y;
        double r38323 = r38321 + r38322;
        double r38324 = z;
        double r38325 = r38323 - r38324;
        double r38326 = t;
        double r38327 = 2.0;
        double r38328 = r38326 * r38327;
        double r38329 = r38325 / r38328;
        return r38329;
}
↓
double f(double x, double y, double z, double t) {
        double r38330 = x;
        double r38331 = y;
        double r38332 = r38330 + r38331;
        double r38333 = z;
        double r38334 = r38332 - r38333;
        double r38335 = t;
        double r38336 = 2.0;
        double r38337 = r38335 * r38336;
        double r38338 = r38334 / r38337;
        return r38338;
}

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