Average Error: 0.0 → 0.0
Time: 8.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 r514425 = x;
        double r514426 = y;
        double r514427 = z;
        double r514428 = r514426 - r514427;
        double r514429 = t;
        double r514430 = r514429 - r514425;
        double r514431 = r514428 * r514430;
        double r514432 = r514425 + r514431;
        return r514432;
}
↓
double f(double x, double y, double z, double t) {
        double r514433 = x;
        double r514434 = y;
        double r514435 = z;
        double r514436 = r514434 - r514435;
        double r514437 = t;
        double r514438 = r514437 - r514433;
        double r514439 = r514436 * r514438;
        double r514440 = r514433 + r514439;
        return r514440;
}

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