Number of contingents in the graph 0 Number of observed propositions in the graph 0 Network Type CSTNU Number of edges in the graph 0 Number of vertices in the graph 0 Graph Name Proposition Observed. Value specification: [a-zA-F] The x coordinate for the visualization. A positive value. 0 Label. Format: [¬[a-zA-F]|[a-zA-F]]+|⊡ ⊡ The y coordinate for the visualization. A positive value. 0 Labeled Potential Values. Format: {[('node name (no case modification)', 'integer', 'label') ]+}|{} Type: Possible values: contingent|requirement|derived|internal. requirement Labeled Lower-Case Values. Format: {[('node name (no case modification)', 'integer', 'label') ]+}|{} Labeled Upper-Case Values. Format: {[('node name (no case modification)', 'integer', 'label') ]+}|{} Labeled Values. Format: {[('integer', 'label') ]+}|{} 3 2 CSTNU 39 9 678.0 pq 179.0 p 297.0 ⊡ 14.0 281.0 p¬q 367.0 140.0 ⊡ 26.0 137.0 ¬p 468.0 472.0 p¬q 262.0 137.0 ¬p 191.0 q 489.0 p 20.0 686.0 pq 361.0 contingent {(F, -10, p¬q) } {(-8, p¬q) } internal {(240, p¬q) } requirement {(5, p¬q) } internal {(0, ¬p) } requirement {(10, ¬p) } internal {(240, p) } contingent {(H, -30, ¬p) } {(-10, ¬p) } internal {(0, p¬q) } internal {(0, ⊡) } requirement {(10, pq) } internal {(0, ¬p) } contingent {(F, 8, p¬q) } {(10, p¬q) } internal {(0, p) } requirement {(-10, pq) } requirement {(25, pq) } internal {(0, ¬p) } contingent {(D, 10, pq) } {(20, pq) } contingent {(D, -20, pq) } {(-10, pq) } internal {(0, p¬q) } requirement {(0, pq) } internal {(240, ¬p) } internal {(0, pq) } internal {(0, p¬q) } requirement {(1, p) } internal {(0, pq) } contingent {(H, 10, ¬p) } {(30, ¬p) } requirement {(0, ¬p) } internal {(240, p¬q) } internal {(0, pq) } internal {(0, p¬q) } requirement {(0, p) } internal {(240, ¬p) } requirement {(-7, p¬q) } requirement {(0, p¬q) } internal {(0, pq) } requirement {(14, p¬q) } internal {(240, ⊡) } internal {(240, pq) } internal {(240, pq) }