Average Error: 0.1 → 0.1
Time: 3.3s
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 r42130 = x;
        double r42131 = y;
        double r42132 = r42130 + r42131;
        double r42133 = z;
        double r42134 = r42132 - r42133;
        double r42135 = t;
        double r42136 = 2.0;
        double r42137 = r42135 * r42136;
        double r42138 = r42134 / r42137;
        return r42138;
}
↓
double f(double x, double y, double z, double t) {
        double r42139 = x;
        double r42140 = y;
        double r42141 = r42139 + r42140;
        double r42142 = z;
        double r42143 = r42141 - r42142;
        double r42144 = t;
        double r42145 = 2.0;
        double r42146 = r42144 * r42145;
        double r42147 = r42143 / r42146;
        return r42147;
}

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