%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI182_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 : n010.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 17:47:11 EDT 2023 % Result : Theorem 3.09s 1.24s % Output : Proof 3.78s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : ARI182_1 : TPTP v8.1.2. Released v5.0.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n010.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 18:28:48 EDT 2023 % 0.13/0.34 % CPUTime : % 0.68/0.65 ________ _____ % 0.68/0.65 ___ __ \_________(_)________________________________ % 0.68/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.68/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.68/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.68/0.65 % 0.68/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.68/0.65 (2023-06-19) % 0.68/0.65 % 0.68/0.65 (c) Philipp Rümmer, 2009-2023 % 0.68/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.68/0.65 Amanda Stjerna. % 0.68/0.65 Free software under BSD-3-Clause. % 0.68/0.65 % 0.68/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.68/0.65 % 0.68/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.66 Running up to 7 provers in parallel. % 0.68/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.10/1.06 Prover 1: Preprocessing ... % 2.10/1.06 Prover 4: Preprocessing ... % 2.47/1.10 Prover 5: Preprocessing ... % 2.47/1.10 Prover 2: Preprocessing ... % 2.47/1.10 Prover 0: Preprocessing ... % 2.47/1.10 Prover 6: Preprocessing ... % 2.47/1.10 Prover 3: Preprocessing ... % 2.47/1.14 Prover 1: Constructing countermodel ... % 2.47/1.14 Prover 3: Constructing countermodel ... % 2.47/1.14 Prover 4: Constructing countermodel ... % 2.47/1.14 Prover 2: Proving ... % 2.47/1.14 Prover 6: Proving ... % 2.47/1.14 Prover 0: Proving ... % 2.47/1.14 Prover 5: Proving ... % 3.09/1.23 Prover 3: proved (564ms) % 3.09/1.24 % 3.09/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.09/1.24 % 3.09/1.24 Prover 6: stopped % 3.09/1.24 Prover 0: stopped % 3.09/1.24 Prover 5: proved (568ms) % 3.09/1.24 % 3.09/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.09/1.24 % 3.09/1.24 Prover 2: proved (571ms) % 3.09/1.24 % 3.09/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.09/1.24 % 3.09/1.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.09/1.24 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.09/1.24 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.09/1.24 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.09/1.24 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.09/1.25 Prover 1: Found proof (size 8) % 3.09/1.25 Prover 4: Found proof (size 7) % 3.09/1.25 Prover 1: proved (577ms) % 3.09/1.25 Prover 4: proved (578ms) % 3.09/1.25 Prover 7: Preprocessing ... % 3.09/1.25 Prover 10: Preprocessing ... % 3.44/1.26 Prover 11: Preprocessing ... % 3.44/1.26 Prover 8: Preprocessing ... % 3.44/1.26 Prover 13: Preprocessing ... % 3.44/1.26 Prover 7: Constructing countermodel ... % 3.44/1.27 Prover 7: stopped % 3.44/1.27 Prover 10: Constructing countermodel ... % 3.44/1.27 Prover 10: stopped % 3.44/1.27 Prover 8: Warning: ignoring some quantifiers % 3.44/1.27 Prover 11: Constructing countermodel ... % 3.44/1.27 Prover 8: Constructing countermodel ... % 3.44/1.27 Prover 11: stopped % 3.44/1.28 Prover 8: stopped % 3.44/1.28 Prover 13: Warning: ignoring some quantifiers % 3.44/1.28 Prover 13: Constructing countermodel ... % 3.44/1.28 Prover 13: stopped % 3.44/1.28 % 3.44/1.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.44/1.28 % 3.44/1.28 % SZS output start Proof for theBenchmark % 3.44/1.29 Assumptions after simplification: % 3.44/1.29 --------------------------------- % 3.44/1.29 % 3.44/1.29 (co1) % 3.63/1.32 ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (f(v0) = v1)) & ? % 3.63/1.32 [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ($lesseq(-1, % 3.63/1.32 $sum($difference(v1, v3), v0)) & f($sum(v2, v1)) = v3 & f(v0) = v2) % 3.63/1.32 % 3.63/1.32 Those formulas are unsatisfiable: % 3.63/1.32 --------------------------------- % 3.63/1.32 % 3.63/1.32 Begin of proof % 3.63/1.32 | % 3.63/1.32 | ALPHA: (co1) implies: % 3.63/1.32 | (1) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (f(v0) = v1)) % 3.63/1.32 | (2) ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : % 3.63/1.32 | ($lesseq(-1, $sum($difference(v1, v3), v0)) & f($sum(v2, v1)) = v3 & % 3.63/1.32 | f(v0) = v2) % 3.63/1.32 | % 3.63/1.33 | DELTA: instantiating (2) with fresh symbols all_4_0, all_4_1, all_4_2, all_4_3 % 3.63/1.33 | gives: % 3.63/1.33 | (3) $lesseq(-1, $sum($difference(all_4_2, all_4_0), all_4_3)) & % 3.63/1.33 | f($sum(all_4_1, all_4_2)) = all_4_0 & f(all_4_3) = all_4_1 % 3.63/1.33 | % 3.63/1.33 | ALPHA: (3) implies: % 3.63/1.33 | (4) $lesseq(-1, $sum($difference(all_4_2, all_4_0), all_4_3)) % 3.63/1.33 | (5) f(all_4_3) = all_4_1 % 3.63/1.33 | (6) f($sum(all_4_1, all_4_2)) = all_4_0 % 3.63/1.33 | % 3.78/1.33 | GROUND_INST: instantiating (1) with all_4_3, all_4_1, simplifying with (5) % 3.78/1.33 | gives: % 3.78/1.33 | (7) $lesseq(1, $difference(all_4_1, all_4_3)) % 3.78/1.33 | % 3.78/1.33 | GROUND_INST: instantiating (1) with $sum(all_4_1, all_4_2), all_4_0, % 3.78/1.33 | simplifying with (6) gives: % 3.78/1.33 | (8) $lesseq(1, $difference($difference(all_4_0, all_4_1), all_4_2)) % 3.78/1.33 | % 3.78/1.33 | COMBINE_INEQS: (4), (8) imply: % 3.78/1.33 | (9) $lesseq(all_4_1, all_4_3) % 3.78/1.33 | % 3.78/1.33 | COMBINE_INEQS: (7), (9) imply: % 3.78/1.33 | (10) $false % 3.78/1.33 | % 3.78/1.33 | CLOSE: (10) is inconsistent. % 3.78/1.33 | % 3.78/1.33 End of proof % 3.78/1.33 % SZS output end Proof for theBenchmark % 3.78/1.33 % 3.78/1.33 685ms %------------------------------------------------------------------------------