%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW806_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 : n015.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:25 EDT 2023 % Result : Unsatisfiable 31.52s 4.93s % Output : Proof 40.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SWW806_1 : TPTP v8.1.2. Released v7.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n015.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Aug 27 21:46:39 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.56 ________ _____ % 0.20/0.56 ___ __ \_________(_)________________________________ % 0.20/0.56 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.56 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.56 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.56 % 0.20/0.56 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.56 (2023-06-19) % 0.20/0.56 % 0.20/0.56 (c) Philipp Rümmer, 2009-2023 % 0.20/0.56 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.56 Amanda Stjerna. % 0.20/0.56 Free software under BSD-3-Clause. % 0.20/0.56 % 0.20/0.56 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.56 % 0.20/0.56 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.57 Running up to 7 provers in parallel. % 0.20/0.59 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.59 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.59 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.59 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.59 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.59 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.59 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 10.05/2.09 Prover 1: Preprocessing ... % 10.05/2.11 Prover 4: Preprocessing ... % 10.05/2.11 Prover 3: Preprocessing ... % 10.05/2.11 Prover 2: Preprocessing ... % 10.05/2.11 Prover 6: Preprocessing ... % 10.05/2.11 Prover 0: Preprocessing ... % 10.05/2.12 Prover 5: Preprocessing ... % 24.26/3.95 Prover 3: Warning: ignoring some quantifiers % 24.26/3.99 Prover 4: Warning: ignoring some quantifiers % 24.85/4.00 Prover 3: Constructing countermodel ... % 24.85/4.01 Prover 1: Warning: ignoring some quantifiers % 24.85/4.03 Prover 4: Constructing countermodel ... % 24.85/4.03 Prover 1: Constructing countermodel ... % 24.85/4.05 Prover 6: Proving ... % 25.39/4.16 Prover 0: Proving ... % 28.07/4.47 Prover 2: Proving ... % 29.67/4.71 Prover 5: Proving ... % 31.52/4.93 Prover 6: proved (4343ms) % 31.52/4.93 % 31.52/4.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 31.52/4.93 % 31.52/4.93 Prover 0: proved (4349ms) % 31.52/4.93 % 31.52/4.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 31.52/4.93 % 31.52/4.94 Prover 2: stopped % 31.52/4.94 Prover 5: stopped % 31.52/4.94 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 31.52/4.94 Prover 3: stopped % 31.52/4.95 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 31.52/4.95 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 31.52/4.95 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 31.52/4.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 36.99/5.66 Prover 1: Found proof (size 23) % 36.99/5.66 Prover 1: proved (5077ms) % 36.99/5.67 Prover 4: stopped % 37.61/5.74 Prover 8: Preprocessing ... % 37.61/5.75 Prover 11: Preprocessing ... % 37.61/5.75 Prover 7: Preprocessing ... % 37.84/5.77 Prover 13: Preprocessing ... % 37.84/5.78 Prover 10: Preprocessing ... % 38.77/5.90 Prover 10: stopped % 38.77/5.90 Prover 11: stopped % 38.77/5.91 Prover 7: stopped % 39.63/6.03 Prover 13: stopped % 40.21/6.18 Prover 8: Warning: ignoring some quantifiers % 40.21/6.20 Prover 8: Constructing countermodel ... % 40.21/6.20 Prover 8: stopped % 40.21/6.20 % 40.21/6.20 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 40.21/6.20 % 40.21/6.21 % SZS output start Proof for theBenchmark % 40.21/6.21 Assumptions after simplification: % 40.21/6.21 --------------------------------- % 40.21/6.21 % 40.21/6.21 (formula_1) % 40.62/6.24 ~ (true_1 = false_1) & ~ (boolNot(true_1) = true_1) & ! [v0: int] : ! [v1: % 40.62/6.24 int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! [v5: int] : ! [v6: % 40.62/6.24 int] : ! [v7: int] : (v4 = v2 | ~ (store2(v0, v1, v2, v5) = v6) | ~ % 40.62/6.24 (select2(v6, v3, v4) = v7) | select2(v0, v3, v4) = v7) & ! [v0: int] : ! % 40.62/6.24 [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! [v5: int] : ! % 40.62/6.24 [v6: int] : ! [v7: int] : (v3 = v1 | ~ (store2(v0, v1, v2, v5) = v6) | ~ % 40.62/6.24 (select2(v6, v3, v4) = v7) | select2(v0, v3, v4) = v7) & ! [v0: int] : ! % 40.62/6.24 [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! [v5: int] : (v5 = % 40.62/6.24 v3 | ~ (store2(v0, v1, v2, v3) = v4) | ~ (select2(v4, v1, v2) = v5)) & ! % 40.62/6.24 [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! % 40.62/6.24 [v5: int] : (v2 = v1 | ~ (store1(v0, v1, v3) = v4) | ~ (select1(v4, v2) = % 40.62/6.24 v5) | select1(v0, v2) = v5) & ! [v0: int] : ! [v1: int] : ! [v2: int] : % 40.62/6.24 ! [v3: int] : ! [v4: int] : (v4 = v2 | ~ (store1(v0, v1, v2) = v3) | ~ % 40.62/6.24 (select1(v3, v1) = v4)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : ! % 40.62/6.24 [v3: int] : (v3 = true_1 | ~ (x(v0, v2) = v3) | ~ (x(v0, v1) = true_1) | ? % 40.62/6.24 [v4: int] : ( ~ (v4 = true_1) & x(v1, v2) = v4)) & ! [v0: int] : ! [v1: % 40.62/6.24 int] : ! [v2: int] : (v2 = true_1 | v1 = v0 | ~ (anyNeq(v0, v1) = v2)) & % 40.62/6.24 ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = true_1 | ~ ($lesseq(1, % 40.62/6.24 $difference(v0, v1))) | ~ (intGreater(v0, v1) = v2)) & ! [v0: int] : % 40.62/6.24 ! [v1: int] : ! [v2: int] : (v2 = true_1 | ~ ($lesseq(v1, v0)) | ~ % 40.62/6.24 (intAtLeast(v0, v1) = v2)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : % 40.62/6.24 (v2 = true_1 | ~ ($lesseq(1, $difference(v1, v0))) | ~ (intLess(v0, v1) = % 40.62/6.24 v2)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = true_1 | ~ % 40.62/6.24 ($lesseq(v0, v1)) | ~ (intAtMost(v0, v1) = v2)) & ! [v0: int] : ! [v1: % 40.62/6.24 int] : ! [v2: int] : (v2 = true_1 | ~ (boolOr(v0, v1) = v2) | ( ~ (v1 = % 40.62/6.24 true_1) & ~ (v0 = true_1))) & ! [v0: int] : ! [v1: int] : ! [v2: % 40.62/6.24 int] : (v2 = true_1 | ~ (boolImplies(v0, v1) = v2) | (v0 = true_1 & ~ (v1 % 40.62/6.24 = true_1))) & ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = true_1 % 40.62/6.24 | ~ (boolIff(v0, v1) = v2) | (( ~ (v1 = true_1) | ~ (v0 = true_1)) & (v1 = % 40.62/6.24 true_1 | v0 = true_1))) & ! [v0: int] : ! [v1: int] : (v1 = v0 | ~ % 40.62/6.24 (x(v0, v1) = true_1) | ? [v2: int] : ( ~ (v2 = true_1) & x(v1, v0) = v2)) & % 40.62/6.24 ! [v0: int] : ! [v1: int] : (v1 = v0 | ~ (anyEqual(v0, v1) = true_1)) & ! % 40.62/6.24 [v0: int] : ! [v1: int] : (v1 = true_1 | v0 = true_1 | ~ (boolNot(v0) = v1)) % 40.62/6.24 & ! [v0: int] : ! [v1: int] : (v1 = true_1 | v0 = true_1 | ~ (boolOr(v0, % 40.62/6.24 v1) = true_1)) & ! [v0: int] : ! [v1: int] : (v1 = true_1 | ~ (x(v0, % 40.62/6.24 v0) = v1)) & ! [v0: int] : ! [v1: int] : (v1 = true_1 | ~ % 40.62/6.24 (anyEqual(v0, v0) = v1)) & ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(1, % 40.62/6.24 $difference(v0, v1))) | ~ (intAtMost(v0, v1) = true_1)) & ! [v0: int] % 40.62/6.24 : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (intLess(v0, v1) = true_1)) & ! % 40.62/6.24 [v0: int] : ! [v1: int] : ( ~ ($lesseq(1, $difference(v1, v0))) | ~ % 40.62/6.24 (intAtLeast(v0, v1) = true_1)) & ! [v0: int] : ! [v1: int] : ( ~ % 40.62/6.24 ($lesseq(v0, v1)) | ~ (intGreater(v0, v1) = true_1)) & ! [v0: int] : ! % 40.62/6.24 [v1: int] : ( ~ (boolAnd(v0, v1) = true_1) | (v1 = true_1 & v0 = true_1)) & ! % 40.62/6.24 [v0: int] : ! [v1: int] : ( ~ (boolIff(v0, v1) = true_1) | (( ~ (v1 = true_1) % 40.62/6.24 | v0 = true_1) & ( ~ (v0 = true_1) | v1 = true_1))) & ! [v0: int] : (v0 % 40.62/6.24 = true_1 | ~ (boolAnd(true_1, true_1) = v0)) & ! [v0: int] : (v0 = true_1 % 40.62/6.24 | ~ (boolImplies(true_1, v0) = true_1)) & ! [v0: int] : ~ (anyNeq(v0, v0) % 40.62/6.24 = true_1) % 40.62/6.24 % 40.62/6.24 (formula_3) % 40.62/6.24 ? [v0: int] : (nullObject = BeingConstructed & x_1(x_in, 2) = v0 & % 40.62/6.24 InRange(x_in, System_Int32) = true_1 & IsHeap(Heap) = true_1 & ((v0 = 0 & % 40.62/6.24 result_0 = true_1) | (result_0 = false_1 & ~ (v0 = 0))) & ((v0 = 0 & ~ % 40.62/6.24 (result_0 = true_1)) | (result_0 = true_1 & ~ (v0 = 0)))) % 40.62/6.24 % 40.62/6.24 Further assumptions not needed in the proof: % 40.62/6.24 -------------------------------------------- % 40.62/6.24 formula_2 % 40.62/6.24 % 40.62/6.24 Those formulas are unsatisfiable: % 40.62/6.24 --------------------------------- % 40.62/6.24 % 40.62/6.24 Begin of proof % 40.62/6.24 | % 40.62/6.24 | ALPHA: (formula_1) implies: % 40.62/6.24 | (1) ~ (true_1 = false_1) % 40.62/6.24 | % 40.62/6.24 | DELTA: instantiating (formula_3) with fresh symbol all_5_0 gives: % 40.62/6.24 | (2) nullObject = BeingConstructed & x_1(x_in, 2) = all_5_0 & InRange(x_in, % 40.62/6.24 | System_Int32) = true_1 & IsHeap(Heap) = true_1 & ((all_5_0 = 0 & % 40.62/6.24 | result_0 = true_1) | (result_0 = false_1 & ~ (all_5_0 = 0))) & % 40.62/6.24 | ((all_5_0 = 0 & ~ (result_0 = true_1)) | (result_0 = true_1 & ~ % 40.62/6.24 | (all_5_0 = 0))) % 40.62/6.24 | % 40.62/6.24 | ALPHA: (2) implies: % 40.62/6.24 | (3) (all_5_0 = 0 & ~ (result_0 = true_1)) | (result_0 = true_1 & ~ % 40.62/6.24 | (all_5_0 = 0)) % 40.62/6.24 | (4) (all_5_0 = 0 & result_0 = true_1) | (result_0 = false_1 & ~ (all_5_0 = % 40.62/6.24 | 0)) % 40.62/6.24 | % 40.62/6.24 | BETA: splitting (3) gives: % 40.62/6.24 | % 40.62/6.24 | Case 1: % 40.62/6.24 | | % 40.62/6.24 | | (5) all_5_0 = 0 & ~ (result_0 = true_1) % 40.62/6.24 | | % 40.62/6.24 | | ALPHA: (5) implies: % 40.62/6.24 | | (6) all_5_0 = 0 % 40.62/6.24 | | (7) ~ (result_0 = true_1) % 40.62/6.24 | | % 40.62/6.24 | | BETA: splitting (4) gives: % 40.62/6.24 | | % 40.62/6.24 | | Case 1: % 40.62/6.24 | | | % 40.62/6.24 | | | (8) all_5_0 = 0 & result_0 = true_1 % 40.62/6.24 | | | % 40.62/6.24 | | | ALPHA: (8) implies: % 40.62/6.25 | | | (9) result_0 = true_1 % 40.62/6.25 | | | % 40.62/6.25 | | | REDUCE: (7), (9) imply: % 40.62/6.25 | | | (10) $false % 40.62/6.25 | | | % 40.62/6.25 | | | CLOSE: (10) is inconsistent. % 40.62/6.25 | | | % 40.62/6.25 | | Case 2: % 40.62/6.25 | | | % 40.62/6.25 | | | (11) result_0 = false_1 & ~ (all_5_0 = 0) % 40.62/6.25 | | | % 40.62/6.25 | | | ALPHA: (11) implies: % 40.62/6.25 | | | (12) ~ (all_5_0 = 0) % 40.62/6.25 | | | % 40.62/6.25 | | | REDUCE: (6), (12) imply: % 40.62/6.25 | | | (13) $false % 40.62/6.25 | | | % 40.62/6.25 | | | CLOSE: (13) is inconsistent. % 40.62/6.25 | | | % 40.62/6.25 | | End of split % 40.62/6.25 | | % 40.62/6.25 | Case 2: % 40.62/6.25 | | % 40.62/6.25 | | (14) result_0 = true_1 & ~ (all_5_0 = 0) % 40.62/6.25 | | % 40.62/6.25 | | ALPHA: (14) implies: % 40.62/6.25 | | (15) result_0 = true_1 % 40.62/6.25 | | (16) ~ (all_5_0 = 0) % 40.62/6.25 | | % 40.62/6.25 | | BETA: splitting (4) gives: % 40.62/6.25 | | % 40.62/6.25 | | Case 1: % 40.62/6.25 | | | % 40.62/6.25 | | | (17) all_5_0 = 0 & result_0 = true_1 % 40.62/6.25 | | | % 40.62/6.25 | | | ALPHA: (17) implies: % 40.62/6.25 | | | (18) all_5_0 = 0 % 40.62/6.25 | | | % 40.62/6.25 | | | REDUCE: (16), (18) imply: % 40.62/6.25 | | | (19) $false % 40.62/6.25 | | | % 40.62/6.25 | | | CLOSE: (19) is inconsistent. % 40.62/6.25 | | | % 40.62/6.25 | | Case 2: % 40.62/6.25 | | | % 40.62/6.25 | | | (20) result_0 = false_1 & ~ (all_5_0 = 0) % 40.62/6.25 | | | % 40.62/6.25 | | | ALPHA: (20) implies: % 40.62/6.25 | | | (21) result_0 = false_1 % 40.62/6.25 | | | % 40.62/6.25 | | | COMBINE_EQS: (15), (21) imply: % 40.62/6.25 | | | (22) true_1 = false_1 % 40.62/6.25 | | | % 40.62/6.25 | | | SIMP: (22) implies: % 40.62/6.25 | | | (23) true_1 = false_1 % 40.62/6.25 | | | % 40.62/6.25 | | | REDUCE: (1), (23) imply: % 40.62/6.25 | | | (24) $false % 40.62/6.25 | | | % 40.62/6.25 | | | CLOSE: (24) is inconsistent. % 40.62/6.25 | | | % 40.62/6.25 | | End of split % 40.62/6.25 | | % 40.62/6.25 | End of split % 40.62/6.25 | % 40.62/6.25 End of proof % 40.62/6.25 % SZS output end Proof for theBenchmark % 40.62/6.25 % 40.62/6.25 5687ms %------------------------------------------------------------------------------