Average Error: 0.0 → 0.0
Time: 1.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 r733031 = x;
        double r733032 = y;
        double r733033 = z;
        double r733034 = r733032 - r733033;
        double r733035 = t;
        double r733036 = r733035 - r733031;
        double r733037 = r733034 * r733036;
        double r733038 = r733031 + r733037;
        return r733038;
}
↓
double f(double x, double y, double z, double t) {
        double r733039 = x;
        double r733040 = y;
        double r733041 = z;
        double r733042 = r733040 - r733041;
        double r733043 = t;
        double r733044 = r733043 - r733039;
        double r733045 = r733042 * r733044;
        double r733046 = r733039 + r733045;
        return r733046;
}

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