Average Error: 0.0 → 0.0
Time: 26.8s
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 r892530 = x;
        double r892531 = y;
        double r892532 = z;
        double r892533 = r892531 - r892532;
        double r892534 = t;
        double r892535 = r892534 - r892530;
        double r892536 = r892533 * r892535;
        double r892537 = r892530 + r892536;
        return r892537;
}
↓
double f(double x, double y, double z, double t) {
        double r892538 = x;
        double r892539 = y;
        double r892540 = z;
        double r892541 = r892539 - r892540;
        double r892542 = t;
        double r892543 = r892542 - r892538;
        double r892544 = r892541 * r892543;
        double r892545 = r892538 + r892544;
        return r892545;
}

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