Average Error: 0.0 → 0.0
Time: 3.5s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
↓
\[x + \left(y \cdot z + y \cdot \left(-x\right)\right)\]
x + y \cdot \left(z - x\right)
↓
x + \left(y \cdot z + y \cdot \left(-x\right)\right)
double f(double x, double y, double z) {
        double r14697 = x;
        double r14698 = y;
        double r14699 = z;
        double r14700 = r14699 - r14697;
        double r14701 = r14698 * r14700;
        double r14702 = r14697 + r14701;
        return r14702;
}
↓
double f(double x, double y, double z) {
        double r14703 = x;
        double r14704 = y;
        double r14705 = z;
        double r14706 = r14704 * r14705;
        double r14707 = -r14703;
        double r14708 = r14704 * r14707;
        double r14709 = r14706 + r14708;
        double r14710 = r14703 + r14709;
        return r14710;
}

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

Derivation

  1. Initial program 0.0

    \[x + y \cdot \left(z - x\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto x + y \cdot \color{blue}{\left(z + \left(-x\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto x + \color{blue}{\left(y \cdot z + y \cdot \left(-x\right)\right)}\]

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020001 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))