Function main

scripts/rubi/triage-ch6.ts:32–150

()

}

function main() {
  const argv = process.argv;
  let rubiRules = '/tmp/rubi-all/corpus';
  let chapter = '6 Hyperbolic functions';
  let sample = 100;
  let seed = 42;
  let show = 0;
  let grep: string | null = null;
  const suite = path.join(
    os.homedir(),
    'dev/rubi/MathematicaSyntaxTestSuite-master'
  );
  for (let i = 2; i < argv.length; i++) {
    switch (argv[i]) {
      case '--rubi': rubiRules = argv[++i]; break;
      case '--chapter': chapter = argv[++i]; break;
      case '--sample': sample = parseInt(argv[++i]); break;
      case '--seed': seed = parseInt(argv[++i]); break;
      case '--show': show = parseInt(argv[++i]); break;
      case '--grep': grep = argv[++i]; break;
    }
  }

  const { problems } = loadTests(suite, chapter);
  let slice = problems;
  if (sample > 0) {
    const rand = mulberry32(seed);
    slice = [...problems]
      .map((p) => ({ p, k: rand() }))
      .sort((a, b) => a.k - b.k)
      .slice(0, sample)
      .map((x) => x.p)
      .sort((a, b) =>
        a.file === b.file ? a.index - b.index : a.file < b.file ? -1 : 1
      );
  }
  if (grep) slice = slice.filter((p) => p.source.includes(grep!));

  const ce = new ComputeEngine();
  const { rules } = compileSection(ce, rubiRules);
  console.log(`compiled ${rules.length} rules; ${slice.length} problems\n`);

  const unimpl = new Map<string, number>();
  const condFail = new Map<string, number>();
  const ruleFail = new Map<string, number>();
  let solved = 0;
  let noAttempt = 0; // no rule's skeleton even matched (dispatch/reduction gap)
  const noAttemptEx: string[] = [];
  const unsolvedEx: { src: string; firings: number; tail: string }[] = [];

  for (const p of slice) {
    const driver = new RubiDriver(ce, rules, {
      timeLimitMs: 15_000,
      trace: true,
    });
    // reset trace per problem
    driver.stats.trace.length = 0;
    let result: any = null;