/export/starexec/sandbox/solver/bin/starexec_run_certified /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) add0Sxx2+S0add0x2xadd00x2x2+xS0Sx+S0ySyS100add02+212.1add0Sz0z1+S0add0z1z0add0Sz0z1c2+S0add0z1z0add0z1z0add00z0z0add00z0c3+z0S0Sz0+z0S0c+S0z0Sz0+S0z0c1+z0S0+S0z0add0Sz0z1add00z01c00c100c2211012c300add0211112+2111+20add021S11001add00z0c3+z0S0c+S0z0c1add0Sz0z1c2+S0add0z1z0add0z1z0add00z0c31c00c100c2211012c300add0211012+211012+20add0211012S1111000add0Sz0z1c2+S0add0z1z0add0z1z0+z0S0c+S0z0c1add0Sz0z1c2+S0add0z1z0add0z1z0add00z0c3AProVEAProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Statistics for single proof: 100.00 % (4 real / 0 unknown / 0 assumptions / 4 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe