Average Error: 0.1 → 0.1
Time: 17.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2.0}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2.0}\]
\frac{\left(x + y\right) - z}{t \cdot 2.0}
↓
\frac{\left(y + x\right) - z}{t \cdot 2.0}
double f(double x, double y, double z, double t) {
        double r2030958 = x;
        double r2030959 = y;
        double r2030960 = r2030958 + r2030959;
        double r2030961 = z;
        double r2030962 = r2030960 - r2030961;
        double r2030963 = t;
        double r2030964 = 2.0;
        double r2030965 = r2030963 * r2030964;
        double r2030966 = r2030962 / r2030965;
        return r2030966;
}
↓
double f(double x, double y, double z, double t) {
        double r2030967 = y;
        double r2030968 = x;
        double r2030969 = r2030967 + r2030968;
        double r2030970 = z;
        double r2030971 = r2030969 - r2030970;
        double r2030972 = t;
        double r2030973 = 2.0;
        double r2030974 = r2030972 * r2030973;
        double r2030975 = r2030971 / r2030974;
        return r2030975;
}

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.0}\]

  2. Final simplification0.1

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

Reproduce

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