/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)) *x+yz+*xy*xz+2*212.1*z0+z1z2+*z0z1*z0z2*z0+z1z2c*z0z1*z0z2*z0+z1z2*z0+z1z2+*z0z1*z0z21c211012*2120+211112*z0+z1z2c*z0z1*z0z2*z0+z1z2c*z0z1*z0z2AProVEAProVE 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