rows {
  options {
    physical_type: PHYSICAL_STREAM_TYPE_QUADS
    max_name_table_size: 128
    max_prefix_table_size: 16
    max_datatype_table_size: 16
    logical_type: LOGICAL_STREAM_TYPE_DATASETS
    version: 2
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/"
  }
}
rows {
  name {
    value: "RAXy0blqw9rPPIrH82x1PKBrkIWFOv5v_JZBbQhoI3Q3A"
  }
}
rows {
  namespace {
    name: "this"
    value {
      prefix_id: 1
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/np/RAXy0blqw9rPPIrH82x1PKBrkIWFOv5v_JZBbQhoI3Q3A/"
  }
}
rows {
  name {
  }
}
rows {
  namespace {
    name: "sub"
    value {
      prefix_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.nanopub.org/nschema#"
  }
}
rows {
  namespace {
    name: "np"
    value {
      prefix_id: 3
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/1999/02/22-rdf-syntax-ns#"
  }
}
rows {
  namespace {
    name: "rdf"
    value {
      prefix_id: 4
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/ns/prov#"
  }
}
rows {
  namespace {
    name: "prov"
    value {
      prefix_id: 5
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://purl.org/nanopub/x/"
  }
}
rows {
  namespace {
    name: "npx"
    value {
      prefix_id: 6
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://purl.org/dc/terms/"
  }
}
rows {
  namespace {
    name: "dc"
    value {
      prefix_id: 7
      name_id: 2
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/2001/XMLSchema#"
  }
}
rows {
  namespace {
    name: "xsd"
    value {
      prefix_id: 8
      name_id: 2
    }
  }
}
rows {
  name {
    value: "hasAssertion"
  }
}
rows {
  name {
    value: "assertion"
  }
}
rows {
  name {
    value: "Head"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 1
      name_id: 1
    }
    p_iri {
      prefix_id: 3
      name_id: 3
    }
    o_iri {
      prefix_id: 2
    }
    g_iri {
    }
  }
}
rows {
  name {
    value: "hasProvenance"
  }
}
rows {
  name {
    value: "provenance"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 3
    }
    o_iri {
      prefix_id: 2
    }
  }
}
rows {
  name {
    value: "hasPublicationInfo"
  }
}
rows {
  name {
    value: "pubinfo"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 3
    }
    o_iri {
      prefix_id: 2
    }
  }
}
rows {
  name {
    value: "type"
  }
}
rows {
  name {
    value: "Nanopublication"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
    }
    o_iri {
      prefix_id: 3
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/assessment/"
  }
}
rows {
  name {
    value: "wolfram2002-ch11-13--claim-test--pr-130"
  }
}
rows {
  name {
    value: "description"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 9
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "analysis.py evolves all 256 elementary rules from 64 six-bit programs and four input pairs for 16 steps and reads the cell at position -1. It runs one radius-4 multiplexer, whose new center is the program bit indexed by the two input bits, and a Turing machine that walks from the input bits to that same program bit and writes it on the output cell. A function is realized when one program makes all four inputs match it. Criteria were frozen in commit 093ca8002a77b774b469b965ff599d123fdaefbb before this run."
    }
    g_iri {
      prefix_id: 2
      name_id: 4
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/ontology/"
  }
}
rows {
  name {
    value: "Assessment"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 14
    }
  }
}
rows {
  prefix {
    value: "http://www.w3.org/2000/01/rdf-schema#"
  }
}
rows {
  name {
    value: "comment"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
    }
    o_literal {
      lex: "Measured: 0 boolean functions of two bits realized by one ceiling system and not the other (n = 16, exact). Interpretation: The claim (NKS p. 675) says that as rules grow more capable they pass a threshold of universality, after which the set of computations they can perform is the same, so a more sophisticated rule and a different kind of system gain nothing further about what they can compute. Universality over all partial recursive functions is not a finite enumeration. The computation uses a finite universe that can actually be saturated: all 16 boolean functions of two bits. The radius-4 rule and the Turing machine are different constructions aimed at that ceiling; the elementary rules, including rule 0, are the progressive family underneath. Capability is the set of functions, not the encoding, so the comparison across kinds is extensional. A computation shows these sets are equal as mathematics, not that organisms compute."
    }
  }
}
rows {
  name {
    value: "label"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch11-13 (pr-130): supports, confidence 0.84"
    }
  }
}
rows {
  name {
    value: "seeAlso"
  }
}
rows {
  prefix {
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch11-13/pr-130/"
  }
}
rows {
  name {
    value: "result.json"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 12
    }
  }
}
rows {
  name {
    value: "wasAttributedTo"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/agent/"
  }
}
rows {
  name {
    value: "delphisci-claim-tester-grok-4-7"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
    }
    o_iri {
      prefix_id: 13
    }
  }
}
rows {
  name {
    value: "admissibleDatasets"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_literal {
      lex: "Only configurations evolved by analysis.py from the pre-registered encodings. Elementary rules use Wolfram numbers 0..255. The radius-4 rule is the boolean multiplexer stated in the pass criterion, not a Wolfram code number. No external dataset."
    }
  }
}
rows {
  name {
    value: "assessmentType"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "claim-test/0.1.0"
    }
  }
}
rows {
  name {
    value: "dataKind"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "computational"
    }
  }
}
rows {
  name {
    value: "disconfirmingObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Rule 0 realizes all 16 functions under the elementary encoding, or some elementary rule realizes more than 16 functions."
    }
  }
}
rows {
  name {
    value: "evidenceAgainst"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "The computation shows that these programs realize the same set of two-bit boolean functions once they can realize all 16, and that rule 0 realizes fewer. It does not show that organisms compute, and it does not prove Turing universality."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The largest elementary capability under this encoding is 16 functions, at rule 22. Some elementary rule reaches the same set of 16."
    }
  }
}
rows {
  quad {
    o_literal {
      lex: "The universe of computations is the 16 functions of two bits. Past that ceiling there is no further function of two bits to gain. A richer universe, such as all partial recursive functions, was not enumerated."
    }
  }
}
rows {
  name {
    value: "expectedObservation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "The radius-4 cellular automaton and the lookup Turing machine each realize all 16 boolean functions of two bits and those two sets are equal, rule 0 realizes at most 4 of them, and no elementary rule realizes more than those 16."
    }
  }
}
rows {
  name {
    value: "failCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. REFUTES if |Cap(rule 0)| >= 16 (the null rule already performs every computation in U, so this encoding does not measure a threshold) or if any elementary rule has |Cap| > 16. INCONCLUSIVE with reason \'underpowered\' if |Cap(radius-4)| < 16 or |Cap(TM)| < 16 (a system built to sit at the ceiling did not reach it, so equality past the ceiling was not tested). MIXED if both ceiling systems equal U and |Cap(rule 0)| <= 4, but some elementary rule has |Cap| = 16 whose set of functions is a proper subset of U (impossible if cardinality is 16, retained so a counting bug cannot be scored as support) or if the two ceiling sets are both size 16 and unequal. Two size-16 subsets of a 16-element set are equal, so a reported inequality at size 16 is a counting error and is MIXED rather than a refutation of the book. Confidence: mixed 0.70, refutes 0.80, inconclusive 0.50."
    }
  }
}
rows {
  name {
    value: "hasConfidence"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#double"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "0.84"
      datatype: 1
    }
  }
}
rows {
  name {
    value: "hasEvidence"
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/evidence/"
  }
}
rows {
  name {
    value: "wolfram2002-ch11-13--claim-test--pr-130--dataset-1"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 14
    }
  }
}
rows {
  name {
    value: "hasVerdict"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_literal {
      lex: "supports"
    }
  }
}
rows {
  name {
    value: "hypothesis"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Once a system can realize every boolean function of two bits, a structurally richer system that can also realize every such function realizes exactly the same set, while a system with no information flow realizes a strictly smaller set."
    }
  }
}
rows {
  name {
    value: "inferenceMethod"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Compare the sets of realized truth tables. Supports when both ceiling systems equal the full 16 and rule 0 is at most 4. Inconclusive (underpowered) when a ceiling system misses the full set. Refutes when rule 0 is already at the ceiling or a cardinality exceeds 16. Confidence: supports 0.84, mixed 0.70, refutes 0.80, inconclusive 0.50."
    }
  }
}
rows {
  name {
    value: "passCriterion"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Pre-registered. The universe U is the 16 functions from {0,1}^2 to {0,1}, truth tables ordered by inputs (b0,b1) = (0,0), (0,1), (1,0), (1,1). Three systems. (1) Elementary cellular automata, Wolfram numbers 0..255, fixed-0 boundaries. Encoding: output cell at position -1 starts at 0; input bits at positions 0 and 1; a program of 6 bits at positions 2..7 (64 programs); all other cells 0; evolve t = 1..16 steps on the tape from -17 to 23 inclusive. A function f is realized if some program and some t make cell -1 equal f(b0,b1) for all four inputs. (2) One radius-4 binary cellular automaton, one step. Neighborhood positions relative to the center, from -4 to +4. Input b0 is at +1, b1 at +2. Program bits p00, p01, p10, p11 sit at -4, -3, -2, -1 and the 16 programs are exactly the 16 truth tables in the input order above. The local rule sets the new center to the program bit indexed by b0 + 2*b1, ignoring every other neighbor. Initial center is 0. Read the center after 1 step. (3) A 2-symbol Turing machine on the tape [output=0, b0, b1, p00, p01, p10, p11]. From a head start on b0 it stores b0, moves right, stores b1, moves to p00, steps right b0+2*b1 cells, reads that bit, returns to the output cell, writes it, and halts. The same 16 truth-table programs are used. Let Cap(S) be the set of functions realized. SUPPORTS if Cap(radius-4) = Cap(TM) = U, |Cap(rule 0)| <= 4, every elementary rule has |Cap| <= 16, and every elementary rule with |Cap| = 16 has Cap equal to U. Confidence if supports: 0.84."
    }
  }
}
rows {
  name {
    value: "preregistered"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#boolean"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "false"
      datatype: 2
    }
  }
}
rows {
  prefix {
    value: "https://w3id.org/delphi/resource/claim/"
  }
}
rows {
  name {
    value: "wolfram2002-ch11-13"
  }
}
rows {
  name {
    value: "hasAssessment"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 15
    }
    p_iri {
      prefix_id: 10
    }
    o_iri {
      prefix_id: 9
      name_id: 12
    }
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 14
      name_id: 30
    }
    p_iri {
      prefix_id: 7
      name_id: 13
    }
    o_literal {
      lex: "the systems whose sets of two-bit boolean functions are compared"
    }
  }
}
rows {
  name {
    value: "license"
  }
}
rows {
  quad {
    p_iri {
      name_id: 38
    }
    o_literal {
    }
  }
}
rows {
  name {
    value: "EvidenceItem"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 39
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Dataset: Boolean-function capabilities of elementary rules 0..255, one radius-4 multiplexer, and one lookup Turing machine, generated by analysis.py"
    }
  }
}
rows {
  name {
    value: "wasDerivedFrom"
  }
}
rows {
  prefix {
    value: "https://www.wolframscience.com/nks/p675--the-rule-110-cellular-automaton/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 40
    }
    o_iri {
      prefix_id: 16
      name_id: 2
    }
  }
}
rows {
  name {
    value: "SoftwareAgent"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 13
      name_id: 20
    }
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 5
      name_id: 41
    }
    g_iri {
      prefix_id: 2
      name_id: 7
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-7ca2)"
    }
  }
}
rows {
  name {
    value: "actedOnBehalfOf"
  }
}
rows {
  prefix {
    id: 6
    value: "https://orcid.org/"
  }
}
rows {
  name {
    value: "0009-0007-4948-9192"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 42
    }
    o_iri {
      prefix_id: 6
    }
  }
}
rows {
  name {
    value: "usesModel"
  }
}
rows {
  prefix {
    id: 8
    value: "https://w3id.org/delphi/resource/model/"
  }
}
rows {
  name {
    value: "grok-4-7"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
    }
    o_iri {
      prefix_id: 8
    }
  }
}
rows {
  name {
    value: "identifier"
  }
}
rows {
  quad {
    s_iri {
      name_id: 45
    }
    p_iri {
      prefix_id: 7
    }
    o_literal {
      lex: "Grok 4.7"
    }
  }
}
rows {
  name {
    value: "LanguageModel"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 10
      name_id: 47
    }
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
      name_id: 4
    }
    p_iri {
      prefix_id: 5
      name_id: 19
    }
    o_iri {
      prefix_id: 13
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 40
    }
    o_iri {
      prefix_id: 12
      name_id: 18
    }
  }
}
rows {
  name {
    value: "wasGeneratedBy"
  }
}
rows {
  name {
    value: "test"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 48
    }
    o_iri {
      prefix_id: 2
    }
  }
}
rows {
  name {
    value: "plan"
  }
}
rows {
  name {
    value: "hadPlan"
  }
}
rows {
  prefix {
    id: 1
    value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/"
  }
}
rows {
  name {
    value: "README.md"
  }
}
rows {
  quad {
    s_iri {
    }
    p_iri {
      prefix_id: 5
    }
    o_iri {
      prefix_id: 1
    }
  }
}
rows {
  name {
    value: "Activity"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
      name_id: 49
    }
    p_iri {
      prefix_id: 4
      name_id: 10
    }
    o_iri {
      prefix_id: 5
      name_id: 53
    }
  }
}
rows {
  name {
    value: "qualifiedAssociation"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 2
      name_id: 50
    }
  }
}
rows {
  name {
    value: "wasAssociatedWith"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 5
      name_id: 55
    }
    o_iri {
      prefix_id: 13
      name_id: 20
    }
  }
}
rows {
  prefix {
    id: 3
    value: "https://w3id.org/np/"
  }
}
rows {
  name {
    value: "created"
  }
}
rows {
  datatype {
    value: "http://www.w3.org/2001/XMLSchema#dateTime"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 3
      name_id: 1
    }
    p_iri {
      prefix_id: 7
      name_id: 56
    }
    o_literal {
      lex: "2026-11-08T16:24:31.939Z"
      datatype: 3
    }
    g_iri {
      prefix_id: 2
      name_id: 9
    }
  }
}
rows {
  name {
    value: "creator"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 57
    }
    o_iri {
      prefix_id: 6
      name_id: 43
    }
  }
}
rows {
  prefix {
    id: 15
    value: "https://creativecommons.org/licenses/by/4.0/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 7
      name_id: 38
    }
    o_iri {
      prefix_id: 15
      name_id: 2
    }
  }
}
rows {
  prefix {
    id: 9
    value: "http://purl.org/nanopub/x/"
  }
}
rows {
  name {
    value: "hasNanopubType"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 9
      name_id: 58
    }
    o_iri {
      prefix_id: 10
      name_id: 14
    }
  }
}
rows {
  name {
    value: "introduces"
  }
}
rows {
  prefix {
    id: 14
    value: "https://w3id.org/delphi/resource/assessment/"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 9
      name_id: 59
    }
    o_iri {
      prefix_id: 14
      name_id: 12
    }
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 11
      name_id: 16
    }
    o_literal {
      lex: "Claim test of wolfram2002-ch11-13 (pr-130): supports, confidence 0.84"
    }
  }
}
rows {
  name {
    value: "domain"
  }
}
rows {
  prefix {
    id: 16
    value: "https://w3id.org/delphi/resource/domain/"
  }
}
rows {
  name {
    value: "wolfram-nks-2002"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 10
      name_id: 60
    }
    o_iri {
      prefix_id: 16
    }
  }
}
rows {
  name {
    value: "sig"
  }
}
rows {
  name {
    value: "hasAlgorithm"
  }
}
rows {
  quad {
    s_iri {
      prefix_id: 2
    }
    p_iri {
      prefix_id: 9
    }
    o_literal {
      lex: "RSA"
    }
  }
}
rows {
  name {
    value: "hasPublicKey"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB"
    }
  }
}
rows {
  name {
    value: "hasSignature"
  }
}
rows {
  quad {
    p_iri {
    }
    o_literal {
      lex: "Gt1GLwQNHBkqw5N8AUZMnouTjl/JKre1djh1MnLJ3kKoKtDI97zMIGjJ84rgnvdumbXaOUwA4gEV3VpyQ1uVRGPdaaLku3GdNTaw+aSyEvZa+SMKTGztE+WvMvhCYyZW3bTY0/47u/MDtl0FLoqsGcUY4boA8A11rNOvxf0Ahqd5FBIsHEHVfM5j/rspiNW/LGoGW6fElVwGcJVqPF4r861bP6zabnSgHmOJko0uSU2IStFYI6cxnxraDrO1VWz/IFCqIzMWzaJfB/7Iq7JgMQwyB8KtwgwIeefqNlV/1am0ZVasR9HOniIfy6kDhYTbtTqfxGuP61KU27TUTI1QCg=="
    }
  }
}
rows {
  name {
    value: "hasSignatureTarget"
  }
}
rows {
  quad {
    p_iri {
    }
    o_iri {
      prefix_id: 3
      name_id: 1
    }
  }
}
rows {
  name {
    value: "signedBy"
  }
}
rows {
  quad {
    p_iri {
      prefix_id: 9
      name_id: 67
    }
    o_iri {
      prefix_id: 6
      name_id: 43
    }
  }
}