Average Error: 0.0 → 0.0
Time: 6.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 r42192 = x;
        double r42193 = y;
        double r42194 = r42192 + r42193;
        double r42195 = z;
        double r42196 = r42194 - r42195;
        double r42197 = t;
        double r42198 = 2.0;
        double r42199 = r42197 * r42198;
        double r42200 = r42196 / r42199;
        return r42200;
}
↓
double f(double x, double y, double z, double t) {
        double r42201 = x;
        double r42202 = y;
        double r42203 = r42201 + r42202;
        double r42204 = z;
        double r42205 = r42203 - r42204;
        double r42206 = t;
        double r42207 = 2.0;
        double r42208 = r42206 * r42207;
        double r42209 = r42205 / r42208;
        return r42209;
}

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