TSTP Solution File: SWW815_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWW815_1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 00:51:27 EDT 2023
% Result : Unsatisfiable 32.81s 5.47s
% Output : Proof 47.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.18 % Problem : SWW815_1 : TPTP v8.1.2. Released v7.0.0.
% 0.15/0.19 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.15/0.38 % Computer : n016.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sun Aug 27 21:07:29 EDT 2023
% 0.15/0.39 % CPUTime :
% 0.20/0.60 ________ _____
% 0.20/0.60 ___ __ \_________(_)________________________________
% 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.60
% 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.60 (2023-06-19)
% 0.20/0.60
% 0.20/0.60 (c) Philipp Rümmer, 2009-2023
% 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.60 Amanda Stjerna.
% 0.20/0.60 Free software under BSD-3-Clause.
% 0.20/0.60
% 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.60
% 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.52/0.95 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.52/0.95 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.52/0.96 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.52/0.96 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.52/0.96 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.52/0.96 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.83/0.97 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 9.71/2.10 Prover 5: Preprocessing ...
% 9.71/2.10 Prover 3: Preprocessing ...
% 9.71/2.10 Prover 2: Preprocessing ...
% 9.71/2.11 Prover 4: Preprocessing ...
% 9.71/2.11 Prover 6: Preprocessing ...
% 9.71/2.11 Prover 0: Preprocessing ...
% 9.71/2.13 Prover 1: Preprocessing ...
% 27.32/4.71 Prover 1: Warning: ignoring some quantifiers
% 27.32/4.74 Prover 4: Warning: ignoring some quantifiers
% 29.12/4.77 Prover 3: Warning: ignoring some quantifiers
% 29.68/4.83 Prover 3: Constructing countermodel ...
% 29.68/4.85 Prover 1: Constructing countermodel ...
% 29.68/4.86 Prover 4: Constructing countermodel ...
% 31.36/5.06 Prover 6: Proving ...
% 31.36/5.07 Prover 0: Proving ...
% 32.81/5.45 Prover 0: proved (4829ms)
% 32.81/5.46
% 32.81/5.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.81/5.47
% 32.81/5.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 32.81/5.49 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 33.40/5.49 Prover 3: stopped
% 33.40/5.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 33.40/5.51 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 33.40/5.51 Prover 6: stopped
% 33.40/5.52 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 33.40/5.52 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation
% 37.34/5.91 Prover 5: Proving ...
% 37.34/5.91 Prover 5: stopped
% 37.34/5.91 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 37.75/5.93 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation
% 38.00/6.27 Prover 8: Preprocessing ...
% 39.03/6.28 Prover 7: Preprocessing ...
% 41.02/6.41 Prover 10: Preprocessing ...
% 42.05/6.52 Prover 11: Preprocessing ...
% 42.86/6.68 Prover 2: Proving ...
% 42.86/6.68 Prover 2: stopped
% 43.35/6.73 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 43.35/6.74 Prover 13: Warning: Problem contains reals, using incomplete axiomatisation
% 43.35/6.75 Prover 4: Found proof (size 15)
% 43.35/6.76 Prover 4: proved (6133ms)
% 43.35/6.76 Prover 1: stopped
% 43.35/6.76 Prover 10: stopped
% 43.95/6.76 Prover 11: stopped
% 45.13/7.00 Prover 13: Preprocessing ...
% 45.97/7.11 Prover 8: Warning: ignoring some quantifiers
% 45.97/7.12 Prover 7: Warning: ignoring some quantifiers
% 46.39/7.18 Prover 8: Constructing countermodel ...
% 46.39/7.19 Prover 7: Constructing countermodel ...
% 46.39/7.20 Prover 8: stopped
% 46.74/7.23 Prover 7: stopped
% 46.94/7.29 Prover 13: stopped
% 46.94/7.29
% 46.94/7.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.94/7.29
% 46.94/7.30 % SZS output start Proof for theBenchmark
% 46.94/7.31 Assumptions after simplification:
% 46.94/7.31 ---------------------------------
% 46.94/7.31
% 46.94/7.31 (formula_101)
% 47.33/7.35 c_type(type_global) & c_type(c_int) & c_type(type_alloc_table) & ? [v0:
% 47.33/7.35 c_type] : ? [v1: c_type] : ? [v2: c_unique] : ? [v3: c_unique] : ? [v4:
% 47.33/7.35 c_ssorted] : ? [v5: c_ssorted] : ? [v6: c_unique] : ? [v7: c_ssorted] :
% 47.33/7.35 ? [v8: int] : ? [v9: int] : ? [v10: int] : ? [v11: c_unique] : ? [v12:
% 47.33/7.35 c_ssorted] : ? [v13: c_unique] : ($lesseq(v9, v8) & $lesseq(1, v9) &
% 47.33/7.35 $lesseq(v8, 2800) & %(v8, 14) = 0 & type_memory(c_int, type_global) = v1 &
% 47.33/7.35 valid_range(v4, v5, 0, 2800) = 0 & type_pointer(type_global) = v0 &
% 47.33/7.36 c_sort(v1, v11) = v12 & c_sort(v1, v6) = v7 & c_sort(v0, v3) = v5 &
% 47.33/7.36 c_sort(type_alloc_table, v2) = v4 & c_unique(v13) & c_unique(v11) &
% 47.33/7.36 c_unique(v6) & c_unique(v3) & c_unique(v2) & c_type(v1) & c_type(v0) &
% 47.33/7.36 c_ssorted(v12) & c_ssorted(v7) & c_ssorted(v5) & c_ssorted(v4) & ! [v14:
% 47.33/7.36 c_ssorted] : ( ~ (c_sort(v0, v13) = v14) | ? [v15: c_unique] : ? [v16:
% 47.33/7.36 c_ssorted] : ? [v17: int] : ? [v18: int] : ? [v19: int] : ? [v20:
% 47.33/7.36 c_unique] : ? [v21: c_ssorted] : ? [v22: c_unique] : ? [v23: int] :
% 47.33/7.36 ? [v24: int] : (v9 = 1 & $lesseq(v8, 13) & whydivide(v19, 10000) = v23 &
% 47.33/7.36 whydivide($sum($product(10000, v17), v10), 1) = v19 & %(v19, 10000) =
% 47.33/7.36 v24 & %($sum($product(10000, v17), v10), 1) = v18 & upd(v12, v14, v21) =
% 47.33/7.36 v22 & acc(v12, v14) = v15 & shift(v5, 1) = v13 & valid(v4, v14) = 0 &
% 47.33/7.36 int2U(v18) = v20 & ss2Int(v16) = v17 & c_sort(c_int, v20) = v21 &
% 47.33/7.36 c_sort(c_int, v15) = v16 & c_unique(v22) & c_unique(v20) & c_unique(v15)
% 47.33/7.36 & c_ssorted(v21) & c_ssorted(v16))) & ? [v14: c_ssorted] : ? [v15:
% 47.33/7.36 c_unique] : ? [v16: c_ssorted] : ? [v17: int] : ? [v18: int] : ? [v19:
% 47.33/7.36 int] : ? [v20: c_unique] : ? [v21: c_ssorted] : ? [v22: c_unique] : ?
% 47.33/7.36 [v23: int] : ? [v24: int] : (v9 = 1 & $lesseq(v8, 13) & whydivide(v19,
% 47.33/7.36 10000) = v23 & whydivide($sum($product(10000, v17), v10), 1) = v19 &
% 47.33/7.36 %(v19, 10000) = v24 & %($sum($product(10000, v17), v10), 1) = v18 &
% 47.33/7.36 upd(v12, v14, v21) = v22 & acc(v12, v14) = v15 & shift(v5, 1) = v13 &
% 47.33/7.36 valid(v4, v14) = 0 & int2U(v18) = v20 & ss2Int(v16) = v17 & c_sort(v0,
% 47.33/7.36 v13) = v14 & c_sort(c_int, v20) = v21 & c_sort(c_int, v15) = v16 &
% 47.33/7.36 c_unique(v22) & c_unique(v20) & c_unique(v15) & c_ssorted(v21) &
% 47.33/7.36 c_ssorted(v16) & c_ssorted(v14)) & ? [v14: int] : ? [v15: c_unique] : ?
% 47.33/7.36 [v16: c_ssorted] : ? [v17: c_unique] : ? [v18: c_ssorted] : ? [v19: int]
% 47.33/7.36 : (acc(v7, v16) = v17 & shift(v5, v14) = v15 & ss2Int(v18) = v19 &
% 47.33/7.36 c_sort(v0, v15) = v16 & c_sort(c_int, v17) = v18 & c_unique(v17) &
% 47.33/7.36 c_unique(v15) & c_ssorted(v18) & c_ssorted(v16) & (v19 = 2000 | ~
% 47.33/7.36 ($lesseq(v14, 2799)) | ~ ($lesseq(0, v14)))))
% 47.33/7.36
% 47.33/7.36 (formula_99)
% 47.33/7.36 ! [v0: int] : ( ~ ($lesseq(v0, 13)) | ~ ($lesseq(1, v0)) | ~ (%(v0, 14) =
% 47.33/7.36 0))
% 47.33/7.36
% 47.33/7.36 Further assumptions not needed in the proof:
% 47.33/7.36 --------------------------------------------
% 47.33/7.36 formula_1, formula_10, formula_100, formula_11, formula_12, formula_13,
% 47.33/7.36 formula_14, formula_15, formula_16, formula_17, formula_18, formula_19,
% 47.33/7.36 formula_2, formula_20, formula_21, formula_22, formula_23, formula_24,
% 47.33/7.36 formula_25, formula_26, formula_27, formula_28, formula_29, formula_3,
% 47.33/7.36 formula_30, formula_31, formula_32, formula_33, formula_34, formula_35,
% 47.33/7.36 formula_36, formula_37, formula_38, formula_39, formula_4, formula_40,
% 47.33/7.36 formula_41, formula_42, formula_43, formula_44, formula_45, formula_46,
% 47.33/7.36 formula_47, formula_48, formula_49, formula_5, formula_50, formula_51,
% 47.33/7.36 formula_52, formula_53, formula_54, formula_55, formula_56, formula_57,
% 47.33/7.36 formula_58, formula_59, formula_6, formula_60, formula_61, formula_62,
% 47.33/7.36 formula_63, formula_64, formula_65, formula_66, formula_67, formula_68,
% 47.33/7.36 formula_69, formula_7, formula_70, formula_71, formula_72, formula_73,
% 47.33/7.36 formula_74, formula_75, formula_76, formula_77, formula_78, formula_79,
% 47.33/7.36 formula_8, formula_80, formula_81, formula_82, formula_83, formula_84,
% 47.33/7.36 formula_85, formula_86, formula_87, formula_88, formula_89, formula_9,
% 47.33/7.36 formula_90, formula_91, formula_92, formula_93, formula_94, formula_95,
% 47.33/7.36 formula_96, formula_97, formula_98
% 47.33/7.36
% 47.33/7.36 Those formulas are unsatisfiable:
% 47.33/7.36 ---------------------------------
% 47.33/7.36
% 47.33/7.36 Begin of proof
% 47.33/7.37 |
% 47.33/7.37 | ALPHA: (formula_101) implies:
% 47.54/7.38 | (1) ? [v0: c_type] : ? [v1: c_type] : ? [v2: c_unique] : ? [v3:
% 47.54/7.38 | c_unique] : ? [v4: c_ssorted] : ? [v5: c_ssorted] : ? [v6:
% 47.54/7.38 | c_unique] : ? [v7: c_ssorted] : ? [v8: int] : ? [v9: int] : ?
% 47.54/7.38 | [v10: int] : ? [v11: c_unique] : ? [v12: c_ssorted] : ? [v13:
% 47.54/7.38 | c_unique] : ($lesseq(v9, v8) & $lesseq(1, v9) & $lesseq(v8, 2800) &
% 47.54/7.38 | %(v8, 14) = 0 & type_memory(c_int, type_global) = v1 &
% 47.54/7.38 | valid_range(v4, v5, 0, 2800) = 0 & type_pointer(type_global) = v0 &
% 47.54/7.38 | c_sort(v1, v11) = v12 & c_sort(v1, v6) = v7 & c_sort(v0, v3) = v5 &
% 47.54/7.38 | c_sort(type_alloc_table, v2) = v4 & c_unique(v13) & c_unique(v11) &
% 47.54/7.38 | c_unique(v6) & c_unique(v3) & c_unique(v2) & c_type(v1) & c_type(v0)
% 47.54/7.38 | & c_ssorted(v12) & c_ssorted(v7) & c_ssorted(v5) & c_ssorted(v4) & !
% 47.54/7.38 | [v14: c_ssorted] : ( ~ (c_sort(v0, v13) = v14) | ? [v15: c_unique] :
% 47.54/7.38 | ? [v16: c_ssorted] : ? [v17: int] : ? [v18: int] : ? [v19: int]
% 47.54/7.38 | : ? [v20: c_unique] : ? [v21: c_ssorted] : ? [v22: c_unique] :
% 47.54/7.38 | ? [v23: int] : ? [v24: int] : (v9 = 1 & $lesseq(v8, 13) &
% 47.54/7.38 | whydivide(v19, 10000) = v23 & whydivide($sum($product(10000,
% 47.54/7.38 | v17), v10), 1) = v19 & %(v19, 10000) = v24 &
% 47.54/7.38 | %($sum($product(10000, v17), v10), 1) = v18 & upd(v12, v14, v21)
% 47.54/7.38 | = v22 & acc(v12, v14) = v15 & shift(v5, 1) = v13 & valid(v4, v14)
% 47.54/7.39 | = 0 & int2U(v18) = v20 & ss2Int(v16) = v17 & c_sort(c_int, v20) =
% 47.54/7.39 | v21 & c_sort(c_int, v15) = v16 & c_unique(v22) & c_unique(v20) &
% 47.54/7.39 | c_unique(v15) & c_ssorted(v21) & c_ssorted(v16))) & ? [v14:
% 47.54/7.39 | c_ssorted] : ? [v15: c_unique] : ? [v16: c_ssorted] : ? [v17:
% 47.54/7.39 | int] : ? [v18: int] : ? [v19: int] : ? [v20: c_unique] : ?
% 47.54/7.39 | [v21: c_ssorted] : ? [v22: c_unique] : ? [v23: int] : ? [v24: int]
% 47.54/7.39 | : (v9 = 1 & $lesseq(v8, 13) & whydivide(v19, 10000) = v23 &
% 47.54/7.39 | whydivide($sum($product(10000, v17), v10), 1) = v19 & %(v19, 10000)
% 47.54/7.39 | = v24 & %($sum($product(10000, v17), v10), 1) = v18 & upd(v12, v14,
% 47.54/7.39 | v21) = v22 & acc(v12, v14) = v15 & shift(v5, 1) = v13 & valid(v4,
% 47.54/7.39 | v14) = 0 & int2U(v18) = v20 & ss2Int(v16) = v17 & c_sort(v0, v13)
% 47.54/7.39 | = v14 & c_sort(c_int, v20) = v21 & c_sort(c_int, v15) = v16 &
% 47.54/7.39 | c_unique(v22) & c_unique(v20) & c_unique(v15) & c_ssorted(v21) &
% 47.54/7.39 | c_ssorted(v16) & c_ssorted(v14)) & ? [v14: int] : ? [v15:
% 47.54/7.39 | c_unique] : ? [v16: c_ssorted] : ? [v17: c_unique] : ? [v18:
% 47.54/7.39 | c_ssorted] : ? [v19: int] : (acc(v7, v16) = v17 & shift(v5, v14) =
% 47.54/7.39 | v15 & ss2Int(v18) = v19 & c_sort(v0, v15) = v16 & c_sort(c_int,
% 47.54/7.39 | v17) = v18 & c_unique(v17) & c_unique(v15) & c_ssorted(v18) &
% 47.54/7.39 | c_ssorted(v16) & (v19 = 2000 | ~ ($lesseq(v14, 2799)) | ~
% 47.54/7.39 | ($lesseq(0, v14)))))
% 47.54/7.39 |
% 47.54/7.39 | DELTA: instantiating (1) with fresh symbols all_190_0, all_190_1, all_190_2,
% 47.54/7.39 | all_190_3, all_190_4, all_190_5, all_190_6, all_190_7, all_190_8,
% 47.54/7.39 | all_190_9, all_190_10, all_190_11, all_190_12, all_190_13 gives:
% 47.54/7.40 | (2) $lesseq(all_190_4, all_190_5) & $lesseq(1, all_190_4) &
% 47.54/7.40 | $lesseq(all_190_5, 2800) & %(all_190_5, 14) = 0 & type_memory(c_int,
% 47.54/7.40 | type_global) = all_190_12 & valid_range(all_190_9, all_190_8, 0,
% 47.54/7.40 | 2800) = 0 & type_pointer(type_global) = all_190_13 &
% 47.54/7.40 | c_sort(all_190_12, all_190_2) = all_190_1 & c_sort(all_190_12,
% 47.54/7.40 | all_190_7) = all_190_6 & c_sort(all_190_13, all_190_10) = all_190_8 &
% 47.54/7.40 | c_sort(type_alloc_table, all_190_11) = all_190_9 & c_unique(all_190_0)
% 47.54/7.40 | & c_unique(all_190_2) & c_unique(all_190_7) & c_unique(all_190_10) &
% 47.54/7.40 | c_unique(all_190_11) & c_type(all_190_12) & c_type(all_190_13) &
% 47.54/7.40 | c_ssorted(all_190_1) & c_ssorted(all_190_6) & c_ssorted(all_190_8) &
% 47.54/7.40 | c_ssorted(all_190_9) & ! [v0: c_ssorted] : ( ~ (c_sort(all_190_13,
% 47.54/7.40 | all_190_0) = v0) | ? [v1: c_unique] : ? [v2: c_ssorted] : ?
% 47.54/7.40 | [v3: int] : ? [v4: int] : ? [v5: int] : ? [v6: c_unique] : ? [v7:
% 47.54/7.40 | c_ssorted] : ? [v8: c_unique] : ? [v9: int] : ? [v10: int] :
% 47.54/7.40 | (all_190_4 = 1 & $lesseq(all_190_5, 13) & whydivide(v5, 10000) = v9 &
% 47.54/7.40 | whydivide($sum($product(10000, v3), all_190_3), 1) = v5 & %(v5,
% 47.54/7.40 | 10000) = v10 & %($sum($product(10000, v3), all_190_3), 1) = v4 &
% 47.54/7.40 | upd(all_190_1, v0, v7) = v8 & acc(all_190_1, v0) = v1 &
% 47.54/7.40 | shift(all_190_8, 1) = all_190_0 & valid(all_190_9, v0) = 0 &
% 47.54/7.40 | int2U(v4) = v6 & ss2Int(v2) = v3 & c_sort(c_int, v6) = v7 &
% 47.54/7.40 | c_sort(c_int, v1) = v2 & c_unique(v8) & c_unique(v6) & c_unique(v1)
% 47.54/7.40 | & c_ssorted(v7) & c_ssorted(v2))) & ? [v0: c_ssorted] : ? [v1:
% 47.54/7.40 | c_unique] : ? [v2: c_ssorted] : ? [v3: int] : ? [v4: int] : ?
% 47.54/7.40 | [v5: int] : ? [v6: c_unique] : ? [v7: c_ssorted] : ? [v8: c_unique]
% 47.54/7.40 | : ? [v9: int] : ? [v10: int] : (all_190_4 = 1 & $lesseq(all_190_5,
% 47.54/7.40 | 13) & whydivide(v5, 10000) = v9 & whydivide($sum($product(10000,
% 47.54/7.40 | v3), all_190_3), 1) = v5 & %(v5, 10000) = v10 &
% 47.54/7.40 | %($sum($product(10000, v3), all_190_3), 1) = v4 & upd(all_190_1, v0,
% 47.54/7.40 | v7) = v8 & acc(all_190_1, v0) = v1 & shift(all_190_8, 1) =
% 47.54/7.40 | all_190_0 & valid(all_190_9, v0) = 0 & int2U(v4) = v6 & ss2Int(v2) =
% 47.54/7.40 | v3 & c_sort(all_190_13, all_190_0) = v0 & c_sort(c_int, v6) = v7 &
% 47.54/7.40 | c_sort(c_int, v1) = v2 & c_unique(v8) & c_unique(v6) & c_unique(v1) &
% 47.54/7.40 | c_ssorted(v7) & c_ssorted(v2) & c_ssorted(v0)) & ? [v0: int] : ?
% 47.54/7.40 | [v1: c_unique] : ? [v2: c_ssorted] : ? [v3: c_unique] : ? [v4:
% 47.54/7.40 | c_ssorted] : ? [v5: int] : (acc(all_190_6, v2) = v3 &
% 47.54/7.40 | shift(all_190_8, v0) = v1 & ss2Int(v4) = v5 & c_sort(all_190_13, v1)
% 47.54/7.40 | = v2 & c_sort(c_int, v3) = v4 & c_unique(v3) & c_unique(v1) &
% 47.54/7.40 | c_ssorted(v4) & c_ssorted(v2) & (v5 = 2000 | ~ ($lesseq(v0, 2799)) |
% 47.54/7.40 | ~ ($lesseq(0, v0))))
% 47.54/7.40 |
% 47.54/7.40 | ALPHA: (2) implies:
% 47.54/7.40 | (3) $lesseq(all_190_4, all_190_5)
% 47.54/7.40 | (4) %(all_190_5, 14) = 0
% 47.54/7.41 | (5) ! [v0: c_ssorted] : ( ~ (c_sort(all_190_13, all_190_0) = v0) | ? [v1:
% 47.54/7.41 | c_unique] : ? [v2: c_ssorted] : ? [v3: int] : ? [v4: int] : ?
% 47.54/7.41 | [v5: int] : ? [v6: c_unique] : ? [v7: c_ssorted] : ? [v8:
% 47.54/7.41 | c_unique] : ? [v9: int] : ? [v10: int] : (all_190_4 = 1 &
% 47.54/7.41 | $lesseq(all_190_5, 13) & whydivide(v5, 10000) = v9 &
% 47.54/7.41 | whydivide($sum($product(10000, v3), all_190_3), 1) = v5 & %(v5,
% 47.54/7.41 | 10000) = v10 & %($sum($product(10000, v3), all_190_3), 1) = v4 &
% 47.54/7.41 | upd(all_190_1, v0, v7) = v8 & acc(all_190_1, v0) = v1 &
% 47.54/7.41 | shift(all_190_8, 1) = all_190_0 & valid(all_190_9, v0) = 0 &
% 47.54/7.41 | int2U(v4) = v6 & ss2Int(v2) = v3 & c_sort(c_int, v6) = v7 &
% 47.54/7.41 | c_sort(c_int, v1) = v2 & c_unique(v8) & c_unique(v6) & c_unique(v1)
% 47.54/7.41 | & c_ssorted(v7) & c_ssorted(v2)))
% 47.54/7.41 | (6) ? [v0: c_ssorted] : ? [v1: c_unique] : ? [v2: c_ssorted] : ? [v3:
% 47.54/7.41 | int] : ? [v4: int] : ? [v5: int] : ? [v6: c_unique] : ? [v7:
% 47.54/7.41 | c_ssorted] : ? [v8: c_unique] : ? [v9: int] : ? [v10: int] :
% 47.54/7.41 | (all_190_4 = 1 & $lesseq(all_190_5, 13) & whydivide(v5, 10000) = v9 &
% 47.54/7.41 | whydivide($sum($product(10000, v3), all_190_3), 1) = v5 & %(v5,
% 47.54/7.41 | 10000) = v10 & %($sum($product(10000, v3), all_190_3), 1) = v4 &
% 47.54/7.41 | upd(all_190_1, v0, v7) = v8 & acc(all_190_1, v0) = v1 &
% 47.54/7.41 | shift(all_190_8, 1) = all_190_0 & valid(all_190_9, v0) = 0 &
% 47.54/7.41 | int2U(v4) = v6 & ss2Int(v2) = v3 & c_sort(all_190_13, all_190_0) = v0
% 47.54/7.41 | & c_sort(c_int, v6) = v7 & c_sort(c_int, v1) = v2 & c_unique(v8) &
% 47.54/7.41 | c_unique(v6) & c_unique(v1) & c_ssorted(v7) & c_ssorted(v2) &
% 47.54/7.41 | c_ssorted(v0))
% 47.54/7.41 |
% 47.54/7.41 | DELTA: instantiating (6) with fresh symbols all_200_0, all_200_1, all_200_2,
% 47.54/7.41 | all_200_3, all_200_4, all_200_5, all_200_6, all_200_7, all_200_8,
% 47.54/7.41 | all_200_9, all_200_10 gives:
% 47.54/7.41 | (7) all_190_4 = 1 & $lesseq(all_190_5, 13) & whydivide(all_200_5, 10000) =
% 47.54/7.41 | all_200_1 & whydivide($sum($product(10000, all_200_7), all_190_3), 1) =
% 47.54/7.41 | all_200_5 & %(all_200_5, 10000) = all_200_0 & %($sum($product(10000,
% 47.54/7.41 | all_200_7), all_190_3), 1) = all_200_6 & upd(all_190_1,
% 47.54/7.41 | all_200_10, all_200_3) = all_200_2 & acc(all_190_1, all_200_10) =
% 47.54/7.41 | all_200_9 & shift(all_190_8, 1) = all_190_0 & valid(all_190_9,
% 47.54/7.41 | all_200_10) = 0 & int2U(all_200_6) = all_200_4 & ss2Int(all_200_8) =
% 47.54/7.41 | all_200_7 & c_sort(all_190_13, all_190_0) = all_200_10 & c_sort(c_int,
% 47.54/7.41 | all_200_4) = all_200_3 & c_sort(c_int, all_200_9) = all_200_8 &
% 47.54/7.41 | c_unique(all_200_2) & c_unique(all_200_4) & c_unique(all_200_9) &
% 47.54/7.41 | c_ssorted(all_200_3) & c_ssorted(all_200_8) & c_ssorted(all_200_10)
% 47.54/7.41 |
% 47.54/7.41 | ALPHA: (7) implies:
% 47.54/7.42 | (8) all_190_4 = 1
% 47.54/7.42 | (9) c_sort(all_190_13, all_190_0) = all_200_10
% 47.54/7.42 |
% 47.54/7.42 | REDUCE: (3), (8) imply:
% 47.54/7.42 | (10) $lesseq(1, all_190_5)
% 47.54/7.42 |
% 47.54/7.42 | GROUND_INST: instantiating (formula_99) with all_190_5, simplifying with (4)
% 47.54/7.42 | gives:
% 47.54/7.42 | (11) ~ ($lesseq(all_190_5, 13)) | ~ ($lesseq(1, all_190_5))
% 47.54/7.42 |
% 47.54/7.42 | GROUND_INST: instantiating (5) with all_200_10, simplifying with (9) gives:
% 47.54/7.42 | (12) ? [v0: c_unique] : ? [v1: c_ssorted] : ? [v2: int] : ? [v3: int] :
% 47.54/7.42 | ? [v4: int] : ? [v5: c_unique] : ? [v6: c_ssorted] : ? [v7:
% 47.54/7.42 | c_unique] : ? [v8: int] : ? [v9: int] : (all_190_4 = 1 &
% 47.54/7.42 | $lesseq(all_190_5, 13) & whydivide(v4, 10000) = v8 &
% 47.54/7.42 | whydivide($sum($product(10000, v2), all_190_3), 1) = v4 & %(v4,
% 47.54/7.42 | 10000) = v9 & %($sum($product(10000, v2), all_190_3), 1) = v3 &
% 47.54/7.42 | upd(all_190_1, all_200_10, v6) = v7 & acc(all_190_1, all_200_10) =
% 47.54/7.42 | v0 & shift(all_190_8, 1) = all_190_0 & valid(all_190_9, all_200_10)
% 47.54/7.42 | = 0 & int2U(v3) = v5 & ss2Int(v1) = v2 & c_sort(c_int, v5) = v6 &
% 47.54/7.42 | c_sort(c_int, v0) = v1 & c_unique(v7) & c_unique(v5) & c_unique(v0)
% 47.54/7.42 | & c_ssorted(v6) & c_ssorted(v1))
% 47.54/7.42 |
% 47.54/7.42 | DELTA: instantiating (12) with fresh symbols all_294_0, all_294_1, all_294_2,
% 47.54/7.42 | all_294_3, all_294_4, all_294_5, all_294_6, all_294_7, all_294_8,
% 47.54/7.42 | all_294_9 gives:
% 47.54/7.42 | (13) all_190_4 = 1 & $lesseq(all_190_5, 13) & whydivide(all_294_5, 10000) =
% 47.54/7.42 | all_294_1 & whydivide($sum($product(10000, all_294_7), all_190_3), 1)
% 47.54/7.42 | = all_294_5 & %(all_294_5, 10000) = all_294_0 & %($sum($product(10000,
% 47.54/7.42 | all_294_7), all_190_3), 1) = all_294_6 & upd(all_190_1,
% 47.54/7.42 | all_200_10, all_294_3) = all_294_2 & acc(all_190_1, all_200_10) =
% 47.54/7.42 | all_294_9 & shift(all_190_8, 1) = all_190_0 & valid(all_190_9,
% 47.54/7.42 | all_200_10) = 0 & int2U(all_294_6) = all_294_4 & ss2Int(all_294_8) =
% 47.54/7.42 | all_294_7 & c_sort(c_int, all_294_4) = all_294_3 & c_sort(c_int,
% 47.54/7.42 | all_294_9) = all_294_8 & c_unique(all_294_2) & c_unique(all_294_4) &
% 47.54/7.42 | c_unique(all_294_9) & c_ssorted(all_294_3) & c_ssorted(all_294_8)
% 47.54/7.43 |
% 47.54/7.43 | ALPHA: (13) implies:
% 47.54/7.43 | (14) $lesseq(all_190_5, 13)
% 47.54/7.43 |
% 47.54/7.43 | BETA: splitting (11) gives:
% 47.54/7.43 |
% 47.54/7.43 | Case 1:
% 47.54/7.43 | |
% 47.54/7.43 | | (15) $lesseq(14, all_190_5)
% 47.54/7.43 | |
% 47.54/7.43 | | COMBINE_INEQS: (14), (15) imply:
% 47.54/7.43 | | (16) $false
% 47.54/7.43 | |
% 47.54/7.43 | | CLOSE: (16) is inconsistent.
% 47.54/7.43 | |
% 47.54/7.43 | Case 2:
% 47.54/7.43 | |
% 47.54/7.43 | | (17) $lesseq(all_190_5, 0)
% 47.54/7.43 | |
% 47.54/7.43 | | COMBINE_INEQS: (10), (17) imply:
% 47.54/7.43 | | (18) $false
% 47.54/7.43 | |
% 47.54/7.43 | | CLOSE: (18) is inconsistent.
% 47.54/7.43 | |
% 47.54/7.43 | End of split
% 47.54/7.43 |
% 47.54/7.43 End of proof
% 47.54/7.43 % SZS output end Proof for theBenchmark
% 47.54/7.43
% 47.54/7.43 6829ms
%------------------------------------------------------------------------------