Average Error: 18.0 → 0.0
Time: 36.0s
Precision: 64
\[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]
↓
\[y \cdot \left(-z\right) + x \cdot y\]
\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y
↓
y \cdot \left(-z\right) + x \cdot y
double f(double x, double y, double z) {
        double r28506054 = x;
        double r28506055 = y;
        double r28506056 = r28506054 * r28506055;
        double r28506057 = z;
        double r28506058 = r28506055 * r28506057;
        double r28506059 = r28506056 - r28506058;
        double r28506060 = r28506055 * r28506055;
        double r28506061 = r28506059 - r28506060;
        double r28506062 = r28506061 + r28506060;
        return r28506062;
}
↓
double f(double x, double y, double z) {
        double r28506063 = y;
        double r28506064 = z;
        double r28506065 = -r28506064;
        double r28506066 = r28506063 * r28506065;
        double r28506067 = x;
        double r28506068 = r28506067 * r28506063;
        double r28506069 = r28506066 + r28506068;
        return r28506069;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original18.0
Target0.0
Herbie0.0
\[\left(x - z\right) \cdot y\]

Derivation

  1. Initial program 18.0

    \[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]

  2. Simplified0.0

    \[\leadsto \color{blue}{y \cdot \left(x - z\right)}\]
  3. Using strategy rm

  4. Applied sub-neg0.0

    \[\leadsto y \cdot \color{blue}{\left(x + \left(-z\right)\right)}\]

  5. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot y + \left(-z\right) \cdot y}\]

  6. Final simplification0.0

    \[\leadsto y \cdot \left(-z\right) + x \cdot y\]

Reproduce

herbie shell --seed 2019165 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, B"

  :herbie-target
  (* (- x z) y)

  (+ (- (- (* x y) (* y z)) (* y y)) (* y y)))