Average Error: 0.0 → 0.0
Time: 2.2s
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 r830883 = x;
        double r830884 = y;
        double r830885 = z;
        double r830886 = r830884 - r830885;
        double r830887 = t;
        double r830888 = r830887 - r830883;
        double r830889 = r830886 * r830888;
        double r830890 = r830883 + r830889;
        return r830890;
}
↓
double f(double x, double y, double z, double t) {
        double r830891 = x;
        double r830892 = y;
        double r830893 = z;
        double r830894 = r830892 - r830893;
        double r830895 = t;
        double r830896 = r830895 - r830891;
        double r830897 = r830894 * r830896;
        double r830898 = r830891 + r830897;
        return r830898;
}

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 2020035 +o rules:numerics
(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))))