Average Error: 0.1 → 0.0
Time: 11.7s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\frac{\left(x + y\right) - z}{t}}{2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\frac{\left(x + y\right) - z}{t}}{2}
double f(double x, double y, double z, double t) {
        double r34347 = x;
        double r34348 = y;
        double r34349 = r34347 + r34348;
        double r34350 = z;
        double r34351 = r34349 - r34350;
        double r34352 = t;
        double r34353 = 2.0;
        double r34354 = r34352 * r34353;
        double r34355 = r34351 / r34354;
        return r34355;
}
↓
double f(double x, double y, double z, double t) {
        double r34356 = x;
        double r34357 = y;
        double r34358 = r34356 + r34357;
        double r34359 = z;
        double r34360 = r34358 - r34359;
        double r34361 = t;
        double r34362 = r34360 / r34361;
        double r34363 = 2.0;
        double r34364 = r34362 / r34363;
        return r34364;
}

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 associate-/r*0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019208 +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)))