Average Error: 0.1 → 0.1
Time: 2.8s
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 r496980 = x;
        double r496981 = y;
        double r496982 = r496980 * r496981;
        double r496983 = z;
        double r496984 = r496983 * r496983;
        double r496985 = r496982 + r496984;
        double r496986 = r496985 + r496984;
        double r496987 = r496986 + r496984;
        return r496987;
}

double f(double x, double y, double z) {
        double r496988 = 3.0;
        double r496989 = z;
        double r496990 = r496988 * r496989;
        double r496991 = r496990 * r496989;
        double r496992 = x;
        double r496993 = y;
        double r496994 = r496992 * r496993;
        double r496995 = r496991 + r496994;
        return r496995;
}

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