| products/sources/formale Sprachen/PVS/numbers/ |
|
Quellcode-Bibliothek© Kompilation durch diese Firma[Weder Korrektheit noch Funktionsfähigkeit der Software werden zugesichert.]Datei: ln_exp_series_alt.pvs Sprache: LispOriginal von: PVS© |
|
||||||
|
(unique_factorization
(FTL_sym_TCC1 0 (FTL_sym_TCC1-1 nil 3249308522 ("" (subtype-tcc) nil nil) ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans nil) (number nonempty-type-decl nil numbers nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (number_field nonempty-type-from-decl nil number_fields nil) (real_pred const-decl "[number_field -> boolean]" reals nil) (real nonempty-type-from-decl nil reals nil) (rational_pred const-decl "[real -> boolean]" rationals nil) (rational nonempty-type-from-decl nil rationals nil) (integer_pred const-decl "[rational -> boolean]" integers nil) (int nonempty-type-eq-decl nil integers nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil) (int_minus_int_is_int application-judgement "int" integers nil) (/= const-decl "boolean" notequal nil) (divides const-decl "bool" divides nil) (prime? const-decl "bool" primes "ints/") (list_of_primes? const-decl "bool" prime_factorization nil) (non_decreasing? const-decl "bool" product_perm_lems nil) (ordered_list_of_primes? const-decl "bool" prime_factorization nil)) nil)) (FTL_sym_TCC2 0 (FTL_sym_TCC2-1 nil 3249308522 ("" (subtype-tcc) nil nil) ((boolean nonempty-type-decl nil booleans nil) (bool nonempty-type-eq-decl nil booleans nil) (NOT const-decl "[bool -> bool]" booleans nil) (number nonempty-type-decl nil numbers nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (number_field nonempty-type-from-decl nil number_fields nil) (real_pred const-decl "[number_field -> boolean]" reals nil) (real nonempty-type-from-decl nil reals nil) (rational_pred const-decl "[real -> boolean]" rationals nil) (rational nonempty-type-from-decl nil rationals nil) (integer_pred const-decl "[rational -> boolean]" integers nil) (int nonempty-type-eq-decl nil integers nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil) (int_minus_int_is_int application-judgement "int" integers nil) (/= const-decl "boolean" notequal nil) (divides const-decl "bool" divides nil) (prime? const-decl "bool" primes "ints/") (list_of_primes? const-decl "bool" prime_factorization nil) (non_decreasing? const-decl "bool" product_perm_lems nil) (ordered_list_of_primes? const-decl "bool" prime_factorization nil)) nil)) (FTL_sym 0 (FTL_sym-6 nil 3410715891 ("" (skosimp*) (("" (rewrite "product_fseq_split") (("" (rewrite "product_fseq_split" -3) (("" (lemma "gcd_primes") (("" (inst -1 "seq(fs11!1)(length(fs11!1) - 1)" "seq(fs21!1)(length(fs21!1) - 1)") (("1" (assert) (("1" (split -1) (("1" (lemma "gcd_factors") (("1" (inst?) (("1" (assert) (("1" (skosimp*) (("1" (replace -2) (("1" (hide -2) (("1" (name "Pr2" "product(fs21!1 ^ (0, length(fs21!1) - 2))") (("1" (replace -1) (("1" (case "(ip!1 * seq(fs11!1)(length(fs11!1) - 1) + jp!1 * seq(fs21!1)(length(fs21!1) - 1 (("1" (hide -3) (("1" (case-replace "(ip!1 * seq(fs11!1)(length(fs11!1)-1) + jp!1 * seq(fs21!1)(length(fs21!1)-1)) * Pr2 = ip!1 * seq(fs11!1)(length(fs11!1) - 1) * Pr2 + jp!1 * seq(fs21!1)(length(fs21!1) - 1) * Pr2") (("1" (hide -1) (("1" (case "divides(seq(fs11!1)(length(fs11!1) - 1), ip!1 * seq(fs11!1)(length(fs11!1) - 1) * Pr2 + jp!1 * seq(fs21!1)(length(fs21!1) - 1) * Pr2)") (("1" (inst -4 "Pr2") (("1" (split -4) (("1" (expand "divides") (("1" (skosimp*) (("1" (name "P1" "seq(fs11!1)(length(fs11!1) - 1)") (("1" (replace -1) (("1" (name "Q2" "seq(fs21!1)(length(fs21!1) - 1)") (("1" (replace -1) (("1" (lemma "olop") (("1" (inst?) (("1" (assert) (("1" (assert) (("1" (split -1) (("1" (skosimp*) (("1" (replace -8) (("1" (inst - "fs!1" "fs21!1^ (0, length(fs21!1) - 2)") (("1" (assert) (("1" (rewrite "ordered_list_of_primes_caret") (("1" (split -6) (("1" (case "l(fs!1) = l(fs21!1 ^ (0, length(fs21!1) - 2))") (("1" (case "seqn(fs!1)(i!1) = seqn(fs21!1 ^ (0, length(fs21!1) - 2))(i!1)") (("1" (replace -6) (("1" (hide -3 -4 -5 -8 -9 -10 -11 -12 -14 1) (("1" (expand "ordered_list_of_primes?" -6) (("1" (flatten) (("1" (expand "non_decreasing?") (("1" (expand "^") (("1" (inst - "i!1" "length(fs21!1)-1") (("1" (assert) (("1" (replace -1 * lr) (("1" (hide -1) (("1" (replace -3 * rl) (("1" (hide -3) (("1" (hide-all-but (-5 -9)) (("1" (assert) (("1" (expand "<") (("1" (flatten) (("1" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (expand "<") (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -10 -11) (("2" (assert) nil nil)) nil)) nil) ("2" (hide -2 -3 -4 -5 -6 -7 -8 -9 -10 -12 -13 -14) (("2" (lemma "len3") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil) ("2" (hide -2 -3 -4 -5 -6 -7 -8 -9 -10 -12 -13 -14) (("2" (lemma "len3") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -1 -3 -4 -5 -6 -7 -8 -10 -11 -12 -13 -14 2) (("2" (expand "ordered_list_of_primes?") (("2" (flatten) (("2" (expand "list_of_primes?") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (replace -5) (("2" (hide -3 -5 -7 -8 -9 -10 -11 -12 -13 -14 2) (("2" (lemma "pos_times_gt") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil) ("3" (assert) (("3" (hide -1 -2 -3 -4 -6 -7 -2) (("3" (replace -1) (("3" (hide -1) (("3" (lemma "both_sides_times_pos_gt1") (("3" (inst -1 "Pr2" "seq(fs21!1)(length(fs21!1) - 1)" "1") (("3" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -1 -2 -3 -4 -6 -7 -2) (("2" (replace -1) (("2" (hide -1) (("2" (lemma "both_sides_times_pos_gt1") (("2" (inst -1 "Pr2" "seq(fs21!1)(length(fs21!1) - 1)" "1") (("2" (assert) (("2" (hide -1 -2 -3 -4 2 3) (("2" (reveal -12) (("2" (expand "ordered_list_of_primes?") (("2" (flatten) (("2" (expand "list_of_primes?") (("2" (inst?) (("2" (lemma "prime_gt_1") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (case-replace "jp!1 * seq(fs21!1)(length(fs21!1) - 1) * Pr2 = jp!1 * j!1") (("1" (replace -5) (("1" (hide -1 -2 -4) (("1" (lemma "divides_plus") (("1" (inst?) (("1" (assert) (("1" (hide 2 3) (("1" (prop) (("1" (expand "divides") (("1" (inst + "Pr2*ip!1") (("1" (assert) nil nil)) nil)) nil) ("2" (expand "divides") (("2" (name-replace "P1" "product(fs11!1 ^ (0, length(fs11!1) - 2))") (("2" (inst + "jp!1*P1") (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (assert) nil nil)) nil)) nil)) nil) ("2" (assert) nil nil)) nil)) nil) ("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -1 -2 -3 -5 -6 -7 -8 -9 2) (("2" (expand "ordered_list_of_primes?") (("2" (flatten) (("2" (expand "list_of_primes?") (("2" (inst?) nil nil)) nil)) nil)) nil)) nil) ("3" (hide -1 -2 -3 -4 -6 -7 -8 -9 2) (("3" (expand "ordered_list_of_primes?") (("3" (flatten) (("3" (expand "list_of_primes?") (("3" (inst?) nil nil)) nil)) nil)) nil)) nil) ("4" (expand "<") (("4" (assert) nil nil)) nil)) nil)) nil) ("2" (assert) nil nil) ("3" (assert) nil nil)) nil)) nil)) nil)) nil)) nil) ((product_fseq_split formula-decl nil product_fseq_posnat "reals/") (nat nonempty-type-eq-decl nil naturalnumbers nil) (number nonempty-type-decl nil numbers nil) (boolean nonempty-type-decl nil booleans nil) (number_field_pred const-decl "[number -> boolean]" number_fields nil) (number_field nonempty-type-from-decl nil number_fields nil) (real_pred const-decl "[number_field -> boolean]" reals nil) (real nonempty-type-from-decl nil reals nil) (rational_pred const-decl "[real -> boolean]" rationals nil) (rational nonempty-type-from-decl nil rationals nil) (integer_pred const-decl "[rational -> boolean]" integers nil) (int nonempty-type-eq-decl nil integers nil) (bool nonempty-type-eq-decl nil booleans nil) (>= const-decl "bool" reals nil) (nonneg_int nonempty-type-eq-decl nil integers nil) (> const-decl "bool" reals nil) (posnat nonempty-type-eq-decl nil integers nil) (barray type-eq-decl nil fseqs "structures/") (fseq type-eq-decl nil fseqs "structures/") (int_minus_int_is_int application-judgement "int" integers nil) (mult_divides2 application-judgement "(divides(m))" divides nil) (mult_divides1 application-judgement "(divides(n))" divides nil) (posint_times_posint_is_posint application-judgement "posint" integers nil) (gcd_primes formula-decl nil unique_scaf nil) (real_lt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (real_gt_is_strict_total_order name-judgement "(strict_total_order?[real])" real_props nil) (gcd_factors formula-decl nil gcd "ints/") (= const-decl "[T, T -> boolean]" equalities nil) (product const-decl "posnat" product_fseq_posnat "reals/") (^ const-decl "fseq" fseqs "structures/") (* const-decl "[numfield, numfield -> numfield]" number_fields nil) (+ const-decl "[numfield, numfield -> numfield]" number_fields nil) (int_plus_int_is_int application-judgement "int" integers nil) (divides const-decl "bool" divides nil) (AND const-decl "[bool, bool -> bool]" booleans nil) (P1 skolem-const-decl "posnat" unique_factorization nil) (Pr2 skolem-const-decl "posnat" unique_factorization nil) (ip!1 skolem-const-decl "int" unique_factorization nil) (Q2 skolem-const-decl "posnat" unique_factorization nil) (jp!1 skolem-const-decl "int" unique_factorization nil) (x!1 skolem-const-decl "int" unique_factorization nil) (list_of_primes? const-decl "bool" prime_factorization nil) (below type-eq-decl nil naturalnumbers nil) (< const-decl "bool" reals nil) (ordered_list_of_primes_caret formula-decl nil unique_scaf nil) (ordered_list_of_primes? const-decl "bool" prime_factorization nil) (non_decreasing? const-decl "bool" product_perm_lems nil) (fs!1 skolem-const-decl "fseq[posnat]" unique_factorization nil) (i!1 skolem-const-decl "below(length(fs!1))" unique_factorization nil) (len3 formula-decl nil unique_scaf nil) (pos_times_gt formula-decl nil real_props nil) (posreal nonempty-type-eq-decl nil real_types nil) (nonneg_real nonempty-type-eq-decl nil real_types nil) (both_sides_times_pos_gt1 formula-decl nil real_props nil) (olop formula-decl nil unique_scaf nil) (prime_gt_1 formula-decl nil primes "ints/") (divides_plus formula-decl nil divides_lems "ints/") (/= const-decl "boolean" notequal nil) (nzint nonempty-type-eq-decl nil integers nil) (fs21!1 skolem-const-decl "fseq[posnat]" unique_factorization nil) (fs11!1 skolem-const-decl "fseq[posnat]" unique_factorization nil) (- const-decl "[numfield, numfield -> numfield]" number_fields nil) (numfield nonempty-type-eq-decl nil number_fields nil) (real_ge_is_total_order name-judgement "(total_order?[real])" real_props nil)) nil) (FTL_sym-5 nil 3410622718 ("" (skosimp*) (("" (rewrite "product_fseq_split") (("" (rewrite "product_fseq_split" -3) (("" (lemma "gcd_primes") (("" (inst -1 "seq(fs11!1)(length(fs11!1) - 1)" "seq(fs21!1)(length(fs21!1) - 1)") (("1" (assert) (("1" (split -1) (("1" (lemma "gcd_factors") (("1" (inst?) (("1" (assert) (("1" (skosimp*) (("1" (replace -2) (("1" (hide -2) (("1" (name "Pr2" "product(fs21!1 ^ (0, length(fs21!1) - 2))") (("1" (replace -1) (("1" (case "(ip!1 * seq(fs11!1)(length(fs11!1) - 1) + jp!1 * seq(fs21!1)(length(fs21!1) - 1 (("1" (hide -3) (("1" (case-replace "(ip!1 * seq(fs11!1)(length(fs11!1)-1) + jp!1 * seq(fs21!1)(length(fs21!1)-1)) * Pr2 = ip!1 * seq(fs11!1)(length(fs11!1) - 1) * Pr2 + jp!1 * seq(fs21!1)(length(fs21!1) - 1) * Pr2") (("1" (hide -1) (("1" (case "divides(seq(fs11!1)(length(fs11!1) - 1), ip!1 * seq(fs11!1)(length(fs11!1) - 1) * Pr2 + jp!1 * seq(fs21!1)(length(fs21!1) - 1) * Pr2)") (("1" (inst -4 "Pr2") (("1" (split -4) (("1" (expand "divides") (("1" (skosimp*) (("1" (name "P1" "seq(fs11!1)(length(fs11!1) - 1)") (("1" (replace -1) (("1" (name "Q2" "seq(fs21!1)(length(fs21!1) - 1)") (("1" (replace -1) (("1" (lemma "olop") (("1" (inst?) (("1" (assert) (("1" (assert) (("1" (split -1) (("1" (skosimp*) (("1" (replace -8) (("1" (inst - "fs!1" "fs21!1^ (0, length(fs21!1) - 2)") (("1" (assert) (("1" (rewrite "ordered_list_of_primes_caret") (("1" (split -6) (("1" (case "length(fs!1) = length(fs21!1 ^ (0, length(fs21!1) - 2))") (("1" (case "seq(fs!1)(i!1) = seq(fs21!1 ^ (0, length(fs21!1) - 2))(i!1)") (("1" (replace -6) (("1" (hide -3 -4 -5 -8 -9 -10 -11 -12 -14 1) (("1" (expand "ordered_list_of_primes?" -6) (("1" (flatten) (("1" (expand "non_decreasing?") (("1" (expand "^") (("1" (inst - "i!1" "length(fs21!1)-1") (("1" (assert) nil nil) ("2" (typepred "i!1") (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -10 -11) (("2" (assert) nil nil)) nil) ("3" (assert) nil nil)) nil) ("2" (hide -2 -3 -4 -5 -6 -7 -8 -9 -10 -12 -13 -14) (("2" (lemma "len3") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil) ("2" (hide -2 -3 -4 -5 -6 -7 -8 -9 -10 -12 -13 -14) (("2" (lemma "len3") (("2" (inst?) (("2" (assert) nil nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil)) nil) ("2" (hide -1 -3 -4 -5 -6 --> -------------------- --> maximum size reached --> -------------------- ¤ Dauer der Verarbeitung: 0.63 Sekunden (vorverarbeitet) ¤ |
Haftungshinweis
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:Die farbliche Syntaxdarstellung ist noch experimentell.Bot Zugriff |
