function testMultipleOrPredicates_SomeIndexed() {
  var treeBefore =
      'project()\n' +
      '-select(combined_pred_or)\n' +
      '--select(combined_pred_or)\n' +
      '---table_access(Employee)\n';

  var treeAfter =
      'project()\n' +
      '-select(combined_pred_or)\n' +
      '--table_access_by_row_id(Employee)\n' +
      '---multi_index_range_scan()\n' +
      '----index_range_scan(Employee.fk_JobId, (300, unbound], natural)\n' +
      '----index_range_scan(' +
          'Employee.fk_DepartmentId, (400, unbound], natural)\n';

  var tree = constructTreeWithPredicates(
      [lf.op.or(e['id'].gt(100), e['commissionPercent'].gt(200)),
       lf.op.or(e['jobId'].gt(300), e['departmentId'].gt(400))]);
  lf.testing.treeutil.assertTreeTransformation(
      tree, treeBefore, treeAfter, pass);
}
Tests a tree where two separate OR predicates exist for the same table, but
only one of them could potentially be chosen by the optimizer. Ensures that
the optimizer finds that predicate and optimizes it.