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