Average Error: 0.1 → 0.1
Time: 3.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 r38017 = x;
        double r38018 = y;
        double r38019 = r38017 + r38018;
        double r38020 = z;
        double r38021 = r38019 - r38020;
        double r38022 = t;
        double r38023 = 2.0;
        double r38024 = r38022 * r38023;
        double r38025 = r38021 / r38024;
        return r38025;
}
↓
double f(double x, double y, double z, double t) {
        double r38026 = x;
        double r38027 = y;
        double r38028 = r38026 + r38027;
        double r38029 = z;
        double r38030 = r38028 - r38029;
        double r38031 = t;
        double r38032 = 2.0;
        double r38033 = r38031 * r38032;
        double r38034 = r38030 / r38033;
        return r38034;
}

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 2020089 +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)))