Average Error: 17.1 → 0.0
Time: 18.4s
Precision: 64
\[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y\]
↓
\[y \cdot \left(-z\right) + x \cdot y\]
\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y
↓
y \cdot \left(-z\right) + x \cdot y
double f(double x, double y, double z) {
        double r19740394 = x;
        double r19740395 = y;
        double r19740396 = r19740394 * r19740395;
        double r19740397 = r19740395 * r19740395;
        double r19740398 = r19740396 + r19740397;
        double r19740399 = z;
        double r19740400 = r19740395 * r19740399;
        double r19740401 = r19740398 - r19740400;
        double r19740402 = r19740401 - r19740397;
        return r19740402;
}
↓
double f(double x, double y, double z) {
        double r19740403 = y;
        double r19740404 = z;
        double r19740405 = -r19740404;
        double r19740406 = r19740403 * r19740405;
        double r19740407 = x;
        double r19740408 = r19740407 * r19740403;
        double r19740409 = r19740406 + r19740408;
        return r19740409;
}

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

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

Derivation

  1. Initial program 17.1

    \[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\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 2019171 +o rules:numerics
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, C"

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

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