TSTP Solution File: SWW678_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWW678_1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n008.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:51:06 EDT 2023
% Result : Theorem 12.63s 2.63s
% Output : Proof 21.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW678_1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun Aug 27 18:58:32 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.62 ________ _____
% 0.17/0.62 ___ __ \_________(_)________________________________
% 0.17/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.17/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.17/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.17/0.62
% 0.17/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.62 (2023-06-19)
% 0.17/0.62
% 0.17/0.62 (c) Philipp Rümmer, 2009-2023
% 0.17/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.62 Amanda Stjerna.
% 0.17/0.62 Free software under BSD-3-Clause.
% 0.17/0.62
% 0.17/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.62
% 0.17/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.17/0.64 Running up to 7 provers in parallel.
% 0.17/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.17/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.17/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.17/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.17/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.17/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.17/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.84/1.21 Prover 1: Preprocessing ...
% 2.84/1.22 Prover 4: Preprocessing ...
% 3.36/1.26 Prover 2: Preprocessing ...
% 3.36/1.26 Prover 5: Preprocessing ...
% 3.36/1.26 Prover 3: Preprocessing ...
% 3.36/1.26 Prover 0: Preprocessing ...
% 3.36/1.26 Prover 6: Preprocessing ...
% 6.20/1.72 Prover 1: Constructing countermodel ...
% 6.20/1.75 Prover 3: Constructing countermodel ...
% 6.89/1.77 Prover 6: Proving ...
% 7.33/1.90 Prover 5: Proving ...
% 7.33/1.90 Prover 0: Proving ...
% 7.77/1.91 Prover 4: Constructing countermodel ...
% 7.77/1.96 Prover 2: Proving ...
% 12.63/2.62 Prover 0: proved (1967ms)
% 12.63/2.63
% 12.63/2.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.63/2.63
% 12.63/2.64 Prover 3: stopped
% 12.63/2.64 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 12.63/2.64 Prover 5: stopped
% 12.63/2.64 Prover 2: stopped
% 12.63/2.64 Prover 6: stopped
% 12.63/2.65 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 12.63/2.65 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 12.63/2.65 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 12.63/2.66 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.01/2.72 Prover 7: Preprocessing ...
% 13.41/2.78 Prover 10: Preprocessing ...
% 13.49/2.79 Prover 8: Preprocessing ...
% 13.49/2.79 Prover 13: Preprocessing ...
% 13.49/2.80 Prover 11: Preprocessing ...
% 13.49/2.87 Prover 8: Warning: ignoring some quantifiers
% 13.49/2.88 Prover 8: Constructing countermodel ...
% 13.49/2.92 Prover 10: Warning: ignoring some quantifiers
% 13.49/2.92 Prover 13: Warning: ignoring some quantifiers
% 13.49/2.92 Prover 10: Constructing countermodel ...
% 13.49/2.93 Prover 13: Constructing countermodel ...
% 13.49/3.03 Prover 7: Warning: ignoring some quantifiers
% 13.49/3.03 Prover 11: Constructing countermodel ...
% 13.49/3.03 Prover 10: gave up
% 13.49/3.05 Prover 7: Constructing countermodel ...
% 15.04/3.06 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 15.52/3.12 Prover 16: Preprocessing ...
% 15.52/3.15 Prover 8: gave up
% 16.16/3.17 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 16.37/3.20 Prover 16: Warning: ignoring some quantifiers
% 16.37/3.21 Prover 16: Constructing countermodel ...
% 16.37/3.22 Prover 19: Preprocessing ...
% 17.79/3.43 Prover 7: gave up
% 17.79/3.44 Prover 19: Warning: ignoring some quantifiers
% 17.79/3.45 Prover 19: Constructing countermodel ...
% 18.92/3.69 Prover 4: Found proof (size 334)
% 18.92/3.69 Prover 4: proved (3029ms)
% 18.92/3.69 Prover 16: stopped
% 18.92/3.69 Prover 1: stopped
% 18.92/3.69 Prover 19: stopped
% 18.92/3.69 Prover 11: stopped
% 18.92/3.70 Prover 13: stopped
% 18.92/3.70
% 18.92/3.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.92/3.70
% 19.87/3.76 % SZS output start Proof for theBenchmark
% 19.87/3.77 Assumptions after simplification:
% 19.87/3.77 ---------------------------------
% 19.87/3.77
% 19.87/3.77 (formula)
% 20.53/3.81 Tree(empty:Tree) & ! [v0: Tree] : ! [v1: int] : (v0 = empty:Tree | ~
% 20.53/3.81 (val:(Tree)>Int(v0) = v1) | ~ Tree(v0) | ? [v2: Tree] : ? [v3: Tree] :
% 20.53/3.81 (left:(Tree)>Tree(v0) = v2 & right:(Tree)>Tree(v0) = v3 &
% 20.53/3.81 node:(Int*Tree*Tree)>Tree(v1, v2, v3) = v0 & Tree(v3) & Tree(v2))) & !
% 20.53/3.81 [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~ (left:(Tree)>Tree(v0) = v1)
% 20.53/3.81 | ~ Tree(v0) | ? [v2: int] : ? [v3: Tree] : (val:(Tree)>Int(v0) = v2 &
% 20.53/3.81 right:(Tree)>Tree(v0) = v3 & node:(Int*Tree*Tree)>Tree(v2, v1, v3) = v0 &
% 20.53/3.81 Tree(v3))) & ! [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~
% 20.53/3.81 (right:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: int] : ? [v3: Tree] :
% 20.53/3.81 (val:(Tree)>Int(v0) = v2 & left:(Tree)>Tree(v0) = v3 &
% 20.53/3.81 node:(Int*Tree*Tree)>Tree(v2, v3, v1) = v0 & Tree(v3)))
% 20.53/3.81
% 20.53/3.81 (formula_005)
% 20.53/3.83 Tree(empty:Tree) & ! [v0: int] : ! [v1: Tree] : ! [v2: Tree] : ! [v3: any]
% 20.53/3.83 : (v1 = empty:Tree | ~ (in(v0, v2) = v3) | ~ (left:(Tree)>Tree(v1) = v2) |
% 20.53/3.83 ~ Tree(v1) | ? [v4: int] : ? [v5: Tree] : ? [v6: any] : ? [v7: any] :
% 20.53/3.83 (in(v0, v5) = v6 & in(v0, v1) = v7 & val:(Tree)>Int(v1) = v4 &
% 20.53/3.83 right:(Tree)>Tree(v1) = v5 & Tree(v5) & (v7 = 0 | ( ~ (v6 = 0) & ~ (v4 =
% 20.53/3.83 v0) & ~ (v3 = 0))))) & ! [v0: int] : ! [v1: Tree] : ! [v2: Tree]
% 20.53/3.83 : ! [v3: any] : (v1 = empty:Tree | ~ (in(v0, v2) = v3) | ~
% 20.53/3.83 (right:(Tree)>Tree(v1) = v2) | ~ Tree(v1) | ? [v4: int] : ? [v5: Tree] :
% 20.53/3.83 ? [v6: any] : ? [v7: any] : (in(v0, v5) = v6 & in(v0, v1) = v7 &
% 20.53/3.83 val:(Tree)>Int(v1) = v4 & left:(Tree)>Tree(v1) = v5 & Tree(v5) & (v7 = 0 |
% 20.53/3.83 ( ~ (v6 = 0) & ~ (v4 = v0) & ~ (v3 = 0))))) & ! [v0: int] : ! [v1:
% 20.53/3.83 Tree] : ! [v2: Tree] : ! [v3: any] : ( ~ (in(v0, v2) = v3) | ~
% 20.53/3.83 (left:(Tree)>Tree(v1) = v2) | ~ Tree(v1) | ? [v4: any] : ? [v5: int] : ?
% 20.53/3.83 [v6: Tree] : ? [v7: any] : (in(v0, v6) = v7 & in(v0, v1) = v4 &
% 20.53/3.83 val:(Tree)>Int(v1) = v5 & right:(Tree)>Tree(v1) = v6 & Tree(v6) & ( ~ (v4
% 20.53/3.83 = 0) | ( ~ (v1 = empty:Tree) & (v7 = 0 | v5 = v0 | v3 = 0))))) & !
% 20.53/3.83 [v0: int] : ! [v1: Tree] : ! [v2: Tree] : ! [v3: any] : ( ~ (in(v0, v2) =
% 20.53/3.83 v3) | ~ (right:(Tree)>Tree(v1) = v2) | ~ Tree(v1) | ? [v4: any] : ?
% 20.53/3.83 [v5: int] : ? [v6: Tree] : ? [v7: any] : (in(v0, v6) = v7 & in(v0, v1) =
% 20.53/3.83 v4 & val:(Tree)>Int(v1) = v5 & left:(Tree)>Tree(v1) = v6 & Tree(v6) & ( ~
% 20.53/3.83 (v4 = 0) | ( ~ (v1 = empty:Tree) & (v7 = 0 | v5 = v0 | v3 = 0))))) & !
% 20.53/3.83 [v0: int] : ! [v1: Tree] : ! [v2: int] : (v2 = 0 | v1 = empty:Tree | ~
% 20.53/3.83 (in(v0, v1) = v2) | ~ Tree(v1) | ? [v3: int] : ? [v4: Tree] : ? [v5:
% 20.53/3.83 int] : ? [v6: Tree] : ? [v7: int] : ( ~ (v7 = 0) & ~ (v5 = 0) & ~ (v3
% 20.53/3.83 = v0) & in(v0, v6) = v7 & in(v0, v4) = v5 & val:(Tree)>Int(v1) = v3 &
% 20.53/3.83 left:(Tree)>Tree(v1) = v4 & right:(Tree)>Tree(v1) = v6 & Tree(v6) &
% 20.53/3.83 Tree(v4))) & ! [v0: int] : ! [v1: Tree] : (v1 = empty:Tree | ~ (in(v0,
% 20.53/3.83 v1) = 0) | ~ Tree(v1) | ? [v2: int] : ? [v3: Tree] : ? [v4: any] :
% 20.53/3.83 ? [v5: Tree] : ? [v6: any] : (in(v0, v5) = v6 & in(v0, v3) = v4 &
% 20.53/3.83 val:(Tree)>Int(v1) = v2 & left:(Tree)>Tree(v1) = v3 &
% 20.53/3.83 right:(Tree)>Tree(v1) = v5 & Tree(v5) & Tree(v3) & (v6 = 0 | v4 = 0 | v2 =
% 20.53/3.83 v0))) & ! [v0: int] : ~ (in(v0, empty:Tree) = 0)
% 20.53/3.83
% 20.53/3.83 (formula_006)
% 20.84/3.86 Tree(empty:Tree) & ! [v0: Tree] : ! [v1: int] : (v1 = 0 | ~ (searchtree(v0)
% 20.84/3.86 = v1) | ~ Tree(v0) | ? [v2: Tree] : ? [v3: any] : ? [v4: Tree] : ?
% 20.84/3.86 [v5: any] : ? [v6: int] : ? [v7: int] : ? [v8: int] : (searchtree(v4) =
% 20.84/3.86 v5 & searchtree(v2) = v3 & val:(Tree)>Int(v0) = v6 & left:(Tree)>Tree(v0)
% 20.84/3.86 = v2 & right:(Tree)>Tree(v0) = v4 & Tree(v4) & Tree(v2) & ( ~ (v5 = 0) |
% 20.84/3.86 ~ (v3 = 0) | (v8 = 0 & $lesseq(v7, v6) & in(v7, v4) = 0) | (v8 = 0 &
% 20.84/3.86 $lesseq(1, $difference(v7, v6)) & in(v7, v2) = 0)))) & ! [v0: Tree] :
% 20.84/3.86 ! [v1: int] : (v0 = empty:Tree | ~ (val:(Tree)>Int(v0) = v1) | ~ Tree(v0) |
% 20.84/3.86 ? [v2: any] : ? [v3: Tree] : ? [v4: any] : ? [v5: Tree] : ? [v6: any] :
% 20.84/3.86 (searchtree(v5) = v6 & searchtree(v3) = v4 & searchtree(v0) = v2 &
% 20.84/3.86 left:(Tree)>Tree(v0) = v3 & right:(Tree)>Tree(v0) = v5 & Tree(v5) &
% 20.84/3.86 Tree(v3) & ( ~ (v2 = 0) | (v6 = 0 & v4 = 0 & ! [v7: int] : ( ~
% 20.84/3.86 ($lesseq(v7, v1)) | ~ (in(v7, v5) = 0)) & ! [v7: int] : ( ~
% 20.84/3.86 ($lesseq(1, $difference(v7, v1))) | ~ (in(v7, v3) = 0)))))) & !
% 20.84/3.86 [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~ (left:(Tree)>Tree(v0) = v1)
% 20.84/3.86 | ~ Tree(v0) | ? [v2: any] : ? [v3: any] : ? [v4: Tree] : ? [v5: any] :
% 20.84/3.86 ? [v6: int] : (searchtree(v4) = v5 & searchtree(v1) = v3 & searchtree(v0) =
% 20.84/3.86 v2 & val:(Tree)>Int(v0) = v6 & right:(Tree)>Tree(v0) = v4 & Tree(v4) & ( ~
% 20.84/3.86 (v2 = 0) | (v5 = 0 & v3 = 0 & ! [v7: int] : ( ~ ($lesseq(v7, v6)) | ~
% 20.84/3.86 (in(v7, v4) = 0)) & ! [v7: int] : ( ~ ($lesseq(1, $difference(v7,
% 20.84/3.86 v6))) | ~ (in(v7, v1) = 0)))))) & ! [v0: Tree] : ! [v1:
% 20.84/3.86 Tree] : (v0 = empty:Tree | ~ (right:(Tree)>Tree(v0) = v1) | ~ Tree(v0) |
% 20.84/3.86 ? [v2: any] : ? [v3: Tree] : ? [v4: any] : ? [v5: any] : ? [v6: int] :
% 20.84/3.86 (searchtree(v3) = v4 & searchtree(v1) = v5 & searchtree(v0) = v2 &
% 20.84/3.86 val:(Tree)>Int(v0) = v6 & left:(Tree)>Tree(v0) = v3 & Tree(v3) & ( ~ (v2 =
% 20.84/3.86 0) | (v5 = 0 & v4 = 0 & ! [v7: int] : ( ~ ($lesseq(v7, v6)) | ~
% 20.84/3.86 (in(v7, v1) = 0)) & ! [v7: int] : ( ~ ($lesseq(1, $difference(v7,
% 20.84/3.86 v6))) | ~ (in(v7, v3) = 0)))))) & ! [v0: Tree] : ! [v1:
% 20.84/3.86 int] : ( ~ (val:(Tree)>Int(v0) = v1) | ~ Tree(v0) | ? [v2: Tree] : ? [v3:
% 20.84/3.86 any] : ? [v4: Tree] : ? [v5: any] : ? [v6: any] : ? [v7: int] : ?
% 20.84/3.86 [v8: int] : (searchtree(v4) = v5 & searchtree(v2) = v3 & searchtree(v0) = v6
% 20.84/3.86 & left:(Tree)>Tree(v0) = v2 & right:(Tree)>Tree(v0) = v4 & Tree(v4) &
% 20.84/3.86 Tree(v2) & (v6 = 0 | ( ~ (v0 = empty:Tree) & ( ~ (v5 = 0) | ~ (v3 = 0) |
% 20.84/3.86 (v8 = 0 & $lesseq(v7, v1) & in(v7, v4) = 0) | (v8 = 0 & $lesseq(1,
% 20.84/3.86 $difference(v7, v1)) & in(v7, v2) = 0)))))) & ! [v0: Tree] : !
% 20.84/3.86 [v1: Tree] : ( ~ (left:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: any] : ?
% 20.84/3.86 [v3: Tree] : ? [v4: any] : ? [v5: int] : ? [v6: any] : ? [v7: int] : ?
% 20.84/3.86 [v8: int] : (searchtree(v3) = v4 & searchtree(v1) = v2 & searchtree(v0) = v6
% 20.84/3.86 & val:(Tree)>Int(v0) = v5 & right:(Tree)>Tree(v0) = v3 & Tree(v3) & (v6 =
% 20.84/3.86 0 | ( ~ (v0 = empty:Tree) & ( ~ (v4 = 0) | ~ (v2 = 0) | (v8 = 0 &
% 20.84/3.86 $lesseq(v7, v5) & in(v7, v3) = 0) | (v8 = 0 & $lesseq(1,
% 20.84/3.86 $difference(v7, v5)) & in(v7, v1) = 0)))))) & ! [v0: Tree] : !
% 20.84/3.86 [v1: Tree] : ( ~ (right:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: Tree] :
% 20.84/3.86 ? [v3: any] : ? [v4: any] : ? [v5: int] : ? [v6: any] : ? [v7: int] : ?
% 20.84/3.86 [v8: int] : (searchtree(v2) = v3 & searchtree(v1) = v4 & searchtree(v0) = v6
% 20.84/3.86 & val:(Tree)>Int(v0) = v5 & left:(Tree)>Tree(v0) = v2 & Tree(v2) & (v6 = 0
% 20.84/3.86 | ( ~ (v0 = empty:Tree) & ( ~ (v4 = 0) | ~ (v3 = 0) | (v8 = 0 &
% 20.84/3.86 $lesseq(v7, v5) & in(v7, v1) = 0) | (v8 = 0 & $lesseq(1,
% 20.84/3.86 $difference(v7, v5)) & in(v7, v2) = 0)))))) & ! [v0: Tree] :
% 20.84/3.86 (v0 = empty:Tree | ~ (searchtree(v0) = 0) | ~ Tree(v0) | ? [v1: Tree] : ?
% 20.84/3.86 [v2: Tree] : ? [v3: int] : (searchtree(v2) = 0 & searchtree(v1) = 0 &
% 20.84/3.86 val:(Tree)>Int(v0) = v3 & left:(Tree)>Tree(v0) = v1 &
% 20.84/3.86 right:(Tree)>Tree(v0) = v2 & Tree(v2) & Tree(v1) & ! [v4: int] : ( ~
% 20.84/3.86 ($lesseq(v4, v3)) | ~ (in(v4, v2) = 0)) & ! [v4: int] : ( ~
% 20.84/3.86 ($lesseq(1, $difference(v4, v3))) | ~ (in(v4, v1) = 0)))) & ! [v0:
% 20.84/3.86 int] : (v0 = 0 | ~ (searchtree(empty:Tree) = v0))
% 20.84/3.86
% 20.84/3.86 (formula_007)
% 20.84/3.87 Tree(empty:Tree) & ? [v0: Tree] : ? [v1: int] : ? [v2: int] : ? [v3: Tree]
% 20.84/3.87 : ? [v4: Tree] : ? [v5: any] : ? [v6: Tree] : ? [v7: int] : ? [v8: Tree]
% 20.84/3.87 : ? [v9: int] : (searchtree(v0) = 0 & in(v1, v0) = v5 & val:(Tree)>Int(v0) =
% 20.84/3.87 v2 & left:(Tree)>Tree(v0) = v3 & right:(Tree)>Tree(v0) = v4 & Tree(v8) &
% 20.84/3.87 Tree(v6) & Tree(v4) & Tree(v3) & Tree(v0) & ((v5 = 0 & (v0 = empty:Tree | (
% 20.84/3.87 ~ (v2 = v1) & (($lesseq(1, $difference(v1, v2)) & ~ (in(v1, v4) =
% 20.84/3.87 0)) | ($lesseq(1, $difference(v2, v1)) & ~ (in(v1, v3) =
% 20.84/3.87 0)))))) | ( ~ (v5 = 0) & ~ (v0 = empty:Tree) & (v2 = v1 | ((
% 20.84/3.87 ~ ($lesseq(1, $difference(v1, v2))) | (v7 = 0 & v6 = v4 & in(v1,
% 20.84/3.87 v4) = 0)) & ( ~ ($lesseq(1, $difference(v2, v1))) | (v9 = 0 &
% 20.84/3.87 v8 = v3 & in(v1, v3) = 0)))))))
% 20.84/3.87
% 20.84/3.87 (function-axioms)
% 20.84/3.87 ! [v0: Tree] : ! [v1: Tree] : ! [v2: Tree] : ! [v3: Tree] : ! [v4: int] :
% 20.84/3.87 (v1 = v0 | ~ (node:(Int*Tree*Tree)>Tree(v4, v3, v2) = v1) | ~
% 20.84/3.87 (node:(Int*Tree*Tree)>Tree(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] :
% 20.84/3.87 ! [v1: MultipleValueBool] : ! [v2: Tree] : ! [v3: int] : (v1 = v0 | ~
% 20.84/3.87 (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 20.84/3.87 [v1: MultipleValueBool] : ! [v2: Tree] : (v1 = v0 | ~ (searchtree(v2) = v1)
% 20.84/3.87 | ~ (searchtree(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: Tree] :
% 20.84/3.87 (v1 = v0 | ~ (val:(Tree)>Int(v2) = v1) | ~ (val:(Tree)>Int(v2) = v0)) & !
% 20.84/3.87 [v0: Tree] : ! [v1: Tree] : ! [v2: Tree] : (v1 = v0 | ~
% 20.84/3.87 (left:(Tree)>Tree(v2) = v1) | ~ (left:(Tree)>Tree(v2) = v0)) & ! [v0:
% 20.84/3.87 Tree] : ! [v1: Tree] : ! [v2: Tree] : (v1 = v0 | ~ (right:(Tree)>Tree(v2)
% 20.84/3.87 = v1) | ~ (right:(Tree)>Tree(v2) = v0))
% 20.84/3.87
% 20.84/3.87 Further assumptions not needed in the proof:
% 20.84/3.87 --------------------------------------------
% 20.84/3.87 formula_001, formula_002, formula_003, formula_004
% 20.84/3.87
% 20.84/3.87 Those formulas are unsatisfiable:
% 20.84/3.87 ---------------------------------
% 20.84/3.87
% 20.84/3.87 Begin of proof
% 20.84/3.87 |
% 20.84/3.87 | ALPHA: (formula) implies:
% 20.84/3.88 | (1) ! [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~
% 20.84/3.88 | (right:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: int] : ? [v3:
% 20.84/3.88 | Tree] : (val:(Tree)>Int(v0) = v2 & left:(Tree)>Tree(v0) = v3 &
% 20.84/3.88 | node:(Int*Tree*Tree)>Tree(v2, v3, v1) = v0 & Tree(v3)))
% 20.84/3.88 | (2) ! [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~
% 20.84/3.88 | (left:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: int] : ? [v3:
% 20.84/3.88 | Tree] : (val:(Tree)>Int(v0) = v2 & right:(Tree)>Tree(v0) = v3 &
% 20.84/3.88 | node:(Int*Tree*Tree)>Tree(v2, v1, v3) = v0 & Tree(v3)))
% 20.84/3.88 | (3) ! [v0: Tree] : ! [v1: int] : (v0 = empty:Tree | ~
% 20.84/3.88 | (val:(Tree)>Int(v0) = v1) | ~ Tree(v0) | ? [v2: Tree] : ? [v3:
% 20.84/3.88 | Tree] : (left:(Tree)>Tree(v0) = v2 & right:(Tree)>Tree(v0) = v3 &
% 20.84/3.88 | node:(Int*Tree*Tree)>Tree(v1, v2, v3) = v0 & Tree(v3) & Tree(v2)))
% 20.84/3.88 |
% 20.84/3.88 | ALPHA: (formula_005) implies:
% 20.84/3.88 | (4) ! [v0: int] : ~ (in(v0, empty:Tree) = 0)
% 20.84/3.88 | (5) ! [v0: int] : ! [v1: Tree] : (v1 = empty:Tree | ~ (in(v0, v1) = 0) |
% 20.84/3.88 | ~ Tree(v1) | ? [v2: int] : ? [v3: Tree] : ? [v4: any] : ? [v5:
% 20.84/3.88 | Tree] : ? [v6: any] : (in(v0, v5) = v6 & in(v0, v3) = v4 &
% 20.84/3.88 | val:(Tree)>Int(v1) = v2 & left:(Tree)>Tree(v1) = v3 &
% 20.84/3.88 | right:(Tree)>Tree(v1) = v5 & Tree(v5) & Tree(v3) & (v6 = 0 | v4 = 0
% 20.84/3.88 | | v2 = v0)))
% 20.84/3.88 | (6) ! [v0: int] : ! [v1: Tree] : ! [v2: int] : (v2 = 0 | v1 = empty:Tree
% 20.84/3.88 | | ~ (in(v0, v1) = v2) | ~ Tree(v1) | ? [v3: int] : ? [v4: Tree] :
% 20.84/3.88 | ? [v5: int] : ? [v6: Tree] : ? [v7: int] : ( ~ (v7 = 0) & ~ (v5 =
% 20.84/3.88 | 0) & ~ (v3 = v0) & in(v0, v6) = v7 & in(v0, v4) = v5 &
% 20.84/3.88 | val:(Tree)>Int(v1) = v3 & left:(Tree)>Tree(v1) = v4 &
% 20.84/3.88 | right:(Tree)>Tree(v1) = v6 & Tree(v6) & Tree(v4)))
% 20.84/3.89 | (7) ! [v0: int] : ! [v1: Tree] : ! [v2: Tree] : ! [v3: any] : ( ~
% 20.84/3.89 | (in(v0, v2) = v3) | ~ (right:(Tree)>Tree(v1) = v2) | ~ Tree(v1) |
% 20.84/3.89 | ? [v4: any] : ? [v5: int] : ? [v6: Tree] : ? [v7: any] : (in(v0,
% 20.84/3.89 | v6) = v7 & in(v0, v1) = v4 & val:(Tree)>Int(v1) = v5 &
% 20.84/3.89 | left:(Tree)>Tree(v1) = v6 & Tree(v6) & ( ~ (v4 = 0) | ( ~ (v1 =
% 20.84/3.89 | empty:Tree) & (v7 = 0 | v5 = v0 | v3 = 0)))))
% 20.84/3.89 | (8) ! [v0: int] : ! [v1: Tree] : ! [v2: Tree] : ! [v3: any] : ( ~
% 20.84/3.89 | (in(v0, v2) = v3) | ~ (left:(Tree)>Tree(v1) = v2) | ~ Tree(v1) | ?
% 20.84/3.89 | [v4: any] : ? [v5: int] : ? [v6: Tree] : ? [v7: any] : (in(v0, v6)
% 20.84/3.89 | = v7 & in(v0, v1) = v4 & val:(Tree)>Int(v1) = v5 &
% 20.84/3.89 | right:(Tree)>Tree(v1) = v6 & Tree(v6) & ( ~ (v4 = 0) | ( ~ (v1 =
% 20.84/3.89 | empty:Tree) & (v7 = 0 | v5 = v0 | v3 = 0)))))
% 20.84/3.89 |
% 20.84/3.89 | ALPHA: (formula_006) implies:
% 20.84/3.89 | (9) ! [v0: Tree] : (v0 = empty:Tree | ~ (searchtree(v0) = 0) | ~
% 20.84/3.89 | Tree(v0) | ? [v1: Tree] : ? [v2: Tree] : ? [v3: int] :
% 20.84/3.89 | (searchtree(v2) = 0 & searchtree(v1) = 0 & val:(Tree)>Int(v0) = v3 &
% 20.84/3.89 | left:(Tree)>Tree(v0) = v1 & right:(Tree)>Tree(v0) = v2 & Tree(v2) &
% 20.84/3.89 | Tree(v1) & ! [v4: int] : ( ~ ($lesseq(v4, v3)) | ~ (in(v4, v2) =
% 20.84/3.89 | 0)) & ! [v4: int] : ( ~ ($lesseq(1, $difference(v4, v3))) | ~
% 20.84/3.89 | (in(v4, v1) = 0))))
% 20.84/3.90 | (10) ! [v0: Tree] : ! [v1: Tree] : ( ~ (right:(Tree)>Tree(v0) = v1) | ~
% 20.84/3.90 | Tree(v0) | ? [v2: Tree] : ? [v3: any] : ? [v4: any] : ? [v5:
% 20.84/3.90 | int] : ? [v6: any] : ? [v7: int] : ? [v8: int] :
% 20.84/3.90 | (searchtree(v2) = v3 & searchtree(v1) = v4 & searchtree(v0) = v6 &
% 20.84/3.90 | val:(Tree)>Int(v0) = v5 & left:(Tree)>Tree(v0) = v2 & Tree(v2) &
% 20.84/3.90 | (v6 = 0 | ( ~ (v0 = empty:Tree) & ( ~ (v4 = 0) | ~ (v3 = 0) | (v8
% 20.84/3.90 | = 0 & $lesseq(v7, v5) & in(v7, v1) = 0) | (v8 = 0 &
% 20.84/3.90 | $lesseq(1, $difference(v7, v5)) & in(v7, v2) = 0))))))
% 20.84/3.90 | (11) ! [v0: Tree] : ! [v1: Tree] : ( ~ (left:(Tree)>Tree(v0) = v1) | ~
% 20.84/3.90 | Tree(v0) | ? [v2: any] : ? [v3: Tree] : ? [v4: any] : ? [v5:
% 20.84/3.90 | int] : ? [v6: any] : ? [v7: int] : ? [v8: int] :
% 20.84/3.90 | (searchtree(v3) = v4 & searchtree(v1) = v2 & searchtree(v0) = v6 &
% 20.84/3.90 | val:(Tree)>Int(v0) = v5 & right:(Tree)>Tree(v0) = v3 & Tree(v3) &
% 20.84/3.90 | (v6 = 0 | ( ~ (v0 = empty:Tree) & ( ~ (v4 = 0) | ~ (v2 = 0) | (v8
% 20.84/3.90 | = 0 & $lesseq(v7, v5) & in(v7, v3) = 0) | (v8 = 0 &
% 20.84/3.90 | $lesseq(1, $difference(v7, v5)) & in(v7, v1) = 0))))))
% 21.05/3.90 | (12) ! [v0: Tree] : ! [v1: int] : ( ~ (val:(Tree)>Int(v0) = v1) | ~
% 21.05/3.90 | Tree(v0) | ? [v2: Tree] : ? [v3: any] : ? [v4: Tree] : ? [v5:
% 21.05/3.90 | any] : ? [v6: any] : ? [v7: int] : ? [v8: int] :
% 21.05/3.90 | (searchtree(v4) = v5 & searchtree(v2) = v3 & searchtree(v0) = v6 &
% 21.05/3.90 | left:(Tree)>Tree(v0) = v2 & right:(Tree)>Tree(v0) = v4 & Tree(v4)
% 21.05/3.90 | & Tree(v2) & (v6 = 0 | ( ~ (v0 = empty:Tree) & ( ~ (v5 = 0) | ~
% 21.05/3.90 | (v3 = 0) | (v8 = 0 & $lesseq(v7, v1) & in(v7, v4) = 0) | (v8
% 21.05/3.90 | = 0 & $lesseq(1, $difference(v7, v1)) & in(v7, v2) =
% 21.05/3.90 | 0))))))
% 21.05/3.90 | (13) ! [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~
% 21.05/3.90 | (right:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: any] : ? [v3:
% 21.05/3.90 | Tree] : ? [v4: any] : ? [v5: any] : ? [v6: int] :
% 21.05/3.90 | (searchtree(v3) = v4 & searchtree(v1) = v5 & searchtree(v0) = v2 &
% 21.05/3.90 | val:(Tree)>Int(v0) = v6 & left:(Tree)>Tree(v0) = v3 & Tree(v3) & (
% 21.05/3.90 | ~ (v2 = 0) | (v5 = 0 & v4 = 0 & ! [v7: int] : ( ~ ($lesseq(v7,
% 21.05/3.90 | v6)) | ~ (in(v7, v1) = 0)) & ! [v7: int] : ( ~
% 21.05/3.90 | ($lesseq(1, $difference(v7, v6))) | ~ (in(v7, v3) = 0))))))
% 21.05/3.91 | (14) ! [v0: Tree] : ! [v1: Tree] : (v0 = empty:Tree | ~
% 21.05/3.91 | (left:(Tree)>Tree(v0) = v1) | ~ Tree(v0) | ? [v2: any] : ? [v3:
% 21.05/3.91 | any] : ? [v4: Tree] : ? [v5: any] : ? [v6: int] :
% 21.05/3.91 | (searchtree(v4) = v5 & searchtree(v1) = v3 & searchtree(v0) = v2 &
% 21.05/3.91 | val:(Tree)>Int(v0) = v6 & right:(Tree)>Tree(v0) = v4 & Tree(v4) &
% 21.05/3.91 | ( ~ (v2 = 0) | (v5 = 0 & v3 = 0 & ! [v7: int] : ( ~ ($lesseq(v7,
% 21.05/3.91 | v6)) | ~ (in(v7, v4) = 0)) & ! [v7: int] : ( ~
% 21.05/3.91 | ($lesseq(1, $difference(v7, v6))) | ~ (in(v7, v1) = 0))))))
% 21.05/3.91 | (15) ! [v0: Tree] : ! [v1: int] : (v0 = empty:Tree | ~
% 21.05/3.91 | (val:(Tree)>Int(v0) = v1) | ~ Tree(v0) | ? [v2: any] : ? [v3:
% 21.05/3.91 | Tree] : ? [v4: any] : ? [v5: Tree] : ? [v6: any] :
% 21.05/3.91 | (searchtree(v5) = v6 & searchtree(v3) = v4 & searchtree(v0) = v2 &
% 21.05/3.91 | left:(Tree)>Tree(v0) = v3 & right:(Tree)>Tree(v0) = v5 & Tree(v5)
% 21.05/3.91 | & Tree(v3) & ( ~ (v2 = 0) | (v6 = 0 & v4 = 0 & ! [v7: int] : ( ~
% 21.05/3.91 | ($lesseq(v7, v1)) | ~ (in(v7, v5) = 0)) & ! [v7: int] : (
% 21.05/3.91 | ~ ($lesseq(1, $difference(v7, v1))) | ~ (in(v7, v3) =
% 21.05/3.91 | 0))))))
% 21.05/3.91 |
% 21.05/3.91 | ALPHA: (formula_007) implies:
% 21.05/3.91 | (16) ? [v0: Tree] : ? [v1: int] : ? [v2: int] : ? [v3: Tree] : ? [v4:
% 21.05/3.91 | Tree] : ? [v5: any] : ? [v6: Tree] : ? [v7: int] : ? [v8: Tree]
% 21.05/3.91 | : ? [v9: int] : (searchtree(v0) = 0 & in(v1, v0) = v5 &
% 21.05/3.91 | val:(Tree)>Int(v0) = v2 & left:(Tree)>Tree(v0) = v3 &
% 21.05/3.91 | right:(Tree)>Tree(v0) = v4 & Tree(v8) & Tree(v6) & Tree(v4) &
% 21.05/3.91 | Tree(v3) & Tree(v0) & ((v5 = 0 & (v0 = empty:Tree | ( ~ (v2 = v1) &
% 21.05/3.91 | (($lesseq(1, $difference(v1, v2)) & ~ (in(v1, v4) = 0)) |
% 21.05/3.91 | ($lesseq(1, $difference(v2, v1)) & ~ (in(v1, v3) =
% 21.05/3.91 | 0)))))) | ( ~ (v5 = 0) & ~ (v0 = empty:Tree) & (v2 =
% 21.05/3.91 | v1 | (( ~ ($lesseq(1, $difference(v1, v2))) | (v7 = 0 & v6 =
% 21.05/3.91 | v4 & in(v1, v4) = 0)) & ( ~ ($lesseq(1, $difference(v2,
% 21.05/3.91 | v1))) | (v9 = 0 & v8 = v3 & in(v1, v3) = 0)))))))
% 21.05/3.92 |
% 21.05/3.92 | ALPHA: (function-axioms) implies:
% 21.05/3.92 | (17) ! [v0: Tree] : ! [v1: Tree] : ! [v2: Tree] : (v1 = v0 | ~
% 21.05/3.92 | (right:(Tree)>Tree(v2) = v1) | ~ (right:(Tree)>Tree(v2) = v0))
% 21.05/3.92 | (18) ! [v0: Tree] : ! [v1: Tree] : ! [v2: Tree] : (v1 = v0 | ~
% 21.05/3.92 | (left:(Tree)>Tree(v2) = v1) | ~ (left:(Tree)>Tree(v2) = v0))
% 21.05/3.92 | (19) ! [v0: int] : ! [v1: int] : ! [v2: Tree] : (v1 = v0 | ~
% 21.05/3.92 | (val:(Tree)>Int(v2) = v1) | ~ (val:(Tree)>Int(v2) = v0))
% 21.05/3.92 | (20) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 21.05/3.92 | Tree] : (v1 = v0 | ~ (searchtree(v2) = v1) | ~ (searchtree(v2) =
% 21.05/3.92 | v0))
% 21.05/3.92 | (21) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 21.05/3.92 | Tree] : ! [v3: int] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3,
% 21.05/3.92 | v2) = v0))
% 21.05/3.92 |
% 21.05/3.92 | DELTA: instantiating (16) with fresh symbols all_13_0, all_13_1, all_13_2,
% 21.05/3.92 | all_13_3, all_13_4, all_13_5, all_13_6, all_13_7, all_13_8, all_13_9
% 21.05/3.92 | gives:
% 21.05/3.92 | (22) searchtree(all_13_9) = 0 & in(all_13_8, all_13_9) = all_13_4 &
% 21.05/3.92 | val:(Tree)>Int(all_13_9) = all_13_7 & left:(Tree)>Tree(all_13_9) =
% 21.05/3.92 | all_13_6 & right:(Tree)>Tree(all_13_9) = all_13_5 & Tree(all_13_1) &
% 21.05/3.92 | Tree(all_13_3) & Tree(all_13_5) & Tree(all_13_6) & Tree(all_13_9) &
% 21.05/3.92 | ((all_13_4 = 0 & (all_13_9 = empty:Tree | ( ~ (all_13_7 = all_13_8) &
% 21.05/3.92 | (($lesseq(1, $difference(all_13_8, all_13_7)) & ~
% 21.05/3.92 | (in(all_13_8, all_13_5) = 0)) | ($lesseq(1,
% 21.05/3.92 | $difference(all_13_7, all_13_8)) & ~ (in(all_13_8,
% 21.05/3.92 | all_13_6) = 0)))))) | ( ~ (all_13_4 = 0) & ~
% 21.05/3.92 | (all_13_9 = empty:Tree) & (all_13_7 = all_13_8 | (( ~ ($lesseq(1,
% 21.05/3.92 | $difference(all_13_8, all_13_7))) | (all_13_2 = 0 &
% 21.05/3.92 | all_13_3 = all_13_5 & in(all_13_8, all_13_5) = 0)) & ( ~
% 21.05/3.92 | ($lesseq(1, $difference(all_13_7, all_13_8))) | (all_13_0 =
% 21.05/3.92 | 0 & all_13_1 = all_13_6 & in(all_13_8, all_13_6) = 0))))))
% 21.05/3.92 |
% 21.05/3.92 | ALPHA: (22) implies:
% 21.05/3.92 | (23) Tree(all_13_9)
% 21.05/3.92 | (24) right:(Tree)>Tree(all_13_9) = all_13_5
% 21.05/3.92 | (25) left:(Tree)>Tree(all_13_9) = all_13_6
% 21.05/3.93 | (26) val:(Tree)>Int(all_13_9) = all_13_7
% 21.05/3.93 | (27) in(all_13_8, all_13_9) = all_13_4
% 21.05/3.93 | (28) searchtree(all_13_9) = 0
% 21.05/3.93 | (29) (all_13_4 = 0 & (all_13_9 = empty:Tree | ( ~ (all_13_7 = all_13_8) &
% 21.05/3.93 | (($lesseq(1, $difference(all_13_8, all_13_7)) & ~ (in(all_13_8,
% 21.05/3.93 | all_13_5) = 0)) | ($lesseq(1, $difference(all_13_7,
% 21.05/3.93 | all_13_8)) & ~ (in(all_13_8, all_13_6) = 0)))))) | ( ~
% 21.05/3.93 | (all_13_4 = 0) & ~ (all_13_9 = empty:Tree) & (all_13_7 = all_13_8 |
% 21.05/3.93 | (( ~ ($lesseq(1, $difference(all_13_8, all_13_7))) | (all_13_2 = 0
% 21.05/3.93 | & all_13_3 = all_13_5 & in(all_13_8, all_13_5) = 0)) & ( ~
% 21.05/3.93 | ($lesseq(1, $difference(all_13_7, all_13_8))) | (all_13_0 = 0
% 21.05/3.93 | & all_13_1 = all_13_6 & in(all_13_8, all_13_6) = 0)))))
% 21.05/3.93 |
% 21.05/3.93 | GROUND_INST: instantiating (13) with all_13_9, all_13_5, simplifying with
% 21.05/3.93 | (23), (24) gives:
% 21.05/3.93 | (30) all_13_9 = empty:Tree | ? [v0: any] : ? [v1: Tree] : ? [v2: any] :
% 21.05/3.93 | ? [v3: any] : ? [v4: int] : (searchtree(v1) = v2 &
% 21.05/3.93 | searchtree(all_13_5) = v3 & searchtree(all_13_9) = v0 &
% 21.05/3.93 | val:(Tree)>Int(all_13_9) = v4 & left:(Tree)>Tree(all_13_9) = v1 &
% 21.05/3.93 | Tree(v1) & ( ~ (v0 = 0) | (v3 = 0 & v2 = 0 & ! [v5: int] : ( ~
% 21.05/3.93 | ($lesseq(v5, v4)) | ~ (in(v5, all_13_5) = 0)) & ! [v5: int]
% 21.05/3.93 | : ( ~ ($lesseq(1, $difference(v5, v4))) | ~ (in(v5, v1) =
% 21.05/3.93 | 0)))))
% 21.05/3.93 |
% 21.05/3.93 | GROUND_INST: instantiating (1) with all_13_9, all_13_5, simplifying with (23),
% 21.05/3.93 | (24) gives:
% 21.05/3.94 | (31) all_13_9 = empty:Tree | ? [v0: int] : ? [v1: Tree] :
% 21.05/3.94 | (val:(Tree)>Int(all_13_9) = v0 & left:(Tree)>Tree(all_13_9) = v1 &
% 21.05/3.94 | node:(Int*Tree*Tree)>Tree(v0, v1, all_13_5) = all_13_9 & Tree(v1))
% 21.05/3.94 |
% 21.05/3.94 | GROUND_INST: instantiating (10) with all_13_9, all_13_5, simplifying with
% 21.05/3.94 | (23), (24) gives:
% 21.05/3.94 | (32) ? [v0: Tree] : ? [v1: any] : ? [v2: any] : ? [v3: int] : ? [v4:
% 21.05/3.94 | any] : ? [v5: int] : ? [v6: int] : (searchtree(v0) = v1 &
% 21.05/3.94 | searchtree(all_13_5) = v2 & searchtree(all_13_9) = v4 &
% 21.05/3.94 | val:(Tree)>Int(all_13_9) = v3 & left:(Tree)>Tree(all_13_9) = v0 &
% 21.05/3.94 | Tree(v0) & (v4 = 0 | ( ~ (all_13_9 = empty:Tree) & ( ~ (v2 = 0) | ~
% 21.05/3.94 | (v1 = 0) | (v6 = 0 & $lesseq(v5, v3) & in(v5, all_13_5) = 0) |
% 21.05/3.94 | (v6 = 0 & $lesseq(1, $difference(v5, v3)) & in(v5, v0) =
% 21.05/3.94 | 0)))))
% 21.05/3.94 |
% 21.05/3.94 | GROUND_INST: instantiating (14) with all_13_9, all_13_6, simplifying with
% 21.05/3.94 | (23), (25) gives:
% 21.25/3.94 | (33) all_13_9 = empty:Tree | ? [v0: any] : ? [v1: any] : ? [v2: Tree] :
% 21.25/3.94 | ? [v3: any] : ? [v4: int] : (searchtree(v2) = v3 &
% 21.25/3.94 | searchtree(all_13_6) = v1 & searchtree(all_13_9) = v0 &
% 21.25/3.94 | val:(Tree)>Int(all_13_9) = v4 & right:(Tree)>Tree(all_13_9) = v2 &
% 21.25/3.94 | Tree(v2) & ( ~ (v0 = 0) | (v3 = 0 & v1 = 0 & ! [v5: int] : ( ~
% 21.25/3.94 | ($lesseq(v5, v4)) | ~ (in(v5, v2) = 0)) & ! [v5: int] : ( ~
% 21.25/3.94 | ($lesseq(1, $difference(v5, v4))) | ~ (in(v5, all_13_6) =
% 21.25/3.94 | 0)))))
% 21.25/3.94 |
% 21.25/3.94 | GROUND_INST: instantiating (2) with all_13_9, all_13_6, simplifying with (23),
% 21.25/3.94 | (25) gives:
% 21.25/3.94 | (34) all_13_9 = empty:Tree | ? [v0: int] : ? [v1: Tree] :
% 21.25/3.94 | (val:(Tree)>Int(all_13_9) = v0 & right:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.94 | node:(Int*Tree*Tree)>Tree(v0, all_13_6, v1) = all_13_9 & Tree(v1))
% 21.25/3.94 |
% 21.25/3.94 | GROUND_INST: instantiating (11) with all_13_9, all_13_6, simplifying with
% 21.25/3.94 | (23), (25) gives:
% 21.25/3.94 | (35) ? [v0: any] : ? [v1: Tree] : ? [v2: any] : ? [v3: int] : ? [v4:
% 21.25/3.94 | any] : ? [v5: int] : ? [v6: int] : (searchtree(v1) = v2 &
% 21.25/3.94 | searchtree(all_13_6) = v0 & searchtree(all_13_9) = v4 &
% 21.25/3.94 | val:(Tree)>Int(all_13_9) = v3 & right:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.94 | Tree(v1) & (v4 = 0 | ( ~ (all_13_9 = empty:Tree) & ( ~ (v2 = 0) | ~
% 21.25/3.94 | (v0 = 0) | (v6 = 0 & $lesseq(v5, v3) & in(v5, v1) = 0) | (v6 =
% 21.25/3.94 | 0 & $lesseq(1, $difference(v5, v3)) & in(v5, all_13_6) =
% 21.25/3.94 | 0)))))
% 21.25/3.94 |
% 21.25/3.94 | GROUND_INST: instantiating (15) with all_13_9, all_13_7, simplifying with
% 21.25/3.94 | (23), (26) gives:
% 21.25/3.95 | (36) all_13_9 = empty:Tree | ? [v0: any] : ? [v1: Tree] : ? [v2: any] :
% 21.25/3.95 | ? [v3: Tree] : ? [v4: any] : (searchtree(v3) = v4 & searchtree(v1) =
% 21.25/3.95 | v2 & searchtree(all_13_9) = v0 & left:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.95 | right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) & Tree(v1) & ( ~ (v0 =
% 21.25/3.95 | 0) | (v4 = 0 & v2 = 0 & ! [v5: int] : ( ~ ($lesseq(v5,
% 21.25/3.95 | all_13_7)) | ~ (in(v5, v3) = 0)) & ! [v5: int] : ( ~
% 21.25/3.95 | ($lesseq(1, $difference(v5, all_13_7))) | ~ (in(v5, v1) =
% 21.25/3.95 | 0)))))
% 21.25/3.95 |
% 21.25/3.95 | GROUND_INST: instantiating (3) with all_13_9, all_13_7, simplifying with (23),
% 21.25/3.95 | (26) gives:
% 21.25/3.95 | (37) all_13_9 = empty:Tree | ? [v0: Tree] : ? [v1: Tree] :
% 21.25/3.95 | (left:(Tree)>Tree(all_13_9) = v0 & right:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.95 | node:(Int*Tree*Tree)>Tree(all_13_7, v0, v1) = all_13_9 & Tree(v1) &
% 21.25/3.95 | Tree(v0))
% 21.25/3.95 |
% 21.25/3.95 | GROUND_INST: instantiating (12) with all_13_9, all_13_7, simplifying with
% 21.25/3.95 | (23), (26) gives:
% 21.25/3.95 | (38) ? [v0: Tree] : ? [v1: any] : ? [v2: Tree] : ? [v3: any] : ? [v4:
% 21.25/3.95 | any] : ? [v5: int] : ? [v6: int] : (searchtree(v2) = v3 &
% 21.25/3.95 | searchtree(v0) = v1 & searchtree(all_13_9) = v4 &
% 21.25/3.95 | left:(Tree)>Tree(all_13_9) = v0 & right:(Tree)>Tree(all_13_9) = v2 &
% 21.25/3.95 | Tree(v2) & Tree(v0) & (v4 = 0 | ( ~ (all_13_9 = empty:Tree) & ( ~
% 21.25/3.95 | (v3 = 0) | ~ (v1 = 0) | (v6 = 0 & $lesseq(v5, all_13_7) &
% 21.25/3.95 | in(v5, v2) = 0) | (v6 = 0 & $lesseq(1, $difference(v5,
% 21.25/3.95 | all_13_7)) & in(v5, v0) = 0)))))
% 21.25/3.95 |
% 21.25/3.95 | GROUND_INST: instantiating (6) with all_13_8, all_13_9, all_13_4, simplifying
% 21.25/3.95 | with (23), (27) gives:
% 21.25/3.95 | (39) all_13_4 = 0 | all_13_9 = empty:Tree | ? [v0: int] : ? [v1: Tree] :
% 21.25/3.95 | ? [v2: int] : ? [v3: Tree] : ? [v4: int] : ( ~ (v4 = 0) & ~ (v2 =
% 21.25/3.95 | 0) & ~ (v0 = all_13_8) & in(all_13_8, v3) = v4 & in(all_13_8, v1)
% 21.25/3.95 | = v2 & val:(Tree)>Int(all_13_9) = v0 & left:(Tree)>Tree(all_13_9) =
% 21.25/3.95 | v1 & right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) & Tree(v1))
% 21.25/3.95 |
% 21.25/3.95 | GROUND_INST: instantiating (9) with all_13_9, simplifying with (23), (28)
% 21.25/3.95 | gives:
% 21.25/3.95 | (40) all_13_9 = empty:Tree | ? [v0: Tree] : ? [v1: Tree] : ? [v2: int] :
% 21.25/3.95 | (searchtree(v1) = 0 & searchtree(v0) = 0 & val:(Tree)>Int(all_13_9) =
% 21.25/3.95 | v2 & left:(Tree)>Tree(all_13_9) = v0 & right:(Tree)>Tree(all_13_9) =
% 21.25/3.95 | v1 & Tree(v1) & Tree(v0) & ! [v3: int] : ( ~ ($lesseq(v3, v2)) | ~
% 21.25/3.95 | (in(v3, v1) = 0)) & ! [v3: int] : ( ~ ($lesseq(1, $difference(v3,
% 21.25/3.95 | v2))) | ~ (in(v3, v0) = 0)))
% 21.25/3.95 |
% 21.25/3.95 | DELTA: instantiating (35) with fresh symbols all_20_0, all_20_1, all_20_2,
% 21.25/3.95 | all_20_3, all_20_4, all_20_5, all_20_6 gives:
% 21.25/3.95 | (41) searchtree(all_20_5) = all_20_4 & searchtree(all_13_6) = all_20_6 &
% 21.25/3.95 | searchtree(all_13_9) = all_20_2 & val:(Tree)>Int(all_13_9) = all_20_3
% 21.25/3.95 | & right:(Tree)>Tree(all_13_9) = all_20_5 & Tree(all_20_5) & (all_20_2
% 21.25/3.95 | = 0 | ( ~ (all_13_9 = empty:Tree) & ( ~ (all_20_4 = 0) | ~
% 21.25/3.95 | (all_20_6 = 0) | (all_20_0 = 0 & $lesseq(all_20_1, all_20_3) &
% 21.25/3.95 | in(all_20_1, all_20_5) = 0) | (all_20_0 = 0 & $lesseq(1,
% 21.25/3.95 | $difference(all_20_1, all_20_3)) & in(all_20_1, all_13_6) =
% 21.25/3.95 | 0))))
% 21.25/3.95 |
% 21.25/3.95 | ALPHA: (41) implies:
% 21.25/3.96 | (42) right:(Tree)>Tree(all_13_9) = all_20_5
% 21.25/3.96 | (43) val:(Tree)>Int(all_13_9) = all_20_3
% 21.25/3.96 | (44) searchtree(all_13_9) = all_20_2
% 21.25/3.96 |
% 21.25/3.96 | DELTA: instantiating (32) with fresh symbols all_22_0, all_22_1, all_22_2,
% 21.25/3.96 | all_22_3, all_22_4, all_22_5, all_22_6 gives:
% 21.25/3.96 | (45) searchtree(all_22_6) = all_22_5 & searchtree(all_13_5) = all_22_4 &
% 21.25/3.96 | searchtree(all_13_9) = all_22_2 & val:(Tree)>Int(all_13_9) = all_22_3
% 21.25/3.96 | & left:(Tree)>Tree(all_13_9) = all_22_6 & Tree(all_22_6) & (all_22_2 =
% 21.25/3.96 | 0 | ( ~ (all_13_9 = empty:Tree) & ( ~ (all_22_4 = 0) | ~ (all_22_5
% 21.25/3.96 | = 0) | (all_22_0 = 0 & $lesseq(all_22_1, all_22_3) &
% 21.25/3.96 | in(all_22_1, all_13_5) = 0) | (all_22_0 = 0 & $lesseq(1,
% 21.25/3.96 | $difference(all_22_1, all_22_3)) & in(all_22_1, all_22_6) =
% 21.25/3.96 | 0))))
% 21.25/3.96 |
% 21.25/3.96 | ALPHA: (45) implies:
% 21.25/3.96 | (46) left:(Tree)>Tree(all_13_9) = all_22_6
% 21.25/3.96 | (47) val:(Tree)>Int(all_13_9) = all_22_3
% 21.25/3.96 | (48) searchtree(all_13_9) = all_22_2
% 21.25/3.96 |
% 21.25/3.96 | DELTA: instantiating (38) with fresh symbols all_24_0, all_24_1, all_24_2,
% 21.25/3.96 | all_24_3, all_24_4, all_24_5, all_24_6 gives:
% 21.25/3.96 | (49) searchtree(all_24_4) = all_24_3 & searchtree(all_24_6) = all_24_5 &
% 21.25/3.96 | searchtree(all_13_9) = all_24_2 & left:(Tree)>Tree(all_13_9) =
% 21.25/3.96 | all_24_6 & right:(Tree)>Tree(all_13_9) = all_24_4 & Tree(all_24_4) &
% 21.25/3.96 | Tree(all_24_6) & (all_24_2 = 0 | ( ~ (all_13_9 = empty:Tree) & ( ~
% 21.25/3.96 | (all_24_3 = 0) | ~ (all_24_5 = 0) | (all_24_0 = 0 &
% 21.25/3.96 | $lesseq(all_24_1, all_13_7) & in(all_24_1, all_24_4) = 0) |
% 21.25/3.96 | (all_24_0 = 0 & $lesseq(1, $difference(all_24_1, all_13_7)) &
% 21.25/3.96 | in(all_24_1, all_24_6) = 0))))
% 21.25/3.96 |
% 21.25/3.96 | ALPHA: (49) implies:
% 21.25/3.96 | (50) right:(Tree)>Tree(all_13_9) = all_24_4
% 21.25/3.96 | (51) left:(Tree)>Tree(all_13_9) = all_24_6
% 21.25/3.96 | (52) searchtree(all_13_9) = all_24_2
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (17) with all_13_5, all_24_4, all_13_9, simplifying
% 21.25/3.96 | with (24), (50) gives:
% 21.25/3.96 | (53) all_24_4 = all_13_5
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (17) with all_20_5, all_24_4, all_13_9, simplifying
% 21.25/3.96 | with (42), (50) gives:
% 21.25/3.96 | (54) all_24_4 = all_20_5
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (18) with all_13_6, all_24_6, all_13_9, simplifying
% 21.25/3.96 | with (25), (51) gives:
% 21.25/3.96 | (55) all_24_6 = all_13_6
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (18) with all_22_6, all_24_6, all_13_9, simplifying
% 21.25/3.96 | with (46), (51) gives:
% 21.25/3.96 | (56) all_24_6 = all_22_6
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (19) with all_13_7, all_22_3, all_13_9, simplifying
% 21.25/3.96 | with (26), (47) gives:
% 21.25/3.96 | (57) all_22_3 = all_13_7
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (19) with all_20_3, all_22_3, all_13_9, simplifying
% 21.25/3.96 | with (43), (47) gives:
% 21.25/3.96 | (58) all_22_3 = all_20_3
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (20) with 0, all_22_2, all_13_9, simplifying with
% 21.25/3.96 | (28), (48) gives:
% 21.25/3.96 | (59) all_22_2 = 0
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (20) with all_22_2, all_24_2, all_13_9, simplifying
% 21.25/3.96 | with (48), (52) gives:
% 21.25/3.96 | (60) all_24_2 = all_22_2
% 21.25/3.96 |
% 21.25/3.96 | GROUND_INST: instantiating (20) with all_20_2, all_24_2, all_13_9, simplifying
% 21.25/3.96 | with (44), (52) gives:
% 21.25/3.96 | (61) all_24_2 = all_20_2
% 21.25/3.96 |
% 21.25/3.96 | COMBINE_EQS: (60), (61) imply:
% 21.25/3.96 | (62) all_22_2 = all_20_2
% 21.25/3.96 |
% 21.25/3.96 | SIMP: (62) implies:
% 21.25/3.96 | (63) all_22_2 = all_20_2
% 21.25/3.96 |
% 21.25/3.96 | COMBINE_EQS: (53), (54) imply:
% 21.25/3.96 | (64) all_20_5 = all_13_5
% 21.25/3.96 |
% 21.25/3.96 | COMBINE_EQS: (55), (56) imply:
% 21.25/3.96 | (65) all_22_6 = all_13_6
% 21.25/3.96 |
% 21.25/3.96 | COMBINE_EQS: (59), (63) imply:
% 21.25/3.96 | (66) all_20_2 = 0
% 21.25/3.96 |
% 21.25/3.96 | SIMP: (66) implies:
% 21.25/3.96 | (67) all_20_2 = 0
% 21.25/3.96 |
% 21.25/3.96 | COMBINE_EQS: (57), (58) imply:
% 21.25/3.97 | (68) all_20_3 = all_13_7
% 21.25/3.97 |
% 21.25/3.97 | BETA: splitting (29) gives:
% 21.25/3.97 |
% 21.25/3.97 | Case 1:
% 21.25/3.97 | |
% 21.25/3.97 | | (69) all_13_4 = 0 & (all_13_9 = empty:Tree | ( ~ (all_13_7 = all_13_8) &
% 21.25/3.97 | | (($lesseq(1, $difference(all_13_8, all_13_7)) & ~ (in(all_13_8,
% 21.25/3.97 | | all_13_5) = 0)) | ($lesseq(1, $difference(all_13_7,
% 21.25/3.97 | | all_13_8)) & ~ (in(all_13_8, all_13_6) = 0)))))
% 21.25/3.97 | |
% 21.25/3.97 | | ALPHA: (69) implies:
% 21.25/3.97 | | (70) all_13_4 = 0
% 21.25/3.97 | | (71) all_13_9 = empty:Tree | ( ~ (all_13_7 = all_13_8) & (($lesseq(1,
% 21.25/3.97 | | $difference(all_13_8, all_13_7)) & ~ (in(all_13_8,
% 21.25/3.97 | | all_13_5) = 0)) | ($lesseq(1, $difference(all_13_7,
% 21.25/3.97 | | all_13_8)) & ~ (in(all_13_8, all_13_6) = 0))))
% 21.25/3.97 | |
% 21.25/3.97 | | REDUCE: (27), (70) imply:
% 21.25/3.97 | | (72) in(all_13_8, all_13_9) = 0
% 21.25/3.97 | |
% 21.25/3.97 | | GROUND_INST: instantiating (5) with all_13_8, all_13_9, simplifying with
% 21.25/3.97 | | (23), (72) gives:
% 21.25/3.97 | | (73) all_13_9 = empty:Tree | ? [v0: int] : ? [v1: Tree] : ? [v2: any]
% 21.25/3.97 | | : ? [v3: Tree] : ? [v4: any] : (in(all_13_8, v3) = v4 &
% 21.25/3.97 | | in(all_13_8, v1) = v2 & val:(Tree)>Int(all_13_9) = v0 &
% 21.25/3.97 | | left:(Tree)>Tree(all_13_9) = v1 & right:(Tree)>Tree(all_13_9) = v3
% 21.25/3.97 | | & Tree(v3) & Tree(v1) & (v4 = 0 | v2 = 0 | v0 = all_13_8))
% 21.25/3.97 | |
% 21.25/3.97 | | BETA: splitting (37) gives:
% 21.25/3.97 | |
% 21.25/3.97 | | Case 1:
% 21.25/3.97 | | |
% 21.25/3.97 | | | (74) all_13_9 = empty:Tree
% 21.25/3.97 | | |
% 21.25/3.97 | | | REDUCE: (72), (74) imply:
% 21.25/3.97 | | | (75) in(all_13_8, empty:Tree) = 0
% 21.25/3.97 | | |
% 21.25/3.97 | | | GROUND_INST: instantiating (4) with all_13_8, simplifying with (75) gives:
% 21.25/3.97 | | | (76) $false
% 21.25/3.97 | | |
% 21.25/3.97 | | | CLOSE: (76) is inconsistent.
% 21.25/3.97 | | |
% 21.25/3.97 | | Case 2:
% 21.25/3.97 | | |
% 21.25/3.97 | | | (77) ~ (all_13_9 = empty:Tree)
% 21.25/3.97 | | | (78) ? [v0: Tree] : ? [v1: Tree] : (left:(Tree)>Tree(all_13_9) = v0 &
% 21.25/3.97 | | | right:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.97 | | | node:(Int*Tree*Tree)>Tree(all_13_7, v0, v1) = all_13_9 &
% 21.25/3.97 | | | Tree(v1) & Tree(v0))
% 21.25/3.97 | | |
% 21.25/3.97 | | | DELTA: instantiating (78) with fresh symbols all_48_0, all_48_1 gives:
% 21.25/3.97 | | | (79) left:(Tree)>Tree(all_13_9) = all_48_1 &
% 21.25/3.97 | | | right:(Tree)>Tree(all_13_9) = all_48_0 &
% 21.25/3.97 | | | node:(Int*Tree*Tree)>Tree(all_13_7, all_48_1, all_48_0) = all_13_9
% 21.25/3.97 | | | & Tree(all_48_0) & Tree(all_48_1)
% 21.25/3.97 | | |
% 21.25/3.97 | | | ALPHA: (79) implies:
% 21.25/3.97 | | | (80) right:(Tree)>Tree(all_13_9) = all_48_0
% 21.25/3.97 | | | (81) left:(Tree)>Tree(all_13_9) = all_48_1
% 21.25/3.97 | | |
% 21.25/3.97 | | | BETA: splitting (34) gives:
% 21.25/3.97 | | |
% 21.25/3.97 | | | Case 1:
% 21.25/3.97 | | | |
% 21.25/3.97 | | | | (82) all_13_9 = empty:Tree
% 21.25/3.97 | | | |
% 21.25/3.97 | | | | REDUCE: (77), (82) imply:
% 21.25/3.97 | | | | (83) $false
% 21.25/3.97 | | | |
% 21.25/3.97 | | | | CLOSE: (83) is inconsistent.
% 21.25/3.97 | | | |
% 21.25/3.97 | | | Case 2:
% 21.25/3.97 | | | |
% 21.25/3.98 | | | | (84) ? [v0: int] : ? [v1: Tree] : (val:(Tree)>Int(all_13_9) = v0 &
% 21.25/3.98 | | | | right:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.98 | | | | node:(Int*Tree*Tree)>Tree(v0, all_13_6, v1) = all_13_9 &
% 21.25/3.98 | | | | Tree(v1))
% 21.25/3.98 | | | |
% 21.25/3.98 | | | | DELTA: instantiating (84) with fresh symbols all_54_0, all_54_1 gives:
% 21.25/3.98 | | | | (85) val:(Tree)>Int(all_13_9) = all_54_1 &
% 21.25/3.98 | | | | right:(Tree)>Tree(all_13_9) = all_54_0 &
% 21.25/3.98 | | | | node:(Int*Tree*Tree)>Tree(all_54_1, all_13_6, all_54_0) =
% 21.25/3.98 | | | | all_13_9 & Tree(all_54_0)
% 21.25/3.98 | | | |
% 21.25/3.98 | | | | ALPHA: (85) implies:
% 21.25/3.98 | | | | (86) right:(Tree)>Tree(all_13_9) = all_54_0
% 21.25/3.98 | | | | (87) val:(Tree)>Int(all_13_9) = all_54_1
% 21.25/3.98 | | | |
% 21.25/3.98 | | | | BETA: splitting (31) gives:
% 21.25/3.98 | | | |
% 21.25/3.98 | | | | Case 1:
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | (88) all_13_9 = empty:Tree
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | REDUCE: (77), (88) imply:
% 21.25/3.98 | | | | | (89) $false
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | CLOSE: (89) is inconsistent.
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | Case 2:
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | (90) ? [v0: int] : ? [v1: Tree] : (val:(Tree)>Int(all_13_9) = v0
% 21.25/3.98 | | | | | & left:(Tree)>Tree(all_13_9) = v1 &
% 21.25/3.98 | | | | | node:(Int*Tree*Tree)>Tree(v0, v1, all_13_5) = all_13_9 &
% 21.25/3.98 | | | | | Tree(v1))
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | DELTA: instantiating (90) with fresh symbols all_60_0, all_60_1 gives:
% 21.25/3.98 | | | | | (91) val:(Tree)>Int(all_13_9) = all_60_1 &
% 21.25/3.98 | | | | | left:(Tree)>Tree(all_13_9) = all_60_0 &
% 21.25/3.98 | | | | | node:(Int*Tree*Tree)>Tree(all_60_1, all_60_0, all_13_5) =
% 21.25/3.98 | | | | | all_13_9 & Tree(all_60_0)
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | ALPHA: (91) implies:
% 21.25/3.98 | | | | | (92) left:(Tree)>Tree(all_13_9) = all_60_0
% 21.25/3.98 | | | | | (93) val:(Tree)>Int(all_13_9) = all_60_1
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | BETA: splitting (36) gives:
% 21.25/3.98 | | | | |
% 21.25/3.98 | | | | | Case 1:
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | (94) all_13_9 = empty:Tree
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | REDUCE: (77), (94) imply:
% 21.25/3.98 | | | | | | (95) $false
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | CLOSE: (95) is inconsistent.
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | Case 2:
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | (96) ? [v0: any] : ? [v1: Tree] : ? [v2: any] : ? [v3: Tree]
% 21.25/3.98 | | | | | | : ? [v4: any] : (searchtree(v3) = v4 & searchtree(v1) = v2
% 21.25/3.98 | | | | | | & searchtree(all_13_9) = v0 & left:(Tree)>Tree(all_13_9) =
% 21.25/3.98 | | | | | | v1 & right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) &
% 21.25/3.98 | | | | | | Tree(v1) & ( ~ (v0 = 0) | (v4 = 0 & v2 = 0 & ! [v5: int]
% 21.25/3.98 | | | | | | : ( ~ ($lesseq(v5, all_13_7)) | ~ (in(v5, v3) = 0)) &
% 21.25/3.98 | | | | | | ! [v5: int] : ( ~ ($lesseq(1, $difference(v5,
% 21.25/3.98 | | | | | | all_13_7))) | ~ (in(v5, v1) = 0)))))
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | DELTA: instantiating (96) with fresh symbols all_66_0, all_66_1,
% 21.25/3.98 | | | | | | all_66_2, all_66_3, all_66_4 gives:
% 21.25/3.98 | | | | | | (97) searchtree(all_66_1) = all_66_0 & searchtree(all_66_3) =
% 21.25/3.98 | | | | | | all_66_2 & searchtree(all_13_9) = all_66_4 &
% 21.25/3.98 | | | | | | left:(Tree)>Tree(all_13_9) = all_66_3 &
% 21.25/3.98 | | | | | | right:(Tree)>Tree(all_13_9) = all_66_1 & Tree(all_66_1) &
% 21.25/3.98 | | | | | | Tree(all_66_3) & ( ~ (all_66_4 = 0) | (all_66_0 = 0 &
% 21.25/3.98 | | | | | | all_66_2 = 0 & ! [v0: int] : ( ~ ($lesseq(v0,
% 21.25/3.98 | | | | | | all_13_7)) | ~ (in(v0, all_66_1) = 0)) & ! [v0:
% 21.25/3.98 | | | | | | int] : ( ~ ($lesseq(1, $difference(v0, all_13_7))) |
% 21.25/3.98 | | | | | | ~ (in(v0, all_66_3) = 0))))
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | ALPHA: (97) implies:
% 21.25/3.98 | | | | | | (98) right:(Tree)>Tree(all_13_9) = all_66_1
% 21.25/3.98 | | | | | | (99) left:(Tree)>Tree(all_13_9) = all_66_3
% 21.25/3.98 | | | | | | (100) searchtree(all_13_9) = all_66_4
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | BETA: splitting (71) gives:
% 21.25/3.98 | | | | | |
% 21.25/3.98 | | | | | | Case 1:
% 21.25/3.98 | | | | | | |
% 21.25/3.98 | | | | | | | (101) all_13_9 = empty:Tree
% 21.25/3.98 | | | | | | |
% 21.25/3.98 | | | | | | | REDUCE: (77), (101) imply:
% 21.25/3.98 | | | | | | | (102) $false
% 21.25/3.98 | | | | | | |
% 21.25/3.98 | | | | | | | CLOSE: (102) is inconsistent.
% 21.25/3.98 | | | | | | |
% 21.25/3.98 | | | | | | Case 2:
% 21.25/3.98 | | | | | | |
% 21.25/3.98 | | | | | | | (103) ~ (all_13_7 = all_13_8) & (($lesseq(1,
% 21.25/3.98 | | | | | | | $difference(all_13_8, all_13_7)) & ~ (in(all_13_8,
% 21.25/3.98 | | | | | | | all_13_5) = 0)) | ($lesseq(1,
% 21.25/3.98 | | | | | | | $difference(all_13_7, all_13_8)) & ~ (in(all_13_8,
% 21.25/3.98 | | | | | | | all_13_6) = 0)))
% 21.25/3.98 | | | | | | |
% 21.25/3.98 | | | | | | | ALPHA: (103) implies:
% 21.25/3.99 | | | | | | | (104) ($lesseq(1, $difference(all_13_8, all_13_7)) & ~
% 21.25/3.99 | | | | | | | (in(all_13_8, all_13_5) = 0)) | ($lesseq(1,
% 21.25/3.99 | | | | | | | $difference(all_13_7, all_13_8)) & ~ (in(all_13_8,
% 21.25/3.99 | | | | | | | all_13_6) = 0))
% 21.25/3.99 | | | | | | |
% 21.25/3.99 | | | | | | | BETA: splitting (30) gives:
% 21.25/3.99 | | | | | | |
% 21.25/3.99 | | | | | | | Case 1:
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | (105) all_13_9 = empty:Tree
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | REDUCE: (77), (105) imply:
% 21.25/3.99 | | | | | | | | (106) $false
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | CLOSE: (106) is inconsistent.
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | Case 2:
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | (107) ? [v0: any] : ? [v1: Tree] : ? [v2: any] : ? [v3:
% 21.25/3.99 | | | | | | | | any] : ? [v4: int] : (searchtree(v1) = v2 &
% 21.25/3.99 | | | | | | | | searchtree(all_13_5) = v3 & searchtree(all_13_9) = v0
% 21.25/3.99 | | | | | | | | & val:(Tree)>Int(all_13_9) = v4 &
% 21.25/3.99 | | | | | | | | left:(Tree)>Tree(all_13_9) = v1 & Tree(v1) & ( ~ (v0
% 21.25/3.99 | | | | | | | | = 0) | (v3 = 0 & v2 = 0 & ! [v5: int] : ( ~
% 21.25/3.99 | | | | | | | | ($lesseq(v5, v4)) | ~ (in(v5, all_13_5) = 0))
% 21.25/3.99 | | | | | | | | & ! [v5: int] : ( ~ ($lesseq(1, $difference(v5,
% 21.25/3.99 | | | | | | | | v4))) | ~ (in(v5, v1) = 0)))))
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | DELTA: instantiating (107) with fresh symbols all_76_0,
% 21.25/3.99 | | | | | | | | all_76_1, all_76_2, all_76_3, all_76_4 gives:
% 21.25/3.99 | | | | | | | | (108) searchtree(all_76_3) = all_76_2 & searchtree(all_13_5)
% 21.25/3.99 | | | | | | | | = all_76_1 & searchtree(all_13_9) = all_76_4 &
% 21.25/3.99 | | | | | | | | val:(Tree)>Int(all_13_9) = all_76_0 &
% 21.25/3.99 | | | | | | | | left:(Tree)>Tree(all_13_9) = all_76_3 & Tree(all_76_3)
% 21.25/3.99 | | | | | | | | & ( ~ (all_76_4 = 0) | (all_76_1 = 0 & all_76_2 = 0 &
% 21.25/3.99 | | | | | | | | ! [v0: int] : ( ~ ($lesseq(v0, all_76_0)) | ~
% 21.25/3.99 | | | | | | | | (in(v0, all_13_5) = 0)) & ! [v0: int] : ( ~
% 21.25/3.99 | | | | | | | | ($lesseq(1, $difference(v0, all_76_0))) | ~
% 21.25/3.99 | | | | | | | | (in(v0, all_76_3) = 0))))
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | ALPHA: (108) implies:
% 21.25/3.99 | | | | | | | | (109) left:(Tree)>Tree(all_13_9) = all_76_3
% 21.25/3.99 | | | | | | | | (110) val:(Tree)>Int(all_13_9) = all_76_0
% 21.25/3.99 | | | | | | | | (111) searchtree(all_13_9) = all_76_4
% 21.25/3.99 | | | | | | | | (112) ~ (all_76_4 = 0) | (all_76_1 = 0 & all_76_2 = 0 & !
% 21.25/3.99 | | | | | | | | [v0: int] : ( ~ ($lesseq(v0, all_76_0)) | ~ (in(v0,
% 21.25/3.99 | | | | | | | | all_13_5) = 0)) & ! [v0: int] : ( ~
% 21.25/3.99 | | | | | | | | ($lesseq(1, $difference(v0, all_76_0))) | ~
% 21.25/3.99 | | | | | | | | (in(v0, all_76_3) = 0)))
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | BETA: splitting (40) gives:
% 21.25/3.99 | | | | | | | |
% 21.25/3.99 | | | | | | | | Case 1:
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | | (113) all_13_9 = empty:Tree
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | | REDUCE: (77), (113) imply:
% 21.25/3.99 | | | | | | | | | (114) $false
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | | CLOSE: (114) is inconsistent.
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | Case 2:
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | | (115) ? [v0: Tree] : ? [v1: Tree] : ? [v2: int] :
% 21.25/3.99 | | | | | | | | | (searchtree(v1) = 0 & searchtree(v0) = 0 &
% 21.25/3.99 | | | | | | | | | val:(Tree)>Int(all_13_9) = v2 &
% 21.25/3.99 | | | | | | | | | left:(Tree)>Tree(all_13_9) = v0 &
% 21.25/3.99 | | | | | | | | | right:(Tree)>Tree(all_13_9) = v1 & Tree(v1) &
% 21.25/3.99 | | | | | | | | | Tree(v0) & ! [v3: int] : ( ~ ($lesseq(v3, v2)) |
% 21.25/3.99 | | | | | | | | | ~ (in(v3, v1) = 0)) & ! [v3: int] : ( ~
% 21.25/3.99 | | | | | | | | | ($lesseq(1, $difference(v3, v2))) | ~ (in(v3,
% 21.25/3.99 | | | | | | | | | v0) = 0)))
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | | DELTA: instantiating (115) with fresh symbols all_82_0,
% 21.25/3.99 | | | | | | | | | all_82_1, all_82_2 gives:
% 21.25/3.99 | | | | | | | | | (116) searchtree(all_82_1) = 0 & searchtree(all_82_2) = 0 &
% 21.25/3.99 | | | | | | | | | val:(Tree)>Int(all_13_9) = all_82_0 &
% 21.25/3.99 | | | | | | | | | left:(Tree)>Tree(all_13_9) = all_82_2 &
% 21.25/3.99 | | | | | | | | | right:(Tree)>Tree(all_13_9) = all_82_1 &
% 21.25/3.99 | | | | | | | | | Tree(all_82_1) & Tree(all_82_2) & ! [v0: int] : ( ~
% 21.25/3.99 | | | | | | | | | ($lesseq(v0, all_82_0)) | ~ (in(v0, all_82_1) =
% 21.25/3.99 | | | | | | | | | 0)) & ! [v0: int] : ( ~ ($lesseq(1,
% 21.25/3.99 | | | | | | | | | $difference(v0, all_82_0))) | ~ (in(v0,
% 21.25/3.99 | | | | | | | | | all_82_2) = 0))
% 21.25/3.99 | | | | | | | | |
% 21.25/3.99 | | | | | | | | | ALPHA: (116) implies:
% 21.25/3.99 | | | | | | | | | (117) right:(Tree)>Tree(all_13_9) = all_82_1
% 21.25/4.00 | | | | | | | | | (118) left:(Tree)>Tree(all_13_9) = all_82_2
% 21.25/4.00 | | | | | | | | | (119) val:(Tree)>Int(all_13_9) = all_82_0
% 21.25/4.00 | | | | | | | | |
% 21.25/4.00 | | | | | | | | | BETA: splitting (33) gives:
% 21.25/4.00 | | | | | | | | |
% 21.25/4.00 | | | | | | | | | Case 1:
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | (120) all_13_9 = empty:Tree
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | REDUCE: (77), (120) imply:
% 21.25/4.00 | | | | | | | | | | (121) $false
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | CLOSE: (121) is inconsistent.
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | Case 2:
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | (122) ? [v0: any] : ? [v1: any] : ? [v2: Tree] : ?
% 21.25/4.00 | | | | | | | | | | [v3: any] : ? [v4: int] : (searchtree(v2) = v3 &
% 21.25/4.00 | | | | | | | | | | searchtree(all_13_6) = v1 & searchtree(all_13_9)
% 21.25/4.00 | | | | | | | | | | = v0 & val:(Tree)>Int(all_13_9) = v4 &
% 21.25/4.00 | | | | | | | | | | right:(Tree)>Tree(all_13_9) = v2 & Tree(v2) & ( ~
% 21.25/4.00 | | | | | | | | | | (v0 = 0) | (v3 = 0 & v1 = 0 & ! [v5: int] : (
% 21.25/4.00 | | | | | | | | | | ~ ($lesseq(v5, v4)) | ~ (in(v5, v2) = 0))
% 21.25/4.00 | | | | | | | | | | & ! [v5: int] : ( ~ ($lesseq(1,
% 21.25/4.00 | | | | | | | | | | $difference(v5, v4))) | ~ (in(v5,
% 21.25/4.00 | | | | | | | | | | all_13_6) = 0)))))
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | DELTA: instantiating (122) with fresh symbols all_89_0,
% 21.25/4.00 | | | | | | | | | | all_89_1, all_89_2, all_89_3, all_89_4 gives:
% 21.25/4.00 | | | | | | | | | | (123) searchtree(all_89_2) = all_89_1 &
% 21.25/4.00 | | | | | | | | | | searchtree(all_13_6) = all_89_3 &
% 21.25/4.00 | | | | | | | | | | searchtree(all_13_9) = all_89_4 &
% 21.25/4.00 | | | | | | | | | | val:(Tree)>Int(all_13_9) = all_89_0 &
% 21.25/4.00 | | | | | | | | | | right:(Tree)>Tree(all_13_9) = all_89_2 &
% 21.25/4.00 | | | | | | | | | | Tree(all_89_2) & ( ~ (all_89_4 = 0) | (all_89_1 = 0
% 21.25/4.00 | | | | | | | | | | & all_89_3 = 0 & ! [v0: int] : ( ~
% 21.25/4.00 | | | | | | | | | | ($lesseq(v0, all_89_0)) | ~ (in(v0,
% 21.25/4.00 | | | | | | | | | | all_89_2) = 0)) & ! [v0: int] : ( ~
% 21.25/4.00 | | | | | | | | | | ($lesseq(1, $difference(v0, all_89_0))) | ~
% 21.25/4.00 | | | | | | | | | | (in(v0, all_13_6) = 0))))
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | ALPHA: (123) implies:
% 21.25/4.00 | | | | | | | | | | (124) right:(Tree)>Tree(all_13_9) = all_89_2
% 21.25/4.00 | | | | | | | | | | (125) val:(Tree)>Int(all_13_9) = all_89_0
% 21.25/4.00 | | | | | | | | | | (126) searchtree(all_13_9) = all_89_4
% 21.25/4.00 | | | | | | | | | | (127) ~ (all_89_4 = 0) | (all_89_1 = 0 & all_89_3 = 0 &
% 21.25/4.00 | | | | | | | | | | ! [v0: int] : ( ~ ($lesseq(v0, all_89_0)) | ~
% 21.25/4.00 | | | | | | | | | | (in(v0, all_89_2) = 0)) & ! [v0: int] : ( ~
% 21.25/4.00 | | | | | | | | | | ($lesseq(1, $difference(v0, all_89_0))) | ~
% 21.25/4.00 | | | | | | | | | | (in(v0, all_13_6) = 0)))
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | BETA: splitting (73) gives:
% 21.25/4.00 | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | Case 1:
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | (128) all_13_9 = empty:Tree
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | REDUCE: (77), (128) imply:
% 21.25/4.00 | | | | | | | | | | | (129) $false
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | CLOSE: (129) is inconsistent.
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | Case 2:
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | (130) ? [v0: int] : ? [v1: Tree] : ? [v2: any] : ?
% 21.25/4.00 | | | | | | | | | | | [v3: Tree] : ? [v4: any] : (in(all_13_8, v3) = v4
% 21.25/4.00 | | | | | | | | | | | & in(all_13_8, v1) = v2 &
% 21.25/4.00 | | | | | | | | | | | val:(Tree)>Int(all_13_9) = v0 &
% 21.25/4.00 | | | | | | | | | | | left:(Tree)>Tree(all_13_9) = v1 &
% 21.25/4.00 | | | | | | | | | | | right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) &
% 21.25/4.00 | | | | | | | | | | | Tree(v1) & (v4 = 0 | v2 = 0 | v0 = all_13_8))
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | DELTA: instantiating (130) with fresh symbols all_95_0,
% 21.25/4.00 | | | | | | | | | | | all_95_1, all_95_2, all_95_3, all_95_4 gives:
% 21.25/4.00 | | | | | | | | | | | (131) in(all_13_8, all_95_1) = all_95_0 & in(all_13_8,
% 21.25/4.00 | | | | | | | | | | | all_95_3) = all_95_2 & val:(Tree)>Int(all_13_9)
% 21.25/4.00 | | | | | | | | | | | = all_95_4 & left:(Tree)>Tree(all_13_9) = all_95_3
% 21.25/4.00 | | | | | | | | | | | & right:(Tree)>Tree(all_13_9) = all_95_1 &
% 21.25/4.00 | | | | | | | | | | | Tree(all_95_1) & Tree(all_95_3) & (all_95_0 = 0 |
% 21.25/4.00 | | | | | | | | | | | all_95_2 = 0 | all_95_4 = all_13_8)
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | ALPHA: (131) implies:
% 21.25/4.00 | | | | | | | | | | | (132) right:(Tree)>Tree(all_13_9) = all_95_1
% 21.25/4.00 | | | | | | | | | | | (133) left:(Tree)>Tree(all_13_9) = all_95_3
% 21.25/4.00 | | | | | | | | | | | (134) val:(Tree)>Int(all_13_9) = all_95_4
% 21.25/4.00 | | | | | | | | | | | (135) in(all_13_8, all_95_3) = all_95_2
% 21.25/4.00 | | | | | | | | | | | (136) in(all_13_8, all_95_1) = all_95_0
% 21.25/4.00 | | | | | | | | | | | (137) all_95_0 = 0 | all_95_2 = 0 | all_95_4 = all_13_8
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_13_5, all_66_1,
% 21.25/4.00 | | | | | | | | | | | all_13_9, simplifying with (24), (98) gives:
% 21.25/4.00 | | | | | | | | | | | (138) all_66_1 = all_13_5
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_48_0, all_66_1,
% 21.25/4.00 | | | | | | | | | | | all_13_9, simplifying with (80), (98) gives:
% 21.25/4.00 | | | | | | | | | | | (139) all_66_1 = all_48_0
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_66_1, all_82_1,
% 21.25/4.00 | | | | | | | | | | | all_13_9, simplifying with (98), (117) gives:
% 21.25/4.00 | | | | | | | | | | | (140) all_82_1 = all_66_1
% 21.25/4.00 | | | | | | | | | | |
% 21.25/4.00 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_82_1, all_89_2,
% 21.25/4.00 | | | | | | | | | | | all_13_9, simplifying with (117), (124) gives:
% 21.25/4.01 | | | | | | | | | | | (141) all_89_2 = all_82_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_89_2, all_95_1,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (124), (132) gives:
% 21.25/4.01 | | | | | | | | | | | (142) all_95_1 = all_89_2
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_54_0, all_95_1,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (86), (132) gives:
% 21.25/4.01 | | | | | | | | | | | (143) all_95_1 = all_54_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_13_6, all_82_2,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (25), (118) gives:
% 21.25/4.01 | | | | | | | | | | | (144) all_82_2 = all_13_6
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_76_3, all_82_2,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (109), (118) gives:
% 21.25/4.01 | | | | | | | | | | | (145) all_82_2 = all_76_3
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_66_3, all_82_2,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (99), (118) gives:
% 21.25/4.01 | | | | | | | | | | | (146) all_82_2 = all_66_3
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_48_1, all_82_2,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (81), (118) gives:
% 21.25/4.01 | | | | | | | | | | | (147) all_82_2 = all_48_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_82_2, all_95_3,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (118), (133) gives:
% 21.25/4.01 | | | | | | | | | | | (148) all_95_3 = all_82_2
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_60_0, all_95_3,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (92), (133) gives:
% 21.25/4.01 | | | | | | | | | | | (149) all_95_3 = all_60_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_13_7, all_60_1,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (26), (93) gives:
% 21.25/4.01 | | | | | | | | | | | (150) all_60_1 = all_13_7
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_60_1, all_76_0,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (93), (110) gives:
% 21.25/4.01 | | | | | | | | | | | (151) all_76_0 = all_60_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_76_0, all_82_0,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (110), (119) gives:
% 21.25/4.01 | | | | | | | | | | | (152) all_82_0 = all_76_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_82_0, all_89_0,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (119), (125) gives:
% 21.25/4.01 | | | | | | | | | | | (153) all_89_0 = all_82_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_89_0, all_95_4,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (125), (134) gives:
% 21.25/4.01 | | | | | | | | | | | (154) all_95_4 = all_89_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_54_1, all_95_4,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (87), (134) gives:
% 21.25/4.01 | | | | | | | | | | | (155) all_95_4 = all_54_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (20) with 0, all_76_4, all_13_9,
% 21.25/4.01 | | | | | | | | | | | simplifying with (28), (111) gives:
% 21.25/4.01 | | | | | | | | | | | (156) all_76_4 = 0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (20) with all_76_4, all_89_4,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (111), (126) gives:
% 21.25/4.01 | | | | | | | | | | | (157) all_89_4 = all_76_4
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | GROUND_INST: instantiating (20) with all_66_4, all_89_4,
% 21.25/4.01 | | | | | | | | | | | all_13_9, simplifying with (100), (126) gives:
% 21.25/4.01 | | | | | | | | | | | (158) all_89_4 = all_66_4
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | COMBINE_EQS: (142), (143) imply:
% 21.25/4.01 | | | | | | | | | | | (159) all_89_2 = all_54_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | SIMP: (159) implies:
% 21.25/4.01 | | | | | | | | | | | (160) all_89_2 = all_54_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | COMBINE_EQS: (148), (149) imply:
% 21.25/4.01 | | | | | | | | | | | (161) all_82_2 = all_60_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | SIMP: (161) implies:
% 21.25/4.01 | | | | | | | | | | | (162) all_82_2 = all_60_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | COMBINE_EQS: (154), (155) imply:
% 21.25/4.01 | | | | | | | | | | | (163) all_89_0 = all_54_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | SIMP: (163) implies:
% 21.25/4.01 | | | | | | | | | | | (164) all_89_0 = all_54_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | COMBINE_EQS: (153), (164) imply:
% 21.25/4.01 | | | | | | | | | | | (165) all_82_0 = all_54_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | SIMP: (165) implies:
% 21.25/4.01 | | | | | | | | | | | (166) all_82_0 = all_54_1
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | COMBINE_EQS: (141), (160) imply:
% 21.25/4.01 | | | | | | | | | | | (167) all_82_1 = all_54_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | SIMP: (167) implies:
% 21.25/4.01 | | | | | | | | | | | (168) all_82_1 = all_54_0
% 21.25/4.01 | | | | | | | | | | |
% 21.25/4.01 | | | | | | | | | | | COMBINE_EQS: (157), (158) imply:
% 21.25/4.02 | | | | | | | | | | | (169) all_76_4 = all_66_4
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | SIMP: (169) implies:
% 21.25/4.02 | | | | | | | | | | | (170) all_76_4 = all_66_4
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (152), (166) imply:
% 21.25/4.02 | | | | | | | | | | | (171) all_76_0 = all_54_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | SIMP: (171) implies:
% 21.25/4.02 | | | | | | | | | | | (172) all_76_0 = all_54_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (140), (168) imply:
% 21.25/4.02 | | | | | | | | | | | (173) all_66_1 = all_54_0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | SIMP: (173) implies:
% 21.25/4.02 | | | | | | | | | | | (174) all_66_1 = all_54_0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (145), (162) imply:
% 21.25/4.02 | | | | | | | | | | | (175) all_76_3 = all_60_0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (145), (147) imply:
% 21.25/4.02 | | | | | | | | | | | (176) all_76_3 = all_48_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (145), (146) imply:
% 21.25/4.02 | | | | | | | | | | | (177) all_76_3 = all_66_3
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (144), (145) imply:
% 21.25/4.02 | | | | | | | | | | | (178) all_76_3 = all_13_6
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (151), (172) imply:
% 21.25/4.02 | | | | | | | | | | | (179) all_60_1 = all_54_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | SIMP: (179) implies:
% 21.25/4.02 | | | | | | | | | | | (180) all_60_1 = all_54_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (176), (177) imply:
% 21.25/4.02 | | | | | | | | | | | (181) all_66_3 = all_48_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (177), (178) imply:
% 21.25/4.02 | | | | | | | | | | | (182) all_66_3 = all_13_6
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (175), (177) imply:
% 21.25/4.02 | | | | | | | | | | | (183) all_66_3 = all_60_0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (156), (170) imply:
% 21.25/4.02 | | | | | | | | | | | (184) all_66_4 = 0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (139), (174) imply:
% 21.25/4.02 | | | | | | | | | | | (185) all_54_0 = all_48_0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (138), (174) imply:
% 21.25/4.02 | | | | | | | | | | | (186) all_54_0 = all_13_5
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (181), (183) imply:
% 21.25/4.02 | | | | | | | | | | | (187) all_60_0 = all_48_1
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (182), (183) imply:
% 21.25/4.02 | | | | | | | | | | | (188) all_60_0 = all_13_6
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (187), (188) imply:
% 21.25/4.02 | | | | | | | | | | | (189) all_48_1 = all_13_6
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (150), (180) imply:
% 21.25/4.02 | | | | | | | | | | | (190) all_54_1 = all_13_7
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (185), (186) imply:
% 21.25/4.02 | | | | | | | | | | | (191) all_48_0 = all_13_5
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (172), (190) imply:
% 21.25/4.02 | | | | | | | | | | | (192) all_76_0 = all_13_7
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (158), (184) imply:
% 21.25/4.02 | | | | | | | | | | | (193) all_89_4 = 0
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (164), (190) imply:
% 21.25/4.02 | | | | | | | | | | | (194) all_89_0 = all_13_7
% 21.25/4.02 | | | | | | | | | | |
% 21.25/4.02 | | | | | | | | | | | COMBINE_EQS: (155), (190) imply:
% 21.25/4.03 | | | | | | | | | | | (195) all_95_4 = all_13_7
% 21.25/4.03 | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | COMBINE_EQS: (149), (188) imply:
% 21.25/4.03 | | | | | | | | | | | (196) all_95_3 = all_13_6
% 21.25/4.03 | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | COMBINE_EQS: (143), (186) imply:
% 21.25/4.03 | | | | | | | | | | | (197) all_95_1 = all_13_5
% 21.25/4.03 | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | REDUCE: (136), (197) imply:
% 21.25/4.03 | | | | | | | | | | | (198) in(all_13_8, all_13_5) = all_95_0
% 21.25/4.03 | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | REDUCE: (135), (196) imply:
% 21.25/4.03 | | | | | | | | | | | (199) in(all_13_8, all_13_6) = all_95_2
% 21.25/4.03 | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | BETA: splitting (127) gives:
% 21.25/4.03 | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | Case 1:
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | (200) ~ (all_89_4 = 0)
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | REDUCE: (193), (200) imply:
% 21.25/4.03 | | | | | | | | | | | | (201) $false
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | CLOSE: (201) is inconsistent.
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | Case 2:
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | (202) all_89_1 = 0 & all_89_3 = 0 & ! [v0: int] : ( ~
% 21.25/4.03 | | | | | | | | | | | | ($lesseq(v0, all_89_0)) | ~ (in(v0, all_89_2) =
% 21.25/4.03 | | | | | | | | | | | | 0)) & ! [v0: int] : ( ~ ($lesseq(1,
% 21.25/4.03 | | | | | | | | | | | | $difference(v0, all_89_0))) | ~ (in(v0,
% 21.25/4.03 | | | | | | | | | | | | all_13_6) = 0))
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | ALPHA: (202) implies:
% 21.25/4.03 | | | | | | | | | | | | (203) ! [v0: int] : ( ~ ($lesseq(1, $difference(v0,
% 21.25/4.03 | | | | | | | | | | | | all_89_0))) | ~ (in(v0, all_13_6) = 0))
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | BETA: splitting (112) gives:
% 21.25/4.03 | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | Case 1:
% 21.25/4.03 | | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | | (204) ~ (all_76_4 = 0)
% 21.25/4.03 | | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | | REDUCE: (156), (204) imply:
% 21.25/4.03 | | | | | | | | | | | | | (205) $false
% 21.25/4.03 | | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | | CLOSE: (205) is inconsistent.
% 21.25/4.03 | | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | Case 2:
% 21.25/4.03 | | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | | (206) all_76_1 = 0 & all_76_2 = 0 & ! [v0: int] : ( ~
% 21.25/4.03 | | | | | | | | | | | | | ($lesseq(v0, all_76_0)) | ~ (in(v0, all_13_5) =
% 21.25/4.03 | | | | | | | | | | | | | 0)) & ! [v0: int] : ( ~ ($lesseq(1,
% 21.25/4.03 | | | | | | | | | | | | | $difference(v0, all_76_0))) | ~ (in(v0,
% 21.25/4.03 | | | | | | | | | | | | | all_76_3) = 0))
% 21.25/4.03 | | | | | | | | | | | | |
% 21.25/4.03 | | | | | | | | | | | | | ALPHA: (206) implies:
% 21.25/4.04 | | | | | | | | | | | | | (207) ! [v0: int] : ( ~ ($lesseq(v0, all_76_0)) | ~
% 21.25/4.04 | | | | | | | | | | | | | (in(v0, all_13_5) = 0))
% 21.25/4.04 | | | | | | | | | | | | |
% 21.25/4.04 | | | | | | | | | | | | | GROUND_INST: instantiating (8) with all_13_8, all_13_9,
% 21.25/4.04 | | | | | | | | | | | | | all_13_6, all_95_2, simplifying with (23), (25),
% 21.25/4.04 | | | | | | | | | | | | | (199) gives:
% 21.25/4.04 | | | | | | | | | | | | | (208) ? [v0: any] : ? [v1: int] : ? [v2: Tree] : ?
% 21.25/4.04 | | | | | | | | | | | | | [v3: any] : (in(all_13_8, v2) = v3 & in(all_13_8,
% 21.25/4.04 | | | | | | | | | | | | | all_13_9) = v0 & val:(Tree)>Int(all_13_9) = v1
% 21.25/4.04 | | | | | | | | | | | | | & right:(Tree)>Tree(all_13_9) = v2 & Tree(v2) &
% 21.25/4.04 | | | | | | | | | | | | | ( ~ (v0 = 0) | ( ~ (all_13_9 = empty:Tree) & (v3
% 21.25/4.04 | | | | | | | | | | | | | = 0 | v1 = all_13_8 | all_95_2 = 0))))
% 21.25/4.04 | | | | | | | | | | | | |
% 21.25/4.04 | | | | | | | | | | | | | GROUND_INST: instantiating (7) with all_13_8, all_13_9,
% 21.25/4.04 | | | | | | | | | | | | | all_13_5, all_95_0, simplifying with (23), (24),
% 21.25/4.04 | | | | | | | | | | | | | (198) gives:
% 21.25/4.04 | | | | | | | | | | | | | (209) ? [v0: any] : ? [v1: int] : ? [v2: Tree] : ?
% 21.25/4.04 | | | | | | | | | | | | | [v3: any] : (in(all_13_8, v2) = v3 & in(all_13_8,
% 21.25/4.04 | | | | | | | | | | | | | all_13_9) = v0 & val:(Tree)>Int(all_13_9) = v1
% 21.25/4.04 | | | | | | | | | | | | | & left:(Tree)>Tree(all_13_9) = v2 & Tree(v2) & (
% 21.25/4.04 | | | | | | | | | | | | | ~ (v0 = 0) | ( ~ (all_13_9 = empty:Tree) & (v3
% 21.25/4.04 | | | | | | | | | | | | | = 0 | v1 = all_13_8 | all_95_0 = 0))))
% 21.25/4.04 | | | | | | | | | | | | |
% 21.25/4.04 | | | | | | | | | | | | | DELTA: instantiating (209) with fresh symbols all_121_0,
% 21.25/4.04 | | | | | | | | | | | | | all_121_1, all_121_2, all_121_3 gives:
% 21.25/4.04 | | | | | | | | | | | | | (210) in(all_13_8, all_121_1) = all_121_0 & in(all_13_8,
% 21.25/4.04 | | | | | | | | | | | | | all_13_9) = all_121_3 & val:(Tree)>Int(all_13_9)
% 21.25/4.04 | | | | | | | | | | | | | = all_121_2 & left:(Tree)>Tree(all_13_9) =
% 21.25/4.04 | | | | | | | | | | | | | all_121_1 & Tree(all_121_1) & ( ~ (all_121_3 = 0)
% 21.25/4.04 | | | | | | | | | | | | | | ( ~ (all_13_9 = empty:Tree) & (all_121_0 = 0 |
% 21.25/4.04 | | | | | | | | | | | | | all_121_2 = all_13_8 | all_95_0 = 0)))
% 21.25/4.04 | | | | | | | | | | | | |
% 21.25/4.04 | | | | | | | | | | | | | ALPHA: (210) implies:
% 21.25/4.04 | | | | | | | | | | | | | (211) left:(Tree)>Tree(all_13_9) = all_121_1
% 21.25/4.04 | | | | | | | | | | | | | (212) in(all_13_8, all_121_1) = all_121_0
% 21.25/4.04 | | | | | | | | | | | | |
% 21.25/4.04 | | | | | | | | | | | | | DELTA: instantiating (208) with fresh symbols all_123_0,
% 21.25/4.04 | | | | | | | | | | | | | all_123_1, all_123_2, all_123_3 gives:
% 21.25/4.04 | | | | | | | | | | | | | (213) in(all_13_8, all_123_1) = all_123_0 & in(all_13_8,
% 21.25/4.04 | | | | | | | | | | | | | all_13_9) = all_123_3 & val:(Tree)>Int(all_13_9)
% 21.25/4.04 | | | | | | | | | | | | | = all_123_2 & right:(Tree)>Tree(all_13_9) =
% 21.25/4.04 | | | | | | | | | | | | | all_123_1 & Tree(all_123_1) & ( ~ (all_123_3 = 0)
% 21.25/4.04 | | | | | | | | | | | | | | ( ~ (all_13_9 = empty:Tree) & (all_123_0 = 0 |
% 21.25/4.04 | | | | | | | | | | | | | all_123_2 = all_13_8 | all_95_2 = 0)))
% 21.25/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | ALPHA: (213) implies:
% 21.69/4.04 | | | | | | | | | | | | | (214) right:(Tree)>Tree(all_13_9) = all_123_1
% 21.69/4.04 | | | | | | | | | | | | | (215) in(all_13_8, all_123_1) = all_123_0
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | GROUND_INST: instantiating (17) with all_13_5, all_123_1,
% 21.69/4.04 | | | | | | | | | | | | | all_13_9, simplifying with (24), (214) gives:
% 21.69/4.04 | | | | | | | | | | | | | (216) all_123_1 = all_13_5
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | GROUND_INST: instantiating (18) with all_13_6, all_121_1,
% 21.69/4.04 | | | | | | | | | | | | | all_13_9, simplifying with (25), (211) gives:
% 21.69/4.04 | | | | | | | | | | | | | (217) all_121_1 = all_13_6
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | REDUCE: (215), (216) imply:
% 21.69/4.04 | | | | | | | | | | | | | (218) in(all_13_8, all_13_5) = all_123_0
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | REDUCE: (212), (217) imply:
% 21.69/4.04 | | | | | | | | | | | | | (219) in(all_13_8, all_13_6) = all_121_0
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | GROUND_INST: instantiating (21) with all_95_2, all_121_0,
% 21.69/4.04 | | | | | | | | | | | | | all_13_6, all_13_8, simplifying with (199), (219)
% 21.69/4.04 | | | | | | | | | | | | | gives:
% 21.69/4.04 | | | | | | | | | | | | | (220) all_121_0 = all_95_2
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | GROUND_INST: instantiating (21) with all_95_0, all_123_0,
% 21.69/4.04 | | | | | | | | | | | | | all_13_5, all_13_8, simplifying with (198), (218)
% 21.69/4.04 | | | | | | | | | | | | | gives:
% 21.69/4.04 | | | | | | | | | | | | | (221) all_123_0 = all_95_0
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | BETA: splitting (104) gives:
% 21.69/4.04 | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | Case 1:
% 21.69/4.04 | | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | | (222) $lesseq(1, $difference(all_13_8, all_13_7)) & ~
% 21.69/4.04 | | | | | | | | | | | | | | (in(all_13_8, all_13_5) = 0)
% 21.69/4.04 | | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | | ALPHA: (222) implies:
% 21.69/4.04 | | | | | | | | | | | | | | (223) $lesseq(1, $difference(all_13_8, all_13_7))
% 21.69/4.04 | | | | | | | | | | | | | | (224) ~ (in(all_13_8, all_13_5) = 0)
% 21.69/4.04 | | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | | BETA: splitting (137) gives:
% 21.69/4.04 | | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | | Case 1:
% 21.69/4.04 | | | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | | | (225) all_95_0 = 0
% 21.69/4.04 | | | | | | | | | | | | | | |
% 21.69/4.04 | | | | | | | | | | | | | | | REDUCE: (198), (225) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | (226) in(all_13_8, all_13_5) = 0
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | PRED_UNIFY: (224), (226) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | (227) $false
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | CLOSE: (227) is inconsistent.
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | Case 2:
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | (228) all_95_2 = 0 | all_95_4 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | BETA: splitting (228) gives:
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | Case 1:
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | (229) all_95_2 = 0
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | REDUCE: (199), (229) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (230) in(all_13_8, all_13_6) = 0
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | GROUND_INST: instantiating (203) with all_13_8, simplifying
% 21.69/4.05 | | | | | | | | | | | | | | | | with (230) gives:
% 21.69/4.05 | | | | | | | | | | | | | | | | (231) $lesseq(all_13_8, all_89_0)
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | REDUCE: (194), (231) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (232) $lesseq(all_13_8, all_13_7)
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | COMBINE_INEQS: (223), (232) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (233) $false
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | CLOSE: (233) is inconsistent.
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | Case 2:
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | (234) all_95_4 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | COMBINE_EQS: (195), (234) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (235) all_13_7 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | SIMP: (235) implies:
% 21.69/4.05 | | | | | | | | | | | | | | | | (236) all_13_7 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | REDUCE: (223), (236) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (237) $false
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | CLOSE: (237) is inconsistent.
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | Case 2:
% 21.69/4.05 | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | (238) $lesseq(1, $difference(all_13_7, all_13_8)) & ~
% 21.69/4.05 | | | | | | | | | | | | | | (in(all_13_8, all_13_6) = 0)
% 21.69/4.05 | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | ALPHA: (238) implies:
% 21.69/4.05 | | | | | | | | | | | | | | (239) $lesseq(1, $difference(all_13_7, all_13_8))
% 21.69/4.05 | | | | | | | | | | | | | | (240) ~ (in(all_13_8, all_13_6) = 0)
% 21.69/4.05 | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | BETA: splitting (137) gives:
% 21.69/4.05 | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | Case 1:
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | (241) all_95_0 = 0
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | REDUCE: (198), (241) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | (242) in(all_13_8, all_13_5) = 0
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | GROUND_INST: instantiating (207) with all_13_8, simplifying
% 21.69/4.05 | | | | | | | | | | | | | | | with (242) gives:
% 21.69/4.05 | | | | | | | | | | | | | | | (243) $lesseq(1, $difference(all_13_8, all_76_0))
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | REDUCE: (192), (243) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | (244) $lesseq(1, $difference(all_13_8, all_13_7))
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | COMBINE_INEQS: (239), (244) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | (245) $false
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | CLOSE: (245) is inconsistent.
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | Case 2:
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | (246) all_95_2 = 0 | all_95_4 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | BETA: splitting (246) gives:
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | Case 1:
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | (247) all_95_2 = 0
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | REDUCE: (199), (247) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (248) in(all_13_8, all_13_6) = 0
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | PRED_UNIFY: (240), (248) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (249) $false
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | CLOSE: (249) is inconsistent.
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | Case 2:
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | (250) all_95_4 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | COMBINE_EQS: (195), (250) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (251) all_13_7 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | SIMP: (251) implies:
% 21.69/4.05 | | | | | | | | | | | | | | | | (252) all_13_7 = all_13_8
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | REDUCE: (239), (252) imply:
% 21.69/4.05 | | | | | | | | | | | | | | | | (253) $false
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | | CLOSE: (253) is inconsistent.
% 21.69/4.05 | | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | | |
% 21.69/4.05 | | | | | | | | | End of split
% 21.69/4.05 | | | | | | | | |
% 21.69/4.05 | | | | | | | | End of split
% 21.69/4.05 | | | | | | | |
% 21.69/4.05 | | | | | | | End of split
% 21.69/4.05 | | | | | | |
% 21.69/4.05 | | | | | | End of split
% 21.69/4.05 | | | | | |
% 21.69/4.05 | | | | | End of split
% 21.69/4.05 | | | | |
% 21.69/4.05 | | | | End of split
% 21.69/4.05 | | | |
% 21.69/4.05 | | | End of split
% 21.69/4.05 | | |
% 21.69/4.05 | | End of split
% 21.69/4.05 | |
% 21.69/4.05 | Case 2:
% 21.69/4.05 | |
% 21.69/4.05 | | (254) ~ (all_13_4 = 0) & ~ (all_13_9 = empty:Tree) & (all_13_7 =
% 21.69/4.05 | | all_13_8 | (( ~ ($lesseq(1, $difference(all_13_8, all_13_7))) |
% 21.69/4.05 | | (all_13_2 = 0 & all_13_3 = all_13_5 & in(all_13_8, all_13_5)
% 21.69/4.05 | | = 0)) & ( ~ ($lesseq(1, $difference(all_13_7, all_13_8))) |
% 21.69/4.05 | | (all_13_0 = 0 & all_13_1 = all_13_6 & in(all_13_8, all_13_6)
% 21.69/4.05 | | = 0))))
% 21.69/4.05 | |
% 21.69/4.05 | | ALPHA: (254) implies:
% 21.69/4.05 | | (255) ~ (all_13_9 = empty:Tree)
% 21.69/4.05 | | (256) ~ (all_13_4 = 0)
% 21.69/4.05 | | (257) all_13_7 = all_13_8 | (( ~ ($lesseq(1, $difference(all_13_8,
% 21.69/4.05 | | all_13_7))) | (all_13_2 = 0 & all_13_3 = all_13_5 &
% 21.69/4.05 | | in(all_13_8, all_13_5) = 0)) & ( ~ ($lesseq(1,
% 21.69/4.05 | | $difference(all_13_7, all_13_8))) | (all_13_0 = 0 &
% 21.69/4.05 | | all_13_1 = all_13_6 & in(all_13_8, all_13_6) = 0)))
% 21.69/4.05 | |
% 21.69/4.05 | | BETA: splitting (37) gives:
% 21.69/4.05 | |
% 21.69/4.05 | | Case 1:
% 21.69/4.05 | | |
% 21.69/4.05 | | | (258) all_13_9 = empty:Tree
% 21.69/4.05 | | |
% 21.69/4.05 | | | REDUCE: (255), (258) imply:
% 21.69/4.05 | | | (259) $false
% 21.69/4.05 | | |
% 21.69/4.05 | | | CLOSE: (259) is inconsistent.
% 21.69/4.05 | | |
% 21.69/4.05 | | Case 2:
% 21.69/4.05 | | |
% 21.69/4.06 | | | (260) ? [v0: Tree] : ? [v1: Tree] : (left:(Tree)>Tree(all_13_9) = v0
% 21.69/4.06 | | | & right:(Tree)>Tree(all_13_9) = v1 &
% 21.69/4.06 | | | node:(Int*Tree*Tree)>Tree(all_13_7, v0, v1) = all_13_9 &
% 21.69/4.06 | | | Tree(v1) & Tree(v0))
% 21.69/4.06 | | |
% 21.69/4.06 | | | DELTA: instantiating (260) with fresh symbols all_45_0, all_45_1 gives:
% 21.69/4.06 | | | (261) left:(Tree)>Tree(all_13_9) = all_45_1 &
% 21.69/4.06 | | | right:(Tree)>Tree(all_13_9) = all_45_0 &
% 21.69/4.06 | | | node:(Int*Tree*Tree)>Tree(all_13_7, all_45_1, all_45_0) =
% 21.69/4.06 | | | all_13_9 & Tree(all_45_0) & Tree(all_45_1)
% 21.69/4.06 | | |
% 21.69/4.06 | | | ALPHA: (261) implies:
% 21.69/4.06 | | | (262) right:(Tree)>Tree(all_13_9) = all_45_0
% 21.69/4.06 | | | (263) left:(Tree)>Tree(all_13_9) = all_45_1
% 21.69/4.06 | | |
% 21.69/4.06 | | | BETA: splitting (34) gives:
% 21.69/4.06 | | |
% 21.69/4.06 | | | Case 1:
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | (264) all_13_9 = empty:Tree
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | REDUCE: (255), (264) imply:
% 21.69/4.06 | | | | (265) $false
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | CLOSE: (265) is inconsistent.
% 21.69/4.06 | | | |
% 21.69/4.06 | | | Case 2:
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | (266) ? [v0: int] : ? [v1: Tree] : (val:(Tree)>Int(all_13_9) = v0 &
% 21.69/4.06 | | | | right:(Tree)>Tree(all_13_9) = v1 &
% 21.69/4.06 | | | | node:(Int*Tree*Tree)>Tree(v0, all_13_6, v1) = all_13_9 &
% 21.69/4.06 | | | | Tree(v1))
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | DELTA: instantiating (266) with fresh symbols all_51_0, all_51_1 gives:
% 21.69/4.06 | | | | (267) val:(Tree)>Int(all_13_9) = all_51_1 &
% 21.69/4.06 | | | | right:(Tree)>Tree(all_13_9) = all_51_0 &
% 21.69/4.06 | | | | node:(Int*Tree*Tree)>Tree(all_51_1, all_13_6, all_51_0) =
% 21.69/4.06 | | | | all_13_9 & Tree(all_51_0)
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | ALPHA: (267) implies:
% 21.69/4.06 | | | | (268) right:(Tree)>Tree(all_13_9) = all_51_0
% 21.69/4.06 | | | | (269) val:(Tree)>Int(all_13_9) = all_51_1
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | BETA: splitting (31) gives:
% 21.69/4.06 | | | |
% 21.69/4.06 | | | | Case 1:
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | (270) all_13_9 = empty:Tree
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | REDUCE: (255), (270) imply:
% 21.69/4.06 | | | | | (271) $false
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | CLOSE: (271) is inconsistent.
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | Case 2:
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | (272) ? [v0: int] : ? [v1: Tree] : (val:(Tree)>Int(all_13_9) = v0
% 21.69/4.06 | | | | | & left:(Tree)>Tree(all_13_9) = v1 &
% 21.69/4.06 | | | | | node:(Int*Tree*Tree)>Tree(v0, v1, all_13_5) = all_13_9 &
% 21.69/4.06 | | | | | Tree(v1))
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | DELTA: instantiating (272) with fresh symbols all_57_0, all_57_1
% 21.69/4.06 | | | | | gives:
% 21.69/4.06 | | | | | (273) val:(Tree)>Int(all_13_9) = all_57_1 &
% 21.69/4.06 | | | | | left:(Tree)>Tree(all_13_9) = all_57_0 &
% 21.69/4.06 | | | | | node:(Int*Tree*Tree)>Tree(all_57_1, all_57_0, all_13_5) =
% 21.69/4.06 | | | | | all_13_9 & Tree(all_57_0)
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | ALPHA: (273) implies:
% 21.69/4.06 | | | | | (274) left:(Tree)>Tree(all_13_9) = all_57_0
% 21.69/4.06 | | | | | (275) val:(Tree)>Int(all_13_9) = all_57_1
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | BETA: splitting (36) gives:
% 21.69/4.06 | | | | |
% 21.69/4.06 | | | | | Case 1:
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | (276) all_13_9 = empty:Tree
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | REDUCE: (255), (276) imply:
% 21.69/4.06 | | | | | | (277) $false
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | CLOSE: (277) is inconsistent.
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | Case 2:
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | (278) ? [v0: any] : ? [v1: Tree] : ? [v2: any] : ? [v3: Tree]
% 21.69/4.06 | | | | | | : ? [v4: any] : (searchtree(v3) = v4 & searchtree(v1) = v2
% 21.69/4.06 | | | | | | & searchtree(all_13_9) = v0 & left:(Tree)>Tree(all_13_9)
% 21.69/4.06 | | | | | | = v1 & right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) &
% 21.69/4.06 | | | | | | Tree(v1) & ( ~ (v0 = 0) | (v4 = 0 & v2 = 0 & ! [v5: int]
% 21.69/4.06 | | | | | | : ( ~ ($lesseq(v5, all_13_7)) | ~ (in(v5, v3) = 0))
% 21.69/4.06 | | | | | | & ! [v5: int] : ( ~ ($lesseq(1, $difference(v5,
% 21.69/4.06 | | | | | | all_13_7))) | ~ (in(v5, v1) = 0)))))
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | DELTA: instantiating (278) with fresh symbols all_63_0, all_63_1,
% 21.69/4.06 | | | | | | all_63_2, all_63_3, all_63_4 gives:
% 21.69/4.06 | | | | | | (279) searchtree(all_63_1) = all_63_0 & searchtree(all_63_3) =
% 21.69/4.06 | | | | | | all_63_2 & searchtree(all_13_9) = all_63_4 &
% 21.69/4.06 | | | | | | left:(Tree)>Tree(all_13_9) = all_63_3 &
% 21.69/4.06 | | | | | | right:(Tree)>Tree(all_13_9) = all_63_1 & Tree(all_63_1) &
% 21.69/4.06 | | | | | | Tree(all_63_3) & ( ~ (all_63_4 = 0) | (all_63_0 = 0 &
% 21.69/4.06 | | | | | | all_63_2 = 0 & ! [v0: int] : ( ~ ($lesseq(v0,
% 21.69/4.06 | | | | | | all_13_7)) | ~ (in(v0, all_63_1) = 0)) & ! [v0:
% 21.69/4.06 | | | | | | int] : ( ~ ($lesseq(1, $difference(v0, all_13_7))) |
% 21.69/4.06 | | | | | | ~ (in(v0, all_63_3) = 0))))
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | ALPHA: (279) implies:
% 21.69/4.06 | | | | | | (280) right:(Tree)>Tree(all_13_9) = all_63_1
% 21.69/4.06 | | | | | | (281) left:(Tree)>Tree(all_13_9) = all_63_3
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | BETA: splitting (30) gives:
% 21.69/4.06 | | | | | |
% 21.69/4.06 | | | | | | Case 1:
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | (282) all_13_9 = empty:Tree
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | REDUCE: (255), (282) imply:
% 21.69/4.06 | | | | | | | (283) $false
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | CLOSE: (283) is inconsistent.
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | Case 2:
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | (284) ? [v0: any] : ? [v1: Tree] : ? [v2: any] : ? [v3:
% 21.69/4.06 | | | | | | | any] : ? [v4: int] : (searchtree(v1) = v2 &
% 21.69/4.06 | | | | | | | searchtree(all_13_5) = v3 & searchtree(all_13_9) = v0 &
% 21.69/4.06 | | | | | | | val:(Tree)>Int(all_13_9) = v4 &
% 21.69/4.06 | | | | | | | left:(Tree)>Tree(all_13_9) = v1 & Tree(v1) & ( ~ (v0 =
% 21.69/4.06 | | | | | | | 0) | (v3 = 0 & v2 = 0 & ! [v5: int] : ( ~
% 21.69/4.06 | | | | | | | ($lesseq(v5, v4)) | ~ (in(v5, all_13_5) = 0)) &
% 21.69/4.06 | | | | | | | ! [v5: int] : ( ~ ($lesseq(1, $difference(v5, v4)))
% 21.69/4.06 | | | | | | | | ~ (in(v5, v1) = 0)))))
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | DELTA: instantiating (284) with fresh symbols all_69_0, all_69_1,
% 21.69/4.06 | | | | | | | all_69_2, all_69_3, all_69_4 gives:
% 21.69/4.06 | | | | | | | (285) searchtree(all_69_3) = all_69_2 & searchtree(all_13_5) =
% 21.69/4.06 | | | | | | | all_69_1 & searchtree(all_13_9) = all_69_4 &
% 21.69/4.06 | | | | | | | val:(Tree)>Int(all_13_9) = all_69_0 &
% 21.69/4.06 | | | | | | | left:(Tree)>Tree(all_13_9) = all_69_3 & Tree(all_69_3) &
% 21.69/4.06 | | | | | | | ( ~ (all_69_4 = 0) | (all_69_1 = 0 & all_69_2 = 0 & !
% 21.69/4.06 | | | | | | | [v0: int] : ( ~ ($lesseq(v0, all_69_0)) | ~ (in(v0,
% 21.69/4.06 | | | | | | | all_13_5) = 0)) & ! [v0: int] : ( ~
% 21.69/4.06 | | | | | | | ($lesseq(1, $difference(v0, all_69_0))) | ~
% 21.69/4.06 | | | | | | | (in(v0, all_69_3) = 0))))
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | ALPHA: (285) implies:
% 21.69/4.06 | | | | | | | (286) left:(Tree)>Tree(all_13_9) = all_69_3
% 21.69/4.06 | | | | | | | (287) val:(Tree)>Int(all_13_9) = all_69_0
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | BETA: splitting (40) gives:
% 21.69/4.06 | | | | | | |
% 21.69/4.06 | | | | | | | Case 1:
% 21.69/4.06 | | | | | | | |
% 21.69/4.06 | | | | | | | | (288) all_13_9 = empty:Tree
% 21.69/4.06 | | | | | | | |
% 21.69/4.06 | | | | | | | | REDUCE: (255), (288) imply:
% 21.69/4.06 | | | | | | | | (289) $false
% 21.69/4.06 | | | | | | | |
% 21.69/4.06 | | | | | | | | CLOSE: (289) is inconsistent.
% 21.69/4.06 | | | | | | | |
% 21.69/4.06 | | | | | | | Case 2:
% 21.69/4.06 | | | | | | | |
% 21.69/4.07 | | | | | | | | (290) ? [v0: Tree] : ? [v1: Tree] : ? [v2: int] :
% 21.69/4.07 | | | | | | | | (searchtree(v1) = 0 & searchtree(v0) = 0 &
% 21.69/4.07 | | | | | | | | val:(Tree)>Int(all_13_9) = v2 &
% 21.69/4.07 | | | | | | | | left:(Tree)>Tree(all_13_9) = v0 &
% 21.69/4.07 | | | | | | | | right:(Tree)>Tree(all_13_9) = v1 & Tree(v1) &
% 21.69/4.07 | | | | | | | | Tree(v0) & ! [v3: int] : ( ~ ($lesseq(v3, v2)) | ~
% 21.69/4.07 | | | | | | | | (in(v3, v1) = 0)) & ! [v3: int] : ( ~ ($lesseq(1,
% 21.69/4.07 | | | | | | | | $difference(v3, v2))) | ~ (in(v3, v0) = 0)))
% 21.69/4.07 | | | | | | | |
% 21.69/4.07 | | | | | | | | DELTA: instantiating (290) with fresh symbols all_75_0,
% 21.69/4.07 | | | | | | | | all_75_1, all_75_2 gives:
% 21.69/4.07 | | | | | | | | (291) searchtree(all_75_1) = 0 & searchtree(all_75_2) = 0 &
% 21.69/4.07 | | | | | | | | val:(Tree)>Int(all_13_9) = all_75_0 &
% 21.69/4.07 | | | | | | | | left:(Tree)>Tree(all_13_9) = all_75_2 &
% 21.69/4.07 | | | | | | | | right:(Tree)>Tree(all_13_9) = all_75_1 & Tree(all_75_1)
% 21.69/4.07 | | | | | | | | & Tree(all_75_2) & ! [v0: int] : ( ~ ($lesseq(v0,
% 21.69/4.07 | | | | | | | | all_75_0)) | ~ (in(v0, all_75_1) = 0)) & ! [v0:
% 21.69/4.07 | | | | | | | | int] : ( ~ ($lesseq(1, $difference(v0, all_75_0))) |
% 21.69/4.07 | | | | | | | | ~ (in(v0, all_75_2) = 0))
% 21.69/4.07 | | | | | | | |
% 21.69/4.07 | | | | | | | | ALPHA: (291) implies:
% 21.69/4.07 | | | | | | | | (292) right:(Tree)>Tree(all_13_9) = all_75_1
% 21.69/4.07 | | | | | | | | (293) left:(Tree)>Tree(all_13_9) = all_75_2
% 21.69/4.07 | | | | | | | | (294) val:(Tree)>Int(all_13_9) = all_75_0
% 21.69/4.07 | | | | | | | |
% 21.69/4.07 | | | | | | | | BETA: splitting (33) gives:
% 21.69/4.07 | | | | | | | |
% 21.69/4.07 | | | | | | | | Case 1:
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | (295) all_13_9 = empty:Tree
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | REDUCE: (255), (295) imply:
% 21.69/4.07 | | | | | | | | | (296) $false
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | CLOSE: (296) is inconsistent.
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | Case 2:
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | (297) ? [v0: any] : ? [v1: any] : ? [v2: Tree] : ? [v3:
% 21.69/4.07 | | | | | | | | | any] : ? [v4: int] : (searchtree(v2) = v3 &
% 21.69/4.07 | | | | | | | | | searchtree(all_13_6) = v1 & searchtree(all_13_9) =
% 21.69/4.07 | | | | | | | | | v0 & val:(Tree)>Int(all_13_9) = v4 &
% 21.69/4.07 | | | | | | | | | right:(Tree)>Tree(all_13_9) = v2 & Tree(v2) & ( ~
% 21.69/4.07 | | | | | | | | | (v0 = 0) | (v3 = 0 & v1 = 0 & ! [v5: int] : ( ~
% 21.69/4.07 | | | | | | | | | ($lesseq(v5, v4)) | ~ (in(v5, v2) = 0)) & !
% 21.69/4.07 | | | | | | | | | [v5: int] : ( ~ ($lesseq(1, $difference(v5,
% 21.69/4.07 | | | | | | | | | v4))) | ~ (in(v5, all_13_6) = 0)))))
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | DELTA: instantiating (297) with fresh symbols all_82_0,
% 21.69/4.07 | | | | | | | | | all_82_1, all_82_2, all_82_3, all_82_4 gives:
% 21.69/4.07 | | | | | | | | | (298) searchtree(all_82_2) = all_82_1 &
% 21.69/4.07 | | | | | | | | | searchtree(all_13_6) = all_82_3 &
% 21.69/4.07 | | | | | | | | | searchtree(all_13_9) = all_82_4 &
% 21.69/4.07 | | | | | | | | | val:(Tree)>Int(all_13_9) = all_82_0 &
% 21.69/4.07 | | | | | | | | | right:(Tree)>Tree(all_13_9) = all_82_2 &
% 21.69/4.07 | | | | | | | | | Tree(all_82_2) & ( ~ (all_82_4 = 0) | (all_82_1 = 0 &
% 21.69/4.07 | | | | | | | | | all_82_3 = 0 & ! [v0: int] : ( ~ ($lesseq(v0,
% 21.69/4.07 | | | | | | | | | all_82_0)) | ~ (in(v0, all_82_2) = 0)) &
% 21.69/4.07 | | | | | | | | | ! [v0: int] : ( ~ ($lesseq(1, $difference(v0,
% 21.69/4.07 | | | | | | | | | all_82_0))) | ~ (in(v0, all_13_6) =
% 21.69/4.07 | | | | | | | | | 0))))
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | ALPHA: (298) implies:
% 21.69/4.07 | | | | | | | | | (299) right:(Tree)>Tree(all_13_9) = all_82_2
% 21.69/4.07 | | | | | | | | | (300) val:(Tree)>Int(all_13_9) = all_82_0
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | BETA: splitting (39) gives:
% 21.69/4.07 | | | | | | | | |
% 21.69/4.07 | | | | | | | | | Case 1:
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | (301) all_13_9 = empty:Tree
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | REDUCE: (255), (301) imply:
% 21.69/4.07 | | | | | | | | | | (302) $false
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | CLOSE: (302) is inconsistent.
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | Case 2:
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | (303) all_13_4 = 0 | ? [v0: int] : ? [v1: Tree] : ?
% 21.69/4.07 | | | | | | | | | | [v2: int] : ? [v3: Tree] : ? [v4: int] : ( ~ (v4
% 21.69/4.07 | | | | | | | | | | = 0) & ~ (v2 = 0) & ~ (v0 = all_13_8) &
% 21.69/4.07 | | | | | | | | | | in(all_13_8, v3) = v4 & in(all_13_8, v1) = v2 &
% 21.69/4.07 | | | | | | | | | | val:(Tree)>Int(all_13_9) = v0 &
% 21.69/4.07 | | | | | | | | | | left:(Tree)>Tree(all_13_9) = v1 &
% 21.69/4.07 | | | | | | | | | | right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) &
% 21.69/4.07 | | | | | | | | | | Tree(v1))
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | BETA: splitting (303) gives:
% 21.69/4.07 | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | Case 1:
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | (304) all_13_4 = 0
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | REDUCE: (256), (304) imply:
% 21.69/4.07 | | | | | | | | | | | (305) $false
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | CLOSE: (305) is inconsistent.
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | Case 2:
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | (306) ? [v0: int] : ? [v1: Tree] : ? [v2: int] : ?
% 21.69/4.07 | | | | | | | | | | | [v3: Tree] : ? [v4: int] : ( ~ (v4 = 0) & ~ (v2
% 21.69/4.07 | | | | | | | | | | | = 0) & ~ (v0 = all_13_8) & in(all_13_8, v3) =
% 21.69/4.07 | | | | | | | | | | | v4 & in(all_13_8, v1) = v2 &
% 21.69/4.07 | | | | | | | | | | | val:(Tree)>Int(all_13_9) = v0 &
% 21.69/4.07 | | | | | | | | | | | left:(Tree)>Tree(all_13_9) = v1 &
% 21.69/4.07 | | | | | | | | | | | right:(Tree)>Tree(all_13_9) = v3 & Tree(v3) &
% 21.69/4.07 | | | | | | | | | | | Tree(v1))
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | DELTA: instantiating (306) with fresh symbols all_92_0,
% 21.69/4.07 | | | | | | | | | | | all_92_1, all_92_2, all_92_3, all_92_4 gives:
% 21.69/4.07 | | | | | | | | | | | (307) ~ (all_92_0 = 0) & ~ (all_92_2 = 0) & ~
% 21.69/4.07 | | | | | | | | | | | (all_92_4 = all_13_8) & in(all_13_8, all_92_1) =
% 21.69/4.07 | | | | | | | | | | | all_92_0 & in(all_13_8, all_92_3) = all_92_2 &
% 21.69/4.07 | | | | | | | | | | | val:(Tree)>Int(all_13_9) = all_92_4 &
% 21.69/4.07 | | | | | | | | | | | left:(Tree)>Tree(all_13_9) = all_92_3 &
% 21.69/4.07 | | | | | | | | | | | right:(Tree)>Tree(all_13_9) = all_92_1 &
% 21.69/4.07 | | | | | | | | | | | Tree(all_92_1) & Tree(all_92_3)
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | ALPHA: (307) implies:
% 21.69/4.07 | | | | | | | | | | | (308) ~ (all_92_4 = all_13_8)
% 21.69/4.07 | | | | | | | | | | | (309) ~ (all_92_2 = 0)
% 21.69/4.07 | | | | | | | | | | | (310) ~ (all_92_0 = 0)
% 21.69/4.07 | | | | | | | | | | | (311) right:(Tree)>Tree(all_13_9) = all_92_1
% 21.69/4.07 | | | | | | | | | | | (312) left:(Tree)>Tree(all_13_9) = all_92_3
% 21.69/4.07 | | | | | | | | | | | (313) val:(Tree)>Int(all_13_9) = all_92_4
% 21.69/4.07 | | | | | | | | | | | (314) in(all_13_8, all_92_3) = all_92_2
% 21.69/4.07 | | | | | | | | | | | (315) in(all_13_8, all_92_1) = all_92_0
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_13_5, all_63_1,
% 21.69/4.07 | | | | | | | | | | | all_13_9, simplifying with (24), (280) gives:
% 21.69/4.07 | | | | | | | | | | | (316) all_63_1 = all_13_5
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_45_0, all_63_1,
% 21.69/4.07 | | | | | | | | | | | all_13_9, simplifying with (262), (280) gives:
% 21.69/4.07 | | | | | | | | | | | (317) all_63_1 = all_45_0
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_63_1, all_75_1,
% 21.69/4.07 | | | | | | | | | | | all_13_9, simplifying with (280), (292) gives:
% 21.69/4.07 | | | | | | | | | | | (318) all_75_1 = all_63_1
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_75_1, all_82_2,
% 21.69/4.07 | | | | | | | | | | | all_13_9, simplifying with (292), (299) gives:
% 21.69/4.07 | | | | | | | | | | | (319) all_82_2 = all_75_1
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.07 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_82_2, all_92_1,
% 21.69/4.07 | | | | | | | | | | | all_13_9, simplifying with (299), (311) gives:
% 21.69/4.07 | | | | | | | | | | | (320) all_92_1 = all_82_2
% 21.69/4.07 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (17) with all_51_0, all_92_1,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (268), (311) gives:
% 21.69/4.08 | | | | | | | | | | | (321) all_92_1 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_13_6, all_75_2,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (25), (293) gives:
% 21.69/4.08 | | | | | | | | | | | (322) all_75_2 = all_13_6
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_69_3, all_75_2,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (286), (293) gives:
% 21.69/4.08 | | | | | | | | | | | (323) all_75_2 = all_69_3
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_63_3, all_75_2,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (281), (293) gives:
% 21.69/4.08 | | | | | | | | | | | (324) all_75_2 = all_63_3
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_45_1, all_75_2,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (263), (293) gives:
% 21.69/4.08 | | | | | | | | | | | (325) all_75_2 = all_45_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_75_2, all_92_3,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (293), (312) gives:
% 21.69/4.08 | | | | | | | | | | | (326) all_92_3 = all_75_2
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (18) with all_57_0, all_92_3,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (274), (312) gives:
% 21.69/4.08 | | | | | | | | | | | (327) all_92_3 = all_57_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_13_7, all_57_1,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (26), (275) gives:
% 21.69/4.08 | | | | | | | | | | | (328) all_57_1 = all_13_7
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_57_1, all_69_0,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (275), (287) gives:
% 21.69/4.08 | | | | | | | | | | | (329) all_69_0 = all_57_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_69_0, all_75_0,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (287), (294) gives:
% 21.69/4.08 | | | | | | | | | | | (330) all_75_0 = all_69_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_75_0, all_82_0,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (294), (300) gives:
% 21.69/4.08 | | | | | | | | | | | (331) all_82_0 = all_75_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_82_0, all_92_4,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (300), (313) gives:
% 21.69/4.08 | | | | | | | | | | | (332) all_92_4 = all_82_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | GROUND_INST: instantiating (19) with all_51_1, all_92_4,
% 21.69/4.08 | | | | | | | | | | | all_13_9, simplifying with (269), (313) gives:
% 21.69/4.08 | | | | | | | | | | | (333) all_92_4 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (320), (321) imply:
% 21.69/4.08 | | | | | | | | | | | (334) all_82_2 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (334) implies:
% 21.69/4.08 | | | | | | | | | | | (335) all_82_2 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (326), (327) imply:
% 21.69/4.08 | | | | | | | | | | | (336) all_75_2 = all_57_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (336) implies:
% 21.69/4.08 | | | | | | | | | | | (337) all_75_2 = all_57_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (332), (333) imply:
% 21.69/4.08 | | | | | | | | | | | (338) all_82_0 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (338) implies:
% 21.69/4.08 | | | | | | | | | | | (339) all_82_0 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (331), (339) imply:
% 21.69/4.08 | | | | | | | | | | | (340) all_75_0 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (340) implies:
% 21.69/4.08 | | | | | | | | | | | (341) all_75_0 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (319), (335) imply:
% 21.69/4.08 | | | | | | | | | | | (342) all_75_1 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (342) implies:
% 21.69/4.08 | | | | | | | | | | | (343) all_75_1 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (330), (341) imply:
% 21.69/4.08 | | | | | | | | | | | (344) all_69_0 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (344) implies:
% 21.69/4.08 | | | | | | | | | | | (345) all_69_0 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (318), (343) imply:
% 21.69/4.08 | | | | | | | | | | | (346) all_63_1 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (346) implies:
% 21.69/4.08 | | | | | | | | | | | (347) all_63_1 = all_51_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (323), (337) imply:
% 21.69/4.08 | | | | | | | | | | | (348) all_69_3 = all_57_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (323), (325) imply:
% 21.69/4.08 | | | | | | | | | | | (349) all_69_3 = all_45_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (323), (324) imply:
% 21.69/4.08 | | | | | | | | | | | (350) all_69_3 = all_63_3
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (322), (323) imply:
% 21.69/4.08 | | | | | | | | | | | (351) all_69_3 = all_13_6
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (329), (345) imply:
% 21.69/4.08 | | | | | | | | | | | (352) all_57_1 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | SIMP: (352) implies:
% 21.69/4.08 | | | | | | | | | | | (353) all_57_1 = all_51_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (349), (350) imply:
% 21.69/4.08 | | | | | | | | | | | (354) all_63_3 = all_45_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (350), (351) imply:
% 21.69/4.08 | | | | | | | | | | | (355) all_63_3 = all_13_6
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (348), (350) imply:
% 21.69/4.08 | | | | | | | | | | | (356) all_63_3 = all_57_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (317), (347) imply:
% 21.69/4.08 | | | | | | | | | | | (357) all_51_0 = all_45_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (316), (347) imply:
% 21.69/4.08 | | | | | | | | | | | (358) all_51_0 = all_13_5
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (354), (356) imply:
% 21.69/4.08 | | | | | | | | | | | (359) all_57_0 = all_45_1
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (355), (356) imply:
% 21.69/4.08 | | | | | | | | | | | (360) all_57_0 = all_13_6
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (359), (360) imply:
% 21.69/4.08 | | | | | | | | | | | (361) all_45_1 = all_13_6
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (328), (353) imply:
% 21.69/4.08 | | | | | | | | | | | (362) all_51_1 = all_13_7
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (357), (358) imply:
% 21.69/4.08 | | | | | | | | | | | (363) all_45_0 = all_13_5
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (333), (362) imply:
% 21.69/4.08 | | | | | | | | | | | (364) all_92_4 = all_13_7
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (327), (360) imply:
% 21.69/4.08 | | | | | | | | | | | (365) all_92_3 = all_13_6
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | COMBINE_EQS: (321), (358) imply:
% 21.69/4.08 | | | | | | | | | | | (366) all_92_1 = all_13_5
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | REDUCE: (308), (364) imply:
% 21.69/4.08 | | | | | | | | | | | (367) ~ (all_13_7 = all_13_8)
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | REDUCE: (315), (366) imply:
% 21.69/4.08 | | | | | | | | | | | (368) in(all_13_8, all_13_5) = all_92_0
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | REDUCE: (314), (365) imply:
% 21.69/4.08 | | | | | | | | | | | (369) in(all_13_8, all_13_6) = all_92_2
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | BETA: splitting (257) gives:
% 21.69/4.08 | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | Case 1:
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | (370) all_13_7 = all_13_8
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | REDUCE: (367), (370) imply:
% 21.69/4.08 | | | | | | | | | | | | (371) $false
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | CLOSE: (371) is inconsistent.
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | Case 2:
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | (372) ( ~ ($lesseq(1, $difference(all_13_8, all_13_7)))
% 21.69/4.08 | | | | | | | | | | | | | (all_13_2 = 0 & all_13_3 = all_13_5 &
% 21.69/4.08 | | | | | | | | | | | | in(all_13_8, all_13_5) = 0)) & ( ~ ($lesseq(1,
% 21.69/4.08 | | | | | | | | | | | | $difference(all_13_7, all_13_8))) |
% 21.69/4.08 | | | | | | | | | | | | (all_13_0 = 0 & all_13_1 = all_13_6 &
% 21.69/4.08 | | | | | | | | | | | | in(all_13_8, all_13_6) = 0))
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | ALPHA: (372) implies:
% 21.69/4.08 | | | | | | | | | | | | (373) ~ ($lesseq(1, $difference(all_13_7, all_13_8))) |
% 21.69/4.08 | | | | | | | | | | | | (all_13_0 = 0 & all_13_1 = all_13_6 & in(all_13_8,
% 21.69/4.08 | | | | | | | | | | | | all_13_6) = 0)
% 21.69/4.08 | | | | | | | | | | | | (374) ~ ($lesseq(1, $difference(all_13_8, all_13_7))) |
% 21.69/4.08 | | | | | | | | | | | | (all_13_2 = 0 & all_13_3 = all_13_5 & in(all_13_8,
% 21.69/4.08 | | | | | | | | | | | | all_13_5) = 0)
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | BETA: splitting (373) gives:
% 21.69/4.08 | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | Case 1:
% 21.69/4.08 | | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | | (375) $lesseq(all_13_7, all_13_8)
% 21.69/4.08 | | | | | | | | | | | | |
% 21.69/4.08 | | | | | | | | | | | | | STRENGTHEN: (367), (375) imply:
% 21.69/4.09 | | | | | | | | | | | | | (376) $lesseq(1, $difference(all_13_8, all_13_7))
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | BETA: splitting (374) gives:
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | Case 1:
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | (377) $lesseq(all_13_8, all_13_7)
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | COMBINE_INEQS: (376), (377) imply:
% 21.69/4.09 | | | | | | | | | | | | | | (378) $false
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | CLOSE: (378) is inconsistent.
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | Case 2:
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | (379) all_13_2 = 0 & all_13_3 = all_13_5 & in(all_13_8,
% 21.69/4.09 | | | | | | | | | | | | | | all_13_5) = 0
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | ALPHA: (379) implies:
% 21.69/4.09 | | | | | | | | | | | | | | (380) in(all_13_8, all_13_5) = 0
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | GROUND_INST: instantiating (21) with 0, all_92_0, all_13_5,
% 21.69/4.09 | | | | | | | | | | | | | | all_13_8, simplifying with (368), (380) gives:
% 21.69/4.09 | | | | | | | | | | | | | | (381) all_92_0 = 0
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | REDUCE: (310), (381) imply:
% 21.69/4.09 | | | | | | | | | | | | | | (382) $false
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | | CLOSE: (382) is inconsistent.
% 21.69/4.09 | | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | End of split
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | Case 2:
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | (383) all_13_0 = 0 & all_13_1 = all_13_6 & in(all_13_8,
% 21.69/4.09 | | | | | | | | | | | | | all_13_6) = 0
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | ALPHA: (383) implies:
% 21.69/4.09 | | | | | | | | | | | | | (384) in(all_13_8, all_13_6) = 0
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | GROUND_INST: instantiating (21) with 0, all_92_2, all_13_6,
% 21.69/4.09 | | | | | | | | | | | | | all_13_8, simplifying with (369), (384) gives:
% 21.69/4.09 | | | | | | | | | | | | | (385) all_92_2 = 0
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | REDUCE: (309), (385) imply:
% 21.69/4.09 | | | | | | | | | | | | | (386) $false
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | | CLOSE: (386) is inconsistent.
% 21.69/4.09 | | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | | End of split
% 21.69/4.09 | | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | | End of split
% 21.69/4.09 | | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | | End of split
% 21.69/4.09 | | | | | | | | | |
% 21.69/4.09 | | | | | | | | | End of split
% 21.69/4.09 | | | | | | | | |
% 21.69/4.09 | | | | | | | | End of split
% 21.69/4.09 | | | | | | | |
% 21.69/4.09 | | | | | | | End of split
% 21.69/4.09 | | | | | | |
% 21.69/4.09 | | | | | | End of split
% 21.69/4.09 | | | | | |
% 21.69/4.09 | | | | | End of split
% 21.69/4.09 | | | | |
% 21.69/4.09 | | | | End of split
% 21.69/4.09 | | | |
% 21.69/4.09 | | | End of split
% 21.69/4.09 | | |
% 21.69/4.09 | | End of split
% 21.69/4.09 | |
% 21.69/4.09 | End of split
% 21.69/4.09 |
% 21.69/4.09 End of proof
% 21.69/4.09 % SZS output end Proof for theBenchmark
% 21.69/4.09
% 21.69/4.09 3463ms
%------------------------------------------------------------------------------