Average Error: 0.1 → 0.1
Time: 4.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 r48336 = x;
        double r48337 = y;
        double r48338 = r48336 + r48337;
        double r48339 = z;
        double r48340 = r48338 - r48339;
        double r48341 = t;
        double r48342 = 2.0;
        double r48343 = r48341 * r48342;
        double r48344 = r48340 / r48343;
        return r48344;
}
↓
double f(double x, double y, double z, double t) {
        double r48345 = x;
        double r48346 = y;
        double r48347 = r48345 + r48346;
        double r48348 = z;
        double r48349 = r48347 - r48348;
        double r48350 = t;
        double r48351 = 2.0;
        double r48352 = r48350 * r48351;
        double r48353 = r48349 / r48352;
        return r48353;
}

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