Average Error: 0.1 → 0.1
Time: 12.1s
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 r44488 = x;
        double r44489 = y;
        double r44490 = r44488 + r44489;
        double r44491 = z;
        double r44492 = r44490 - r44491;
        double r44493 = t;
        double r44494 = 2.0;
        double r44495 = r44493 * r44494;
        double r44496 = r44492 / r44495;
        return r44496;
}
↓
double f(double x, double y, double z, double t) {
        double r44497 = x;
        double r44498 = y;
        double r44499 = r44497 + r44498;
        double r44500 = z;
        double r44501 = r44499 - r44500;
        double r44502 = t;
        double r44503 = 2.0;
        double r44504 = r44502 * r44503;
        double r44505 = r44501 / r44504;
        return r44505;
}

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