%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW602_2 : TPTP v8.1.2. Released v6.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Fri Sep 1 00:50:52 EDT 2023 % Result : Theorem 198.62s 27.18s % Output : Proof 201.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SWW602_2 : TPTP v8.1.2. Released v6.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n016.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sun Aug 27 18:56:29 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.70/1.36 Prover 4: Preprocessing ... % 4.70/1.37 Prover 5: Preprocessing ... % 4.70/1.37 Prover 6: Preprocessing ... % 4.70/1.37 Prover 2: Preprocessing ... % 4.70/1.37 Prover 3: Preprocessing ... % 4.70/1.37 Prover 0: Preprocessing ... % 4.70/1.37 Prover 1: Preprocessing ... % 9.83/2.24 Prover 4: Warning: ignoring some quantifiers % 11.94/2.35 Prover 4: Constructing countermodel ... % 11.94/2.36 Prover 1: Warning: ignoring some quantifiers % 11.94/2.39 Prover 3: Warning: ignoring some quantifiers % 11.94/2.39 Prover 0: Proving ... % 12.52/2.41 Prover 6: Proving ... % 12.52/2.42 Prover 5: Proving ... % 12.52/2.43 Prover 3: Constructing countermodel ... % 12.52/2.45 Prover 1: Constructing countermodel ... % 14.20/2.68 Prover 2: Proving ... % 71.71/10.29 Prover 2: stopped % 71.71/10.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 71.71/10.39 Prover 7: Preprocessing ... % 74.62/10.62 Prover 7: Warning: ignoring some quantifiers % 75.08/10.65 Prover 7: Constructing countermodel ... % 100.55/13.99 Prover 5: stopped % 100.55/13.99 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 101.28/14.06 Prover 8: Preprocessing ... % 102.46/14.24 Prover 8: Warning: ignoring some quantifiers % 102.46/14.25 Prover 8: Constructing countermodel ... % 115.48/15.99 Prover 1: stopped % 115.48/15.99 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 115.48/16.18 Prover 9: Preprocessing ... % 119.95/16.56 Prover 9: Warning: ignoring some quantifiers % 119.95/16.57 Prover 9: Constructing countermodel ... % 130.05/17.90 Prover 6: stopped % 130.05/17.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 130.05/18.05 Prover 10: Preprocessing ... % 133.03/18.25 Prover 10: Warning: ignoring some quantifiers % 133.03/18.27 Prover 10: Constructing countermodel ... % 197.07/27.04 Prover 10: Found proof (size 723) % 197.07/27.04 Prover 10: proved (9138ms) % 197.07/27.04 Prover 3: stopped % 197.07/27.04 Prover 7: stopped % 197.07/27.04 Prover 8: stopped % 197.07/27.05 Prover 4: stopped % 197.07/27.08 Prover 9: stopped % 198.62/27.18 Prover 0: stopped % 198.62/27.18 % 198.62/27.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 198.62/27.18 % 198.74/27.25 % SZS output start Proof for theBenchmark % 198.74/27.26 Assumptions after simplification: % 198.74/27.26 --------------------------------- % 198.74/27.26 % 198.74/27.26 (all_trees_0) % 198.81/27.29 tree1(empty1) & ty(tree) & ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : ? % 198.81/27.29 [v3: list_tree] : (t2tb2(empty1) = v0 & tb2t1(v2) = v3 & cons(tree, v0, v1) = % 198.81/27.29 v2 & nil(tree) = v1 & list_tree(v3) & uni(v2) & uni(v1) & uni(v0) & % 198.81/27.29 all_trees1(0, v3)) % 198.81/27.29 % 198.81/27.29 (all_trees_def) % 198.81/27.30 ty(tree) & ! [v0: int] : ! [v1: list_tree] : ! [v2: uni] : ! [v3: tree1] : % 198.81/27.30 ! [v4: uni] : ( ~ (t2tb2(v3) = v4) | ~ (t2tb1(v1) = v2) | ~ list_tree(v1) | % 198.81/27.30 ~ tree1(v3) | ~ all_trees1(v0, v1) | ~ mem(tree, v4, v2) | size1(v3) = % 198.81/27.30 v0) & ! [v0: int] : ! [v1: list_tree] : ! [v2: uni] : ! [v3: tree1] : ! % 198.81/27.30 [v4: uni] : ( ~ (t2tb2(v3) = v4) | ~ (t2tb1(v1) = v2) | ~ list_tree(v1) | ~ % 198.81/27.30 tree1(v3) | ~ all_trees1(v0, v1) | mem(tree, v4, v2) | ? [v5: int] : ( ~ % 198.81/27.30 (v5 = v0) & size1(v3) = v5)) & ! [v0: int] : ! [v1: list_tree] : ! [v2: % 198.81/27.30 uni] : ( ~ (t2tb1(v1) = v2) | ~ list_tree(v1) | ~ all_trees1(v0, v1) | % 198.81/27.30 distinct(tree, v2)) & ? [v0: int] : ! [v1: list_tree] : ! [v2: uni] : ( ~ % 198.81/27.30 (t2tb1(v1) = v2) | ~ list_tree(v1) | ~ distinct(tree, v2) | all_trees1(v0, % 198.81/27.30 v1) | ? [v3: tree1] : ? [v4: int] : ? [v5: uni] : (tree1(v3) & ((v4 = % 198.81/27.30 v0 & size1(v3) = v0) | (t2tb2(v3) = v5 & uni(v5) & mem(tree, v5, v2))) % 198.81/27.30 & (( ~ (v4 = v0) & size1(v3) = v4) | (t2tb2(v3) = v5 & uni(v5) & ~ % 198.81/27.30 mem(tree, v5, v2))))) % 198.81/27.30 % 198.81/27.30 (bridgeL) % 198.81/27.30 ! [v0: int] : ! [v1: uni] : ( ~ (t2tb(v0) = v1) | tb2t(v1) = v0) % 198.81/27.30 % 198.81/27.30 (bridgeR1) % 198.81/27.30 ! [v0: uni] : ! [v1: list_tree] : ( ~ (tb2t1(v0) = v1) | ~ uni(v0) | % 198.81/27.30 t2tb1(v1) = v0) % 198.81/27.30 % 198.81/27.30 (bridgeR3) % 198.81/27.30 ! [v0: uni] : ! [v1: map_int_lplist_treerp] : ( ~ (tb2t3(v0) = v1) | ~ % 198.81/27.30 uni(v0) | t2tb3(v1) = v0) % 198.81/27.30 % 198.81/27.30 (cons_sort2) % 198.81/27.30 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ( ~ (cons(v0, v1, % 198.81/27.30 v2) = v3) | ~ ty(v0) | ~ uni(v2) | ~ uni(v1) | ? [v4: ty] : % 198.81/27.30 (list(v0) = v4 & ty(v4) & sort1(v4, v3))) % 198.81/27.30 % 198.81/27.30 (distinct_inversion) % 198.81/27.31 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : (v2 = v1 | ~ (nil(v0) = v2) | ~ % 198.81/27.31 ty(v0) | ~ uni(v1) | ~ distinct(v0, v1) | ? [v3: ty] : ? [v4: uni] : ? % 198.81/27.31 [v5: uni] : ? [v6: uni] : ? [v7: uni] : ? [v8: uni] : (uni(v7) & uni(v5) % 198.81/27.31 & uni(v4) & ((v8 = v1 & cons(v0, v7, v2) = v1 & sort1(v0, v7)) | (v6 = v1 % 198.81/27.31 & cons(v0, v4, v5) = v1 & list(v0) = v3 & ty(v3) & distinct(v0, v5) & % 198.81/27.31 sort1(v3, v5) & sort1(v0, v4) & ~ mem(v0, v4, v5))))) % 198.81/27.31 % 198.81/27.31 (distinct_one) % 198.81/27.31 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ( ~ (cons(v0, v1, % 198.81/27.31 v2) = v3) | ~ (nil(v0) = v2) | ~ ty(v0) | ~ uni(v1) | distinct(v0, % 198.81/27.31 v3)) % 198.81/27.31 % 198.81/27.31 (infix_plpl_sort2) % 198.81/27.31 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ( ~ (infix_plpl(v0, % 198.81/27.31 v1, v2) = v3) | ~ ty(v0) | ~ uni(v2) | ~ uni(v1) | ? [v4: ty] : % 198.81/27.31 (list(v0) = v4 & ty(v4) & sort1(v4, v3))) % 198.81/27.31 % 198.81/27.31 (mem_append) % 198.81/27.32 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ( ~ % 198.81/27.32 (infix_plpl(v0, v2, v3) = v4) | ~ ty(v0) | ~ uni(v3) | ~ uni(v2) | ~ % 198.81/27.32 uni(v1) | ~ mem(v0, v1, v4) | mem(v0, v1, v3) | mem(v0, v1, v2)) & ! [v0: % 198.81/27.32 ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ( ~ % 198.81/27.32 (infix_plpl(v0, v2, v3) = v4) | ~ ty(v0) | ~ uni(v3) | ~ uni(v2) | ~ % 198.81/27.32 uni(v1) | ~ mem(v0, v1, v3) | mem(v0, v1, v4)) & ! [v0: ty] : ! [v1: uni] % 198.81/27.32 : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ( ~ (infix_plpl(v0, v2, v3) = % 198.81/27.32 v4) | ~ ty(v0) | ~ uni(v3) | ~ uni(v2) | ~ uni(v1) | ~ mem(v0, v1, % 198.81/27.32 v2) | mem(v0, v1, v4)) % 198.81/27.32 % 198.81/27.32 (mem_decomp) % 198.81/27.32 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: ty] : ( ~ (list(v0) = v3) % 198.81/27.32 | ~ ty(v0) | ~ uni(v2) | ~ uni(v1) | ~ mem(v0, v1, v2) | ? [v4: uni] : % 198.81/27.32 ? [v5: uni] : ? [v6: uni] : (infix_plpl(v0, v4, v6) = v2 & cons(v0, v1, v5) % 198.81/27.32 = v6 & uni(v6) & uni(v5) & uni(v4) & sort1(v3, v5) & sort1(v3, v4))) % 198.81/27.32 % 198.81/27.32 (mem_def) % 198.81/27.32 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ! % 198.81/27.32 [v5: uni] : (v3 = v1 | ~ (cons(v0, v3, v4) = v5) | ~ (nil(v0) = v2) | ~ % 198.81/27.32 ty(v0) | ~ uni(v4) | ~ uni(v3) | ~ uni(v1) | ~ mem(v0, v1, v5) | ~ % 198.81/27.32 sort1(v0, v3) | ~ sort1(v0, v1) | mem(v0, v1, v4)) & ! [v0: ty] : ! [v1: % 198.81/27.32 uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ! [v5: uni] : ( ~ % 198.81/27.32 (cons(v0, v3, v4) = v5) | ~ (nil(v0) = v2) | ~ ty(v0) | ~ uni(v4) | ~ % 198.81/27.33 uni(v3) | ~ uni(v1) | ~ mem(v0, v1, v4) | ~ sort1(v0, v3) | ~ sort1(v0, % 198.81/27.33 v1) | mem(v0, v1, v5)) & ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! % 198.81/27.33 [v3: uni] : ! [v4: uni] : ( ~ (cons(v0, v1, v3) = v4) | ~ (nil(v0) = v2) | % 198.81/27.33 ~ ty(v0) | ~ uni(v3) | ~ uni(v1) | ~ sort1(v0, v1) | mem(v0, v1, v4)) & % 198.81/27.33 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ( ~ (nil(v0) = v2) | ~ ty(v0) | ~ % 198.81/27.33 uni(v1) | ~ mem(v0, v1, v2) | ~ sort1(v0, v1)) % 198.81/27.33 % 198.81/27.33 (nil_Cons1) % 198.81/27.33 ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ( ~ (cons(v0, v1, % 198.81/27.33 v2) = v3) | ~ ty(v0) | ~ uni(v2) | ~ uni(v1) | ? [v4: uni] : ( ~ (v4 % 198.81/27.33 = v3) & nil(v0) = v4 & uni(v4))) % 198.81/27.33 % 198.81/27.33 (nil_sort2) % 198.81/27.33 ! [v0: ty] : ! [v1: uni] : ( ~ (nil(v0) = v1) | ~ ty(v0) | ? [v2: ty] : % 198.81/27.33 (list(v0) = v2 & ty(v2) & sort1(v2, v1))) % 198.81/27.33 % 198.81/27.33 (node_proj_1_def1) % 198.81/27.33 ! [v0: tree1] : ! [v1: tree1] : ! [v2: tree1] : ( ~ (node1(v0, v1) = v2) | % 198.81/27.33 ~ tree1(v1) | ~ tree1(v0) | node_proj_11(v2) = v0) % 198.81/27.33 % 198.81/27.33 (select_eq) % 198.81/27.33 ! [v0: ty] : ! [v1: ty] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ! % 198.81/27.33 [v5: uni] : ! [v6: uni] : (v6 = v4 | ~ (set(v1, v0, v2, v3, v4) = v5) | ~ % 198.81/27.33 (get(v1, v0, v5, v3) = v6) | ~ ty(v1) | ~ ty(v0) | ~ uni(v4) | ~ uni(v3) % 198.81/27.33 | ~ uni(v2) | ~ sort1(v1, v4)) % 198.81/27.33 % 198.81/27.33 (size_def) % 198.81/27.33 size1(empty1) = 0 & tree1(empty1) & ! [v0: tree1] : ! [v1: tree1] : ! [v2: % 198.81/27.33 tree1] : ( ~ (node1(v0, v1) = v2) | ~ tree1(v1) | ~ tree1(v0) | ? [v3: % 198.81/27.33 int] : ? [v4: int] : (size1(v2) = v3 & size1(v1) = $sum($difference(v3, % 198.81/27.33 v4), -1) & size1(v0) = v4)) % 198.81/27.33 % 198.81/27.33 (size_left) % 198.81/27.33 ! [v0: tree1] : ! [v1: int] : ( ~ ($lesseq(1, v1)) | ~ (size1(v0) = v1) | % 198.81/27.33 ~ tree1(v0) | ? [v2: tree1] : ? [v3: tree1] : ? [v4: int] : ($lesseq(1, % 198.81/27.33 $difference(v1, v4)) & size1(v2) = v4 & node1(v2, v3) = v0 & tree1(v3) & % 198.81/27.33 tree1(v2))) % 198.81/27.33 % 198.81/27.33 (size_nonneg) % 198.81/27.34 ! [v0: tree1] : ! [v1: int] : ( ~ ($lesseq(v1, -1)) | ~ (size1(v0) = v1) | % 198.81/27.34 ~ tree1(v0)) % 198.81/27.34 % 198.81/27.34 (t2tb_sort4) % 198.81/27.34 ty(tree) & ? [v0: ty] : (list(tree) = v0 & ty(v0) & ! [v1: list_tree] : ! % 198.81/27.34 [v2: uni] : ( ~ (t2tb1(v1) = v2) | ~ list_tree(v1) | sort1(v0, v2))) % 198.81/27.34 % 198.81/27.34 (t2tb_sort5) % 198.81/27.34 ty(tree) & ! [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) | ~ tree1(v0) % 198.81/27.34 | sort1(tree, v1)) % 198.81/27.34 % 198.81/27.34 (t2tb_sort6) % 198.81/27.34 ty(tree) & ty(int) & ? [v0: ty] : ? [v1: ty] : (map(int, v0) = v1 & % 198.81/27.34 list(tree) = v0 & ty(v1) & ty(v0) & ! [v2: map_int_lplist_treerp] : ! [v3: % 198.81/27.34 uni] : ( ~ (t2tb3(v2) = v3) | ~ map_int_lplist_treerp(v2) | sort1(v1, % 198.81/27.34 v3))) % 198.81/27.34 % 198.81/27.34 (tree_diff) % 198.81/27.34 ! [v0: tree1] : ! [v1: tree1] : ! [v2: int] : ! [v3: int] : ! [v4: tree1] % 198.81/27.34 : ! [v5: tree1] : ! [v6: tree1] : (v3 = v2 | ~ (size1(v1) = v3) | ~ % 198.81/27.34 (size1(v0) = v2) | ~ (node1(v1, v5) = v6) | ~ (node1(v0, v4) = v6) | ~ % 198.81/27.34 tree1(v5) | ~ tree1(v4) | ~ tree1(v1) | ~ tree1(v0)) % 198.81/27.34 % 198.81/27.34 (wP_parameter_all_trees) % 199.02/27.36 tree1(empty1) & ty(tree) & ty(int) & ? [v0: ty] : ? [v1: uni] : ? [v2: uni] % 199.02/27.36 : ? [v3: uni] : ? [v4: uni] : ? [v5: uni] : ? [v6: uni] : ? [v7: % 199.02/27.36 map_int_lplist_treerp] : ? [v8: map_int_lplist_treerp] : ? [v9: int] : ? % 199.02/27.36 [v10: uni] : ? [v11: uni] : ? [v12: uni] : ? [v13: map_int_lplist_treerp] : % 199.02/27.36 ? [v14: map_int_lplist_treerp] : ? [v15: int] : ? [v16: uni] : ? [v17: % 199.02/27.36 uni] : ? [v18: uni] : ? [v19: uni] : ? [v20: list_tree] : ? [v21: uni] : % 199.02/27.36 ? [v22: uni] : ? [v23: list_tree] : ? [v24: list_tree] : ? [v25: uni] : ? % 199.02/27.36 [v26: uni] : ? [v27: uni] : ? [v28: map_int_lplist_treerp] : ? [v29: uni] : % 199.02/27.36 ? [v30: uni] : ? [v31: tree1] : ? [v32: uni] : ? [v33: int] : ($lesseq(1, % 199.02/27.36 $difference(v9, v15)) & $lesseq(0, v15) & tb2t3(v27) = v28 & tb2t3(v12) = % 199.02/27.36 v13 & tb2t3(v6) = v7 & t2tb3(v28) = v29 & t2tb3(v14) = v16 & t2tb3(v8) = v10 % 199.02/27.36 & t2tb2(v31) = v32 & t2tb2(empty1) = v4 & tb2t1(v22) = v23 & tb2t1(v19) = % 199.02/27.36 v20 & t2tb1(v24) = v25 & size1(v31) = v33 & t2tb($sum($difference(v9, v15), % 199.02/27.36 -1)) = v21 & t2tb(v15) = v18 & t2tb(v9) = v11 & t2tb(0) = v3 & const(v0, % 199.02/27.36 int, v1) = v2 & set(v0, int, v16, v11, v26) = v27 & set(v0, int, v10, v11, % 199.02/27.36 v1) = v12 & set(v0, int, v2, v3, v5) = v6 & get(v0, int, v29, v11) = v30 & % 199.02/27.36 get(v0, int, v16, v21) = v22 & get(v0, int, v16, v18) = v19 & get(v0, int, % 199.02/27.36 v16, v11) = v17 & infix_plpl(tree, v25, v17) = v26 & cons(tree, v4, v1) = % 199.02/27.36 v5 & nil(tree) = v1 & list(tree) = v0 & map_int_lplist_treerp(v28) & % 199.02/27.36 map_int_lplist_treerp(v14) & map_int_lplist_treerp(v13) & % 199.02/27.36 map_int_lplist_treerp(v8) & map_int_lplist_treerp(v7) & list_tree(v24) & % 199.02/27.36 list_tree(v23) & list_tree(v20) & tree1(v31) & ty(v0) & uni(v32) & uni(v30) % 199.02/27.36 & uni(v29) & uni(v27) & uni(v26) & uni(v25) & uni(v22) & uni(v21) & uni(v19) % 199.02/27.36 & uni(v18) & uni(v17) & uni(v16) & uni(v12) & uni(v11) & uni(v10) & uni(v6) % 199.02/27.36 & uni(v5) & uni(v4) & uni(v3) & uni(v2) & uni(v1) & % 199.02/27.36 all_trees1($sum($difference(v9, v15), -1), v23) & all_trees1(v15, v20) & % 199.02/27.36 distinct(tree, v25) & distinct(tree, v17) & mem(tree, v32, v30) & ! [v34: % 199.02/27.36 tree1] : ! [v35: uni] : ! [v36: tree1] : ! [v37: tree1] : ( ~ % 199.02/27.36 (t2tb2(v34) = v35) | ~ (node1(v36, v37) = v34) | ~ tree1(v37) | ~ % 199.02/27.36 tree1(v36) | ~ tree1(v34) | mem(tree, v35, v25) | ? [v38: int] : ? % 199.02/27.36 [v39: int] : (( ~ ($difference($sum(v39, v15), v9) = -1) & size1(v37) = % 199.02/27.36 v39) | ( ~ (v38 = v15) & size1(v36) = v38))) & ! [v34: int] : ! % 199.02/27.36 [v35: uni] : ! [v36: uni] : ( ~ ($lesseq(1, $difference(v9, v34))) | ~ % 199.02/27.36 ($lesseq(0, v34)) | ~ (t2tb(v34) = v35) | ~ (get(v0, int, v16, v35) = % 199.02/27.36 v36) | ? [v37: list_tree] : (tb2t1(v36) = v37 & list_tree(v37) & % 199.02/27.36 all_trees1(v34, v37))) & ! [v34: int] : ! [v35: uni] : ! [v36: uni] : % 199.02/27.36 ( ~ ($lesseq(1, $difference(v9, v34))) | ~ ($lesseq(0, v34)) | ~ % 199.02/27.36 (t2tb(v34) = v35) | ~ (get(v0, int, v10, v35) = v36) | ? [v37: % 199.02/27.36 list_tree] : (tb2t1(v36) = v37 & list_tree(v37) & all_trees1(v34, v37))) % 199.02/27.36 & ! [v34: tree1] : ! [v35: tree1] : ( ~ (v33 = v9) | ~ (node1(v34, v35) = % 199.02/27.36 v31) | ~ tree1(v35) | ~ tree1(v34) | ? [v36: int] : ($lesseq(1, % 199.02/27.36 $difference(v36, v15)) & size1(v34) = v36)) & ! [v34: tree1] : ! % 199.02/27.36 [v35: uni] : ( ~ (t2tb2(v34) = v35) | ~ tree1(v34) | ~ mem(tree, v35, v25) % 199.02/27.36 | ? [v36: tree1] : ? [v37: tree1] : (size1(v37) = $sum($difference(v9, % 199.02/27.36 v15), -1) & size1(v36) = v15 & node1(v36, v37) = v34 & tree1(v37) & % 199.02/27.36 tree1(v36))) & ! [v34: tree1] : ! [v35: uni] : ( ~ (t2tb2(v34) = v35) % 199.02/27.36 | ~ tree1(v34) | ~ mem(tree, v35, v17) | ? [v36: tree1] : ? [v37: % 199.02/27.36 tree1] : ? [v38: int] : ($lesseq(1, $difference(v15, v38)) & size1(v36) % 199.02/27.36 = v38 & size1(v34) = v9 & node1(v36, v37) = v34 & tree1(v37) & % 199.02/27.36 tree1(v36))) & ! [v34: tree1] : ! [v35: uni] : ( ~ (t2tb2(v34) = v35) % 199.02/27.36 | ~ tree1(v34) | mem(tree, v35, v17) | ? [v36: int] : (size1(v34) = v36 % 199.02/27.36 & ! [v37: tree1] : ! [v38: tree1] : ( ~ (v36 = v9) | ~ (node1(v37, % 199.02/27.36 v38) = v34) | ~ tree1(v38) | ~ tree1(v37) | ? [v39: int] : % 199.02/27.36 ($lesseq(v15, v39) & size1(v37) = v39))))) % 199.02/27.36 % 199.02/27.36 (function-axioms) % 199.14/27.38 ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] : ! % 199.14/27.38 [v5: ty] : ! [v6: ty] : (v1 = v0 | ~ (set(v6, v5, v4, v3, v2) = v1) | ~ % 199.14/27.38 (set(v6, v5, v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] % 199.14/27.38 : ! [v3: uni] : ! [v4: uni] : ! [v5: ty] : ! [v6: ty] : (v1 = v0 | ~ % 199.14/27.38 (match_list1(v6, v5, v4, v3, v2) = v1) | ~ (match_list1(v6, v5, v4, v3, v2) % 199.14/27.38 = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! % 199.14/27.38 [v4: tree1] : ! [v5: ty] : (v1 = v0 | ~ (match_tree1(v5, v4, v3, v2) = v1) | % 199.14/27.38 ~ (match_tree1(v5, v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! % 199.14/27.38 [v2: uni] : ! [v3: int] : ! [v4: uni] : ! [v5: ty] : (v1 = v0 | ~ % 199.14/27.38 (set2(v5, v4, v3, v2) = v1) | ~ (set2(v5, v4, v3, v2) = v0)) & ! [v0: uni] % 199.14/27.38 : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: ty] : ! [v5: ty] : (v1 % 199.14/27.38 = v0 | ~ (get(v5, v4, v3, v2) = v1) | ~ (get(v5, v4, v3, v2) = v0)) & ! % 199.14/27.38 [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: bool1] : ! % 199.14/27.38 [v5: ty] : (v1 = v0 | ~ (match_bool1(v5, v4, v3, v2) = v1) | ~ % 199.14/27.38 (match_bool1(v5, v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: % 199.14/27.38 uni] : ! [v3: int] : ! [v4: ty] : (v1 = v0 | ~ (make1(v4, v3, v2) = v1) | % 199.14/27.38 ~ (make1(v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: int] : % 199.14/27.39 ! [v3: uni] : ! [v4: ty] : (v1 = v0 | ~ (get2(v4, v3, v2) = v1) | ~ % 199.14/27.39 (get2(v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! % 199.14/27.39 [v3: int] : ! [v4: ty] : (v1 = v0 | ~ (mk_array1(v4, v3, v2) = v1) | ~ % 199.14/27.39 (mk_array1(v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : % 199.14/27.39 ! [v3: ty] : ! [v4: ty] : (v1 = v0 | ~ (const(v4, v3, v2) = v1) | ~ % 199.14/27.39 (const(v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! % 199.14/27.39 [v3: uni] : ! [v4: ty] : (v1 = v0 | ~ (infix_plpl(v4, v3, v2) = v1) | ~ % 199.14/27.39 (infix_plpl(v4, v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] % 199.14/27.39 : ! [v3: uni] : ! [v4: ty] : (v1 = v0 | ~ (cons(v4, v3, v2) = v1) | ~ % 199.14/27.39 (cons(v4, v3, v2) = v0)) & ! [v0: tree1] : ! [v1: tree1] : ! [v2: tree1] % 199.14/27.39 : ! [v3: tree1] : (v1 = v0 | ~ (node1(v3, v2) = v1) | ~ (node1(v3, v2) = % 199.14/27.39 v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! [v3: ty] : (v1 = v0 % 199.14/27.39 | ~ (elts(v3, v2) = v1) | ~ (elts(v3, v2) = v0)) & ! [v0: int] : ! [v1: % 199.14/27.39 int] : ! [v2: uni] : ! [v3: ty] : (v1 = v0 | ~ (length3(v3, v2) = v1) | % 199.14/27.39 ~ (length3(v3, v2) = v0)) & ! [v0: ty] : ! [v1: ty] : ! [v2: ty] : ! % 199.14/27.39 [v3: ty] : (v1 = v0 | ~ (map(v3, v2) = v1) | ~ (map(v3, v2) = v0)) & ! [v0: % 199.14/27.39 int] : ! [v1: int] : ! [v2: uni] : ! [v3: ty] : (v1 = v0 | ~ % 199.14/27.39 (length2(v3, v2) = v1) | ~ (length2(v3, v2) = v0)) & ! [v0: uni] : ! [v1: % 199.14/27.39 uni] : ! [v2: uni] : ! [v3: ty] : (v1 = v0 | ~ (cons_proj_21(v3, v2) = % 199.14/27.39 v1) | ~ (cons_proj_21(v3, v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! % 199.14/27.39 [v2: uni] : ! [v3: ty] : (v1 = v0 | ~ (cons_proj_11(v3, v2) = v1) | ~ % 199.14/27.39 (cons_proj_11(v3, v2) = v0)) & ! [v0: map_int_lplist_treerp] : ! [v1: % 199.14/27.39 map_int_lplist_treerp] : ! [v2: uni] : (v1 = v0 | ~ (tb2t3(v2) = v1) | ~ % 199.14/27.39 (tb2t3(v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: % 199.14/27.39 map_int_lplist_treerp] : (v1 = v0 | ~ (t2tb3(v2) = v1) | ~ (t2tb3(v2) = % 199.14/27.39 v0)) & ! [v0: tree1] : ! [v1: tree1] : ! [v2: uni] : (v1 = v0 | ~ % 199.14/27.39 (tb2t2(v2) = v1) | ~ (tb2t2(v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! % 199.14/27.39 [v2: tree1] : (v1 = v0 | ~ (t2tb2(v2) = v1) | ~ (t2tb2(v2) = v0)) & ! [v0: % 199.14/27.39 list_tree] : ! [v1: list_tree] : ! [v2: uni] : (v1 = v0 | ~ (tb2t1(v2) = % 199.14/27.39 v1) | ~ (tb2t1(v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: % 199.14/27.39 list_tree] : (v1 = v0 | ~ (t2tb1(v2) = v1) | ~ (t2tb1(v2) = v0)) & ! [v0: % 199.14/27.39 int] : ! [v1: int] : ! [v2: tree1] : (v1 = v0 | ~ (size1(v2) = v1) | ~ % 199.14/27.39 (size1(v2) = v0)) & ! [v0: tree1] : ! [v1: tree1] : ! [v2: tree1] : (v1 = % 199.14/27.39 v0 | ~ (node_proj_21(v2) = v1) | ~ (node_proj_21(v2) = v0)) & ! [v0: % 199.14/27.39 tree1] : ! [v1: tree1] : ! [v2: tree1] : (v1 = v0 | ~ (node_proj_11(v2) = % 199.14/27.39 v1) | ~ (node_proj_11(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: % 199.14/27.39 uni] : (v1 = v0 | ~ (tb2t(v2) = v1) | ~ (tb2t(v2) = v0)) & ! [v0: uni] : % 199.14/27.39 ! [v1: uni] : ! [v2: int] : (v1 = v0 | ~ (t2tb(v2) = v1) | ~ (t2tb(v2) = % 199.14/27.39 v0)) & ! [v0: ty] : ! [v1: ty] : ! [v2: ty] : (v1 = v0 | ~ (array(v2) % 199.14/27.39 = v1) | ~ (array(v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: ty] : % 199.14/27.39 (v1 = v0 | ~ (nil(v2) = v1) | ~ (nil(v2) = v0)) & ! [v0: ty] : ! [v1: ty] % 199.14/27.39 : ! [v2: ty] : (v1 = v0 | ~ (list(v2) = v1) | ~ (list(v2) = v0)) & ! [v0: % 199.14/27.39 uni] : ! [v1: uni] : ! [v2: ty] : (v1 = v0 | ~ (witness1(v2) = v1) | ~ % 199.14/27.39 (witness1(v2) = v0)) % 199.14/27.39 % 199.14/27.39 Further assumptions not needed in the proof: % 199.14/27.39 -------------------------------------------- % 199.14/27.39 append_assoc, append_l_nil, append_length, array_inversion1, bool_inversion, % 199.14/27.39 bridgeL1, bridgeL2, bridgeL3, bridgeR, bridgeR2, compatOrderMult, % 199.14/27.39 cons_proj_1_def1, cons_proj_1_sort2, cons_proj_2_def1, cons_proj_2_sort2, const, % 199.14/27.39 const_sort2, distinct_append, distinct_many, distinct_zero, elts_def1, % 199.14/27.39 elts_sort2, empty_Node1, get_def, get_sort4, get_sort5, infix_plpl_def, % 199.14/27.39 length_def, length_def2, length_nil, length_nonnegative, list_inversion1, % 199.14/27.39 make_def, make_sort2, match_bool_False, match_bool_True, match_bool_sort2, % 199.14/27.39 match_list_Cons1, match_list_Nil1, match_list_sort2, match_tree_Empty1, % 199.14/27.39 match_tree_Node1, match_tree_sort2, mk_array_sort2, node_proj_2_def1, % 199.14/27.39 select_neq, set_def, set_sort4, set_sort5, t2tb_sort3, tree_inversion1, % 199.14/27.39 true_False, tuple0_inversion, witness_sort1 % 199.14/27.39 % 199.14/27.39 Those formulas are unsatisfiable: % 199.14/27.39 --------------------------------- % 199.14/27.39 % 199.14/27.39 Begin of proof % 199.14/27.39 | % 199.14/27.39 | ALPHA: (mem_def) implies: % 199.14/27.40 | (1) ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ( ~ (nil(v0) = v2) | ~ % 199.14/27.40 | ty(v0) | ~ uni(v1) | ~ mem(v0, v1, v2) | ~ sort1(v0, v1)) % 199.14/27.40 | (2) ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] % 199.14/27.40 | : ( ~ (cons(v0, v1, v3) = v4) | ~ (nil(v0) = v2) | ~ ty(v0) | ~ % 199.14/27.40 | uni(v3) | ~ uni(v1) | ~ sort1(v0, v1) | mem(v0, v1, v4)) % 199.14/27.40 | % 199.14/27.40 | ALPHA: (mem_append) implies: % 199.14/27.40 | (3) ! [v0: ty] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: uni] % 199.14/27.40 | : ( ~ (infix_plpl(v0, v2, v3) = v4) | ~ ty(v0) | ~ uni(v3) | ~ % 199.14/27.40 | uni(v2) | ~ uni(v1) | ~ mem(v0, v1, v4) | mem(v0, v1, v3) | mem(v0, % 199.14/27.40 | v1, v2)) % 199.14/27.40 | % 199.14/27.40 | ALPHA: (size_def) implies: % 199.14/27.40 | (4) size1(empty1) = 0 % 199.14/27.40 | (5) ! [v0: tree1] : ! [v1: tree1] : ! [v2: tree1] : ( ~ (node1(v0, v1) = % 199.14/27.40 | v2) | ~ tree1(v1) | ~ tree1(v0) | ? [v3: int] : ? [v4: int] : % 199.14/27.40 | (size1(v2) = v3 & size1(v1) = $sum($difference(v3, v4), -1) & % 199.14/27.40 | size1(v0) = v4)) % 199.14/27.40 | % 199.14/27.40 | ALPHA: (t2tb_sort4) implies: % 199.14/27.40 | (6) ? [v0: ty] : (list(tree) = v0 & ty(v0) & ! [v1: list_tree] : ! [v2: % 199.14/27.40 | uni] : ( ~ (t2tb1(v1) = v2) | ~ list_tree(v1) | sort1(v0, v2))) % 199.14/27.40 | % 199.14/27.40 | ALPHA: (t2tb_sort5) implies: % 199.14/27.41 | (7) ! [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) | ~ tree1(v0) | % 199.14/27.41 | sort1(tree, v1)) % 199.14/27.41 | % 199.14/27.41 | ALPHA: (all_trees_def) implies: % 199.14/27.41 | (8) ! [v0: int] : ! [v1: list_tree] : ! [v2: uni] : ( ~ (t2tb1(v1) = v2) % 199.14/27.41 | | ~ list_tree(v1) | ~ all_trees1(v0, v1) | distinct(tree, v2)) % 199.14/27.41 | (9) ! [v0: int] : ! [v1: list_tree] : ! [v2: uni] : ! [v3: tree1] : ! % 199.14/27.41 | [v4: uni] : ( ~ (t2tb2(v3) = v4) | ~ (t2tb1(v1) = v2) | ~ % 199.14/27.41 | list_tree(v1) | ~ tree1(v3) | ~ all_trees1(v0, v1) | mem(tree, v4, % 199.14/27.41 | v2) | ? [v5: int] : ( ~ (v5 = v0) & size1(v3) = v5)) % 199.14/27.41 | (10) ! [v0: int] : ! [v1: list_tree] : ! [v2: uni] : ! [v3: tree1] : ! % 199.14/27.41 | [v4: uni] : ( ~ (t2tb2(v3) = v4) | ~ (t2tb1(v1) = v2) | ~ % 199.14/27.41 | list_tree(v1) | ~ tree1(v3) | ~ all_trees1(v0, v1) | ~ mem(tree, % 199.14/27.41 | v4, v2) | size1(v3) = v0) % 199.14/27.41 | % 199.14/27.41 | ALPHA: (all_trees_0) implies: % 199.14/27.41 | (11) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : ? [v3: list_tree] : % 199.14/27.41 | (t2tb2(empty1) = v0 & tb2t1(v2) = v3 & cons(tree, v0, v1) = v2 & % 199.14/27.41 | nil(tree) = v1 & list_tree(v3) & uni(v2) & uni(v1) & uni(v0) & % 199.14/27.41 | all_trees1(0, v3)) % 199.14/27.41 | % 199.14/27.41 | ALPHA: (t2tb_sort6) implies: % 199.14/27.41 | (12) ? [v0: ty] : ? [v1: ty] : (map(int, v0) = v1 & list(tree) = v0 & % 199.14/27.41 | ty(v1) & ty(v0) & ! [v2: map_int_lplist_treerp] : ! [v3: uni] : ( % 199.14/27.41 | ~ (t2tb3(v2) = v3) | ~ map_int_lplist_treerp(v2) | sort1(v1, % 199.14/27.41 | v3))) % 199.14/27.41 | % 199.14/27.41 | ALPHA: (wP_parameter_all_trees) implies: % 199.14/27.42 | (13) ty(int) % 199.14/27.42 | (14) ty(tree) % 199.14/27.42 | (15) tree1(empty1) % 199.40/27.44 | (16) ? [v0: ty] : ? [v1: uni] : ? [v2: uni] : ? [v3: uni] : ? [v4: % 199.40/27.44 | uni] : ? [v5: uni] : ? [v6: uni] : ? [v7: map_int_lplist_treerp] % 199.40/27.44 | : ? [v8: map_int_lplist_treerp] : ? [v9: int] : ? [v10: uni] : ? % 199.40/27.44 | [v11: uni] : ? [v12: uni] : ? [v13: map_int_lplist_treerp] : ? % 199.40/27.44 | [v14: map_int_lplist_treerp] : ? [v15: int] : ? [v16: uni] : ? % 199.40/27.44 | [v17: uni] : ? [v18: uni] : ? [v19: uni] : ? [v20: list_tree] : ? % 199.40/27.44 | [v21: uni] : ? [v22: uni] : ? [v23: list_tree] : ? [v24: list_tree] % 199.40/27.44 | : ? [v25: uni] : ? [v26: uni] : ? [v27: uni] : ? [v28: % 199.40/27.44 | map_int_lplist_treerp] : ? [v29: uni] : ? [v30: uni] : ? [v31: % 199.40/27.44 | tree1] : ? [v32: uni] : ? [v33: int] : ($lesseq(1, $difference(v9, % 199.40/27.44 | v15)) & $lesseq(0, v15) & tb2t3(v27) = v28 & tb2t3(v12) = v13 & % 199.40/27.44 | tb2t3(v6) = v7 & t2tb3(v28) = v29 & t2tb3(v14) = v16 & t2tb3(v8) = % 199.40/27.44 | v10 & t2tb2(v31) = v32 & t2tb2(empty1) = v4 & tb2t1(v22) = v23 & % 199.40/27.44 | tb2t1(v19) = v20 & t2tb1(v24) = v25 & size1(v31) = v33 & % 199.40/27.44 | t2tb($sum($difference(v9, v15), -1)) = v21 & t2tb(v15) = v18 & % 199.40/27.44 | t2tb(v9) = v11 & t2tb(0) = v3 & const(v0, int, v1) = v2 & set(v0, % 199.40/27.44 | int, v16, v11, v26) = v27 & set(v0, int, v10, v11, v1) = v12 & % 199.40/27.44 | set(v0, int, v2, v3, v5) = v6 & get(v0, int, v29, v11) = v30 & % 199.40/27.44 | get(v0, int, v16, v21) = v22 & get(v0, int, v16, v18) = v19 & % 199.40/27.44 | get(v0, int, v16, v11) = v17 & infix_plpl(tree, v25, v17) = v26 & % 199.40/27.44 | cons(tree, v4, v1) = v5 & nil(tree) = v1 & list(tree) = v0 & % 199.40/27.44 | map_int_lplist_treerp(v28) & map_int_lplist_treerp(v14) & % 199.40/27.44 | map_int_lplist_treerp(v13) & map_int_lplist_treerp(v8) & % 199.40/27.44 | map_int_lplist_treerp(v7) & list_tree(v24) & list_tree(v23) & % 199.40/27.44 | list_tree(v20) & tree1(v31) & ty(v0) & uni(v32) & uni(v30) & % 199.40/27.44 | uni(v29) & uni(v27) & uni(v26) & uni(v25) & uni(v22) & uni(v21) & % 199.40/27.44 | uni(v19) & uni(v18) & uni(v17) & uni(v16) & uni(v12) & uni(v11) & % 199.40/27.44 | uni(v10) & uni(v6) & uni(v5) & uni(v4) & uni(v3) & uni(v2) & uni(v1) % 199.40/27.44 | & all_trees1($sum($difference(v9, v15), -1), v23) & all_trees1(v15, % 199.40/27.44 | v20) & distinct(tree, v25) & distinct(tree, v17) & mem(tree, v32, % 199.40/27.44 | v30) & ! [v34: tree1] : ! [v35: uni] : ! [v36: tree1] : ! % 199.40/27.44 | [v37: tree1] : ( ~ (t2tb2(v34) = v35) | ~ (node1(v36, v37) = v34) | % 199.40/27.44 | ~ tree1(v37) | ~ tree1(v36) | ~ tree1(v34) | mem(tree, v35, % 199.40/27.44 | v25) | ? [v38: int] : ? [v39: int] : (( ~ % 199.40/27.44 | ($difference($sum(v39, v15), v9) = -1) & size1(v37) = v39) | ( % 199.40/27.44 | ~ (v38 = v15) & size1(v36) = v38))) & ! [v34: int] : ! [v35: % 199.40/27.44 | uni] : ! [v36: uni] : ( ~ ($lesseq(1, $difference(v9, v34))) | ~ % 199.40/27.44 | ($lesseq(0, v34)) | ~ (t2tb(v34) = v35) | ~ (get(v0, int, v16, % 199.40/27.45 | v35) = v36) | ? [v37: list_tree] : (tb2t1(v36) = v37 & % 199.40/27.45 | list_tree(v37) & all_trees1(v34, v37))) & ! [v34: int] : ! % 199.40/27.45 | [v35: uni] : ! [v36: uni] : ( ~ ($lesseq(1, $difference(v9, v34))) % 199.40/27.45 | | ~ ($lesseq(0, v34)) | ~ (t2tb(v34) = v35) | ~ (get(v0, int, % 199.40/27.45 | v10, v35) = v36) | ? [v37: list_tree] : (tb2t1(v36) = v37 & % 199.40/27.45 | list_tree(v37) & all_trees1(v34, v37))) & ! [v34: tree1] : ! % 199.40/27.45 | [v35: tree1] : ( ~ (v33 = v9) | ~ (node1(v34, v35) = v31) | ~ % 199.40/27.45 | tree1(v35) | ~ tree1(v34) | ? [v36: int] : ($lesseq(1, % 199.40/27.45 | $difference(v36, v15)) & size1(v34) = v36)) & ! [v34: tree1] % 199.40/27.45 | : ! [v35: uni] : ( ~ (t2tb2(v34) = v35) | ~ tree1(v34) | ~ % 199.40/27.45 | mem(tree, v35, v25) | ? [v36: tree1] : ? [v37: tree1] : % 199.40/27.45 | (size1(v37) = $sum($difference(v9, v15), -1) & size1(v36) = v15 & % 199.40/27.45 | node1(v36, v37) = v34 & tree1(v37) & tree1(v36))) & ! [v34: % 199.40/27.45 | tree1] : ! [v35: uni] : ( ~ (t2tb2(v34) = v35) | ~ tree1(v34) | % 199.40/27.45 | ~ mem(tree, v35, v17) | ? [v36: tree1] : ? [v37: tree1] : ? % 199.40/27.45 | [v38: int] : ($lesseq(1, $difference(v15, v38)) & size1(v36) = v38 % 199.40/27.45 | & size1(v34) = v9 & node1(v36, v37) = v34 & tree1(v37) & % 199.40/27.45 | tree1(v36))) & ! [v34: tree1] : ! [v35: uni] : ( ~ (t2tb2(v34) % 199.40/27.45 | = v35) | ~ tree1(v34) | mem(tree, v35, v17) | ? [v36: int] : % 199.40/27.45 | (size1(v34) = v36 & ! [v37: tree1] : ! [v38: tree1] : ( ~ (v36 = % 199.40/27.45 | v9) | ~ (node1(v37, v38) = v34) | ~ tree1(v38) | ~ % 199.40/27.45 | tree1(v37) | ? [v39: int] : ($lesseq(v15, v39) & size1(v37) = % 199.40/27.45 | v39))))) % 199.40/27.45 | % 199.40/27.45 | ALPHA: (function-axioms) implies: % 199.40/27.45 | (17) ! [v0: ty] : ! [v1: ty] : ! [v2: ty] : (v1 = v0 | ~ (list(v2) = % 199.40/27.45 | v1) | ~ (list(v2) = v0)) % 199.40/27.45 | (18) ! [v0: uni] : ! [v1: uni] : ! [v2: ty] : (v1 = v0 | ~ (nil(v2) = % 199.53/27.45 | v1) | ~ (nil(v2) = v0)) % 199.53/27.45 | (19) ! [v0: uni] : ! [v1: uni] : ! [v2: int] : (v1 = v0 | ~ (t2tb(v2) = % 199.53/27.45 | v1) | ~ (t2tb(v2) = v0)) % 199.53/27.45 | (20) ! [v0: int] : ! [v1: int] : ! [v2: uni] : (v1 = v0 | ~ (tb2t(v2) = % 199.53/27.45 | v1) | ~ (tb2t(v2) = v0)) % 199.53/27.45 | (21) ! [v0: tree1] : ! [v1: tree1] : ! [v2: tree1] : (v1 = v0 | ~ % 199.53/27.45 | (node_proj_11(v2) = v1) | ~ (node_proj_11(v2) = v0)) % 199.53/27.45 | (22) ! [v0: int] : ! [v1: int] : ! [v2: tree1] : (v1 = v0 | ~ % 199.53/27.45 | (size1(v2) = v1) | ~ (size1(v2) = v0)) % 199.53/27.45 | (23) ! [v0: uni] : ! [v1: uni] : ! [v2: tree1] : (v1 = v0 | ~ % 199.53/27.45 | (t2tb2(v2) = v1) | ~ (t2tb2(v2) = v0)) % 199.53/27.46 | (24) ! [v0: uni] : ! [v1: uni] : ! [v2: map_int_lplist_treerp] : (v1 = % 199.53/27.46 | v0 | ~ (t2tb3(v2) = v1) | ~ (t2tb3(v2) = v0)) % 199.53/27.46 | (25) ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : ! [v4: % 199.53/27.46 | ty] : (v1 = v0 | ~ (cons(v4, v3, v2) = v1) | ~ (cons(v4, v3, v2) = % 199.53/27.46 | v0)) % 199.53/27.46 | % 199.85/27.57 | DELTA: instantiating (6) with fresh symbol all_90_0 gives: % 199.85/27.57 | (26) list(tree) = all_90_0 & ty(all_90_0) & ! [v0: list_tree] : ! [v1: % 199.85/27.58 | uni] : ( ~ (t2tb1(v0) = v1) | ~ list_tree(v0) | sort1(all_90_0, % 199.85/27.58 | v1)) % 199.85/27.58 | % 199.85/27.58 | ALPHA: (26) implies: % 200.04/27.58 | (27) list(tree) = all_90_0 % 200.04/27.58 | % 200.04/27.58 | DELTA: instantiating (12) with fresh symbols all_94_0, all_94_1 gives: % 200.04/27.58 | (28) map(int, all_94_1) = all_94_0 & list(tree) = all_94_1 & ty(all_94_0) & % 200.04/27.58 | ty(all_94_1) & ! [v0: map_int_lplist_treerp] : ! [v1: uni] : ( ~ % 200.04/27.58 | (t2tb3(v0) = v1) | ~ map_int_lplist_treerp(v0) | sort1(all_94_0, % 200.04/27.58 | v1)) % 200.04/27.58 | % 200.04/27.58 | ALPHA: (28) implies: % 200.04/27.58 | (29) list(tree) = all_94_1 % 200.04/27.58 | % 200.04/27.58 | DELTA: instantiating (11) with fresh symbols all_97_0, all_97_1, all_97_2, % 200.04/27.58 | all_97_3 gives: % 200.04/27.58 | (30) t2tb2(empty1) = all_97_3 & tb2t1(all_97_1) = all_97_0 & cons(tree, % 200.04/27.58 | all_97_3, all_97_2) = all_97_1 & nil(tree) = all_97_2 & % 200.04/27.58 | list_tree(all_97_0) & uni(all_97_1) & uni(all_97_2) & uni(all_97_3) & % 200.04/27.58 | all_trees1(0, all_97_0) % 200.04/27.58 | % 200.04/27.58 | ALPHA: (30) implies: % 200.04/27.58 | (31) all_trees1(0, all_97_0) % 200.04/27.58 | (32) list_tree(all_97_0) % 200.04/27.58 | (33) nil(tree) = all_97_2 % 200.04/27.58 | (34) cons(tree, all_97_3, all_97_2) = all_97_1 % 200.04/27.58 | (35) tb2t1(all_97_1) = all_97_0 % 200.04/27.59 | (36) t2tb2(empty1) = all_97_3 % 200.04/27.59 | % 200.04/27.59 | DELTA: instantiating (16) with fresh symbols all_101_0, all_101_1, all_101_2, % 200.04/27.59 | all_101_3, all_101_4, all_101_5, all_101_6, all_101_7, all_101_8, % 200.04/27.59 | all_101_9, all_101_10, all_101_11, all_101_12, all_101_13, all_101_14, % 200.04/27.59 | all_101_15, all_101_16, all_101_17, all_101_18, all_101_19, all_101_20, % 200.04/27.59 | all_101_21, all_101_22, all_101_23, all_101_24, all_101_25, all_101_26, % 200.04/27.59 | all_101_27, all_101_28, all_101_29, all_101_30, all_101_31, all_101_32, % 200.04/27.59 | all_101_33 gives: % 200.04/27.60 | (37) $lesseq(1, $difference(all_101_24, all_101_18)) & $lesseq(0, % 200.04/27.60 | all_101_18) & tb2t3(all_101_6) = all_101_5 & tb2t3(all_101_21) = % 200.04/27.60 | all_101_20 & tb2t3(all_101_27) = all_101_26 & t2tb3(all_101_5) = % 200.04/27.60 | all_101_4 & t2tb3(all_101_19) = all_101_17 & t2tb3(all_101_25) = % 200.04/27.60 | all_101_23 & t2tb2(all_101_2) = all_101_1 & t2tb2(empty1) = all_101_29 % 200.04/27.60 | & tb2t1(all_101_11) = all_101_10 & tb2t1(all_101_14) = all_101_13 & % 200.04/27.60 | t2tb1(all_101_9) = all_101_8 & size1(all_101_2) = all_101_0 & % 200.04/27.60 | t2tb($sum($difference(all_101_24, all_101_18), -1)) = all_101_12 & % 200.04/27.60 | t2tb(all_101_18) = all_101_15 & t2tb(all_101_24) = all_101_22 & % 200.04/27.60 | t2tb(0) = all_101_30 & const(all_101_33, int, all_101_32) = all_101_31 % 200.04/27.60 | & set(all_101_33, int, all_101_17, all_101_22, all_101_7) = all_101_6 % 200.04/27.60 | & set(all_101_33, int, all_101_23, all_101_22, all_101_32) = % 200.04/27.60 | all_101_21 & set(all_101_33, int, all_101_31, all_101_30, all_101_28) % 200.04/27.60 | = all_101_27 & get(all_101_33, int, all_101_4, all_101_22) = all_101_3 % 200.04/27.60 | & get(all_101_33, int, all_101_17, all_101_12) = all_101_11 & % 200.04/27.60 | get(all_101_33, int, all_101_17, all_101_15) = all_101_14 & % 200.04/27.60 | get(all_101_33, int, all_101_17, all_101_22) = all_101_16 & % 200.04/27.60 | infix_plpl(tree, all_101_8, all_101_16) = all_101_7 & cons(tree, % 200.04/27.60 | all_101_29, all_101_32) = all_101_28 & nil(tree) = all_101_32 & % 200.04/27.60 | list(tree) = all_101_33 & map_int_lplist_treerp(all_101_5) & % 200.04/27.60 | map_int_lplist_treerp(all_101_19) & map_int_lplist_treerp(all_101_20) % 200.04/27.60 | & map_int_lplist_treerp(all_101_25) & % 200.04/27.60 | map_int_lplist_treerp(all_101_26) & list_tree(all_101_9) & % 200.04/27.60 | list_tree(all_101_10) & list_tree(all_101_13) & tree1(all_101_2) & % 200.04/27.60 | ty(all_101_33) & uni(all_101_1) & uni(all_101_3) & uni(all_101_4) & % 200.04/27.60 | uni(all_101_6) & uni(all_101_7) & uni(all_101_8) & uni(all_101_11) & % 200.04/27.60 | uni(all_101_12) & uni(all_101_14) & uni(all_101_15) & uni(all_101_16) % 200.04/27.60 | & uni(all_101_17) & uni(all_101_21) & uni(all_101_22) & % 200.04/27.60 | uni(all_101_23) & uni(all_101_27) & uni(all_101_28) & uni(all_101_29) % 200.04/27.60 | & uni(all_101_30) & uni(all_101_31) & uni(all_101_32) & % 200.04/27.60 | all_trees1($sum($difference(all_101_24, all_101_18), -1), all_101_10) % 200.04/27.60 | & all_trees1(all_101_18, all_101_13) & distinct(tree, all_101_8) & % 200.04/27.60 | distinct(tree, all_101_16) & mem(tree, all_101_1, all_101_3) & ! [v0: % 200.04/27.60 | tree1] : ! [v1: uni] : ! [v2: tree1] : ! [v3: tree1] : ( ~ % 200.04/27.60 | (t2tb2(v0) = v1) | ~ (node1(v2, v3) = v0) | ~ tree1(v3) | ~ % 200.04/27.60 | tree1(v2) | ~ tree1(v0) | mem(tree, v1, all_101_8) | ? [v4: int] : % 200.04/27.60 | ? [v5: int] : (( ~ ($difference($sum(v5, all_101_18), all_101_24) = % 200.04/27.60 | -1) & size1(v3) = v5) | ( ~ (v4 = all_101_18) & size1(v2) = % 200.04/27.60 | v4))) & ! [v0: int] : ! [v1: uni] : ! [v2: uni] : ( ~ % 200.04/27.60 | ($lesseq(1, $difference(all_101_24, v0))) | ~ ($lesseq(0, v0)) | ~ % 200.04/27.60 | (t2tb(v0) = v1) | ~ (get(all_101_33, int, all_101_17, v1) = v2) | % 200.04/27.60 | ? [v3: list_tree] : (tb2t1(v2) = v3 & list_tree(v3) & all_trees1(v0, % 200.04/27.60 | v3))) & ! [v0: int] : ! [v1: uni] : ! [v2: uni] : ( ~ % 200.04/27.60 | ($lesseq(1, $difference(all_101_24, v0))) | ~ ($lesseq(0, v0)) | ~ % 200.04/27.60 | (t2tb(v0) = v1) | ~ (get(all_101_33, int, all_101_23, v1) = v2) | % 200.04/27.60 | ? [v3: list_tree] : (tb2t1(v2) = v3 & list_tree(v3) & all_trees1(v0, % 200.04/27.60 | v3))) & ! [v0: tree1] : ! [v1: tree1] : ( ~ (all_101_0 = % 200.04/27.60 | all_101_24) | ~ (node1(v0, v1) = all_101_2) | ~ tree1(v1) | ~ % 200.04/27.60 | tree1(v0) | ? [v2: int] : ($lesseq(1, $difference(v2, all_101_18)) % 200.04/27.60 | & size1(v0) = v2)) & ! [v0: tree1] : ! [v1: uni] : ( ~ % 200.04/27.60 | (t2tb2(v0) = v1) | ~ tree1(v0) | ~ mem(tree, v1, all_101_8) | ? % 200.04/27.60 | [v2: tree1] : ? [v3: tree1] : (size1(v3) = % 200.04/27.60 | $sum($difference(all_101_24, all_101_18), -1) & size1(v2) = % 200.04/27.60 | all_101_18 & node1(v2, v3) = v0 & tree1(v3) & tree1(v2))) & ! % 200.04/27.60 | [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) | ~ tree1(v0) | ~ % 200.04/27.60 | mem(tree, v1, all_101_16) | ? [v2: tree1] : ? [v3: tree1] : ? % 200.04/27.60 | [v4: int] : ($lesseq(1, $difference(all_101_18, v4)) & size1(v2) = % 200.04/27.60 | v4 & size1(v0) = all_101_24 & node1(v2, v3) = v0 & tree1(v3) & % 200.04/27.60 | tree1(v2))) & ! [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) % 200.04/27.60 | | ~ tree1(v0) | mem(tree, v1, all_101_16) | ? [v2: int] : % 200.04/27.60 | (size1(v0) = v2 & ! [v3: tree1] : ! [v4: tree1] : ( ~ (v2 = % 200.04/27.60 | all_101_24) | ~ (node1(v3, v4) = v0) | ~ tree1(v4) | ~ % 200.04/27.60 | tree1(v3) | ? [v5: int] : ($lesseq(all_101_18, v5) & size1(v3) % 200.04/27.60 | = v5)))) % 200.04/27.60 | % 200.04/27.60 | ALPHA: (37) implies: % 200.04/27.61 | (38) $lesseq(0, all_101_18) % 200.04/27.61 | (39) $lesseq(1, $difference(all_101_24, all_101_18)) % 200.04/27.61 | (40) mem(tree, all_101_1, all_101_3) % 200.04/27.61 | (41) distinct(tree, all_101_16) % 200.04/27.61 | (42) all_trees1(all_101_18, all_101_13) % 200.04/27.61 | (43) all_trees1($sum($difference(all_101_24, all_101_18), -1), all_101_10) % 200.04/27.61 | (44) uni(all_101_32) % 200.04/27.61 | (45) uni(all_101_29) % 200.04/27.61 | (46) uni(all_101_28) % 200.04/27.61 | (47) uni(all_101_22) % 200.04/27.61 | (48) uni(all_101_17) % 200.04/27.61 | (49) uni(all_101_16) % 200.04/27.61 | (50) uni(all_101_14) % 200.04/27.61 | (51) uni(all_101_11) % 200.04/27.61 | (52) uni(all_101_8) % 200.04/27.61 | (53) uni(all_101_7) % 200.04/27.61 | (54) uni(all_101_6) % 200.04/27.61 | (55) uni(all_101_3) % 200.04/27.61 | (56) uni(all_101_1) % 200.04/27.61 | (57) tree1(all_101_2) % 200.04/27.61 | (58) list_tree(all_101_13) % 200.04/27.61 | (59) list_tree(all_101_10) % 200.04/27.61 | (60) list(tree) = all_101_33 % 200.04/27.61 | (61) nil(tree) = all_101_32 % 200.04/27.61 | (62) cons(tree, all_101_29, all_101_32) = all_101_28 % 200.04/27.61 | (63) infix_plpl(tree, all_101_8, all_101_16) = all_101_7 % 200.04/27.61 | (64) get(all_101_33, int, all_101_4, all_101_22) = all_101_3 % 200.04/27.61 | (65) set(all_101_33, int, all_101_17, all_101_22, all_101_7) = all_101_6 % 200.04/27.61 | (66) t2tb(0) = all_101_30 % 200.04/27.61 | (67) t2tb(all_101_18) = all_101_15 % 200.04/27.61 | (68) t2tb($sum($difference(all_101_24, all_101_18), -1)) = all_101_12 % 200.04/27.61 | (69) size1(all_101_2) = all_101_0 % 200.04/27.61 | (70) tb2t1(all_101_14) = all_101_13 % 200.04/27.61 | (71) tb2t1(all_101_11) = all_101_10 % 200.04/27.61 | (72) t2tb2(empty1) = all_101_29 % 200.04/27.61 | (73) t2tb2(all_101_2) = all_101_1 % 200.04/27.61 | (74) t2tb3(all_101_5) = all_101_4 % 200.04/27.61 | (75) tb2t3(all_101_6) = all_101_5 % 200.04/27.62 | (76) ! [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) | ~ tree1(v0) | % 200.04/27.62 | mem(tree, v1, all_101_16) | ? [v2: int] : (size1(v0) = v2 & ! [v3: % 200.04/27.62 | tree1] : ! [v4: tree1] : ( ~ (v2 = all_101_24) | ~ (node1(v3, % 200.04/27.62 | v4) = v0) | ~ tree1(v4) | ~ tree1(v3) | ? [v5: int] : % 200.04/27.62 | ($lesseq(all_101_18, v5) & size1(v3) = v5)))) % 200.04/27.62 | (77) ! [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) | ~ tree1(v0) | % 200.04/27.62 | ~ mem(tree, v1, all_101_16) | ? [v2: tree1] : ? [v3: tree1] : ? % 200.04/27.62 | [v4: int] : ($lesseq(1, $difference(all_101_18, v4)) & size1(v2) = % 200.04/27.62 | v4 & size1(v0) = all_101_24 & node1(v2, v3) = v0 & tree1(v3) & % 200.04/27.62 | tree1(v2))) % 200.04/27.62 | (78) ! [v0: tree1] : ! [v1: uni] : ( ~ (t2tb2(v0) = v1) | ~ tree1(v0) | % 200.04/27.62 | ~ mem(tree, v1, all_101_8) | ? [v2: tree1] : ? [v3: tree1] : % 200.04/27.62 | (size1(v3) = $sum($difference(all_101_24, all_101_18), -1) & % 200.04/27.62 | size1(v2) = all_101_18 & node1(v2, v3) = v0 & tree1(v3) & % 200.04/27.62 | tree1(v2))) % 200.04/27.62 | (79) ! [v0: tree1] : ! [v1: tree1] : ( ~ (all_101_0 = all_101_24) | ~ % 200.04/27.62 | (node1(v0, v1) = all_101_2) | ~ tree1(v1) | ~ tree1(v0) | ? [v2: % 200.04/27.62 | int] : ($lesseq(1, $difference(v2, all_101_18)) & size1(v0) = v2)) % 200.04/27.62 | % 200.04/27.62 | GROUND_INST: instantiating (17) with all_94_1, all_101_33, tree, simplifying % 200.04/27.62 | with (29), (60) gives: % 200.04/27.62 | (80) all_101_33 = all_94_1 % 200.04/27.62 | % 200.04/27.62 | GROUND_INST: instantiating (17) with all_90_0, all_101_33, tree, simplifying % 200.04/27.62 | with (27), (60) gives: % 200.04/27.62 | (81) all_101_33 = all_90_0 % 200.04/27.62 | % 200.04/27.62 | GROUND_INST: instantiating (18) with all_97_2, all_101_32, tree, simplifying % 200.04/27.62 | with (33), (61) gives: % 200.04/27.62 | (82) all_101_32 = all_97_2 % 200.04/27.62 | % 200.04/27.62 | GROUND_INST: instantiating (19) with all_101_30, all_101_15, 0, simplifying % 200.04/27.62 | with (66) gives: % 200.04/27.62 | (83) all_101_15 = all_101_30 | ~ (t2tb(0) = all_101_15) % 200.04/27.62 | % 200.04/27.63 | GROUND_INST: instantiating (19) with all_101_30, all_101_12, 0, simplifying % 200.04/27.63 | with (66) gives: % 200.04/27.63 | (84) all_101_12 = all_101_30 | ~ (t2tb(0) = all_101_12) % 200.04/27.63 | % 200.04/27.63 | GROUND_INST: instantiating (23) with all_97_3, all_101_29, empty1, simplifying % 200.04/27.63 | with (36), (72) gives: % 200.04/27.63 | (85) all_101_29 = all_97_3 % 200.04/27.63 | % 200.04/27.63 | COMBINE_EQS: (80), (81) imply: % 200.04/27.63 | (86) all_94_1 = all_90_0 % 200.04/27.63 | % 200.04/27.63 | SIMP: (86) implies: % 200.04/27.63 | (87) all_94_1 = all_90_0 % 200.04/27.63 | % 200.04/27.63 | REDUCE: (65), (81) imply: % 200.04/27.63 | (88) set(all_90_0, int, all_101_17, all_101_22, all_101_7) = all_101_6 % 200.04/27.63 | % 200.04/27.63 | REDUCE: (64), (81) imply: % 200.04/27.63 | (89) get(all_90_0, int, all_101_4, all_101_22) = all_101_3 % 200.04/27.63 | % 200.04/27.63 | REDUCE: (62), (82), (85) imply: % 200.04/27.63 | (90) cons(tree, all_97_3, all_97_2) = all_101_28 % 200.04/27.63 | % 200.04/27.63 | REDUCE: (45), (85) imply: % 200.04/27.63 | (91) uni(all_97_3) % 200.04/27.63 | % 200.04/27.63 | REDUCE: (44), (82) imply: % 200.04/27.63 | (92) uni(all_97_2) % 200.04/27.63 | % 200.04/27.63 | GROUND_INST: instantiating (25) with all_97_1, all_101_28, all_97_2, all_97_3, % 200.04/27.63 | tree, simplifying with (34), (90) gives: % 200.04/27.63 | (93) all_101_28 = all_97_1 % 200.04/27.63 | % 200.04/27.63 | REDUCE: (46), (93) imply: % 200.04/27.63 | (94) uni(all_97_1) % 200.04/27.63 | % 200.04/27.63 | GROUND_INST: instantiating (mem_decomp) with tree, all_101_1, all_101_3, % 200.04/27.63 | all_90_0, simplifying with (14), (27), (40), (55), (56) gives: % 200.04/27.63 | (95) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, v2) % 200.04/27.63 | = all_101_3 & cons(tree, all_101_1, v1) = v2 & uni(v2) & uni(v1) & % 200.04/27.63 | uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.63 | % 200.04/27.63 | GROUND_INST: instantiating (distinct_inversion) with tree, all_101_16, % 200.04/27.63 | all_97_2, simplifying with (14), (33), (41), (49) gives: % 200.04/27.63 | (96) all_101_16 = all_97_2 | ? [v0: ty] : ? [v1: uni] : ? [v2: uni] : ? % 200.04/27.63 | [v3: int] : ? [v4: uni] : ? [v5: int] : (uni(v4) & uni(v2) & uni(v1) % 200.04/27.63 | & ((v5 = all_101_16 & cons(tree, v4, all_97_2) = all_101_16 & % 200.04/27.63 | sort1(tree, v4)) | (v3 = all_101_16 & cons(tree, v1, v2) = % 200.04/27.63 | all_101_16 & list(tree) = v0 & ty(v0) & distinct(tree, v2) & % 200.04/27.63 | sort1(v0, v2) & sort1(tree, v1) & ~ mem(tree, v1, v2)))) % 200.04/27.63 | % 200.04/27.63 | GROUND_INST: instantiating (nil_sort2) with tree, all_97_2, simplifying with % 200.04/27.63 | (14), (33) gives: % 200.04/27.64 | (97) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_97_2)) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (distinct_one) with tree, all_97_3, all_97_2, % 200.04/27.64 | all_97_1, simplifying with (14), (33), (34), (91) gives: % 200.04/27.64 | (98) distinct(tree, all_97_1) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (nil_Cons1) with tree, all_97_3, all_97_2, % 200.04/27.64 | all_97_1, simplifying with (14), (34), (91), (92) gives: % 200.04/27.64 | (99) ? [v0: any] : ( ~ (v0 = all_97_1) & nil(tree) = v0 & uni(v0)) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (cons_sort2) with tree, all_97_3, all_97_2, % 200.04/27.64 | all_97_1, simplifying with (14), (34), (91), (92) gives: % 200.04/27.64 | (100) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_97_1)) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (infix_plpl_sort2) with tree, all_101_8, % 200.04/27.64 | all_101_16, all_101_7, simplifying with (14), (49), (52), (63) % 200.04/27.64 | gives: % 200.04/27.64 | (101) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_101_7)) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (bridgeL) with 0, all_101_30, simplifying with (66) % 200.04/27.64 | gives: % 200.04/27.64 | (102) tb2t(all_101_30) = 0 % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (bridgeL) with all_101_18, all_101_15, simplifying % 200.04/27.64 | with (67) gives: % 200.04/27.64 | (103) tb2t(all_101_15) = all_101_18 % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (bridgeL) with $sum($difference(all_101_24, % 200.04/27.64 | all_101_18), -1), all_101_12, simplifying with (68) gives: % 200.04/27.64 | (104) tb2t(all_101_12) = $sum($difference(all_101_24, all_101_18), -1) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (size_nonneg) with all_101_2, all_101_0, % 200.04/27.64 | simplifying with (57), (69) gives: % 200.04/27.64 | (105) $lesseq(0, all_101_0) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (size_left) with all_101_2, all_101_0, simplifying % 200.04/27.64 | with (57), (69) gives: % 200.04/27.64 | (106) ~ ($lesseq(1, all_101_0)) | ? [v0: tree1] : ? [v1: tree1] : ? % 200.04/27.64 | [v2: int] : ($lesseq(1, $difference(all_101_0, v2)) & size1(v0) = v2 % 200.04/27.64 | & node1(v0, v1) = all_101_2 & tree1(v1) & tree1(v0)) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (bridgeR1) with all_97_1, all_97_0, simplifying % 200.04/27.64 | with (35), (94) gives: % 200.04/27.64 | (107) t2tb1(all_97_0) = all_97_1 % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (bridgeR1) with all_101_14, all_101_13, simplifying % 200.04/27.64 | with (50), (70) gives: % 200.04/27.64 | (108) t2tb1(all_101_13) = all_101_14 % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (bridgeR1) with all_101_11, all_101_10, simplifying % 200.04/27.64 | with (51), (71) gives: % 200.04/27.64 | (109) t2tb1(all_101_10) = all_101_11 % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (7) with empty1, all_97_3, simplifying with (15), % 200.04/27.64 | (36) gives: % 200.04/27.64 | (110) sort1(tree, all_97_3) % 200.04/27.64 | % 200.04/27.64 | GROUND_INST: instantiating (76) with all_101_2, all_101_1, simplifying with % 200.04/27.64 | (57), (73) gives: % 200.04/27.65 | (111) mem(tree, all_101_1, all_101_16) | ? [v0: int] : (size1(all_101_2) = % 200.04/27.65 | v0 & ! [v1: tree1] : ! [v2: tree1] : ( ~ (v0 = all_101_24) | ~ % 200.04/27.65 | (node1(v1, v2) = all_101_2) | ~ tree1(v2) | ~ tree1(v1) | ? % 200.04/27.65 | [v3: int] : ($lesseq(all_101_18, v3) & size1(v1) = v3))) % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (7) with all_101_2, all_101_1, simplifying with % 200.04/27.65 | (57), (73) gives: % 200.04/27.65 | (112) sort1(tree, all_101_1) % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (bridgeR3) with all_101_6, all_101_5, simplifying % 200.04/27.65 | with (54), (75) gives: % 200.04/27.65 | (113) t2tb3(all_101_5) = all_101_6 % 200.04/27.65 | % 200.04/27.65 | DELTA: instantiating (101) with fresh symbol all_133_0 gives: % 200.04/27.65 | (114) list(tree) = all_133_0 & ty(all_133_0) & sort1(all_133_0, all_101_7) % 200.04/27.65 | % 200.04/27.65 | ALPHA: (114) implies: % 200.04/27.65 | (115) sort1(all_133_0, all_101_7) % 200.04/27.65 | (116) ty(all_133_0) % 200.04/27.65 | (117) list(tree) = all_133_0 % 200.04/27.65 | % 200.04/27.65 | DELTA: instantiating (97) with fresh symbol all_135_0 gives: % 200.04/27.65 | (118) list(tree) = all_135_0 & ty(all_135_0) & sort1(all_135_0, all_97_2) % 200.04/27.65 | % 200.04/27.65 | ALPHA: (118) implies: % 200.04/27.65 | (119) list(tree) = all_135_0 % 200.04/27.65 | % 200.04/27.65 | DELTA: instantiating (100) with fresh symbol all_137_0 gives: % 200.04/27.65 | (120) list(tree) = all_137_0 & ty(all_137_0) & sort1(all_137_0, all_97_1) % 200.04/27.65 | % 200.04/27.65 | ALPHA: (120) implies: % 200.04/27.65 | (121) list(tree) = all_137_0 % 200.04/27.65 | % 200.04/27.65 | DELTA: instantiating (99) with fresh symbol all_139_0 gives: % 200.04/27.65 | (122) ~ (all_139_0 = all_97_1) & nil(tree) = all_139_0 & uni(all_139_0) % 200.04/27.65 | % 200.04/27.65 | ALPHA: (122) implies: % 200.04/27.65 | (123) ~ (all_139_0 = all_97_1) % 200.04/27.65 | (124) uni(all_139_0) % 200.04/27.65 | (125) nil(tree) = all_139_0 % 200.04/27.65 | % 200.04/27.65 | DELTA: instantiating (95) with fresh symbols all_141_0, all_141_1, all_141_2 % 200.04/27.65 | gives: % 200.04/27.65 | (126) infix_plpl(tree, all_141_2, all_141_0) = all_101_3 & cons(tree, % 200.04/27.65 | all_101_1, all_141_1) = all_141_0 & uni(all_141_0) & uni(all_141_1) % 200.04/27.65 | & uni(all_141_2) & sort1(all_90_0, all_141_1) & sort1(all_90_0, % 200.04/27.65 | all_141_2) % 200.04/27.65 | % 200.04/27.65 | ALPHA: (126) implies: % 200.04/27.65 | (127) uni(all_141_1) % 200.04/27.65 | (128) uni(all_141_0) % 200.04/27.65 | (129) cons(tree, all_101_1, all_141_1) = all_141_0 % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (17) with all_90_0, all_135_0, tree, simplifying % 200.04/27.65 | with (27), (119) gives: % 200.04/27.65 | (130) all_135_0 = all_90_0 % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (17) with all_135_0, all_137_0, tree, simplifying % 200.04/27.65 | with (119), (121) gives: % 200.04/27.65 | (131) all_137_0 = all_135_0 % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (17) with all_133_0, all_137_0, tree, simplifying % 200.04/27.65 | with (117), (121) gives: % 200.04/27.65 | (132) all_137_0 = all_133_0 % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (18) with all_97_2, all_139_0, tree, simplifying % 200.04/27.65 | with (33), (125) gives: % 200.04/27.65 | (133) all_139_0 = all_97_2 % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (24) with all_101_4, all_101_6, all_101_5, % 200.04/27.65 | simplifying with (74), (113) gives: % 200.04/27.65 | (134) all_101_4 = all_101_6 % 200.04/27.65 | % 200.04/27.65 | COMBINE_EQS: (131), (132) imply: % 200.04/27.65 | (135) all_135_0 = all_133_0 % 200.04/27.65 | % 200.04/27.65 | SIMP: (135) implies: % 200.04/27.65 | (136) all_135_0 = all_133_0 % 200.04/27.65 | % 200.04/27.65 | COMBINE_EQS: (130), (136) imply: % 200.04/27.65 | (137) all_133_0 = all_90_0 % 200.04/27.65 | % 200.04/27.65 | REDUCE: (123), (133) imply: % 200.04/27.65 | (138) ~ (all_97_1 = all_97_2) % 200.04/27.65 | % 200.04/27.65 | SIMP: (138) implies: % 200.04/27.65 | (139) ~ (all_97_1 = all_97_2) % 200.04/27.65 | % 200.04/27.65 | REDUCE: (89), (134) imply: % 200.04/27.65 | (140) get(all_90_0, int, all_101_6, all_101_22) = all_101_3 % 200.04/27.65 | % 200.04/27.65 | REDUCE: (116), (137) imply: % 200.04/27.65 | (141) ty(all_90_0) % 200.04/27.65 | % 200.04/27.65 | REDUCE: (115), (137) imply: % 200.04/27.65 | (142) sort1(all_90_0, all_101_7) % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (2) with tree, all_97_3, all_97_2, all_97_2, % 200.04/27.65 | all_97_1, simplifying with (14), (33), (34), (91), (92), (110) % 200.04/27.65 | gives: % 200.04/27.65 | (143) mem(tree, all_97_3, all_97_1) % 200.04/27.65 | % 200.04/27.65 | GROUND_INST: instantiating (distinct_inversion) with tree, all_97_1, all_97_2, % 200.04/27.65 | simplifying with (14), (33), (94), (98) gives: % 200.04/27.66 | (144) all_97_1 = all_97_2 | ? [v0: ty] : ? [v1: uni] : ? [v2: uni] : ? % 200.04/27.66 | [v3: int] : ? [v4: uni] : ? [v5: int] : (uni(v4) & uni(v2) & % 200.04/27.66 | uni(v1) & ((v5 = all_97_1 & cons(tree, v4, all_97_2) = all_97_1 & % 200.04/27.66 | sort1(tree, v4)) | (v3 = all_97_1 & cons(tree, v1, v2) = % 200.04/27.66 | all_97_1 & list(tree) = v0 & ty(v0) & distinct(tree, v2) & % 200.04/27.66 | sort1(v0, v2) & sort1(tree, v1) & ~ mem(tree, v1, v2)))) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (2) with tree, all_101_1, all_97_2, all_141_1, % 200.04/27.66 | all_141_0, simplifying with (14), (33), (56), (112), (127), (129) % 200.04/27.66 | gives: % 200.04/27.66 | (145) mem(tree, all_101_1, all_141_0) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, all_141_1, % 200.04/27.66 | all_141_0, simplifying with (14), (56), (127), (129) gives: % 200.04/27.66 | (146) ? [v0: any] : ( ~ (v0 = all_141_0) & nil(tree) = v0 & uni(v0)) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (cons_sort2) with tree, all_101_1, all_141_1, % 200.04/27.66 | all_141_0, simplifying with (14), (56), (127), (129) gives: % 200.04/27.66 | (147) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_141_0)) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (select_eq) with int, all_90_0, all_101_17, % 200.04/27.66 | all_101_22, all_101_7, all_101_6, all_101_3, simplifying with % 200.04/27.66 | (13), (47), (48), (53), (88), (140), (141), (142) gives: % 200.04/27.66 | (148) all_101_3 = all_101_7 % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (9) with 0, all_97_0, all_97_1, all_101_2, % 200.04/27.66 | all_101_1, simplifying with (31), (32), (57), (73), (107) gives: % 200.04/27.66 | (149) mem(tree, all_101_1, all_97_1) | ? [v0: int] : ( ~ (v0 = 0) & % 200.04/27.66 | size1(all_101_2) = v0) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (9) with all_101_18, all_101_13, all_101_14, % 200.04/27.66 | all_101_2, all_101_1, simplifying with (42), (57), (58), (73), % 200.04/27.66 | (108) gives: % 200.04/27.66 | (150) mem(tree, all_101_1, all_101_14) | ? [v0: int] : ( ~ (v0 = % 200.04/27.66 | all_101_18) & size1(all_101_2) = v0) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (9) with all_101_18, all_101_13, all_101_14, % 200.04/27.66 | empty1, all_97_3, simplifying with (15), (36), (42), (58), (108) % 200.04/27.66 | gives: % 200.04/27.66 | (151) mem(tree, all_97_3, all_101_14) | ? [v0: int] : ( ~ (v0 = % 200.04/27.66 | all_101_18) & size1(empty1) = v0) % 200.04/27.66 | % 200.04/27.66 | GROUND_INST: instantiating (8) with all_101_18, all_101_13, all_101_14, % 200.04/27.66 | simplifying with (42), (58), (108) gives: % 200.04/27.66 | (152) distinct(tree, all_101_14) % 200.04/27.66 | % 200.04/27.67 | GROUND_INST: instantiating (9) with $sum($difference(all_101_24, all_101_18), % 200.04/27.67 | -1), all_101_10, all_101_11, all_101_2, all_101_1, simplifying % 200.04/27.67 | with (43), (57), (59), (73), (109) gives: % 200.04/27.67 | (153) mem(tree, all_101_1, all_101_11) | ? [v0: int] : ( ~ % 200.04/27.67 | ($difference($sum(v0, all_101_18), all_101_24) = -1) & % 200.04/27.67 | size1(all_101_2) = v0) % 200.04/27.67 | % 200.04/27.67 | GROUND_INST: instantiating (9) with $sum($difference(all_101_24, all_101_18), % 200.04/27.67 | -1), all_101_10, all_101_11, empty1, all_97_3, simplifying with % 200.04/27.67 | (15), (36), (43), (59), (109) gives: % 200.04/27.67 | (154) mem(tree, all_97_3, all_101_11) | ? [v0: int] : ( ~ % 200.04/27.67 | ($difference($sum(v0, all_101_18), all_101_24) = -1) & % 200.04/27.67 | size1(empty1) = v0) % 200.04/27.67 | % 200.04/27.67 | GROUND_INST: instantiating (8) with $sum($difference(all_101_24, all_101_18), % 200.04/27.67 | -1), all_101_10, all_101_11, simplifying with (43), (59), (109) % 200.04/27.67 | gives: % 200.04/27.67 | (155) distinct(tree, all_101_11) % 200.04/27.67 | % 200.04/27.67 | DELTA: instantiating (146) with fresh symbol all_156_0 gives: % 200.04/27.67 | (156) ~ (all_156_0 = all_141_0) & nil(tree) = all_156_0 & uni(all_156_0) % 200.04/27.67 | % 200.04/27.67 | ALPHA: (156) implies: % 200.04/27.67 | (157) nil(tree) = all_156_0 % 200.04/27.67 | % 200.04/27.67 | DELTA: instantiating (147) with fresh symbol all_158_0 gives: % 200.04/27.67 | (158) list(tree) = all_158_0 & ty(all_158_0) & sort1(all_158_0, all_141_0) % 200.04/27.67 | % 200.04/27.67 | ALPHA: (158) implies: % 200.04/27.67 | (159) list(tree) = all_158_0 % 200.04/27.67 | % 200.04/27.67 | REDUCE: (40), (148) imply: % 200.04/27.67 | (160) mem(tree, all_101_1, all_101_7) % 200.04/27.67 | % 200.04/27.67 | BETA: splitting (144) gives: % 200.04/27.67 | % 200.04/27.67 | Case 1: % 200.04/27.67 | | % 200.04/27.67 | | (161) all_97_1 = all_97_2 % 200.04/27.67 | | % 200.04/27.67 | | REDUCE: (139), (161) imply: % 200.04/27.67 | | (162) $false % 200.04/27.67 | | % 200.04/27.67 | | CLOSE: (162) is inconsistent. % 200.04/27.67 | | % 200.04/27.67 | Case 2: % 200.04/27.67 | | % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (17) with all_90_0, all_158_0, tree, simplifying % 200.04/27.68 | | with (27), (159) gives: % 200.04/27.68 | | (163) all_158_0 = all_90_0 % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (18) with all_97_2, all_156_0, tree, simplifying % 200.04/27.68 | | with (33), (157) gives: % 200.04/27.68 | | (164) all_156_0 = all_97_2 % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (mem_decomp) with tree, all_97_3, all_97_1, % 200.04/27.68 | | all_90_0, simplifying with (14), (27), (91), (94), (143) gives: % 200.04/27.68 | | (165) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, % 200.04/27.68 | | v2) = all_97_1 & cons(tree, all_97_3, v1) = v2 & uni(v2) & % 200.04/27.68 | | uni(v1) & uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (3) with tree, all_101_1, all_101_8, all_101_16, % 200.04/27.68 | | all_101_7, simplifying with (14), (49), (52), (56), (63), (160) % 200.04/27.68 | | gives: % 200.04/27.68 | | (166) mem(tree, all_101_1, all_101_8) | mem(tree, all_101_1, all_101_16) % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (mem_decomp) with tree, all_101_1, all_101_7, % 200.04/27.68 | | all_90_0, simplifying with (14), (27), (53), (56), (160) gives: % 200.04/27.68 | | (167) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, % 200.04/27.68 | | v2) = all_101_7 & cons(tree, all_101_1, v1) = v2 & uni(v2) & % 200.04/27.68 | | uni(v1) & uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (mem_decomp) with tree, all_101_1, all_141_0, % 200.04/27.68 | | all_90_0, simplifying with (14), (27), (56), (128), (145) % 200.04/27.68 | | gives: % 200.04/27.68 | | (168) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, % 200.04/27.68 | | v2) = all_141_0 & cons(tree, all_101_1, v1) = v2 & uni(v2) & % 200.04/27.68 | | uni(v1) & uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (distinct_inversion) with tree, all_101_14, % 200.04/27.68 | | all_97_2, simplifying with (14), (33), (50), (152) gives: % 200.04/27.68 | | (169) all_101_14 = all_97_2 | ? [v0: ty] : ? [v1: uni] : ? [v2: uni] : % 200.04/27.68 | | ? [v3: int] : ? [v4: uni] : ? [v5: int] : (uni(v4) & uni(v2) & % 200.04/27.68 | | uni(v1) & ((v5 = all_101_14 & cons(tree, v4, all_97_2) = % 200.04/27.68 | | all_101_14 & sort1(tree, v4)) | (v3 = all_101_14 & cons(tree, % 200.04/27.68 | | v1, v2) = all_101_14 & list(tree) = v0 & ty(v0) & % 200.04/27.68 | | distinct(tree, v2) & sort1(v0, v2) & sort1(tree, v1) & ~ % 200.04/27.68 | | mem(tree, v1, v2)))) % 200.04/27.68 | | % 200.04/27.68 | | GROUND_INST: instantiating (distinct_inversion) with tree, all_101_11, % 200.04/27.68 | | all_97_2, simplifying with (14), (33), (51), (155) gives: % 200.04/27.69 | | (170) all_101_11 = all_97_2 | ? [v0: ty] : ? [v1: uni] : ? [v2: uni] : % 200.04/27.69 | | ? [v3: int] : ? [v4: uni] : ? [v5: int] : (uni(v4) & uni(v2) & % 200.04/27.69 | | uni(v1) & ((v5 = all_101_11 & cons(tree, v4, all_97_2) = % 200.04/27.69 | | all_101_11 & sort1(tree, v4)) | (v3 = all_101_11 & cons(tree, % 200.04/27.69 | | v1, v2) = all_101_11 & list(tree) = v0 & ty(v0) & % 200.04/27.69 | | distinct(tree, v2) & sort1(v0, v2) & sort1(tree, v1) & ~ % 200.04/27.69 | | mem(tree, v1, v2)))) % 200.04/27.69 | | % 200.04/27.69 | | DELTA: instantiating (168) with fresh symbols all_178_0, all_178_1, % 200.04/27.69 | | all_178_2 gives: % 200.04/27.69 | | (171) infix_plpl(tree, all_178_2, all_178_0) = all_141_0 & cons(tree, % 200.04/27.69 | | all_101_1, all_178_1) = all_178_0 & uni(all_178_0) & % 200.04/27.69 | | uni(all_178_1) & uni(all_178_2) & sort1(all_90_0, all_178_1) & % 200.04/27.69 | | sort1(all_90_0, all_178_2) % 200.04/27.69 | | % 200.04/27.69 | | ALPHA: (171) implies: % 200.04/27.69 | | (172) uni(all_178_1) % 200.04/27.69 | | (173) uni(all_178_0) % 200.04/27.69 | | (174) cons(tree, all_101_1, all_178_1) = all_178_0 % 200.04/27.69 | | % 200.04/27.69 | | DELTA: instantiating (165) with fresh symbols all_180_0, all_180_1, % 200.04/27.69 | | all_180_2 gives: % 200.04/27.69 | | (175) infix_plpl(tree, all_180_2, all_180_0) = all_97_1 & cons(tree, % 200.04/27.69 | | all_97_3, all_180_1) = all_180_0 & uni(all_180_0) & % 200.04/27.69 | | uni(all_180_1) & uni(all_180_2) & sort1(all_90_0, all_180_1) & % 200.04/27.69 | | sort1(all_90_0, all_180_2) % 200.04/27.69 | | % 200.04/27.69 | | ALPHA: (175) implies: % 200.04/27.69 | | (176) uni(all_180_1) % 200.04/27.69 | | (177) uni(all_180_0) % 200.04/27.69 | | (178) cons(tree, all_97_3, all_180_1) = all_180_0 % 200.04/27.69 | | % 200.04/27.69 | | DELTA: instantiating (167) with fresh symbols all_182_0, all_182_1, % 200.04/27.69 | | all_182_2 gives: % 200.04/27.69 | | (179) infix_plpl(tree, all_182_2, all_182_0) = all_101_7 & cons(tree, % 200.04/27.69 | | all_101_1, all_182_1) = all_182_0 & uni(all_182_0) & % 200.04/27.69 | | uni(all_182_1) & uni(all_182_2) & sort1(all_90_0, all_182_1) & % 200.04/27.69 | | sort1(all_90_0, all_182_2) % 200.04/27.69 | | % 200.04/27.69 | | ALPHA: (179) implies: % 200.04/27.69 | | (180) uni(all_182_1) % 200.04/27.69 | | (181) uni(all_182_0) % 200.04/27.69 | | (182) cons(tree, all_101_1, all_182_1) = all_182_0 % 200.04/27.69 | | % 200.04/27.69 | | GROUND_INST: instantiating (2) with tree, all_97_3, all_97_2, all_180_1, % 200.04/27.69 | | all_180_0, simplifying with (14), (33), (91), (110), (176), % 200.04/27.69 | | (178) gives: % 200.04/27.69 | | (183) mem(tree, all_97_3, all_180_0) % 200.04/27.69 | | % 200.04/27.69 | | GROUND_INST: instantiating (nil_Cons1) with tree, all_97_3, all_180_1, % 200.04/27.69 | | all_180_0, simplifying with (14), (91), (176), (178) gives: % 200.04/27.69 | | (184) ? [v0: any] : ( ~ (v0 = all_180_0) & nil(tree) = v0 & uni(v0)) % 200.04/27.69 | | % 200.04/27.69 | | GROUND_INST: instantiating (cons_sort2) with tree, all_97_3, all_180_1, % 200.04/27.69 | | all_180_0, simplifying with (14), (91), (176), (178) gives: % 200.04/27.70 | | (185) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_180_0)) % 200.04/27.70 | | % 200.04/27.70 | | GROUND_INST: instantiating (2) with tree, all_101_1, all_97_2, all_178_1, % 200.04/27.70 | | all_178_0, simplifying with (14), (33), (56), (112), (172), % 200.04/27.70 | | (174) gives: % 200.04/27.70 | | (186) mem(tree, all_101_1, all_178_0) % 200.04/27.70 | | % 200.04/27.70 | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, all_178_1, % 200.04/27.70 | | all_178_0, simplifying with (14), (56), (172), (174) gives: % 200.04/27.70 | | (187) ? [v0: any] : ( ~ (v0 = all_178_0) & nil(tree) = v0 & uni(v0)) % 200.04/27.70 | | % 200.04/27.70 | | GROUND_INST: instantiating (cons_sort2) with tree, all_101_1, all_178_1, % 200.04/27.70 | | all_178_0, simplifying with (14), (56), (172), (174) gives: % 200.04/27.70 | | (188) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_178_0)) % 200.04/27.70 | | % 200.04/27.70 | | GROUND_INST: instantiating (2) with tree, all_101_1, all_97_2, all_182_1, % 200.04/27.70 | | all_182_0, simplifying with (14), (33), (56), (112), (180), % 200.04/27.70 | | (182) gives: % 200.04/27.70 | | (189) mem(tree, all_101_1, all_182_0) % 200.04/27.70 | | % 200.04/27.70 | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, all_182_1, % 200.04/27.70 | | all_182_0, simplifying with (14), (56), (180), (182) gives: % 200.04/27.70 | | (190) ? [v0: any] : ( ~ (v0 = all_182_0) & nil(tree) = v0 & uni(v0)) % 200.04/27.70 | | % 200.04/27.70 | | GROUND_INST: instantiating (cons_sort2) with tree, all_101_1, all_182_1, % 200.04/27.70 | | all_182_0, simplifying with (14), (56), (180), (182) gives: % 200.04/27.70 | | (191) ? [v0: ty] : (list(tree) = v0 & ty(v0) & sort1(v0, all_182_0)) % 200.04/27.70 | | % 200.04/27.70 | | DELTA: instantiating (190) with fresh symbol all_192_0 gives: % 200.04/27.70 | | (192) ~ (all_192_0 = all_182_0) & nil(tree) = all_192_0 & uni(all_192_0) % 200.04/27.70 | | % 200.04/27.70 | | ALPHA: (192) implies: % 200.04/27.70 | | (193) nil(tree) = all_192_0 % 200.04/27.70 | | % 200.04/27.70 | | DELTA: instantiating (191) with fresh symbol all_194_0 gives: % 200.04/27.70 | | (194) list(tree) = all_194_0 & ty(all_194_0) & sort1(all_194_0, % 200.04/27.70 | | all_182_0) % 200.04/27.70 | | % 200.04/27.70 | | ALPHA: (194) implies: % 200.04/27.70 | | (195) list(tree) = all_194_0 % 200.04/27.70 | | % 200.04/27.70 | | DELTA: instantiating (188) with fresh symbol all_196_0 gives: % 200.04/27.70 | | (196) list(tree) = all_196_0 & ty(all_196_0) & sort1(all_196_0, % 200.04/27.70 | | all_178_0) % 200.04/27.70 | | % 200.04/27.70 | | ALPHA: (196) implies: % 200.04/27.70 | | (197) list(tree) = all_196_0 % 200.04/27.70 | | % 200.04/27.70 | | DELTA: instantiating (187) with fresh symbol all_198_0 gives: % 200.04/27.70 | | (198) ~ (all_198_0 = all_178_0) & nil(tree) = all_198_0 & uni(all_198_0) % 200.04/27.70 | | % 200.04/27.70 | | ALPHA: (198) implies: % 200.04/27.70 | | (199) nil(tree) = all_198_0 % 200.04/27.70 | | % 200.04/27.70 | | DELTA: instantiating (185) with fresh symbol all_200_0 gives: % 200.04/27.70 | | (200) list(tree) = all_200_0 & ty(all_200_0) & sort1(all_200_0, % 200.04/27.70 | | all_180_0) % 200.04/27.70 | | % 200.04/27.70 | | ALPHA: (200) implies: % 200.04/27.70 | | (201) list(tree) = all_200_0 % 200.04/27.70 | | % 200.04/27.70 | | DELTA: instantiating (184) with fresh symbol all_202_0 gives: % 200.04/27.70 | | (202) ~ (all_202_0 = all_180_0) & nil(tree) = all_202_0 & uni(all_202_0) % 200.04/27.70 | | % 200.04/27.70 | | ALPHA: (202) implies: % 200.04/27.71 | | (203) nil(tree) = all_202_0 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (17) with all_90_0, all_200_0, tree, simplifying % 200.04/27.71 | | with (27), (201) gives: % 200.04/27.71 | | (204) all_200_0 = all_90_0 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (17) with all_196_0, all_200_0, tree, simplifying % 200.04/27.71 | | with (197), (201) gives: % 200.04/27.71 | | (205) all_200_0 = all_196_0 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (17) with all_194_0, all_200_0, tree, simplifying % 200.04/27.71 | | with (195), (201) gives: % 200.04/27.71 | | (206) all_200_0 = all_194_0 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (18) with all_97_2, all_198_0, tree, simplifying % 200.04/27.71 | | with (33), (199) gives: % 200.04/27.71 | | (207) all_198_0 = all_97_2 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (18) with all_198_0, all_202_0, tree, simplifying % 200.04/27.71 | | with (199), (203) gives: % 200.04/27.71 | | (208) all_202_0 = all_198_0 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (18) with all_192_0, all_202_0, tree, simplifying % 200.04/27.71 | | with (193), (203) gives: % 200.04/27.71 | | (209) all_202_0 = all_192_0 % 200.04/27.71 | | % 200.04/27.71 | | COMBINE_EQS: (208), (209) imply: % 200.04/27.71 | | (210) all_198_0 = all_192_0 % 200.04/27.71 | | % 200.04/27.71 | | SIMP: (210) implies: % 200.04/27.71 | | (211) all_198_0 = all_192_0 % 200.04/27.71 | | % 200.04/27.71 | | COMBINE_EQS: (204), (205) imply: % 200.04/27.71 | | (212) all_196_0 = all_90_0 % 200.04/27.71 | | % 200.04/27.71 | | COMBINE_EQS: (205), (206) imply: % 200.04/27.71 | | (213) all_196_0 = all_194_0 % 200.04/27.71 | | % 200.04/27.71 | | COMBINE_EQS: (207), (211) imply: % 200.04/27.71 | | (214) all_192_0 = all_97_2 % 200.04/27.71 | | % 200.04/27.71 | | COMBINE_EQS: (212), (213) imply: % 200.04/27.71 | | (215) all_194_0 = all_90_0 % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (mem_decomp) with tree, all_97_3, all_180_0, % 200.04/27.71 | | all_90_0, simplifying with (14), (27), (91), (177), (183) % 200.04/27.71 | | gives: % 200.04/27.71 | | (216) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, % 200.04/27.71 | | v2) = all_180_0 & cons(tree, all_97_3, v1) = v2 & uni(v2) & % 200.04/27.71 | | uni(v1) & uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (mem_decomp) with tree, all_101_1, all_178_0, % 200.04/27.71 | | all_90_0, simplifying with (14), (27), (56), (173), (186) % 200.04/27.71 | | gives: % 200.04/27.71 | | (217) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, % 200.04/27.71 | | v2) = all_178_0 & cons(tree, all_101_1, v1) = v2 & uni(v2) & % 200.04/27.71 | | uni(v1) & uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.71 | | % 200.04/27.71 | | GROUND_INST: instantiating (mem_decomp) with tree, all_101_1, all_182_0, % 200.04/27.71 | | all_90_0, simplifying with (14), (27), (56), (181), (189) % 200.04/27.71 | | gives: % 200.04/27.71 | | (218) ? [v0: uni] : ? [v1: uni] : ? [v2: uni] : (infix_plpl(tree, v0, % 200.04/27.71 | | v2) = all_182_0 & cons(tree, all_101_1, v1) = v2 & uni(v2) & % 200.04/27.71 | | uni(v1) & uni(v0) & sort1(all_90_0, v1) & sort1(all_90_0, v0)) % 200.04/27.71 | | % 200.04/27.71 | | DELTA: instantiating (218) with fresh symbols all_223_0, all_223_1, % 200.04/27.71 | | all_223_2 gives: % 200.04/27.71 | | (219) infix_plpl(tree, all_223_2, all_223_0) = all_182_0 & cons(tree, % 200.04/27.71 | | all_101_1, all_223_1) = all_223_0 & uni(all_223_0) & % 200.04/27.71 | | uni(all_223_1) & uni(all_223_2) & sort1(all_90_0, all_223_1) & % 200.04/27.71 | | sort1(all_90_0, all_223_2) % 200.04/27.71 | | % 200.04/27.71 | | ALPHA: (219) implies: % 200.04/27.71 | | (220) uni(all_223_1) % 200.04/27.71 | | (221) cons(tree, all_101_1, all_223_1) = all_223_0 % 200.04/27.71 | | % 200.04/27.71 | | DELTA: instantiating (217) with fresh symbols all_225_0, all_225_1, % 200.04/27.71 | | all_225_2 gives: % 200.04/27.72 | | (222) infix_plpl(tree, all_225_2, all_225_0) = all_178_0 & cons(tree, % 200.04/27.72 | | all_101_1, all_225_1) = all_225_0 & uni(all_225_0) & % 200.04/27.72 | | uni(all_225_1) & uni(all_225_2) & sort1(all_90_0, all_225_1) & % 200.04/27.72 | | sort1(all_90_0, all_225_2) % 200.04/27.72 | | % 200.04/27.72 | | ALPHA: (222) implies: % 200.04/27.72 | | (223) uni(all_225_1) % 200.04/27.72 | | (224) cons(tree, all_101_1, all_225_1) = all_225_0 % 200.04/27.72 | | % 200.04/27.72 | | DELTA: instantiating (216) with fresh symbols all_227_0, all_227_1, % 200.04/27.72 | | all_227_2 gives: % 200.04/27.72 | | (225) infix_plpl(tree, all_227_2, all_227_0) = all_180_0 & cons(tree, % 200.04/27.72 | | all_97_3, all_227_1) = all_227_0 & uni(all_227_0) & % 200.04/27.72 | | uni(all_227_1) & uni(all_227_2) & sort1(all_90_0, all_227_1) & % 200.04/27.72 | | sort1(all_90_0, all_227_2) % 200.04/27.72 | | % 200.04/27.72 | | ALPHA: (225) implies: % 200.04/27.72 | | (226) uni(all_227_1) % 200.04/27.72 | | (227) cons(tree, all_97_3, all_227_1) = all_227_0 % 200.04/27.72 | | % 200.04/27.72 | | BETA: splitting (84) gives: % 200.04/27.72 | | % 200.04/27.72 | | Case 1: % 200.04/27.72 | | | % 200.04/27.72 | | | (228) ~ (t2tb(0) = all_101_12) % 200.04/27.72 | | | % 200.04/27.72 | | | PRED_UNIFY: (68), (228) imply: % 200.04/27.72 | | | (229) ~ ($difference(all_101_18, all_101_24) = -1) % 200.04/27.72 | | | % 200.04/27.72 | | | STRENGTHEN: (39), (229) imply: % 200.04/27.72 | | | (230) $lesseq(2, $difference(all_101_24, all_101_18)) % 200.04/27.72 | | | % 200.04/27.72 | | | BETA: splitting (83) gives: % 200.04/27.72 | | | % 200.04/27.72 | | | Case 1: % 200.04/27.72 | | | | % 200.04/27.72 | | | | (231) ~ (t2tb(0) = all_101_15) % 200.04/27.72 | | | | % 200.04/27.72 | | | | PRED_UNIFY: (67), (231) imply: % 200.04/27.72 | | | | (232) ~ (all_101_18 = 0) % 200.04/27.72 | | | | % 200.04/27.72 | | | | STRENGTHEN: (38), (232) imply: % 200.04/27.72 | | | | (233) $lesseq(1, all_101_18) % 200.04/27.72 | | | | % 200.04/27.72 | | | | BETA: splitting (111) gives: % 200.04/27.72 | | | | % 200.04/27.72 | | | | Case 1: % 200.04/27.72 | | | | | % 200.04/27.72 | | | | | (234) mem(tree, all_101_1, all_101_16) % 200.04/27.72 | | | | | % 200.04/27.72 | | | | | BETA: splitting (96) gives: % 200.04/27.72 | | | | | % 200.04/27.72 | | | | | Case 1: % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | (235) all_101_16 = all_97_2 % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | REDUCE: (234), (235) imply: % 200.04/27.72 | | | | | | (236) mem(tree, all_101_1, all_97_2) % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | GROUND_INST: instantiating (1) with tree, all_101_1, all_97_2, % 200.04/27.72 | | | | | | simplifying with (14), (33), (56), (112), (236) gives: % 200.04/27.72 | | | | | | (237) $false % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | CLOSE: (237) is inconsistent. % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | Case 2: % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | GROUND_INST: instantiating (77) with all_101_2, all_101_1, % 200.04/27.72 | | | | | | simplifying with (57), (73), (234) gives: % 200.04/27.72 | | | | | | (238) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 200.04/27.72 | | | | | | ($lesseq(1, $difference(all_101_18, v2)) & size1(v0) = v2 & % 200.04/27.72 | | | | | | size1(all_101_2) = all_101_24 & node1(v0, v1) = all_101_2 % 200.04/27.72 | | | | | | & tree1(v1) & tree1(v0)) % 200.04/27.72 | | | | | | % 200.04/27.72 | | | | | | DELTA: instantiating (238) with fresh symbols all_339_0, all_339_1, % 200.04/27.72 | | | | | | all_339_2 gives: % 200.04/27.73 | | | | | | (239) $lesseq(1, $difference(all_101_18, all_339_0)) & % 200.04/27.73 | | | | | | size1(all_339_2) = all_339_0 & size1(all_101_2) = % 200.04/27.73 | | | | | | all_101_24 & node1(all_339_2, all_339_1) = all_101_2 & % 200.04/27.73 | | | | | | tree1(all_339_1) & tree1(all_339_2) % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | ALPHA: (239) implies: % 200.04/27.73 | | | | | | (240) $lesseq(1, $difference(all_101_18, all_339_0)) % 200.04/27.73 | | | | | | (241) tree1(all_339_2) % 200.04/27.73 | | | | | | (242) tree1(all_339_1) % 200.04/27.73 | | | | | | (243) node1(all_339_2, all_339_1) = all_101_2 % 200.04/27.73 | | | | | | (244) size1(all_101_2) = all_101_24 % 200.04/27.73 | | | | | | (245) size1(all_339_2) = all_339_0 % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_101_24, % 200.04/27.73 | | | | | | all_101_2, simplifying with (69), (244) gives: % 200.04/27.73 | | | | | | (246) all_101_0 = all_101_24 % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | GROUND_INST: instantiating (79) with all_339_2, all_339_1, % 200.04/27.73 | | | | | | simplifying with (241), (242), (243) gives: % 200.04/27.73 | | | | | | (247) ~ (all_101_0 = all_101_24) | ? [v0: int] : ($lesseq(1, % 200.04/27.73 | | | | | | $difference(v0, all_101_18)) & size1(all_339_2) = v0) % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | GROUND_INST: instantiating (5) with all_339_2, all_339_1, all_101_2, % 200.04/27.73 | | | | | | simplifying with (241), (242), (243) gives: % 200.04/27.73 | | | | | | (248) ? [v0: int] : ? [v1: int] : (size1(all_339_1) = % 200.04/27.73 | | | | | | $sum($difference(v0, v1), -1) & size1(all_339_2) = v1 & % 200.04/27.73 | | | | | | size1(all_101_2) = v0) % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | DELTA: instantiating (248) with fresh symbols all_432_0, all_432_1 % 200.04/27.73 | | | | | | gives: % 200.04/27.73 | | | | | | (249) size1(all_339_1) = $sum($difference(all_432_1, all_432_0), % 200.04/27.73 | | | | | | -1) & size1(all_339_2) = all_432_0 & size1(all_101_2) = % 200.04/27.73 | | | | | | all_432_1 % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | ALPHA: (249) implies: % 200.04/27.73 | | | | | | (250) size1(all_339_2) = all_432_0 % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | BETA: splitting (247) gives: % 200.04/27.73 | | | | | | % 200.04/27.73 | | | | | | Case 1: % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | (251) ~ (all_101_0 = all_101_24) % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | REDUCE: (246), (251) imply: % 200.04/27.73 | | | | | | | (252) $false % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | CLOSE: (252) is inconsistent. % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | Case 2: % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | (253) ? [v0: int] : ($lesseq(1, $difference(v0, all_101_18)) & % 200.04/27.73 | | | | | | | size1(all_339_2) = v0) % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | DELTA: instantiating (253) with fresh symbol all_451_0 gives: % 200.04/27.73 | | | | | | | (254) $lesseq(1, $difference(all_451_0, all_101_18)) & % 200.04/27.73 | | | | | | | size1(all_339_2) = all_451_0 % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | ALPHA: (254) implies: % 200.04/27.73 | | | | | | | (255) $lesseq(1, $difference(all_451_0, all_101_18)) % 200.04/27.73 | | | | | | | (256) size1(all_339_2) = all_451_0 % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | GROUND_INST: instantiating (22) with all_339_0, all_451_0, % 200.04/27.73 | | | | | | | all_339_2, simplifying with (245), (256) gives: % 200.04/27.73 | | | | | | | (257) all_451_0 = all_339_0 % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | GROUND_INST: instantiating (22) with all_432_0, all_451_0, % 200.04/27.73 | | | | | | | all_339_2, simplifying with (250), (256) gives: % 200.04/27.73 | | | | | | | (258) all_451_0 = all_432_0 % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | COMBINE_EQS: (257), (258) imply: % 200.04/27.73 | | | | | | | (259) all_432_0 = all_339_0 % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | REDUCE: (255), (257) imply: % 200.04/27.73 | | | | | | | (260) $lesseq(1, $difference(all_339_0, all_101_18)) % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | COMBINE_INEQS: (240), (260) imply: % 200.04/27.73 | | | | | | | (261) $false % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | | CLOSE: (261) is inconsistent. % 200.04/27.73 | | | | | | | % 200.04/27.73 | | | | | | End of split % 200.04/27.73 | | | | | | % 200.04/27.74 | | | | | End of split % 200.04/27.74 | | | | | % 200.04/27.74 | | | | Case 2: % 200.04/27.74 | | | | | % 200.04/27.74 | | | | | (262) ~ mem(tree, all_101_1, all_101_16) % 200.04/27.74 | | | | | (263) ? [v0: int] : (size1(all_101_2) = v0 & ! [v1: tree1] : ! % 200.04/27.74 | | | | | [v2: tree1] : ( ~ (v0 = all_101_24) | ~ (node1(v1, v2) = % 200.04/27.74 | | | | | all_101_2) | ~ tree1(v2) | ~ tree1(v1) | ? [v3: int] % 200.04/27.74 | | | | | : ($lesseq(all_101_18, v3) & size1(v1) = v3))) % 200.04/27.74 | | | | | % 200.04/27.74 | | | | | DELTA: instantiating (263) with fresh symbol all_303_0 gives: % 200.04/27.74 | | | | | (264) size1(all_101_2) = all_303_0 & ! [v0: tree1] : ! [v1: % 200.04/27.74 | | | | | tree1] : ( ~ (all_303_0 = all_101_24) | ~ (node1(v0, v1) = % 200.04/27.74 | | | | | all_101_2) | ~ tree1(v1) | ~ tree1(v0) | ? [v2: int] : % 200.04/27.74 | | | | | ($lesseq(all_101_18, v2) & size1(v0) = v2)) % 200.04/27.74 | | | | | % 200.04/27.74 | | | | | ALPHA: (264) implies: % 200.04/27.74 | | | | | (265) size1(all_101_2) = all_303_0 % 200.04/27.74 | | | | | % 200.04/27.74 | | | | | BETA: splitting (166) gives: % 200.04/27.74 | | | | | % 200.04/27.74 | | | | | Case 1: % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | (266) mem(tree, all_101_1, all_101_8) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_303_0, % 200.04/27.74 | | | | | | all_101_2, simplifying with (69), (265) gives: % 200.04/27.74 | | | | | | (267) all_303_0 = all_101_0 % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | GROUND_INST: instantiating (78) with all_101_2, all_101_1, % 200.04/27.74 | | | | | | simplifying with (57), (73), (266) gives: % 200.04/27.74 | | | | | | (268) ? [v0: tree1] : ? [v1: tree1] : (size1(v1) = % 200.04/27.74 | | | | | | $sum($difference(all_101_24, all_101_18), -1) & size1(v0) % 200.04/27.74 | | | | | | = all_101_18 & node1(v0, v1) = all_101_2 & tree1(v1) & % 200.04/27.74 | | | | | | tree1(v0)) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_97_3, % 200.04/27.74 | | | | | | all_227_1, all_227_0, simplifying with (14), (91), % 200.04/27.74 | | | | | | (226), (227) gives: % 200.04/27.74 | | | | | | (269) ? [v0: any] : ( ~ (v0 = all_227_0) & nil(tree) = v0 & % 200.04/27.74 | | | | | | uni(v0)) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, % 200.04/27.74 | | | | | | all_223_1, all_223_0, simplifying with (14), (56), % 200.04/27.74 | | | | | | (220), (221) gives: % 200.04/27.74 | | | | | | (270) ? [v0: any] : ( ~ (v0 = all_223_0) & nil(tree) = v0 & % 200.04/27.74 | | | | | | uni(v0)) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, % 200.04/27.74 | | | | | | all_225_1, all_225_0, simplifying with (14), (56), % 200.04/27.74 | | | | | | (223), (224) gives: % 200.04/27.74 | | | | | | (271) ? [v0: any] : ( ~ (v0 = all_225_0) & nil(tree) = v0 & % 200.04/27.74 | | | | | | uni(v0)) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | DELTA: instantiating (270) with fresh symbol all_344_0 gives: % 200.04/27.74 | | | | | | (272) ~ (all_344_0 = all_223_0) & nil(tree) = all_344_0 & % 200.04/27.74 | | | | | | uni(all_344_0) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | ALPHA: (272) implies: % 200.04/27.74 | | | | | | (273) nil(tree) = all_344_0 % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | DELTA: instantiating (269) with fresh symbol all_350_0 gives: % 200.04/27.74 | | | | | | (274) ~ (all_350_0 = all_227_0) & nil(tree) = all_350_0 & % 200.04/27.74 | | | | | | uni(all_350_0) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | ALPHA: (274) implies: % 200.04/27.74 | | | | | | (275) nil(tree) = all_350_0 % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | DELTA: instantiating (271) with fresh symbol all_352_0 gives: % 200.04/27.74 | | | | | | (276) ~ (all_352_0 = all_225_0) & nil(tree) = all_352_0 & % 200.04/27.74 | | | | | | uni(all_352_0) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | ALPHA: (276) implies: % 200.04/27.74 | | | | | | (277) nil(tree) = all_352_0 % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | DELTA: instantiating (268) with fresh symbols all_354_0, all_354_1 % 200.04/27.74 | | | | | | gives: % 200.04/27.74 | | | | | | (278) size1(all_354_0) = $sum($difference(all_101_24, % 200.04/27.74 | | | | | | all_101_18), -1) & size1(all_354_1) = all_101_18 & % 200.04/27.74 | | | | | | node1(all_354_1, all_354_0) = all_101_2 & tree1(all_354_0) % 200.04/27.74 | | | | | | & tree1(all_354_1) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | ALPHA: (278) implies: % 200.04/27.74 | | | | | | (279) tree1(all_354_1) % 200.04/27.74 | | | | | | (280) tree1(all_354_0) % 200.04/27.74 | | | | | | (281) node1(all_354_1, all_354_0) = all_101_2 % 200.04/27.74 | | | | | | (282) size1(all_354_1) = all_101_18 % 200.04/27.74 | | | | | | (283) size1(all_354_0) = $sum($difference(all_101_24, % 200.04/27.74 | | | | | | all_101_18), -1) % 200.04/27.74 | | | | | | % 200.04/27.74 | | | | | | GROUND_INST: instantiating (18) with all_97_2, all_350_0, tree, % 200.04/27.74 | | | | | | simplifying with (33), (275) gives: % 200.04/27.74 | | | | | | (284) all_350_0 = all_97_2 % 200.04/27.74 | | | | | | % 200.04/27.75 | | | | | | GROUND_INST: instantiating (18) with all_350_0, all_352_0, tree, % 200.04/27.75 | | | | | | simplifying with (275), (277) gives: % 200.04/27.75 | | | | | | (285) all_352_0 = all_350_0 % 200.04/27.75 | | | | | | % 200.04/27.75 | | | | | | GROUND_INST: instantiating (18) with all_344_0, all_352_0, tree, % 200.04/27.75 | | | | | | simplifying with (273), (277) gives: % 200.04/27.75 | | | | | | (286) all_352_0 = all_344_0 % 200.04/27.75 | | | | | | % 200.04/27.75 | | | | | | COMBINE_EQS: (285), (286) imply: % 200.04/27.75 | | | | | | (287) all_350_0 = all_344_0 % 200.04/27.75 | | | | | | % 200.04/27.75 | | | | | | SIMP: (287) implies: % 200.04/27.75 | | | | | | (288) all_350_0 = all_344_0 % 200.04/27.75 | | | | | | % 200.04/27.75 | | | | | | COMBINE_EQS: (284), (288) imply: % 200.04/27.75 | | | | | | (289) all_344_0 = all_97_2 % 200.04/27.75 | | | | | | % 200.04/27.75 | | | | | | BETA: splitting (106) gives: % 200.04/27.75 | | | | | | % 200.04/27.75 | | | | | | Case 1: % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | (290) $lesseq(all_101_0, 0) % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | ANTI_SYMM: (105), (290) imply: % 200.04/27.75 | | | | | | | (291) all_101_0 = 0 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | REDUCE: (69), (291) imply: % 200.04/27.75 | | | | | | | (292) size1(all_101_2) = 0 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | GROUND_INST: instantiating (5) with all_354_1, all_354_0, % 200.04/27.75 | | | | | | | all_101_2, simplifying with (279), (280), (281) % 200.04/27.75 | | | | | | | gives: % 200.04/27.75 | | | | | | | (293) ? [v0: int] : ? [v1: int] : (size1(all_354_0) = % 200.04/27.75 | | | | | | | $sum($difference(v0, v1), -1) & size1(all_354_1) = v1 & % 200.04/27.75 | | | | | | | size1(all_101_2) = v0) % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | DELTA: instantiating (293) with fresh symbols all_429_0, all_429_1 % 200.04/27.75 | | | | | | | gives: % 200.04/27.75 | | | | | | | (294) size1(all_354_0) = $sum($difference(all_429_1, % 200.04/27.75 | | | | | | | all_429_0), -1) & size1(all_354_1) = all_429_0 & % 200.04/27.75 | | | | | | | size1(all_101_2) = all_429_1 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | ALPHA: (294) implies: % 200.04/27.75 | | | | | | | (295) size1(all_101_2) = all_429_1 % 200.04/27.75 | | | | | | | (296) size1(all_354_1) = all_429_0 % 200.04/27.75 | | | | | | | (297) size1(all_354_0) = $sum($difference(all_429_1, % 200.04/27.75 | | | | | | | all_429_0), -1) % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | GROUND_INST: instantiating (22) with 0, all_429_1, all_101_2, % 200.04/27.75 | | | | | | | simplifying with (292), (295) gives: % 200.04/27.75 | | | | | | | (298) all_429_1 = 0 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | GROUND_INST: instantiating (22) with all_101_18, all_429_0, % 200.04/27.75 | | | | | | | all_354_1, simplifying with (282), (296) gives: % 200.04/27.75 | | | | | | | (299) all_429_0 = all_101_18 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | GROUND_INST: instantiating (22) with $sum($difference(all_101_24, % 200.04/27.75 | | | | | | | all_101_18), -1), $sum($difference(all_429_1, % 200.04/27.75 | | | | | | | all_429_0), -1), all_354_0, simplifying with % 200.04/27.75 | | | | | | | (283), (297) gives: % 200.04/27.75 | | | | | | | (300) $sum($difference($difference(all_429_0, all_429_1), % 200.04/27.75 | | | | | | | all_101_18), all_101_24) = 0 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | COMBINE_EQS: (299), (300) imply: % 200.04/27.75 | | | | | | | (301) all_429_1 = all_101_24 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | COMBINE_EQS: (298), (301) imply: % 200.04/27.75 | | | | | | | (302) all_101_24 = 0 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | SIMP: (302) implies: % 200.04/27.75 | | | | | | | (303) all_101_24 = 0 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | REDUCE: (230), (303) imply: % 200.04/27.75 | | | | | | | (304) $lesseq(all_101_18, -2) % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | COMBINE_INEQS: (233), (304) imply: % 200.04/27.75 | | | | | | | (305) $false % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | CLOSE: (305) is inconsistent. % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | Case 2: % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | (306) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 200.04/27.75 | | | | | | | ($lesseq(1, $difference(all_101_0, v2)) & size1(v0) = v2 % 200.04/27.75 | | | | | | | & node1(v0, v1) = all_101_2 & tree1(v1) & tree1(v0)) % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | DELTA: instantiating (306) with fresh symbols all_370_0, % 200.04/27.75 | | | | | | | all_370_1, all_370_2 gives: % 200.04/27.75 | | | | | | | (307) $lesseq(1, $difference(all_101_0, all_370_0)) & % 200.04/27.75 | | | | | | | size1(all_370_2) = all_370_0 & node1(all_370_2, % 200.04/27.75 | | | | | | | all_370_1) = all_101_2 & tree1(all_370_1) & % 200.04/27.75 | | | | | | | tree1(all_370_2) % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | ALPHA: (307) implies: % 200.04/27.75 | | | | | | | (308) tree1(all_370_2) % 200.04/27.75 | | | | | | | (309) tree1(all_370_1) % 200.04/27.75 | | | | | | | (310) node1(all_370_2, all_370_1) = all_101_2 % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | BETA: splitting (150) gives: % 200.04/27.75 | | | | | | | % 200.04/27.75 | | | | | | | Case 1: % 200.04/27.75 | | | | | | | | % 200.04/27.75 | | | | | | | | (311) mem(tree, all_101_1, all_101_14) % 200.04/27.75 | | | | | | | | % 200.04/27.75 | | | | | | | | BETA: splitting (169) gives: % 200.04/27.75 | | | | | | | | % 200.04/27.75 | | | | | | | | Case 1: % 200.04/27.75 | | | | | | | | | % 200.04/27.75 | | | | | | | | | (312) all_101_14 = all_97_2 % 200.04/27.75 | | | | | | | | | % 200.04/27.75 | | | | | | | | | REDUCE: (311), (312) imply: % 200.04/27.75 | | | | | | | | | (313) mem(tree, all_101_1, all_97_2) % 200.04/27.75 | | | | | | | | | % 200.04/27.75 | | | | | | | | | GROUND_INST: instantiating (1) with tree, all_101_1, all_97_2, % 200.04/27.75 | | | | | | | | | simplifying with (14), (33), (56), (112), (313) % 200.04/27.75 | | | | | | | | | gives: % 200.04/27.75 | | | | | | | | | (314) $false % 200.04/27.75 | | | | | | | | | % 200.04/27.75 | | | | | | | | | CLOSE: (314) is inconsistent. % 200.04/27.75 | | | | | | | | | % 200.04/27.75 | | | | | | | | Case 2: % 200.04/27.75 | | | | | | | | | % 200.04/27.75 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (10) with all_101_18, all_101_13, % 200.04/27.76 | | | | | | | | | all_101_14, all_101_2, all_101_1, simplifying with % 200.04/27.76 | | | | | | | | | (42), (57), (58), (73), (108), (311) gives: % 200.04/27.76 | | | | | | | | | (315) size1(all_101_2) = all_101_18 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (5) with all_354_1, all_354_0, % 200.04/27.76 | | | | | | | | | all_101_2, simplifying with (279), (280), (281) % 200.04/27.76 | | | | | | | | | gives: % 200.04/27.76 | | | | | | | | | (316) ? [v0: int] : ? [v1: int] : (size1(all_354_0) = % 200.04/27.76 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_354_1) = % 200.04/27.76 | | | | | | | | | v1 & size1(all_101_2) = v0) % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (5) with all_370_2, all_370_1, % 200.04/27.76 | | | | | | | | | all_101_2, simplifying with (308), (309), (310) % 200.04/27.76 | | | | | | | | | gives: % 200.04/27.76 | | | | | | | | | (317) ? [v0: int] : ? [v1: int] : (size1(all_370_1) = % 200.04/27.76 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_370_2) = % 200.04/27.76 | | | | | | | | | v1 & size1(all_101_2) = v0) % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | DELTA: instantiating (316) with fresh symbols all_458_0, % 200.04/27.76 | | | | | | | | | all_458_1 gives: % 200.04/27.76 | | | | | | | | | (318) size1(all_354_0) = $sum($difference(all_458_1, % 200.04/27.76 | | | | | | | | | all_458_0), -1) & size1(all_354_1) = all_458_0 & % 200.04/27.76 | | | | | | | | | size1(all_101_2) = all_458_1 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | ALPHA: (318) implies: % 200.04/27.76 | | | | | | | | | (319) size1(all_101_2) = all_458_1 % 200.04/27.76 | | | | | | | | | (320) size1(all_354_1) = all_458_0 % 200.04/27.76 | | | | | | | | | (321) size1(all_354_0) = $sum($difference(all_458_1, % 200.04/27.76 | | | | | | | | | all_458_0), -1) % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | DELTA: instantiating (317) with fresh symbols all_460_0, % 200.04/27.76 | | | | | | | | | all_460_1 gives: % 200.04/27.76 | | | | | | | | | (322) size1(all_370_1) = $sum($difference(all_460_1, % 200.04/27.76 | | | | | | | | | all_460_0), -1) & size1(all_370_2) = all_460_0 & % 200.04/27.76 | | | | | | | | | size1(all_101_2) = all_460_1 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | ALPHA: (322) implies: % 200.04/27.76 | | | | | | | | | (323) size1(all_101_2) = all_460_1 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_460_1, % 200.04/27.76 | | | | | | | | | all_101_2, simplifying with (69), (323) gives: % 200.04/27.76 | | | | | | | | | (324) all_460_1 = all_101_0 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (22) with all_458_1, all_460_1, % 200.04/27.76 | | | | | | | | | all_101_2, simplifying with (319), (323) gives: % 200.04/27.76 | | | | | | | | | (325) all_460_1 = all_458_1 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_18, all_460_1, % 200.04/27.76 | | | | | | | | | all_101_2, simplifying with (315), (323) gives: % 200.04/27.76 | | | | | | | | | (326) all_460_1 = all_101_18 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_18, all_458_0, % 200.04/27.76 | | | | | | | | | all_354_1, simplifying with (282), (320) gives: % 200.04/27.76 | | | | | | | | | (327) all_458_0 = all_101_18 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | GROUND_INST: instantiating (22) with % 200.04/27.76 | | | | | | | | | $sum($difference(all_101_24, all_101_18), -1), % 200.04/27.76 | | | | | | | | | $sum($difference(all_458_1, all_458_0), -1), % 200.04/27.76 | | | | | | | | | all_354_0, simplifying with (283), (321) gives: % 200.04/27.76 | | | | | | | | | (328) $sum($difference($difference(all_458_0, all_458_1), % 200.04/27.76 | | | | | | | | | all_101_18), all_101_24) = 0 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | COMBINE_EQS: (325), (326) imply: % 200.04/27.76 | | | | | | | | | (329) all_458_1 = all_101_18 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | COMBINE_EQS: (324), (325) imply: % 200.04/27.76 | | | | | | | | | (330) all_458_1 = all_101_0 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | COMBINE_EQS: (327), (328) imply: % 200.04/27.76 | | | | | | | | | (331) all_458_1 = all_101_24 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | COMBINE_EQS: (329), (330) imply: % 200.04/27.76 | | | | | | | | | (332) all_101_0 = all_101_18 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | COMBINE_EQS: (330), (331) imply: % 200.04/27.76 | | | | | | | | | (333) all_101_0 = all_101_24 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | COMBINE_EQS: (332), (333) imply: % 200.04/27.76 | | | | | | | | | (334) all_101_18 = all_101_24 % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | REDUCE: (230), (334) imply: % 200.04/27.76 | | | | | | | | | (335) $false % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | | CLOSE: (335) is inconsistent. % 200.04/27.76 | | | | | | | | | % 200.04/27.76 | | | | | | | | End of split % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | Case 2: % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | (336) ? [v0: int] : ( ~ (v0 = all_101_18) & size1(all_101_2) % 200.04/27.76 | | | | | | | | = v0) % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | DELTA: instantiating (336) with fresh symbol all_403_0 gives: % 200.04/27.76 | | | | | | | | (337) ~ (all_403_0 = all_101_18) & size1(all_101_2) = % 200.04/27.76 | | | | | | | | all_403_0 % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | ALPHA: (337) implies: % 200.04/27.76 | | | | | | | | (338) size1(all_101_2) = all_403_0 % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_403_0, % 200.04/27.76 | | | | | | | | all_101_2, simplifying with (69), (338) gives: % 200.04/27.76 | | | | | | | | (339) all_403_0 = all_101_0 % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | GROUND_INST: instantiating (79) with all_354_1, all_354_0, % 200.04/27.76 | | | | | | | | simplifying with (279), (280), (281) gives: % 200.04/27.76 | | | | | | | | (340) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 200.04/27.76 | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 200.04/27.76 | | | | | | | | size1(all_354_1) = v0) % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_354_1, % 200.04/27.76 | | | | | | | | all_354_0, all_101_2, simplifying with (279), % 200.04/27.76 | | | | | | | | (280), (281) gives: % 200.04/27.76 | | | | | | | | (341) node_proj_11(all_101_2) = all_354_1 % 200.04/27.76 | | | | | | | | % 200.04/27.76 | | | | | | | | GROUND_INST: instantiating (5) with all_354_1, all_354_0, % 200.04/27.76 | | | | | | | | all_101_2, simplifying with (279), (280), (281) % 200.04/27.76 | | | | | | | | gives: % 200.04/27.77 | | | | | | | | (342) ? [v0: int] : ? [v1: int] : (size1(all_354_0) = % 200.04/27.77 | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_354_1) = v1 % 200.04/27.77 | | | | | | | | & size1(all_101_2) = v0) % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (79) with all_370_2, all_370_1, % 200.04/27.77 | | | | | | | | simplifying with (308), (309), (310) gives: % 200.04/27.77 | | | | | | | | (343) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 200.04/27.77 | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 200.04/27.77 | | | | | | | | size1(all_370_2) = v0) % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_370_2, % 200.04/27.77 | | | | | | | | all_370_1, all_101_2, simplifying with (308), % 200.04/27.77 | | | | | | | | (309), (310) gives: % 200.04/27.77 | | | | | | | | (344) node_proj_11(all_101_2) = all_370_2 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (5) with all_370_2, all_370_1, % 200.04/27.77 | | | | | | | | all_101_2, simplifying with (308), (309), (310) % 200.04/27.77 | | | | | | | | gives: % 200.04/27.77 | | | | | | | | (345) ? [v0: int] : ? [v1: int] : (size1(all_370_1) = % 200.04/27.77 | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_370_2) = v1 % 200.04/27.77 | | | | | | | | & size1(all_101_2) = v0) % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | DELTA: instantiating (342) with fresh symbols all_468_0, % 200.04/27.77 | | | | | | | | all_468_1 gives: % 200.04/27.77 | | | | | | | | (346) size1(all_354_0) = $sum($difference(all_468_1, % 200.04/27.77 | | | | | | | | all_468_0), -1) & size1(all_354_1) = all_468_0 & % 200.04/27.77 | | | | | | | | size1(all_101_2) = all_468_1 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | ALPHA: (346) implies: % 200.04/27.77 | | | | | | | | (347) size1(all_101_2) = all_468_1 % 200.04/27.77 | | | | | | | | (348) size1(all_354_1) = all_468_0 % 200.04/27.77 | | | | | | | | (349) size1(all_354_0) = $sum($difference(all_468_1, % 200.04/27.77 | | | | | | | | all_468_0), -1) % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | DELTA: instantiating (345) with fresh symbols all_470_0, % 200.04/27.77 | | | | | | | | all_470_1 gives: % 200.04/27.77 | | | | | | | | (350) size1(all_370_1) = $sum($difference(all_470_1, % 200.04/27.77 | | | | | | | | all_470_0), -1) & size1(all_370_2) = all_470_0 & % 200.04/27.77 | | | | | | | | size1(all_101_2) = all_470_1 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | ALPHA: (350) implies: % 200.04/27.77 | | | | | | | | (351) size1(all_101_2) = all_470_1 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (21) with all_354_1, all_370_2, % 200.04/27.77 | | | | | | | | all_101_2, simplifying with (341), (344) gives: % 200.04/27.77 | | | | | | | | (352) all_370_2 = all_354_1 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_470_1, % 200.04/27.77 | | | | | | | | all_101_2, simplifying with (69), (351) gives: % 200.04/27.77 | | | | | | | | (353) all_470_1 = all_101_0 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (22) with all_468_1, all_470_1, % 200.04/27.77 | | | | | | | | all_101_2, simplifying with (347), (351) gives: % 200.04/27.77 | | | | | | | | (354) all_470_1 = all_468_1 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (22) with all_101_18, all_468_0, % 200.04/27.77 | | | | | | | | all_354_1, simplifying with (282), (348) gives: % 200.04/27.77 | | | | | | | | (355) all_468_0 = all_101_18 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | GROUND_INST: instantiating (22) with % 200.04/27.77 | | | | | | | | $sum($difference(all_101_24, all_101_18), -1), % 200.04/27.77 | | | | | | | | $sum($difference(all_468_1, all_468_0), -1), % 200.04/27.77 | | | | | | | | all_354_0, simplifying with (283), (349) gives: % 200.04/27.77 | | | | | | | | (356) $sum($difference($difference(all_468_0, all_468_1), % 200.04/27.77 | | | | | | | | all_101_18), all_101_24) = 0 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | COMBINE_EQS: (353), (354) imply: % 200.04/27.77 | | | | | | | | (357) all_468_1 = all_101_0 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | SIMP: (357) implies: % 200.04/27.77 | | | | | | | | (358) all_468_1 = all_101_0 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | COMBINE_EQS: (355), (356) imply: % 200.04/27.77 | | | | | | | | (359) all_468_1 = all_101_24 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | SIMP: (359) implies: % 200.04/27.77 | | | | | | | | (360) all_468_1 = all_101_24 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | COMBINE_EQS: (358), (360) imply: % 200.04/27.77 | | | | | | | | (361) all_101_0 = all_101_24 % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | BETA: splitting (340) gives: % 200.04/27.77 | | | | | | | | % 200.04/27.77 | | | | | | | | Case 1: % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | (362) ~ (all_101_0 = all_101_24) % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | REDUCE: (361), (362) imply: % 200.04/27.77 | | | | | | | | | (363) $false % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | CLOSE: (363) is inconsistent. % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | Case 2: % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | (364) ? [v0: int] : ($lesseq(1, $difference(v0, % 200.04/27.77 | | | | | | | | | all_101_18)) & size1(all_354_1) = v0) % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | DELTA: instantiating (364) with fresh symbol all_510_0 gives: % 200.04/27.77 | | | | | | | | | (365) $lesseq(1, $difference(all_510_0, all_101_18)) & % 200.04/27.77 | | | | | | | | | size1(all_354_1) = all_510_0 % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | ALPHA: (365) implies: % 200.04/27.77 | | | | | | | | | (366) $lesseq(1, $difference(all_510_0, all_101_18)) % 200.04/27.77 | | | | | | | | | (367) size1(all_354_1) = all_510_0 % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | BETA: splitting (343) gives: % 200.04/27.77 | | | | | | | | | % 200.04/27.77 | | | | | | | | | Case 1: % 200.04/27.77 | | | | | | | | | | % 200.04/27.77 | | | | | | | | | | (368) ~ (all_101_0 = all_101_24) % 200.04/27.77 | | | | | | | | | | % 200.04/27.77 | | | | | | | | | | REDUCE: (361), (368) imply: % 200.04/27.77 | | | | | | | | | | (369) $false % 200.04/27.77 | | | | | | | | | | % 200.04/27.77 | | | | | | | | | | CLOSE: (369) is inconsistent. % 200.04/27.77 | | | | | | | | | | % 200.04/27.77 | | | | | | | | | Case 2: % 200.04/27.77 | | | | | | | | | | % 200.04/27.77 | | | | | | | | | | (370) ? [v0: int] : ($lesseq(1, $difference(v0, % 200.04/27.77 | | | | | | | | | | all_101_18)) & size1(all_370_2) = v0) % 200.04/27.77 | | | | | | | | | | % 200.04/27.77 | | | | | | | | | | DELTA: instantiating (370) with fresh symbol all_518_0 % 200.04/27.77 | | | | | | | | | | gives: % 200.04/27.78 | | | | | | | | | | (371) $lesseq(1, $difference(all_518_0, all_101_18)) & % 200.04/27.78 | | | | | | | | | | size1(all_370_2) = all_518_0 % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | ALPHA: (371) implies: % 200.04/27.78 | | | | | | | | | | (372) size1(all_370_2) = all_518_0 % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | REDUCE: (352), (372) imply: % 200.04/27.78 | | | | | | | | | | (373) size1(all_354_1) = all_518_0 % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | GROUND_INST: instantiating (22) with all_101_18, all_518_0, % 200.04/27.78 | | | | | | | | | | all_354_1, simplifying with (282), (373) gives: % 200.04/27.78 | | | | | | | | | | (374) all_518_0 = all_101_18 % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | GROUND_INST: instantiating (22) with all_510_0, all_518_0, % 200.04/27.78 | | | | | | | | | | all_354_1, simplifying with (367), (373) gives: % 200.04/27.78 | | | | | | | | | | (375) all_518_0 = all_510_0 % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | COMBINE_EQS: (374), (375) imply: % 200.04/27.78 | | | | | | | | | | (376) all_510_0 = all_101_18 % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | REDUCE: (366), (376) imply: % 200.04/27.78 | | | | | | | | | | (377) $false % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | | CLOSE: (377) is inconsistent. % 200.04/27.78 | | | | | | | | | | % 200.04/27.78 | | | | | | | | | End of split % 200.04/27.78 | | | | | | | | | % 200.04/27.78 | | | | | | | | End of split % 200.04/27.78 | | | | | | | | % 200.04/27.78 | | | | | | | End of split % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | End of split % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | Case 2: % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | (378) mem(tree, all_101_1, all_101_16) % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | PRED_UNIFY: (262), (378) imply: % 200.04/27.78 | | | | | | (379) $false % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | CLOSE: (379) is inconsistent. % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | End of split % 200.04/27.78 | | | | | % 200.04/27.78 | | | | End of split % 200.04/27.78 | | | | % 200.04/27.78 | | | Case 2: % 200.04/27.78 | | | | % 200.04/27.78 | | | | (380) all_101_15 = all_101_30 % 200.04/27.78 | | | | % 200.04/27.78 | | | | REDUCE: (103), (380) imply: % 200.04/27.78 | | | | (381) tb2t(all_101_30) = all_101_18 % 200.04/27.78 | | | | % 200.04/27.78 | | | | GROUND_INST: instantiating (20) with 0, all_101_18, all_101_30, % 200.04/27.78 | | | | simplifying with (102), (381) gives: % 200.04/27.78 | | | | (382) all_101_18 = 0 % 200.04/27.78 | | | | % 200.04/27.78 | | | | REDUCE: (230), (382) imply: % 200.04/27.78 | | | | (383) $lesseq(2, all_101_24) % 200.04/27.78 | | | | % 200.04/27.78 | | | | REDUCE: (43), (382) imply: % 200.04/27.78 | | | | (384) all_trees1($sum(all_101_24, -1), all_101_10) % 200.04/27.78 | | | | % 200.04/27.78 | | | | BETA: splitting (151) gives: % 200.04/27.78 | | | | % 200.04/27.78 | | | | Case 1: % 200.04/27.78 | | | | | % 200.04/27.78 | | | | | (385) mem(tree, all_97_3, all_101_14) % 200.04/27.78 | | | | | % 200.04/27.78 | | | | | BETA: splitting (111) gives: % 200.04/27.78 | | | | | % 200.04/27.78 | | | | | Case 1: % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | (386) mem(tree, all_101_1, all_101_16) % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | BETA: splitting (96) gives: % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | Case 1: % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | (387) all_101_16 = all_97_2 % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | REDUCE: (386), (387) imply: % 200.04/27.78 | | | | | | | (388) mem(tree, all_101_1, all_97_2) % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | GROUND_INST: instantiating (1) with tree, all_101_1, all_97_2, % 200.04/27.78 | | | | | | | simplifying with (14), (33), (56), (112), (388) % 200.04/27.78 | | | | | | | gives: % 200.04/27.78 | | | | | | | (389) $false % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | CLOSE: (389) is inconsistent. % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | Case 2: % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | GROUND_INST: instantiating (77) with all_101_2, all_101_1, % 200.04/27.78 | | | | | | | simplifying with (57), (73), (386) gives: % 200.04/27.78 | | | | | | | (390) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 200.04/27.78 | | | | | | | ($lesseq(1, $difference(all_101_18, v2)) & size1(v0) = v2 % 200.04/27.78 | | | | | | | & size1(all_101_2) = all_101_24 & node1(v0, v1) = % 200.04/27.78 | | | | | | | all_101_2 & tree1(v1) & tree1(v0)) % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | DELTA: instantiating (390) with fresh symbols all_344_0, % 200.04/27.78 | | | | | | | all_344_1, all_344_2 gives: % 200.04/27.78 | | | | | | | (391) $lesseq(1, $difference(all_101_18, all_344_0)) & % 200.04/27.78 | | | | | | | size1(all_344_2) = all_344_0 & size1(all_101_2) = % 200.04/27.78 | | | | | | | all_101_24 & node1(all_344_2, all_344_1) = all_101_2 & % 200.04/27.78 | | | | | | | tree1(all_344_1) & tree1(all_344_2) % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | ALPHA: (391) implies: % 200.04/27.78 | | | | | | | (392) $lesseq(1, $difference(all_101_18, all_344_0)) % 200.04/27.78 | | | | | | | (393) tree1(all_344_2) % 200.04/27.78 | | | | | | | (394) size1(all_344_2) = all_344_0 % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | REDUCE: (382), (392) imply: % 200.04/27.78 | | | | | | | (395) $lesseq(all_344_0, -1) % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | GROUND_INST: instantiating (size_nonneg) with all_344_2, % 200.04/27.78 | | | | | | | all_344_0, simplifying with (393), (394) gives: % 200.04/27.78 | | | | | | | (396) $lesseq(0, all_344_0) % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | COMBINE_INEQS: (395), (396) imply: % 200.04/27.78 | | | | | | | (397) $false % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | | CLOSE: (397) is inconsistent. % 200.04/27.78 | | | | | | | % 200.04/27.78 | | | | | | End of split % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | Case 2: % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | (398) ~ mem(tree, all_101_1, all_101_16) % 200.04/27.78 | | | | | | (399) ? [v0: int] : (size1(all_101_2) = v0 & ! [v1: tree1] : ! % 200.04/27.78 | | | | | | [v2: tree1] : ( ~ (v0 = all_101_24) | ~ (node1(v1, v2) = % 200.04/27.78 | | | | | | all_101_2) | ~ tree1(v2) | ~ tree1(v1) | ? [v3: % 200.04/27.78 | | | | | | int] : ($lesseq(all_101_18, v3) & size1(v1) = v3))) % 200.04/27.78 | | | | | | % 200.04/27.78 | | | | | | DELTA: instantiating (399) with fresh symbol all_308_0 gives: % 200.04/27.78 | | | | | | (400) size1(all_101_2) = all_308_0 & ! [v0: tree1] : ! [v1: % 200.04/27.78 | | | | | | tree1] : ( ~ (all_308_0 = all_101_24) | ~ (node1(v0, v1) % 200.04/27.78 | | | | | | = all_101_2) | ~ tree1(v1) | ~ tree1(v0) | ? [v2: % 200.04/27.79 | | | | | | int] : ($lesseq(all_101_18, v2) & size1(v0) = v2)) % 200.04/27.79 | | | | | | % 200.04/27.79 | | | | | | ALPHA: (400) implies: % 200.04/27.79 | | | | | | (401) size1(all_101_2) = all_308_0 % 200.04/27.79 | | | | | | % 200.04/27.79 | | | | | | BETA: splitting (166) gives: % 200.04/27.79 | | | | | | % 200.04/27.79 | | | | | | Case 1: % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | (402) mem(tree, all_101_1, all_101_8) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_308_0, % 200.04/27.79 | | | | | | | all_101_2, simplifying with (69), (401) gives: % 200.04/27.79 | | | | | | | (403) all_308_0 = all_101_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (78) with all_101_2, all_101_1, % 200.04/27.79 | | | | | | | simplifying with (57), (73), (402) gives: % 200.04/27.79 | | | | | | | (404) ? [v0: tree1] : ? [v1: tree1] : (size1(v1) = % 200.04/27.79 | | | | | | | $sum($difference(all_101_24, all_101_18), -1) & % 200.04/27.79 | | | | | | | size1(v0) = all_101_18 & node1(v0, v1) = all_101_2 & % 200.04/27.79 | | | | | | | tree1(v1) & tree1(v0)) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_97_3, % 200.04/27.79 | | | | | | | all_227_1, all_227_0, simplifying with (14), (91), % 200.04/27.79 | | | | | | | (226), (227) gives: % 200.04/27.79 | | | | | | | (405) ? [v0: any] : ( ~ (v0 = all_227_0) & nil(tree) = v0 & % 200.04/27.79 | | | | | | | uni(v0)) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, % 200.04/27.79 | | | | | | | all_223_1, all_223_0, simplifying with (14), (56), % 200.04/27.79 | | | | | | | (220), (221) gives: % 200.04/27.79 | | | | | | | (406) ? [v0: any] : ( ~ (v0 = all_223_0) & nil(tree) = v0 & % 200.04/27.79 | | | | | | | uni(v0)) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, % 200.04/27.79 | | | | | | | all_225_1, all_225_0, simplifying with (14), (56), % 200.04/27.79 | | | | | | | (223), (224) gives: % 200.04/27.79 | | | | | | | (407) ? [v0: any] : ( ~ (v0 = all_225_0) & nil(tree) = v0 & % 200.04/27.79 | | | | | | | uni(v0)) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | DELTA: instantiating (405) with fresh symbol all_347_0 gives: % 200.04/27.79 | | | | | | | (408) ~ (all_347_0 = all_227_0) & nil(tree) = all_347_0 & % 200.04/27.79 | | | | | | | uni(all_347_0) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | ALPHA: (408) implies: % 200.04/27.79 | | | | | | | (409) nil(tree) = all_347_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | DELTA: instantiating (406) with fresh symbol all_351_0 gives: % 200.04/27.79 | | | | | | | (410) ~ (all_351_0 = all_223_0) & nil(tree) = all_351_0 & % 200.04/27.79 | | | | | | | uni(all_351_0) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | ALPHA: (410) implies: % 200.04/27.79 | | | | | | | (411) nil(tree) = all_351_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | DELTA: instantiating (407) with fresh symbol all_355_0 gives: % 200.04/27.79 | | | | | | | (412) ~ (all_355_0 = all_225_0) & nil(tree) = all_355_0 & % 200.04/27.79 | | | | | | | uni(all_355_0) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | ALPHA: (412) implies: % 200.04/27.79 | | | | | | | (413) nil(tree) = all_355_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | DELTA: instantiating (404) with fresh symbols all_357_0, all_357_1 % 200.04/27.79 | | | | | | | gives: % 200.04/27.79 | | | | | | | (414) size1(all_357_0) = $sum($difference(all_101_24, % 200.04/27.79 | | | | | | | all_101_18), -1) & size1(all_357_1) = all_101_18 & % 200.04/27.79 | | | | | | | node1(all_357_1, all_357_0) = all_101_2 & % 200.04/27.79 | | | | | | | tree1(all_357_0) & tree1(all_357_1) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | ALPHA: (414) implies: % 200.04/27.79 | | | | | | | (415) tree1(all_357_1) % 200.04/27.79 | | | | | | | (416) tree1(all_357_0) % 200.04/27.79 | | | | | | | (417) node1(all_357_1, all_357_0) = all_101_2 % 200.04/27.79 | | | | | | | (418) size1(all_357_1) = all_101_18 % 200.04/27.79 | | | | | | | (419) size1(all_357_0) = $sum($difference(all_101_24, % 200.04/27.79 | | | | | | | all_101_18), -1) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | REDUCE: (382), (419) imply: % 200.04/27.79 | | | | | | | (420) size1(all_357_0) = $sum(all_101_24, -1) % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | REDUCE: (382), (418) imply: % 200.04/27.79 | | | | | | | (421) size1(all_357_1) = 0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (18) with all_97_2, all_351_0, tree, % 200.04/27.79 | | | | | | | simplifying with (33), (411) gives: % 200.04/27.79 | | | | | | | (422) all_351_0 = all_97_2 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (18) with all_351_0, all_355_0, tree, % 200.04/27.79 | | | | | | | simplifying with (411), (413) gives: % 200.04/27.79 | | | | | | | (423) all_355_0 = all_351_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | GROUND_INST: instantiating (18) with all_347_0, all_355_0, tree, % 200.04/27.79 | | | | | | | simplifying with (409), (413) gives: % 200.04/27.79 | | | | | | | (424) all_355_0 = all_347_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | COMBINE_EQS: (423), (424) imply: % 200.04/27.79 | | | | | | | (425) all_351_0 = all_347_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | SIMP: (425) implies: % 200.04/27.79 | | | | | | | (426) all_351_0 = all_347_0 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | COMBINE_EQS: (422), (426) imply: % 200.04/27.79 | | | | | | | (427) all_347_0 = all_97_2 % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | BETA: splitting (106) gives: % 200.04/27.79 | | | | | | | % 200.04/27.79 | | | | | | | Case 1: % 200.04/27.79 | | | | | | | | % 200.04/27.79 | | | | | | | | (428) $lesseq(all_101_0, 0) % 200.04/27.79 | | | | | | | | % 200.04/27.79 | | | | | | | | ANTI_SYMM: (105), (428) imply: % 200.04/27.79 | | | | | | | | (429) all_101_0 = 0 % 200.04/27.79 | | | | | | | | % 200.04/27.79 | | | | | | | | REDUCE: (69), (429) imply: % 200.04/27.79 | | | | | | | | (430) size1(all_101_2) = 0 % 200.04/27.79 | | | | | | | | % 200.04/27.79 | | | | | | | | BETA: splitting (149) gives: % 200.04/27.79 | | | | | | | | % 200.04/27.79 | | | | | | | | Case 1: % 200.04/27.79 | | | | | | | | | % 200.04/27.79 | | | | | | | | | % 200.04/27.79 | | | | | | | | | GROUND_INST: instantiating (5) with all_357_1, all_357_0, % 200.04/27.79 | | | | | | | | | all_101_2, simplifying with (415), (416), (417) % 200.04/27.79 | | | | | | | | | gives: % 200.04/27.79 | | | | | | | | | (431) ? [v0: int] : ? [v1: int] : (size1(all_357_0) = % 200.04/27.79 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_357_1) = % 200.04/27.79 | | | | | | | | | v1 & size1(all_101_2) = v0) % 200.04/27.79 | | | | | | | | | % 200.04/27.79 | | | | | | | | | DELTA: instantiating (431) with fresh symbols all_456_0, % 200.04/27.79 | | | | | | | | | all_456_1 gives: % 200.04/27.79 | | | | | | | | | (432) size1(all_357_0) = $sum($difference(all_456_1, % 200.04/27.79 | | | | | | | | | all_456_0), -1) & size1(all_357_1) = all_456_0 & % 200.04/27.79 | | | | | | | | | size1(all_101_2) = all_456_1 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | ALPHA: (432) implies: % 200.04/27.80 | | | | | | | | | (433) size1(all_101_2) = all_456_1 % 200.04/27.80 | | | | | | | | | (434) size1(all_357_1) = all_456_0 % 200.04/27.80 | | | | | | | | | (435) size1(all_357_0) = $sum($difference(all_456_1, % 200.04/27.80 | | | | | | | | | all_456_0), -1) % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_456_1, all_101_2, % 200.04/27.80 | | | | | | | | | simplifying with (430), (433) gives: % 200.04/27.80 | | | | | | | | | (436) all_456_1 = 0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_456_0, all_357_1, % 200.04/27.80 | | | | | | | | | simplifying with (421), (434) gives: % 200.04/27.80 | | | | | | | | | (437) all_456_0 = 0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 200.04/27.80 | | | | | | | | | $sum($difference(all_456_1, all_456_0), -1), % 200.04/27.80 | | | | | | | | | all_357_0, simplifying with (420), (435) gives: % 200.04/27.80 | | | | | | | | | (438) $sum($difference(all_456_0, all_456_1), all_101_24) = % 200.04/27.80 | | | | | | | | | 0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | COMBINE_EQS: (437), (438) imply: % 200.04/27.80 | | | | | | | | | (439) all_456_1 = all_101_24 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | SIMP: (439) implies: % 200.04/27.80 | | | | | | | | | (440) all_456_1 = all_101_24 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | COMBINE_EQS: (436), (440) imply: % 200.04/27.80 | | | | | | | | | (441) all_101_24 = 0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | SIMP: (441) implies: % 200.04/27.80 | | | | | | | | | (442) all_101_24 = 0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | REDUCE: (383), (442) imply: % 200.04/27.80 | | | | | | | | | (443) $false % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | CLOSE: (443) is inconsistent. % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | Case 2: % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | (444) ? [v0: int] : ( ~ (v0 = 0) & size1(all_101_2) = v0) % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | DELTA: instantiating (444) with fresh symbol all_387_0 gives: % 200.04/27.80 | | | | | | | | | (445) ~ (all_387_0 = 0) & size1(all_101_2) = all_387_0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | ALPHA: (445) implies: % 200.04/27.80 | | | | | | | | | (446) ~ (all_387_0 = 0) % 200.04/27.80 | | | | | | | | | (447) size1(all_101_2) = all_387_0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_387_0, all_101_2, % 200.04/27.80 | | | | | | | | | simplifying with (430), (447) gives: % 200.04/27.80 | | | | | | | | | (448) all_387_0 = 0 % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | REDUCE: (446), (448) imply: % 200.04/27.80 | | | | | | | | | (449) $false % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | CLOSE: (449) is inconsistent. % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | End of split % 200.04/27.80 | | | | | | | | % 200.04/27.80 | | | | | | | Case 2: % 200.04/27.80 | | | | | | | | % 200.04/27.80 | | | | | | | | (450) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 200.04/27.80 | | | | | | | | ($lesseq(1, $difference(all_101_0, v2)) & size1(v0) = % 200.04/27.80 | | | | | | | | v2 & node1(v0, v1) = all_101_2 & tree1(v1) & % 200.04/27.80 | | | | | | | | tree1(v0)) % 200.04/27.80 | | | | | | | | % 200.04/27.80 | | | | | | | | DELTA: instantiating (450) with fresh symbols all_382_0, % 200.04/27.80 | | | | | | | | all_382_1, all_382_2 gives: % 200.04/27.80 | | | | | | | | (451) $lesseq(1, $difference(all_101_0, all_382_0)) & % 200.04/27.80 | | | | | | | | size1(all_382_2) = all_382_0 & node1(all_382_2, % 200.04/27.80 | | | | | | | | all_382_1) = all_101_2 & tree1(all_382_1) & % 200.04/27.80 | | | | | | | | tree1(all_382_2) % 200.04/27.80 | | | | | | | | % 200.04/27.80 | | | | | | | | ALPHA: (451) implies: % 200.04/27.80 | | | | | | | | (452) tree1(all_382_2) % 200.04/27.80 | | | | | | | | (453) tree1(all_382_1) % 200.04/27.80 | | | | | | | | (454) node1(all_382_2, all_382_1) = all_101_2 % 200.04/27.80 | | | | | | | | % 200.04/27.80 | | | | | | | | BETA: splitting (153) gives: % 200.04/27.80 | | | | | | | | % 200.04/27.80 | | | | | | | | Case 1: % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | (455) mem(tree, all_101_1, all_101_11) % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | BETA: splitting (169) gives: % 200.04/27.80 | | | | | | | | | % 200.04/27.80 | | | | | | | | | Case 1: % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | (456) all_101_14 = all_97_2 % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | REDUCE: (385), (456) imply: % 200.04/27.80 | | | | | | | | | | (457) mem(tree, all_97_3, all_97_2) % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | GROUND_INST: instantiating (1) with tree, all_97_3, all_97_2, % 200.04/27.80 | | | | | | | | | | simplifying with (14), (33), (91), (110), (457) % 200.04/27.80 | | | | | | | | | | gives: % 200.04/27.80 | | | | | | | | | | (458) $false % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | CLOSE: (458) is inconsistent. % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | Case 2: % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | GROUND_INST: instantiating (10) with $sum(all_101_24, -1), % 200.04/27.80 | | | | | | | | | | all_101_10, all_101_11, all_101_2, all_101_1, % 200.04/27.80 | | | | | | | | | | simplifying with (57), (59), (73), (109), (384), % 200.04/27.80 | | | | | | | | | | (455) gives: % 200.04/27.80 | | | | | | | | | | (459) size1(all_101_2) = $sum(all_101_24, -1) % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | GROUND_INST: instantiating (5) with all_357_1, all_357_0, % 200.04/27.80 | | | | | | | | | | all_101_2, simplifying with (415), (416), (417) % 200.04/27.80 | | | | | | | | | | gives: % 200.04/27.80 | | | | | | | | | | (460) ? [v0: int] : ? [v1: int] : (size1(all_357_0) = % 200.04/27.80 | | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_357_1) % 200.04/27.80 | | | | | | | | | | = v1 & size1(all_101_2) = v0) % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | GROUND_INST: instantiating (5) with all_382_2, all_382_1, % 200.04/27.80 | | | | | | | | | | all_101_2, simplifying with (452), (453), (454) % 200.04/27.80 | | | | | | | | | | gives: % 200.04/27.80 | | | | | | | | | | (461) ? [v0: int] : ? [v1: int] : (size1(all_382_1) = % 200.04/27.80 | | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_382_2) % 200.04/27.80 | | | | | | | | | | = v1 & size1(all_101_2) = v0) % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | DELTA: instantiating (460) with fresh symbols all_460_0, % 200.04/27.80 | | | | | | | | | | all_460_1 gives: % 200.04/27.80 | | | | | | | | | | (462) size1(all_357_0) = $sum($difference(all_460_1, % 200.04/27.80 | | | | | | | | | | all_460_0), -1) & size1(all_357_1) = all_460_0 % 200.04/27.80 | | | | | | | | | | & size1(all_101_2) = all_460_1 % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | ALPHA: (462) implies: % 200.04/27.80 | | | | | | | | | | (463) size1(all_101_2) = all_460_1 % 200.04/27.80 | | | | | | | | | | (464) size1(all_357_1) = all_460_0 % 200.04/27.80 | | | | | | | | | | (465) size1(all_357_0) = $sum($difference(all_460_1, % 200.04/27.80 | | | | | | | | | | all_460_0), -1) % 200.04/27.80 | | | | | | | | | | % 200.04/27.80 | | | | | | | | | | DELTA: instantiating (461) with fresh symbols all_462_0, % 200.04/27.80 | | | | | | | | | | all_462_1 gives: % 200.04/27.81 | | | | | | | | | | (466) size1(all_382_1) = $sum($difference(all_462_1, % 200.04/27.81 | | | | | | | | | | all_462_0), -1) & size1(all_382_2) = all_462_0 % 200.04/27.81 | | | | | | | | | | & size1(all_101_2) = all_462_1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | ALPHA: (466) implies: % 200.04/27.81 | | | | | | | | | | (467) size1(all_101_2) = all_462_1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_460_1, % 200.04/27.81 | | | | | | | | | | all_101_2, simplifying with (69), (463) gives: % 200.04/27.81 | | | | | | | | | | (468) all_460_1 = all_101_0 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | GROUND_INST: instantiating (22) with all_460_1, all_462_1, % 200.04/27.81 | | | | | | | | | | all_101_2, simplifying with (463), (467) gives: % 200.04/27.81 | | | | | | | | | | (469) all_462_1 = all_460_1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 200.04/27.81 | | | | | | | | | | all_462_1, all_101_2, simplifying with (459), % 200.04/27.81 | | | | | | | | | | (467) gives: % 200.04/27.81 | | | | | | | | | | (470) $difference(all_462_1, all_101_24) = -1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_460_0, all_357_1, % 200.04/27.81 | | | | | | | | | | simplifying with (421), (464) gives: % 200.04/27.81 | | | | | | | | | | (471) all_460_0 = 0 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 200.04/27.81 | | | | | | | | | | $sum($difference(all_460_1, all_460_0), -1), % 200.04/27.81 | | | | | | | | | | all_357_0, simplifying with (420), (465) gives: % 200.04/27.81 | | | | | | | | | | (472) $sum($difference(all_460_0, all_460_1), all_101_24) % 200.04/27.81 | | | | | | | | | | = 0 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | COMBINE_EQS: (469), (470) imply: % 200.04/27.81 | | | | | | | | | | (473) $difference(all_460_1, all_101_24) = -1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | SIMP: (473) implies: % 200.04/27.81 | | | | | | | | | | (474) $difference(all_460_1, all_101_24) = -1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | COMBINE_EQS: (471), (472) imply: % 200.04/27.81 | | | | | | | | | | (475) all_460_1 = all_101_24 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | SIMP: (475) implies: % 200.04/27.81 | | | | | | | | | | (476) all_460_1 = all_101_24 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | COMBINE_EQS: (468), (476) imply: % 200.04/27.81 | | | | | | | | | | (477) all_101_0 = all_101_24 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | COMBINE_EQS: (468), (474) imply: % 200.04/27.81 | | | | | | | | | | (478) $difference(all_101_0, all_101_24) = -1 % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | COMBINE_EQS: (477), (478) imply: % 200.04/27.81 | | | | | | | | | | (479) $false % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | | CLOSE: (479) is inconsistent. % 200.04/27.81 | | | | | | | | | | % 200.04/27.81 | | | | | | | | | End of split % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | Case 2: % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | (480) ? [v0: int] : ( ~ ($difference($sum(v0, all_101_18), % 200.04/27.81 | | | | | | | | | all_101_24) = -1) & size1(all_101_2) = v0) % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | DELTA: instantiating (480) with fresh symbol all_399_0 gives: % 200.04/27.81 | | | | | | | | | (481) ~ ($difference($sum(all_399_0, all_101_18), % 200.04/27.81 | | | | | | | | | all_101_24) = -1) & size1(all_101_2) = all_399_0 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | ALPHA: (481) implies: % 200.04/27.81 | | | | | | | | | (482) size1(all_101_2) = all_399_0 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_399_0, % 200.04/27.81 | | | | | | | | | all_101_2, simplifying with (69), (482) gives: % 200.04/27.81 | | | | | | | | | (483) all_399_0 = all_101_0 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (79) with all_357_1, all_357_0, % 200.04/27.81 | | | | | | | | | simplifying with (415), (416), (417) gives: % 200.04/27.81 | | | | | | | | | (484) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 200.04/27.81 | | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 200.04/27.81 | | | | | | | | | size1(all_357_1) = v0) % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_357_1, % 200.04/27.81 | | | | | | | | | all_357_0, all_101_2, simplifying with (415), % 200.04/27.81 | | | | | | | | | (416), (417) gives: % 200.04/27.81 | | | | | | | | | (485) node_proj_11(all_101_2) = all_357_1 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (5) with all_357_1, all_357_0, % 200.04/27.81 | | | | | | | | | all_101_2, simplifying with (415), (416), (417) % 200.04/27.81 | | | | | | | | | gives: % 200.04/27.81 | | | | | | | | | (486) ? [v0: int] : ? [v1: int] : (size1(all_357_0) = % 200.04/27.81 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_357_1) = % 200.04/27.81 | | | | | | | | | v1 & size1(all_101_2) = v0) % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (79) with all_382_2, all_382_1, % 200.04/27.81 | | | | | | | | | simplifying with (452), (453), (454) gives: % 200.04/27.81 | | | | | | | | | (487) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 200.04/27.81 | | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 200.04/27.81 | | | | | | | | | size1(all_382_2) = v0) % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_382_2, % 200.04/27.81 | | | | | | | | | all_382_1, all_101_2, simplifying with (452), % 200.04/27.81 | | | | | | | | | (453), (454) gives: % 200.04/27.81 | | | | | | | | | (488) node_proj_11(all_101_2) = all_382_2 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (5) with all_382_2, all_382_1, % 200.04/27.81 | | | | | | | | | all_101_2, simplifying with (452), (453), (454) % 200.04/27.81 | | | | | | | | | gives: % 200.04/27.81 | | | | | | | | | (489) ? [v0: int] : ? [v1: int] : (size1(all_382_1) = % 200.04/27.81 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_382_2) = % 200.04/27.81 | | | | | | | | | v1 & size1(all_101_2) = v0) % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | DELTA: instantiating (486) with fresh symbols all_461_0, % 200.04/27.81 | | | | | | | | | all_461_1 gives: % 200.04/27.81 | | | | | | | | | (490) size1(all_357_0) = $sum($difference(all_461_1, % 200.04/27.81 | | | | | | | | | all_461_0), -1) & size1(all_357_1) = all_461_0 & % 200.04/27.81 | | | | | | | | | size1(all_101_2) = all_461_1 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | ALPHA: (490) implies: % 200.04/27.81 | | | | | | | | | (491) size1(all_101_2) = all_461_1 % 200.04/27.81 | | | | | | | | | (492) size1(all_357_1) = all_461_0 % 200.04/27.81 | | | | | | | | | (493) size1(all_357_0) = $sum($difference(all_461_1, % 200.04/27.81 | | | | | | | | | all_461_0), -1) % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | DELTA: instantiating (489) with fresh symbols all_465_0, % 200.04/27.81 | | | | | | | | | all_465_1 gives: % 200.04/27.81 | | | | | | | | | (494) size1(all_382_1) = $sum($difference(all_465_1, % 200.04/27.81 | | | | | | | | | all_465_0), -1) & size1(all_382_2) = all_465_0 & % 200.04/27.81 | | | | | | | | | size1(all_101_2) = all_465_1 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | ALPHA: (494) implies: % 200.04/27.81 | | | | | | | | | (495) size1(all_101_2) = all_465_1 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (21) with all_357_1, all_382_2, % 200.04/27.81 | | | | | | | | | all_101_2, simplifying with (485), (488) gives: % 200.04/27.81 | | | | | | | | | (496) all_382_2 = all_357_1 % 200.04/27.81 | | | | | | | | | % 200.04/27.81 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_465_1, % 200.04/27.81 | | | | | | | | | all_101_2, simplifying with (69), (495) gives: % 200.04/27.81 | | | | | | | | | (497) all_465_1 = all_101_0 % 200.04/27.81 | | | | | | | | | % 200.04/27.82 | | | | | | | | | GROUND_INST: instantiating (22) with all_461_1, all_465_1, % 200.04/27.82 | | | | | | | | | all_101_2, simplifying with (491), (495) gives: % 200.04/27.82 | | | | | | | | | (498) all_465_1 = all_461_1 % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_461_0, all_357_1, % 200.04/27.82 | | | | | | | | | simplifying with (421), (492) gives: % 200.04/27.82 | | | | | | | | | (499) all_461_0 = 0 % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 200.04/27.82 | | | | | | | | | $sum($difference(all_461_1, all_461_0), -1), % 200.04/27.82 | | | | | | | | | all_357_0, simplifying with (420), (493) gives: % 200.04/27.82 | | | | | | | | | (500) $sum($difference(all_461_0, all_461_1), all_101_24) = % 200.04/27.82 | | | | | | | | | 0 % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | COMBINE_EQS: (497), (498) imply: % 200.04/27.82 | | | | | | | | | (501) all_461_1 = all_101_0 % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | COMBINE_EQS: (499), (500) imply: % 200.04/27.82 | | | | | | | | | (502) all_461_1 = all_101_24 % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | COMBINE_EQS: (501), (502) imply: % 200.04/27.82 | | | | | | | | | (503) all_101_0 = all_101_24 % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | BETA: splitting (484) gives: % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | | Case 1: % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | (504) ~ (all_101_0 = all_101_24) % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | REDUCE: (503), (504) imply: % 200.04/27.82 | | | | | | | | | | (505) $false % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | CLOSE: (505) is inconsistent. % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | Case 2: % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | (506) ? [v0: int] : ($lesseq(1, $difference(v0, % 200.04/27.82 | | | | | | | | | | all_101_18)) & size1(all_357_1) = v0) % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | DELTA: instantiating (506) with fresh symbol all_501_0 % 200.04/27.82 | | | | | | | | | | gives: % 200.04/27.82 | | | | | | | | | | (507) $lesseq(1, $difference(all_501_0, all_101_18)) & % 200.04/27.82 | | | | | | | | | | size1(all_357_1) = all_501_0 % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | ALPHA: (507) implies: % 200.04/27.82 | | | | | | | | | | (508) $lesseq(1, $difference(all_501_0, all_101_18)) % 200.04/27.82 | | | | | | | | | | (509) size1(all_357_1) = all_501_0 % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | REDUCE: (382), (508) imply: % 200.04/27.82 | | | | | | | | | | (510) $lesseq(1, all_501_0) % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | BETA: splitting (487) gives: % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | Case 1: % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | (511) ~ (all_101_0 = all_101_24) % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | REDUCE: (503), (511) imply: % 200.04/27.82 | | | | | | | | | | | (512) $false % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | CLOSE: (512) is inconsistent. % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | Case 2: % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | (513) ? [v0: int] : ($lesseq(1, $difference(v0, % 200.04/27.82 | | | | | | | | | | | all_101_18)) & size1(all_382_2) = v0) % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | DELTA: instantiating (513) with fresh symbol all_509_0 % 200.04/27.82 | | | | | | | | | | | gives: % 200.04/27.82 | | | | | | | | | | | (514) $lesseq(1, $difference(all_509_0, all_101_18)) & % 200.04/27.82 | | | | | | | | | | | size1(all_382_2) = all_509_0 % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | ALPHA: (514) implies: % 200.04/27.82 | | | | | | | | | | | (515) size1(all_382_2) = all_509_0 % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | REDUCE: (496), (515) imply: % 200.04/27.82 | | | | | | | | | | | (516) size1(all_357_1) = all_509_0 % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_509_0, all_357_1, % 200.04/27.82 | | | | | | | | | | | simplifying with (421), (516) gives: % 200.04/27.82 | | | | | | | | | | | (517) all_509_0 = 0 % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | GROUND_INST: instantiating (22) with all_501_0, all_509_0, % 200.04/27.82 | | | | | | | | | | | all_357_1, simplifying with (509), (516) gives: % 200.04/27.82 | | | | | | | | | | | (518) all_509_0 = all_501_0 % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | COMBINE_EQS: (517), (518) imply: % 200.04/27.82 | | | | | | | | | | | (519) all_501_0 = 0 % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | REDUCE: (510), (519) imply: % 200.04/27.82 | | | | | | | | | | | (520) $false % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | | CLOSE: (520) is inconsistent. % 200.04/27.82 | | | | | | | | | | | % 200.04/27.82 | | | | | | | | | | End of split % 200.04/27.82 | | | | | | | | | | % 200.04/27.82 | | | | | | | | | End of split % 200.04/27.82 | | | | | | | | | % 200.04/27.82 | | | | | | | | End of split % 200.04/27.82 | | | | | | | | % 200.04/27.82 | | | | | | | End of split % 200.04/27.82 | | | | | | | % 200.04/27.82 | | | | | | Case 2: % 200.04/27.82 | | | | | | | % 200.04/27.82 | | | | | | | (521) mem(tree, all_101_1, all_101_16) % 200.04/27.82 | | | | | | | % 200.04/27.82 | | | | | | | PRED_UNIFY: (398), (521) imply: % 200.04/27.82 | | | | | | | (522) $false % 200.04/27.82 | | | | | | | % 200.04/27.82 | | | | | | | CLOSE: (522) is inconsistent. % 200.04/27.82 | | | | | | | % 200.04/27.82 | | | | | | End of split % 200.04/27.82 | | | | | | % 200.04/27.82 | | | | | End of split % 200.04/27.82 | | | | | % 200.04/27.82 | | | | Case 2: % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | (523) ? [v0: int] : ( ~ (v0 = all_101_18) & size1(empty1) = v0) % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | DELTA: instantiating (523) with fresh symbol all_285_0 gives: % 200.04/27.82 | | | | | (524) ~ (all_285_0 = all_101_18) & size1(empty1) = all_285_0 % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | ALPHA: (524) implies: % 200.04/27.82 | | | | | (525) ~ (all_285_0 = all_101_18) % 200.04/27.82 | | | | | (526) size1(empty1) = all_285_0 % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | REDUCE: (382), (525) imply: % 200.04/27.82 | | | | | (527) ~ (all_285_0 = 0) % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | GROUND_INST: instantiating (22) with 0, all_285_0, empty1, simplifying % 200.04/27.82 | | | | | with (4), (526) gives: % 200.04/27.82 | | | | | (528) all_285_0 = 0 % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | REDUCE: (527), (528) imply: % 200.04/27.82 | | | | | (529) $false % 200.04/27.82 | | | | | % 200.04/27.82 | | | | | CLOSE: (529) is inconsistent. % 200.04/27.82 | | | | | % 200.04/27.82 | | | | End of split % 200.04/27.82 | | | | % 200.04/27.82 | | | End of split % 200.04/27.82 | | | % 200.04/27.82 | | Case 2: % 200.04/27.82 | | | % 200.04/27.82 | | | (530) all_101_12 = all_101_30 % 200.04/27.82 | | | % 200.04/27.82 | | | REDUCE: (104), (530) imply: % 200.04/27.82 | | | (531) tb2t(all_101_30) = $sum($difference(all_101_24, all_101_18), -1) % 200.04/27.82 | | | % 200.04/27.82 | | | GROUND_INST: instantiating (20) with 0, $sum($difference(all_101_24, % 200.04/27.82 | | | all_101_18), -1), all_101_30, simplifying with (102), % 200.04/27.82 | | | (531) gives: % 200.04/27.82 | | | (532) $difference(all_101_18, all_101_24) = -1 % 200.04/27.82 | | | % 200.04/27.82 | | | REDUCE: (38), (532) imply: % 200.04/27.83 | | | (533) $lesseq(1, all_101_24) % 200.04/27.83 | | | % 200.04/27.83 | | | REDUCE: (103), (532) imply: % 200.04/27.83 | | | (534) tb2t(all_101_15) = $sum(all_101_24, -1) % 200.04/27.83 | | | % 200.04/27.83 | | | REDUCE: (67), (532) imply: % 200.04/27.83 | | | (535) t2tb($sum(all_101_24, -1)) = all_101_15 % 200.04/27.83 | | | % 200.04/27.83 | | | REDUCE: (42), (532) imply: % 200.04/27.83 | | | (536) all_trees1($sum(all_101_24, -1), all_101_13) % 200.04/27.83 | | | % 200.04/27.83 | | | BETA: splitting (154) gives: % 200.04/27.83 | | | % 200.04/27.83 | | | Case 1: % 200.04/27.83 | | | | % 200.04/27.83 | | | | (537) mem(tree, all_97_3, all_101_11) % 200.04/27.83 | | | | % 200.04/27.83 | | | | BETA: splitting (83) gives: % 200.04/27.83 | | | | % 200.04/27.83 | | | | Case 1: % 200.04/27.83 | | | | | % 200.04/27.83 | | | | | (538) ~ (t2tb(0) = all_101_15) % 200.04/27.83 | | | | | % 200.04/27.83 | | | | | PRED_UNIFY: (535), (538) imply: % 200.04/27.83 | | | | | (539) ~ (all_101_24 = 1) % 200.04/27.83 | | | | | % 200.04/27.83 | | | | | STRENGTHEN: (533), (539) imply: % 200.04/27.83 | | | | | (540) $lesseq(2, all_101_24) % 200.04/27.83 | | | | | % 200.04/27.83 | | | | | BETA: splitting (111) gives: % 200.04/27.83 | | | | | % 200.04/27.83 | | | | | Case 1: % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | (541) mem(tree, all_101_1, all_101_16) % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | GROUND_INST: instantiating (77) with all_101_2, all_101_1, % 200.04/27.83 | | | | | | simplifying with (57), (73), (541) gives: % 200.04/27.83 | | | | | | (542) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 200.04/27.83 | | | | | | ($lesseq(1, $difference(all_101_18, v2)) & size1(v0) = v2 & % 200.04/27.83 | | | | | | size1(all_101_2) = all_101_24 & node1(v0, v1) = all_101_2 % 200.04/27.83 | | | | | | & tree1(v1) & tree1(v0)) % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | DELTA: instantiating (542) with fresh symbols all_343_0, all_343_1, % 200.04/27.83 | | | | | | all_343_2 gives: % 200.04/27.83 | | | | | | (543) $lesseq(1, $difference(all_101_18, all_343_0)) & % 200.04/27.83 | | | | | | size1(all_343_2) = all_343_0 & size1(all_101_2) = % 200.04/27.83 | | | | | | all_101_24 & node1(all_343_2, all_343_1) = all_101_2 & % 200.04/27.83 | | | | | | tree1(all_343_1) & tree1(all_343_2) % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | ALPHA: (543) implies: % 200.04/27.83 | | | | | | (544) $lesseq(1, $difference(all_101_18, all_343_0)) % 200.04/27.83 | | | | | | (545) tree1(all_343_2) % 200.04/27.83 | | | | | | (546) tree1(all_343_1) % 200.04/27.83 | | | | | | (547) node1(all_343_2, all_343_1) = all_101_2 % 200.04/27.83 | | | | | | (548) size1(all_101_2) = all_101_24 % 200.04/27.83 | | | | | | (549) size1(all_343_2) = all_343_0 % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | REDUCE: (532), (544) imply: % 200.04/27.83 | | | | | | (550) $lesseq(2, $difference(all_101_24, all_343_0)) % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_101_24, % 200.04/27.83 | | | | | | all_101_2, simplifying with (69), (548) gives: % 200.04/27.83 | | | | | | (551) all_101_0 = all_101_24 % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | BETA: splitting (106) gives: % 200.04/27.83 | | | | | | % 200.04/27.83 | | | | | | Case 1: % 200.04/27.83 | | | | | | | % 200.04/27.83 | | | | | | | (552) $lesseq(all_101_0, 0) % 200.04/27.83 | | | | | | | % 200.04/27.83 | | | | | | | REDUCE: (551), (552) imply: % 200.04/27.83 | | | | | | | (553) $lesseq(all_101_24, 0) % 200.04/27.83 | | | | | | | % 200.04/27.83 | | | | | | | COMBINE_INEQS: (540), (553) imply: % 200.04/27.83 | | | | | | | (554) $false % 200.04/27.83 | | | | | | | % 200.04/27.83 | | | | | | | CLOSE: (554) is inconsistent. % 200.04/27.83 | | | | | | | % 200.04/27.83 | | | | | | Case 2: % 200.04/27.83 | | | | | | | % 200.92/27.83 | | | | | | | (555) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 200.92/27.83 | | | | | | | ($lesseq(1, $difference(all_101_0, v2)) & size1(v0) = v2 % 200.92/27.83 | | | | | | | & node1(v0, v1) = all_101_2 & tree1(v1) & tree1(v0)) % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | DELTA: instantiating (555) with fresh symbols all_364_0, % 200.92/27.83 | | | | | | | all_364_1, all_364_2 gives: % 200.92/27.83 | | | | | | | (556) $lesseq(1, $difference(all_101_0, all_364_0)) & % 200.92/27.83 | | | | | | | size1(all_364_2) = all_364_0 & node1(all_364_2, % 200.92/27.83 | | | | | | | all_364_1) = all_101_2 & tree1(all_364_1) & % 200.92/27.83 | | | | | | | tree1(all_364_2) % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | ALPHA: (556) implies: % 200.92/27.83 | | | | | | | (557) tree1(all_364_2) % 200.92/27.83 | | | | | | | (558) tree1(all_364_1) % 200.92/27.83 | | | | | | | (559) node1(all_364_2, all_364_1) = all_101_2 % 200.92/27.83 | | | | | | | (560) size1(all_364_2) = all_364_0 % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | GROUND_INST: instantiating (79) with all_364_2, all_364_1, % 200.92/27.83 | | | | | | | simplifying with (557), (558), (559) gives: % 200.92/27.83 | | | | | | | (561) ~ (all_101_0 = all_101_24) | ? [v0: int] : ($lesseq(1, % 200.92/27.83 | | | | | | | $difference(v0, all_101_18)) & size1(all_364_2) = v0) % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | GROUND_INST: instantiating (tree_diff) with all_343_2, all_364_2, % 200.92/27.83 | | | | | | | all_343_0, all_364_0, all_343_1, all_364_1, % 200.92/27.83 | | | | | | | all_101_2, simplifying with (545), (546), (547), % 200.92/27.83 | | | | | | | (549), (557), (558), (559), (560) gives: % 200.92/27.83 | | | | | | | (562) all_364_0 = all_343_0 % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | REDUCE: (560), (562) imply: % 200.92/27.83 | | | | | | | (563) size1(all_364_2) = all_343_0 % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | BETA: splitting (561) gives: % 200.92/27.83 | | | | | | | % 200.92/27.83 | | | | | | | Case 1: % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | (564) ~ (all_101_0 = all_101_24) % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | REDUCE: (551), (564) imply: % 200.92/27.83 | | | | | | | | (565) $false % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | CLOSE: (565) is inconsistent. % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | Case 2: % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | (566) ? [v0: int] : ($lesseq(1, $difference(v0, all_101_18)) % 200.92/27.83 | | | | | | | | & size1(all_364_2) = v0) % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | DELTA: instantiating (566) with fresh symbol all_456_0 gives: % 200.92/27.83 | | | | | | | | (567) $lesseq(1, $difference(all_456_0, all_101_18)) & % 200.92/27.83 | | | | | | | | size1(all_364_2) = all_456_0 % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | ALPHA: (567) implies: % 200.92/27.83 | | | | | | | | (568) $lesseq(1, $difference(all_456_0, all_101_18)) % 200.92/27.83 | | | | | | | | (569) size1(all_364_2) = all_456_0 % 200.92/27.83 | | | | | | | | % 200.92/27.83 | | | | | | | | REDUCE: (532), (568) imply: % 200.92/27.84 | | | | | | | | (570) $lesseq(all_101_24, all_456_0) % 200.92/27.84 | | | | | | | | % 200.92/27.84 | | | | | | | | GROUND_INST: instantiating (22) with all_343_0, all_456_0, % 200.92/27.84 | | | | | | | | all_364_2, simplifying with (563), (569) gives: % 200.92/27.84 | | | | | | | | (571) all_456_0 = all_343_0 % 200.92/27.84 | | | | | | | | % 200.92/27.84 | | | | | | | | REDUCE: (570), (571) imply: % 200.92/27.84 | | | | | | | | (572) $lesseq(all_101_24, all_343_0) % 200.92/27.84 | | | | | | | | % 200.92/27.84 | | | | | | | | COMBINE_INEQS: (550), (572) imply: % 200.92/27.84 | | | | | | | | (573) $false % 200.92/27.84 | | | | | | | | % 200.92/27.84 | | | | | | | | CLOSE: (573) is inconsistent. % 200.92/27.84 | | | | | | | | % 200.92/27.84 | | | | | | | End of split % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | End of split % 200.92/27.84 | | | | | | % 200.92/27.84 | | | | | Case 2: % 200.92/27.84 | | | | | | % 200.92/27.84 | | | | | | (574) ~ mem(tree, all_101_1, all_101_16) % 200.92/27.84 | | | | | | (575) ? [v0: int] : (size1(all_101_2) = v0 & ! [v1: tree1] : ! % 200.92/27.84 | | | | | | [v2: tree1] : ( ~ (v0 = all_101_24) | ~ (node1(v1, v2) = % 200.92/27.84 | | | | | | all_101_2) | ~ tree1(v2) | ~ tree1(v1) | ? [v3: % 200.92/27.84 | | | | | | int] : ($lesseq(all_101_18, v3) & size1(v1) = v3))) % 200.92/27.84 | | | | | | % 200.92/27.84 | | | | | | DELTA: instantiating (575) with fresh symbol all_287_0 gives: % 200.92/27.84 | | | | | | (576) size1(all_101_2) = all_287_0 & ! [v0: tree1] : ! [v1: % 200.92/27.84 | | | | | | tree1] : ( ~ (all_287_0 = all_101_24) | ~ (node1(v0, v1) % 200.92/27.84 | | | | | | = all_101_2) | ~ tree1(v1) | ~ tree1(v0) | ? [v2: % 200.92/27.84 | | | | | | int] : ($lesseq(all_101_18, v2) & size1(v0) = v2)) % 200.92/27.84 | | | | | | % 200.92/27.84 | | | | | | ALPHA: (576) implies: % 200.92/27.84 | | | | | | (577) size1(all_101_2) = all_287_0 % 200.92/27.84 | | | | | | % 200.92/27.84 | | | | | | BETA: splitting (166) gives: % 200.92/27.84 | | | | | | % 200.92/27.84 | | | | | | Case 1: % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | (578) mem(tree, all_101_1, all_101_8) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_287_0, % 200.92/27.84 | | | | | | | all_101_2, simplifying with (69), (577) gives: % 200.92/27.84 | | | | | | | (579) all_287_0 = all_101_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (78) with all_101_2, all_101_1, % 200.92/27.84 | | | | | | | simplifying with (57), (73), (578) gives: % 200.92/27.84 | | | | | | | (580) ? [v0: tree1] : ? [v1: tree1] : (size1(v1) = % 200.92/27.84 | | | | | | | $sum($difference(all_101_24, all_101_18), -1) & % 200.92/27.84 | | | | | | | size1(v0) = all_101_18 & node1(v0, v1) = all_101_2 & % 200.92/27.84 | | | | | | | tree1(v1) & tree1(v0)) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_97_3, % 200.92/27.84 | | | | | | | all_227_1, all_227_0, simplifying with (14), (91), % 200.92/27.84 | | | | | | | (226), (227) gives: % 200.92/27.84 | | | | | | | (581) ? [v0: any] : ( ~ (v0 = all_227_0) & nil(tree) = v0 & % 200.92/27.84 | | | | | | | uni(v0)) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, % 200.92/27.84 | | | | | | | all_223_1, all_223_0, simplifying with (14), (56), % 200.92/27.84 | | | | | | | (220), (221) gives: % 200.92/27.84 | | | | | | | (582) ? [v0: any] : ( ~ (v0 = all_223_0) & nil(tree) = v0 & % 200.92/27.84 | | | | | | | uni(v0)) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (nil_Cons1) with tree, all_101_1, % 200.92/27.84 | | | | | | | all_225_1, all_225_0, simplifying with (14), (56), % 200.92/27.84 | | | | | | | (223), (224) gives: % 200.92/27.84 | | | | | | | (583) ? [v0: any] : ( ~ (v0 = all_225_0) & nil(tree) = v0 & % 200.92/27.84 | | | | | | | uni(v0)) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | DELTA: instantiating (583) with fresh symbol all_344_0 gives: % 200.92/27.84 | | | | | | | (584) ~ (all_344_0 = all_225_0) & nil(tree) = all_344_0 & % 200.92/27.84 | | | | | | | uni(all_344_0) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | ALPHA: (584) implies: % 200.92/27.84 | | | | | | | (585) nil(tree) = all_344_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | DELTA: instantiating (581) with fresh symbol all_348_0 gives: % 200.92/27.84 | | | | | | | (586) ~ (all_348_0 = all_227_0) & nil(tree) = all_348_0 & % 200.92/27.84 | | | | | | | uni(all_348_0) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | ALPHA: (586) implies: % 200.92/27.84 | | | | | | | (587) nil(tree) = all_348_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | DELTA: instantiating (582) with fresh symbol all_352_0 gives: % 200.92/27.84 | | | | | | | (588) ~ (all_352_0 = all_223_0) & nil(tree) = all_352_0 & % 200.92/27.84 | | | | | | | uni(all_352_0) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | ALPHA: (588) implies: % 200.92/27.84 | | | | | | | (589) nil(tree) = all_352_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | DELTA: instantiating (580) with fresh symbols all_354_0, all_354_1 % 200.92/27.84 | | | | | | | gives: % 200.92/27.84 | | | | | | | (590) size1(all_354_0) = $sum($difference(all_101_24, % 200.92/27.84 | | | | | | | all_101_18), -1) & size1(all_354_1) = all_101_18 & % 200.92/27.84 | | | | | | | node1(all_354_1, all_354_0) = all_101_2 & % 200.92/27.84 | | | | | | | tree1(all_354_0) & tree1(all_354_1) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | ALPHA: (590) implies: % 200.92/27.84 | | | | | | | (591) tree1(all_354_1) % 200.92/27.84 | | | | | | | (592) tree1(all_354_0) % 200.92/27.84 | | | | | | | (593) node1(all_354_1, all_354_0) = all_101_2 % 200.92/27.84 | | | | | | | (594) size1(all_354_1) = all_101_18 % 200.92/27.84 | | | | | | | (595) size1(all_354_0) = $sum($difference(all_101_24, % 200.92/27.84 | | | | | | | all_101_18), -1) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | REDUCE: (532), (595) imply: % 200.92/27.84 | | | | | | | (596) size1(all_354_0) = 0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | REDUCE: (532), (594) imply: % 200.92/27.84 | | | | | | | (597) size1(all_354_1) = $sum(all_101_24, -1) % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (18) with all_97_2, all_348_0, tree, % 200.92/27.84 | | | | | | | simplifying with (33), (587) gives: % 200.92/27.84 | | | | | | | (598) all_348_0 = all_97_2 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (18) with all_348_0, all_352_0, tree, % 200.92/27.84 | | | | | | | simplifying with (587), (589) gives: % 200.92/27.84 | | | | | | | (599) all_352_0 = all_348_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | GROUND_INST: instantiating (18) with all_344_0, all_352_0, tree, % 200.92/27.84 | | | | | | | simplifying with (585), (589) gives: % 200.92/27.84 | | | | | | | (600) all_352_0 = all_344_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | COMBINE_EQS: (599), (600) imply: % 200.92/27.84 | | | | | | | (601) all_348_0 = all_344_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | SIMP: (601) implies: % 200.92/27.84 | | | | | | | (602) all_348_0 = all_344_0 % 200.92/27.84 | | | | | | | % 200.92/27.84 | | | | | | | COMBINE_EQS: (598), (602) imply: % 200.92/27.85 | | | | | | | (603) all_344_0 = all_97_2 % 200.92/27.85 | | | | | | | % 200.92/27.85 | | | | | | | BETA: splitting (106) gives: % 200.92/27.85 | | | | | | | % 200.92/27.85 | | | | | | | Case 1: % 200.92/27.85 | | | | | | | | % 200.92/27.85 | | | | | | | | (604) $lesseq(all_101_0, 0) % 200.92/27.85 | | | | | | | | % 200.92/27.85 | | | | | | | | ANTI_SYMM: (105), (604) imply: % 200.92/27.85 | | | | | | | | (605) all_101_0 = 0 % 200.92/27.85 | | | | | | | | % 200.92/27.85 | | | | | | | | REDUCE: (69), (605) imply: % 200.92/27.85 | | | | | | | | (606) size1(all_101_2) = 0 % 200.92/27.85 | | | | | | | | % 200.92/27.85 | | | | | | | | BETA: splitting (170) gives: % 200.92/27.85 | | | | | | | | % 200.92/27.85 | | | | | | | | Case 1: % 200.92/27.85 | | | | | | | | | % 200.92/27.85 | | | | | | | | | (607) all_101_11 = all_97_2 % 200.92/27.85 | | | | | | | | | % 200.92/27.85 | | | | | | | | | REDUCE: (537), (607) imply: % 200.92/27.85 | | | | | | | | | (608) mem(tree, all_97_3, all_97_2) % 200.92/27.85 | | | | | | | | | % 200.92/27.85 | | | | | | | | | GROUND_INST: instantiating (1) with tree, all_97_3, all_97_2, % 200.92/27.85 | | | | | | | | | simplifying with (14), (33), (91), (110), (608) % 200.92/27.85 | | | | | | | | | gives: % 200.92/27.85 | | | | | | | | | (609) $false % 200.92/27.85 | | | | | | | | | % 200.92/27.85 | | | | | | | | | CLOSE: (609) is inconsistent. % 200.92/27.85 | | | | | | | | | % 200.92/27.85 | | | | | | | | Case 2: % 200.92/27.85 | | | | | | | | | % 200.92/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | GROUND_INST: instantiating (5) with all_354_1, all_354_0, % 201.17/27.85 | | | | | | | | | all_101_2, simplifying with (591), (592), (593) % 201.17/27.85 | | | | | | | | | gives: % 201.17/27.85 | | | | | | | | | (610) ? [v0: int] : ? [v1: int] : (size1(all_354_0) = % 201.17/27.85 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_354_1) = % 201.17/27.85 | | | | | | | | | v1 & size1(all_101_2) = v0) % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | DELTA: instantiating (610) with fresh symbols all_441_0, % 201.17/27.85 | | | | | | | | | all_441_1 gives: % 201.17/27.85 | | | | | | | | | (611) size1(all_354_0) = $sum($difference(all_441_1, % 201.17/27.85 | | | | | | | | | all_441_0), -1) & size1(all_354_1) = all_441_0 & % 201.17/27.85 | | | | | | | | | size1(all_101_2) = all_441_1 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | ALPHA: (611) implies: % 201.17/27.85 | | | | | | | | | (612) size1(all_101_2) = all_441_1 % 201.17/27.85 | | | | | | | | | (613) size1(all_354_1) = all_441_0 % 201.17/27.85 | | | | | | | | | (614) size1(all_354_0) = $sum($difference(all_441_1, % 201.17/27.85 | | | | | | | | | all_441_0), -1) % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_441_1, all_101_2, % 201.17/27.85 | | | | | | | | | simplifying with (606), (612) gives: % 201.17/27.85 | | | | | | | | | (615) all_441_1 = 0 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 201.17/27.85 | | | | | | | | | all_441_0, all_354_1, simplifying with (597), % 201.17/27.85 | | | | | | | | | (613) gives: % 201.17/27.85 | | | | | | | | | (616) $difference(all_441_0, all_101_24) = -1 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | GROUND_INST: instantiating (22) with 0, % 201.17/27.85 | | | | | | | | | $sum($difference(all_441_1, all_441_0), -1), % 201.17/27.85 | | | | | | | | | all_354_0, simplifying with (596), (614) gives: % 201.17/27.85 | | | | | | | | | (617) $difference(all_441_0, all_441_1) = -1 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | COMBINE_EQS: (616), (617) imply: % 201.17/27.85 | | | | | | | | | (618) all_441_1 = all_101_24 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | COMBINE_EQS: (615), (618) imply: % 201.17/27.85 | | | | | | | | | (619) all_101_24 = 0 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | SIMP: (619) implies: % 201.17/27.85 | | | | | | | | | (620) all_101_24 = 0 % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | REDUCE: (540), (620) imply: % 201.17/27.85 | | | | | | | | | (621) $false % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | CLOSE: (621) is inconsistent. % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | End of split % 201.17/27.85 | | | | | | | | % 201.17/27.85 | | | | | | | Case 2: % 201.17/27.85 | | | | | | | | % 201.17/27.85 | | | | | | | | (622) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 201.17/27.85 | | | | | | | | ($lesseq(1, $difference(all_101_0, v2)) & size1(v0) = % 201.17/27.85 | | | | | | | | v2 & node1(v0, v1) = all_101_2 & tree1(v1) & % 201.17/27.85 | | | | | | | | tree1(v0)) % 201.17/27.85 | | | | | | | | % 201.17/27.85 | | | | | | | | DELTA: instantiating (622) with fresh symbols all_372_0, % 201.17/27.85 | | | | | | | | all_372_1, all_372_2 gives: % 201.17/27.85 | | | | | | | | (623) $lesseq(1, $difference(all_101_0, all_372_0)) & % 201.17/27.85 | | | | | | | | size1(all_372_2) = all_372_0 & node1(all_372_2, % 201.17/27.85 | | | | | | | | all_372_1) = all_101_2 & tree1(all_372_1) & % 201.17/27.85 | | | | | | | | tree1(all_372_2) % 201.17/27.85 | | | | | | | | % 201.17/27.85 | | | | | | | | ALPHA: (623) implies: % 201.17/27.85 | | | | | | | | (624) tree1(all_372_2) % 201.17/27.85 | | | | | | | | (625) tree1(all_372_1) % 201.17/27.85 | | | | | | | | (626) node1(all_372_2, all_372_1) = all_101_2 % 201.17/27.85 | | | | | | | | % 201.17/27.85 | | | | | | | | BETA: splitting (150) gives: % 201.17/27.85 | | | | | | | | % 201.17/27.85 | | | | | | | | Case 1: % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | (627) mem(tree, all_101_1, all_101_14) % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | BETA: splitting (170) gives: % 201.17/27.85 | | | | | | | | | % 201.17/27.85 | | | | | | | | | Case 1: % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | (628) all_101_11 = all_97_2 % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | REDUCE: (537), (628) imply: % 201.17/27.85 | | | | | | | | | | (629) mem(tree, all_97_3, all_97_2) % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | GROUND_INST: instantiating (1) with tree, all_97_3, all_97_2, % 201.17/27.85 | | | | | | | | | | simplifying with (14), (33), (91), (110), (629) % 201.17/27.85 | | | | | | | | | | gives: % 201.17/27.85 | | | | | | | | | | (630) $false % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | CLOSE: (630) is inconsistent. % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | Case 2: % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | GROUND_INST: instantiating (10) with $sum(all_101_24, -1), % 201.17/27.85 | | | | | | | | | | all_101_13, all_101_14, all_101_2, all_101_1, % 201.17/27.85 | | | | | | | | | | simplifying with (57), (58), (73), (108), (536), % 201.17/27.85 | | | | | | | | | | (627) gives: % 201.17/27.85 | | | | | | | | | | (631) size1(all_101_2) = $sum(all_101_24, -1) % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | GROUND_INST: instantiating (5) with all_354_1, all_354_0, % 201.17/27.85 | | | | | | | | | | all_101_2, simplifying with (591), (592), (593) % 201.17/27.85 | | | | | | | | | | gives: % 201.17/27.85 | | | | | | | | | | (632) ? [v0: int] : ? [v1: int] : (size1(all_354_0) = % 201.17/27.85 | | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_354_1) % 201.17/27.85 | | | | | | | | | | = v1 & size1(all_101_2) = v0) % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | GROUND_INST: instantiating (5) with all_372_2, all_372_1, % 201.17/27.85 | | | | | | | | | | all_101_2, simplifying with (624), (625), (626) % 201.17/27.85 | | | | | | | | | | gives: % 201.17/27.85 | | | | | | | | | | (633) ? [v0: int] : ? [v1: int] : (size1(all_372_1) = % 201.17/27.85 | | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_372_2) % 201.17/27.85 | | | | | | | | | | = v1 & size1(all_101_2) = v0) % 201.17/27.85 | | | | | | | | | | % 201.17/27.85 | | | | | | | | | | DELTA: instantiating (632) with fresh symbols all_455_0, % 201.17/27.85 | | | | | | | | | | all_455_1 gives: % 201.17/27.85 | | | | | | | | | | (634) size1(all_354_0) = $sum($difference(all_455_1, % 201.17/27.86 | | | | | | | | | | all_455_0), -1) & size1(all_354_1) = all_455_0 % 201.17/27.86 | | | | | | | | | | & size1(all_101_2) = all_455_1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | ALPHA: (634) implies: % 201.17/27.86 | | | | | | | | | | (635) size1(all_101_2) = all_455_1 % 201.17/27.86 | | | | | | | | | | (636) size1(all_354_1) = all_455_0 % 201.17/27.86 | | | | | | | | | | (637) size1(all_354_0) = $sum($difference(all_455_1, % 201.17/27.86 | | | | | | | | | | all_455_0), -1) % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | DELTA: instantiating (633) with fresh symbols all_457_0, % 201.17/27.86 | | | | | | | | | | all_457_1 gives: % 201.17/27.86 | | | | | | | | | | (638) size1(all_372_1) = $sum($difference(all_457_1, % 201.17/27.86 | | | | | | | | | | all_457_0), -1) & size1(all_372_2) = all_457_0 % 201.17/27.86 | | | | | | | | | | & size1(all_101_2) = all_457_1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | ALPHA: (638) implies: % 201.17/27.86 | | | | | | | | | | (639) size1(all_101_2) = all_457_1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 201.17/27.86 | | | | | | | | | | all_455_1, all_101_2, simplifying with (631), % 201.17/27.86 | | | | | | | | | | (635) gives: % 201.17/27.86 | | | | | | | | | | (640) $difference(all_455_1, all_101_24) = -1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_457_1, % 201.17/27.86 | | | | | | | | | | all_101_2, simplifying with (69), (639) gives: % 201.17/27.86 | | | | | | | | | | (641) all_457_1 = all_101_0 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | GROUND_INST: instantiating (22) with all_455_1, all_457_1, % 201.17/27.86 | | | | | | | | | | all_101_2, simplifying with (635), (639) gives: % 201.17/27.86 | | | | | | | | | | (642) all_457_1 = all_455_1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 201.17/27.86 | | | | | | | | | | all_455_0, all_354_1, simplifying with (597), % 201.17/27.86 | | | | | | | | | | (636) gives: % 201.17/27.86 | | | | | | | | | | (643) $difference(all_455_0, all_101_24) = -1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | GROUND_INST: instantiating (22) with 0, % 201.17/27.86 | | | | | | | | | | $sum($difference(all_455_1, all_455_0), -1), % 201.17/27.86 | | | | | | | | | | all_354_0, simplifying with (596), (637) gives: % 201.17/27.86 | | | | | | | | | | (644) $difference(all_455_0, all_455_1) = -1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | COMBINE_EQS: (641), (642) imply: % 201.17/27.86 | | | | | | | | | | (645) all_455_1 = all_101_0 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | SIMP: (645) implies: % 201.17/27.86 | | | | | | | | | | (646) all_455_1 = all_101_0 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | COMBINE_EQS: (643), (644) imply: % 201.17/27.86 | | | | | | | | | | (647) all_455_1 = all_101_24 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | COMBINE_EQS: (646), (647) imply: % 201.17/27.86 | | | | | | | | | | (648) all_101_0 = all_101_24 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | COMBINE_EQS: (640), (646) imply: % 201.17/27.86 | | | | | | | | | | (649) $difference(all_101_0, all_101_24) = -1 % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | COMBINE_EQS: (648), (649) imply: % 201.17/27.86 | | | | | | | | | | (650) $false % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | | CLOSE: (650) is inconsistent. % 201.17/27.86 | | | | | | | | | | % 201.17/27.86 | | | | | | | | | End of split % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | Case 2: % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | (651) ? [v0: int] : ( ~ (v0 = all_101_18) & % 201.17/27.86 | | | | | | | | | size1(all_101_2) = v0) % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | DELTA: instantiating (651) with fresh symbol all_389_0 gives: % 201.17/27.86 | | | | | | | | | (652) ~ (all_389_0 = all_101_18) & size1(all_101_2) = % 201.17/27.86 | | | | | | | | | all_389_0 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | ALPHA: (652) implies: % 201.17/27.86 | | | | | | | | | (653) size1(all_101_2) = all_389_0 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_389_0, % 201.17/27.86 | | | | | | | | | all_101_2, simplifying with (69), (653) gives: % 201.17/27.86 | | | | | | | | | (654) all_389_0 = all_101_0 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (79) with all_354_1, all_354_0, % 201.17/27.86 | | | | | | | | | simplifying with (591), (592), (593) gives: % 201.17/27.86 | | | | | | | | | (655) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 201.17/27.86 | | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 201.17/27.86 | | | | | | | | | size1(all_354_1) = v0) % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_354_1, % 201.17/27.86 | | | | | | | | | all_354_0, all_101_2, simplifying with (591), % 201.17/27.86 | | | | | | | | | (592), (593) gives: % 201.17/27.86 | | | | | | | | | (656) node_proj_11(all_101_2) = all_354_1 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (5) with all_354_1, all_354_0, % 201.17/27.86 | | | | | | | | | all_101_2, simplifying with (591), (592), (593) % 201.17/27.86 | | | | | | | | | gives: % 201.17/27.86 | | | | | | | | | (657) ? [v0: int] : ? [v1: int] : (size1(all_354_0) = % 201.17/27.86 | | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_354_1) = % 201.17/27.86 | | | | | | | | | v1 & size1(all_101_2) = v0) % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (79) with all_372_2, all_372_1, % 201.17/27.86 | | | | | | | | | simplifying with (624), (625), (626) gives: % 201.17/27.86 | | | | | | | | | (658) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 201.17/27.86 | | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 201.17/27.86 | | | | | | | | | size1(all_372_2) = v0) % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_372_2, % 201.17/27.86 | | | | | | | | | all_372_1, all_101_2, simplifying with (624), % 201.17/27.86 | | | | | | | | | (625), (626) gives: % 201.17/27.86 | | | | | | | | | (659) node_proj_11(all_101_2) = all_372_2 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | DELTA: instantiating (657) with fresh symbols all_456_0, % 201.17/27.86 | | | | | | | | | all_456_1 gives: % 201.17/27.86 | | | | | | | | | (660) size1(all_354_0) = $sum($difference(all_456_1, % 201.17/27.86 | | | | | | | | | all_456_0), -1) & size1(all_354_1) = all_456_0 & % 201.17/27.86 | | | | | | | | | size1(all_101_2) = all_456_1 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | ALPHA: (660) implies: % 201.17/27.86 | | | | | | | | | (661) size1(all_101_2) = all_456_1 % 201.17/27.86 | | | | | | | | | (662) size1(all_354_1) = all_456_0 % 201.17/27.86 | | | | | | | | | (663) size1(all_354_0) = $sum($difference(all_456_1, % 201.17/27.86 | | | | | | | | | all_456_0), -1) % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (21) with all_354_1, all_372_2, % 201.17/27.86 | | | | | | | | | all_101_2, simplifying with (656), (659) gives: % 201.17/27.86 | | | | | | | | | (664) all_372_2 = all_354_1 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_456_1, % 201.17/27.86 | | | | | | | | | all_101_2, simplifying with (69), (661) gives: % 201.17/27.86 | | | | | | | | | (665) all_456_1 = all_101_0 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 201.17/27.86 | | | | | | | | | all_456_0, all_354_1, simplifying with (597), % 201.17/27.86 | | | | | | | | | (662) gives: % 201.17/27.86 | | | | | | | | | (666) $difference(all_456_0, all_101_24) = -1 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | GROUND_INST: instantiating (22) with 0, % 201.17/27.86 | | | | | | | | | $sum($difference(all_456_1, all_456_0), -1), % 201.17/27.86 | | | | | | | | | all_354_0, simplifying with (596), (663) gives: % 201.17/27.86 | | | | | | | | | (667) $difference(all_456_0, all_456_1) = -1 % 201.17/27.86 | | | | | | | | | % 201.17/27.86 | | | | | | | | | COMBINE_EQS: (666), (667) imply: % 201.17/27.86 | | | | | | | | | (668) all_456_1 = all_101_24 % 201.17/27.86 | | | | | | | | | % 201.17/27.87 | | | | | | | | | COMBINE_EQS: (665), (668) imply: % 201.17/27.87 | | | | | | | | | (669) all_101_0 = all_101_24 % 201.17/27.87 | | | | | | | | | % 201.17/27.87 | | | | | | | | | BETA: splitting (655) gives: % 201.17/27.87 | | | | | | | | | % 201.17/27.87 | | | | | | | | | Case 1: % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | (670) ~ (all_101_0 = all_101_24) % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | REDUCE: (669), (670) imply: % 201.17/27.87 | | | | | | | | | | (671) $false % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | CLOSE: (671) is inconsistent. % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | Case 2: % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | (672) ? [v0: int] : ($lesseq(1, $difference(v0, % 201.17/27.87 | | | | | | | | | | all_101_18)) & size1(all_354_1) = v0) % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | DELTA: instantiating (672) with fresh symbol all_498_0 % 201.17/27.87 | | | | | | | | | | gives: % 201.17/27.87 | | | | | | | | | | (673) $lesseq(1, $difference(all_498_0, all_101_18)) & % 201.17/27.87 | | | | | | | | | | size1(all_354_1) = all_498_0 % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | ALPHA: (673) implies: % 201.17/27.87 | | | | | | | | | | (674) $lesseq(1, $difference(all_498_0, all_101_18)) % 201.17/27.87 | | | | | | | | | | (675) size1(all_354_1) = all_498_0 % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | REDUCE: (532), (674) imply: % 201.17/27.87 | | | | | | | | | | (676) $lesseq(all_101_24, all_498_0) % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | BETA: splitting (658) gives: % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | Case 1: % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | (677) ~ (all_101_0 = all_101_24) % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | REDUCE: (669), (677) imply: % 201.17/27.87 | | | | | | | | | | | (678) $false % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | CLOSE: (678) is inconsistent. % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | Case 2: % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | (679) ? [v0: int] : ($lesseq(1, $difference(v0, % 201.17/27.87 | | | | | | | | | | | all_101_18)) & size1(all_372_2) = v0) % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | DELTA: instantiating (679) with fresh symbol all_506_0 % 201.17/27.87 | | | | | | | | | | | gives: % 201.17/27.87 | | | | | | | | | | | (680) $lesseq(1, $difference(all_506_0, all_101_18)) & % 201.17/27.87 | | | | | | | | | | | size1(all_372_2) = all_506_0 % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | ALPHA: (680) implies: % 201.17/27.87 | | | | | | | | | | | (681) size1(all_372_2) = all_506_0 % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | REDUCE: (664), (681) imply: % 201.17/27.87 | | | | | | | | | | | (682) size1(all_354_1) = all_506_0 % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | GROUND_INST: instantiating (22) with $sum(all_101_24, -1), % 201.17/27.87 | | | | | | | | | | | all_506_0, all_354_1, simplifying with (597), % 201.17/27.87 | | | | | | | | | | | (682) gives: % 201.17/27.87 | | | | | | | | | | | (683) $difference(all_506_0, all_101_24) = -1 % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | GROUND_INST: instantiating (22) with all_498_0, all_506_0, % 201.17/27.87 | | | | | | | | | | | all_354_1, simplifying with (675), (682) gives: % 201.17/27.87 | | | | | | | | | | | (684) all_506_0 = all_498_0 % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | COMBINE_EQS: (683), (684) imply: % 201.17/27.87 | | | | | | | | | | | (685) $difference(all_498_0, all_101_24) = -1 % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | REDUCE: (676), (685) imply: % 201.17/27.87 | | | | | | | | | | | (686) $false % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | | CLOSE: (686) is inconsistent. % 201.17/27.87 | | | | | | | | | | | % 201.17/27.87 | | | | | | | | | | End of split % 201.17/27.87 | | | | | | | | | | % 201.17/27.87 | | | | | | | | | End of split % 201.17/27.87 | | | | | | | | | % 201.17/27.87 | | | | | | | | End of split % 201.17/27.87 | | | | | | | | % 201.17/27.87 | | | | | | | End of split % 201.17/27.87 | | | | | | | % 201.17/27.87 | | | | | | Case 2: % 201.17/27.87 | | | | | | | % 201.17/27.87 | | | | | | | (687) mem(tree, all_101_1, all_101_16) % 201.17/27.87 | | | | | | | % 201.17/27.87 | | | | | | | PRED_UNIFY: (574), (687) imply: % 201.17/27.87 | | | | | | | (688) $false % 201.17/27.87 | | | | | | | % 201.17/27.87 | | | | | | | CLOSE: (688) is inconsistent. % 201.17/27.87 | | | | | | | % 201.17/27.87 | | | | | | End of split % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | End of split % 201.17/27.87 | | | | | % 201.17/27.87 | | | | Case 2: % 201.17/27.87 | | | | | % 201.17/27.87 | | | | | (689) all_101_15 = all_101_30 % 201.17/27.87 | | | | | % 201.17/27.87 | | | | | REDUCE: (534), (689) imply: % 201.17/27.87 | | | | | (690) tb2t(all_101_30) = $sum(all_101_24, -1) % 201.17/27.87 | | | | | % 201.17/27.87 | | | | | GROUND_INST: instantiating (20) with 0, $sum(all_101_24, -1), % 201.17/27.87 | | | | | all_101_30, simplifying with (102), (690) gives: % 201.17/27.87 | | | | | (691) all_101_24 = 1 % 201.17/27.87 | | | | | % 201.17/27.87 | | | | | COMBINE_EQS: (532), (691) imply: % 201.17/27.87 | | | | | (692) all_101_18 = 0 % 201.17/27.87 | | | | | % 201.17/27.87 | | | | | BETA: splitting (111) gives: % 201.17/27.87 | | | | | % 201.17/27.87 | | | | | Case 1: % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | (693) mem(tree, all_101_1, all_101_16) % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | GROUND_INST: instantiating (77) with all_101_2, all_101_1, % 201.17/27.87 | | | | | | simplifying with (57), (73), (693) gives: % 201.17/27.87 | | | | | | (694) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 201.17/27.87 | | | | | | ($lesseq(1, $difference(all_101_18, v2)) & size1(v0) = v2 & % 201.17/27.87 | | | | | | size1(all_101_2) = all_101_24 & node1(v0, v1) = all_101_2 % 201.17/27.87 | | | | | | & tree1(v1) & tree1(v0)) % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | DELTA: instantiating (694) with fresh symbols all_348_0, all_348_1, % 201.17/27.87 | | | | | | all_348_2 gives: % 201.17/27.87 | | | | | | (695) $lesseq(1, $difference(all_101_18, all_348_0)) & % 201.17/27.87 | | | | | | size1(all_348_2) = all_348_0 & size1(all_101_2) = % 201.17/27.87 | | | | | | all_101_24 & node1(all_348_2, all_348_1) = all_101_2 & % 201.17/27.87 | | | | | | tree1(all_348_1) & tree1(all_348_2) % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | ALPHA: (695) implies: % 201.17/27.87 | | | | | | (696) $lesseq(1, $difference(all_101_18, all_348_0)) % 201.17/27.87 | | | | | | (697) tree1(all_348_2) % 201.17/27.87 | | | | | | (698) size1(all_348_2) = all_348_0 % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | REDUCE: (692), (696) imply: % 201.17/27.87 | | | | | | (699) $lesseq(all_348_0, -1) % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | GROUND_INST: instantiating (size_nonneg) with all_348_2, all_348_0, % 201.17/27.87 | | | | | | simplifying with (697), (698) gives: % 201.17/27.87 | | | | | | (700) $lesseq(0, all_348_0) % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | COMBINE_INEQS: (699), (700) imply: % 201.17/27.87 | | | | | | (701) $false % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | CLOSE: (701) is inconsistent. % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | Case 2: % 201.17/27.87 | | | | | | % 201.17/27.87 | | | | | | (702) ~ mem(tree, all_101_1, all_101_16) % 201.17/27.88 | | | | | | (703) ? [v0: int] : (size1(all_101_2) = v0 & ! [v1: tree1] : ! % 201.17/27.88 | | | | | | [v2: tree1] : ( ~ (v0 = all_101_24) | ~ (node1(v1, v2) = % 201.17/27.88 | | | | | | all_101_2) | ~ tree1(v2) | ~ tree1(v1) | ? [v3: % 201.17/27.88 | | | | | | int] : ($lesseq(all_101_18, v3) & size1(v1) = v3))) % 201.17/27.88 | | | | | | % 201.17/27.88 | | | | | | DELTA: instantiating (703) with fresh symbol all_292_0 gives: % 201.17/27.88 | | | | | | (704) size1(all_101_2) = all_292_0 & ! [v0: tree1] : ! [v1: % 201.17/27.88 | | | | | | tree1] : ( ~ (all_292_0 = all_101_24) | ~ (node1(v0, v1) % 201.17/27.88 | | | | | | = all_101_2) | ~ tree1(v1) | ~ tree1(v0) | ? [v2: % 201.17/27.88 | | | | | | int] : ($lesseq(all_101_18, v2) & size1(v0) = v2)) % 201.17/27.88 | | | | | | % 201.17/27.88 | | | | | | ALPHA: (704) implies: % 201.17/27.88 | | | | | | (705) size1(all_101_2) = all_292_0 % 201.17/27.88 | | | | | | % 201.17/27.88 | | | | | | BETA: splitting (166) gives: % 201.17/27.88 | | | | | | % 201.17/27.88 | | | | | | Case 1: % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | (706) mem(tree, all_101_1, all_101_8) % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_292_0, % 201.17/27.88 | | | | | | | all_101_2, simplifying with (69), (705) gives: % 201.17/27.88 | | | | | | | (707) all_292_0 = all_101_0 % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | GROUND_INST: instantiating (78) with all_101_2, all_101_1, % 201.17/27.88 | | | | | | | simplifying with (57), (73), (706) gives: % 201.17/27.88 | | | | | | | (708) ? [v0: tree1] : ? [v1: tree1] : (size1(v1) = % 201.17/27.88 | | | | | | | $sum($difference(all_101_24, all_101_18), -1) & % 201.17/27.88 | | | | | | | size1(v0) = all_101_18 & node1(v0, v1) = all_101_2 & % 201.17/27.88 | | | | | | | tree1(v1) & tree1(v0)) % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | DELTA: instantiating (708) with fresh symbols all_359_0, all_359_1 % 201.17/27.88 | | | | | | | gives: % 201.17/27.88 | | | | | | | (709) size1(all_359_0) = $sum($difference(all_101_24, % 201.17/27.88 | | | | | | | all_101_18), -1) & size1(all_359_1) = all_101_18 & % 201.17/27.88 | | | | | | | node1(all_359_1, all_359_0) = all_101_2 & % 201.17/27.88 | | | | | | | tree1(all_359_0) & tree1(all_359_1) % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | ALPHA: (709) implies: % 201.17/27.88 | | | | | | | (710) tree1(all_359_1) % 201.17/27.88 | | | | | | | (711) tree1(all_359_0) % 201.17/27.88 | | | | | | | (712) node1(all_359_1, all_359_0) = all_101_2 % 201.17/27.88 | | | | | | | (713) size1(all_359_1) = all_101_18 % 201.17/27.88 | | | | | | | (714) size1(all_359_0) = $sum($difference(all_101_24, % 201.17/27.88 | | | | | | | all_101_18), -1) % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | REDUCE: (691), (692), (714) imply: % 201.17/27.88 | | | | | | | (715) size1(all_359_0) = 0 % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | REDUCE: (692), (713) imply: % 201.17/27.88 | | | | | | | (716) size1(all_359_1) = 0 % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | BETA: splitting (106) gives: % 201.17/27.88 | | | | | | | % 201.17/27.88 | | | | | | | Case 1: % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | (717) $lesseq(all_101_0, 0) % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | ANTI_SYMM: (105), (717) imply: % 201.17/27.88 | | | | | | | | (718) all_101_0 = 0 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | REDUCE: (69), (718) imply: % 201.17/27.88 | | | | | | | | (719) size1(all_101_2) = 0 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | GROUND_INST: instantiating (5) with all_359_1, all_359_0, % 201.17/27.88 | | | | | | | | all_101_2, simplifying with (710), (711), (712) % 201.17/27.88 | | | | | | | | gives: % 201.17/27.88 | | | | | | | | (720) ? [v0: int] : ? [v1: int] : (size1(all_359_0) = % 201.17/27.88 | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_359_1) = v1 % 201.17/27.88 | | | | | | | | & size1(all_101_2) = v0) % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | DELTA: instantiating (720) with fresh symbols all_439_0, % 201.17/27.88 | | | | | | | | all_439_1 gives: % 201.17/27.88 | | | | | | | | (721) size1(all_359_0) = $sum($difference(all_439_1, % 201.17/27.88 | | | | | | | | all_439_0), -1) & size1(all_359_1) = all_439_0 & % 201.17/27.88 | | | | | | | | size1(all_101_2) = all_439_1 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | ALPHA: (721) implies: % 201.17/27.88 | | | | | | | | (722) size1(all_101_2) = all_439_1 % 201.17/27.88 | | | | | | | | (723) size1(all_359_1) = all_439_0 % 201.17/27.88 | | | | | | | | (724) size1(all_359_0) = $sum($difference(all_439_1, % 201.17/27.88 | | | | | | | | all_439_0), -1) % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | GROUND_INST: instantiating (22) with 0, all_439_1, all_101_2, % 201.17/27.88 | | | | | | | | simplifying with (719), (722) gives: % 201.17/27.88 | | | | | | | | (725) all_439_1 = 0 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | GROUND_INST: instantiating (22) with 0, all_439_0, all_359_1, % 201.17/27.88 | | | | | | | | simplifying with (716), (723) gives: % 201.17/27.88 | | | | | | | | (726) all_439_0 = 0 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | GROUND_INST: instantiating (22) with 0, % 201.17/27.88 | | | | | | | | $sum($difference(all_439_1, all_439_0), -1), % 201.17/27.88 | | | | | | | | all_359_0, simplifying with (715), (724) gives: % 201.17/27.88 | | | | | | | | (727) $difference(all_439_0, all_439_1) = -1 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | COMBINE_EQS: (726), (727) imply: % 201.17/27.88 | | | | | | | | (728) all_439_1 = 1 % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | COMBINE_EQS: (725), (728) imply: % 201.17/27.88 | | | | | | | | (729) $false % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | CLOSE: (729) is inconsistent. % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | Case 2: % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | (730) ? [v0: tree1] : ? [v1: tree1] : ? [v2: int] : % 201.17/27.88 | | | | | | | | ($lesseq(1, $difference(all_101_0, v2)) & size1(v0) = % 201.17/27.88 | | | | | | | | v2 & node1(v0, v1) = all_101_2 & tree1(v1) & % 201.17/27.88 | | | | | | | | tree1(v0)) % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | DELTA: instantiating (730) with fresh symbols all_377_0, % 201.17/27.88 | | | | | | | | all_377_1, all_377_2 gives: % 201.17/27.88 | | | | | | | | (731) $lesseq(1, $difference(all_101_0, all_377_0)) & % 201.17/27.88 | | | | | | | | size1(all_377_2) = all_377_0 & node1(all_377_2, % 201.17/27.88 | | | | | | | | all_377_1) = all_101_2 & tree1(all_377_1) & % 201.17/27.88 | | | | | | | | tree1(all_377_2) % 201.17/27.88 | | | | | | | | % 201.17/27.88 | | | | | | | | ALPHA: (731) implies: % 201.17/27.88 | | | | | | | | (732) tree1(all_377_2) % 201.17/27.88 | | | | | | | | (733) tree1(all_377_1) % 201.17/27.89 | | | | | | | | (734) node1(all_377_2, all_377_1) = all_101_2 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (79) with all_359_1, all_359_0, % 201.17/27.89 | | | | | | | | simplifying with (710), (711), (712) gives: % 201.17/27.89 | | | | | | | | (735) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 201.17/27.89 | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 201.17/27.89 | | | | | | | | size1(all_359_1) = v0) % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_359_1, % 201.17/27.89 | | | | | | | | all_359_0, all_101_2, simplifying with (710), % 201.17/27.89 | | | | | | | | (711), (712) gives: % 201.17/27.89 | | | | | | | | (736) node_proj_11(all_101_2) = all_359_1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (5) with all_359_1, all_359_0, % 201.17/27.89 | | | | | | | | all_101_2, simplifying with (710), (711), (712) % 201.17/27.89 | | | | | | | | gives: % 201.17/27.89 | | | | | | | | (737) ? [v0: int] : ? [v1: int] : (size1(all_359_0) = % 201.17/27.89 | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_359_1) = v1 % 201.17/27.89 | | | | | | | | & size1(all_101_2) = v0) % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (79) with all_377_2, all_377_1, % 201.17/27.89 | | | | | | | | simplifying with (732), (733), (734) gives: % 201.17/27.89 | | | | | | | | (738) ~ (all_101_0 = all_101_24) | ? [v0: int] : % 201.17/27.89 | | | | | | | | ($lesseq(1, $difference(v0, all_101_18)) & % 201.17/27.89 | | | | | | | | size1(all_377_2) = v0) % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (node_proj_1_def1) with all_377_2, % 201.17/27.89 | | | | | | | | all_377_1, all_101_2, simplifying with (732), % 201.17/27.89 | | | | | | | | (733), (734) gives: % 201.17/27.89 | | | | | | | | (739) node_proj_11(all_101_2) = all_377_2 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (5) with all_377_2, all_377_1, % 201.17/27.89 | | | | | | | | all_101_2, simplifying with (732), (733), (734) % 201.17/27.89 | | | | | | | | gives: % 201.17/27.89 | | | | | | | | (740) ? [v0: int] : ? [v1: int] : (size1(all_377_1) = % 201.17/27.89 | | | | | | | | $sum($difference(v0, v1), -1) & size1(all_377_2) = v1 % 201.17/27.89 | | | | | | | | & size1(all_101_2) = v0) % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | DELTA: instantiating (740) with fresh symbols all_434_0, % 201.17/27.89 | | | | | | | | all_434_1 gives: % 201.17/27.89 | | | | | | | | (741) size1(all_377_1) = $sum($difference(all_434_1, % 201.17/27.89 | | | | | | | | all_434_0), -1) & size1(all_377_2) = all_434_0 & % 201.17/27.89 | | | | | | | | size1(all_101_2) = all_434_1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | ALPHA: (741) implies: % 201.17/27.89 | | | | | | | | (742) size1(all_101_2) = all_434_1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | DELTA: instantiating (737) with fresh symbols all_440_0, % 201.17/27.89 | | | | | | | | all_440_1 gives: % 201.17/27.89 | | | | | | | | (743) size1(all_359_0) = $sum($difference(all_440_1, % 201.17/27.89 | | | | | | | | all_440_0), -1) & size1(all_359_1) = all_440_0 & % 201.17/27.89 | | | | | | | | size1(all_101_2) = all_440_1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | ALPHA: (743) implies: % 201.17/27.89 | | | | | | | | (744) size1(all_101_2) = all_440_1 % 201.17/27.89 | | | | | | | | (745) size1(all_359_1) = all_440_0 % 201.17/27.89 | | | | | | | | (746) size1(all_359_0) = $sum($difference(all_440_1, % 201.17/27.89 | | | | | | | | all_440_0), -1) % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (21) with all_359_1, all_377_2, % 201.17/27.89 | | | | | | | | all_101_2, simplifying with (736), (739) gives: % 201.17/27.89 | | | | | | | | (747) all_377_2 = all_359_1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (22) with all_101_0, all_440_1, % 201.17/27.89 | | | | | | | | all_101_2, simplifying with (69), (744) gives: % 201.17/27.89 | | | | | | | | (748) all_440_1 = all_101_0 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (22) with all_434_1, all_440_1, % 201.17/27.89 | | | | | | | | all_101_2, simplifying with (742), (744) gives: % 201.17/27.89 | | | | | | | | (749) all_440_1 = all_434_1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (22) with 0, all_440_0, all_359_1, % 201.17/27.89 | | | | | | | | simplifying with (716), (745) gives: % 201.17/27.89 | | | | | | | | (750) all_440_0 = 0 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | GROUND_INST: instantiating (22) with 0, % 201.17/27.89 | | | | | | | | $sum($difference(all_440_1, all_440_0), -1), % 201.17/27.89 | | | | | | | | all_359_0, simplifying with (715), (746) gives: % 201.17/27.89 | | | | | | | | (751) $difference(all_440_0, all_440_1) = -1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | COMBINE_EQS: (750), (751) imply: % 201.17/27.89 | | | | | | | | (752) all_440_1 = 1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | COMBINE_EQS: (748), (749) imply: % 201.17/27.89 | | | | | | | | (753) all_434_1 = all_101_0 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | COMBINE_EQS: (749), (752) imply: % 201.17/27.89 | | | | | | | | (754) all_434_1 = 1 % 201.17/27.89 | | | | | | | | % 201.17/27.89 | | | | | | | | COMBINE_EQS: (753), (754) imply: % 201.17/27.89 | | | | | | | | (755) all_101_0 = 1 % 201.17/27.90 | | | | | | | | % 201.17/27.90 | | | | | | | | BETA: splitting (738) gives: % 201.17/27.90 | | | | | | | | % 201.17/27.90 | | | | | | | | Case 1: % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | (756) ~ (all_101_0 = all_101_24) % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | REDUCE: (691), (755), (756) imply: % 201.17/27.90 | | | | | | | | | (757) $false % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | CLOSE: (757) is inconsistent. % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | Case 2: % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | (758) all_101_0 = all_101_24 % 201.17/27.90 | | | | | | | | | (759) ? [v0: int] : ($lesseq(1, $difference(v0, % 201.17/27.90 | | | | | | | | | all_101_18)) & size1(all_377_2) = v0) % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | DELTA: instantiating (759) with fresh symbol all_460_0 gives: % 201.17/27.90 | | | | | | | | | (760) $lesseq(1, $difference(all_460_0, all_101_18)) & % 201.17/27.90 | | | | | | | | | size1(all_377_2) = all_460_0 % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | ALPHA: (760) implies: % 201.17/27.90 | | | | | | | | | (761) $lesseq(1, $difference(all_460_0, all_101_18)) % 201.17/27.90 | | | | | | | | | (762) size1(all_377_2) = all_460_0 % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | REDUCE: (692), (761) imply: % 201.17/27.90 | | | | | | | | | (763) $lesseq(1, all_460_0) % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | REDUCE: (747), (762) imply: % 201.17/27.90 | | | | | | | | | (764) size1(all_359_1) = all_460_0 % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | BETA: splitting (735) gives: % 201.17/27.90 | | | | | | | | | % 201.17/27.90 | | | | | | | | | Case 1: % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | (765) ~ (all_101_0 = all_101_24) % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | REDUCE: (691), (755), (765) imply: % 201.17/27.90 | | | | | | | | | | (766) $false % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | CLOSE: (766) is inconsistent. % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | Case 2: % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | (767) ? [v0: int] : ($lesseq(1, $difference(v0, % 201.17/27.90 | | | | | | | | | | all_101_18)) & size1(all_359_1) = v0) % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | DELTA: instantiating (767) with fresh symbol all_468_0 % 201.17/27.90 | | | | | | | | | | gives: % 201.17/27.90 | | | | | | | | | | (768) $lesseq(1, $difference(all_468_0, all_101_18)) & % 201.17/27.90 | | | | | | | | | | size1(all_359_1) = all_468_0 % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | ALPHA: (768) implies: % 201.17/27.90 | | | | | | | | | | (769) size1(all_359_1) = all_468_0 % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | GROUND_INST: instantiating (22) with 0, all_468_0, all_359_1, % 201.17/27.90 | | | | | | | | | | simplifying with (716), (769) gives: % 201.17/27.90 | | | | | | | | | | (770) all_468_0 = 0 % 201.17/27.90 | | | | | | | | | | % 201.17/27.90 | | | | | | | | | | GROUND_INST: instantiating (22) with all_460_0, all_468_0, % 201.17/27.90 | | | | | | | | | | all_359_1, simplifying with (764), (769) gives: % 201.39/27.90 | | | | | | | | | | (771) all_468_0 = all_460_0 % 201.39/27.90 | | | | | | | | | | % 201.39/27.90 | | | | | | | | | | COMBINE_EQS: (770), (771) imply: % 201.39/27.90 | | | | | | | | | | (772) all_460_0 = 0 % 201.39/27.90 | | | | | | | | | | % 201.39/27.90 | | | | | | | | | | REDUCE: (763), (772) imply: % 201.39/27.90 | | | | | | | | | | (773) $false % 201.39/27.90 | | | | | | | | | | % 201.39/27.90 | | | | | | | | | | CLOSE: (773) is inconsistent. % 201.39/27.90 | | | | | | | | | | % 201.39/27.90 | | | | | | | | | End of split % 201.39/27.90 | | | | | | | | | % 201.39/27.90 | | | | | | | | End of split % 201.39/27.90 | | | | | | | | % 201.39/27.90 | | | | | | | End of split % 201.39/27.90 | | | | | | | % 201.39/27.90 | | | | | | Case 2: % 201.39/27.90 | | | | | | | % 201.39/27.90 | | | | | | | (774) mem(tree, all_101_1, all_101_16) % 201.39/27.90 | | | | | | | % 201.39/27.90 | | | | | | | PRED_UNIFY: (702), (774) imply: % 201.39/27.90 | | | | | | | (775) $false % 201.39/27.90 | | | | | | | % 201.39/27.90 | | | | | | | CLOSE: (775) is inconsistent. % 201.39/27.90 | | | | | | | % 201.39/27.90 | | | | | | End of split % 201.39/27.90 | | | | | | % 201.39/27.90 | | | | | End of split % 201.39/27.90 | | | | | % 201.39/27.90 | | | | End of split % 201.39/27.90 | | | | % 201.39/27.90 | | | Case 2: % 201.39/27.90 | | | | % 201.39/27.90 | | | | (776) ? [v0: int] : ( ~ ($difference($sum(v0, all_101_18), % 201.39/27.90 | | | | all_101_24) = -1) & size1(empty1) = v0) % 201.39/27.90 | | | | % 201.39/27.90 | | | | DELTA: instantiating (776) with fresh symbol all_261_0 gives: % 201.39/27.90 | | | | (777) ~ ($difference($sum(all_261_0, all_101_18), all_101_24) = -1) % 201.39/27.90 | | | | & size1(empty1) = all_261_0 % 201.39/27.90 | | | | % 201.39/27.90 | | | | ALPHA: (777) implies: % 201.39/27.90 | | | | (778) ~ ($difference($sum(all_261_0, all_101_18), all_101_24) = -1) % 201.39/27.90 | | | | (779) size1(empty1) = all_261_0 % 201.39/27.90 | | | | % 201.39/27.90 | | | | REDUCE: (532), (778) imply: % 201.39/27.90 | | | | (780) ~ (all_261_0 = 0) % 201.39/27.91 | | | | % 201.39/27.91 | | | | GROUND_INST: instantiating (22) with 0, all_261_0, empty1, simplifying % 201.39/27.91 | | | | with (4), (779) gives: % 201.39/27.91 | | | | (781) all_261_0 = 0 % 201.39/27.91 | | | | % 201.39/27.91 | | | | REDUCE: (780), (781) imply: % 201.39/27.91 | | | | (782) $false % 201.39/27.91 | | | | % 201.39/27.91 | | | | CLOSE: (782) is inconsistent. % 201.39/27.91 | | | | % 201.39/27.91 | | | End of split % 201.39/27.91 | | | % 201.39/27.91 | | End of split % 201.39/27.91 | | % 201.39/27.91 | End of split % 201.39/27.91 | % 201.39/27.91 End of proof % 201.39/27.91 % SZS output end Proof for theBenchmark % 201.39/27.91 % 201.39/27.91 27288ms %------------------------------------------------------------------------------