Average Error: 0.1 → 0.1
Time: 10.5s
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 r2912190 = x;
        double r2912191 = y;
        double r2912192 = r2912190 + r2912191;
        double r2912193 = z;
        double r2912194 = r2912192 - r2912193;
        double r2912195 = t;
        double r2912196 = 2.0;
        double r2912197 = r2912195 * r2912196;
        double r2912198 = r2912194 / r2912197;
        return r2912198;
}
↓
double f(double x, double y, double z, double t) {
        double r2912199 = y;
        double r2912200 = x;
        double r2912201 = r2912199 + r2912200;
        double r2912202 = z;
        double r2912203 = r2912201 - r2912202;
        double r2912204 = t;
        double r2912205 = 2.0;
        double r2912206 = r2912204 * r2912205;
        double r2912207 = r2912203 / r2912206;
        return r2912207;
}

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