Average Error: 0.0 → 0.0
Time: 34.3s
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 r525852 = x;
        double r525853 = y;
        double r525854 = z;
        double r525855 = r525853 - r525854;
        double r525856 = t;
        double r525857 = r525856 - r525852;
        double r525858 = r525855 * r525857;
        double r525859 = r525852 + r525858;
        return r525859;
}
↓
double f(double x, double y, double z, double t) {
        double r525860 = x;
        double r525861 = y;
        double r525862 = z;
        double r525863 = r525861 - r525862;
        double r525864 = t;
        double r525865 = r525864 - r525860;
        double r525866 = r525863 * r525865;
        double r525867 = r525860 + r525866;
        return r525867;
}

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