%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV028+1 : TPTP v8.1.2. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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 : Thu Aug 31 22:54:38 EDT 2023 % Result : Theorem 144.38s 19.36s % Output : Proof 145.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SWV028+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n022.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 05:18:23 EDT 2023 % 0.13/0.35 % CPUTime : % 0.54/0.62 ________ _____ % 0.54/0.62 ___ __ \_________(_)________________________________ % 0.54/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.54/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.54/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.54/0.62 % 0.54/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.54/0.62 (2023-06-19) % 0.54/0.62 % 0.54/0.62 (c) Philipp Rümmer, 2009-2023 % 0.54/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.54/0.62 Amanda Stjerna. % 0.54/0.62 Free software under BSD-3-Clause. % 0.54/0.62 % 0.54/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.54/0.62 % 0.54/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.54/0.63 Running up to 7 provers in parallel. % 0.54/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.54/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.54/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.54/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.54/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.54/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.54/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.95/1.37 Prover 4: Preprocessing ... % 4.95/1.37 Prover 1: Preprocessing ... % 5.11/1.41 Prover 2: Preprocessing ... % 5.11/1.41 Prover 3: Preprocessing ... % 5.11/1.41 Prover 6: Preprocessing ... % 5.11/1.41 Prover 0: Preprocessing ... % 5.11/1.41 Prover 5: Preprocessing ... % 11.79/2.27 Prover 1: Warning: ignoring some quantifiers % 11.79/2.30 Prover 3: Warning: ignoring some quantifiers % 12.19/2.33 Prover 6: Proving ... % 12.19/2.35 Prover 3: Constructing countermodel ... % 12.19/2.35 Prover 1: Constructing countermodel ... % 12.19/2.38 Prover 4: Warning: ignoring some quantifiers % 13.45/2.51 Prover 4: Constructing countermodel ... % 13.45/2.52 Prover 2: Proving ... % 13.84/2.54 Prover 5: Proving ... % 13.89/2.58 Prover 0: Proving ... % 74.30/10.31 Prover 2: stopped % 74.30/10.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 74.91/10.46 Prover 7: Preprocessing ... % 77.40/10.69 Prover 7: Warning: ignoring some quantifiers % 77.40/10.71 Prover 7: Constructing countermodel ... % 102.88/13.97 Prover 5: stopped % 102.88/13.98 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 104.08/14.10 Prover 8: Preprocessing ... % 105.60/14.30 Prover 8: Warning: ignoring some quantifiers % 105.60/14.31 Prover 8: Constructing countermodel ... % 117.62/16.00 Prover 1: stopped % 117.62/16.02 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 119.59/16.10 Prover 9: Preprocessing ... % 120.71/16.33 Prover 9: Warning: ignoring some quantifiers % 120.71/16.33 Prover 9: Constructing countermodel ... % 132.67/17.89 Prover 6: stopped % 133.28/17.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 133.95/17.99 Prover 10: Preprocessing ... % 134.71/18.06 Prover 10: Warning: ignoring some quantifiers % 134.71/18.07 Prover 10: Constructing countermodel ... % 144.38/19.35 Prover 10: Found proof (size 304) % 144.38/19.36 Prover 10: proved (1459ms) % 144.38/19.36 Prover 9: stopped % 144.38/19.36 Prover 3: stopped % 144.38/19.36 Prover 0: stopped % 144.38/19.36 Prover 7: stopped % 144.38/19.36 Prover 4: stopped % 144.38/19.36 Prover 8: stopped % 144.38/19.36 % 144.38/19.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 144.38/19.36 % 144.38/19.38 % SZS output start Proof for theBenchmark % 144.38/19.38 Assumptions after simplification: % 144.38/19.38 --------------------------------- % 144.38/19.38 % 144.38/19.38 (finite_domain_1) % 144.38/19.39 $i(n1) & $i(n0) & ! [v0: $i] : (v0 = n1 | v0 = n0 | ~ $i(v0) | ~ leq(v0, % 144.38/19.39 n1) | ~ leq(n0, v0)) % 144.38/19.39 % 144.38/19.39 (finite_domain_2) % 144.38/19.39 $i(n2) & $i(n1) & $i(n0) & ! [v0: $i] : (v0 = n2 | v0 = n1 | v0 = n0 | ~ % 144.38/19.39 $i(v0) | ~ leq(v0, n2) | ~ leq(n0, v0)) % 144.38/19.39 % 144.38/19.39 (gauss_init_0025) % 144.86/19.42 $i(pvar1402_init) & $i(pvar1401_init) & $i(pvar1400_init) & $i(loopcounter) & % 144.86/19.42 $i(s_try7_init) & $i(s_center7_init) & $i(s_values7_init) & $i(simplex7_init) % 144.86/19.42 & $i(n410) & $i(pv1376) & $i(pv19) & $i(s_worst7) & $i(s_sworst7) & % 144.86/19.42 $i(s_best7) & $i(s_worst7_init) & $i(s_sworst7_init) & $i(s_best7_init) & % 144.86/19.42 $i(init) & $i(n3) & $i(n2) & $i(n1) & $i(n0) & ? [v0: $i] : ? [v1: $i] : ? % 144.86/19.42 [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] % 144.86/19.42 : ? [v8: $i] : ? [v9: $i] : ? [v10: $i] : (s_worst7_init = init & % 144.86/19.42 s_sworst7_init = init & s_best7_init = init & minus(n410, n1) = v0 & % 144.86/19.42 minus(n3, n1) = v1 & $i(v9) & $i(v8) & $i(v6) & $i(v4) & $i(v2) & $i(v1) & % 144.86/19.42 $i(v0) & leq(pv1376, n3) & leq(pv19, v0) & leq(s_worst7, n3) & % 144.86/19.42 leq(s_sworst7, n3) & leq(s_best7, n3) & leq(n0, pv1376) & leq(n0, pv19) & % 144.86/19.42 leq(n0, s_worst7) & leq(n0, s_sworst7) & leq(n0, s_best7) & ! [v11: $i] : % 144.86/19.42 ! [v12: $i] : ! [v13: $i] : (v13 = init | ~ (a_select3(simplex7_init, v12, % 144.86/19.42 v11) = v13) | ~ $i(v12) | ~ $i(v11) | ~ leq(v12, n3) | ~ leq(v11, % 144.86/19.42 n2) | ~ leq(n0, v12) | ~ leq(n0, v11)) & ! [v11: $i] : ! [v12: $i] : % 144.86/19.42 (v12 = init | ~ (a_select2(s_try7_init, v11) = v12) | ~ $i(v11) | ~ % 144.86/19.42 leq(v11, v1) | ~ leq(n0, v11)) & ! [v11: $i] : ! [v12: $i] : (v12 = % 144.86/19.42 init | ~ (a_select2(s_center7_init, v11) = v12) | ~ $i(v11) | ~ % 144.86/19.42 leq(v11, n2) | ~ leq(n0, v11)) & ! [v11: $i] : ! [v12: $i] : (v12 = % 144.86/19.42 init | ~ (a_select2(s_values7_init, v11) = v12) | ~ $i(v11) | ~ % 144.86/19.42 leq(v11, n3) | ~ leq(n0, v11)) & ( ~ gt(loopcounter, n1) | (pvar1402_init % 144.86/19.42 = init & pvar1401_init = init & pvar1400_init = init)) & (( ~ (v10 = % 144.86/19.42 init) & a_select3(simplex7_init, v9, v8) = v10 & $i(v10) & leq(v9, n3) % 144.86/19.42 & leq(v8, n2) & leq(n0, v9) & leq(n0, v8)) | ( ~ (v7 = init) & % 144.86/19.42 a_select2(s_values7_init, v6) = v7 & $i(v7) & leq(v6, n3) & leq(n0, v6)) % 144.86/19.42 | ( ~ (v5 = init) & a_select2(s_center7_init, v4) = v5 & $i(v5) & leq(v4, % 144.86/19.42 n2) & leq(n0, v4)) | ( ~ (v3 = init) & a_select2(s_try7_init, v2) = v3 % 144.86/19.42 & $i(v3) & leq(v2, v1) & leq(n0, v2)) | (gt(loopcounter, n1) & ( ~ % 144.86/19.42 (pvar1402_init = init) | ~ (pvar1401_init = init) | ~ (pvar1400_init % 144.86/19.42 = init))))) % 144.86/19.42 % 144.86/19.42 (irreflexivity_gt) % 144.86/19.42 ! [v0: $i] : ( ~ $i(v0) | ~ gt(v0, v0)) % 144.86/19.42 % 144.86/19.42 (leq_gt2) % 144.86/19.42 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ leq(v0, v1) % 144.86/19.42 | gt(v1, v0)) % 144.86/19.42 % 144.86/19.43 (leq_gt_pred) % 144.86/19.43 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (pred(v1) = v2) | ~ $i(v1) | ~ % 144.86/19.43 $i(v0) | ~ leq(v0, v2) | gt(v1, v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 144.86/19.43 $i] : ( ~ (pred(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ gt(v1, v0) | leq(v0, % 144.86/19.43 v2)) % 144.86/19.43 % 144.86/19.43 (pred_minus_1) % 144.86/19.43 $i(n1) & ! [v0: $i] : ! [v1: $i] : ( ~ (minus(v0, n1) = v1) | ~ $i(v0) | % 144.86/19.43 (pred(v0) = v1 & $i(v1))) % 144.86/19.43 % 144.86/19.43 (pred_succ) % 144.86/19.43 ! [v0: $i] : ! [v1: $i] : ( ~ (succ(v0) = v1) | ~ $i(v0) | pred(v1) = v0) % 144.86/19.43 % 144.86/19.43 (successor_1) % 144.86/19.43 succ(n0) = n1 & $i(n1) & $i(n0) % 144.86/19.43 % 144.86/19.43 (successor_2) % 144.86/19.43 $i(n2) & $i(n0) & ? [v0: $i] : (succ(v0) = n2 & succ(n0) = v0 & $i(v0)) % 144.86/19.43 % 144.86/19.43 (successor_3) % 144.86/19.43 $i(n3) & $i(n0) & ? [v0: $i] : ? [v1: $i] : (succ(v1) = n3 & succ(v0) = v1 & % 144.86/19.43 succ(n0) = v0 & $i(v1) & $i(v0)) % 144.86/19.43 % 144.86/19.43 (successor_4) % 144.86/19.43 $i(n4) & $i(n0) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (succ(v2) = n4 & % 144.86/19.43 succ(v1) = v2 & succ(v0) = v1 & succ(n0) = v0 & $i(v2) & $i(v1) & $i(v0)) % 144.86/19.43 % 144.86/19.43 (successor_5) % 144.86/19.43 $i(n5) & $i(n0) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : % 144.86/19.43 (succ(v3) = n5 & succ(v2) = v3 & succ(v1) = v2 & succ(v0) = v1 & succ(n0) = v0 % 144.86/19.43 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 144.86/19.43 % 144.86/19.43 (function-axioms) % 144.86/19.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 144.86/19.44 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~ % 144.86/19.44 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 144.86/19.44 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) = % 144.86/19.44 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 144.86/19.44 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) | % 144.86/19.44 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 144.86/19.44 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) | % 144.86/19.44 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 144.86/19.44 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) = % 144.86/19.44 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 144.86/19.44 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3, % 144.86/19.44 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 144.86/19.44 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : ! % 144.86/19.44 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1) % 144.86/19.44 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 144.86/19.44 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) = % 144.86/19.44 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 144.86/19.44 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : ! % 144.86/19.44 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~ % 144.86/19.44 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 144.86/19.44 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3, % 144.86/19.44 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 144.86/19.44 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0: % 144.86/19.44 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 144.86/19.44 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & ! % 144.86/19.44 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ % 144.86/19.44 (inv(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 144.86/19.44 (trans(v2) = v1) | ~ (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 144.86/19.44 [v2: $i] : (v1 = v0 | ~ (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : % 144.86/19.44 ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = % 144.86/19.44 v0)) % 144.86/19.44 % 144.86/19.44 Further assumptions not needed in the proof: % 144.86/19.44 -------------------------------------------- % 144.86/19.44 const_array1_select, const_array2_select, defuse, finite_domain_0, % 144.86/19.44 finite_domain_3, finite_domain_4, finite_domain_5, gt_0_tptp_minus_1, gt_1_0, % 144.86/19.44 gt_1_tptp_minus_1, gt_2_0, gt_2_1, gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, % 144.86/19.44 gt_3_tptp_minus_1, gt_410_0, gt_410_1, gt_410_2, gt_410_3, gt_410_4, gt_410_5, % 144.86/19.44 gt_410_tptp_minus_1, gt_4_0, gt_4_1, gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, % 144.86/19.44 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, leq_geq, leq_gt1, % 144.86/19.44 leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, lt_gt, % 144.86/19.44 matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 144.86/19.44 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 144.86/19.44 matrix_symm_update_diagonal, reflexivity_leq, sel2_update_1, sel2_update_2, % 144.86/19.44 sel2_update_3, sel3_update_1, sel3_update_2, sel3_update_3, succ_plus_1_l, % 144.86/19.44 succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, % 144.86/19.44 succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, succ_plus_5_r, succ_pred, % 144.86/19.44 succ_tptp_minus_1, sum_plus_base, sum_plus_base_float, totality, % 144.86/19.44 transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 144.86/19.44 uniform_int_rand_ranges_lo % 144.86/19.44 % 144.86/19.44 Those formulas are unsatisfiable: % 144.86/19.44 --------------------------------- % 144.86/19.44 % 144.86/19.44 Begin of proof % 144.86/19.44 | % 144.86/19.44 | ALPHA: (leq_gt_pred) implies: % 144.86/19.44 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (pred(v1) = v2) | ~ % 144.86/19.44 | $i(v1) | ~ $i(v0) | ~ gt(v1, v0) | leq(v0, v2)) % 144.86/19.44 | % 144.86/19.44 | ALPHA: (pred_minus_1) implies: % 144.86/19.44 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (minus(v0, n1) = v1) | ~ $i(v0) | % 144.86/19.44 | (pred(v0) = v1 & $i(v1))) % 144.86/19.44 | % 144.86/19.44 | ALPHA: (finite_domain_1) implies: % 144.86/19.44 | (3) ! [v0: $i] : (v0 = n1 | v0 = n0 | ~ $i(v0) | ~ leq(v0, n1) | ~ % 144.86/19.44 | leq(n0, v0)) % 144.86/19.44 | % 144.86/19.44 | ALPHA: (finite_domain_2) implies: % 144.86/19.44 | (4) ! [v0: $i] : (v0 = n2 | v0 = n1 | v0 = n0 | ~ $i(v0) | ~ leq(v0, n2) % 144.86/19.44 | | ~ leq(n0, v0)) % 144.86/19.44 | % 144.86/19.44 | ALPHA: (successor_4) implies: % 144.86/19.45 | (5) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (succ(v2) = n4 & succ(v1) = % 144.86/19.45 | v2 & succ(v0) = v1 & succ(n0) = v0 & $i(v2) & $i(v1) & $i(v0)) % 144.86/19.45 | % 144.86/19.45 | ALPHA: (successor_5) implies: % 144.86/19.45 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (succ(v3) = n5 % 144.86/19.45 | & succ(v2) = v3 & succ(v1) = v2 & succ(v0) = v1 & succ(n0) = v0 & % 144.86/19.45 | $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 144.86/19.45 | % 144.86/19.45 | ALPHA: (successor_1) implies: % 144.86/19.45 | (7) succ(n0) = n1 % 144.86/19.45 | % 144.86/19.45 | ALPHA: (successor_2) implies: % 144.86/19.45 | (8) ? [v0: $i] : (succ(v0) = n2 & succ(n0) = v0 & $i(v0)) % 144.86/19.45 | % 144.86/19.45 | ALPHA: (successor_3) implies: % 144.86/19.45 | (9) ? [v0: $i] : ? [v1: $i] : (succ(v1) = n3 & succ(v0) = v1 & succ(n0) = % 144.86/19.45 | v0 & $i(v1) & $i(v0)) % 144.86/19.45 | % 144.86/19.45 | ALPHA: (gauss_init_0025) implies: % 144.86/19.45 | (10) $i(n0) % 144.86/19.45 | (11) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 144.86/19.45 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : % 144.86/19.45 | ? [v10: $i] : (s_worst7_init = init & s_sworst7_init = init & % 144.86/19.45 | s_best7_init = init & minus(n410, n1) = v0 & minus(n3, n1) = v1 & % 144.86/19.45 | $i(v9) & $i(v8) & $i(v6) & $i(v4) & $i(v2) & $i(v1) & $i(v0) & % 144.86/19.45 | leq(pv1376, n3) & leq(pv19, v0) & leq(s_worst7, n3) & leq(s_sworst7, % 144.86/19.45 | n3) & leq(s_best7, n3) & leq(n0, pv1376) & leq(n0, pv19) & leq(n0, % 144.86/19.45 | s_worst7) & leq(n0, s_sworst7) & leq(n0, s_best7) & ! [v11: $i] : % 144.86/19.45 | ! [v12: $i] : ! [v13: $i] : (v13 = init | ~ % 144.86/19.45 | (a_select3(simplex7_init, v12, v11) = v13) | ~ $i(v12) | ~ % 144.86/19.45 | $i(v11) | ~ leq(v12, n3) | ~ leq(v11, n2) | ~ leq(n0, v12) | ~ % 144.86/19.45 | leq(n0, v11)) & ! [v11: $i] : ! [v12: $i] : (v12 = init | ~ % 144.86/19.45 | (a_select2(s_try7_init, v11) = v12) | ~ $i(v11) | ~ leq(v11, v1) % 144.86/19.45 | | ~ leq(n0, v11)) & ! [v11: $i] : ! [v12: $i] : (v12 = init | % 144.86/19.45 | ~ (a_select2(s_center7_init, v11) = v12) | ~ $i(v11) | ~ % 144.86/19.45 | leq(v11, n2) | ~ leq(n0, v11)) & ! [v11: $i] : ! [v12: $i] : % 144.86/19.45 | (v12 = init | ~ (a_select2(s_values7_init, v11) = v12) | ~ $i(v11) % 144.86/19.45 | | ~ leq(v11, n3) | ~ leq(n0, v11)) & ( ~ gt(loopcounter, n1) | % 144.86/19.45 | (pvar1402_init = init & pvar1401_init = init & pvar1400_init = % 144.86/19.45 | init)) & (( ~ (v10 = init) & a_select3(simplex7_init, v9, v8) = % 144.86/19.45 | v10 & $i(v10) & leq(v9, n3) & leq(v8, n2) & leq(n0, v9) & % 144.86/19.45 | leq(n0, v8)) | ( ~ (v7 = init) & a_select2(s_values7_init, v6) = % 144.86/19.45 | v7 & $i(v7) & leq(v6, n3) & leq(n0, v6)) | ( ~ (v5 = init) & % 144.86/19.45 | a_select2(s_center7_init, v4) = v5 & $i(v5) & leq(v4, n2) & % 144.86/19.45 | leq(n0, v4)) | ( ~ (v3 = init) & a_select2(s_try7_init, v2) = v3 % 144.86/19.45 | & $i(v3) & leq(v2, v1) & leq(n0, v2)) | (gt(loopcounter, n1) & ( % 144.86/19.45 | ~ (pvar1402_init = init) | ~ (pvar1401_init = init) | ~ % 144.86/19.45 | (pvar1400_init = init))))) % 144.86/19.45 | % 144.86/19.45 | ALPHA: (function-axioms) implies: % 144.86/19.45 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (pred(v2) = % 144.86/19.45 | v1) | ~ (pred(v2) = v0)) % 144.86/19.45 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (succ(v2) = % 144.86/19.45 | v1) | ~ (succ(v2) = v0)) % 144.86/19.45 | % 144.86/19.46 | DELTA: instantiating (8) with fresh symbol all_54_0 gives: % 144.86/19.46 | (14) succ(all_54_0) = n2 & succ(n0) = all_54_0 & $i(all_54_0) % 144.86/19.46 | % 144.86/19.46 | ALPHA: (14) implies: % 144.86/19.46 | (15) $i(all_54_0) % 144.86/19.46 | (16) succ(n0) = all_54_0 % 144.86/19.46 | (17) succ(all_54_0) = n2 % 144.86/19.46 | % 144.86/19.46 | DELTA: instantiating (9) with fresh symbols all_56_0, all_56_1 gives: % 144.86/19.46 | (18) succ(all_56_0) = n3 & succ(all_56_1) = all_56_0 & succ(n0) = all_56_1 % 144.86/19.46 | & $i(all_56_0) & $i(all_56_1) % 144.86/19.46 | % 144.86/19.46 | ALPHA: (18) implies: % 144.86/19.46 | (19) $i(all_56_0) % 144.86/19.46 | (20) succ(n0) = all_56_1 % 144.86/19.46 | (21) succ(all_56_1) = all_56_0 % 144.86/19.46 | (22) succ(all_56_0) = n3 % 144.86/19.46 | % 144.86/19.46 | DELTA: instantiating (5) with fresh symbols all_59_0, all_59_1, all_59_2 % 144.86/19.46 | gives: % 144.86/19.46 | (23) succ(all_59_0) = n4 & succ(all_59_1) = all_59_0 & succ(all_59_2) = % 144.86/19.46 | all_59_1 & succ(n0) = all_59_2 & $i(all_59_0) & $i(all_59_1) & % 144.86/19.46 | $i(all_59_2) % 144.86/19.46 | % 144.86/19.46 | ALPHA: (23) implies: % 144.86/19.46 | (24) $i(all_59_0) % 144.86/19.46 | (25) succ(n0) = all_59_2 % 144.86/19.46 | (26) succ(all_59_2) = all_59_1 % 144.86/19.46 | (27) succ(all_59_1) = all_59_0 % 144.86/19.46 | % 144.86/19.46 | DELTA: instantiating (6) with fresh symbols all_61_0, all_61_1, all_61_2, % 144.86/19.46 | all_61_3 gives: % 144.86/19.46 | (28) succ(all_61_0) = n5 & succ(all_61_1) = all_61_0 & succ(all_61_2) = % 144.86/19.46 | all_61_1 & succ(all_61_3) = all_61_2 & succ(n0) = all_61_3 & % 144.86/19.46 | $i(all_61_0) & $i(all_61_1) & $i(all_61_2) & $i(all_61_3) % 144.86/19.46 | % 144.86/19.46 | ALPHA: (28) implies: % 144.86/19.46 | (29) succ(n0) = all_61_3 % 144.86/19.46 | (30) succ(all_61_3) = all_61_2 % 144.86/19.46 | (31) succ(all_61_2) = all_61_1 % 144.86/19.46 | % 144.86/19.46 | DELTA: instantiating (11) with fresh symbols all_71_0, all_71_1, all_71_2, % 144.86/19.46 | all_71_3, all_71_4, all_71_5, all_71_6, all_71_7, all_71_8, all_71_9, % 144.86/19.46 | all_71_10 gives: % 144.86/19.46 | (32) s_worst7_init = init & s_sworst7_init = init & s_best7_init = init & % 144.86/19.46 | minus(n410, n1) = all_71_10 & minus(n3, n1) = all_71_9 & $i(all_71_1) % 144.86/19.46 | & $i(all_71_2) & $i(all_71_4) & $i(all_71_6) & $i(all_71_8) & % 144.86/19.46 | $i(all_71_9) & $i(all_71_10) & leq(pv1376, n3) & leq(pv19, all_71_10) % 144.86/19.46 | & leq(s_worst7, n3) & leq(s_sworst7, n3) & leq(s_best7, n3) & leq(n0, % 144.86/19.46 | pv1376) & leq(n0, pv19) & leq(n0, s_worst7) & leq(n0, s_sworst7) & % 144.86/19.46 | leq(n0, s_best7) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = % 144.86/19.46 | init | ~ (a_select3(simplex7_init, v1, v0) = v2) | ~ $i(v1) | ~ % 144.86/19.46 | $i(v0) | ~ leq(v1, n3) | ~ leq(v0, n2) | ~ leq(n0, v1) | ~ % 144.86/19.46 | leq(n0, v0)) & ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ % 144.86/19.46 | (a_select2(s_try7_init, v0) = v1) | ~ $i(v0) | ~ leq(v0, all_71_9) % 144.86/19.46 | | ~ leq(n0, v0)) & ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ % 144.86/19.46 | (a_select2(s_center7_init, v0) = v1) | ~ $i(v0) | ~ leq(v0, n2) | % 144.86/19.46 | ~ leq(n0, v0)) & ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ % 144.86/19.46 | (a_select2(s_values7_init, v0) = v1) | ~ $i(v0) | ~ leq(v0, n3) | % 144.86/19.46 | ~ leq(n0, v0)) & ( ~ gt(loopcounter, n1) | (pvar1402_init = init & % 144.86/19.46 | pvar1401_init = init & pvar1400_init = init)) & (( ~ (all_71_0 = % 144.86/19.46 | init) & a_select3(simplex7_init, all_71_1, all_71_2) = all_71_0 % 144.86/19.46 | & $i(all_71_0) & leq(all_71_1, n3) & leq(all_71_2, n2) & leq(n0, % 144.86/19.46 | all_71_1) & leq(n0, all_71_2)) | ( ~ (all_71_3 = init) & % 144.86/19.47 | a_select2(s_values7_init, all_71_4) = all_71_3 & $i(all_71_3) & % 144.86/19.47 | leq(all_71_4, n3) & leq(n0, all_71_4)) | ( ~ (all_71_5 = init) & % 144.86/19.47 | a_select2(s_center7_init, all_71_6) = all_71_5 & $i(all_71_5) & % 144.86/19.47 | leq(all_71_6, n2) & leq(n0, all_71_6)) | ( ~ (all_71_7 = init) & % 144.86/19.47 | a_select2(s_try7_init, all_71_8) = all_71_7 & $i(all_71_7) & % 144.86/19.47 | leq(all_71_8, all_71_9) & leq(n0, all_71_8)) | (gt(loopcounter, % 144.86/19.47 | n1) & ( ~ (pvar1402_init = init) | ~ (pvar1401_init = init) | % 144.86/19.47 | ~ (pvar1400_init = init)))) % 144.86/19.47 | % 144.86/19.47 | ALPHA: (32) implies: % 144.86/19.47 | (33) $i(all_71_8) % 144.86/19.47 | (34) $i(all_71_6) % 144.86/19.47 | (35) $i(all_71_4) % 144.86/19.47 | (36) $i(all_71_2) % 144.86/19.47 | (37) $i(all_71_1) % 144.86/19.47 | (38) minus(n3, n1) = all_71_9 % 144.86/19.47 | (39) ( ~ (all_71_0 = init) & a_select3(simplex7_init, all_71_1, all_71_2) = % 144.86/19.47 | all_71_0 & $i(all_71_0) & leq(all_71_1, n3) & leq(all_71_2, n2) & % 144.86/19.47 | leq(n0, all_71_1) & leq(n0, all_71_2)) | ( ~ (all_71_3 = init) & % 144.86/19.47 | a_select2(s_values7_init, all_71_4) = all_71_3 & $i(all_71_3) & % 144.86/19.47 | leq(all_71_4, n3) & leq(n0, all_71_4)) | ( ~ (all_71_5 = init) & % 144.86/19.47 | a_select2(s_center7_init, all_71_6) = all_71_5 & $i(all_71_5) & % 144.86/19.47 | leq(all_71_6, n2) & leq(n0, all_71_6)) | ( ~ (all_71_7 = init) & % 144.86/19.47 | a_select2(s_try7_init, all_71_8) = all_71_7 & $i(all_71_7) & % 144.86/19.47 | leq(all_71_8, all_71_9) & leq(n0, all_71_8)) | (gt(loopcounter, n1) % 144.86/19.47 | & ( ~ (pvar1402_init = init) | ~ (pvar1401_init = init) | ~ % 144.86/19.47 | (pvar1400_init = init))) % 144.86/19.47 | (40) ~ gt(loopcounter, n1) | (pvar1402_init = init & pvar1401_init = init % 144.86/19.47 | & pvar1400_init = init) % 144.86/19.47 | (41) ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select2(s_values7_init, % 144.86/19.47 | v0) = v1) | ~ $i(v0) | ~ leq(v0, n3) | ~ leq(n0, v0)) % 144.86/19.47 | (42) ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select2(s_center7_init, % 144.86/19.47 | v0) = v1) | ~ $i(v0) | ~ leq(v0, n2) | ~ leq(n0, v0)) % 144.86/19.47 | (43) ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select2(s_try7_init, % 144.86/19.47 | v0) = v1) | ~ $i(v0) | ~ leq(v0, all_71_9) | ~ leq(n0, v0)) % 144.86/19.47 | (44) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = init | ~ % 144.86/19.47 | (a_select3(simplex7_init, v1, v0) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 144.86/19.47 | leq(v1, n3) | ~ leq(v0, n2) | ~ leq(n0, v1) | ~ leq(n0, v0)) % 144.86/19.47 | % 144.86/19.47 | GROUND_INST: instantiating (13) with all_54_0, all_56_1, n0, simplifying with % 144.86/19.47 | (16), (20) gives: % 144.86/19.47 | (45) all_56_1 = all_54_0 % 144.86/19.47 | % 144.86/19.47 | GROUND_INST: instantiating (13) with all_56_1, all_59_2, n0, simplifying with % 144.86/19.47 | (20), (25) gives: % 144.86/19.47 | (46) all_59_2 = all_56_1 % 144.86/19.47 | % 144.86/19.47 | GROUND_INST: instantiating (13) with all_59_2, all_61_3, n0, simplifying with % 144.86/19.47 | (25), (29) gives: % 144.86/19.47 | (47) all_61_3 = all_59_2 % 144.86/19.47 | % 144.86/19.47 | GROUND_INST: instantiating (13) with n1, all_61_3, n0, simplifying with (7), % 144.86/19.47 | (29) gives: % 144.86/19.47 | (48) all_61_3 = n1 % 144.86/19.47 | % 144.86/19.47 | COMBINE_EQS: (47), (48) imply: % 144.86/19.47 | (49) all_59_2 = n1 % 144.86/19.47 | % 144.86/19.47 | SIMP: (49) implies: % 144.86/19.47 | (50) all_59_2 = n1 % 144.86/19.47 | % 144.86/19.47 | COMBINE_EQS: (46), (50) imply: % 144.86/19.47 | (51) all_56_1 = n1 % 144.86/19.47 | % 144.86/19.47 | SIMP: (51) implies: % 144.86/19.47 | (52) all_56_1 = n1 % 144.86/19.47 | % 144.86/19.47 | COMBINE_EQS: (45), (52) imply: % 144.86/19.47 | (53) all_54_0 = n1 % 144.86/19.47 | % 144.86/19.47 | SIMP: (53) implies: % 144.86/19.47 | (54) all_54_0 = n1 % 144.86/19.47 | % 144.86/19.47 | REDUCE: (30), (48) imply: % 144.86/19.47 | (55) succ(n1) = all_61_2 % 144.86/19.47 | % 144.86/19.47 | REDUCE: (26), (50) imply: % 144.86/19.47 | (56) succ(n1) = all_59_1 % 144.86/19.47 | % 144.86/19.47 | REDUCE: (21), (52) imply: % 144.86/19.47 | (57) succ(n1) = all_56_0 % 144.86/19.47 | % 144.86/19.47 | REDUCE: (17), (54) imply: % 144.86/19.48 | (58) succ(n1) = n2 % 144.86/19.48 | % 144.86/19.48 | REDUCE: (15), (54) imply: % 144.86/19.48 | (59) $i(n1) % 144.86/19.48 | % 144.86/19.48 | GROUND_INST: instantiating (13) with all_56_0, all_59_1, n1, simplifying with % 144.86/19.48 | (56), (57) gives: % 144.86/19.48 | (60) all_59_1 = all_56_0 % 144.86/19.48 | % 144.86/19.48 | GROUND_INST: instantiating (13) with all_59_1, all_61_2, n1, simplifying with % 144.86/19.48 | (55), (56) gives: % 144.86/19.48 | (61) all_61_2 = all_59_1 % 144.86/19.48 | % 144.86/19.48 | GROUND_INST: instantiating (13) with n2, all_61_2, n1, simplifying with (55), % 144.86/19.48 | (58) gives: % 144.86/19.48 | (62) all_61_2 = n2 % 144.86/19.48 | % 144.86/19.48 | COMBINE_EQS: (61), (62) imply: % 144.86/19.48 | (63) all_59_1 = n2 % 144.86/19.48 | % 144.86/19.48 | SIMP: (63) implies: % 144.86/19.48 | (64) all_59_1 = n2 % 144.86/19.48 | % 144.86/19.48 | COMBINE_EQS: (60), (64) imply: % 144.86/19.48 | (65) all_56_0 = n2 % 144.86/19.48 | % 144.86/19.48 | REDUCE: (31), (62) imply: % 145.20/19.48 | (66) succ(n2) = all_61_1 % 145.20/19.48 | % 145.20/19.48 | REDUCE: (27), (64) imply: % 145.20/19.48 | (67) succ(n2) = all_59_0 % 145.20/19.48 | % 145.20/19.48 | REDUCE: (22), (65) imply: % 145.20/19.48 | (68) succ(n2) = n3 % 145.20/19.48 | % 145.20/19.48 | REDUCE: (19), (65) imply: % 145.20/19.48 | (69) $i(n2) % 145.20/19.48 | % 145.20/19.48 | GROUND_INST: instantiating (13) with all_59_0, all_61_1, n2, simplifying with % 145.20/19.48 | (66), (67) gives: % 145.20/19.48 | (70) all_61_1 = all_59_0 % 145.20/19.48 | % 145.20/19.48 | GROUND_INST: instantiating (13) with n3, all_61_1, n2, simplifying with (66), % 145.20/19.48 | (68) gives: % 145.20/19.48 | (71) all_61_1 = n3 % 145.20/19.48 | % 145.20/19.48 | COMBINE_EQS: (70), (71) imply: % 145.20/19.48 | (72) all_59_0 = n3 % 145.20/19.48 | % 145.20/19.48 | SIMP: (72) implies: % 145.20/19.48 | (73) all_59_0 = n3 % 145.20/19.48 | % 145.20/19.48 | REDUCE: (24), (73) imply: % 145.20/19.48 | (74) $i(n3) % 145.20/19.48 | % 145.20/19.48 | GROUND_INST: instantiating (pred_succ) with n1, n2, simplifying with (58), % 145.20/19.48 | (59) gives: % 145.20/19.48 | (75) pred(n2) = n1 % 145.20/19.48 | % 145.20/19.48 | GROUND_INST: instantiating (pred_succ) with n2, n3, simplifying with (68), % 145.20/19.48 | (69) gives: % 145.20/19.48 | (76) pred(n3) = n2 % 145.20/19.48 | % 145.20/19.48 | GROUND_INST: instantiating (2) with n3, all_71_9, simplifying with (38), (74) % 145.20/19.48 | gives: % 145.20/19.48 | (77) pred(n3) = all_71_9 & $i(all_71_9) % 145.20/19.48 | % 145.20/19.48 | ALPHA: (77) implies: % 145.20/19.48 | (78) $i(all_71_9) % 145.20/19.48 | (79) pred(n3) = all_71_9 % 145.20/19.48 | % 145.20/19.48 | GROUND_INST: instantiating (12) with n2, all_71_9, n3, simplifying with (76), % 145.20/19.48 | (79) gives: % 145.20/19.48 | (80) all_71_9 = n2 % 145.20/19.48 | % 145.20/19.48 | BETA: splitting (40) gives: % 145.20/19.48 | % 145.20/19.48 | Case 1: % 145.20/19.48 | | % 145.20/19.48 | | (81) ~ gt(loopcounter, n1) % 145.20/19.48 | | % 145.20/19.48 | | BETA: splitting (39) gives: % 145.20/19.48 | | % 145.20/19.48 | | Case 1: % 145.20/19.48 | | | % 145.20/19.48 | | | (82) ( ~ (all_71_0 = init) & a_select3(simplex7_init, all_71_1, % 145.20/19.48 | | | all_71_2) = all_71_0 & $i(all_71_0) & leq(all_71_1, n3) & % 145.20/19.48 | | | leq(all_71_2, n2) & leq(n0, all_71_1) & leq(n0, all_71_2)) | ( ~ % 145.20/19.48 | | | (all_71_3 = init) & a_select2(s_values7_init, all_71_4) = % 145.20/19.48 | | | all_71_3 & $i(all_71_3) & leq(all_71_4, n3) & leq(n0, all_71_4)) % 145.20/19.48 | | | % 145.20/19.48 | | | BETA: splitting (82) gives: % 145.20/19.48 | | | % 145.20/19.48 | | | Case 1: % 145.20/19.48 | | | | % 145.20/19.48 | | | | (83) ~ (all_71_0 = init) & a_select3(simplex7_init, all_71_1, % 145.20/19.48 | | | | all_71_2) = all_71_0 & $i(all_71_0) & leq(all_71_1, n3) & % 145.20/19.48 | | | | leq(all_71_2, n2) & leq(n0, all_71_1) & leq(n0, all_71_2) % 145.20/19.48 | | | | % 145.20/19.48 | | | | ALPHA: (83) implies: % 145.20/19.48 | | | | (84) ~ (all_71_0 = init) % 145.20/19.48 | | | | (85) leq(n0, all_71_2) % 145.20/19.48 | | | | (86) leq(n0, all_71_1) % 145.20/19.48 | | | | (87) leq(all_71_2, n2) % 145.20/19.48 | | | | (88) leq(all_71_1, n3) % 145.20/19.48 | | | | (89) a_select3(simplex7_init, all_71_1, all_71_2) = all_71_0 % 145.20/19.48 | | | | % 145.20/19.49 | | | | GROUND_INST: instantiating (44) with all_71_2, all_71_1, all_71_0, % 145.20/19.49 | | | | simplifying with (36), (37), (85), (86), (87), (88), (89) % 145.20/19.49 | | | | gives: % 145.20/19.49 | | | | (90) all_71_0 = init % 145.20/19.49 | | | | % 145.20/19.49 | | | | REDUCE: (84), (90) imply: % 145.20/19.49 | | | | (91) $false % 145.20/19.49 | | | | % 145.20/19.49 | | | | CLOSE: (91) is inconsistent. % 145.20/19.49 | | | | % 145.20/19.49 | | | Case 2: % 145.20/19.49 | | | | % 145.20/19.49 | | | | (92) ~ (all_71_3 = init) & a_select2(s_values7_init, all_71_4) = % 145.20/19.49 | | | | all_71_3 & $i(all_71_3) & leq(all_71_4, n3) & leq(n0, all_71_4) % 145.20/19.49 | | | | % 145.20/19.49 | | | | ALPHA: (92) implies: % 145.20/19.49 | | | | (93) ~ (all_71_3 = init) % 145.20/19.49 | | | | (94) leq(n0, all_71_4) % 145.20/19.49 | | | | (95) leq(all_71_4, n3) % 145.20/19.49 | | | | (96) a_select2(s_values7_init, all_71_4) = all_71_3 % 145.20/19.49 | | | | % 145.20/19.49 | | | | GROUND_INST: instantiating (41) with all_71_4, all_71_3, simplifying % 145.20/19.49 | | | | with (35), (94), (95), (96) gives: % 145.20/19.49 | | | | (97) all_71_3 = init % 145.20/19.49 | | | | % 145.20/19.49 | | | | REDUCE: (93), (97) imply: % 145.20/19.49 | | | | (98) $false % 145.20/19.49 | | | | % 145.20/19.49 | | | | CLOSE: (98) is inconsistent. % 145.20/19.49 | | | | % 145.20/19.49 | | | End of split % 145.20/19.49 | | | % 145.20/19.49 | | Case 2: % 145.20/19.49 | | | % 145.20/19.49 | | | (99) ( ~ (all_71_5 = init) & a_select2(s_center7_init, all_71_6) = % 145.20/19.49 | | | all_71_5 & $i(all_71_5) & leq(all_71_6, n2) & leq(n0, all_71_6)) % 145.20/19.49 | | | | ( ~ (all_71_7 = init) & a_select2(s_try7_init, all_71_8) = % 145.20/19.49 | | | all_71_7 & $i(all_71_7) & leq(all_71_8, all_71_9) & leq(n0, % 145.20/19.49 | | | all_71_8)) | (gt(loopcounter, n1) & ( ~ (pvar1402_init = init) % 145.20/19.49 | | | | ~ (pvar1401_init = init) | ~ (pvar1400_init = init))) % 145.20/19.49 | | | % 145.20/19.49 | | | BETA: splitting (99) gives: % 145.20/19.49 | | | % 145.20/19.49 | | | Case 1: % 145.20/19.49 | | | | % 145.20/19.49 | | | | (100) ~ (all_71_5 = init) & a_select2(s_center7_init, all_71_6) = % 145.20/19.49 | | | | all_71_5 & $i(all_71_5) & leq(all_71_6, n2) & leq(n0, all_71_6) % 145.20/19.49 | | | | % 145.20/19.49 | | | | ALPHA: (100) implies: % 145.20/19.49 | | | | (101) ~ (all_71_5 = init) % 145.20/19.49 | | | | (102) leq(n0, all_71_6) % 145.20/19.49 | | | | (103) leq(all_71_6, n2) % 145.20/19.49 | | | | (104) a_select2(s_center7_init, all_71_6) = all_71_5 % 145.20/19.49 | | | | % 145.20/19.49 | | | | GROUND_INST: instantiating (42) with all_71_6, all_71_5, simplifying % 145.20/19.49 | | | | with (34), (102), (103), (104) gives: % 145.20/19.49 | | | | (105) all_71_5 = init % 145.20/19.49 | | | | % 145.20/19.49 | | | | REDUCE: (101), (105) imply: % 145.20/19.49 | | | | (106) $false % 145.20/19.49 | | | | % 145.20/19.49 | | | | CLOSE: (106) is inconsistent. % 145.20/19.49 | | | | % 145.20/19.49 | | | Case 2: % 145.20/19.49 | | | | % 145.20/19.49 | | | | (107) ( ~ (all_71_7 = init) & a_select2(s_try7_init, all_71_8) = % 145.20/19.49 | | | | all_71_7 & $i(all_71_7) & leq(all_71_8, all_71_9) & leq(n0, % 145.20/19.49 | | | | all_71_8)) | (gt(loopcounter, n1) & ( ~ (pvar1402_init = % 145.20/19.49 | | | | init) | ~ (pvar1401_init = init) | ~ (pvar1400_init = % 145.20/19.49 | | | | init))) % 145.20/19.49 | | | | % 145.20/19.49 | | | | BETA: splitting (107) gives: % 145.20/19.49 | | | | % 145.20/19.49 | | | | Case 1: % 145.20/19.49 | | | | | % 145.20/19.49 | | | | | (108) ~ (all_71_7 = init) & a_select2(s_try7_init, all_71_8) = % 145.20/19.49 | | | | | all_71_7 & $i(all_71_7) & leq(all_71_8, all_71_9) & leq(n0, % 145.20/19.49 | | | | | all_71_8) % 145.20/19.49 | | | | | % 145.20/19.50 | | | | | REF_CLOSE: (1), (3), (4), (10), (33), (43), (69), (75), (80), (108), % 145.20/19.50 | | | | | (irreflexivity_gt), (leq_gt2) are inconsistent by sub-proof % 145.20/19.50 | | | | | #1. % 145.20/19.50 | | | | | % 145.20/19.50 | | | | Case 2: % 145.20/19.50 | | | | | % 145.20/19.50 | | | | | (109) gt(loopcounter, n1) & ( ~ (pvar1402_init = init) | ~ % 145.20/19.50 | | | | | (pvar1401_init = init) | ~ (pvar1400_init = init)) % 145.20/19.50 | | | | | % 145.20/19.50 | | | | | ALPHA: (109) implies: % 145.20/19.50 | | | | | (110) gt(loopcounter, n1) % 145.20/19.50 | | | | | % 145.20/19.50 | | | | | PRED_UNIFY: (81), (110) imply: % 145.20/19.50 | | | | | (111) $false % 145.20/19.50 | | | | | % 145.20/19.50 | | | | | CLOSE: (111) is inconsistent. % 145.20/19.50 | | | | | % 145.20/19.50 | | | | End of split % 145.20/19.50 | | | | % 145.20/19.50 | | | End of split % 145.20/19.50 | | | % 145.20/19.50 | | End of split % 145.20/19.50 | | % 145.20/19.50 | Case 2: % 145.20/19.50 | | % 145.20/19.50 | | (112) pvar1402_init = init & pvar1401_init = init & pvar1400_init = init % 145.20/19.50 | | % 145.20/19.50 | | ALPHA: (112) implies: % 145.20/19.50 | | (113) pvar1400_init = init % 145.20/19.50 | | (114) pvar1401_init = init % 145.20/19.50 | | (115) pvar1402_init = init % 145.20/19.50 | | % 145.20/19.50 | | BETA: splitting (39) gives: % 145.20/19.50 | | % 145.20/19.50 | | Case 1: % 145.20/19.50 | | | % 145.20/19.50 | | | (116) ( ~ (all_71_0 = init) & a_select3(simplex7_init, all_71_1, % 145.20/19.50 | | | all_71_2) = all_71_0 & $i(all_71_0) & leq(all_71_1, n3) & % 145.20/19.50 | | | leq(all_71_2, n2) & leq(n0, all_71_1) & leq(n0, all_71_2)) | ( % 145.20/19.50 | | | ~ (all_71_3 = init) & a_select2(s_values7_init, all_71_4) = % 145.20/19.50 | | | all_71_3 & $i(all_71_3) & leq(all_71_4, n3) & leq(n0, % 145.20/19.50 | | | all_71_4)) % 145.20/19.50 | | | % 145.20/19.50 | | | BETA: splitting (116) gives: % 145.20/19.50 | | | % 145.20/19.50 | | | Case 1: % 145.20/19.50 | | | | % 145.20/19.50 | | | | (117) ~ (all_71_0 = init) & a_select3(simplex7_init, all_71_1, % 145.20/19.50 | | | | all_71_2) = all_71_0 & $i(all_71_0) & leq(all_71_1, n3) & % 145.20/19.50 | | | | leq(all_71_2, n2) & leq(n0, all_71_1) & leq(n0, all_71_2) % 145.20/19.50 | | | | % 145.20/19.50 | | | | ALPHA: (117) implies: % 145.20/19.50 | | | | (118) ~ (all_71_0 = init) % 145.20/19.50 | | | | (119) leq(n0, all_71_2) % 145.20/19.50 | | | | (120) leq(n0, all_71_1) % 145.20/19.50 | | | | (121) leq(all_71_2, n2) % 145.20/19.50 | | | | (122) leq(all_71_1, n3) % 145.20/19.50 | | | | (123) a_select3(simplex7_init, all_71_1, all_71_2) = all_71_0 % 145.20/19.50 | | | | % 145.20/19.50 | | | | GROUND_INST: instantiating (44) with all_71_2, all_71_1, all_71_0, % 145.20/19.50 | | | | simplifying with (36), (37), (119), (120), (121), (122), % 145.20/19.50 | | | | (123) gives: % 145.20/19.50 | | | | (124) all_71_0 = init % 145.20/19.50 | | | | % 145.20/19.50 | | | | REDUCE: (118), (124) imply: % 145.20/19.50 | | | | (125) $false % 145.20/19.50 | | | | % 145.20/19.50 | | | | CLOSE: (125) is inconsistent. % 145.20/19.50 | | | | % 145.20/19.50 | | | Case 2: % 145.20/19.50 | | | | % 145.20/19.50 | | | | (126) ~ (all_71_3 = init) & a_select2(s_values7_init, all_71_4) = % 145.20/19.50 | | | | all_71_3 & $i(all_71_3) & leq(all_71_4, n3) & leq(n0, all_71_4) % 145.20/19.50 | | | | % 145.20/19.50 | | | | ALPHA: (126) implies: % 145.20/19.50 | | | | (127) ~ (all_71_3 = init) % 145.20/19.50 | | | | (128) leq(n0, all_71_4) % 145.20/19.50 | | | | (129) leq(all_71_4, n3) % 145.20/19.50 | | | | (130) a_select2(s_values7_init, all_71_4) = all_71_3 % 145.20/19.50 | | | | % 145.20/19.50 | | | | GROUND_INST: instantiating (41) with all_71_4, all_71_3, simplifying % 145.20/19.50 | | | | with (35), (128), (129), (130) gives: % 145.20/19.50 | | | | (131) all_71_3 = init % 145.20/19.50 | | | | % 145.20/19.50 | | | | REDUCE: (127), (131) imply: % 145.20/19.50 | | | | (132) $false % 145.20/19.50 | | | | % 145.20/19.50 | | | | CLOSE: (132) is inconsistent. % 145.20/19.50 | | | | % 145.20/19.50 | | | End of split % 145.20/19.50 | | | % 145.20/19.50 | | Case 2: % 145.20/19.50 | | | % 145.20/19.50 | | | (133) ( ~ (all_71_5 = init) & a_select2(s_center7_init, all_71_6) = % 145.20/19.50 | | | all_71_5 & $i(all_71_5) & leq(all_71_6, n2) & leq(n0, % 145.20/19.50 | | | all_71_6)) | ( ~ (all_71_7 = init) & a_select2(s_try7_init, % 145.20/19.50 | | | all_71_8) = all_71_7 & $i(all_71_7) & leq(all_71_8, all_71_9) % 145.20/19.50 | | | & leq(n0, all_71_8)) | (gt(loopcounter, n1) & ( ~ % 145.20/19.50 | | | (pvar1402_init = init) | ~ (pvar1401_init = init) | ~ % 145.20/19.50 | | | (pvar1400_init = init))) % 145.20/19.50 | | | % 145.20/19.50 | | | BETA: splitting (133) gives: % 145.20/19.50 | | | % 145.20/19.50 | | | Case 1: % 145.20/19.50 | | | | % 145.20/19.51 | | | | (134) ~ (all_71_5 = init) & a_select2(s_center7_init, all_71_6) = % 145.20/19.51 | | | | all_71_5 & $i(all_71_5) & leq(all_71_6, n2) & leq(n0, all_71_6) % 145.20/19.51 | | | | % 145.20/19.51 | | | | ALPHA: (134) implies: % 145.20/19.51 | | | | (135) ~ (all_71_5 = init) % 145.20/19.51 | | | | (136) leq(n0, all_71_6) % 145.20/19.51 | | | | (137) leq(all_71_6, n2) % 145.20/19.51 | | | | (138) a_select2(s_center7_init, all_71_6) = all_71_5 % 145.20/19.51 | | | | % 145.20/19.51 | | | | GROUND_INST: instantiating (42) with all_71_6, all_71_5, simplifying % 145.20/19.51 | | | | with (34), (136), (137), (138) gives: % 145.20/19.51 | | | | (139) all_71_5 = init % 145.20/19.51 | | | | % 145.20/19.51 | | | | REDUCE: (135), (139) imply: % 145.20/19.51 | | | | (140) $false % 145.20/19.51 | | | | % 145.20/19.51 | | | | CLOSE: (140) is inconsistent. % 145.20/19.51 | | | | % 145.20/19.51 | | | Case 2: % 145.20/19.51 | | | | % 145.20/19.51 | | | | (141) ( ~ (all_71_7 = init) & a_select2(s_try7_init, all_71_8) = % 145.20/19.51 | | | | all_71_7 & $i(all_71_7) & leq(all_71_8, all_71_9) & leq(n0, % 145.20/19.51 | | | | all_71_8)) | (gt(loopcounter, n1) & ( ~ (pvar1402_init = % 145.20/19.51 | | | | init) | ~ (pvar1401_init = init) | ~ (pvar1400_init = % 145.20/19.51 | | | | init))) % 145.20/19.51 | | | | % 145.20/19.51 | | | | BETA: splitting (141) gives: % 145.20/19.51 | | | | % 145.20/19.51 | | | | Case 1: % 145.20/19.51 | | | | | % 145.20/19.51 | | | | | (142) ~ (all_71_7 = init) & a_select2(s_try7_init, all_71_8) = % 145.20/19.51 | | | | | all_71_7 & $i(all_71_7) & leq(all_71_8, all_71_9) & leq(n0, % 145.20/19.51 | | | | | all_71_8) % 145.20/19.51 | | | | | % 145.20/19.51 | | | | | REF_CLOSE: (1), (3), (4), (10), (33), (43), (69), (75), (80), (142), % 145.20/19.51 | | | | | (irreflexivity_gt), (leq_gt2) are inconsistent by sub-proof % 145.20/19.51 | | | | | #1. % 145.20/19.51 | | | | | % 145.20/19.51 | | | | Case 2: % 145.20/19.51 | | | | | % 145.20/19.51 | | | | | (143) gt(loopcounter, n1) & ( ~ (pvar1402_init = init) | ~ % 145.20/19.51 | | | | | (pvar1401_init = init) | ~ (pvar1400_init = init)) % 145.20/19.51 | | | | | % 145.20/19.51 | | | | | ALPHA: (143) implies: % 145.20/19.51 | | | | | (144) ~ (pvar1402_init = init) | ~ (pvar1401_init = init) | ~ % 145.20/19.51 | | | | | (pvar1400_init = init) % 145.20/19.51 | | | | | % 145.20/19.51 | | | | | BETA: splitting (144) gives: % 145.20/19.51 | | | | | % 145.20/19.51 | | | | | Case 1: % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | | (145) ~ (pvar1402_init = init) % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | | REDUCE: (115), (145) imply: % 145.20/19.51 | | | | | | (146) $false % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | | CLOSE: (146) is inconsistent. % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | Case 2: % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | | (147) ~ (pvar1401_init = init) | ~ (pvar1400_init = init) % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | | BETA: splitting (147) gives: % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | | Case 1: % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | | (148) ~ (pvar1401_init = init) % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | | REDUCE: (114), (148) imply: % 145.20/19.51 | | | | | | | (149) $false % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | | CLOSE: (149) is inconsistent. % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | Case 2: % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | | (150) ~ (pvar1400_init = init) % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | | REDUCE: (113), (150) imply: % 145.20/19.51 | | | | | | | (151) $false % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | | CLOSE: (151) is inconsistent. % 145.20/19.51 | | | | | | | % 145.20/19.51 | | | | | | End of split % 145.20/19.51 | | | | | | % 145.20/19.51 | | | | | End of split % 145.20/19.51 | | | | | % 145.20/19.51 | | | | End of split % 145.20/19.51 | | | | % 145.20/19.51 | | | End of split % 145.20/19.51 | | | % 145.20/19.51 | | End of split % 145.20/19.51 | | % 145.20/19.51 | End of split % 145.20/19.51 | % 145.20/19.51 End of proof % 145.20/19.51 % 145.20/19.51 Sub-proof #1 shows that the following formulas are inconsistent: % 145.20/19.51 ---------------------------------------------------------------- % 145.20/19.51 (1) ! [v0: $i] : ( ~ $i(v0) | ~ gt(v0, v0)) % 145.20/19.51 (2) ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select2(s_try7_init, v0) = % 145.20/19.51 v1) | ~ $i(v0) | ~ leq(v0, all_71_9) | ~ leq(n0, v0)) % 145.20/19.51 (3) $i(all_71_8) % 145.20/19.51 (4) $i(n2) % 145.20/19.51 (5) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ leq(v0, % 145.20/19.51 v1) | gt(v1, v0)) % 145.20/19.51 (6) ! [v0: $i] : (v0 = n1 | v0 = n0 | ~ $i(v0) | ~ leq(v0, n1) | ~ % 145.20/19.51 leq(n0, v0)) % 145.20/19.51 (7) $i(n0) % 145.20/19.51 (8) ! [v0: $i] : (v0 = n2 | v0 = n1 | v0 = n0 | ~ $i(v0) | ~ leq(v0, n2) | % 145.20/19.51 ~ leq(n0, v0)) % 145.20/19.51 (9) all_71_9 = n2 % 145.20/19.51 (10) ~ (all_71_7 = init) & a_select2(s_try7_init, all_71_8) = all_71_7 & % 145.20/19.51 $i(all_71_7) & leq(all_71_8, all_71_9) & leq(n0, all_71_8) % 145.20/19.51 (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (pred(v1) = v2) | ~ % 145.20/19.51 $i(v1) | ~ $i(v0) | ~ gt(v1, v0) | leq(v0, v2)) % 145.20/19.51 (12) pred(n2) = n1 % 145.20/19.51 % 145.20/19.51 Begin of proof % 145.20/19.51 | % 145.20/19.51 | ALPHA: (10) implies: % 145.20/19.51 | (13) ~ (all_71_7 = init) % 145.20/19.51 | (14) leq(n0, all_71_8) % 145.20/19.51 | (15) leq(all_71_8, all_71_9) % 145.20/19.52 | (16) a_select2(s_try7_init, all_71_8) = all_71_7 % 145.20/19.52 | % 145.20/19.52 | REDUCE: (9), (15) imply: % 145.20/19.52 | (17) leq(all_71_8, n2) % 145.20/19.52 | % 145.20/19.52 | GROUND_INST: instantiating (5) with n0, all_71_8, simplifying with (3), (7), % 145.20/19.52 | (14) gives: % 145.20/19.52 | (18) all_71_8 = n0 | gt(all_71_8, n0) % 145.20/19.52 | % 145.20/19.52 | GROUND_INST: instantiating (8) with all_71_8, simplifying with (3), (14), (17) % 145.20/19.52 | gives: % 145.20/19.52 | (19) all_71_8 = n2 | all_71_8 = n1 | all_71_8 = n0 % 145.20/19.52 | % 145.20/19.52 | GROUND_INST: instantiating (5) with all_71_8, n2, simplifying with (3), (4), % 145.20/19.52 | (17) gives: % 145.20/19.52 | (20) all_71_8 = n2 | gt(n2, all_71_8) % 145.20/19.52 | % 145.20/19.52 | BETA: splitting (18) gives: % 145.20/19.52 | % 145.20/19.52 | Case 1: % 145.20/19.52 | | % 145.20/19.52 | | (21) gt(all_71_8, n0) % 145.20/19.52 | | % 145.20/19.52 | | BETA: splitting (20) gives: % 145.20/19.52 | | % 145.20/19.52 | | Case 1: % 145.20/19.52 | | | % 145.20/19.52 | | | (22) gt(n2, all_71_8) % 145.20/19.52 | | | % 145.20/19.52 | | | BETA: splitting (19) gives: % 145.20/19.52 | | | % 145.20/19.52 | | | Case 1: % 145.20/19.52 | | | | % 145.20/19.52 | | | | (23) all_71_8 = n0 % 145.20/19.52 | | | | % 145.20/19.52 | | | | REDUCE: (21), (23) imply: % 145.20/19.52 | | | | (24) gt(n0, n0) % 145.20/19.52 | | | | % 145.20/19.52 | | | | GROUND_INST: instantiating (1) with n0, simplifying with (7), (24) % 145.20/19.52 | | | | gives: % 145.20/19.52 | | | | (25) $false % 145.20/19.52 | | | | % 145.20/19.52 | | | | CLOSE: (25) is inconsistent. % 145.20/19.52 | | | | % 145.20/19.52 | | | Case 2: % 145.20/19.52 | | | | % 145.20/19.52 | | | | (26) ~ (all_71_8 = n0) % 145.20/19.52 | | | | % 145.20/19.52 | | | | REF_CLOSE: (2), (3), (4), (6), (9), (11), (12), (13), (14), (16), (17), % 145.20/19.52 | | | | (22), (26) are inconsistent by sub-proof #3. % 145.20/19.52 | | | | % 145.20/19.52 | | | End of split % 145.20/19.52 | | | % 145.20/19.52 | | Case 2: % 145.20/19.52 | | | % 145.20/19.52 | | | (27) all_71_8 = n2 % 145.20/19.52 | | | % 145.20/19.52 | | | REF_CLOSE: (2), (3), (9), (13), (14), (16), (17), (27) are inconsistent by % 145.20/19.52 | | | sub-proof #2. % 145.20/19.52 | | | % 145.20/19.52 | | End of split % 145.20/19.52 | | % 145.20/19.52 | Case 2: % 145.20/19.52 | | % 145.20/19.52 | | (28) all_71_8 = n0 % 145.20/19.52 | | (29) ~ gt(all_71_8, n0) % 145.20/19.52 | | % 145.20/19.52 | | REDUCE: (28), (29) imply: % 145.20/19.52 | | (30) ~ gt(n0, n0) % 145.20/19.52 | | % 145.20/19.52 | | BETA: splitting (18) gives: % 145.20/19.52 | | % 145.20/19.52 | | Case 1: % 145.20/19.52 | | | % 145.20/19.52 | | | (31) gt(all_71_8, n0) % 145.20/19.52 | | | % 145.20/19.52 | | | BETA: splitting (20) gives: % 145.20/19.52 | | | % 145.20/19.52 | | | Case 1: % 145.20/19.52 | | | | % 145.20/19.52 | | | | (32) gt(n2, all_71_8) % 145.20/19.52 | | | | % 145.20/19.52 | | | | BETA: splitting (19) gives: % 145.20/19.52 | | | | % 145.20/19.52 | | | | Case 1: % 145.20/19.52 | | | | | % 145.20/19.52 | | | | | % 145.20/19.52 | | | | | REDUCE: (28), (31) imply: % 145.20/19.52 | | | | | (33) gt(n0, n0) % 145.20/19.52 | | | | | % 145.20/19.52 | | | | | PRED_UNIFY: (30), (33) imply: % 145.20/19.52 | | | | | (34) $false % 145.20/19.52 | | | | | % 145.20/19.52 | | | | | CLOSE: (34) is inconsistent. % 145.20/19.52 | | | | | % 145.20/19.52 | | | | Case 2: % 145.20/19.52 | | | | | % 145.20/19.52 | | | | | (35) ~ (all_71_8 = n0) % 145.20/19.52 | | | | | % 145.20/19.52 | | | | | REF_CLOSE: (2), (3), (4), (6), (9), (11), (12), (13), (14), (16), % 145.20/19.52 | | | | | (17), (32), (35) are inconsistent by sub-proof #3. % 145.20/19.52 | | | | | % 145.20/19.52 | | | | End of split % 145.20/19.52 | | | | % 145.20/19.52 | | | Case 2: % 145.20/19.52 | | | | % 145.20/19.52 | | | | (36) all_71_8 = n2 % 145.20/19.52 | | | | % 145.20/19.52 | | | | REF_CLOSE: (2), (3), (9), (13), (14), (16), (17), (36) are inconsistent % 145.20/19.52 | | | | by sub-proof #2. % 145.20/19.52 | | | | % 145.20/19.52 | | | End of split % 145.20/19.52 | | | % 145.20/19.52 | | Case 2: % 145.20/19.52 | | | % 145.20/19.52 | | | % 145.20/19.52 | | | REDUCE: (16), (28) imply: % 145.20/19.52 | | | (37) a_select2(s_try7_init, n0) = all_71_7 % 145.20/19.52 | | | % 145.20/19.52 | | | REDUCE: (17), (28) imply: % 145.20/19.52 | | | (38) leq(n0, n2) % 145.20/19.52 | | | % 145.20/19.52 | | | REDUCE: (14), (28) imply: % 145.20/19.52 | | | (39) leq(n0, n0) % 145.20/19.52 | | | % 145.20/19.52 | | | GROUND_INST: instantiating (2) with n0, all_71_7, simplifying with (7), % 145.20/19.52 | | | (37), (39) gives: % 145.20/19.52 | | | (40) all_71_7 = init | ~ leq(n0, all_71_9) % 145.20/19.52 | | | % 145.20/19.52 | | | BETA: splitting (40) gives: % 145.20/19.52 | | | % 145.20/19.52 | | | Case 1: % 145.20/19.52 | | | | % 145.20/19.52 | | | | (41) ~ leq(n0, all_71_9) % 145.20/19.52 | | | | % 145.20/19.52 | | | | REDUCE: (9), (41) imply: % 145.20/19.52 | | | | (42) ~ leq(n0, n2) % 145.20/19.52 | | | | % 145.20/19.52 | | | | PRED_UNIFY: (38), (42) imply: % 145.20/19.52 | | | | (43) $false % 145.20/19.52 | | | | % 145.20/19.52 | | | | CLOSE: (43) is inconsistent. % 145.20/19.52 | | | | % 145.20/19.52 | | | Case 2: % 145.20/19.52 | | | | % 145.20/19.52 | | | | (44) all_71_7 = init % 145.20/19.52 | | | | % 145.20/19.52 | | | | REDUCE: (13), (44) imply: % 145.20/19.52 | | | | (45) $false % 145.20/19.52 | | | | % 145.20/19.52 | | | | CLOSE: (45) is inconsistent. % 145.20/19.52 | | | | % 145.20/19.52 | | | End of split % 145.20/19.52 | | | % 145.20/19.52 | | End of split % 145.20/19.52 | | % 145.20/19.52 | End of split % 145.20/19.52 | % 145.20/19.52 End of proof % 145.20/19.52 % 145.20/19.52 Sub-proof #2 shows that the following formulas are inconsistent: % 145.20/19.52 ---------------------------------------------------------------- % 145.20/19.52 (1) a_select2(s_try7_init, all_71_8) = all_71_7 % 145.20/19.52 (2) ~ (all_71_7 = init) % 145.20/19.52 (3) ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select2(s_try7_init, v0) = % 145.20/19.52 v1) | ~ $i(v0) | ~ leq(v0, all_71_9) | ~ leq(n0, v0)) % 145.20/19.52 (4) $i(all_71_8) % 145.20/19.52 (5) all_71_9 = n2 % 145.20/19.52 (6) leq(n0, all_71_8) % 145.20/19.52 (7) leq(all_71_8, n2) % 145.20/19.52 (8) all_71_8 = n2 % 145.20/19.52 % 145.20/19.52 Begin of proof % 145.20/19.52 | % 145.20/19.52 | REDUCE: (1), (8) imply: % 145.20/19.52 | (9) a_select2(s_try7_init, n2) = all_71_7 % 145.20/19.52 | % 145.20/19.52 | REDUCE: (4), (8) imply: % 145.20/19.52 | (10) $i(n2) % 145.20/19.52 | % 145.20/19.52 | REDUCE: (7), (8) imply: % 145.20/19.52 | (11) leq(n2, n2) % 145.20/19.52 | % 145.20/19.52 | REDUCE: (6), (8) imply: % 145.20/19.52 | (12) leq(n0, n2) % 145.20/19.52 | % 145.20/19.52 | GROUND_INST: instantiating (3) with n2, all_71_7, simplifying with (9), (10), % 145.20/19.52 | (12) gives: % 145.20/19.52 | (13) all_71_7 = init | ~ leq(n2, all_71_9) % 145.20/19.52 | % 145.20/19.52 | BETA: splitting (13) gives: % 145.20/19.52 | % 145.20/19.52 | Case 1: % 145.20/19.52 | | % 145.20/19.52 | | (14) ~ leq(n2, all_71_9) % 145.20/19.52 | | % 145.20/19.52 | | REDUCE: (5), (14) imply: % 145.20/19.52 | | (15) ~ leq(n2, n2) % 145.20/19.52 | | % 145.20/19.52 | | PRED_UNIFY: (11), (15) imply: % 145.20/19.52 | | (16) $false % 145.20/19.52 | | % 145.20/19.52 | | CLOSE: (16) is inconsistent. % 145.20/19.52 | | % 145.20/19.52 | Case 2: % 145.20/19.52 | | % 145.20/19.52 | | (17) all_71_7 = init % 145.20/19.52 | | % 145.20/19.52 | | REDUCE: (2), (17) imply: % 145.20/19.52 | | (18) $false % 145.20/19.52 | | % 145.20/19.52 | | CLOSE: (18) is inconsistent. % 145.20/19.52 | | % 145.20/19.52 | End of split % 145.20/19.52 | % 145.20/19.52 End of proof % 145.20/19.52 % 145.20/19.52 Sub-proof #3 shows that the following formulas are inconsistent: % 145.20/19.52 ---------------------------------------------------------------- % 145.20/19.52 (1) a_select2(s_try7_init, all_71_8) = all_71_7 % 145.20/19.52 (2) ~ (all_71_7 = init) % 145.20/19.53 (3) ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select2(s_try7_init, v0) = % 145.20/19.53 v1) | ~ $i(v0) | ~ leq(v0, all_71_9) | ~ leq(n0, v0)) % 145.20/19.53 (4) $i(all_71_8) % 145.20/19.53 (5) $i(n2) % 145.20/19.53 (6) ! [v0: $i] : (v0 = n1 | v0 = n0 | ~ $i(v0) | ~ leq(v0, n1) | ~ % 145.20/19.53 leq(n0, v0)) % 145.20/19.53 (7) all_71_9 = n2 % 145.20/19.53 (8) leq(n0, all_71_8) % 145.20/19.53 (9) leq(all_71_8, n2) % 145.20/19.53 (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (pred(v1) = v2) | ~ % 145.20/19.53 $i(v1) | ~ $i(v0) | ~ gt(v1, v0) | leq(v0, v2)) % 145.20/19.53 (11) gt(n2, all_71_8) % 145.20/19.53 (12) ~ (all_71_8 = n0) % 145.20/19.53 (13) pred(n2) = n1 % 145.20/19.53 % 145.20/19.53 Begin of proof % 145.20/19.53 | % 145.20/19.53 | GROUND_INST: instantiating (10) with all_71_8, n2, n1, simplifying with (4), % 145.20/19.53 | (5), (11), (13) gives: % 145.20/19.53 | (14) leq(all_71_8, n1) % 145.20/19.53 | % 145.20/19.53 | GROUND_INST: instantiating (6) with all_71_8, simplifying with (4), (8), (14) % 145.20/19.53 | gives: % 145.20/19.53 | (15) all_71_8 = n1 | all_71_8 = n0 % 145.20/19.53 | % 145.20/19.53 | BETA: splitting (15) gives: % 145.20/19.53 | % 145.20/19.53 | Case 1: % 145.20/19.53 | | % 145.20/19.53 | | (16) all_71_8 = n0 % 145.20/19.53 | | % 145.20/19.53 | | REDUCE: (12), (16) imply: % 145.20/19.53 | | (17) $false % 145.20/19.53 | | % 145.20/19.53 | | CLOSE: (17) is inconsistent. % 145.20/19.53 | | % 145.20/19.53 | Case 2: % 145.20/19.53 | | % 145.20/19.53 | | (18) all_71_8 = n1 % 145.20/19.53 | | % 145.20/19.53 | | REDUCE: (1), (18) imply: % 145.20/19.53 | | (19) a_select2(s_try7_init, n1) = all_71_7 % 145.20/19.53 | | % 145.20/19.53 | | REDUCE: (4), (18) imply: % 145.20/19.53 | | (20) $i(n1) % 145.20/19.53 | | % 145.20/19.53 | | REDUCE: (9), (18) imply: % 145.20/19.53 | | (21) leq(n1, n2) % 145.20/19.53 | | % 145.20/19.53 | | REDUCE: (8), (18) imply: % 145.20/19.53 | | (22) leq(n0, n1) % 145.20/19.53 | | % 145.20/19.53 | | GROUND_INST: instantiating (3) with n1, all_71_7, simplifying with (19), % 145.20/19.53 | | (20), (22) gives: % 145.20/19.53 | | (23) all_71_7 = init | ~ leq(n1, all_71_9) % 145.20/19.53 | | % 145.20/19.53 | | BETA: splitting (23) gives: % 145.20/19.53 | | % 145.20/19.53 | | Case 1: % 145.20/19.53 | | | % 145.20/19.53 | | | (24) ~ leq(n1, all_71_9) % 145.20/19.53 | | | % 145.20/19.53 | | | REDUCE: (7), (24) imply: % 145.20/19.53 | | | (25) ~ leq(n1, n2) % 145.20/19.53 | | | % 145.20/19.53 | | | PRED_UNIFY: (21), (25) imply: % 145.20/19.53 | | | (26) $false % 145.20/19.53 | | | % 145.20/19.53 | | | CLOSE: (26) is inconsistent. % 145.20/19.53 | | | % 145.20/19.53 | | Case 2: % 145.20/19.53 | | | % 145.20/19.53 | | | (27) all_71_7 = init % 145.20/19.53 | | | % 145.20/19.53 | | | REDUCE: (2), (27) imply: % 145.20/19.53 | | | (28) $false % 145.20/19.53 | | | % 145.20/19.53 | | | CLOSE: (28) is inconsistent. % 145.20/19.53 | | | % 145.20/19.53 | | End of split % 145.20/19.53 | | % 145.20/19.53 | End of split % 145.20/19.53 | % 145.20/19.53 End of proof % 145.20/19.53 % SZS output end Proof for theBenchmark % 145.20/19.53 % 145.20/19.53 18912ms %------------------------------------------------------------------------------