%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT003_1 : TPTP v8.1.2. Released v5.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n012.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 : Wed Aug 30 22:18:50 EDT 2023 % Result : Theorem 4.11s 1.29s % Output : Proof 4.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : DAT003_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n012.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 : Thu Aug 24 14:09:12 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.51/1.03 Prover 4: Preprocessing ... % 2.51/1.03 Prover 1: Preprocessing ... % 2.51/1.07 Prover 2: Preprocessing ... % 2.51/1.07 Prover 6: Preprocessing ... % 2.51/1.07 Prover 0: Preprocessing ... % 2.51/1.07 Prover 5: Preprocessing ... % 2.85/1.07 Prover 3: Preprocessing ... % 3.40/1.16 Prover 3: Constructing countermodel ... % 3.40/1.16 Prover 6: Constructing countermodel ... % 3.40/1.16 Prover 1: Constructing countermodel ... % 3.40/1.16 Prover 4: Constructing countermodel ... % 3.56/1.17 Prover 0: Proving ... % 3.56/1.17 Prover 5: Proving ... % 3.56/1.18 Prover 2: Proving ... % 4.11/1.29 Prover 3: proved (640ms) % 4.11/1.29 % 4.11/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.11/1.29 % 4.11/1.29 Prover 0: proved (645ms) % 4.11/1.29 % 4.11/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.11/1.29 % 4.11/1.29 Prover 6: stopped % 4.11/1.29 Prover 2: stopped % 4.11/1.29 Prover 5: stopped % 4.11/1.30 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.11/1.30 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.11/1.30 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.11/1.30 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.11/1.30 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.11/1.31 Prover 1: Found proof (size 8) % 4.11/1.31 Prover 1: proved (669ms) % 4.11/1.31 Prover 8: Preprocessing ... % 4.11/1.31 Prover 4: stopped % 4.11/1.32 Prover 7: Preprocessing ... % 4.11/1.32 Prover 13: Preprocessing ... % 4.11/1.32 Prover 11: Preprocessing ... % 4.63/1.33 Prover 10: Preprocessing ... % 4.63/1.34 Prover 8: Warning: ignoring some quantifiers % 4.63/1.34 Prover 7: Constructing countermodel ... % 4.63/1.34 Prover 8: Constructing countermodel ... % 4.63/1.35 Prover 8: stopped % 4.63/1.36 Prover 7: stopped % 4.63/1.36 Prover 11: Constructing countermodel ... % 4.63/1.36 Prover 10: Constructing countermodel ... % 4.63/1.36 Prover 11: stopped % 4.63/1.36 Prover 10: stopped % 4.63/1.37 Prover 13: Warning: ignoring some quantifiers % 4.63/1.37 Prover 13: Constructing countermodel ... % 4.63/1.37 Prover 13: stopped % 4.63/1.37 % 4.63/1.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.63/1.37 % 4.63/1.38 % SZS output start Proof for theBenchmark % 4.63/1.38 Assumptions after simplification: % 4.63/1.38 --------------------------------- % 4.63/1.38 % 4.63/1.38 (ax1) % 4.63/1.41 ! [v0: array] : ! [v1: int] : ! [v2: int] : ! [v3: array] : ! [v4: int] : % 4.63/1.41 (v4 = v2 | ~ (write(v0, v1, v2) = v3) | ~ (read(v3, v1) = v4) | ~ % 4.63/1.41 array(v0)) % 4.63/1.41 % 4.63/1.41 (ax2) % 4.63/1.41 ! [v0: array] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: array] : % 4.63/1.41 ! [v5: int] : (v2 = v1 | ~ (write(v0, v1, v3) = v4) | ~ (read(v4, v2) = v5) % 4.63/1.41 | ~ array(v0) | read(v0, v2) = v5) % 4.63/1.41 % 4.63/1.41 (co1) % 4.63/1.42 ? [v0: array] : ? [v1: array] : ? [v2: array] : ? [v3: array] : ? [v4: % 4.63/1.42 array] : ? [v5: int] : ( ~ (v5 = 33) & write(v4, 4, 44) = v0 & write(v3, 5, % 4.63/1.42 55) = v4 & write(v2, 4, 444) = v3 & write(v1, 3, 33) = v2 & read(v0, 3) = % 4.63/1.42 v5 & array(v4) & array(v3) & array(v2) & array(v1) & array(v0)) % 4.63/1.42 % 4.63/1.42 Those formulas are unsatisfiable: % 4.63/1.42 --------------------------------- % 4.63/1.42 % 4.63/1.42 Begin of proof % 4.63/1.42 | % 4.63/1.42 | DELTA: instantiating (co1) with fresh symbols all_7_0, all_7_1, all_7_2, % 4.63/1.42 | all_7_3, all_7_4, all_7_5 gives: % 4.63/1.42 | (1) ~ (all_7_0 = 33) & write(all_7_1, 4, 44) = all_7_5 & write(all_7_2, 5, % 4.63/1.42 | 55) = all_7_1 & write(all_7_3, 4, 444) = all_7_2 & write(all_7_4, 3, % 4.63/1.42 | 33) = all_7_3 & read(all_7_5, 3) = all_7_0 & array(all_7_1) & % 4.63/1.42 | array(all_7_2) & array(all_7_3) & array(all_7_4) & array(all_7_5) % 4.63/1.42 | % 4.63/1.42 | ALPHA: (1) implies: % 4.63/1.42 | (2) ~ (all_7_0 = 33) % 4.63/1.42 | (3) array(all_7_4) % 4.63/1.42 | (4) array(all_7_3) % 4.63/1.43 | (5) array(all_7_2) % 4.63/1.43 | (6) array(all_7_1) % 4.63/1.43 | (7) read(all_7_5, 3) = all_7_0 % 4.63/1.43 | (8) write(all_7_4, 3, 33) = all_7_3 % 4.63/1.43 | (9) write(all_7_3, 4, 444) = all_7_2 % 4.63/1.43 | (10) write(all_7_2, 5, 55) = all_7_1 % 4.63/1.43 | (11) write(all_7_1, 4, 44) = all_7_5 % 4.63/1.43 | % 4.63/1.43 | GROUND_INST: instantiating (ax2) with all_7_1, 4, 3, 44, all_7_5, all_7_0, % 4.63/1.43 | simplifying with (6), (7), (11) gives: % 4.63/1.43 | (12) read(all_7_1, 3) = all_7_0 % 4.63/1.43 | % 4.63/1.43 | GROUND_INST: instantiating (ax2) with all_7_2, 5, 3, 55, all_7_1, all_7_0, % 4.63/1.43 | simplifying with (5), (10), (12) gives: % 4.63/1.43 | (13) read(all_7_2, 3) = all_7_0 % 4.63/1.43 | % 4.63/1.43 | GROUND_INST: instantiating (ax2) with all_7_3, 4, 3, 444, all_7_2, all_7_0, % 4.63/1.43 | simplifying with (4), (9), (13) gives: % 4.63/1.43 | (14) read(all_7_3, 3) = all_7_0 % 4.63/1.43 | % 4.63/1.43 | GROUND_INST: instantiating (ax1) with all_7_4, 3, 33, all_7_3, all_7_0, % 4.63/1.43 | simplifying with (3), (8), (14) gives: % 4.63/1.43 | (15) all_7_0 = 33 % 4.63/1.43 | % 4.63/1.43 | REDUCE: (2), (15) imply: % 4.63/1.43 | (16) $false % 4.63/1.43 | % 4.63/1.43 | CLOSE: (16) is inconsistent. % 4.63/1.43 | % 4.63/1.43 End of proof % 4.63/1.43 % SZS output end Proof for theBenchmark % 4.63/1.43 % 4.63/1.43 807ms %------------------------------------------------------------------------------