Average Error: 0.0 → 0.0
Time: 3.4s
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 r748957 = x;
        double r748958 = y;
        double r748959 = z;
        double r748960 = r748958 - r748959;
        double r748961 = t;
        double r748962 = r748961 - r748957;
        double r748963 = r748960 * r748962;
        double r748964 = r748957 + r748963;
        return r748964;
}
↓
double f(double x, double y, double z, double t) {
        double r748965 = x;
        double r748966 = y;
        double r748967 = z;
        double r748968 = r748966 - r748967;
        double r748969 = t;
        double r748970 = r748969 - r748965;
        double r748971 = r748968 * r748970;
        double r748972 = r748965 + r748971;
        return r748972;
}

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