Average Error: 0.1 → 0.1
Time: 2.7s
Precision: 64
\[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z\]
↓
\[\left(3 \cdot z\right) \cdot z + x \cdot y\]
\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z
↓
\left(3 \cdot z\right) \cdot z + x \cdot y
double f(double x, double y, double z) {
        double r606904 = x;
        double r606905 = y;
        double r606906 = r606904 * r606905;
        double r606907 = z;
        double r606908 = r606907 * r606907;
        double r606909 = r606906 + r606908;
        double r606910 = r606909 + r606908;
        double r606911 = r606910 + r606908;
        return r606911;
}
↓
double f(double x, double y, double z) {
        double r606912 = 3.0;
        double r606913 = z;
        double r606914 = r606912 * r606913;
        double r606915 = r606914 * r606913;
        double r606916 = x;
        double r606917 = y;
        double r606918 = r606916 * r606917;
        double r606919 = r606915 + r606918;
        return r606919;
}

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

Original0.1
Target0.1
Herbie0.1
\[\left(3 \cdot z\right) \cdot z + y \cdot x\]

Derivation

  1. Initial program 0.1

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

  2. Simplified0.1

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

  4. Applied associate-*r*0.1

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

  5. Final simplification0.1

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

Reproduce

herbie shell --seed 2020001 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
  :precision binary64

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

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