Average Error: 17.8 → 0.0
Time: 8.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 r23504900 = x;
        double r23504901 = y;
        double r23504902 = r23504900 * r23504901;
        double r23504903 = z;
        double r23504904 = r23504901 * r23504903;
        double r23504905 = r23504902 - r23504904;
        double r23504906 = r23504901 * r23504901;
        double r23504907 = r23504905 - r23504906;
        double r23504908 = r23504907 + r23504906;
        return r23504908;
}

double f(double x, double y, double z) {
        double r23504909 = y;
        double r23504910 = z;
        double r23504911 = -r23504910;
        double r23504912 = r23504909 * r23504911;
        double r23504913 = x;
        double r23504914 = r23504913 * r23504909;
        double r23504915 = r23504912 + r23504914;
        return r23504915;
}

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.8
Target0.0
Herbie0.0
\[\left(x - z\right) \cdot y\]

Derivation

  1. Initial program 17.8

    \[\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)))