Average Error: 0.1 → 0.1
Time: 5.2s
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 r30024 = x;
        double r30025 = y;
        double r30026 = r30024 + r30025;
        double r30027 = z;
        double r30028 = r30026 - r30027;
        double r30029 = t;
        double r30030 = 2.0;
        double r30031 = r30029 * r30030;
        double r30032 = r30028 / r30031;
        return r30032;
}
↓
double f(double x, double y, double z, double t) {
        double r30033 = x;
        double r30034 = y;
        double r30035 = r30033 + r30034;
        double r30036 = z;
        double r30037 = r30035 - r30036;
        double r30038 = t;
        double r30039 = 2.0;
        double r30040 = r30038 * r30039;
        double r30041 = r30037 / r30040;
        return r30041;
}

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