%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT063_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 : n005.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:04 EDT 2023 % Result : Theorem 5.29s 1.41s % Output : Proof 6.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : DAT063_1 : TPTP v8.1.2. Released v5.5.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.33 % Computer : n005.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.33 % CPULimit : 300 % 0.16/0.33 % WCLimit : 300 % 0.16/0.33 % DateTime : Thu Aug 24 13:55:08 EDT 2023 % 0.16/0.33 % CPUTime : % 0.19/0.58 ________ _____ % 0.19/0.58 ___ __ \_________(_)________________________________ % 0.19/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.58 (2023-06-19) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2023 % 0.19/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.58 Amanda Stjerna. % 0.19/0.58 Free software under BSD-3-Clause. % 0.19/0.58 % 0.19/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.58 % 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.35/0.99 Prover 4: Preprocessing ... % 2.35/0.99 Prover 1: Preprocessing ... % 2.68/1.02 Prover 3: Preprocessing ... % 2.68/1.02 Prover 0: Preprocessing ... % 2.68/1.02 Prover 5: Preprocessing ... % 2.68/1.02 Prover 2: Preprocessing ... % 2.68/1.02 Prover 6: Preprocessing ... % 4.34/1.25 Prover 6: Constructing countermodel ... % 4.34/1.26 Prover 5: Proving ... % 4.34/1.26 Prover 1: Constructing countermodel ... % 4.41/1.26 Prover 3: Constructing countermodel ... % 4.41/1.29 Prover 4: Constructing countermodel ... % 4.41/1.31 Prover 2: Proving ... % 4.41/1.32 Prover 0: Proving ... % 4.41/1.40 Prover 3: proved (782ms) % 5.29/1.41 % 5.29/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.29/1.41 % 5.29/1.41 Prover 6: proved (786ms) % 5.29/1.41 % 5.29/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.29/1.41 % 5.29/1.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.29/1.41 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.29/1.41 Prover 0: proved (812ms) % 5.29/1.41 % 5.29/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.29/1.41 % 5.29/1.43 Prover 5: proved (801ms) % 5.29/1.43 % 5.29/1.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.29/1.43 % 5.53/1.45 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.53/1.45 Prover 8: Preprocessing ... % 5.53/1.45 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.53/1.45 Prover 2: stopped % 5.53/1.45 Prover 7: Preprocessing ... % 5.53/1.45 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.53/1.45 Prover 1: Found proof (size 8) % 5.53/1.45 Prover 4: Found proof (size 6) % 5.53/1.46 Prover 1: proved (853ms) % 5.53/1.46 Prover 4: proved (841ms) % 5.53/1.48 Prover 10: Preprocessing ... % 5.53/1.48 Prover 11: Preprocessing ... % 5.53/1.50 Prover 7: stopped % 5.53/1.50 Prover 13: Preprocessing ... % 5.53/1.50 Prover 10: stopped % 5.53/1.51 Prover 11: stopped % 6.13/1.53 Prover 13: stopped % 6.13/1.55 Prover 8: Warning: ignoring some quantifiers % 6.13/1.55 Prover 8: Constructing countermodel ... % 6.13/1.56 Prover 8: stopped % 6.13/1.56 % 6.13/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.13/1.56 % 6.13/1.56 % SZS output start Proof for theBenchmark % 6.13/1.57 Assumptions after simplification: % 6.13/1.57 --------------------------------- % 6.13/1.57 % 6.13/1.57 (ax_26) % 6.42/1.60 heap(empty) & ! [v0: heap] : ( ~ (lsls(v0, empty) = 0) | ~ heap(v0)) % 6.42/1.60 % 6.42/1.60 (th_lem_1b) % 6.42/1.61 heap(empty) & ? [v0: int] : ? [v1: heap] : ? [v2: int] : ($lesseq(v0, v2) & % 6.42/1.61 lsls(v1, empty) = 0 & length(v1) = v2 & length(empty) = v0 & heap(v1)) % 6.42/1.61 % 6.42/1.61 Further assumptions not needed in the proof: % 6.42/1.61 -------------------------------------------- % 6.42/1.61 ax_17, ax_18, ax_19, ax_20, ax_21, ax_22, ax_23, ax_24, ax_25, ax_27 % 6.42/1.61 % 6.42/1.61 Those formulas are unsatisfiable: % 6.42/1.61 --------------------------------- % 6.42/1.61 % 6.42/1.61 Begin of proof % 6.42/1.61 | % 6.42/1.61 | ALPHA: (ax_26) implies: % 6.42/1.61 | (1) ! [v0: heap] : ( ~ (lsls(v0, empty) = 0) | ~ heap(v0)) % 6.42/1.61 | % 6.42/1.61 | ALPHA: (th_lem_1b) implies: % 6.42/1.61 | (2) ? [v0: int] : ? [v1: heap] : ? [v2: int] : ($lesseq(v0, v2) & % 6.42/1.61 | lsls(v1, empty) = 0 & length(v1) = v2 & length(empty) = v0 & % 6.42/1.61 | heap(v1)) % 6.42/1.61 | % 6.42/1.61 | DELTA: instantiating (2) with fresh symbols all_16_0, all_16_1, all_16_2 % 6.42/1.61 | gives: % 6.42/1.62 | (3) $lesseq(all_16_2, all_16_0) & lsls(all_16_1, empty) = 0 & % 6.42/1.62 | length(all_16_1) = all_16_0 & length(empty) = all_16_2 & heap(all_16_1) % 6.42/1.62 | % 6.42/1.62 | ALPHA: (3) implies: % 6.42/1.62 | (4) heap(all_16_1) % 6.42/1.62 | (5) lsls(all_16_1, empty) = 0 % 6.42/1.62 | % 6.42/1.62 | GROUND_INST: instantiating (1) with all_16_1, simplifying with (4), (5) gives: % 6.42/1.62 | (6) $false % 6.42/1.62 | % 6.42/1.62 | CLOSE: (6) is inconsistent. % 6.42/1.62 | % 6.42/1.62 End of proof % 6.42/1.62 % SZS output end Proof for theBenchmark % 6.42/1.62 % 6.42/1.62 1033ms %------------------------------------------------------------------------------