Average Error: 0 → 0
Time: 844.0ms
Precision: 64
\[\left(x \cdot 2.0\right) \cdot x\]
↓
\[x \cdot \left(x \cdot 2.0\right)\]
\left(x \cdot 2.0\right) \cdot x
↓
x \cdot \left(x \cdot 2.0\right)
double f(double x) {
        double r26549179 = x;
        double r26549180 = 2.0;
        double r26549181 = r26549179 * r26549180;
        double r26549182 = r26549181 * r26549179;
        return r26549182;
}
↓
double f(double x) {
        double r26549183 = x;
        double r26549184 = 2.0;
        double r26549185 = r26549183 * r26549184;
        double r26549186 = r26549183 * r26549185;
        return r26549186;
}

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.0 \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0

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

  2. Final simplification0

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

Reproduce

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

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

  (* (* x 2.0) x))