Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: SMT-LIB2 | Statement: [Z3, supportsInputFormat, SMT-LIB2]

Target entity: SMT-LIB2
Context triple: [Z3, supportsInputFormat, SMT-LIB2]

• A. Satisfiability Modulo Theories (SMT)
  Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
• B. Z3 SMT solver
  Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
• C. Z3: An Efficient SMT Solver
  Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
• D. Boyer–Moore theorem prover
  The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
• E. ACL2 theorem proving system
  The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: SMT-LIB2
Triple: [Z3, supportsInputFormat, SMT-LIB2]

SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.

Target entity: SMT-LIB2
Target entity description: SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.

• A. Satisfiability Modulo Theories (SMT)
  Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
• B. Z3 SMT solver
  Z3 SMT solver is a high-performance Satisfiability Modulo Theories (SMT) solver developed at Microsoft Research, widely used in program verification, formal methods, and automated reasoning.
• C. Z3: An Efficient SMT Solver
  Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
• D. Boyer–Moore theorem prover
  The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
• E. ACL2 theorem proving system
  The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.
• F. None of above. chosen

Target predicate: supportsInputFormat
Context triple: [Z3, supportsInputFormat, SMT-LIB2]

• A. supportsTextFormat
  Indicates that one entity is capable of handling, rendering, or otherwise working with a specified text format.
• B. canImportFormat chosen
  Indicates that an entity has the capability to import or read data in a specified format.
• C. supportsRowFormat
  Indicates that one entity provides compatibility with or can correctly handle the specified row format of another entity.
• D. supportsBackupFormat
  Indicates that one entity is capable of handling, storing, or operating with another entity as a backup data format.
• E. operatesInFormat
  Indicates that an entity functions, performs its role, or is carried out using a specified format.
• F. None of above.