Average Error: 0.0 → 0.0
Time: 3.5s
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 r1044965 = x;
        double r1044966 = y;
        double r1044967 = z;
        double r1044968 = r1044966 - r1044967;
        double r1044969 = t;
        double r1044970 = r1044969 - r1044965;
        double r1044971 = r1044968 * r1044970;
        double r1044972 = r1044965 + r1044971;
        return r1044972;
}

double f(double x, double y, double z, double t) {
        double r1044973 = x;
        double r1044974 = y;
        double r1044975 = z;
        double r1044976 = r1044974 - r1044975;
        double r1044977 = t;
        double r1044978 = r1044977 - r1044973;
        double r1044979 = r1044976 * r1044978;
        double r1044980 = r1044973 + r1044979;
        return r1044980;
}

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