Inventive concepts enabled semi-automatic tests of patents

Abstract

This patent (application) discloses for a claimed invention 10 tests (+their 5 controls) enabled by its inventive concepts, automatically prompting their user through exploratively checking its meeting the requirements stated by §112, “well-definedness of its inventive concepts”, i.e. their 1) disaggregation into elementary ones, 2) disclosures, 3) definitiveness, and 4) enablement; §§102/103, “novelty/nonobviousness of this invention”, i.e. its 7) creativity/inventivity, after having assessed their 5) independence, and 6) non-equivalence; §101, “patent-eligibility of it and its claim”, i.e. its not only being 8) a natural law, or 9) idempotent, or 10) an abstract idea alias preemptive, and then being automatically affirmatively reproducible in real-time. These inventive concepts represent this claimed invention's legal and technical facts under 35 USC §§112/102/103/101—and other patent laws' peer sections, e.g. EPC's §§52-57, 69—required by Highest Courts for “model based” inventions, i.e. from advanced technologies.

What is claimed is: 
     
         1 ) A computer-implemented method for updating a given data structure PTR CT -DS in a BAD-KR, both in given formats, by a set of Binary Elementary Disclosed (“BED”) inventive concepts of PTR's TT.0, called BED-TT.0, input to it by the user and by appendices to it and to BAD-KR for controlling an Innovation Expert System IES—the method (performing, for a claimed invention of PTR, its refined claim construction by here first disaggregating its compound inventive concepts, if these are not yet elementary) using a memory for storing the so updated PTR CT -DS, generated by executing this method on TT.0's compound inventive concepts BAD-X. 0 .n of TT.0 representing their mirror predicates BAD- X .0.n of its X.0.n, 1≦n≦N—which:
 (a) writes the PTR CT -DS in a given BAD-KR into the memory 
 (b) automatically prompts the user to determine the KR_R&S_S to be obeyed during its execution, being
 (b).1 either given by the IES as a default KR_R&S_S for both strategies, based on the BAD-KR of (a), 
 (b).2 or a KR_R&S_S input, in a given notation, by the user additionally to the BAD-KR of (a); 
 
 (c) automatically identifies in said PTR CT -DS and said KR_R&S_S, in given formats,
 (c).1 for a given 0≦I≦IRSI, all document.i's and all their doc.i-MUIs, 0≦i≦l, and 
 (c).2 the document.CT in doc.0 and all its doc.CT-MUIs, and 
 (c).3 all elements X.0.n and their predicates BAD- X .0.n, 1≦n≦N, for any BAD-KR in KR_R&S_S; 
 
 (d) automatically performs for any BAD-KR in KR_R&S_S, controlled by this KR_R&S_S, the steps (d).1-(d).6:
 (d).1 prompt the user to input a set of BED-cr-C.0.k's—in a given notation—of TT.0, 1≦k≦K, and 
 (d).2 prompt the user to disaggregate any BAD- X .0.n, 1≦n≦N, into a set {BED-cr- C .0.k n |1≦k n ≦K n } ⊂ {BED-cr- C .0.k|1≦k≦K}: BAD- X .0.n=Λ 1sknKn BED-cr- C .0k n , whereby BED-cr- C .0.k n ≠BED-cr- C .0.k n′ ∀n≠n′, and |{∪ 1≦n≦sN {BED-cr- C .0k n |1≦k n ≦K n }}|=K, 
 (d).3 prompt the user to input, in a given notation, ∀BAD- X .0.n a set of justifications by doc.0-/.CT-MUIs of this disaggregation into {BED-cr- C .0.k n |1≦k n ≦K n }, denoted as SoJUS dagr (BAD- X .0.n), 1≦n≦N; 
 (d).4 automatically append any SoJUS dagr (BAD- X .0.n) to BAD- X .0.n, 1≦n≦N; 
 (d).5 automatically generate BED-TT.0::={{BED-cr-C.0.k|1≦k≦K}}∪{{BED-cr-C.0.k n |1≦k n ≦K n }|1≦n≦N}; 
 (d).6 automatically update the PTR CT -DS in the memory as of (a), according to (d).4 and (d).5. 
 
 
     
     
         2 ) A method according to  claim 1  (explaining the lawful disclosures of the BED-cr-C.0.k n  and completing them to BED-in- C .0.k n  by), updating PTR CT -DS by the sets SoDIS(TT.0) and SoJUS(TT.0), which
 (a) automatically prompts the user through each BED-cr- C .0.k n  in each BAD- X .0.n of the KR at issue, 1≦k n ≦K n , 1≦n≦N—to identify for BED-cr-C.0.k n  a set of disclosures, SoDIS(BED-C.0.k n )::={MUI.0s disclosing this BED-cr-C.0.k n }, SoDIS(BED-cr-C.0.k n ) being justified by SoJUS dagr (BAD- X .0.n) and hence linked to it; 
 (b) automatically prompts the user to select at least one disclosure DIS sel (BED-cr-C.0.k n ) from any set SoDIS(BED-cr-C.0.k n ) of (a), and to identify for it a set of legal justifications, SoJUS(DIS sel (BED-cr-C.0.k n )) ::={I.CTs and/or MUI.CTs and MUI.0s justifying DIS sel (BED-cr-C.0.k n )} and hence linked to it; 
 (c) automatically appends to any BED-cr-C.0.k n  its SoDIS(BED-cr-C.0.k n ), 1≦k n ≦K n , 1≦n≦N; 
 (d) automatically appends to any selected disclosure DIS sel (BED-cr-C.0.k n ) the SoJUS(DIS sel (BED-cr-C.0.k n )) of (b), 1≦k n ≦K n , 1≦n≦N; 
 (e) automatically updates BED-TT.0 in the memory by {BED-cr-C.0.k expanded by its appendix (c)-(d), 1≦k≦K}. 
 
     
     
         3 ) A method according to  claim 2  (explaining the definitiveness of the BED-in- C .0.k n  involved in a means-plus-function-clause), which
 (a) automatically prompts the user for any BED-cr-C.0.k n  of  claim 2  involved in a means-plus-function-clause, 1≦k n ≦K n , through its disclosures DIS sel (BED-cr-C.0.m n ), 1≦m n ≦M n , 1≦n≦N, until a DIS sel0 (BED-cr-C.0.m n ) enables the user to state this BED-cr-C.0.k n′ s definitiveness; 
 (b) automatically appends this statement of (a), JUS def (DIS sel0 (BED-cr-C.0.m n )), to BED-cr-C.0.k n ; 
 (c) automatically updates BED-TT.0 in the memory by {BED-cr-C.0.k n  expanded by JUS def (DIS sel0 (BED-cr-C.0.m n )), 1≦k n ≦K n , 1≦n≦N}. 
 
     
     
         4 ) A method according to  claim 3  (explaining the BED-in- C .0.k n' s being enabling), which
 (a) automatically prompts the user through any of its BED-cr-C.0.k n s and any of its disclosures DIS sel (BED-cr-C.0.k n ), 1≦k n ≦K n , 1≦n≦N—until one DIS sel (BED-cr-C.0.k n ) entitles the user to state that BED-cr-C.0.k n  is enablingly disclosed; 
 (b) automatically appends this statement of (a), JUS end (DIS sel (BED-cr-C.0.k n )), to DIS sel (BED-cr-C.0.k n ); 
 (c) automatically updates BED-TT.0 in the memory by {BED-cr-C.0.k n  expanded by DIS sel (BED-cr-C.0.k n ) which is expanded by JUS end (DIS sel (BED-cr-C.0.k n )), 1≦n≦N, 1≦k n ≦Kn}. 
 
     
     
         5 ) A method according to  claim 4  (explaining the BID-in- C .0.k n′ s being independent), which
 (a) automatically prompts the user to select from the {BED-cr-C.0.k l 1≦k≦K}, occurrences of which passed  claim 4 , a subset {BID-cr-C.0.k*, 1≦k*≦K*≦K}; 
 (b) automatically determines, which value of k* identifies which value of k; 
 (c) automatically prompts the user, for any k*, through any combinations of BID-cr-C.0.k*′, 1≦k*′≠k*≦K*, thus enabling the user to state thereafter that and why BID-cr-C.0.k* is independent of any BID-cr-C.0.k*′ and combinations thereof; 
 (d) automatically appends {BID-cr-C.0.k*, 1≦k*≦K*} to {BED-cr-C.0.k, 1≦k≦K} as of (a); 
 (e) automatically appends this statement of (c), JUS ind ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (f) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (e), 1≦k*≦K*}. 
 
     
     
         6 ) A method according to  claim 5  (explaining the BID-in- C .0.k n′ s being nonequivalent)
 (a) automatically prompts the user, for any BID-cr-C.0.k*, through any doc.0-MUIs, thus that the user may state thereafter that and why it is non-equivalent to a BID-cr-C.0.k*′, 1≦k*′≠k*≦K*; 
 (b) automatically appends this statement of (a), JUS nequ ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (c) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (b), 1≦k*≦K*}. 
 
     
     
         7 ) A method according to  claim 6  (showing the claimed invention being novel and nonobvious), which
 (a) automatically prompts the user to execute the NANO test on the current PTR CT -DS; 
 (b) automatically appends the result of (a), JUS NANO ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (c) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (b), 1≦k*≦K*}. 
 
     
     
         8 ) A method according to  claim 7  (showing the claimed invention being not natural law(s) only), which
 (a) automatically prompts the user to state that and why the claimed invention is not natural law only; 
 (b) automatically appends this statement of (a), JUS NNLO ({BID-cr-C.0.k*, 1≦k≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (c) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (b), 1≦k*≦K*}. 
 
     
     
         9 ) A method according to  claim 8  (showing the claimed invention being not idempotent), which
 (a) automatically prompts the user to select from {BID-cr-C.0.k*, 1≦k*≦K*} a set {BID-cr-C.0.k″,  1≦k″≦K″≦K*};    
 (b) automatically prompts the user to execute the NANO test [set of (a)] on the current PTR CT -DS; 
 (c) automatically appends the set of (a) to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (d) automatically appends the result of (b), JUS NI ({BID-cr-C.0.k″, 1≦k″≦K″}), to {BID-cr-C.0.k”, 1≦k″≦K″}; 
 (e) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (c) and (d), 1≦k*≦K*}. 
 
     
     
         10 ) A method according to  claim 9  (showing the claimed invention being not an abstract idea only), which
 (a) automatically prompts the user to state the problem P.0 to be solved by the claimed invention; 
 (b) automatically prompts the user to identify the set of doc.0-MUIs describing this P.0, SoDIS(P.0); 
 (c) automatically appends this statement of (a) to {BID-cr-C.0.k″, 1≦k″K″}; 
 (d) automatically appends SoDIS(P.0) to {BID-cr-C.0.k″, 1≦k″≦K″}; 
 (e) automatically prompts the user, for any BID-cr-C.0.k″, through any doc.0-MUI, thus enabling it to state that this BID-cr-C.0.k″ is indispensable in the claimed invention for making it solve P.0; 
 (f) automatically appends this statement, JUS NAIO (P.0), to {BID-cr-C.0.k″, 1≦k″≦K″}; 
 (g) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (a)-(f), 1≦k″≦K″}. 
 
     
     
         11 ) A method according to  claim 1 , subject to the additional limitations that part of the information input uses a given predesigned wording. 
     
     
         12 ) A method according to  claim 1 , subject to the additional limitations that part of the information input comprises confirmation of correctness by some given authority. 
     
     
         13 ) A method according to  claim 1 , subject to the additional limitations that part of the information input represents enrichments of various kinds of the PTR-DS. 
     
     
         14 ) A method according to  claim 1 , subject to the additional limitations that part of the information input represents given modifications of the volume of a set of alternatives. 
     
     
         15 ) A method according to  claim 1 , subject to the additional limitations that part of the information input represents given determinations of test specific execution sequences. 
     
     
         16 ) A system executing a computer-implemented method for updating a given data structure PTR CT -DS in a BAD-KR, both in given formats, by a set of Binary Elementary Disclosed (“BED”) inventive concepts of PTR's TT.0, called BED-TT.0, input to it by the user and by appendices to it and to BAD-KR for controlling an Innovation Expert System IES—the method (performing, for a claimed invention of PTR, its refined claim construction by here first disaggregating its compound inventive concepts, if these are not yet elementary) using a memory for storing the so updated PTR CT -DS, generated by executing this method on TT.0's compound inventive concepts BAD-X.0.n of TT.0 representing their mirror predicates BAD-X.0.n of its X.0.n, 1≦n≦N—which:
 (a) writes the PTRCT-DS in a given BAD-KR into the memory 
 (b) automatically prompts the user to determine the KR_R&S_S to be obeyed during its execution, being
 (b).3 either given by the IES as a default KR_R&S_S for both strategies, based on the BAD-KR of (a), 
 (b).4 or a KR_R&S_S input, in a given notation, by the user additionally to the BAD-KR of (a); 
 
 (c) automatically identifies in said PTR CT -DS and said KR_R&S_S, in given formats,
 (c).4 for a given 0≦I≦IRSI, all document's and all their doc.i-MUIs, 0≦i≦Il, and 
 (c).5 the document.CT in doc.0 and all its doc.CT-MUIs, and 
 (c).6 all elements X.0.n and their predicates BAD- X .0.n, 1≦n≦N, for any BAD-KR in KR_R&S_S; 
 
 (d) automatically performs for any BAD-KR in KR_R&S_S, controlled by this KR_R&S_S, the steps (d).1-(d).6:
 (d).7 prompt the user to input a set of BED-cr-C.0.k′s—in a given notation—of TT.0, 1≦k≦K, and 
 (d).8 prompt the user to disaggregate any BAD- X .0.n, 1≦n≦N, into a set {BED-cr- C .0.k n |1≦k n ≦K n } ⊂ {BED-cr- C .0.k|1≦k≦K}: BAD- X .0.n=Λ 1≦kn≦Kn BED-cr- C .0.k n , whereby BED-cr- C .0.k n ≠BED-cr- C .0.k n′∀V n′, and |∪   1≦n≦N {BED-cr- C .0.k n |1≦k n ≦K n }}l=K, 
 (d).9 prompt the user to input, in a given notation, ∀BAD- X .0.n a set of justifications by doc.0-/.CT-MUIs of this disaggregation into {BED-cr- C .0.k n |1≦k n ≦K n }, denoted as SoJUS dagr (BAD- X .0.n), 1≦n≦N; 
 (d).10 automatically append any SoJUS dagr (BAD- X .0.n) to BAD- X .0.n, 1 23  n≦N; 
 (d).11 automatically generate BED-TT.0::={{BED-cr-C.0.k|1≦k≦K}}∪{{BED-cr-C.0.k n |1≦k n ≦K n }|1≦n≦N}; 
 (d).12 automatically update the PTR CT -DS in the memory as of (a), according to (d).4 and (d).5. 
 
 
     
     
         17 ) A system executing a computer-implemented method according to  claim 16  (explaining the lawful disclosures of the BED-cr- C .0.k n  and completing them to BED-in- C .0.k n  by), updating PTR CT -DS by the sets SoDIS(TT.0) and SoJUS(TT.0), which
 (a) automatically prompts the user through each BED-cr- C .0.k n  in each BAD- X .0.n of the KR at issue, 1≦k n ≦K n , 1≦n≦N—to identify for BED-cr-C.0.k n  a set of disclosures, SoDIS(BED-C.0.k n )::={MUI.0s disclosing this BED-cr-C.0.k n }, SoDIS(BED-cr-C.0.k n ) being justified by SoJUS dagr (BAD- X .0.n) and hence linked to it; 
 (b) automatically prompts the user to select at least one disclosure DIS sel (BED-cr-C.0.k n ) from any set SoDIS(BED-cr-C.0.k n ) of (a), and to identify for it a set of legal justifications, SoJUS(DIS sel (BED-cr-C.0.k n ))::=I.CTs and/or MUI.CTs and MUI.0s justifying DIS sel (BED-cr-C.0.k n )} and hence linked to it; 
 (c) automatically appends to any BED-cr-C.0.k n  its SoDIS(BED-cr-C.0.k n ), 1≦k n ≦K n , 1≦n≦N; 
 (d) automatically appends to any selected disclosure DIS sel (BED-cr-C.0.k n ) the SoJUS(DIS sel (BED-cr-C.0.k n )) of (b), 1≦k n ≦K n , 1≦n≦N; 
 (e) automatically updates BED-TT.0 in the memory by {BED-cr-C.0.k expanded by its appendix (c)-(d), 1≦k≦K}. 
 
     
     
         18 ) A system executing a computer-implemented method according to  claim 17  (explaining the definitiveness of the BED-in- C .0.k n  involved in a means-plus-function-clause), which
 (a) automatically prompts the user for any BED-cr-C.0.k n  of  claim 17  involved in a means-plus-function-clause, 1≦k n ≦K n , through its disclosures DIS sel (BED-cr-C.0.m n ), 1≦m n ≦M n , 1≦n≦N, until a DIS sel0 (BED-cr-C.0.m n ) enables the user to state this BED-cr-C.0.k n′ s definitiveness; 
 (b) automatically appends this statement of (a), JUS def (DIS sel0 (BED-cr-C.0.m n )), to BED-cr-C.0.k n ; 
 (c) automatically updates BED-TT.0 in the memory by {BED-cr-C.0.k n  expanded by JUS def (DIS sel0 (BED-cr-C.0.m n )), 1≦k n ≦K n , 1≦n≦N}. 
 
     
     
         19 ) A system executing a computer-implemented method according to  claim 18  (explaining the BED-in- C .0.k n′ s being enabling), which
 (a) automatically prompts the user through any of its BED-cr-C.0.kns and any of its disclosures DISsel(BED-cr-C.0.kn), 1≦kn≦Kn, 1≦n≦N—until one DISsel(BED-cr-C.0.kn) entitles the user to state that BED-cr-C.0.kn is enablingly disclosed; 
 (b) automatically appends this statement of (a), JUS end (DIS sel (BED-cr-C.0.k n )), to DIS sel (BED-cr-C.0.k n ); 
 (c) automatically updates BED-TT.0 in the memory by {BED-cr-C.0.k n  expanded by DIS sel (BED-cr-C.0.kn) which is expanded by JUS end (DIS sel (BED-cr-C.0.k n )), 1≦n≦N, 1≦k n ≦K n }. 
 
     
     
         20 ) A system executing a computer-implemented method according to  claim 19  (explaining the BID-in- C .0.k n' s being independent), which
 (a) automatically prompts the user to select from the {BED-cr-C.0.k|1≦k≦K}, occurrences of which passed  claim 4 , a subset {BID-cr-C.0.k*, 1≦k*≦K*≦K}; 
 (b) automatically determines, which value of k* identifies which value of k; 
 (c) automatically prompts the user, for any k*, through any combinations of BID-cr-C.0.k*′, 1≦k*′≠k*≦K*, thus enabling the user to state thereafter that and why BID-cr-C.0.k* is independent of any BID-cr-C.0.k*′ and combinations thereof; 
 (d) automatically appends {BID-cr-C.0.k*, 1≦k*≦K*} to {BED-cr-C.0.k, 1≦k≦K} as of (a); 
 (e) automatically appends this statement of (c), JUS ind ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (f) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (e), 1≦k*≦K*}. 
 
     
     
         21 ) A system executing a computer-implemented method according to  claim 20  (explaining the BID-in- C .0.k n′ s being nonequivalent)
 (a) automatically prompts the user, for any BID-cr-C.0.k*, through any doc.0-MUIs, thus that the user may state thereafter that and why it is non-equivalent to a BID-cr-C.0.k*′, 1≦k*′≠k*≦K*; 
 (b) automatically appends this statement of (a), JUS nequ ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (c) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (b), 1≦k*≦K*}. 
 
     
     
         22 ) A system executing a computer-implemented method according to  claim 21  (showing the claimed invention being novel and nonobvious), which
 (a) automatically prompts the user to execute the NANO test on the current PTR CT -DS; 
 (b) automatically appends the result of (a), JUS NANO ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (c) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (b), 1≦k*≦K*}. 
 
     
     
         23 ) A system executing a computer-implemented method according to  claim 22  (showing the claimed invention being not natural law(s) only), which
 (a) automatically prompts the user to state that and why the claimed invention is not natural law only; 
 (b) automatically appends this statement of (a), JUS NNLO ({BID-cr-C.0.k*, 1≦k*≦K*}), to {BID-cr-C.0.k*, 1≦k*≦K*}; 
 (c) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (b), 1≦k*≦K*}. 
 
     
     
         24 ) A system executing a computer-implemented method according to  claim 23  (showing the claimed invention being not idempotent), which
 (a) automatically prompts the user to select from {BID-cr-C.0.k*, 1≦k*≦K*} a set {BID-cr-C.0.k″, 1≦k″≦K″≦K*}; 
 (b) automatically prompts the user to execute the NANO test [set of (a)] on the current PTR CT -DS; 
 (c) automatically appends the set of (a) to {BID-cr-C.0.k*, 1≦ k  *—K*}; 
 (d) automatically appends the result of (b), JUS NI ({BID-cr-C.0.k″, 1≦k″≦K″}), to {BID-cr-C.0.k″, 1≦k″≦K″}; 
 (e) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (c) and (d), 1≦k*≦K*}. 
 
     
     
         25 ) A system executing a computer-implemented method according to  claim 24  (showing the claimed invention being not an abstract idea only), which
 (a) automatically prompts the user to state the problem P.0 to be solved by the claimed invention; 
 (b) automatically prompts the user to identify the set of doc.0-MUIs describing this P.0, SoDIS(P.0); 
 (c) automatically appends this statement of (a) to {BID-cr-C.0.k″, 1≦kΔ≦K″}; 
 (d) automatically appends SoDIS(P.0) to {BID-cr-C.0.k″, 1≦k″≦K″}; 
 (e) automatically prompts the user, for any BID-cr-C.0.k″, through any doc.0-MUI, thus enabling it to state that this BID-cr-C.0.k″ is indispensable in the claimed invention for making it solve P.0; 
 (f) automatically appends this statement, JUS NAIO (P.0), to {BID-cr-C.0.k″, 1≦k″≦K″}; 
 (g) automatically updates BED-TT.0 in the memory by {BID-cr-C.0.k* as expanded by (a)-(f), 1≦k″≦K″}. 
 
     
     
         26 ) A system executing a computer-implemented method according to  claim 16 , subject to the additional limitations that part of the information input uses a given predesigned wording. 
     
     
         27 ) A system executing a computer-implemented method according to  claim 16 , subject to the additional limitations that part of the information input comprises confirmation of correctness by some given authority. 
     
     
         28 ) A system executing a computer-implemented method according to  claim 16 , subject to the additional limitations that part of the information input represents enrichments of various kinds of the PTR-DS. 
     
     
         29 ) A system executing a computer-implemented method according to  claim 16 , subject to the additional limitations that part of the information input represents given modifications of the volume of a set of alternatives. 
     
     
         30 ) A system executing a computer-implemented method according to  claim 16 , subject to the additional limitations that part of the information input represents given determinations of test specific execution sequences.