TSTP Solution File: ARI620_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI620_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 : 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 17:48:36 EDT 2023
% Result : Theorem 3.38s 1.19s
% Output : Proof 3.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : ARI620_1 : TPTP v8.1.2. Released v5.1.0.
% 0.07/0.16 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.16/0.37 % Computer : n005.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Aug 29 18:38:08 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.22/0.63 ________ _____
% 0.22/0.63 ___ __ \_________(_)________________________________
% 0.22/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.22/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.22/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.22/0.63
% 0.22/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.22/0.63 (2023-06-19)
% 0.22/0.63
% 0.22/0.63 (c) Philipp Rümmer, 2009-2023
% 0.22/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.22/0.63 Amanda Stjerna.
% 0.22/0.63 Free software under BSD-3-Clause.
% 0.22/0.63
% 0.22/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.22/0.63
% 0.22/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.22/0.64 Running up to 7 provers in parallel.
% 0.22/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.22/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.22/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.22/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.22/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.22/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.22/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.16/1.02 Prover 6: Preprocessing ...
% 2.16/1.02 Prover 1: Preprocessing ...
% 2.16/1.02 Prover 0: Preprocessing ...
% 2.16/1.02 Prover 4: Preprocessing ...
% 2.16/1.03 Prover 3: Preprocessing ...
% 2.16/1.03 Prover 5: Preprocessing ...
% 2.16/1.03 Prover 2: Preprocessing ...
% 2.29/1.11 Prover 5: Proving ...
% 2.29/1.12 Prover 2: Constructing countermodel ...
% 2.29/1.12 Prover 1: Constructing countermodel ...
% 2.29/1.12 Prover 0: Proving ...
% 2.29/1.12 Prover 3: Constructing countermodel ...
% 2.29/1.12 Prover 6: Proving ...
% 2.29/1.12 Prover 4: Constructing countermodel ...
% 2.96/1.19 Prover 2: proved (539ms)
% 3.38/1.19
% 3.38/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.38/1.19
% 3.38/1.20 Prover 0: stopped
% 3.38/1.20 Prover 5: stopped
% 3.38/1.20 Prover 6: stopped
% 3.38/1.20 Prover 3: stopped
% 3.38/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.38/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.38/1.20 Prover 4: gave up
% 3.38/1.21 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.38/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.38/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.38/1.21 Prover 10: Preprocessing ...
% 3.38/1.21 Prover 7: Preprocessing ...
% 3.38/1.21 Prover 8: Preprocessing ...
% 3.38/1.22 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 3.38/1.22 Prover 1: gave up
% 3.38/1.22 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 3.38/1.22 Prover 16: Preprocessing ...
% 3.38/1.23 Prover 13: Preprocessing ...
% 3.38/1.23 Prover 10: Constructing countermodel ...
% 3.38/1.23 Prover 11: Preprocessing ...
% 3.38/1.23 Prover 19: Preprocessing ...
% 3.38/1.24 Prover 8: Warning: ignoring some quantifiers
% 3.38/1.25 Prover 13: Constructing countermodel ...
% 3.38/1.25 Prover 8: Constructing countermodel ...
% 3.38/1.25 Prover 7: Constructing countermodel ...
% 3.38/1.25 Prover 16: Constructing countermodel ...
% 3.93/1.26 Prover 11: Constructing countermodel ...
% 3.93/1.27 Prover 8: gave up
% 3.93/1.28 Prover 10: Found proof (size 5)
% 3.93/1.28 Prover 10: proved (78ms)
% 3.93/1.28 Prover 16: stopped
% 3.93/1.28 Prover 13: stopped
% 3.93/1.28 Prover 7: stopped
% 3.93/1.28 Prover 11: stopped
% 3.93/1.29 Prover 19: Warning: ignoring some quantifiers
% 3.93/1.29 Prover 19: Constructing countermodel ...
% 3.93/1.29 Prover 19: stopped
% 3.93/1.29
% 3.93/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.93/1.29
% 3.93/1.30 % SZS output start Proof for theBenchmark
% 3.93/1.30 Assumptions after simplification:
% 3.93/1.30 ---------------------------------
% 3.93/1.30
% 3.93/1.30 (pow_of_2_8)
% 3.93/1.31 pow2(1) & ~ pow2(8) & ! [v0: int] : ! [v1: int] : ( ~ ($product(2, v1) =
% 3.93/1.31 v0) | ~ ($lesseq(2, v0)) | ~ pow2(v1) | pow2(v0)) & ! [v0: int] : (v0 =
% 3.93/1.31 1 | ~ pow2(v0) | ? [v1: int] : ($product(2, v1) = v0 & pow2(v1))) & !
% 3.93/1.31 [v0: int] : ( ~ ($lesseq(v0, 0) | ~ pow2(v0))
% 3.93/1.31
% 3.93/1.31 Those formulas are unsatisfiable:
% 3.93/1.31 ---------------------------------
% 3.93/1.31
% 3.93/1.31 Begin of proof
% 3.93/1.31 |
% 3.93/1.31 | ALPHA: (pow_of_2_8) implies:
% 3.93/1.31 | (1) ~ pow2(8)
% 3.93/1.31 | (2) pow2(1)
% 3.93/1.31 | (3) ! [v0: int] : ! [v1: int] : ( ~ ($product(2, v1) = v0) | ~
% 3.93/1.31 | ($lesseq(2, v0)) | ~ pow2(v1) | pow2(v0))
% 3.93/1.31 |
% 3.93/1.31 | GROUND_INST: instantiating (3) with 2, 1, simplifying with (2) gives:
% 3.93/1.31 | (4) pow2(2)
% 3.93/1.31 |
% 3.93/1.31 | GROUND_INST: instantiating (3) with 4, 2, simplifying with (4) gives:
% 3.93/1.31 | (5) pow2(4)
% 3.93/1.31 |
% 3.93/1.31 | GROUND_INST: instantiating (3) with 8, 4, simplifying with (1), (5) gives:
% 3.93/1.31 | (6) $false
% 3.93/1.32 |
% 3.93/1.32 | CLOSE: (6) is inconsistent.
% 3.93/1.32 |
% 3.93/1.32 End of proof
% 3.93/1.32 % SZS output end Proof for theBenchmark
% 3.93/1.32
% 3.93/1.32 685ms
%------------------------------------------------------------------------------