Average Error: 0.0 → 0.0
Time: 3.8s
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 r610860 = x;
        double r610861 = y;
        double r610862 = z;
        double r610863 = r610861 - r610862;
        double r610864 = t;
        double r610865 = r610864 - r610860;
        double r610866 = r610863 * r610865;
        double r610867 = r610860 + r610866;
        return r610867;
}
↓
double f(double x, double y, double z, double t) {
        double r610868 = x;
        double r610869 = y;
        double r610870 = z;
        double r610871 = r610869 - r610870;
        double r610872 = t;
        double r610873 = r610872 - r610868;
        double r610874 = r610871 * r610873;
        double r610875 = r610868 + r610874;
        return r610875;
}

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 2020003 
(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))))