%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI622_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 : n027.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:37 EDT 2023 % Result : Theorem 3.08s 1.29s % Output : Proof 4.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : ARI622_1 : TPTP v8.1.2. Released v5.1.0. % 0.08/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n027.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 19:03:08 EDT 2023 % 0.13/0.35 % CPUTime : % 0.52/0.65 ________ _____ % 0.52/0.65 ___ __ \_________(_)________________________________ % 0.52/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.52/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.52/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.52/0.65 % 0.52/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.52/0.65 (2023-06-19) % 0.52/0.65 % 0.52/0.65 (c) Philipp Rümmer, 2009-2023 % 0.52/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.52/0.65 Amanda Stjerna. % 0.52/0.65 Free software under BSD-3-Clause. % 0.52/0.65 % 0.52/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.52/0.65 % 0.52/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.52/0.67 Running up to 7 provers in parallel. % 0.52/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.52/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.52/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.52/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.52/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.52/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.52/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.34/1.08 Prover 6: Preprocessing ... % 2.34/1.08 Prover 0: Preprocessing ... % 2.34/1.08 Prover 3: Preprocessing ... % 2.34/1.08 Prover 5: Preprocessing ... % 2.34/1.08 Prover 4: Preprocessing ... % 2.34/1.08 Prover 2: Preprocessing ... % 2.34/1.08 Prover 1: Preprocessing ... % 2.62/1.18 Prover 2: Constructing countermodel ... % 2.62/1.18 Prover 4: Constructing countermodel ... % 2.62/1.18 Prover 5: Proving ... % 2.62/1.18 Prover 1: Constructing countermodel ... % 2.62/1.18 Prover 6: Proving ... % 2.62/1.19 Prover 3: Constructing countermodel ... % 2.62/1.20 Prover 0: Proving ... % 3.08/1.24 Prover 3: gave up % 3.08/1.24 Prover 1: gave up % 3.08/1.24 Prover 4: gave up % 3.08/1.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.08/1.25 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.08/1.25 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 3.08/1.26 Prover 7: Preprocessing ... % 3.08/1.26 Prover 8: Preprocessing ... % 3.08/1.27 Prover 9: Preprocessing ... % 3.08/1.28 Prover 7: Constructing countermodel ... % 3.08/1.28 Prover 2: proved (604ms) % 3.08/1.29 % 3.08/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.08/1.29 % 3.08/1.29 Prover 0: stopped % 3.08/1.29 Prover 6: stopped % 3.08/1.30 Prover 5: stopped % 3.08/1.30 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.08/1.30 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.08/1.30 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.08/1.30 Prover 8: Warning: ignoring some quantifiers % 3.08/1.30 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.00/1.30 Prover 10: Preprocessing ... % 4.00/1.30 Prover 8: Constructing countermodel ... % 4.00/1.31 Prover 11: Preprocessing ... % 4.00/1.31 Prover 13: Preprocessing ... % 4.00/1.32 Prover 16: Preprocessing ... % 4.00/1.32 Prover 8: gave up % 4.00/1.32 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 4.00/1.33 Prover 19: Preprocessing ... % 4.00/1.34 Prover 7: Found proof (size 6) % 4.00/1.34 Prover 7: proved (98ms) % 4.00/1.34 Prover 9: Constructing countermodel ... % 4.00/1.34 Prover 9: stopped % 4.00/1.34 Prover 13: Constructing countermodel ... % 4.00/1.34 Prover 10: Constructing countermodel ... % 4.00/1.34 Prover 16: Constructing countermodel ... % 4.32/1.35 Prover 13: stopped % 4.32/1.35 Prover 10: stopped % 4.32/1.35 Prover 16: stopped % 4.32/1.35 Prover 11: Constructing countermodel ... % 4.32/1.35 Prover 11: stopped % 4.32/1.37 Prover 19: Warning: ignoring some quantifiers % 4.32/1.38 Prover 19: Constructing countermodel ... % 4.32/1.38 Prover 19: stopped % 4.32/1.38 % 4.32/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.32/1.38 % 4.32/1.38 % SZS output start Proof for theBenchmark % 4.32/1.38 Assumptions after simplification: % 4.32/1.38 --------------------------------- % 4.32/1.38 % 4.32/1.39 (sum_of_pows_of_2_eq_10) % 4.32/1.39 pow2(1) & ! [v0: int] : ! [v1: int] : ( ~ ($product(2, v1) = v0) | ~ % 4.32/1.39 ($lesseq(2, v0)) | ~ pow2(v1) | pow2(v0)) & ! [v0: int] : (v0 = 1 | ~ % 4.32/1.39 pow2(v0) | ? [v1: int] : ($product(2, v1) = v0 & pow2(v1))) & ! [v0: int] % 4.32/1.39 : ( ~ ($lesseq(v0, 0) | ~ pow2(v0)) & ! [v0: int] : ( ~ pow2($difference(10, % 4.32/1.39 v0)) | ~ pow2(v0)) % 4.32/1.39 % 4.32/1.39 Those formulas are unsatisfiable: % 4.32/1.39 --------------------------------- % 4.32/1.39 % 4.32/1.39 Begin of proof % 4.32/1.39 | % 4.32/1.39 | ALPHA: (sum_of_pows_of_2_eq_10) implies: % 4.32/1.40 | (1) pow2(1) % 4.32/1.40 | (2) ! [v0: int] : ( ~ pow2($difference(10, v0)) | ~ pow2(v0)) % 4.32/1.40 | (3) ! [v0: int] : ! [v1: int] : ( ~ ($product(2, v1) = v0) | ~ % 4.32/1.40 | ($lesseq(2, v0)) | ~ pow2(v1) | pow2(v0)) % 4.32/1.40 | % 4.32/1.40 | GROUND_INST: instantiating (3) with 2, 1, simplifying with (1) gives: % 4.32/1.40 | (4) pow2(2) % 4.32/1.40 | % 4.32/1.40 | GROUND_INST: instantiating (3) with 4, 2, simplifying with (4) gives: % 4.32/1.40 | (5) pow2(4) % 4.32/1.40 | % 4.32/1.40 | GROUND_INST: instantiating (3) with 8, 4, simplifying with (5) gives: % 4.32/1.40 | (6) pow2(8) % 4.32/1.40 | % 4.32/1.40 | GROUND_INST: instantiating (2) with 2, simplifying with (4), (6) gives: % 4.32/1.40 | (7) $false % 4.32/1.40 | % 4.32/1.40 | CLOSE: (7) is inconsistent. % 4.32/1.40 | % 4.32/1.40 End of proof % 4.32/1.40 % SZS output end Proof for theBenchmark % 4.32/1.41 % 4.32/1.41 752ms %------------------------------------------------------------------------------