data_source stringclasses 1 value | prompt listlengths 1 1 | ability stringclasses 1 value | reward_model dict | member bool 2 classes | extra_info dict |
|---|---|---|---|---|---|
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1111,
"ground_truth": 1111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 9
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1000,
"ground_truth": 1000,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 21
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1111,
"ground_truth": 1111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 6
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1110,
"ground_truth": 1110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 18
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 33
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1110,
"ground_truth": 1110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 42
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1010,
"ground_truth": 1010,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 0
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1000,
"ground_truth": 1000,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 27
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11110,
"ground_truth": 11110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 42
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10011,
"ground_truth": 10011,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 21
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11,
"ground_truth": 11,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 2
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10011,
"ground_truth": 10011,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 25
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 24
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10110,
"ground_truth": 10110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 2
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10110,
"ground_truth": 10110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 31
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11010,
"ground_truth": 11010,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 49
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11000,
"ground_truth": 11000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 1
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1,
"ground_truth": 1,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 11
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 4
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1110,
"ground_truth": 1110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 47
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 100,
"ground_truth": 100,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 44
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1100,
"ground_truth": 1100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 37
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 28
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10000,
"ground_truth": 10000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 30
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11,
"ground_truth": 11,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 7
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 7
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 111,
"ground_truth": 111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 29
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1101,
"ground_truth": 1101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 26
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11110,
"ground_truth": 11110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 26
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 28
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1001,
"ground_truth": 1001,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 38
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 0
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 101,
"ground_truth": 101,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 36
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10010,
"ground_truth": 10010,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 46
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1,
"ground_truth": 1,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 10
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11010,
"ground_truth": 11010,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 29
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1,
"ground_truth": 1,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 20
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1111,
"ground_truth": 1111,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 45
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 17
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 39
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10000,
"ground_truth": 10000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 41
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 40
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 110,
"ground_truth": 110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 39
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 5
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 18
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10011,
"ground_truth": 10011,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 1
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10111,
"ground_truth": 10111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 45
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 34
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1110,
"ground_truth": 1110,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 13
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 3
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 33
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11001,
"ground_truth": 11001,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 43
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 101,
"ground_truth": 101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 20
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11000,
"ground_truth": 11000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 37
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10110,
"ground_truth": 10110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 43
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1011,
"ground_truth": 1011,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 23
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 100,
"ground_truth": 100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 32
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 25
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1110,
"ground_truth": 1110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 23
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 46
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 111,
"ground_truth": 111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 19
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 100,
"ground_truth": 100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 15
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10110,
"ground_truth": 10110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 48
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11001,
"ground_truth": 11001,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 5
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11111,
"ground_truth": 11111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 10
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11110,
"ground_truth": 11110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 9
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 111,
"ground_truth": 111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 12
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1010,
"ground_truth": 1010,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 31
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 22
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 111,
"ground_truth": 111,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 16
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1001,
"ground_truth": 1001,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 44
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11101,
"ground_truth": 11101,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 32
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10010,
"ground_truth": 10010,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 17
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1000,
"ground_truth": 1000,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 34
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1000,
"ground_truth": 1000,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 30
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1000,
"ground_truth": 1000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 8
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11000,
"ground_truth": 11000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 24
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 38
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11011,
"ground_truth": 11011,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 48
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10111,
"ground_truth": 10111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 4
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1010,
"ground_truth": 1010,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 49
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 100,
"ground_truth": 100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 6
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10100,
"ground_truth": 10100,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 40
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10101,
"ground_truth": 10101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 11
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11000,
"ground_truth": 11000,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 35
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10,
"ground_truth": 10,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 41
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1000,
"ground_truth": 1000,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 22
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 19
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10101,
"ground_truth": 10101,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 35
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10111,
"ground_truth": 10111,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 14
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10011,
"ground_truth": 10011,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 47
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1110,
"ground_truth": 1110,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 12
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1010,
"ground_truth": 1010,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 3
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10,
"ground_truth": 10,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 14
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 0,
"ground_truth": 0,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 13
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11100,
"ground_truth": 11100,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 16
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 1001,
"ground_truth": 1001,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 36
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 11,
"ground_truth": 11,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 15
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 10100,
"ground_truth": 10100,
"style": "rule"
} | false | {
"k_vars": 5,
"n_sat": 3,
"original_id": 27
} |
sat | [
{
"content": "You are now required to solve a SAT (Boolean Satisfiability) problem. The problem is provided in JSON format, containing the following fields:\n\n- \"n_sat\": The number of variables in each clause (n-SAT problem).\n- \"k\": The total number of distinct variables in the problem.\n- \"clause\": A s... | logical_reasoning | {
"full_solution": 100,
"ground_truth": 100,
"style": "rule"
} | true | {
"k_vars": 5,
"n_sat": 3,
"original_id": 8
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.