Main:bigenough2 from A

Percentage Accurate: 100.0% → 100.0%

Time: 5.7s

Alternatives: 8

Speedup: 1.0×

• 21.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x + y \cdot \left(z + x\right) \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(z + x\right) \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Step-by-step derivation

   1. +-commutative 100.0%

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

   2. fma-define 100.0%

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

   3. +-commutative 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 61.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{-18}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 7.2 \cdot 10^{-32}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.35 \cdot 10^{+29} \lor \neg \left(y \leq 1.36 \cdot 10^{+228}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -3.5e-18)
   (* y z)
   (if (<= y 7.2e-32)
     x
     (if (or (<= y 1.35e+29) (not (<= y 1.36e+228))) (* y z) (* y x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -3.5e-18) {
		tmp = y * z;
	} else if (y <= 7.2e-32) {
		tmp = x;
	} else if ((y <= 1.35e+29) || !(y <= 1.36e+228)) {
		tmp = y * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-3.5d-18)) then
        tmp = y * z
    else if (y <= 7.2d-32) then
        tmp = x
    else if ((y <= 1.35d+29) .or. (.not. (y <= 1.36d+228))) then
        tmp = y * z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -3.5e-18) {
		tmp = y * z;
	} else if (y <= 7.2e-32) {
		tmp = x;
	} else if ((y <= 1.35e+29) || !(y <= 1.36e+228)) {
		tmp = y * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -3.5e-18:
		tmp = y * z
	elif y <= 7.2e-32:
		tmp = x
	elif (y <= 1.35e+29) or not (y <= 1.36e+228):
		tmp = y * z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -3.5e-18)
		tmp = Float64(y * z);
	elseif (y <= 7.2e-32)
		tmp = x;
	elseif ((y <= 1.35e+29) || !(y <= 1.36e+228))
		tmp = Float64(y * z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -3.5e-18)
		tmp = y * z;
	elseif (y <= 7.2e-32)
		tmp = x;
	elseif ((y <= 1.35e+29) || ~((y <= 1.36e+228)))
		tmp = y * z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -3.5e-18], N[(y * z), $MachinePrecision], If[LessEqual[y, 7.2e-32], x, If[Or[LessEqual[y, 1.35e+29], N[Not[LessEqual[y, 1.36e+228]], $MachinePrecision]], N[(y * z), $MachinePrecision], N[(y * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.4999999999999999e-18 or 7.19999999999999986e-32 < y < 1.35e29 or 1.35999999999999996e228 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   4. Taylor expanded in x around 0 62.8%

      \[\leadsto \color{blue}{y \cdot z} \]

   if -3.4999999999999999e-18 < y < 7.19999999999999986e-32

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 79.3%

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

   4. Taylor expanded in y around 0 73.9%

      \[\leadsto \color{blue}{x} \]

   if 1.35e29 < y < 1.35999999999999996e228

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   4. Taylor expanded in z around inf 100.0%

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

   5. Taylor expanded in x around inf 71.3%

      \[\leadsto \color{blue}{x \cdot y} \]
   6. Step-by-step derivation

      1. *-commutative 71.3%

         \[\leadsto \color{blue}{y \cdot x} \]

   7. Simplified 71.3%

      \[\leadsto \color{blue}{y \cdot x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 69.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{-18}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 7.2 \cdot 10^{-32}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.35 \cdot 10^{+29} \lor \neg \left(y \leq 1.36 \cdot 10^{+228}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 0.0052\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 0.0052))) (* y (+ x z)) (+ x (* y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.0) || !(y <= 0.0052)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 0.0052d0))) then
        tmp = y * (x + z)
    else
        tmp = x + (y * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.0) || !(y <= 0.0052)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1.0) or not (y <= 0.0052):
		tmp = y * (x + z)
	else:
		tmp = x + (y * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 0.0052))
		tmp = Float64(y * Float64(x + z));
	else
		tmp = Float64(x + Float64(y * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 0.0052)))
		tmp = y * (x + z);
	else
		tmp = x + (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 0.0052]], $MachinePrecision]], N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.0051999999999999998 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   4. Taylor expanded in z around inf 98.8%

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

   if -1 < y < 0.0051999999999999998

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf 99.6%

      \[\leadsto x + \color{blue}{y \cdot z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 0.0052\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-35} \lor \neg \left(y \leq 5.8 \cdot 10^{-36}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -6e-35) (not (<= y 5.8e-36))) (* y (+ x z)) (+ x (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-35) || !(y <= 5.8e-36)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-6d-35)) .or. (.not. (y <= 5.8d-36))) then
        tmp = y * (x + z)
    else
        tmp = x + (y * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-35) || !(y <= 5.8e-36)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -6e-35) or not (y <= 5.8e-36):
		tmp = y * (x + z)
	else:
		tmp = x + (y * x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6e-35) || !(y <= 5.8e-36))
		tmp = Float64(y * Float64(x + z));
	else
		tmp = Float64(x + Float64(y * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -6e-35) || ~((y <= 5.8e-36)))
		tmp = y * (x + z);
	else
		tmp = x + (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6e-35], N[Not[LessEqual[y, 5.8e-36]], $MachinePrecision]], N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.99999999999999978e-35 or 5.80000000000000026e-36 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   4. Taylor expanded in z around inf 98.0%

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

   if -5.99999999999999978e-35 < y < 5.80000000000000026e-36

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 73.9%

      \[\leadsto x + \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. *-commutative 73.9%

         \[\leadsto x + \color{blue}{y \cdot x} \]

   5. Simplified 73.9%

      \[\leadsto x + \color{blue}{y \cdot x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-35} \lor \neg \left(y \leq 5.8 \cdot 10^{-36}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 84.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9.5 \cdot 10^{-21} \lor \neg \left(y \leq 6 \cdot 10^{-35}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -9.5e-21) (not (<= y 6e-35))) (* y (+ x z)) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -9.5e-21) || !(y <= 6e-35)) {
		tmp = y * (x + z);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-9.5d-21)) .or. (.not. (y <= 6d-35))) then
        tmp = y * (x + z)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -9.5e-21) || !(y <= 6e-35)) {
		tmp = y * (x + z);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -9.5e-21) or not (y <= 6e-35):
		tmp = y * (x + z)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -9.5e-21) || !(y <= 6e-35))
		tmp = Float64(y * Float64(x + z));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -9.5e-21) || ~((y <= 6e-35)))
		tmp = y * (x + z);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -9.5e-21], N[Not[LessEqual[y, 6e-35]], $MachinePrecision]], N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -9.4999999999999994e-21 or 5.99999999999999978e-35 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   4. Taylor expanded in z around inf 98.0%

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

   if -9.4999999999999994e-21 < y < 5.99999999999999978e-35

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 79.3%

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

   4. Taylor expanded in y around 0 73.9%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.5 \cdot 10^{-21} \lor \neg \left(y \leq 6 \cdot 10^{-35}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 60.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-7} \lor \neg \left(y \leq 15500\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -5e-7) (not (<= y 15500.0))) (* y x) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5e-7) || !(y <= 15500.0)) {
		tmp = y * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-5d-7)) .or. (.not. (y <= 15500.0d0))) then
        tmp = y * x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -5e-7) || !(y <= 15500.0)) {
		tmp = y * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -5e-7) or not (y <= 15500.0):
		tmp = y * x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -5e-7) || !(y <= 15500.0))
		tmp = Float64(y * x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -5e-7) || ~((y <= 15500.0)))
		tmp = y * x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -5e-7], N[Not[LessEqual[y, 15500.0]], $MachinePrecision]], N[(y * x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -4.99999999999999977e-7 or 15500 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 100.0%

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

   4. Taylor expanded in z around inf 98.8%

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

   5. Taylor expanded in x around inf 55.2%

      \[\leadsto \color{blue}{x \cdot y} \]
   6. Step-by-step derivation

      1. *-commutative 55.2%

         \[\leadsto \color{blue}{y \cdot x} \]

   7. Simplified 55.2%

      \[\leadsto \color{blue}{y \cdot x} \]

   if -4.99999999999999977e-7 < y < 15500

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 81.0%

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

   4. Taylor expanded in y around 0 68.2%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-7} \lor \neg \left(y \leq 15500\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(x + z\right) \end{array} \]

FPCore

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

C

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 * (x + z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto x + y \cdot \left(x + z\right) \]
4. Add Preprocessing

Alternative 8: 35.2% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

function code(x, y, z)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Add Preprocessing

3. Taylor expanded in y around inf 90.4%

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

4. Taylor expanded in y around 0 35.8%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

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