Average Error: 0.0 → 0.0
Time: 4.7s
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 r45199 = x;
        double r45200 = y;
        double r45201 = r45199 + r45200;
        double r45202 = z;
        double r45203 = r45201 - r45202;
        double r45204 = t;
        double r45205 = 2.0;
        double r45206 = r45204 * r45205;
        double r45207 = r45203 / r45206;
        return r45207;
}
↓
double f(double x, double y, double z, double t) {
        double r45208 = x;
        double r45209 = y;
        double r45210 = r45208 + r45209;
        double r45211 = z;
        double r45212 = r45210 - r45211;
        double r45213 = t;
        double r45214 = 2.0;
        double r45215 = r45213 * r45214;
        double r45216 = r45212 / r45215;
        return r45216;
}

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