Average Error: 0.0 → 0.0
Time: 2.3s
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 r7129 = x;
        double r7130 = y;
        double r7131 = z;
        double r7132 = r7131 - r7129;
        double r7133 = r7130 * r7132;
        double r7134 = r7129 + r7133;
        return r7134;
}
↓
double f(double x, double y, double z) {
        double r7135 = x;
        double r7136 = y;
        double r7137 = z;
        double r7138 = r7136 * r7137;
        double r7139 = -r7135;
        double r7140 = r7136 * r7139;
        double r7141 = r7138 + r7140;
        double r7142 = r7135 + r7141;
        return r7142;
}

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 2020025 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))