Average Error: 0.1 → 0.3
Time: 9.6s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{1}{t} \cdot \frac{\left(x + y\right) - z}{2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{1}{t} \cdot \frac{\left(x + y\right) - z}{2}
double f(double x, double y, double z, double t) {
        double r44248 = x;
        double r44249 = y;
        double r44250 = r44248 + r44249;
        double r44251 = z;
        double r44252 = r44250 - r44251;
        double r44253 = t;
        double r44254 = 2.0;
        double r44255 = r44253 * r44254;
        double r44256 = r44252 / r44255;
        return r44256;
}
↓
double f(double x, double y, double z, double t) {
        double r44257 = 1.0;
        double r44258 = t;
        double r44259 = r44257 / r44258;
        double r44260 = x;
        double r44261 = y;
        double r44262 = r44260 + r44261;
        double r44263 = z;
        double r44264 = r44262 - r44263;
        double r44265 = 2.0;
        double r44266 = r44264 / r44265;
        double r44267 = r44259 * r44266;
        return r44267;
}

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. Using strategy rm

  3. Applied *-un-lft-identity0.1

    \[\leadsto \frac{\color{blue}{1 \cdot \left(\left(x + y\right) - z\right)}}{t \cdot 2}\]

  4. Applied times-frac0.3

    \[\leadsto \color{blue}{\frac{1}{t} \cdot \frac{\left(x + y\right) - z}{2}}\]

  5. Final simplification0.3

    \[\leadsto \frac{1}{t} \cdot \frac{\left(x + y\right) - z}{2}\]

Reproduce

herbie shell --seed 2019235 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))