Average Error: 0.1 → 0.1
Time: 3.2s
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 r45680 = x;
        double r45681 = y;
        double r45682 = r45680 + r45681;
        double r45683 = z;
        double r45684 = r45682 - r45683;
        double r45685 = t;
        double r45686 = 2.0;
        double r45687 = r45685 * r45686;
        double r45688 = r45684 / r45687;
        return r45688;
}
↓
double f(double x, double y, double z, double t) {
        double r45689 = x;
        double r45690 = y;
        double r45691 = r45689 + r45690;
        double r45692 = z;
        double r45693 = r45691 - r45692;
        double r45694 = t;
        double r45695 = 2.0;
        double r45696 = r45694 * r45695;
        double r45697 = r45693 / r45696;
        return r45697;
}

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