Rosa's Benchmark

Percentage Accurate: 99.8% → 99.8%

Time: 13.3s

Alternatives: 4

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.954929658551372d0 * x) - (0.12900613773279798d0 * ((x * x) * x))
end function

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(Float64(x * x) * x)))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.954929658551372d0 * x) - (0.12900613773279798d0 * ((x * x) * x))
end function

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(Float64(x * x) * x)))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (fma 0.954929658551372 x (* (pow x 3.0) -0.12900613773279798)))

C

double code(double x) {
	return fma(0.954929658551372, x, (pow(x, 3.0) * -0.12900613773279798));
}

Julia

function code(x)
	return fma(0.954929658551372, x, Float64((x ^ 3.0) * -0.12900613773279798))
end

Wolfram

code[x_] := N[(0.954929658551372 * x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.12900613773279798), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Step-by-step derivation

   1. fmm-def 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, -0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right)\right)} \]

   2. *-commutative 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, -\color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot 0.12900613773279798}\right) \]

   3. distribute-rgt-neg-in 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot \left(-0.12900613773279798\right)}\right) \]

   4. unpow3 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{{x}^{3}} \cdot \left(-0.12900613773279798\right)\right) \]

   5. metadata-eval 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot \color{blue}{-0.12900613773279798}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 73.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(x \cdot \left(x \cdot x\right)\right) \leq -0.1:\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.954929658551372 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<=
      (- (* 0.954929658551372 x) (* 0.12900613773279798 (* x (* x x))))
      -0.1)
   (* x (* -0.12900613773279798 (* x x)))
   (* 0.954929658551372 x)))

C

double code(double x) {
	double tmp;
	if (((0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)))) <= -0.1) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else {
		tmp = 0.954929658551372 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (((0.954929658551372d0 * x) - (0.12900613773279798d0 * (x * (x * x)))) <= (-0.1d0)) then
        tmp = x * ((-0.12900613773279798d0) * (x * x))
    else
        tmp = 0.954929658551372d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (((0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)))) <= -0.1) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else {
		tmp = 0.954929658551372 * x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if ((0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)))) <= -0.1:
		tmp = x * (-0.12900613773279798 * (x * x))
	else:
		tmp = 0.954929658551372 * x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(x * Float64(x * x)))) <= -0.1)
		tmp = Float64(x * Float64(-0.12900613773279798 * Float64(x * x)));
	else
		tmp = Float64(0.954929658551372 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)))) <= -0.1)
		tmp = x * (-0.12900613773279798 * (x * x));
	else
		tmp = 0.954929658551372 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -0.1], N[(x * N[(-0.12900613773279798 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.954929658551372 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 #s(literal 238732414637843/250000000000000 binary64) x) (*.f64 #s(literal 6450306886639899/50000000000000000 binary64) (*.f64 (*.f64 x x) x))) < -0.10000000000000001

   1. Initial program 99.9%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. fmm-def 99.9%

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, -0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right)\right)} \]

      2. *-commutative 99.9%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, -\color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot 0.12900613773279798}\right) \]

      3. distribute-rgt-neg-in 99.9%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot \left(-0.12900613773279798\right)}\right) \]

      4. unpow3 99.9%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{{x}^{3}} \cdot \left(-0.12900613773279798\right)\right) \]

      5. metadata-eval 99.9%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot \color{blue}{-0.12900613773279798}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.7%

      \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 + -0.12900613773279798 \cdot {x}^{2}\right)} \]
   6. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2} + 0.954929658551372\right)} \]

      2. *-commutative 99.7%

         \[\leadsto x \cdot \left(\color{blue}{{x}^{2} \cdot -0.12900613773279798} + 0.954929658551372\right) \]

      3. fma-define 99.7%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left({x}^{2}, -0.12900613773279798, 0.954929658551372\right)} \]

   7. Simplified 99.7%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left({x}^{2}, -0.12900613773279798, 0.954929658551372\right)} \]

   8. Taylor expanded in x around inf 98.5%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   9. Step-by-step derivation

      1. pow2 98.5%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

   10. Applied egg-rr 98.5%

       \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

   if -0.10000000000000001 < (-.f64 (*.f64 #s(literal 238732414637843/250000000000000 binary64) x) (*.f64 #s(literal 6450306886639899/50000000000000000 binary64) (*.f64 (*.f64 x x) x)))

   1. Initial program 99.7%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. fmm-def 99.8%

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, -0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right)\right)} \]

      2. *-commutative 99.8%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, -\color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot 0.12900613773279798}\right) \]

      3. distribute-rgt-neg-in 99.8%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot \left(-0.12900613773279798\right)}\right) \]

      4. unpow3 99.8%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{{x}^{3}} \cdot \left(-0.12900613773279798\right)\right) \]

      5. metadata-eval 99.8%

         \[\leadsto \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot \color{blue}{-0.12900613773279798}\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 63.7%

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

      1. *-commutative 63.7%

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

   7. Simplified 63.7%

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

4. Final simplification 72.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(x \cdot \left(x \cdot x\right)\right) \leq -0.1:\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.954929658551372 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(x \cdot \left(x \cdot x\right)\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* x (* x x)))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.954929658551372d0 * x) - (0.12900613773279798d0 * (x * (x * x)))
end function

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(x * Float64(x * x))))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Add Preprocessing

3. Final simplification 99.8%

   \[\leadsto 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(x \cdot \left(x \cdot x\right)\right) \]
4. Add Preprocessing

Alternative 4: 49.5% accurate, 3.7× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (* 0.954929658551372 x))

C

double code(double x) {
	return 0.954929658551372 * x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.954929658551372d0 * x
end function

Java

public static double code(double x) {
	return 0.954929658551372 * x;
}

Python

def code(x):
	return 0.954929658551372 * x

Julia

function code(x)
	return Float64(0.954929658551372 * x)
end

MATLAB

function tmp = code(x)
	tmp = 0.954929658551372 * x;
end

Wolfram

code[x_] := N[(0.954929658551372 * x), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Step-by-step derivation

   1. fmm-def 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, -0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right)\right)} \]

   2. *-commutative 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, -\color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot 0.12900613773279798}\right) \]

   3. distribute-rgt-neg-in 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot \left(-0.12900613773279798\right)}\right) \]

   4. unpow3 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{{x}^{3}} \cdot \left(-0.12900613773279798\right)\right) \]

   5. metadata-eval 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot \color{blue}{-0.12900613773279798}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 47.1%

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

   1. *-commutative 47.1%

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

7. Simplified 47.1%

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

8. Final simplification 47.1%

   \[\leadsto 0.954929658551372 \cdot x \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024191 
(FPCore (x)
  :name "Rosa's Benchmark"
  :precision binary64
  (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))