Average Error: 0.0 → 0.0
Time: 13.0s
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 r500637 = x;
        double r500638 = y;
        double r500639 = z;
        double r500640 = r500638 - r500639;
        double r500641 = t;
        double r500642 = r500641 - r500637;
        double r500643 = r500640 * r500642;
        double r500644 = r500637 + r500643;
        return r500644;
}
↓
double f(double x, double y, double z, double t) {
        double r500645 = x;
        double r500646 = y;
        double r500647 = z;
        double r500648 = r500646 - r500647;
        double r500649 = t;
        double r500650 = r500649 - r500645;
        double r500651 = r500648 * r500650;
        double r500652 = r500645 + r500651;
        return r500652;
}

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