Average Error: 0.0 → 0.0
Time: 39.1s
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 r507991 = x;
        double r507992 = y;
        double r507993 = z;
        double r507994 = r507992 - r507993;
        double r507995 = t;
        double r507996 = r507995 - r507991;
        double r507997 = r507994 * r507996;
        double r507998 = r507991 + r507997;
        return r507998;
}
↓
double f(double x, double y, double z, double t) {
        double r507999 = x;
        double r508000 = y;
        double r508001 = z;
        double r508002 = r508000 - r508001;
        double r508003 = t;
        double r508004 = r508003 - r507999;
        double r508005 = r508002 * r508004;
        double r508006 = r507999 + r508005;
        return r508006;
}

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