TSTP Solution File: ARI751_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI751_1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n025.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 : Wed Aug 30 17:49:01 EDT 2023
% Result : Unsatisfiable 28.37s 4.58s
% Output : Proof 39.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI751_1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 18:10:40 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.17/0.97 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 2.17/0.97 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 2.17/0.97 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 2.17/0.97 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 2.17/0.98 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 2.17/0.99 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 2.17/1.01 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 9.31/1.99 Prover 4: Preprocessing ...
% 9.66/2.00 Prover 2: Preprocessing ...
% 9.66/2.00 Prover 6: Preprocessing ...
% 9.66/2.02 Prover 5: Preprocessing ...
% 9.66/2.02 Prover 0: Preprocessing ...
% 9.66/2.02 Prover 3: Preprocessing ...
% 9.66/2.03 Prover 1: Preprocessing ...
% 24.79/4.04 Prover 4: Warning: ignoring some quantifiers
% 24.79/4.05 Prover 1: Warning: ignoring some quantifiers
% 26.02/4.21 Prover 3: Warning: ignoring some quantifiers
% 26.02/4.22 Prover 1: Constructing countermodel ...
% 26.02/4.23 Prover 4: Constructing countermodel ...
% 26.02/4.24 Prover 3: Constructing countermodel ...
% 26.76/4.28 Prover 6: Proving ...
% 26.76/4.29 Prover 0: Proving ...
% 28.37/4.57 Prover 5: Constructing countermodel ...
% 28.37/4.57 Prover 5: proved (3943ms)
% 28.37/4.57
% 28.37/4.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.37/4.58
% 28.37/4.58 Prover 3: stopped
% 28.37/4.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 28.37/4.58 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 28.37/4.58 Prover 6: stopped
% 28.37/4.58 Prover 0: stopped
% 29.12/4.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 29.12/4.60 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 29.12/4.60 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 29.12/4.61 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 29.12/4.61 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation
% 29.12/4.63 Prover 2: Constructing countermodel ...
% 29.12/4.63 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation
% 29.12/4.63 Prover 2: stopped
% 29.12/4.65 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 29.12/4.66 Prover 13: Warning: Problem contains reals, using incomplete axiomatisation
% 33.92/5.29 Prover 10: Preprocessing ...
% 33.92/5.32 Prover 7: Preprocessing ...
% 34.68/5.35 Prover 8: Preprocessing ...
% 34.68/5.35 Prover 11: Preprocessing ...
% 34.68/5.36 Prover 13: Preprocessing ...
% 37.03/5.67 Prover 1: Found proof (size 56)
% 37.03/5.67 Prover 1: proved (5041ms)
% 37.03/5.67 Prover 10: stopped
% 37.03/5.67 Prover 4: stopped
% 37.03/5.68 Prover 7: stopped
% 37.83/5.76 Prover 11: stopped
% 38.26/5.86 Prover 13: stopped
% 38.68/6.02 Prover 8: Warning: ignoring some quantifiers
% 39.11/6.07 Prover 8: Constructing countermodel ...
% 39.11/6.08 Prover 8: stopped
% 39.11/6.08
% 39.11/6.08 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 39.11/6.08
% 39.11/6.09 % SZS output start Proof for theBenchmark
% 39.38/6.11 Assumptions after simplification:
% 39.38/6.11 ---------------------------------
% 39.38/6.11
% 39.38/6.11 (formula_141)
% 39.38/6.14 c_type(int32) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted]
% 39.38/6.14 : ! [v3: c_sorted] : ( ~ (c_sort(int32, v1) = v3) | ~ (c_sort(int32, v0) =
% 39.38/6.14 v2) | ~ c_unsorted(v1) | ~ c_unsorted(v0) | ? [v4: any] : ? [v5: int]
% 39.38/6.14 : ? [v6: int] : (eq_int32(v2, v3) = v4 & integer_of_int32(v3) = v6 &
% 39.38/6.14 integer_of_int32(v2) = v5 & c_sorted(v3) & c_sorted(v2) & ( ~ (v6 = v5) |
% 39.38/6.14 v4 = 0) & ( ~ (v4 = 0) | v6 = v5)))
% 39.38/6.14
% 39.38/6.14 (formula_145)
% 39.38/6.14 c_type(int32) & ! [v0: c_unsorted] : ! [v1: c_sorted] : ( ~ (c_sort(int32,
% 39.38/6.14 v0) = v1) | ~ c_unsorted(v0) | ? [v2: int] : ($lesseq(v2, 2147483647)
% 39.38/6.14 & $lesseq(-2147483648, v2) & integer_of_int32(v1) = v2))
% 39.38/6.14
% 39.38/6.14 (formula_170)
% 39.38/6.14 c_type(int32) & ? [v0: c_unsorted] : ? [v1: c_sorted] :
% 39.38/6.14 (integer_of_int32(v1) = 1 & c_sort(int32, v0) = v1 & c_unsorted(v0) &
% 39.38/6.14 c_sorted(v1) & ? [v2: c_unsorted] : (c_sort(int32, v2) = v1 &
% 39.38/6.14 c_unsorted(v2) & ? [v3: c_unsorted] : ? [v4: c_sorted] : (c_sort(int32,
% 39.38/6.14 v3) = v4 & c_unsorted(v3) & c_sorted(v4) & ! [v5: int] : ( ~
% 39.38/6.14 (integer_of_int32(v4) = v5) | (v4 = v1 & ~ (v5 = 1))))))
% 39.38/6.14
% 39.38/6.14 (function-axioms)
% 39.65/6.19 ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : ! [v3: int] :
% 39.65/6.19 ! [v4: int] : ! [v5: c_sorted] : ! [v6: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (store_bytes(v6, v5, v4, v3, v2) = v1) | ~ (store_bytes(v6, v5, v4, v3, v2)
% 39.65/6.19 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 39.65/6.19 c_sorted] : ! [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (valid_struct_void_P(v5, v4, v3, v2) = v1) | ~ (valid_struct_void_P(v5, v4,
% 39.65/6.19 v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool]
% 39.65/6.19 : ! [v2: c_sorted] : ! [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 =
% 39.65/6.19 v0 | ~ (valid_struct_char_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (valid_struct_char_P(v5, v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] :
% 39.65/6.19 ! [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4: int] :
% 39.65/6.19 ! [v5: c_sorted] : (v1 = v0 | ~ (valid_root_void_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (valid_root_void_P(v5, v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 39.65/6.19 [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4: int] : !
% 39.65/6.19 [v5: c_sorted] : (v1 = v0 | ~ (valid_root_char_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (valid_root_char_P(v5, v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 39.65/6.19 [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4: int] : !
% 39.65/6.19 [v5: c_sorted] : (v1 = v0 | ~ (valid_bitvector_struct_void_P(v5, v4, v3, v2)
% 39.65/6.19 = v1) | ~ (valid_bitvector_struct_void_P(v5, v4, v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (valid_bitvector_struct_char_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (valid_bitvector_struct_char_P(v5, v4, v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (strict_valid_struct_void_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (strict_valid_struct_void_P(v5, v4, v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (strict_valid_struct_char_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (strict_valid_struct_char_P(v5, v4, v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (strict_valid_root_void_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (strict_valid_root_void_P(v5, v4, v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: int] : ! [v4: int] : ! [v5: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (strict_valid_root_char_P(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (strict_valid_root_char_P(v5, v4, v3, v2) = v0)) & ! [v0: c_unsorted] : !
% 39.65/6.19 [v1: c_unsorted] : ! [v2: int] : ! [v3: int] : ! [v4: c_sorted] : ! [v5:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (select_bytes(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (select_bytes(v5, v4, v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1:
% 39.65/6.19 c_unsorted] : ! [v2: c_sorted] : ! [v3: int] : ! [v4: int] : ! [v5:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (replace_bytes(v5, v4, v3, v2) = v1) | ~
% 39.65/6.19 (replace_bytes(v5, v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.19 MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : ! [v4:
% 39.65/6.19 c_sorted] : ! [v5: c_sorted] : (v1 = v0 | ~ (not_assigns(v5, v4, v3, v2) =
% 39.65/6.19 v1) | ~ (not_assigns(v5, v4, v3, v2) = v0)) & ! [v0: MultipleValueBool]
% 39.65/6.19 : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (right_valid_struct_void_P(v4, v3, v2) = v1) | ~
% 39.65/6.19 (right_valid_struct_void_P(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] :
% 39.65/6.19 ! [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (right_valid_struct_char_P(v4, v3, v2) = v1) | ~
% 39.65/6.19 (right_valid_struct_char_P(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] :
% 39.65/6.19 ! [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (left_valid_struct_void_P(v4, v3, v2) = v1) | ~
% 39.65/6.19 (left_valid_struct_void_P(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] :
% 39.65/6.19 ! [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: int] : ! [v4:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (left_valid_struct_char_P(v4, v3, v2) = v1) | ~
% 39.65/6.19 (left_valid_struct_char_P(v4, v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1:
% 39.65/6.19 c_unsorted] : ! [v2: int] : ! [v3: int] : ! [v4: c_sorted] : (v1 = v0 |
% 39.65/6.19 ~ (extract_bytes(v4, v3, v2) = v1) | ~ (extract_bytes(v4, v3, v2) = v0)) &
% 39.65/6.19 ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: c_sorted] : ! [v4:
% 39.65/6.19 c_sorted] : (v1 = v0 | ~ (offset_max_bytes(v4, v3, v2) = v1) | ~
% 39.65/6.19 (offset_max_bytes(v4, v3, v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2:
% 39.65/6.19 int] : ! [v3: c_sorted] : ! [v4: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (offset_min_bytes(v4, v3, v2) = v1) | ~ (offset_min_bytes(v4, v3, v2) =
% 39.65/6.19 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 39.65/6.19 c_sorted] : ! [v3: c_sorted] : ! [v4: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (alloc_extends_except(v4, v3, v2) = v1) | ~ (alloc_extends_except(v4, v3,
% 39.65/6.19 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 39.65/6.19 ! [v2: int] : ! [v3: c_sorted] : ! [v4: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (alloc_fresh(v4, v3, v2) = v1) | ~ (alloc_fresh(v4, v3, v2) = v0)) & !
% 39.65/6.19 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: c_sorted] : ! [v4: c_sorted] : (v1 = v0 | ~ (fully_packed(v4, v3, v2) =
% 39.65/6.19 v1) | ~ (fully_packed(v4, v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1:
% 39.65/6.19 c_unsorted] : ! [v2: c_sorted] : ! [v3: c_sorted] : ! [v4: c_sorted] :
% 39.65/6.19 (v1 = v0 | ~ (downcast(v4, v3, v2) = v1) | ~ (downcast(v4, v3, v2) = v0)) &
% 39.65/6.19 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] :
% 39.65/6.19 ! [v3: c_sorted] : ! [v4: c_sorted] : (v1 = v0 | ~ (instanceof(v4, v3, v2) =
% 39.65/6.19 v1) | ~ (instanceof(v4, v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1:
% 39.65/6.19 c_unsorted] : ! [v2: int] : ! [v3: int] : ! [v4: c_sorted] : (v1 = v0 |
% 39.65/6.19 ~ (pset_range(v4, v3, v2) = v1) | ~ (pset_range(v4, v3, v2) = v0)) & !
% 39.65/6.19 [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : ! [v3: c_sorted]
% 39.65/6.19 : ! [v4: c_sorted] : (v1 = v0 | ~ (smtlib__store(v4, v3, v2) = v1) | ~
% 39.65/6.19 (smtlib__store(v4, v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1:
% 39.65/6.19 c_unsorted] : ! [v2: c_sorted] : ! [v3: c_sorted] : ! [v4: c_Boolean] :
% 39.65/6.19 (v1 = v0 | ~ (smtlib__ite(v4, v3, v2) = v1) | ~ (smtlib__ite(v4, v3, v2) =
% 39.65/6.19 v0)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] :
% 39.65/6.19 (v1 = v0 | ~ (real_$quotient(v3, v2) = v1) | ~ (real_$quotient(v3, v2) =
% 39.65/6.19 v0)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] :
% 39.65/6.19 (v1 = v0 | ~ (real_$product(v3, v2) = v1) | ~ (real_$product(v3, v2) = v0))
% 39.65/6.19 & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] : (v1 = v0
% 39.65/6.19 | ~ (real_$difference(v3, v2) = v1) | ~ (real_$difference(v3, v2) = v0)) &
% 39.65/6.19 ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] : (v1 = v0 |
% 39.65/6.19 ~ (real_$sum(v3, v2) = v1) | ~ (real_$sum(v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: c_sorted] : (v1 = v0 | ~ (eq_int8(v3, v2) = v1) | ~ (eq_int8(v3, v2) =
% 39.65/6.19 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 39.65/6.19 c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~ (eq_int32(v3, v2) = v1) | ~
% 39.65/6.19 (eq_int32(v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : !
% 39.65/6.19 [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~ (concat_bitvector(v3, v2) =
% 39.65/6.19 v1) | ~ (concat_bitvector(v3, v2) = v0)) & ! [v0: MultipleValueBool] :
% 39.65/6.19 ! [v1: MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 |
% 39.65/6.19 ~ (alloc_extends(v3, v2) = v1) | ~ (alloc_extends(v3, v2) = v0)) & ! [v0:
% 39.65/6.19 int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : (v1 = v0 | ~ (asr(v3,
% 39.65/6.19 v2) = v1) | ~ (asr(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] : !
% 39.65/6.19 [v2: int] : ! [v3: int] : (v1 = v0 | ~ (lsr(v3, v2) = v1) | ~ (lsr(v3, v2)
% 39.65/6.19 = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : (v1 =
% 39.65/6.19 v0 | ~ (lsl(v3, v2) = v1) | ~ (lsl(v3, v2) = v0)) & ! [v0: int] : ! [v1:
% 39.65/6.19 int] : ! [v2: int] : ! [v3: int] : (v1 = v0 | ~ (bw_and(v3, v2) = v1) |
% 39.65/6.19 ~ (bw_and(v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : !
% 39.65/6.19 [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~ (typeof(v3, v2) = v1) | ~
% 39.65/6.19 (typeof(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.19 MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (parenttag(v3, v2) = v1) | ~ (parenttag(v3, v2) = v0)) & ! [v0: c_Boolean]
% 39.65/6.19 : ! [v1: c_Boolean] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.19 (subtag_bool(v3, v2) = v1) | ~ (subtag_bool(v3, v2) = v0)) & ! [v0:
% 39.65/6.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.19 [v3: c_sorted] : (v1 = v0 | ~ (subtag(v3, v2) = v1) | ~ (subtag(v3, v2) =
% 39.65/6.19 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 39.65/6.19 c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~ (full_separated(v3, v2) = v1)
% 39.65/6.20 | ~ (full_separated(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.20 MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (valid_pset(v3, v2) = v1) | ~ (valid_pset(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : ! [v3: c_sorted] :
% 39.65/6.20 (v1 = v0 | ~ (pset_union(v3, v2) = v1) | ~ (pset_union(v3, v2) = v0)) & !
% 39.65/6.20 [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: int] : ! [v3: c_sorted] :
% 39.65/6.20 (v1 = v0 | ~ (pset_range_right(v3, v2) = v1) | ~ (pset_range_right(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: int] : ! [v3:
% 39.65/6.20 c_sorted] : (v1 = v0 | ~ (pset_range_left(v3, v2) = v1) | ~
% 39.65/6.20 (pset_range_left(v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted]
% 39.65/6.20 : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~ (pset_deref(v3, v2) =
% 39.65/6.20 v1) | ~ (pset_deref(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.20 MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (pset_included(v3, v2) = v1) | ~ (pset_included(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.20 [v3: c_sorted] : (v1 = v0 | ~ (pset_disjoint(v3, v2) = v1) | ~
% 39.65/6.20 (pset_disjoint(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.20 MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (in_pset(v3, v2) = v1) | ~ (in_pset(v3, v2) = v0)) & ! [v0: c_type] : !
% 39.65/6.20 [v1: c_type] : ! [v2: c_type] : ! [v3: c_type] : (v1 = v0 | ~ (memory(v3,
% 39.65/6.20 v2) = v1) | ~ (memory(v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1:
% 39.65/6.20 c_unsorted] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (smtlib__select(v3, v2) = v1) | ~ (smtlib__select(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 int] : ! [v1: int] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (sub_pointer(v3, v2) = v1) | ~ (sub_pointer(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 c_Boolean] : ! [v1: c_Boolean] : ! [v2: c_sorted] : ! [v3: c_sorted] :
% 39.65/6.20 (v1 = v0 | ~ (neq_pointer_bool(v3, v2) = v1) | ~ (neq_pointer_bool(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: c_sorted] : !
% 39.65/6.20 [v3: c_sorted] : (v1 = v0 | ~ (eq_pointer_bool(v3, v2) = v1) | ~
% 39.65/6.20 (eq_pointer_bool(v3, v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted]
% 39.65/6.20 : ! [v2: int] : ! [v3: c_sorted] : (v1 = v0 | ~ (shift(v3, v2) = v1) | ~
% 39.65/6.20 (shift(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.20 MultipleValueBool] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (same_block(v3, v2) = v1) | ~ (same_block(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : !
% 39.65/6.20 [v3: c_sorted] : (v1 = v0 | ~ (valid(v3, v2) = v1) | ~ (valid(v3, v2) = v0))
% 39.65/6.20 & ! [v0: int] : ! [v1: int] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 =
% 39.65/6.20 v0 | ~ (offset_min(v3, v2) = v1) | ~ (offset_min(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 int] : ! [v1: int] : ! [v2: c_sorted] : ! [v3: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (offset_max(v3, v2) = v1) | ~ (offset_max(v3, v2) = v0)) & ! [v0: $real] :
% 39.65/6.20 ! [v1: $real] : ! [v2: $real] : ! [v3: $real] : (v1 = v0 | ~ (real_min(v3,
% 39.65/6.20 v2) = v1) | ~ (real_min(v3, v2) = v0)) & ! [v0: $real] : ! [v1:
% 39.65/6.20 $real] : ! [v2: $real] : ! [v3: $real] : (v1 = v0 | ~ (real_max(v3, v2) =
% 39.65/6.20 v1) | ~ (real_max(v3, v2) = v0)) & ! [v0: c_Boolean] : ! [v1:
% 39.65/6.20 c_Boolean] : ! [v2: $real] : ! [v3: $real] : (v1 = v0 | ~
% 39.65/6.20 (neq_real_bool(v3, v2) = v1) | ~ (neq_real_bool(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 c_Boolean] : ! [v1: c_Boolean] : ! [v2: $real] : ! [v3: $real] : (v1 = v0
% 39.65/6.20 | ~ (eq_real_bool(v3, v2) = v1) | ~ (eq_real_bool(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 c_Boolean] : ! [v1: c_Boolean] : ! [v2: $real] : ! [v3: $real] : (v1 = v0
% 39.65/6.20 | ~ (ge_real_bool(v3, v2) = v1) | ~ (ge_real_bool(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $real] : ! [v3:
% 39.65/6.20 $real] : (v1 = v0 | ~ (real_$greatereq(v3, v2) = v1) | ~
% 39.65/6.20 (real_$greatereq(v3, v2) = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] :
% 39.65/6.20 ! [v2: $real] : ! [v3: $real] : (v1 = v0 | ~ (gt_real_bool(v3, v2) = v1) |
% 39.65/6.20 ~ (gt_real_bool(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.20 MultipleValueBool] : ! [v2: $real] : ! [v3: $real] : (v1 = v0 | ~
% 39.65/6.20 (real_$greater(v3, v2) = v1) | ~ (real_$greater(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 c_Boolean] : ! [v1: c_Boolean] : ! [v2: $real] : ! [v3: $real] : (v1 = v0
% 39.65/6.20 | ~ (le_real_bool(v3, v2) = v1) | ~ (le_real_bool(v3, v2) = v0)) & ! [v0:
% 39.65/6.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $real] : ! [v3:
% 39.65/6.20 $real] : (v1 = v0 | ~ (real_$lesseq(v3, v2) = v1) | ~ (real_$lesseq(v3,
% 39.65/6.20 v2) = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: $real] :
% 39.65/6.20 ! [v3: $real] : (v1 = v0 | ~ (lt_real_bool(v3, v2) = v1) | ~
% 39.65/6.20 (lt_real_bool(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 39.65/6.20 MultipleValueBool] : ! [v2: $real] : ! [v3: $real] : (v1 = v0 | ~
% 39.65/6.20 (real_$less(v3, v2) = v1) | ~ (real_$less(v3, v2) = v0)) & ! [v0: int] :
% 39.65/6.20 ! [v1: int] : ! [v2: int] : ! [v3: int] : (v1 = v0 | ~ (int_min(v3, v2) =
% 39.65/6.20 v1) | ~ (int_min(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2:
% 39.65/6.20 int] : ! [v3: int] : (v1 = v0 | ~ (int_max(v3, v2) = v1) | ~ (int_max(v3,
% 39.65/6.20 v2) = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: int] : !
% 39.65/6.20 [v3: int] : (v1 = v0 | ~ (neq_int_bool(v3, v2) = v1) | ~ (neq_int_bool(v3,
% 39.65/6.20 v2) = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: int] : !
% 39.65/6.20 [v3: int] : (v1 = v0 | ~ (eq_int_bool(v3, v2) = v1) | ~ (eq_int_bool(v3, v2)
% 39.65/6.20 = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: int] : ! [v3:
% 39.65/6.20 int] : (v1 = v0 | ~ (ge_int_bool(v3, v2) = v1) | ~ (ge_int_bool(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: int] : ! [v3:
% 39.65/6.20 int] : (v1 = v0 | ~ (gt_int_bool(v3, v2) = v1) | ~ (gt_int_bool(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: int] : ! [v3:
% 39.65/6.20 int] : (v1 = v0 | ~ (le_int_bool(v3, v2) = v1) | ~ (le_int_bool(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: int] : ! [v3:
% 39.65/6.20 int] : (v1 = v0 | ~ (lt_int_bool(v3, v2) = v1) | ~ (lt_int_bool(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: c_Boolean] : !
% 39.65/6.20 [v3: c_Boolean] : (v1 = v0 | ~ (bool_xor(v3, v2) = v1) | ~ (bool_xor(v3, v2)
% 39.65/6.20 = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: c_Boolean] : !
% 39.65/6.20 [v3: c_Boolean] : (v1 = v0 | ~ (bool_or(v3, v2) = v1) | ~ (bool_or(v3, v2) =
% 39.65/6.20 v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2: c_Boolean] : !
% 39.65/6.20 [v3: c_Boolean] : (v1 = v0 | ~ (bool_and(v3, v2) = v1) | ~ (bool_and(v3, v2)
% 39.65/6.20 = v0)) & ! [v0: c_sorted] : ! [v1: c_sorted] : ! [v2: c_unsorted] : !
% 39.65/6.20 [v3: c_type] : (v1 = v0 | ~ (c_sort(v3, v2) = v1) | ~ (c_sort(v3, v2) = v0))
% 39.65/6.20 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $real] :
% 39.65/6.20 (v1 = v0 | ~ (real_$is_int(v2) = v1) | ~ (real_$is_int(v2) = v0)) & ! [v0:
% 39.65/6.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $real] : (v1 = v0
% 39.65/6.20 | ~ (real_$is_rat(v2) = v1) | ~ (real_$is_rat(v2) = v0)) & ! [v0: $real]
% 39.65/6.20 : ! [v1: $real] : ! [v2: $real] : (v1 = v0 | ~ (real_$floor(v2) = v1) | ~
% 39.65/6.20 (real_$floor(v2) = v0)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] :
% 39.65/6.20 (v1 = v0 | ~ (real_$ceiling(v2) = v1) | ~ (real_$ceiling(v2) = v0)) & !
% 39.65/6.20 [v0: $real] : ! [v1: $real] : ! [v2: $real] : (v1 = v0 | ~
% 39.65/6.20 (real_$truncate(v2) = v1) | ~ (real_$truncate(v2) = v0)) & ! [v0: $real] :
% 39.65/6.20 ! [v1: $real] : ! [v2: $real] : (v1 = v0 | ~ (real_$round(v2) = v1) | ~
% 39.65/6.20 (real_$round(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: $real] : (v1
% 39.65/6.20 = v0 | ~ (real_$to_int(v2) = v1) | ~ (real_$to_int(v2) = v0)) & ! [v0:
% 39.65/6.20 $rat] : ! [v1: $rat] : ! [v2: $real] : (v1 = v0 | ~ (real_$to_rat(v2) =
% 39.65/6.20 v1) | ~ (real_$to_rat(v2) = v0)) & ! [v0: $real] : ! [v1: $real] : !
% 39.65/6.20 [v2: $real] : (v1 = v0 | ~ (real_$to_real(v2) = v1) | ~ (real_$to_real(v2) =
% 39.65/6.20 v0)) & ! [v0: $real] : ! [v1: $real] : ! [v2: int] : (v1 = v0 | ~
% 39.65/6.20 (int_$to_real(v2) = v1) | ~ (int_$to_real(v2) = v0)) & ! [v0: c_unsorted]
% 39.65/6.20 : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (void_P_of_pointer_address(v2) = v1) | ~ (void_P_of_pointer_address(v2) =
% 39.65/6.20 v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: int] : (v1 = v0
% 39.65/6.20 | ~ (int8_of_integer(v2) = v1) | ~ (int8_of_integer(v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: int] : (v1 = v0 | ~
% 39.65/6.20 (int32_of_integer(v2) = v1) | ~ (int32_of_integer(v2) = v0)) & ! [v0: int]
% 39.65/6.20 : ! [v1: int] : ! [v2: c_sorted] : (v1 = v0 | ~ (integer_of_int8(v2) = v1)
% 39.65/6.20 | ~ (integer_of_int8(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2:
% 39.65/6.20 c_sorted] : (v1 = v0 | ~ (integer_of_int32(v2) = v1) | ~
% 39.65/6.20 (integer_of_int32(v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] :
% 39.65/6.20 ! [v2: c_sorted] : (v1 = v0 | ~ (pointer_address(v2) = v1) | ~
% 39.65/6.20 (pointer_address(v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : !
% 39.65/6.20 [v2: c_sorted] : (v1 = v0 | ~ (char_P_of_pointer_address(v2) = v1) | ~
% 39.65/6.20 (char_P_of_pointer_address(v2) = v0)) & ! [v0: int] : ! [v1: int] : !
% 39.65/6.20 [v2: c_sorted] : (v1 = v0 | ~ (int_of_tag(v2) = v1) | ~ (int_of_tag(v2) =
% 39.65/6.20 v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1
% 39.65/6.20 = v0 | ~ (void_P_of_bitvector(v2) = v1) | ~ (void_P_of_bitvector(v2) =
% 39.65/6.20 v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1
% 39.65/6.20 = v0 | ~ (bitvector_of_void_P(v2) = v1) | ~ (bitvector_of_void_P(v2) =
% 39.65/6.20 v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1
% 39.65/6.20 = v0 | ~ (int8_of_bitvector(v2) = v1) | ~ (int8_of_bitvector(v2) = v0)) &
% 39.65/6.20 ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (bitvector_of_int8(v2) = v1) | ~ (bitvector_of_int8(v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (int32_of_bitvector(v2) = v1) | ~ (int32_of_bitvector(v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (bitvector_of_int32(v2) = v1) | ~ (bitvector_of_int32(v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (char_P_of_bitvector(v2) = v1) | ~ (char_P_of_bitvector(v2) = v0)) & !
% 39.65/6.20 [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (bitvector_of_char_P(v2) = v1) | ~ (bitvector_of_char_P(v2) = v0)) & !
% 39.65/6.20 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: c_sorted] : (v1
% 39.65/6.20 = v0 | ~ (root_tag(v2) = v1) | ~ (root_tag(v2) = v0)) & ! [v0: c_type] :
% 39.65/6.20 ! [v1: c_type] : ! [v2: c_type] : (v1 = v0 | ~ (tag_table(v2) = v1) | ~
% 39.65/6.20 (tag_table(v2) = v0)) & ! [v0: c_type] : ! [v1: c_type] : ! [v2: c_type]
% 39.65/6.20 : (v1 = v0 | ~ (tag_id(v2) = v1) | ~ (tag_id(v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (pset_singleton(v2) = v1) | ~ (pset_singleton(v2) = v0)) & ! [v0:
% 39.65/6.20 c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (pset_all(v2) = v1) | ~ (pset_all(v2) = v0)) & ! [v0: c_type] : ! [v1:
% 39.65/6.20 c_type] : ! [v2: c_type] : (v1 = v0 | ~ (pset(v2) = v1) | ~ (pset(v2) =
% 39.65/6.20 v0)) & ! [v0: int] : ! [v1: int] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.20 (address(v2) = v1) | ~ (address(v2) = v0)) & ! [v0: c_type] : ! [v1:
% 39.65/6.20 c_type] : ! [v2: c_type] : (v1 = v0 | ~ (block(v2) = v1) | ~ (block(v2) =
% 39.65/6.20 v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : (v1
% 39.65/6.20 = v0 | ~ (base_block(v2) = v1) | ~ (base_block(v2) = v0)) & ! [v0:
% 39.65/6.20 c_type] : ! [v1: c_type] : ! [v2: c_type] : (v1 = v0 | ~ (alloc_table(v2)
% 39.65/6.20 = v1) | ~ (alloc_table(v2) = v0)) & ! [v0: c_type] : ! [v1: c_type] :
% 39.65/6.20 ! [v2: c_type] : (v1 = v0 | ~ (pointer(v2) = v1) | ~ (pointer(v2) = v0)) &
% 39.65/6.20 ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : (v1 = v0 | ~ (exp(v2) = v1)
% 39.65/6.20 | ~ (exp(v2) = v0)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] :
% 39.65/6.20 (v1 = v0 | ~ (log(v2) = v1) | ~ (log(v2) = v0)) & ! [v0: $real] : ! [v1:
% 39.65/6.20 $real] : ! [v2: $real] : (v1 = v0 | ~ (real_$uminus(v2) = v1) | ~
% 39.65/6.20 (real_$uminus(v2) = v0)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real]
% 39.65/6.20 : (v1 = v0 | ~ (abs_real(v2) = v1) | ~ (abs_real(v2) = v0)) & ! [v0: int] :
% 39.65/6.20 ! [v1: int] : ! [v2: int] : (v1 = v0 | ~ (abs_int(v2) = v1) | ~
% 39.65/6.20 (abs_int(v2) = v0)) & ! [v0: c_Boolean] : ! [v1: c_Boolean] : ! [v2:
% 39.65/6.20 c_Boolean] : (v1 = v0 | ~ (bool_not(v2) = v1) | ~ (bool_not(v2) = v0)) &
% 39.65/6.20 ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: Unit] : (v1 = v0 | ~
% 39.65/6.20 (unit2u(v2) = v1) | ~ (unit2u(v2) = v0)) & ! [v0: Unit] : ! [v1: Unit] :
% 39.65/6.20 ! [v2: c_sorted] : (v1 = v0 | ~ (s2unit(v2) = v1) | ~ (s2unit(v2) = v0)) &
% 39.65/6.20 ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: $real] : (v1 = v0 | ~
% 39.65/6.20 (real2u(v2) = v1) | ~ (real2u(v2) = v0)) & ! [v0: $real] : ! [v1: $real]
% 39.65/6.20 : ! [v2: c_sorted] : (v1 = v0 | ~ (s2real(v2) = v1) | ~ (s2real(v2) = v0))
% 39.65/6.20 & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_Boolean] : (v1 = v0 |
% 39.65/6.20 ~ (bool2u(v2) = v1) | ~ (bool2u(v2) = v0)) & ! [v0: c_Boolean] : ! [v1:
% 39.65/6.20 c_Boolean] : ! [v2: c_sorted] : (v1 = v0 | ~ (s2bool(v2) = v1) | ~
% 39.65/6.20 (s2bool(v2) = v0)) & ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2:
% 39.65/6.20 int] : (v1 = v0 | ~ (int2u(v2) = v1) | ~ (int2u(v2) = v0)) & ! [v0: int]
% 39.65/6.20 : ! [v1: int] : ! [v2: c_sorted] : (v1 = v0 | ~ (s2int(v2) = v1) | ~
% 39.65/6.20 (s2int(v2) = v0))
% 39.65/6.20
% 39.65/6.20 Further assumptions not needed in the proof:
% 39.65/6.20 --------------------------------------------
% 39.65/6.20 formula_1, formula_10, formula_100, formula_101, formula_102, formula_103,
% 39.65/6.20 formula_104, formula_105, formula_106, formula_107, formula_108, formula_109,
% 39.65/6.20 formula_11, formula_110, formula_111, formula_112, formula_113, formula_114,
% 39.65/6.20 formula_115, formula_116, formula_117, formula_118, formula_119, formula_12,
% 39.65/6.20 formula_120, formula_121, formula_122, formula_123, formula_124, formula_125,
% 39.65/6.20 formula_126, formula_127, formula_128, formula_129, formula_13, formula_130,
% 39.65/6.20 formula_131, formula_132, formula_133, formula_134, formula_135, formula_136,
% 39.65/6.20 formula_137, formula_138, formula_139, formula_14, formula_140, formula_142,
% 39.65/6.20 formula_143, formula_144, formula_146, formula_147, formula_148, formula_149,
% 39.65/6.20 formula_15, formula_150, formula_151, formula_152, formula_153, formula_154,
% 39.65/6.20 formula_155, formula_156, formula_157, formula_158, formula_159, formula_16,
% 39.65/6.20 formula_160, formula_161, formula_162, formula_163, formula_164, formula_165,
% 39.65/6.20 formula_166, formula_167, formula_168, formula_169, formula_17, formula_18,
% 39.65/6.20 formula_19, formula_2, formula_20, formula_21, formula_22, formula_23,
% 39.65/6.20 formula_24, formula_25, formula_26, formula_27, formula_28, formula_29,
% 39.65/6.20 formula_3, formula_30, formula_31, formula_32, formula_33, formula_34,
% 39.65/6.20 formula_35, formula_36, formula_37, formula_38, formula_39, formula_4,
% 39.65/6.20 formula_40, formula_41, formula_42, formula_43, formula_44, formula_45,
% 39.65/6.20 formula_46, formula_47, formula_48, formula_49, formula_5, formula_50,
% 39.65/6.20 formula_51, formula_52, formula_53, formula_54, formula_55, formula_56,
% 39.65/6.20 formula_57, formula_58, formula_59, formula_6, formula_60, formula_61,
% 39.65/6.20 formula_62, formula_63, formula_64, formula_65, formula_66, formula_67,
% 39.65/6.20 formula_68, formula_69, formula_7, formula_70, formula_71, formula_72,
% 39.65/6.20 formula_73, formula_74, formula_75, formula_76, formula_77, formula_78,
% 39.65/6.20 formula_79, formula_8, formula_80, formula_81, formula_82, formula_83,
% 39.65/6.20 formula_84, formula_85, formula_86, formula_87, formula_88, formula_89,
% 39.65/6.20 formula_9, formula_90, formula_91, formula_92, formula_93, formula_94,
% 39.65/6.20 formula_95, formula_96, formula_97, formula_98, formula_99
% 39.65/6.20
% 39.65/6.20 Those formulas are unsatisfiable:
% 39.65/6.20 ---------------------------------
% 39.65/6.20
% 39.65/6.20 Begin of proof
% 39.65/6.20 |
% 39.65/6.20 | ALPHA: (formula_141) implies:
% 39.65/6.21 | (1) ! [v0: c_unsorted] : ! [v1: c_unsorted] : ! [v2: c_sorted] : ! [v3:
% 39.65/6.21 | c_sorted] : ( ~ (c_sort(int32, v1) = v3) | ~ (c_sort(int32, v0) =
% 39.65/6.21 | v2) | ~ c_unsorted(v1) | ~ c_unsorted(v0) | ? [v4: any] : ?
% 39.65/6.21 | [v5: int] : ? [v6: int] : (eq_int32(v2, v3) = v4 &
% 39.65/6.21 | integer_of_int32(v3) = v6 & integer_of_int32(v2) = v5 &
% 39.65/6.21 | c_sorted(v3) & c_sorted(v2) & ( ~ (v6 = v5) | v4 = 0) & ( ~ (v4 =
% 39.65/6.21 | 0) | v6 = v5)))
% 39.65/6.21 |
% 39.65/6.21 | ALPHA: (formula_145) implies:
% 39.65/6.21 | (2) ! [v0: c_unsorted] : ! [v1: c_sorted] : ( ~ (c_sort(int32, v0) = v1)
% 39.65/6.21 | | ~ c_unsorted(v0) | ? [v2: int] : ($lesseq(v2, 2147483647) &
% 39.65/6.21 | $lesseq(-2147483648, v2) & integer_of_int32(v1) = v2))
% 39.65/6.21 |
% 39.65/6.21 | ALPHA: (formula_170) implies:
% 39.65/6.21 | (3) ? [v0: c_unsorted] : ? [v1: c_sorted] : (integer_of_int32(v1) = 1 &
% 39.65/6.21 | c_sort(int32, v0) = v1 & c_unsorted(v0) & c_sorted(v1) & ? [v2:
% 39.65/6.21 | c_unsorted] : (c_sort(int32, v2) = v1 & c_unsorted(v2) & ? [v3:
% 39.65/6.21 | c_unsorted] : ? [v4: c_sorted] : (c_sort(int32, v3) = v4 &
% 39.65/6.21 | c_unsorted(v3) & c_sorted(v4) & ! [v5: int] : ( ~
% 39.65/6.21 | (integer_of_int32(v4) = v5) | (v4 = v1 & ~ (v5 = 1))))))
% 39.65/6.21 |
% 39.65/6.21 | ALPHA: (function-axioms) implies:
% 39.65/6.21 | (4) ! [v0: int] : ! [v1: int] : ! [v2: c_sorted] : (v1 = v0 | ~
% 39.65/6.21 | (integer_of_int32(v2) = v1) | ~ (integer_of_int32(v2) = v0))
% 39.65/6.21 |
% 39.65/6.21 | DELTA: instantiating (3) with fresh symbols all_109_0, all_109_1 gives:
% 39.65/6.21 | (5) integer_of_int32(all_109_0) = 1 & c_sort(int32, all_109_1) = all_109_0
% 39.65/6.21 | & c_unsorted(all_109_1) & c_sorted(all_109_0) & ? [v0: c_unsorted] :
% 39.65/6.21 | (c_sort(int32, v0) = all_109_0 & c_unsorted(v0) & ? [v1: c_unsorted] :
% 39.65/6.21 | ? [v2: c_sorted] : (c_sort(int32, v1) = v2 & c_unsorted(v1) &
% 39.65/6.21 | c_sorted(v2) & ! [v3: int] : ( ~ (integer_of_int32(v2) = v3) | (v2
% 39.65/6.21 | = all_109_0 & ~ (v3 = 1)))))
% 39.65/6.21 |
% 39.65/6.21 | ALPHA: (5) implies:
% 39.65/6.21 | (6) c_unsorted(all_109_1)
% 39.65/6.21 | (7) c_sort(int32, all_109_1) = all_109_0
% 39.65/6.21 | (8) integer_of_int32(all_109_0) = 1
% 39.65/6.21 | (9) ? [v0: c_unsorted] : (c_sort(int32, v0) = all_109_0 & c_unsorted(v0) &
% 39.65/6.21 | ? [v1: c_unsorted] : ? [v2: c_sorted] : (c_sort(int32, v1) = v2 &
% 39.65/6.21 | c_unsorted(v1) & c_sorted(v2) & ! [v3: int] : ( ~
% 39.65/6.21 | (integer_of_int32(v2) = v3) | (v2 = all_109_0 & ~ (v3 = 1)))))
% 39.65/6.21 |
% 39.65/6.21 | DELTA: instantiating (9) with fresh symbol all_286_0 gives:
% 39.65/6.21 | (10) c_sort(int32, all_286_0) = all_109_0 & c_unsorted(all_286_0) & ? [v0:
% 39.65/6.21 | c_unsorted] : ? [v1: c_sorted] : (c_sort(int32, v0) = v1 &
% 39.65/6.21 | c_unsorted(v0) & c_sorted(v1) & ! [v2: int] : ( ~
% 39.65/6.21 | (integer_of_int32(v1) = v2) | (v1 = all_109_0 & ~ (v2 = 1))))
% 39.65/6.21 |
% 39.65/6.21 | ALPHA: (10) implies:
% 39.65/6.21 | (11) c_unsorted(all_286_0)
% 39.65/6.21 | (12) c_sort(int32, all_286_0) = all_109_0
% 39.65/6.21 | (13) ? [v0: c_unsorted] : ? [v1: c_sorted] : (c_sort(int32, v0) = v1 &
% 39.65/6.21 | c_unsorted(v0) & c_sorted(v1) & ! [v2: int] : ( ~
% 39.65/6.21 | (integer_of_int32(v1) = v2) | (v1 = all_109_0 & ~ (v2 = 1))))
% 39.65/6.21 |
% 39.65/6.21 | DELTA: instantiating (13) with fresh symbols all_321_0, all_321_1 gives:
% 39.65/6.21 | (14) c_sort(int32, all_321_1) = all_321_0 & c_unsorted(all_321_1) &
% 39.65/6.21 | c_sorted(all_321_0) & ! [v0: int] : ( ~ (integer_of_int32(all_321_0)
% 39.65/6.21 | = v0) | (all_321_0 = all_109_0 & ~ (v0 = 1)))
% 39.65/6.21 |
% 39.65/6.21 | ALPHA: (14) implies:
% 39.65/6.22 | (15) c_unsorted(all_321_1)
% 39.65/6.22 | (16) c_sort(int32, all_321_1) = all_321_0
% 39.65/6.22 | (17) ! [v0: int] : ( ~ (integer_of_int32(all_321_0) = v0) | (all_321_0 =
% 39.65/6.22 | all_109_0 & ~ (v0 = 1)))
% 39.65/6.22 |
% 39.65/6.22 | GROUND_INST: instantiating (1) with all_109_1, all_286_0, all_109_0,
% 39.65/6.22 | all_109_0, simplifying with (6), (7), (11), (12) gives:
% 39.65/6.22 | (18) ? [v0: any] : ? [v1: int] : ? [v2: int] : (eq_int32(all_109_0,
% 39.65/6.22 | all_109_0) = v0 & integer_of_int32(all_109_0) = v2 &
% 39.65/6.22 | integer_of_int32(all_109_0) = v1 & c_sorted(all_109_0) & ( ~ (v2 =
% 39.65/6.22 | v1) | v0 = 0) & ( ~ (v0 = 0) | v2 = v1))
% 39.65/6.22 |
% 39.65/6.22 | GROUND_INST: instantiating (1) with all_321_1, all_321_1, all_321_0,
% 39.65/6.22 | all_321_0, simplifying with (15), (16) gives:
% 39.65/6.22 | (19) ? [v0: any] : ? [v1: int] : ? [v2: int] : (eq_int32(all_321_0,
% 39.65/6.22 | all_321_0) = v0 & integer_of_int32(all_321_0) = v2 &
% 39.65/6.22 | integer_of_int32(all_321_0) = v1 & c_sorted(all_321_0) & ( ~ (v2 =
% 39.65/6.22 | v1) | v0 = 0) & ( ~ (v0 = 0) | v2 = v1))
% 39.65/6.22 |
% 39.65/6.22 | GROUND_INST: instantiating (1) with all_109_1, all_321_1, all_109_0,
% 39.65/6.22 | all_321_0, simplifying with (6), (7), (15), (16) gives:
% 39.65/6.22 | (20) ? [v0: any] : ? [v1: int] : ? [v2: int] : (eq_int32(all_109_0,
% 39.65/6.22 | all_321_0) = v0 & integer_of_int32(all_321_0) = v2 &
% 39.65/6.22 | integer_of_int32(all_109_0) = v1 & c_sorted(all_321_0) &
% 39.65/6.22 | c_sorted(all_109_0) & ( ~ (v2 = v1) | v0 = 0) & ( ~ (v0 = 0) | v2 =
% 39.65/6.22 | v1))
% 39.65/6.22 |
% 39.65/6.22 | GROUND_INST: instantiating (1) with all_321_1, all_109_1, all_321_0,
% 39.65/6.22 | all_109_0, simplifying with (6), (7), (15), (16) gives:
% 39.65/6.22 | (21) ? [v0: any] : ? [v1: int] : ? [v2: int] : (eq_int32(all_321_0,
% 39.65/6.22 | all_109_0) = v0 & integer_of_int32(all_321_0) = v1 &
% 39.65/6.22 | integer_of_int32(all_109_0) = v2 & c_sorted(all_321_0) &
% 39.65/6.22 | c_sorted(all_109_0) & ( ~ (v2 = v1) | v0 = 0) & ( ~ (v0 = 0) | v2 =
% 39.65/6.22 | v1))
% 39.65/6.22 |
% 39.65/6.22 | GROUND_INST: instantiating (2) with all_321_1, all_321_0, simplifying with
% 39.65/6.22 | (15), (16) gives:
% 39.65/6.22 | (22) ? [v0: int] : ($lesseq(v0, 2147483647) & $lesseq(-2147483648, v0) &
% 39.65/6.22 | integer_of_int32(all_321_0) = v0)
% 39.65/6.22 |
% 39.65/6.22 | DELTA: instantiating (22) with fresh symbol all_354_0 gives:
% 39.65/6.22 | (23) $lesseq(all_354_0, 2147483647) & $lesseq(-2147483648, all_354_0) &
% 39.65/6.22 | integer_of_int32(all_321_0) = all_354_0
% 39.65/6.22 |
% 39.65/6.22 | ALPHA: (23) implies:
% 39.65/6.22 | (24) integer_of_int32(all_321_0) = all_354_0
% 39.65/6.22 |
% 39.65/6.22 | DELTA: instantiating (19) with fresh symbols all_409_0, all_409_1, all_409_2
% 39.65/6.22 | gives:
% 39.65/6.22 | (25) eq_int32(all_321_0, all_321_0) = all_409_2 &
% 39.65/6.22 | integer_of_int32(all_321_0) = all_409_0 & integer_of_int32(all_321_0)
% 39.65/6.22 | = all_409_1 & c_sorted(all_321_0) & ( ~ (all_409_0 = all_409_1) |
% 39.65/6.22 | all_409_2 = 0) & ( ~ (all_409_2 = 0) | all_409_0 = all_409_1)
% 39.65/6.22 |
% 39.65/6.22 | ALPHA: (25) implies:
% 39.65/6.22 | (26) integer_of_int32(all_321_0) = all_409_1
% 39.65/6.22 | (27) integer_of_int32(all_321_0) = all_409_0
% 39.65/6.22 |
% 39.65/6.22 | DELTA: instantiating (18) with fresh symbols all_411_0, all_411_1, all_411_2
% 39.65/6.22 | gives:
% 39.65/6.22 | (28) eq_int32(all_109_0, all_109_0) = all_411_2 &
% 39.65/6.22 | integer_of_int32(all_109_0) = all_411_0 & integer_of_int32(all_109_0)
% 39.65/6.22 | = all_411_1 & c_sorted(all_109_0) & ( ~ (all_411_0 = all_411_1) |
% 39.65/6.22 | all_411_2 = 0) & ( ~ (all_411_2 = 0) | all_411_0 = all_411_1)
% 39.65/6.22 |
% 39.65/6.22 | ALPHA: (28) implies:
% 39.65/6.22 | (29) integer_of_int32(all_109_0) = all_411_1
% 39.65/6.22 | (30) integer_of_int32(all_109_0) = all_411_0
% 39.65/6.22 |
% 39.65/6.22 | DELTA: instantiating (20) with fresh symbols all_413_0, all_413_1, all_413_2
% 39.65/6.22 | gives:
% 39.65/6.22 | (31) eq_int32(all_109_0, all_321_0) = all_413_2 &
% 39.65/6.22 | integer_of_int32(all_321_0) = all_413_0 & integer_of_int32(all_109_0)
% 39.65/6.22 | = all_413_1 & c_sorted(all_321_0) & c_sorted(all_109_0) & ( ~
% 39.65/6.22 | (all_413_0 = all_413_1) | all_413_2 = 0) & ( ~ (all_413_2 = 0) |
% 39.65/6.22 | all_413_0 = all_413_1)
% 39.65/6.22 |
% 39.65/6.23 | ALPHA: (31) implies:
% 39.65/6.23 | (32) integer_of_int32(all_109_0) = all_413_1
% 39.65/6.23 | (33) integer_of_int32(all_321_0) = all_413_0
% 39.65/6.23 |
% 39.65/6.23 | DELTA: instantiating (21) with fresh symbols all_415_0, all_415_1, all_415_2
% 39.65/6.23 | gives:
% 39.65/6.23 | (34) eq_int32(all_321_0, all_109_0) = all_415_2 &
% 39.65/6.23 | integer_of_int32(all_321_0) = all_415_1 & integer_of_int32(all_109_0)
% 39.65/6.23 | = all_415_0 & c_sorted(all_321_0) & c_sorted(all_109_0) & ( ~
% 39.65/6.23 | (all_415_0 = all_415_1) | all_415_2 = 0) & ( ~ (all_415_2 = 0) |
% 39.65/6.23 | all_415_0 = all_415_1)
% 39.65/6.23 |
% 39.65/6.23 | ALPHA: (34) implies:
% 39.65/6.23 | (35) integer_of_int32(all_109_0) = all_415_0
% 39.65/6.23 | (36) integer_of_int32(all_321_0) = all_415_1
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_411_1, all_413_1, all_109_0,
% 39.65/6.23 | simplifying with (29), (32) gives:
% 39.65/6.23 | (37) all_413_1 = all_411_1
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with 1, all_415_0, all_109_0, simplifying with
% 39.65/6.23 | (8), (35) gives:
% 39.65/6.23 | (38) all_415_0 = 1
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_413_1, all_415_0, all_109_0,
% 39.65/6.23 | simplifying with (32), (35) gives:
% 39.65/6.23 | (39) all_415_0 = all_413_1
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_411_0, all_415_0, all_109_0,
% 39.65/6.23 | simplifying with (30), (35) gives:
% 39.65/6.23 | (40) all_415_0 = all_411_0
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (17) with all_409_1, simplifying with (26) gives:
% 39.65/6.23 | (41) all_321_0 = all_109_0 & ~ (all_409_1 = 1)
% 39.65/6.23 |
% 39.65/6.23 | ALPHA: (41) implies:
% 39.65/6.23 | (42) ~ (all_409_1 = 1)
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_409_0, all_413_0, all_321_0,
% 39.65/6.23 | simplifying with (27), (33) gives:
% 39.65/6.23 | (43) all_413_0 = all_409_0
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_354_0, all_413_0, all_321_0,
% 39.65/6.23 | simplifying with (24), (33) gives:
% 39.65/6.23 | (44) all_413_0 = all_354_0
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_409_0, all_415_1, all_321_0,
% 39.65/6.23 | simplifying with (27), (36) gives:
% 39.65/6.23 | (45) all_415_1 = all_409_0
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with all_409_1, all_415_1, all_321_0,
% 39.65/6.23 | simplifying with (26), (36) gives:
% 39.65/6.23 | (46) all_415_1 = all_409_1
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (17) with all_415_1, simplifying with (36) gives:
% 39.65/6.23 | (47) all_321_0 = all_109_0 & ~ (all_415_1 = 1)
% 39.65/6.23 |
% 39.65/6.23 | ALPHA: (47) implies:
% 39.65/6.23 | (48) all_321_0 = all_109_0
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (39), (40) imply:
% 39.65/6.23 | (49) all_413_1 = all_411_0
% 39.65/6.23 |
% 39.65/6.23 | SIMP: (49) implies:
% 39.65/6.23 | (50) all_413_1 = all_411_0
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (38), (40) imply:
% 39.65/6.23 | (51) all_411_0 = 1
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (45), (46) imply:
% 39.65/6.23 | (52) all_409_0 = all_409_1
% 39.65/6.23 |
% 39.65/6.23 | SIMP: (52) implies:
% 39.65/6.23 | (53) all_409_0 = all_409_1
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (43), (44) imply:
% 39.65/6.23 | (54) all_409_0 = all_354_0
% 39.65/6.23 |
% 39.65/6.23 | SIMP: (54) implies:
% 39.65/6.23 | (55) all_409_0 = all_354_0
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (37), (50) imply:
% 39.65/6.23 | (56) all_411_0 = all_411_1
% 39.65/6.23 |
% 39.65/6.23 | SIMP: (56) implies:
% 39.65/6.23 | (57) all_411_0 = all_411_1
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (51), (57) imply:
% 39.65/6.23 | (58) all_411_1 = 1
% 39.65/6.23 |
% 39.65/6.23 | COMBINE_EQS: (53), (55) imply:
% 39.65/6.23 | (59) all_409_1 = all_354_0
% 39.65/6.23 |
% 39.65/6.23 | SIMP: (59) implies:
% 39.65/6.23 | (60) all_409_1 = all_354_0
% 39.65/6.23 |
% 39.65/6.23 | REDUCE: (42), (60) imply:
% 39.65/6.23 | (61) ~ (all_354_0 = 1)
% 39.65/6.23 |
% 39.65/6.23 | REDUCE: (24), (48) imply:
% 39.65/6.23 | (62) integer_of_int32(all_109_0) = all_354_0
% 39.65/6.23 |
% 39.65/6.23 | GROUND_INST: instantiating (4) with 1, all_354_0, all_109_0, simplifying with
% 39.65/6.23 | (8), (62) gives:
% 39.65/6.23 | (63) all_354_0 = 1
% 39.65/6.23 |
% 39.65/6.23 | REDUCE: (61), (63) imply:
% 39.65/6.23 | (64) $false
% 39.65/6.23 |
% 39.65/6.23 | CLOSE: (64) is inconsistent.
% 39.65/6.23 |
% 39.65/6.23 End of proof
% 39.65/6.23 % SZS output end Proof for theBenchmark
% 39.65/6.24
% 39.65/6.24 5627ms
%------------------------------------------------------------------------------