Average Error: 0.0 → 0.0
Time: 15.6s
Precision: 64
\[x + \left(y - z\right) \cdot \left(t - x\right)\]
↓
\[x + \left(y - z\right) \cdot \left(t - x\right)\]
x + \left(y - z\right) \cdot \left(t - x\right)
↓
x + \left(y - z\right) \cdot \left(t - x\right)
double f(double x, double y, double z, double t) {
        double r542776 = x;
        double r542777 = y;
        double r542778 = z;
        double r542779 = r542777 - r542778;
        double r542780 = t;
        double r542781 = r542780 - r542776;
        double r542782 = r542779 * r542781;
        double r542783 = r542776 + r542782;
        return r542783;
}
↓
double f(double x, double y, double z, double t) {
        double r542784 = x;
        double r542785 = y;
        double r542786 = z;
        double r542787 = r542785 - r542786;
        double r542788 = t;
        double r542789 = r542788 - r542784;
        double r542790 = r542787 * r542789;
        double r542791 = r542784 + r542790;
        return r542791;
}

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

Target

Original0.0
Target0.0
Herbie0.0
\[x + \left(t \cdot \left(y - z\right) + \left(-x\right) \cdot \left(y - z\right)\right)\]

Derivation

  1. Initial program 0.0

    \[x + \left(y - z\right) \cdot \left(t - x\right)\]

  2. Final simplification0.0

    \[\leadsto x + \left(y - z\right) \cdot \left(t - x\right)\]

Reproduce

herbie shell --seed 2019212 
(FPCore (x y z t)
  :name "Data.Metrics.Snapshot:quantile from metrics-0.3.0.2"
  :precision binary64

  :herbie-target
  (+ x (+ (* t (- y z)) (* (- x) (- y z))))

  (+ x (* (- y z) (- t x))))