%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI619_1 : TPTP v8.1.2. Released v5.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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:48:36 EDT 2023 % Result : Theorem 3.35s 1.17s % Output : Proof 3.90s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ARI619_1 : TPTP v8.1.2. Released v5.1.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n022.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Tue Aug 29 18:42:08 EDT 2023 % 0.12/0.34 % CPUTime : % 0.48/0.59 ________ _____ % 0.48/0.59 ___ __ \_________(_)________________________________ % 0.48/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.48/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.48/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.48/0.59 % 0.48/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.48/0.59 (2023-06-19) % 0.48/0.59 % 0.48/0.59 (c) Philipp Rümmer, 2009-2023 % 0.48/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.48/0.59 Amanda Stjerna. % 0.48/0.59 Free software under BSD-3-Clause. % 0.48/0.59 % 0.48/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.48/0.59 % 0.48/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.48/0.61 Running up to 7 provers in parallel. % 0.48/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.48/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.48/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.48/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.48/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.48/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.48/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.31/1.00 Prover 4: Preprocessing ... % 2.31/1.00 Prover 3: Preprocessing ... % 2.31/1.00 Prover 2: Preprocessing ... % 2.31/1.00 Prover 1: Preprocessing ... % 2.31/1.00 Prover 5: Preprocessing ... % 2.31/1.00 Prover 6: Preprocessing ... % 2.31/1.00 Prover 0: Preprocessing ... % 2.91/1.09 Prover 5: Proving ... % 2.91/1.10 Prover 2: Constructing countermodel ... % 2.91/1.10 Prover 1: Constructing countermodel ... % 2.91/1.10 Prover 0: Proving ... % 2.91/1.10 Prover 6: Proving ... % 2.91/1.10 Prover 4: Constructing countermodel ... % 2.91/1.10 Prover 3: Constructing countermodel ... % 3.35/1.16 Prover 3: proved (546ms) % 3.35/1.16 Prover 2: proved (550ms) % 3.35/1.17 % 3.35/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.35/1.17 % 3.35/1.17 % 3.35/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.35/1.17 % 3.35/1.17 Prover 6: stopped % 3.35/1.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.35/1.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.35/1.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.35/1.17 Prover 0: proved (559ms) % 3.35/1.17 % 3.35/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.35/1.17 % 3.35/1.17 Prover 1: Found proof (size 3) % 3.35/1.17 Prover 1: proved (562ms) % 3.35/1.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.35/1.18 Prover 4: Found proof (size 3) % 3.35/1.18 Prover 4: proved (562ms) % 3.35/1.18 Prover 7: Preprocessing ... % 3.35/1.18 Prover 10: Preprocessing ... % 3.35/1.18 Prover 5: proved (565ms) % 3.35/1.18 Prover 8: Preprocessing ... % 3.35/1.19 Prover 11: Preprocessing ... % 3.35/1.20 Prover 7: Constructing countermodel ... % 3.35/1.20 Prover 10: Constructing countermodel ... % 3.35/1.20 Prover 7: stopped % 3.35/1.20 Prover 10: stopped % 3.35/1.21 Prover 8: Warning: ignoring some quantifiers % 3.35/1.21 Prover 8: Constructing countermodel ... % 3.35/1.22 Prover 11: Constructing countermodel ... % 3.35/1.22 Prover 8: stopped % 3.35/1.22 Prover 11: stopped % 3.35/1.22 % 3.35/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.35/1.22 % 3.35/1.22 % SZS output start Proof for theBenchmark % 3.35/1.22 Assumptions after simplification: % 3.35/1.22 --------------------------------- % 3.35/1.22 % 3.35/1.22 (not_pow_of_2_5) % 3.90/1.25 pow2(5) = 0 & ! [v0: int] : ! [v1: int] : (v1 = 0 | ~ (pow2(v0) = v1) | ( ~ % 3.90/1.25 (v0 = 1) & ( ~ ($lesseq(2, v0)) | ! [v2: int] : ( ~ ($product(2, v2) = % 3.90/1.25 v0) | ~ (pow2(v2) = 0))))) & ! [v0: int] : (v0 = 1 | ~ (pow2(v0) % 3.90/1.25 = 0) | ($lesseq(2, v0) & ? [v1: int] : ($product(2, v1) = v0 & pow2(v1) = % 3.90/1.25 0))) % 3.90/1.25 % 3.90/1.25 Those formulas are unsatisfiable: % 3.90/1.25 --------------------------------- % 3.90/1.25 % 3.90/1.25 Begin of proof % 3.90/1.26 | % 3.90/1.26 | ALPHA: (not_pow_of_2_5) implies: % 3.90/1.26 | (1) pow2(5) = 0 % 3.90/1.26 | (2) ! [v0: int] : (v0 = 1 | ~ (pow2(v0) = 0) | ($lesseq(2, v0) & ? [v1: % 3.90/1.26 | int] : ($product(2, v1) = v0 & pow2(v1) = 0))) % 3.90/1.26 | % 3.90/1.26 | GROUND_INST: instantiating (2) with 5, simplifying with (1) gives: % 3.90/1.26 | (3) $false % 3.90/1.26 | % 3.90/1.26 | CLOSE: (3) is inconsistent. % 3.90/1.26 | % 3.90/1.26 End of proof % 3.90/1.26 % SZS output end Proof for theBenchmark % 3.90/1.27 % 3.90/1.27 669ms %------------------------------------------------------------------------------