Average Error: 0.0 → 0.0
Time: 5.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 r834264 = x;
        double r834265 = y;
        double r834266 = z;
        double r834267 = r834265 - r834266;
        double r834268 = t;
        double r834269 = r834268 - r834264;
        double r834270 = r834267 * r834269;
        double r834271 = r834264 + r834270;
        return r834271;
}
↓
double f(double x, double y, double z, double t) {
        double r834272 = x;
        double r834273 = y;
        double r834274 = z;
        double r834275 = r834273 - r834274;
        double r834276 = t;
        double r834277 = r834276 - r834272;
        double r834278 = r834275 * r834277;
        double r834279 = r834272 + r834278;
        return r834279;
}

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