%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW805_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 : n032.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 30.95s 4.82s % Output : Proof 40.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SWW805_1 : TPTP v8.1.2. Released v7.0.0. % 0.00/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.30 % Computer : n032.cluster.edu % 0.11/0.30 % Model : x86_64 x86_64 % 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.30 % Memory : 8042.1875MB % 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.30 % CPULimit : 300 % 0.11/0.30 % WCLimit : 300 % 0.11/0.30 % DateTime : Sun Aug 27 22:03:00 EDT 2023 % 0.11/0.30 % CPUTime : % 0.15/0.52 ________ _____ % 0.15/0.52 ___ __ \_________(_)________________________________ % 0.15/0.52 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.15/0.52 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.15/0.52 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.15/0.52 % 0.15/0.52 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.15/0.52 (2023-06-19) % 0.15/0.52 % 0.15/0.52 (c) Philipp Rümmer, 2009-2023 % 0.15/0.52 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.15/0.52 Amanda Stjerna. % 0.15/0.52 Free software under BSD-3-Clause. % 0.15/0.52 % 0.15/0.52 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.15/0.52 % 0.15/0.52 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.15/0.53 Running up to 7 provers in parallel. % 0.15/0.55 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.15/0.55 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.15/0.55 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.15/0.55 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.15/0.55 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.15/0.55 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.15/0.55 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 10.07/2.03 Prover 0: Preprocessing ... % 10.96/2.17 Prover 2: Preprocessing ... % 11.30/2.20 Prover 3: Preprocessing ... % 11.30/2.20 Prover 5: Preprocessing ... % 11.30/2.22 Prover 1: Preprocessing ... % 11.30/2.22 Prover 6: Preprocessing ... % 11.30/2.23 Prover 4: Preprocessing ... % 24.39/3.91 Prover 3: Warning: ignoring some quantifiers % 24.45/3.95 Prover 1: Warning: ignoring some quantifiers % 24.45/3.95 Prover 4: Warning: ignoring some quantifiers % 24.45/3.98 Prover 3: Constructing countermodel ... % 24.45/3.98 Prover 4: Constructing countermodel ... % 24.45/3.99 Prover 1: Constructing countermodel ... % 25.09/4.05 Prover 6: Proving ... % 25.09/4.07 Prover 0: Proving ... % 29.63/4.70 Prover 2: Proving ... % 30.95/4.81 Prover 0: proved (4268ms) % 30.95/4.82 % 30.95/4.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 30.95/4.82 % 30.95/4.82 Prover 5: Proving ... % 30.95/4.82 Prover 6: stopped % 30.95/4.82 Prover 5: stopped % 30.95/4.82 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 30.95/4.82 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 30.95/4.82 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 30.95/4.83 Prover 2: stopped % 30.95/4.84 Prover 3: stopped % 30.95/4.84 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 30.95/4.84 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 36.31/5.66 Prover 7: Preprocessing ... % 36.31/5.68 Prover 13: Preprocessing ... % 37.40/5.72 Prover 10: Preprocessing ... % 37.40/5.74 Prover 11: Preprocessing ... % 37.40/5.75 Prover 8: Preprocessing ... % 37.40/5.76 Prover 1: Found proof (size 21) % 37.40/5.76 Prover 1: proved (5221ms) % 37.40/5.76 Prover 4: stopped % 38.62/5.86 Prover 10: stopped % 38.62/5.88 Prover 7: stopped % 38.62/5.89 Prover 11: stopped % 39.11/5.95 Prover 13: stopped % 40.11/6.15 Prover 8: Warning: ignoring some quantifiers % 40.11/6.17 Prover 8: Constructing countermodel ... % 40.11/6.18 Prover 8: stopped % 40.11/6.18 % 40.11/6.18 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 40.11/6.18 % 40.11/6.18 % SZS output start Proof for theBenchmark % 40.11/6.19 Assumptions after simplification: % 40.11/6.19 --------------------------------- % 40.11/6.19 % 40.11/6.19 (formula_1) % 40.43/6.24 ~ (true_1 = false_1) & ~ (boolNot(true_1) = true_1) & ! [v0: int] : ! [v1: % 40.43/6.24 int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! [v5: int] : ! [v6: % 40.43/6.24 int] : ! [v7: int] : (v4 = v2 | ~ (store2(v0, v1, v2, v5) = v6) | ~ % 40.43/6.24 (select2(v6, v3, v4) = v7) | select2(v0, v3, v4) = v7) & ! [v0: int] : ! % 40.43/6.24 [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! [v5: int] : ! % 40.43/6.24 [v6: int] : ! [v7: int] : (v3 = v1 | ~ (store2(v0, v1, v2, v5) = v6) | ~ % 40.43/6.24 (select2(v6, v3, v4) = v7) | select2(v0, v3, v4) = v7) & ! [v0: int] : ! % 40.43/6.24 [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! [v5: int] : (v5 = % 40.43/6.24 v3 | ~ (store2(v0, v1, v2, v3) = v4) | ~ (select2(v4, v1, v2) = v5)) & ! % 40.43/6.24 [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! % 40.43/6.24 [v5: int] : (v2 = v1 | ~ (store1(v0, v1, v3) = v4) | ~ (select1(v4, v2) = % 40.43/6.24 v5) | select1(v0, v2) = v5) & ! [v0: int] : ! [v1: int] : ! [v2: int] : % 40.43/6.24 ! [v3: int] : ! [v4: int] : (v4 = v2 | ~ (store1(v0, v1, v2) = v3) | ~ % 40.43/6.24 (select1(v3, v1) = v4)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : ! % 40.43/6.24 [v3: int] : (v3 = true_1 | ~ (x(v0, v2) = v3) | ~ (x(v0, v1) = true_1) | ? % 40.43/6.24 [v4: int] : ( ~ (v4 = true_1) & x(v1, v2) = v4)) & ! [v0: int] : ! [v1: % 40.43/6.24 int] : ! [v2: int] : (v2 = true_1 | v1 = v0 | ~ (anyNeq(v0, v1) = v2)) & % 40.43/6.24 ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = true_1 | ~ ($lesseq(1, % 40.43/6.24 $difference(v0, v1))) | ~ (intGreater(v0, v1) = v2)) & ! [v0: int] : % 40.43/6.24 ! [v1: int] : ! [v2: int] : (v2 = true_1 | ~ ($lesseq(v1, v0)) | ~ % 40.43/6.24 (intAtLeast(v0, v1) = v2)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : % 40.43/6.24 (v2 = true_1 | ~ ($lesseq(1, $difference(v1, v0))) | ~ (intLess(v0, v1) = % 40.43/6.24 v2)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = true_1 | ~ % 40.43/6.24 ($lesseq(v0, v1)) | ~ (intAtMost(v0, v1) = v2)) & ! [v0: int] : ! [v1: % 40.43/6.24 int] : ! [v2: int] : (v2 = true_1 | ~ (boolOr(v0, v1) = v2) | ( ~ (v1 = % 40.43/6.24 true_1) & ~ (v0 = true_1))) & ! [v0: int] : ! [v1: int] : ! [v2: % 40.43/6.24 int] : (v2 = true_1 | ~ (boolImplies(v0, v1) = v2) | (v0 = true_1 & ~ (v1 % 40.43/6.24 = true_1))) & ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = true_1 % 40.43/6.24 | ~ (boolIff(v0, v1) = v2) | (( ~ (v1 = true_1) | ~ (v0 = true_1)) & (v1 = % 40.43/6.24 true_1 | v0 = true_1))) & ! [v0: int] : ! [v1: int] : (v1 = v0 | ~ % 40.43/6.24 (x(v0, v1) = true_1) | ? [v2: int] : ( ~ (v2 = true_1) & x(v1, v0) = v2)) & % 40.43/6.24 ! [v0: int] : ! [v1: int] : (v1 = v0 | ~ (anyEqual(v0, v1) = true_1)) & ! % 40.43/6.24 [v0: int] : ! [v1: int] : (v1 = true_1 | v0 = true_1 | ~ (boolNot(v0) = v1)) % 40.43/6.24 & ! [v0: int] : ! [v1: int] : (v1 = true_1 | v0 = true_1 | ~ (boolOr(v0, % 40.43/6.24 v1) = true_1)) & ! [v0: int] : ! [v1: int] : (v1 = true_1 | ~ (x(v0, % 40.43/6.24 v0) = v1)) & ! [v0: int] : ! [v1: int] : (v1 = true_1 | ~ % 40.43/6.24 (anyEqual(v0, v0) = v1)) & ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(1, % 40.43/6.24 $difference(v0, v1))) | ~ (intAtMost(v0, v1) = true_1)) & ! [v0: int] % 40.43/6.24 : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (intLess(v0, v1) = true_1)) & ! % 40.43/6.24 [v0: int] : ! [v1: int] : ( ~ ($lesseq(1, $difference(v1, v0))) | ~ % 40.43/6.24 (intAtLeast(v0, v1) = true_1)) & ! [v0: int] : ! [v1: int] : ( ~ % 40.43/6.24 ($lesseq(v0, v1)) | ~ (intGreater(v0, v1) = true_1)) & ! [v0: int] : ! % 40.43/6.24 [v1: int] : ( ~ (boolAnd(v0, v1) = true_1) | (v1 = true_1 & v0 = true_1)) & ! % 40.43/6.24 [v0: int] : ! [v1: int] : ( ~ (boolIff(v0, v1) = true_1) | (( ~ (v1 = true_1) % 40.43/6.24 | v0 = true_1) & ( ~ (v0 = true_1) | v1 = true_1))) & ! [v0: int] : (v0 % 40.43/6.24 = true_1 | ~ (boolAnd(true_1, true_1) = v0)) & ! [v0: int] : (v0 = true_1 % 40.43/6.24 | ~ (boolImplies(true_1, v0) = true_1)) & ! [v0: int] : ~ (anyNeq(v0, v0) % 40.43/6.24 = true_1) % 40.43/6.24 % 40.43/6.24 (formula_3) % 40.43/6.24 nullObject = BeingConstructed & PurityAxiomsCanBeAssumed = true_1 & x_1(x_in, % 40.43/6.24 2) = stack0i_0 & InRange(x_in, System_Int32) = true_1 & InRange(x_3, % 40.43/6.24 System_Int32) = true_1 & IsHeap(Heap) = true_1 & ! [v0: int] : ! [v1: int] % 40.43/6.24 : ! [v2: int] : ( ~ (select2(Heap, v0, v1) = v2) | ? [v3: int] : ? [v4: % 40.43/6.24 int] : (select2(Heap, v0, ownerFrame) = v3 & select2(Heap, v0, ownerRef) = % 40.43/6.24 v4)) & ((stack0i_0 = 0 & true_1 = stack0b_0) | (stack0b_0 = false_1 & ~ % 40.43/6.24 (stack0i_0 = 0))) & ((stack0i_0 = 0 & ~ (true_1 = stack0b_0)) | (true_1 = % 40.43/6.24 stack0b_0 & ~ (stack0i_0 = 0))) % 40.43/6.24 % 40.43/6.24 Further assumptions not needed in the proof: % 40.43/6.24 -------------------------------------------- % 40.43/6.24 formula_2 % 40.43/6.24 % 40.43/6.24 Those formulas are unsatisfiable: % 40.43/6.24 --------------------------------- % 40.43/6.24 % 40.43/6.24 Begin of proof % 40.43/6.24 | % 40.43/6.24 | ALPHA: (formula_1) implies: % 40.43/6.24 | (1) ~ (true_1 = false_1) % 40.43/6.24 | % 40.43/6.24 | ALPHA: (formula_3) implies: % 40.43/6.24 | (2) (stack0i_0 = 0 & ~ (true_1 = stack0b_0)) | (true_1 = stack0b_0 & ~ % 40.43/6.24 | (stack0i_0 = 0)) % 40.43/6.24 | (3) (stack0i_0 = 0 & true_1 = stack0b_0) | (stack0b_0 = false_1 & ~ % 40.43/6.24 | (stack0i_0 = 0)) % 40.43/6.24 | % 40.43/6.24 | BETA: splitting (3) gives: % 40.43/6.24 | % 40.43/6.25 | Case 1: % 40.43/6.25 | | % 40.43/6.25 | | (4) stack0i_0 = 0 & true_1 = stack0b_0 % 40.43/6.25 | | % 40.43/6.25 | | ALPHA: (4) implies: % 40.43/6.25 | | (5) true_1 = stack0b_0 % 40.43/6.25 | | (6) stack0i_0 = 0 % 40.43/6.25 | | % 40.43/6.25 | | BETA: splitting (2) gives: % 40.43/6.25 | | % 40.43/6.25 | | Case 1: % 40.43/6.25 | | | % 40.43/6.25 | | | (7) stack0i_0 = 0 & ~ (true_1 = stack0b_0) % 40.43/6.25 | | | % 40.43/6.25 | | | ALPHA: (7) implies: % 40.43/6.25 | | | (8) ~ (true_1 = stack0b_0) % 40.43/6.25 | | | % 40.43/6.25 | | | REDUCE: (5), (8) imply: % 40.43/6.25 | | | (9) $false % 40.43/6.25 | | | % 40.43/6.25 | | | CLOSE: (9) is inconsistent. % 40.43/6.25 | | | % 40.43/6.25 | | Case 2: % 40.43/6.25 | | | % 40.43/6.25 | | | (10) true_1 = stack0b_0 & ~ (stack0i_0 = 0) % 40.43/6.25 | | | % 40.43/6.25 | | | ALPHA: (10) implies: % 40.43/6.25 | | | (11) ~ (stack0i_0 = 0) % 40.43/6.25 | | | % 40.43/6.25 | | | REDUCE: (6), (11) imply: % 40.43/6.25 | | | (12) $false % 40.43/6.25 | | | % 40.43/6.25 | | | CLOSE: (12) is inconsistent. % 40.43/6.25 | | | % 40.43/6.25 | | End of split % 40.43/6.25 | | % 40.43/6.25 | Case 2: % 40.43/6.25 | | % 40.43/6.25 | | (13) stack0b_0 = false_1 & ~ (stack0i_0 = 0) % 40.43/6.25 | | % 40.43/6.25 | | ALPHA: (13) implies: % 40.43/6.25 | | (14) stack0b_0 = false_1 % 40.43/6.25 | | (15) ~ (stack0i_0 = 0) % 40.43/6.25 | | % 40.43/6.25 | | BETA: splitting (2) gives: % 40.43/6.25 | | % 40.43/6.25 | | Case 1: % 40.43/6.25 | | | % 40.43/6.25 | | | (16) stack0i_0 = 0 & ~ (true_1 = stack0b_0) % 40.43/6.25 | | | % 40.43/6.25 | | | ALPHA: (16) implies: % 40.43/6.25 | | | (17) stack0i_0 = 0 % 40.43/6.25 | | | % 40.43/6.25 | | | REDUCE: (15), (17) imply: % 40.43/6.25 | | | (18) $false % 40.43/6.25 | | | % 40.43/6.25 | | | CLOSE: (18) is inconsistent. % 40.43/6.25 | | | % 40.43/6.25 | | Case 2: % 40.43/6.25 | | | % 40.43/6.25 | | | (19) true_1 = stack0b_0 & ~ (stack0i_0 = 0) % 40.43/6.25 | | | % 40.43/6.25 | | | ALPHA: (19) implies: % 40.43/6.25 | | | (20) true_1 = stack0b_0 % 40.43/6.25 | | | % 40.43/6.25 | | | COMBINE_EQS: (14), (20) imply: % 40.43/6.25 | | | (21) true_1 = false_1 % 40.43/6.25 | | | % 40.43/6.25 | | | REDUCE: (1), (21) imply: % 40.43/6.25 | | | (22) $false % 40.43/6.25 | | | % 40.43/6.25 | | | CLOSE: (22) is inconsistent. % 40.43/6.25 | | | % 40.43/6.25 | | End of split % 40.43/6.25 | | % 40.43/6.25 | End of split % 40.43/6.25 | % 40.43/6.25 End of proof % 40.43/6.25 % SZS output end Proof for theBenchmark % 40.43/6.25 % 40.43/6.25 5729ms %------------------------------------------------------------------------------