WORST_CASE(?, O(n^1)) fCx1x2Cfx1fx2fZZeqZListCx1x2Cy1y2andeqZListx1y1eqZListx2y2eqZListCx1x2ZFalseeqZListZCy1y2FalseeqZListZZTruesecondCx1x2x2firstCx1x2x1gxxandFalseFalseFalseandTrueFalseFalseandFalseTrueFalseandTrueTrueTrueC2Z0False0True0f1eqZList2second1first1g1and212.1fCz0z1Cfz0fz1fCz0z1c4fz0fz1fZZfZc5eqZListCz0z1Cz2z3andeqZListz0z2eqZListz1z3eqZListCz0z1Cz2z3c6andeqZListz0z2eqZListz1z3eqZListz0z2eqZListz1z3eqZListCz0z1ZFalseeqZListCz0z1Zc7eqZListZCz0z1FalseeqZListZCz0z1c8eqZListZZTrueeqZListZZc9secondCz0z1z1secondCz0z1c10firstCz0z1z0firstCz0z1c11gz0z0gz0c12andFalseFalseFalseandFalseFalsecandTrueFalseFalseandTrueFalsec1andFalseTrueFalseandFalseTruec2andTrueTrueTrueandTrueTruec3andFalseFalseandTrueFalseandFalseTrueandTrueTruefCz0z1fZeqZListCz0z1Cz2z3eqZListCz0z1ZeqZListZCz0z1eqZListZZsecondCz0z1firstCz0z1gz0fCz0z1Cfz0fz1fZZsecondCz0z1z1firstCz0z1z0gz0z01c00c100c200c300c4211012c500c631101213c700c800c900c1000c1100c1200eqZList211112and2111and20f1110eqZList211112second1110first1111g11C211112Z01False01True01fCz0z1c4fz0fz1fZc5eqZListCz0z1Cz2z3c6andeqZListz0z2eqZListz1z3eqZListz0z2eqZListz1z3eqZListCz0z1Zc7eqZListZCz0z1c8eqZListZZc9secondCz0z1c10firstCz0z1c11gz0c12andFalseFalsecandTrueFalsec1andFalseTruec2andTrueTruec3fCz0z1c4fz0fz1fZc5eqZListCz0z1Cz2z3c6andeqZListz0z2eqZListz1z3eqZListz0z2eqZListz1z3eqZListCz0z1Zc7eqZListZCz0z1c8eqZListZZc9secondCz0z1c10firstCz0z1c11gz0c12AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (4 real / 0 unknown / 0 assumptions / 4 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe