Average Error: 0.0 → 0.0
Time: 3.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 r1007969 = x;
        double r1007970 = y;
        double r1007971 = z;
        double r1007972 = r1007970 - r1007971;
        double r1007973 = t;
        double r1007974 = r1007973 - r1007969;
        double r1007975 = r1007972 * r1007974;
        double r1007976 = r1007969 + r1007975;
        return r1007976;
}

double f(double x, double y, double z, double t) {
        double r1007977 = x;
        double r1007978 = y;
        double r1007979 = z;
        double r1007980 = r1007978 - r1007979;
        double r1007981 = t;
        double r1007982 = r1007981 - r1007977;
        double r1007983 = r1007980 * r1007982;
        double r1007984 = r1007977 + r1007983;
        return r1007984;
}

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