Main:bigenough2 from A

Average Error: 0.0 → 0.0

Time: 4.9s

Precision: binary64

Cost: 6720

Math

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

↓

\[\mathsf{fma}\left(y, x + z, x\right) \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (+ z x))))

↓

(FPCore (x y z) :precision binary64 (fma y (+ x z) x))

C

double code(double x, double y, double z) {
	return x + (y * (z + x));
}

↓

double code(double x, double y, double z) {
	return fma(y, (x + z), x);
}

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z + x)))
end

↓

function code(x, y, z)
	return fma(y, Float64(x + z), x)
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_] := N[(y * N[(x + z), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 0.0

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

2. Simplified 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   Proof
   (fma.f64 y (+.f64 x z) x): 0 points increase in error, 0 points decrease in error
   (fma.f64 y (Rewrite<= +-commutative_binary64 (+.f64 z x)) x): 0 points increase in error, 0 points decrease in error
   (Rewrite<= fma-def_binary64 (+.f64 (*.f64 y (+.f64 z x)) x)): 3 points increase in error, 0 points decrease in error
   (Rewrite<= +-commutative_binary64 (+.f64 x (*.f64 y (+.f64 z x)))): 0 points increase in error, 0 points decrease in error

3. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(y, x + z, x\right) \]

Alternatives

Alternative 1
Error	25.2
Cost	984

\[\begin{array}{l} \mathbf{if}\;y \leq -7.5 \cdot 10^{+75}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq -241906161300961.78:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -9.48187904248524 \cdot 10^{-68}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 4.1483958688823703 \cdot 10^{-104}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 511715009402941:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{+219}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 2
Error	1.2
Cost	712

\[\begin{array}{l} \mathbf{if}\;y \leq -263662093.2655238:\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{elif}\;y \leq 1.7184184404411657 \cdot 10^{-17}:\\ \;\;\;\;x + y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot z + y \cdot x\\ \end{array} \]

Alternative 3
Error	13.6
Cost	584

\[\begin{array}{l} t_0 := y \cdot \left(x + z\right)\\ \mathbf{if}\;y \leq -9.48187904248524 \cdot 10^{-68}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 4.1483958688823703 \cdot 10^{-104}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 4
Error	1.2
Cost	584

\[\begin{array}{l} t_0 := y \cdot \left(x + z\right)\\ \mathbf{if}\;y \leq -263662093.2655238:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 1.7184184404411657 \cdot 10^{-17}:\\ \;\;\;\;x + y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 5
Error	0.0
Cost	576

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

Alternative 6
Error	24.7
Cost	456

\[\begin{array}{l} \mathbf{if}\;y \leq -263662093.2655238:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 114438433207655.92:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 7
Error	0.0
Cost	448

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

Alternative 8
Error	35.0
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022295 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))