Average Error: 0.0 → 0.0
Time: 32.6s
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 r509010 = x;
        double r509011 = y;
        double r509012 = z;
        double r509013 = r509011 - r509012;
        double r509014 = t;
        double r509015 = r509014 - r509010;
        double r509016 = r509013 * r509015;
        double r509017 = r509010 + r509016;
        return r509017;
}
↓
double f(double x, double y, double z, double t) {
        double r509018 = x;
        double r509019 = y;
        double r509020 = z;
        double r509021 = r509019 - r509020;
        double r509022 = t;
        double r509023 = r509022 - r509018;
        double r509024 = r509021 * r509023;
        double r509025 = r509018 + r509024;
        return r509025;
}

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