%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT057_1 : TPTP v8.1.2. Released v5.5.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n023.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:19:03 EDT 2023 % Result : Theorem 4.18s 1.29s % Output : Proof 5.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT057_1 : TPTP v8.1.2. Released v5.5.0. % 0.11/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.34 % Computer : n023.cluster.edu % 0.11/0.34 % Model : x86_64 x86_64 % 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.34 % Memory : 8042.1875MB % 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.34 % CPULimit : 300 % 0.11/0.34 % WCLimit : 300 % 0.11/0.34 % DateTime : Thu Aug 24 15:03:42 EDT 2023 % 0.11/0.34 % CPUTime : % 0.62/0.60 ________ _____ % 0.62/0.60 ___ __ \_________(_)________________________________ % 0.62/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.62/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.62/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.62/0.60 % 0.62/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.62/0.60 (2023-06-19) % 0.62/0.61 % 0.62/0.61 (c) Philipp Rümmer, 2009-2023 % 0.62/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.62/0.61 Amanda Stjerna. % 0.62/0.61 Free software under BSD-3-Clause. % 0.62/0.61 % 0.62/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.62/0.61 % 0.62/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.62/0.62 Running up to 7 provers in parallel. % 0.62/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.62/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.62/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.62/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.62/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.62/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.62/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.00/1.01 Prover 1: Preprocessing ... % 2.00/1.02 Prover 4: Preprocessing ... % 2.66/1.05 Prover 6: Preprocessing ... % 2.66/1.05 Prover 5: Preprocessing ... % 2.66/1.05 Prover 3: Preprocessing ... % 2.66/1.06 Prover 2: Preprocessing ... % 2.66/1.06 Prover 0: Preprocessing ... % 3.06/1.16 Prover 1: Warning: ignoring some quantifiers % 3.59/1.17 Prover 4: Warning: ignoring some quantifiers % 3.59/1.18 Prover 3: Warning: ignoring some quantifiers % 3.59/1.18 Prover 3: Constructing countermodel ... % 3.59/1.18 Prover 1: Constructing countermodel ... % 3.59/1.19 Prover 4: Constructing countermodel ... % 3.59/1.19 Prover 6: Proving ... % 3.59/1.19 Prover 0: Proving ... % 3.59/1.20 Prover 5: Proving ... % 4.18/1.25 Prover 2: Proving ... % 4.18/1.28 Prover 3: proved (658ms) % 4.18/1.29 % 4.18/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.18/1.29 % 4.18/1.29 Prover 2: stopped % 4.18/1.29 Prover 6: stopped % 4.18/1.29 Prover 0: proved (663ms) % 4.18/1.29 % 4.18/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.18/1.29 % 4.18/1.29 Prover 5: stopped % 4.18/1.29 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.18/1.29 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.18/1.29 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.18/1.29 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.18/1.29 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.18/1.32 Prover 13: Preprocessing ... % 4.18/1.32 Prover 11: Preprocessing ... % 4.18/1.32 Prover 7: Preprocessing ... % 4.78/1.33 Prover 10: Preprocessing ... % 4.78/1.33 Prover 1: Found proof (size 12) % 4.78/1.33 Prover 1: proved (707ms) % 4.78/1.33 Prover 4: stopped % 4.78/1.34 Prover 8: Preprocessing ... % 4.78/1.34 Prover 11: stopped % 4.78/1.35 Prover 7: stopped % 4.78/1.35 Prover 10: stopped % 4.78/1.35 Prover 13: stopped % 4.78/1.37 Prover 8: Warning: ignoring some quantifiers % 4.78/1.37 Prover 8: Constructing countermodel ... % 5.10/1.38 Prover 8: stopped % 5.10/1.38 % 5.10/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.10/1.38 % 5.10/1.38 % SZS output start Proof for theBenchmark % 5.10/1.39 Assumptions after simplification: % 5.10/1.39 --------------------------------- % 5.10/1.39 % 5.10/1.39 (ax_19) % 5.10/1.42 ! [v0: int] : ! [v1: data] : ! [v2: array] : ! [v3: int] : ! [v4: array] % 5.10/1.42 : ! [v5: data] : (v3 = v0 | ~ (put(v2, v0, v1) = v4) | ~ (get(v4, v3) = v5) % 5.10/1.42 | ~ array(v2) | ~ data(v1) | (get(v2, v3) = v5 & data(v5))) % 5.10/1.42 % 5.10/1.42 (th_lem_1) % 5.10/1.42 ? [v0: data] : ? [v1: array] : ? [v2: int] : ? [v3: int] : ? [v4: array] % 5.10/1.42 : ? [v5: data] : ? [v6: data] : ( ~ (v6 = v5) & ~ (v3 = v2) & put(v1, v2, % 5.10/1.42 v0) = v4 & get(v4, v3) = v5 & get(v1, v3) = v6 & array(v4) & array(v1) & % 5.10/1.42 data(v6) & data(v5) & data(v0)) % 5.10/1.42 % 5.10/1.42 (function-axioms) % 5.10/1.42 ! [v0: array] : ! [v1: array] : ! [v2: data] : ! [v3: int] : ! [v4: % 5.10/1.42 array] : (v1 = v0 | ~ (put(v4, v3, v2) = v1) | ~ (put(v4, v3, v2) = v0)) & % 5.10/1.42 ! [v0: data] : ! [v1: data] : ! [v2: int] : ! [v3: array] : (v1 = v0 | ~ % 5.10/1.42 (get(v3, v2) = v1) | ~ (get(v3, v2) = v0)) % 5.10/1.42 % 5.10/1.42 Further assumptions not needed in the proof: % 5.10/1.42 -------------------------------------------- % 5.10/1.42 ax_17, ax_18, ax_20, ax_21 % 5.10/1.42 % 5.10/1.42 Those formulas are unsatisfiable: % 5.10/1.42 --------------------------------- % 5.10/1.42 % 5.10/1.42 Begin of proof % 5.10/1.42 | % 5.10/1.42 | ALPHA: (function-axioms) implies: % 5.10/1.43 | (1) ! [v0: data] : ! [v1: data] : ! [v2: int] : ! [v3: array] : (v1 = % 5.10/1.43 | v0 | ~ (get(v3, v2) = v1) | ~ (get(v3, v2) = v0)) % 5.10/1.43 | % 5.10/1.43 | DELTA: instantiating (th_lem_1) with fresh symbols all_13_0, all_13_1, % 5.10/1.43 | all_13_2, all_13_3, all_13_4, all_13_5, all_13_6 gives: % 5.10/1.43 | (2) ~ (all_13_0 = all_13_1) & ~ (all_13_3 = all_13_4) & put(all_13_5, % 5.10/1.43 | all_13_4, all_13_6) = all_13_2 & get(all_13_2, all_13_3) = all_13_1 & % 5.10/1.43 | get(all_13_5, all_13_3) = all_13_0 & array(all_13_2) & array(all_13_5) % 5.10/1.43 | & data(all_13_0) & data(all_13_1) & data(all_13_6) % 5.10/1.43 | % 5.10/1.43 | ALPHA: (2) implies: % 5.10/1.43 | (3) ~ (all_13_3 = all_13_4) % 5.10/1.43 | (4) ~ (all_13_0 = all_13_1) % 5.10/1.43 | (5) data(all_13_6) % 5.10/1.43 | (6) array(all_13_5) % 5.10/1.43 | (7) get(all_13_5, all_13_3) = all_13_0 % 5.10/1.43 | (8) get(all_13_2, all_13_3) = all_13_1 % 5.10/1.43 | (9) put(all_13_5, all_13_4, all_13_6) = all_13_2 % 5.10/1.43 | % 5.10/1.43 | GROUND_INST: instantiating (ax_19) with all_13_4, all_13_6, all_13_5, % 5.10/1.43 | all_13_3, all_13_2, all_13_1, simplifying with (5), (6), (8), (9) % 5.10/1.43 | gives: % 5.10/1.43 | (10) all_13_3 = all_13_4 | (get(all_13_5, all_13_3) = all_13_1 & % 5.10/1.43 | data(all_13_1)) % 5.10/1.43 | % 5.10/1.43 | BETA: splitting (10) gives: % 5.10/1.43 | % 5.10/1.43 | Case 1: % 5.10/1.43 | | % 5.10/1.43 | | (11) all_13_3 = all_13_4 % 5.10/1.43 | | % 5.10/1.43 | | REDUCE: (3), (11) imply: % 5.10/1.43 | | (12) $false % 5.10/1.43 | | % 5.10/1.43 | | CLOSE: (12) is inconsistent. % 5.10/1.43 | | % 5.10/1.43 | Case 2: % 5.10/1.43 | | % 5.10/1.44 | | (13) get(all_13_5, all_13_3) = all_13_1 & data(all_13_1) % 5.10/1.44 | | % 5.10/1.44 | | ALPHA: (13) implies: % 5.10/1.44 | | (14) get(all_13_5, all_13_3) = all_13_1 % 5.10/1.44 | | % 5.10/1.44 | | GROUND_INST: instantiating (1) with all_13_0, all_13_1, all_13_3, all_13_5, % 5.10/1.44 | | simplifying with (7), (14) gives: % 5.10/1.44 | | (15) all_13_0 = all_13_1 % 5.10/1.44 | | % 5.10/1.44 | | REDUCE: (4), (15) imply: % 5.10/1.44 | | (16) $false % 5.10/1.44 | | % 5.10/1.44 | | CLOSE: (16) is inconsistent. % 5.10/1.44 | | % 5.10/1.44 | End of split % 5.10/1.44 | % 5.10/1.44 End of proof % 5.10/1.44 % SZS output end Proof for theBenchmark % 5.10/1.44 % 5.10/1.44 830ms %------------------------------------------------------------------------------