Average Error: 0.1 → 0.1
Time: 5.3s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2.0}\]
\[\frac{\frac{\left(y + x\right) - z}{t}}{2.0}\]
\frac{\left(x + y\right) - z}{t \cdot 2.0}
\frac{\frac{\left(y + x\right) - z}{t}}{2.0}
double f(double x, double y, double z, double t) {
        double r637500 = x;
        double r637501 = y;
        double r637502 = r637500 + r637501;
        double r637503 = z;
        double r637504 = r637502 - r637503;
        double r637505 = t;
        double r637506 = 2.0;
        double r637507 = r637505 * r637506;
        double r637508 = r637504 / r637507;
        return r637508;
}

double f(double x, double y, double z, double t) {
        double r637509 = y;
        double r637510 = x;
        double r637511 = r637509 + r637510;
        double r637512 = z;
        double r637513 = r637511 - r637512;
        double r637514 = t;
        double r637515 = r637513 / r637514;
        double r637516 = 2.0;
        double r637517 = r637515 / r637516;
        return r637517;
}

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. Using strategy rm
  3. Applied associate-/r*0.1

    \[\leadsto \color{blue}{\frac{\frac{\left(x + y\right) - z}{t}}{2.0}}\]
  4. Final simplification0.1

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

Reproduce

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