Average Error: 0.1 → 0.1
Time: 12.6s
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 r46305 = x;
        double r46306 = y;
        double r46307 = r46305 + r46306;
        double r46308 = z;
        double r46309 = r46307 - r46308;
        double r46310 = t;
        double r46311 = 2.0;
        double r46312 = r46310 * r46311;
        double r46313 = r46309 / r46312;
        return r46313;
}
↓
double f(double x, double y, double z, double t) {
        double r46314 = x;
        double r46315 = y;
        double r46316 = r46314 + r46315;
        double r46317 = z;
        double r46318 = r46316 - r46317;
        double r46319 = t;
        double r46320 = 2.0;
        double r46321 = r46319 * r46320;
        double r46322 = r46318 / r46321;
        return r46322;
}

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 2019198 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  (/ (- (+ x y) z) (* t 2.0)))