TSTP Solution File: ARI185_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI185_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 : n029.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:12 EDT 2023
% Result : Theorem 2.76s 1.16s
% Output : Proof 3.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI185_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 18:45:27 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.61/0.60 ________ _____
% 0.61/0.60 ___ __ \_________(_)________________________________
% 0.61/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.61/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.61/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.61/0.60
% 0.61/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.61/0.60 (2023-06-19)
% 0.61/0.60
% 0.61/0.60 (c) Philipp Rümmer, 2009-2023
% 0.61/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.61/0.60 Amanda Stjerna.
% 0.61/0.60 Free software under BSD-3-Clause.
% 0.61/0.60
% 0.61/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.61/0.60
% 0.61/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.67/0.61 Running up to 7 provers in parallel.
% 0.67/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.92/1.02 Prover 3: Preprocessing ...
% 1.92/1.02 Prover 2: Preprocessing ...
% 1.92/1.02 Prover 0: Preprocessing ...
% 1.92/1.02 Prover 1: Preprocessing ...
% 1.92/1.02 Prover 6: Preprocessing ...
% 1.92/1.02 Prover 4: Preprocessing ...
% 1.92/1.02 Prover 5: Preprocessing ...
% 2.31/1.08 Prover 3: Constructing countermodel ...
% 2.31/1.08 Prover 4: Constructing countermodel ...
% 2.31/1.08 Prover 1: Constructing countermodel ...
% 2.31/1.08 Prover 0: Proving ...
% 2.31/1.08 Prover 6: Proving ...
% 2.31/1.08 Prover 2: Proving ...
% 2.31/1.08 Prover 5: Proving ...
% 2.76/1.15 Prover 3: proved (537ms)
% 2.76/1.16
% 2.76/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.76/1.16
% 2.76/1.16 Prover 6: stopped
% 2.76/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.76/1.16 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.76/1.16 Prover 2: proved (543ms)
% 2.76/1.16
% 2.76/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.76/1.16
% 2.76/1.16 Prover 0: proved (544ms)
% 2.76/1.16
% 2.76/1.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.76/1.16
% 3.27/1.17 Prover 5: proved (541ms)
% 3.27/1.17
% 3.27/1.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/1.17
% 3.27/1.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.27/1.17 Prover 8: Preprocessing ...
% 3.27/1.17 Prover 7: Preprocessing ...
% 3.27/1.17 Prover 10: Preprocessing ...
% 3.27/1.17 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.27/1.17 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.27/1.18 Prover 1: Found proof (size 5)
% 3.27/1.18 Prover 1: proved (562ms)
% 3.27/1.18 Prover 11: Preprocessing ...
% 3.36/1.18 Prover 8: Warning: ignoring some quantifiers
% 3.36/1.18 Prover 13: Preprocessing ...
% 3.36/1.18 Prover 10: Constructing countermodel ...
% 3.36/1.18 Prover 8: Constructing countermodel ...
% 3.36/1.18 Prover 10: stopped
% 3.36/1.19 Prover 4: Found proof (size 5)
% 3.36/1.19 Prover 4: proved (568ms)
% 3.36/1.19 Prover 8: stopped
% 3.36/1.19 Prover 7: Constructing countermodel ...
% 3.36/1.19 Prover 7: stopped
% 3.36/1.19 Prover 11: Constructing countermodel ...
% 3.36/1.19 Prover 11: stopped
% 3.36/1.20 Prover 13: Warning: ignoring some quantifiers
% 3.36/1.20 Prover 13: Constructing countermodel ...
% 3.36/1.20 Prover 13: stopped
% 3.36/1.20
% 3.36/1.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.20
% 3.36/1.20 % SZS output start Proof for theBenchmark
% 3.36/1.21 Assumptions after simplification:
% 3.36/1.21 ---------------------------------
% 3.36/1.21
% 3.36/1.21 (co1)
% 3.56/1.24 ? [v0: int] : ($lesseq(v0, 1) & f(3) = v0 & ! [v1: int] : ! [v2: int] : ( ~
% 3.56/1.24 ($lesseq(v2, 1)) | ~ (f(v1) = v2)))
% 3.56/1.24
% 3.56/1.24 Those formulas are unsatisfiable:
% 3.56/1.24 ---------------------------------
% 3.56/1.24
% 3.56/1.24 Begin of proof
% 3.56/1.24 |
% 3.56/1.25 | DELTA: instantiating (co1) with fresh symbol all_3_0 gives:
% 3.56/1.25 | (1) $lesseq(all_3_0, 1) & f(3) = all_3_0 & ! [v0: int] : ! [v1: int] : (
% 3.56/1.25 | ~ ($lesseq(v1, 1)) | ~ (f(v0) = v1))
% 3.56/1.25 |
% 3.56/1.25 | ALPHA: (1) implies:
% 3.56/1.25 | (2) $lesseq(all_3_0, 1)
% 3.56/1.25 | (3) f(3) = all_3_0
% 3.56/1.25 | (4) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 1)) | ~ (f(v0) = v1))
% 3.56/1.25 |
% 3.56/1.25 | GROUND_INST: instantiating (4) with 3, all_3_0, simplifying with (3) gives:
% 3.56/1.25 | (5) $lesseq(2, all_3_0)
% 3.56/1.25 |
% 3.56/1.25 | COMBINE_INEQS: (2), (5) imply:
% 3.56/1.25 | (6) $false
% 3.56/1.25 |
% 3.56/1.25 | CLOSE: (6) is inconsistent.
% 3.56/1.25 |
% 3.56/1.25 End of proof
% 3.56/1.25 % SZS output end Proof for theBenchmark
% 3.56/1.25
% 3.56/1.25 656ms
%------------------------------------------------------------------------------