Average Error: 0.1 → 0.1
Time: 11.1s
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 r44449 = x;
        double r44450 = y;
        double r44451 = r44449 + r44450;
        double r44452 = z;
        double r44453 = r44451 - r44452;
        double r44454 = t;
        double r44455 = 2.0;
        double r44456 = r44454 * r44455;
        double r44457 = r44453 / r44456;
        return r44457;
}
↓
double f(double x, double y, double z, double t) {
        double r44458 = y;
        double r44459 = x;
        double r44460 = r44458 + r44459;
        double r44461 = z;
        double r44462 = r44460 - r44461;
        double r44463 = t;
        double r44464 = 2.0;
        double r44465 = r44463 * r44464;
        double r44466 = r44462 / r44465;
        return r44466;
}

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