Update README.md
Browse files
README.md
CHANGED
|
@@ -6,3 +6,78 @@ configs:
|
|
| 6 |
- split: test
|
| 7 |
path: "dataset.parquet"
|
| 8 |
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 6 |
- split: test
|
| 7 |
path: "dataset.parquet"
|
| 8 |
---
|
| 9 |
+
# InvaR1ant Benchmark Dataset Card
|
| 10 |
+
|
| 11 |
+
## Overview
|
| 12 |
+
|
| 13 |
+
The InvaR1ant benchmark is a dataset designed to test the ability of language models to generalise invariant logical reasoning across different input sizes. Each example contains:
|
| 14 |
+
|
| 15 |
+
- A **question** with multiple examples of constraints for different input sizes N
|
| 16 |
+
- A target input size to predict constraints for
|
| 17 |
+
- An **answer** with the correct constraint for the target size
|
| 18 |
+
- Metadata including difficulty tier
|
| 19 |
+
|
| 20 |
+
## Dataset Statistics
|
| 21 |
+
|
| 22 |
+
### General Statistics
|
| 23 |
+
- **Total samples**: 671
|
| 24 |
+
- **Format**: Parquet file
|
| 25 |
+
|
| 26 |
+
### Token Lengths (Qwen2.5-3B tokenizer)
|
| 27 |
+
| Statistic | Questions | Answers |
|
| 28 |
+
|-----------|-----------|---------|
|
| 29 |
+
| Min | 117 | 27 |
|
| 30 |
+
| Max | 4,086 | 14,476 |
|
| 31 |
+
| Mean | 1,684 | 994 |
|
| 32 |
+
| Median | 1,521 | 493 |
|
| 33 |
+
| Total | 1,130,153 | 666,709 |
|
| 34 |
+
|
| 35 |
+
### Difficulty Distribution
|
| 36 |
+
| Tier | Count | Percentage | Avg Question Tokens | Avg Answer Tokens |
|
| 37 |
+
|---------|-------|------------|---------------------|-------------------|
|
| 38 |
+
| Small | 333 | 49.6% | 1,797 | 811 |
|
| 39 |
+
| Medium | 333 | 49.6% | 1,580 | 1,161 |
|
| 40 |
+
| Large | 5 | 0.7% | 1,107 | 2,022 |
|
| 41 |
+
|
| 42 |
+
*Note: Difficulty tier is based on the "jump" between the largest example N and the target N*
|
| 43 |
+
|
| 44 |
+
### Target N Distribution
|
| 45 |
+
- **Range**: 5 to 30
|
| 46 |
+
- **Mean**: 19.9
|
| 47 |
+
- **Median**: 20
|
| 48 |
+
- **Unique values**: 25 different values [5, 7, 8, 9, ..., 30]
|
| 49 |
+
|
| 50 |
+
### Examples Per Question
|
| 51 |
+
- **Range**: 3 to 18 examples
|
| 52 |
+
- **Mean**: 6.7
|
| 53 |
+
- **Median**: 6
|
| 54 |
+
- **Most common**: 3 examples (168 samples)
|
| 55 |
+
|
| 56 |
+
## Dataset Structure
|
| 57 |
+
|
| 58 |
+
### Input Format
|
| 59 |
+
Each question follows this template:
|
| 60 |
+
```
|
| 61 |
+
Given the following examples of constraints for increasing input sizes:
|
| 62 |
+
N=3: (assert (and (and (and ...)))
|
| 63 |
+
N=4: (assert (and (and (and ...)))
|
| 64 |
+
...
|
| 65 |
+
What is the constraint for N={target}?
|
| 66 |
+
```
|
| 67 |
+
|
| 68 |
+
### Output Format
|
| 69 |
+
Answers are SMT constraints for the target N value, typically in the form:
|
| 70 |
+
```
|
| 71 |
+
(assert (and (and (and ...))))
|
| 72 |
+
```
|
| 73 |
+
|
| 74 |
+
## Limitations
|
| 75 |
+
|
| 76 |
+
- Large tier samples are underrepresented (only 0.7% of the dataset)
|
| 77 |
+
- Question token length (up to 4,086 tokens) may exceed context windows of some models
|
| 78 |
+
- The dataset focuses specifically on SMT constraint generalization and may not reflect broader reasoning capabilities
|
| 79 |
+
- These answers were generated from a symbolic execution tool, therefore the constraints may not be in the simplest format. You should verify equivalence with a theorem prover like Z3
|
| 80 |
+
|
| 81 |
+
---
|
| 82 |
+
|
| 83 |
+
*Dataset created using the Qwen/Qwen2.5-3B tokenizer for length calculations*
|