Average Error: 0.1 → 0.1
Time: 17.2s
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 r1982910 = x;
        double r1982911 = y;
        double r1982912 = r1982910 + r1982911;
        double r1982913 = z;
        double r1982914 = r1982912 - r1982913;
        double r1982915 = t;
        double r1982916 = 2.0;
        double r1982917 = r1982915 * r1982916;
        double r1982918 = r1982914 / r1982917;
        return r1982918;
}
↓
double f(double x, double y, double z, double t) {
        double r1982919 = y;
        double r1982920 = x;
        double r1982921 = r1982919 + r1982920;
        double r1982922 = z;
        double r1982923 = r1982921 - r1982922;
        double r1982924 = t;
        double r1982925 = 2.0;
        double r1982926 = r1982924 * r1982925;
        double r1982927 = r1982923 / r1982926;
        return r1982927;
}

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