Average Error: 0 → 0
Time: 739.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 r338576 = x;
        double r338577 = 2.0;
        double r338578 = r338576 * r338577;
        double r338579 = r338578 * r338576;
        return r338579;
}
↓
double f(double x) {
        double r338580 = x;
        double r338581 = 2.0;
        double r338582 = r338580 * r338581;
        double r338583 = r338580 * r338582;
        return r338583;
}

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. Simplified0

    \[\leadsto \color{blue}{x \cdot \left(x \cdot 2\right)}\]

  3. Final simplification0

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

Reproduce

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

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

  (* (* x 2.0) x))