Average Error: 0.1 → 0.1
Time: 19.8s
Precision: 64
\[\left(x \cdot 3\right) \cdot y - z\]
↓
\[\left(x \cdot 3\right) \cdot y - z\]
\left(x \cdot 3\right) \cdot y - z
↓
\left(x \cdot 3\right) \cdot y - z
double f(double x, double y, double z) {
        double r871036 = x;
        double r871037 = 3.0;
        double r871038 = r871036 * r871037;
        double r871039 = y;
        double r871040 = r871038 * r871039;
        double r871041 = z;
        double r871042 = r871040 - r871041;
        return r871042;
}
↓
double f(double x, double y, double z) {
        double r871043 = x;
        double r871044 = 3.0;
        double r871045 = r871043 * r871044;
        double r871046 = y;
        double r871047 = r871045 * r871046;
        double r871048 = z;
        double r871049 = r871047 - r871048;
        return r871049;
}

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
\[x \cdot \left(3 \cdot y\right) - z\]

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2020047 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"
  :precision binary64

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

  (- (* (* x 3) y) z))