Average Error: 0 → 0
Time: 888.0ms
Precision: 64
\[\left(x \cdot 2\right) \cdot x\]
↓
\[x \cdot \left(x \cdot 2\right)\]
\left(x \cdot 2\right) \cdot x
↓
x \cdot \left(x \cdot 2\right)
double f(double x) {
        double r9671721 = x;
        double r9671722 = 2.0;
        double r9671723 = r9671721 * r9671722;
        double r9671724 = r9671723 * r9671721;
        return r9671724;
}
↓
double f(double x) {
        double r9671725 = x;
        double r9671726 = 2.0;
        double r9671727 = r9671725 * r9671726;
        double r9671728 = r9671725 * r9671727;
        return r9671728;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0
Target0
Herbie0
\[\left(2 \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0

    \[\left(x \cdot 2\right) \cdot x\]

  2. Final simplification0

    \[\leadsto x \cdot \left(x \cdot 2\right)\]

Reproduce

herbie shell --seed 2019179 
(FPCore (x)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A"

  :herbie-target
  (* (* 2.0 x) x)

  (* (* x 2.0) x))