Average Error: 0.0 → 0.0
Time: 9.0s
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 r32075 = x;
        double r32076 = y;
        double r32077 = r32075 + r32076;
        double r32078 = z;
        double r32079 = r32077 - r32078;
        double r32080 = t;
        double r32081 = 2.0;
        double r32082 = r32080 * r32081;
        double r32083 = r32079 / r32082;
        return r32083;
}
↓
double f(double x, double y, double z, double t) {
        double r32084 = x;
        double r32085 = y;
        double r32086 = r32084 + r32085;
        double r32087 = z;
        double r32088 = r32086 - r32087;
        double r32089 = t;
        double r32090 = 2.0;
        double r32091 = r32089 * r32090;
        double r32092 = r32088 / r32091;
        return r32092;
}

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.0

    \[\frac{\left(x + y\right) - z}{t \cdot 2}\]

  2. Final simplification0.0

    \[\leadsto \frac{\left(x + y\right) - z}{t \cdot 2}\]

Reproduce

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