Average Error: 0.0 → 0.0
Time: 8.9s
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 r646184 = x;
        double r646185 = y;
        double r646186 = z;
        double r646187 = r646185 - r646186;
        double r646188 = t;
        double r646189 = r646188 - r646184;
        double r646190 = r646187 * r646189;
        double r646191 = r646184 + r646190;
        return r646191;
}
↓
double f(double x, double y, double z, double t) {
        double r646192 = x;
        double r646193 = y;
        double r646194 = z;
        double r646195 = r646193 - r646194;
        double r646196 = t;
        double r646197 = r646196 - r646192;
        double r646198 = r646195 * r646197;
        double r646199 = r646192 + r646198;
        return r646199;
}

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