Average Error: 0 → 0
Time: 813.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 r22917952 = x;
        double r22917953 = 2.0;
        double r22917954 = r22917952 * r22917953;
        double r22917955 = r22917954 * r22917952;
        return r22917955;
}
↓
double f(double x) {
        double r22917956 = x;
        double r22917957 = 2.0;
        double r22917958 = r22917956 * r22917957;
        double r22917959 = r22917956 * r22917958;
        return r22917959;
}

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 2019170 
(FPCore (x)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A"

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

  (* (* x 2.0) x))