%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI621_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 : n009.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.46s 1.26s % Output : Proof 3.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ARI621_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.13/0.34 % Computer : n009.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:37:20 EDT 2023 % 0.13/0.34 % CPUTime : % 0.63/0.62 ________ _____ % 0.63/0.62 ___ __ \_________(_)________________________________ % 0.63/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.63/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.63/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.63/0.62 % 0.63/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.63/0.62 (2023-06-19) % 0.63/0.62 % 0.63/0.62 (c) Philipp Rümmer, 2009-2023 % 0.63/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.63/0.62 Amanda Stjerna. % 0.63/0.62 Free software under BSD-3-Clause. % 0.63/0.62 % 0.63/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.63/0.62 % 0.63/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.64 Running up to 7 provers in parallel. % 0.68/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.25/1.08 Prover 4: Preprocessing ... % 2.25/1.08 Prover 5: Preprocessing ... % 2.25/1.08 Prover 1: Preprocessing ... % 2.25/1.08 Prover 6: Preprocessing ... % 2.25/1.08 Prover 2: Preprocessing ... % 2.25/1.08 Prover 0: Preprocessing ... % 2.25/1.08 Prover 3: Preprocessing ... % 2.50/1.17 Prover 5: Proving ... % 2.50/1.18 Prover 2: Constructing countermodel ... % 3.10/1.18 Prover 4: Constructing countermodel ... % 3.10/1.18 Prover 3: Constructing countermodel ... % 3.10/1.18 Prover 1: Constructing countermodel ... % 3.10/1.18 Prover 6: Proving ... % 3.10/1.18 Prover 0: Proving ... % 3.46/1.25 Prover 1: Found proof (size 5) % 3.46/1.25 Prover 1: proved (607ms) % 3.46/1.25 Prover 4: Found proof (size 5) % 3.46/1.25 Prover 4: proved (606ms) % 3.46/1.25 Prover 3: stopped % 3.46/1.25 Prover 2: stopped % 3.46/1.25 Prover 0: proved (611ms) % 3.46/1.25 Prover 6: stopped % 3.46/1.26 Prover 5: proved (609ms) % 3.46/1.26 % 3.46/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.46/1.26 % 3.46/1.26 % SZS output start Proof for theBenchmark % 3.46/1.26 Assumptions after simplification: % 3.46/1.26 --------------------------------- % 3.46/1.26 % 3.46/1.26 (not_pow_of_2_10) % 3.46/1.29 pow2(12) = 0 & ! [v0: int] : ! [v1: int] : (v1 = 0 | ~ (pow2(v0) = v1) | ( % 3.46/1.29 ~ (v0 = 1) & ( ~ ($lesseq(2, v0)) | ! [v2: int] : ( ~ ($product(2, v2) = % 3.46/1.29 v0) | ~ (pow2(v2) = 0))))) & ! [v0: int] : (v0 = 1 | ~ (pow2(v0) % 3.46/1.29 = 0) | ($lesseq(2, v0) & ? [v1: int] : ($product(2, v1) = v0 & pow2(v1) = % 3.46/1.29 0))) % 3.46/1.29 % 3.46/1.29 Those formulas are unsatisfiable: % 3.46/1.29 --------------------------------- % 3.46/1.29 % 3.46/1.29 Begin of proof % 3.46/1.29 | % 3.46/1.30 | ALPHA: (not_pow_of_2_10) implies: % 3.46/1.30 | (1) pow2(12) = 0 % 3.46/1.30 | (2) ! [v0: int] : (v0 = 1 | ~ (pow2(v0) = 0) | ($lesseq(2, v0) & ? [v1: % 3.46/1.30 | int] : ($product(2, v1) = v0 & pow2(v1) = 0))) % 3.46/1.30 | % 3.46/1.30 | GROUND_INST: instantiating (2) with 12, simplifying with (1) gives: % 3.46/1.30 | (3) pow2(6) = 0 % 3.46/1.30 | % 3.46/1.30 | GROUND_INST: instantiating (2) with 6, simplifying with (3) gives: % 3.46/1.30 | (4) pow2(3) = 0 % 3.46/1.30 | % 3.46/1.30 | GROUND_INST: instantiating (2) with 3, simplifying with (4) gives: % 3.46/1.30 | (5) $false % 3.46/1.30 | % 3.46/1.30 | CLOSE: (5) is inconsistent. % 3.46/1.30 | % 3.46/1.30 End of proof % 3.46/1.30 % SZS output end Proof for theBenchmark % 3.46/1.30 % 3.46/1.30 679ms %------------------------------------------------------------------------------