Average Error: 17.1 → 0.0
Time: 12.7s
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 r31702013 = x;
        double r31702014 = y;
        double r31702015 = r31702013 * r31702014;
        double r31702016 = z;
        double r31702017 = r31702014 * r31702016;
        double r31702018 = r31702015 - r31702017;
        double r31702019 = r31702014 * r31702014;
        double r31702020 = r31702018 - r31702019;
        double r31702021 = r31702020 + r31702019;
        return r31702021;
}
↓
double f(double x, double y, double z) {
        double r31702022 = y;
        double r31702023 = z;
        double r31702024 = -r31702023;
        double r31702025 = r31702022 * r31702024;
        double r31702026 = x;
        double r31702027 = r31702026 * r31702022;
        double r31702028 = r31702025 + r31702027;
        return r31702028;
}

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