Main:bigenough2 from A

Average Error: 0.0 → 0.0

Time: 2.8s

Precision: binary64

Cost: 448

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (z + x))
end function

↓

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (x + z))
end function

Java

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

↓

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

Python

def code(x, y, z):
	return x + (y * (z + x))

↓

def code(x, y, z):
	return x + (y * (x + z))

Julia

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

↓

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

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y * (z + x));
end

↓

function tmp = code(x, y, z)
	tmp = x + (y * (x + z));
end

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

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

2. Final simplification 0.0

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

Alternatives

Alternative 1
Error	24.3
Cost	852

\[\begin{array}{l} \mathbf{if}\;y \leq -4.2 \cdot 10^{+133}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq -261.6656354089385:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 4.430201284904959 \cdot 10^{-38}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{+106}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 6.2 \cdot 10^{+218}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 2
Error	16.3
Cost	584

\[\begin{array}{l} t_0 := x \cdot \left(y + 1\right)\\ \mathbf{if}\;x \leq -8.901550466599928 \cdot 10^{-130}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 4.054217095555388 \cdot 10^{-207}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 3
Error	12.2
Cost	584

\[\begin{array}{l} t_0 := y \cdot \left(x + z\right)\\ \mathbf{if}\;y \leq -0.01945197776208129:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 181.34251334716734:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 4
Error	12.2
Cost	584

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

Alternative 5
Error	0.9
Cost	584

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

Alternative 6
Error	23.7
Cost	456

\[\begin{array}{l} \mathbf{if}\;y \leq -1.945123915103414 \cdot 10^{-5}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 4.430201284904959 \cdot 10^{-38}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 7
Error	35.0
Cost	64

\[x \]

Reproduce

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