%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEV580+1 : TPTP v9.1.0. Released v9.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n020.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 : Tue Apr 1 02:02:57 AM UTC 2025 % Result : Theorem 10.31s 2.09s % Output : Proof 12.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : SEV580+1 : TPTP v9.1.0. Released v9.1.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.37 % Computer : n020.cluster.edu % 0.15/0.37 % Model : x86_64 x86_64 % 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.37 % Memory : 8042.1875MB % 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.37 % CPULimit : 300 % 0.15/0.37 % WCLimit : 300 % 0.15/0.37 % DateTime : Mon Mar 31 13:11:19 EDT 2025 % 0.15/0.37 % CPUTime : % 0.68/0.64 ________ _____ % 0.68/0.64 ___ __ \_________(_)________________________________ % 0.68/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.68/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.68/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.68/0.64 % 0.68/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.68/0.64 (2023-06-19) % 0.68/0.64 % 0.68/0.64 (c) Philipp Rümmer, 2009-2023 % 0.68/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.68/0.64 Amanda Stjerna. % 0.68/0.64 Free software under BSD-3-Clause. % 0.68/0.64 % 0.68/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.68/0.64 % 0.68/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.66 Running up to 7 provers in parallel. % 0.68/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.85/1.10 Prover 4: Preprocessing ... % 2.85/1.10 Prover 1: Preprocessing ... % 2.85/1.14 Prover 6: Preprocessing ... % 2.85/1.14 Prover 2: Preprocessing ... % 2.85/1.14 Prover 0: Preprocessing ... % 2.85/1.14 Prover 3: Preprocessing ... % 2.85/1.14 Prover 5: Preprocessing ... % 6.71/1.66 Prover 2: Proving ... % 6.71/1.66 Prover 5: Proving ... % 7.23/1.74 Prover 3: Constructing countermodel ... % 7.23/1.74 Prover 1: Constructing countermodel ... % 7.23/1.74 Prover 6: Proving ... % 8.24/1.84 Prover 4: Constructing countermodel ... % 8.24/1.89 Prover 0: Proving ... % 10.14/2.09 Prover 3: proved (1418ms) % 10.14/2.09 % 10.31/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.31/2.09 % 10.31/2.09 Prover 2: stopped % 10.31/2.09 Prover 6: stopped % 10.31/2.10 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.31/2.10 Prover 0: stopped % 10.31/2.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.31/2.11 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.31/2.11 Prover 5: stopped % 10.31/2.11 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.31/2.11 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.55/2.14 Prover 10: Preprocessing ... % 10.55/2.14 Prover 1: Found proof (size 77) % 10.55/2.14 Prover 1: proved (1477ms) % 10.55/2.14 Prover 4: stopped % 10.55/2.16 Prover 8: Preprocessing ... % 10.55/2.17 Prover 10: stopped % 10.55/2.17 Prover 11: Preprocessing ... % 10.55/2.17 Prover 13: Preprocessing ... % 10.55/2.18 Prover 7: Preprocessing ... % 10.55/2.20 Prover 13: stopped % 10.55/2.21 Prover 7: stopped % 11.19/2.22 Prover 11: stopped % 11.56/2.31 Prover 8: Warning: ignoring some quantifiers % 11.56/2.32 Prover 8: Constructing countermodel ... % 11.56/2.33 Prover 8: stopped % 11.56/2.33 % 11.56/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.56/2.33 % 11.56/2.34 % SZS output start Proof for theBenchmark % 11.56/2.34 Assumptions after simplification: % 11.56/2.34 --------------------------------- % 11.56/2.34 % 11.56/2.34 (p_ax) % 11.56/2.37 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (p(v1) = % 11.56/2.37 v2) | ~ (mem(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ % 11.56/2.37 (v4 = 0) & subq(v0, v1) = v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.56/2.37 ( ~ (p(v1) = v2) | ~ (mem(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | subq(v0, v1) % 11.56/2.37 = 0) % 11.56/2.37 % 11.56/2.37 (s_ax) % 11.56/2.37 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (s(v0) = v1) | ~ % 11.56/2.37 (mem(v0, v1) = v2) | ~ $i(v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.56/2.37 (v1 = v0 | ~ (s(v1) = v2) | ~ (mem(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) % 11.56/2.37 % 11.56/2.37 (subq_2456_2457) % 11.56/2.38 $i(e) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 11.56/2.38 ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ? [v10: % 11.56/2.38 $i] : ? [v11: $i] : ? [v12: $i] : ? [v13: $i] : ? [v14: $i] : ? [v15: % 11.56/2.38 $i] : ? [v16: $i] : ? [v17: $i] : ? [v18: $i] : ? [v19: int] : ( ~ (v19 % 11.56/2.38 = 0) & p(v5) = v15 & n(v8) = v9 & n(v7) = v12 & n(v1) = v2 & n(v0) = v7 & % 11.56/2.38 n(e) = v0 & u(v17, v13) = v18 & u(v15, v9) = v16 & u(v11, v13) = v14 & u(v6, % 11.56/2.38 v9) = v10 & u(v4, v16) = v17 & u(v4, v10) = v11 & u(v0, v2) = v3 & s(v12) % 11.56/2.38 = v13 & s(v7) = v8 & s(v5) = v6 & s(v3) = v4 & s(v1) = v5 & s(v0) = v1 & % 11.56/2.38 subq(v14, v18) = v19 & $i(v18) & $i(v17) & $i(v16) & $i(v15) & $i(v14) & % 11.56/2.38 $i(v13) & $i(v12) & $i(v11) & $i(v10) & $i(v9) & $i(v8) & $i(v7) & $i(v6) & % 11.56/2.38 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 11.56/2.38 % 11.56/2.38 (subq_def) % 11.56/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subq(v0, v1) = v2) | % 11.56/2.38 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & mem(v3, % 11.56/2.38 v1) = v4 & mem(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 11.56/2.38 (subq(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ( ~ (mem(v2, v0) % 11.56/2.38 = 0) | ~ $i(v2) | mem(v2, v1) = 0)) % 11.56/2.38 % 11.56/2.38 (u_ax) % 12.03/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 12.03/2.38 | ~ (u(v1, v2) = v3) | ~ (mem(v0, v3) = v4) | ~ $i(v2) | ~ $i(v1) | ~ % 12.03/2.38 $i(v0) | ? [v5: int] : ? [v6: int] : ( ~ (v6 = 0) & ~ (v5 = 0) & mem(v0, % 12.03/2.38 v2) = v6 & mem(v0, v1) = v5)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 12.03/2.38 : ! [v3: $i] : ( ~ (u(v1, v2) = v3) | ~ (mem(v0, v3) = 0) | ~ $i(v2) | ~ % 12.03/2.38 $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : (mem(v0, v2) = v5 & % 12.03/2.38 mem(v0, v1) = v4 & (v5 = 0 | v4 = 0))) % 12.03/2.38 % 12.03/2.39 (function-axioms) % 12.06/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (a(v3, % 12.06/2.40 v2) = v1) | ~ (a(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 12.06/2.40 $i] : ! [v3: $i] : (v1 = v0 | ~ (m(v3, v2) = v1) | ~ (m(v3, v2) = v0)) & % 12.06/2.40 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (u(v3, % 12.06/2.40 v2) = v1) | ~ (u(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (disj(v3, v2) % 12.06/2.40 = v1) | ~ (disj(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (subq(v3, v2) % 12.06/2.40 = v1) | ~ (subq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (mem(v3, v2) % 12.06/2.40 = v1) | ~ (mem(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast16p(v2) = v1) | ~ % 12.06/2.40 (atleast16p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast15p(v2) = v1) | ~ % 12.06/2.40 (atleast15p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast14p(v2) = v1) | ~ % 12.06/2.40 (atleast14p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast13p(v2) = v1) | ~ % 12.06/2.40 (atleast13p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast12p(v2) = v1) | ~ % 12.06/2.40 (atleast12p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast11p(v2) = v1) | ~ % 12.06/2.40 (atleast11p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast10p(v2) = v1) | ~ % 12.06/2.40 (atleast10p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast9p(v2) = v1) | ~ % 12.06/2.40 (atleast9p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast8p(v2) = v1) | ~ % 12.06/2.40 (atleast8p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast7p(v2) = v1) | ~ % 12.06/2.40 (atleast7p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast6p(v2) = v1) | ~ % 12.06/2.40 (atleast6p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast5p(v2) = v1) | ~ % 12.06/2.40 (atleast5p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast4p(v2) = v1) | ~ % 12.06/2.40 (atleast4p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast3p(v2) = v1) | ~ % 12.06/2.40 (atleast3p(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.06/2.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (atleast2p(v2) = v1) | ~ % 12.06/2.40 (atleast2p(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | % 12.06/2.40 ~ (p(v2) = v1) | ~ (p(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 12.06/2.40 : (v1 = v0 | ~ (n(v2) = v1) | ~ (n(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 12.06/2.40 ! [v2: $i] : (v1 = v0 | ~ (s(v2) = v1) | ~ (s(v2) = v0)) % 12.06/2.40 % 12.06/2.40 Further assumptions not needed in the proof: % 12.06/2.40 -------------------------------------------- % 12.06/2.40 a_def, atleast10p_def, atleast11p_def, atleast12p_def, atleast13p_def, % 12.06/2.40 atleast14p_def, atleast15p_def, atleast16p_def, atleast2p_def, atleast3p_def, % 12.06/2.40 atleast4p_def, atleast5p_def, atleast6p_def, atleast7p_def, atleast8p_def, % 12.06/2.40 atleast9p_def, disj_def, e_ax, m_ax, n_def, setext % 12.06/2.40 % 12.06/2.40 Those formulas are unsatisfiable: % 12.06/2.40 --------------------------------- % 12.06/2.40 % 12.06/2.40 Begin of proof % 12.06/2.40 | % 12.06/2.40 | ALPHA: (subq_def) implies: % 12.06/2.40 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subq(v0, v1) = % 12.06/2.40 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 12.06/2.40 | = 0) & mem(v3, v1) = v4 & mem(v3, v0) = 0 & $i(v3))) % 12.06/2.40 | % 12.06/2.40 | ALPHA: (s_ax) implies: % 12.06/2.40 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (s(v1) = v2) | % 12.06/2.40 | ~ (mem(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) % 12.06/2.40 | % 12.06/2.40 | ALPHA: (u_ax) implies: % 12.12/2.40 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (u(v1, v2) % 12.12/2.40 | = v3) | ~ (mem(v0, v3) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 12.12/2.40 | ? [v4: any] : ? [v5: any] : (mem(v0, v2) = v5 & mem(v0, v1) = v4 & % 12.12/2.40 | (v5 = 0 | v4 = 0))) % 12.12/2.40 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : % 12.12/2.40 | (v4 = 0 | ~ (u(v1, v2) = v3) | ~ (mem(v0, v3) = v4) | ~ $i(v2) | ~ % 12.12/2.40 | $i(v1) | ~ $i(v0) | ? [v5: int] : ? [v6: int] : ( ~ (v6 = 0) & ~ % 12.12/2.40 | (v5 = 0) & mem(v0, v2) = v6 & mem(v0, v1) = v5)) % 12.12/2.40 | % 12.12/2.40 | ALPHA: (p_ax) implies: % 12.12/2.40 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 12.12/2.40 | (p(v1) = v2) | ~ (mem(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? % 12.12/2.40 | [v4: int] : ( ~ (v4 = 0) & subq(v0, v1) = v4)) % 12.12/2.40 | % 12.12/2.40 | ALPHA: (subq_2456_2457) implies: % 12.12/2.41 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 12.12/2.41 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ? % 12.12/2.41 | [v10: $i] : ? [v11: $i] : ? [v12: $i] : ? [v13: $i] : ? [v14: $i] : % 12.12/2.41 | ? [v15: $i] : ? [v16: $i] : ? [v17: $i] : ? [v18: $i] : ? [v19: % 12.12/2.41 | int] : ( ~ (v19 = 0) & p(v5) = v15 & n(v8) = v9 & n(v7) = v12 & n(v1) % 12.12/2.41 | = v2 & n(v0) = v7 & n(e) = v0 & u(v17, v13) = v18 & u(v15, v9) = v16 % 12.12/2.41 | & u(v11, v13) = v14 & u(v6, v9) = v10 & u(v4, v16) = v17 & u(v4, v10) % 12.12/2.41 | = v11 & u(v0, v2) = v3 & s(v12) = v13 & s(v7) = v8 & s(v5) = v6 & % 12.12/2.41 | s(v3) = v4 & s(v1) = v5 & s(v0) = v1 & subq(v14, v18) = v19 & $i(v18) % 12.12/2.41 | & $i(v17) & $i(v16) & $i(v15) & $i(v14) & $i(v13) & $i(v12) & $i(v11) % 12.12/2.41 | & $i(v10) & $i(v9) & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & % 12.12/2.41 | $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 12.12/2.41 | % 12.12/2.41 | ALPHA: (function-axioms) implies: % 12.12/2.41 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.12/2.41 | ! [v3: $i] : (v1 = v0 | ~ (mem(v3, v2) = v1) | ~ (mem(v3, v2) = v0)) % 12.12/2.41 | % 12.15/2.41 | DELTA: instantiating (6) with fresh symbols all_29_0, all_29_1, all_29_2, % 12.15/2.41 | all_29_3, all_29_4, all_29_5, all_29_6, all_29_7, all_29_8, all_29_9, % 12.15/2.41 | all_29_10, all_29_11, all_29_12, all_29_13, all_29_14, all_29_15, % 12.15/2.41 | all_29_16, all_29_17, all_29_18, all_29_19 gives: % 12.15/2.41 | (8) ~ (all_29_0 = 0) & p(all_29_14) = all_29_4 & n(all_29_11) = all_29_10 % 12.15/2.41 | & n(all_29_12) = all_29_7 & n(all_29_18) = all_29_17 & n(all_29_19) = % 12.15/2.41 | all_29_12 & n(e) = all_29_19 & u(all_29_2, all_29_6) = all_29_1 & % 12.15/2.41 | u(all_29_4, all_29_10) = all_29_3 & u(all_29_8, all_29_6) = all_29_5 & % 12.15/2.41 | u(all_29_13, all_29_10) = all_29_9 & u(all_29_15, all_29_3) = all_29_2 % 12.15/2.41 | & u(all_29_15, all_29_9) = all_29_8 & u(all_29_19, all_29_17) = % 12.15/2.41 | all_29_16 & s(all_29_7) = all_29_6 & s(all_29_12) = all_29_11 & % 12.15/2.41 | s(all_29_14) = all_29_13 & s(all_29_16) = all_29_15 & s(all_29_18) = % 12.15/2.41 | all_29_14 & s(all_29_19) = all_29_18 & subq(all_29_5, all_29_1) = % 12.15/2.41 | all_29_0 & $i(all_29_1) & $i(all_29_2) & $i(all_29_3) & $i(all_29_4) & % 12.15/2.41 | $i(all_29_5) & $i(all_29_6) & $i(all_29_7) & $i(all_29_8) & % 12.15/2.41 | $i(all_29_9) & $i(all_29_10) & $i(all_29_11) & $i(all_29_12) & % 12.15/2.41 | $i(all_29_13) & $i(all_29_14) & $i(all_29_15) & $i(all_29_16) & % 12.15/2.41 | $i(all_29_17) & $i(all_29_18) & $i(all_29_19) % 12.15/2.41 | % 12.15/2.41 | ALPHA: (8) implies: % 12.15/2.41 | (9) ~ (all_29_0 = 0) % 12.15/2.41 | (10) $i(all_29_15) % 12.15/2.41 | (11) $i(all_29_14) % 12.15/2.41 | (12) $i(all_29_13) % 12.15/2.41 | (13) $i(all_29_10) % 12.15/2.41 | (14) $i(all_29_9) % 12.15/2.41 | (15) $i(all_29_8) % 12.15/2.41 | (16) $i(all_29_6) % 12.15/2.41 | (17) $i(all_29_5) % 12.15/2.41 | (18) $i(all_29_4) % 12.15/2.41 | (19) $i(all_29_3) % 12.15/2.41 | (20) $i(all_29_2) % 12.15/2.41 | (21) $i(all_29_1) % 12.15/2.41 | (22) subq(all_29_5, all_29_1) = all_29_0 % 12.15/2.41 | (23) s(all_29_14) = all_29_13 % 12.15/2.41 | (24) u(all_29_15, all_29_9) = all_29_8 % 12.15/2.41 | (25) u(all_29_15, all_29_3) = all_29_2 % 12.15/2.41 | (26) u(all_29_13, all_29_10) = all_29_9 % 12.15/2.41 | (27) u(all_29_8, all_29_6) = all_29_5 % 12.15/2.42 | (28) u(all_29_4, all_29_10) = all_29_3 % 12.15/2.42 | (29) u(all_29_2, all_29_6) = all_29_1 % 12.15/2.42 | (30) p(all_29_14) = all_29_4 % 12.15/2.42 | % 12.15/2.42 | GROUND_INST: instantiating (1) with all_29_5, all_29_1, all_29_0, simplifying % 12.15/2.42 | with (17), (21), (22) gives: % 12.15/2.42 | (31) all_29_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & mem(v0, % 12.15/2.42 | all_29_1) = v1 & mem(v0, all_29_5) = 0 & $i(v0)) % 12.15/2.42 | % 12.15/2.42 | BETA: splitting (31) gives: % 12.15/2.42 | % 12.15/2.42 | Case 1: % 12.15/2.42 | | % 12.15/2.42 | | (32) all_29_0 = 0 % 12.15/2.42 | | % 12.15/2.42 | | REDUCE: (9), (32) imply: % 12.15/2.42 | | (33) $false % 12.15/2.42 | | % 12.15/2.42 | | CLOSE: (33) is inconsistent. % 12.15/2.42 | | % 12.15/2.42 | Case 2: % 12.15/2.42 | | % 12.15/2.42 | | (34) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & mem(v0, all_29_1) = v1 & % 12.15/2.42 | | mem(v0, all_29_5) = 0 & $i(v0)) % 12.15/2.42 | | % 12.15/2.42 | | DELTA: instantiating (34) with fresh symbols all_41_0, all_41_1 gives: % 12.15/2.42 | | (35) ~ (all_41_0 = 0) & mem(all_41_1, all_29_1) = all_41_0 & % 12.15/2.42 | | mem(all_41_1, all_29_5) = 0 & $i(all_41_1) % 12.15/2.42 | | % 12.15/2.42 | | ALPHA: (35) implies: % 12.15/2.42 | | (36) ~ (all_41_0 = 0) % 12.15/2.42 | | (37) $i(all_41_1) % 12.15/2.42 | | (38) mem(all_41_1, all_29_5) = 0 % 12.15/2.42 | | (39) mem(all_41_1, all_29_1) = all_41_0 % 12.15/2.42 | | % 12.15/2.42 | | GROUND_INST: instantiating (3) with all_41_1, all_29_8, all_29_6, all_29_5, % 12.15/2.42 | | simplifying with (15), (16), (27), (37), (38) gives: % 12.15/2.42 | | (40) ? [v0: any] : ? [v1: any] : (mem(all_41_1, all_29_6) = v1 & % 12.15/2.42 | | mem(all_41_1, all_29_8) = v0 & (v1 = 0 | v0 = 0)) % 12.15/2.42 | | % 12.15/2.42 | | GROUND_INST: instantiating (4) with all_41_1, all_29_2, all_29_6, all_29_1, % 12.15/2.42 | | all_41_0, simplifying with (16), (20), (29), (37), (39) gives: % 12.15/2.42 | | (41) all_41_0 = 0 | ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = % 12.15/2.42 | | 0) & mem(all_41_1, all_29_2) = v0 & mem(all_41_1, all_29_6) = % 12.15/2.42 | | v1) % 12.15/2.42 | | % 12.15/2.42 | | DELTA: instantiating (40) with fresh symbols all_48_0, all_48_1 gives: % 12.15/2.42 | | (42) mem(all_41_1, all_29_6) = all_48_0 & mem(all_41_1, all_29_8) = % 12.15/2.42 | | all_48_1 & (all_48_0 = 0 | all_48_1 = 0) % 12.15/2.42 | | % 12.15/2.42 | | ALPHA: (42) implies: % 12.15/2.42 | | (43) mem(all_41_1, all_29_8) = all_48_1 % 12.15/2.42 | | (44) mem(all_41_1, all_29_6) = all_48_0 % 12.15/2.42 | | (45) all_48_0 = 0 | all_48_1 = 0 % 12.15/2.42 | | % 12.15/2.42 | | BETA: splitting (41) gives: % 12.15/2.42 | | % 12.15/2.42 | | Case 1: % 12.15/2.42 | | | % 12.15/2.43 | | | (46) all_41_0 = 0 % 12.15/2.43 | | | % 12.15/2.43 | | | REDUCE: (36), (46) imply: % 12.15/2.43 | | | (47) $false % 12.15/2.43 | | | % 12.15/2.43 | | | CLOSE: (47) is inconsistent. % 12.15/2.43 | | | % 12.15/2.43 | | Case 2: % 12.15/2.43 | | | % 12.15/2.43 | | | (48) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = 0) & % 12.15/2.43 | | | mem(all_41_1, all_29_2) = v0 & mem(all_41_1, all_29_6) = v1) % 12.15/2.43 | | | % 12.15/2.43 | | | DELTA: instantiating (48) with fresh symbols all_54_0, all_54_1 gives: % 12.15/2.43 | | | (49) ~ (all_54_0 = 0) & ~ (all_54_1 = 0) & mem(all_41_1, all_29_2) = % 12.15/2.43 | | | all_54_1 & mem(all_41_1, all_29_6) = all_54_0 % 12.15/2.43 | | | % 12.15/2.43 | | | ALPHA: (49) implies: % 12.15/2.43 | | | (50) ~ (all_54_1 = 0) % 12.15/2.43 | | | (51) ~ (all_54_0 = 0) % 12.15/2.43 | | | (52) mem(all_41_1, all_29_6) = all_54_0 % 12.15/2.43 | | | (53) mem(all_41_1, all_29_2) = all_54_1 % 12.15/2.43 | | | % 12.15/2.43 | | | GROUND_INST: instantiating (7) with all_48_0, all_54_0, all_29_6, % 12.15/2.43 | | | all_41_1, simplifying with (44), (52) gives: % 12.15/2.43 | | | (54) all_54_0 = all_48_0 % 12.15/2.43 | | | % 12.15/2.43 | | | REDUCE: (51), (54) imply: % 12.15/2.43 | | | (55) ~ (all_48_0 = 0) % 12.15/2.43 | | | % 12.15/2.43 | | | BETA: splitting (45) gives: % 12.15/2.43 | | | % 12.15/2.43 | | | Case 1: % 12.15/2.43 | | | | % 12.15/2.43 | | | | (56) all_48_0 = 0 % 12.15/2.43 | | | | % 12.15/2.43 | | | | REDUCE: (55), (56) imply: % 12.15/2.43 | | | | (57) $false % 12.15/2.43 | | | | % 12.15/2.43 | | | | CLOSE: (57) is inconsistent. % 12.15/2.43 | | | | % 12.15/2.43 | | | Case 2: % 12.15/2.43 | | | | % 12.15/2.43 | | | | (58) all_48_1 = 0 % 12.15/2.43 | | | | % 12.15/2.43 | | | | REDUCE: (43), (58) imply: % 12.15/2.43 | | | | (59) mem(all_41_1, all_29_8) = 0 % 12.15/2.43 | | | | % 12.15/2.43 | | | | GROUND_INST: instantiating (3) with all_41_1, all_29_15, all_29_9, % 12.15/2.43 | | | | all_29_8, simplifying with (10), (14), (24), (37), (59) % 12.15/2.43 | | | | gives: % 12.15/2.43 | | | | (60) ? [v0: any] : ? [v1: any] : (mem(all_41_1, all_29_9) = v1 & % 12.15/2.43 | | | | mem(all_41_1, all_29_15) = v0 & (v1 = 0 | v0 = 0)) % 12.15/2.43 | | | | % 12.15/2.43 | | | | GROUND_INST: instantiating (4) with all_41_1, all_29_15, all_29_3, % 12.15/2.43 | | | | all_29_2, all_54_1, simplifying with (10), (19), (25), % 12.15/2.43 | | | | (37), (53) gives: % 12.15/2.43 | | | | (61) all_54_1 = 0 | ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ % 12.15/2.43 | | | | (v0 = 0) & mem(all_41_1, all_29_3) = v1 & mem(all_41_1, % 12.15/2.43 | | | | all_29_15) = v0) % 12.15/2.43 | | | | % 12.15/2.43 | | | | DELTA: instantiating (60) with fresh symbols all_69_0, all_69_1 gives: % 12.15/2.43 | | | | (62) mem(all_41_1, all_29_9) = all_69_0 & mem(all_41_1, all_29_15) = % 12.15/2.43 | | | | all_69_1 & (all_69_0 = 0 | all_69_1 = 0) % 12.15/2.43 | | | | % 12.15/2.43 | | | | ALPHA: (62) implies: % 12.15/2.43 | | | | (63) mem(all_41_1, all_29_15) = all_69_1 % 12.15/2.43 | | | | (64) mem(all_41_1, all_29_9) = all_69_0 % 12.15/2.43 | | | | (65) all_69_0 = 0 | all_69_1 = 0 % 12.15/2.43 | | | | % 12.15/2.43 | | | | BETA: splitting (61) gives: % 12.15/2.43 | | | | % 12.15/2.43 | | | | Case 1: % 12.15/2.43 | | | | | % 12.15/2.43 | | | | | (66) all_54_1 = 0 % 12.15/2.43 | | | | | % 12.15/2.43 | | | | | REDUCE: (50), (66) imply: % 12.15/2.43 | | | | | (67) $false % 12.15/2.43 | | | | | % 12.15/2.43 | | | | | CLOSE: (67) is inconsistent. % 12.15/2.43 | | | | | % 12.15/2.43 | | | | Case 2: % 12.15/2.43 | | | | | % 12.15/2.43 | | | | | (68) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = 0) & % 12.15/2.43 | | | | | mem(all_41_1, all_29_3) = v1 & mem(all_41_1, all_29_15) = % 12.15/2.43 | | | | | v0) % 12.15/2.43 | | | | | % 12.15/2.43 | | | | | DELTA: instantiating (68) with fresh symbols all_75_0, all_75_1 gives: % 12.15/2.43 | | | | | (69) ~ (all_75_0 = 0) & ~ (all_75_1 = 0) & mem(all_41_1, % 12.15/2.43 | | | | | all_29_3) = all_75_0 & mem(all_41_1, all_29_15) = all_75_1 % 12.15/2.43 | | | | | % 12.15/2.43 | | | | | ALPHA: (69) implies: % 12.15/2.43 | | | | | (70) ~ (all_75_1 = 0) % 12.15/2.43 | | | | | (71) ~ (all_75_0 = 0) % 12.15/2.43 | | | | | (72) mem(all_41_1, all_29_15) = all_75_1 % 12.15/2.43 | | | | | (73) mem(all_41_1, all_29_3) = all_75_0 % 12.15/2.43 | | | | | % 12.15/2.44 | | | | | GROUND_INST: instantiating (7) with all_69_1, all_75_1, all_29_15, % 12.15/2.44 | | | | | all_41_1, simplifying with (63), (72) gives: % 12.15/2.44 | | | | | (74) all_75_1 = all_69_1 % 12.15/2.44 | | | | | % 12.15/2.44 | | | | | REDUCE: (70), (74) imply: % 12.15/2.44 | | | | | (75) ~ (all_69_1 = 0) % 12.15/2.44 | | | | | % 12.15/2.44 | | | | | BETA: splitting (65) gives: % 12.15/2.44 | | | | | % 12.15/2.44 | | | | | Case 1: % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | (76) all_69_0 = 0 % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | REDUCE: (64), (76) imply: % 12.15/2.44 | | | | | | (77) mem(all_41_1, all_29_9) = 0 % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | GROUND_INST: instantiating (3) with all_41_1, all_29_13, all_29_10, % 12.15/2.44 | | | | | | all_29_9, simplifying with (12), (13), (26), (37), (77) % 12.15/2.44 | | | | | | gives: % 12.15/2.44 | | | | | | (78) ? [v0: any] : ? [v1: any] : (mem(all_41_1, all_29_10) = v1 % 12.15/2.44 | | | | | | & mem(all_41_1, all_29_13) = v0 & (v1 = 0 | v0 = 0)) % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | GROUND_INST: instantiating (4) with all_41_1, all_29_4, all_29_10, % 12.15/2.44 | | | | | | all_29_3, all_75_0, simplifying with (13), (18), (28), % 12.15/2.44 | | | | | | (37), (73) gives: % 12.15/2.44 | | | | | | (79) all_75_0 = 0 | ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & % 12.15/2.44 | | | | | | ~ (v0 = 0) & mem(all_41_1, all_29_4) = v0 & mem(all_41_1, % 12.15/2.44 | | | | | | all_29_10) = v1) % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | DELTA: instantiating (78) with fresh symbols all_90_0, all_90_1 % 12.15/2.44 | | | | | | gives: % 12.15/2.44 | | | | | | (80) mem(all_41_1, all_29_10) = all_90_0 & mem(all_41_1, % 12.15/2.44 | | | | | | all_29_13) = all_90_1 & (all_90_0 = 0 | all_90_1 = 0) % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | ALPHA: (80) implies: % 12.15/2.44 | | | | | | (81) mem(all_41_1, all_29_13) = all_90_1 % 12.15/2.44 | | | | | | (82) mem(all_41_1, all_29_10) = all_90_0 % 12.15/2.44 | | | | | | (83) all_90_0 = 0 | all_90_1 = 0 % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | BETA: splitting (79) gives: % 12.15/2.44 | | | | | | % 12.15/2.44 | | | | | | Case 1: % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | (84) all_75_0 = 0 % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | REDUCE: (71), (84) imply: % 12.15/2.44 | | | | | | | (85) $false % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | CLOSE: (85) is inconsistent. % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | Case 2: % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | (86) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = 0) & % 12.15/2.44 | | | | | | | mem(all_41_1, all_29_4) = v0 & mem(all_41_1, all_29_10) % 12.15/2.44 | | | | | | | = v1) % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | DELTA: instantiating (86) with fresh symbols all_96_0, all_96_1 % 12.15/2.44 | | | | | | | gives: % 12.15/2.44 | | | | | | | (87) ~ (all_96_0 = 0) & ~ (all_96_1 = 0) & mem(all_41_1, % 12.15/2.44 | | | | | | | all_29_4) = all_96_1 & mem(all_41_1, all_29_10) = % 12.15/2.44 | | | | | | | all_96_0 % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | ALPHA: (87) implies: % 12.15/2.44 | | | | | | | (88) ~ (all_96_1 = 0) % 12.15/2.44 | | | | | | | (89) ~ (all_96_0 = 0) % 12.15/2.44 | | | | | | | (90) mem(all_41_1, all_29_10) = all_96_0 % 12.15/2.44 | | | | | | | (91) mem(all_41_1, all_29_4) = all_96_1 % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | GROUND_INST: instantiating (7) with all_90_0, all_96_0, all_29_10, % 12.15/2.44 | | | | | | | all_41_1, simplifying with (82), (90) gives: % 12.15/2.44 | | | | | | | (92) all_96_0 = all_90_0 % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | REDUCE: (89), (92) imply: % 12.15/2.44 | | | | | | | (93) ~ (all_90_0 = 0) % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | BETA: splitting (83) gives: % 12.15/2.44 | | | | | | | % 12.15/2.44 | | | | | | | Case 1: % 12.15/2.44 | | | | | | | | % 12.15/2.44 | | | | | | | | (94) all_90_0 = 0 % 12.15/2.44 | | | | | | | | % 12.15/2.44 | | | | | | | | REDUCE: (93), (94) imply: % 12.15/2.44 | | | | | | | | (95) $false % 12.15/2.44 | | | | | | | | % 12.15/2.44 | | | | | | | | CLOSE: (95) is inconsistent. % 12.15/2.44 | | | | | | | | % 12.15/2.44 | | | | | | | Case 2: % 12.15/2.44 | | | | | | | | % 12.15/2.44 | | | | | | | | (96) all_90_1 = 0 % 12.15/2.44 | | | | | | | | % 12.15/2.44 | | | | | | | | REDUCE: (81), (96) imply: % 12.15/2.44 | | | | | | | | (97) mem(all_41_1, all_29_13) = 0 % 12.15/2.44 | | | | | | | | % 12.15/2.45 | | | | | | | | GROUND_INST: instantiating (2) with all_41_1, all_29_14, % 12.15/2.45 | | | | | | | | all_29_13, simplifying with (11), (23), (37), (97) % 12.15/2.45 | | | | | | | | gives: % 12.15/2.45 | | | | | | | | (98) all_41_1 = all_29_14 % 12.15/2.45 | | | | | | | | % 12.15/2.45 | | | | | | | | GROUND_INST: instantiating (5) with all_41_1, all_29_14, % 12.15/2.45 | | | | | | | | all_29_4, all_96_1, simplifying with (11), (30), % 12.15/2.45 | | | | | | | | (37), (91) gives: % 12.15/2.45 | | | | | | | | (99) all_96_1 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 12.15/2.45 | | | | | | | | subq(all_41_1, all_29_14) = v0) % 12.15/2.45 | | | | | | | | % 12.15/2.45 | | | | | | | | BETA: splitting (99) gives: % 12.15/2.45 | | | | | | | | % 12.15/2.45 | | | | | | | | Case 1: % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | (100) all_96_1 = 0 % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | REDUCE: (88), (100) imply: % 12.15/2.45 | | | | | | | | | (101) $false % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | CLOSE: (101) is inconsistent. % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | Case 2: % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | (102) ? [v0: int] : ( ~ (v0 = 0) & subq(all_41_1, % 12.15/2.45 | | | | | | | | | all_29_14) = v0) % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | DELTA: instantiating (102) with fresh symbol all_116_0 gives: % 12.15/2.45 | | | | | | | | | (103) ~ (all_116_0 = 0) & subq(all_41_1, all_29_14) = % 12.15/2.45 | | | | | | | | | all_116_0 % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | ALPHA: (103) implies: % 12.15/2.45 | | | | | | | | | (104) ~ (all_116_0 = 0) % 12.15/2.45 | | | | | | | | | (105) subq(all_41_1, all_29_14) = all_116_0 % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | REDUCE: (98), (105) imply: % 12.15/2.45 | | | | | | | | | (106) subq(all_29_14, all_29_14) = all_116_0 % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | GROUND_INST: instantiating (1) with all_29_14, all_29_14, % 12.15/2.45 | | | | | | | | | all_116_0, simplifying with (11), (106) gives: % 12.15/2.45 | | | | | | | | | (107) all_116_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 % 12.15/2.45 | | | | | | | | | = 0) & mem(v0, all_29_14) = v1 & mem(v0, % 12.15/2.45 | | | | | | | | | all_29_14) = 0 & $i(v0)) % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | BETA: splitting (107) gives: % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | | Case 1: % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | (108) all_116_0 = 0 % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | REDUCE: (104), (108) imply: % 12.15/2.45 | | | | | | | | | | (109) $false % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | CLOSE: (109) is inconsistent. % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | Case 2: % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | (110) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & mem(v0, % 12.15/2.45 | | | | | | | | | | all_29_14) = v1 & mem(v0, all_29_14) = 0 & % 12.15/2.45 | | | | | | | | | | $i(v0)) % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | DELTA: instantiating (110) with fresh symbols all_125_0, % 12.15/2.45 | | | | | | | | | | all_125_1 gives: % 12.15/2.45 | | | | | | | | | | (111) ~ (all_125_0 = 0) & mem(all_125_1, all_29_14) = % 12.15/2.45 | | | | | | | | | | all_125_0 & mem(all_125_1, all_29_14) = 0 & % 12.15/2.45 | | | | | | | | | | $i(all_125_1) % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | ALPHA: (111) implies: % 12.15/2.45 | | | | | | | | | | (112) ~ (all_125_0 = 0) % 12.15/2.45 | | | | | | | | | | (113) mem(all_125_1, all_29_14) = 0 % 12.15/2.45 | | | | | | | | | | (114) mem(all_125_1, all_29_14) = all_125_0 % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | GROUND_INST: instantiating (7) with 0, all_125_0, all_29_14, % 12.15/2.45 | | | | | | | | | | all_125_1, simplifying with (113), (114) gives: % 12.15/2.45 | | | | | | | | | | (115) all_125_0 = 0 % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | REDUCE: (112), (115) imply: % 12.15/2.45 | | | | | | | | | | (116) $false % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | | CLOSE: (116) is inconsistent. % 12.15/2.45 | | | | | | | | | | % 12.15/2.45 | | | | | | | | | End of split % 12.15/2.45 | | | | | | | | | % 12.15/2.45 | | | | | | | | End of split % 12.15/2.45 | | | | | | | | % 12.15/2.45 | | | | | | | End of split % 12.15/2.45 | | | | | | | % 12.15/2.45 | | | | | | End of split % 12.15/2.45 | | | | | | % 12.15/2.45 | | | | | Case 2: % 12.15/2.45 | | | | | | % 12.15/2.45 | | | | | | (117) all_69_1 = 0 % 12.15/2.45 | | | | | | % 12.15/2.45 | | | | | | REDUCE: (75), (117) imply: % 12.15/2.45 | | | | | | (118) $false % 12.15/2.45 | | | | | | % 12.15/2.45 | | | | | | CLOSE: (118) is inconsistent. % 12.15/2.45 | | | | | | % 12.15/2.45 | | | | | End of split % 12.15/2.45 | | | | | % 12.15/2.45 | | | | End of split % 12.15/2.45 | | | | % 12.15/2.45 | | | End of split % 12.15/2.45 | | | % 12.15/2.45 | | End of split % 12.15/2.45 | | % 12.15/2.45 | End of split % 12.15/2.45 | % 12.15/2.45 End of proof % 12.15/2.45 % SZS output end Proof for theBenchmark % 12.15/2.45 % 12.15/2.45 1809ms %------------------------------------------------------------------------------