Average Error: 0.1 → 0.1
Time: 15.6s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(y + x\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r2200335 = x;
        double r2200336 = y;
        double r2200337 = r2200335 + r2200336;
        double r2200338 = z;
        double r2200339 = r2200337 - r2200338;
        double r2200340 = t;
        double r2200341 = 2.0;
        double r2200342 = r2200340 * r2200341;
        double r2200343 = r2200339 / r2200342;
        return r2200343;
}
↓
double f(double x, double y, double z, double t) {
        double r2200344 = y;
        double r2200345 = x;
        double r2200346 = r2200344 + r2200345;
        double r2200347 = z;
        double r2200348 = r2200346 - r2200347;
        double r2200349 = t;
        double r2200350 = 2.0;
        double r2200351 = r2200349 * r2200350;
        double r2200352 = r2200348 / r2200351;
        return r2200352;
}

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(y + x\right) - z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2019179 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  (/ (- (+ x y) z) (* t 2.0)))