TSTP Solution File: ARI609_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI609_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:34 EDT 2023
% Result : Theorem 3.25s 1.18s
% Output : Proof 3.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI609_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 : n022.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 17:49:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.65/0.64 ________ _____
% 0.65/0.64 ___ __ \_________(_)________________________________
% 0.65/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.65/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.65/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.65/0.64
% 0.65/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.65/0.64 (2023-06-19)
% 0.65/0.64
% 0.65/0.64 (c) Philipp Rümmer, 2009-2023
% 0.65/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.65/0.64 Amanda Stjerna.
% 0.65/0.64 Free software under BSD-3-Clause.
% 0.65/0.64
% 0.65/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.65/0.64
% 0.65/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.65/0.66 Running up to 7 provers in parallel.
% 0.65/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.65/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.65/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.65/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.65/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.65/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.65/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.13/1.01 Prover 1: Preprocessing ...
% 2.13/1.01 Prover 4: Preprocessing ...
% 2.13/1.06 Prover 2: Preprocessing ...
% 2.13/1.06 Prover 0: Preprocessing ...
% 2.13/1.06 Prover 5: Preprocessing ...
% 2.13/1.06 Prover 3: Preprocessing ...
% 2.13/1.06 Prover 6: Preprocessing ...
% 2.58/1.10 Prover 4: Constructing countermodel ...
% 2.58/1.10 Prover 1: Constructing countermodel ...
% 2.58/1.10 Prover 5: Proving ...
% 2.58/1.10 Prover 6: Proving ...
% 2.58/1.11 Prover 0: Proving ...
% 2.58/1.11 Prover 2: Proving ...
% 2.58/1.11 Prover 3: Constructing countermodel ...
% 3.25/1.18 Prover 3: proved (509ms)
% 3.25/1.18
% 3.25/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.25/1.18
% 3.25/1.18 Prover 6: stopped
% 3.25/1.18 Prover 5: stopped
% 3.25/1.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.25/1.19 Prover 2: stopped
% 3.25/1.19 Prover 0: proved (518ms)
% 3.25/1.19
% 3.25/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.25/1.19
% 3.25/1.19 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.25/1.19 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.25/1.19 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.25/1.19 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.25/1.20 Prover 7: Preprocessing ...
% 3.25/1.20 Prover 10: Preprocessing ...
% 3.41/1.20 Prover 8: Preprocessing ...
% 3.41/1.20 Prover 13: Preprocessing ...
% 3.41/1.21 Prover 11: Preprocessing ...
% 3.41/1.22 Prover 7: Constructing countermodel ...
% 3.41/1.22 Prover 8: Warning: ignoring some quantifiers
% 3.41/1.22 Prover 8: Constructing countermodel ...
% 3.41/1.22 Prover 13: Warning: ignoring some quantifiers
% 3.41/1.23 Prover 13: Constructing countermodel ...
% 3.41/1.23 Prover 11: Constructing countermodel ...
% 3.41/1.23 Prover 10: Constructing countermodel ...
% 3.61/1.25 Prover 4: Found proof (size 9)
% 3.61/1.25 Prover 4: proved (574ms)
% 3.61/1.25 Prover 8: stopped
% 3.61/1.25 Prover 11: stopped
% 3.61/1.25 Prover 10: stopped
% 3.61/1.25 Prover 7: stopped
% 3.61/1.25 Prover 1: Found proof (size 9)
% 3.61/1.25 Prover 1: proved (579ms)
% 3.61/1.25 Prover 13: stopped
% 3.61/1.25
% 3.61/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.61/1.25
% 3.61/1.25 % SZS output start Proof for theBenchmark
% 3.61/1.26 Assumptions after simplification:
% 3.61/1.26 ---------------------------------
% 3.61/1.26
% 3.61/1.26 (f_mon_implies_f_a_b_1)
% 3.61/1.29 ? [v0: int] : ? [v1: int] : ($lesseq(1, $difference(v1, v0)) & $lesseq(b, a)
% 3.61/1.29 & f(b) = v1 & f(a) = v0 & ! [v2: int] : ! [v3: int] : ! [v4: int] : !
% 3.61/1.29 [v5: int] : ( ~ ($lesseq(1, $difference(v5, v4))) | ~ ($lesseq(v2, v3)) |
% 3.61/1.29 ~ (f(v3) = v4) | ~ (f(v2) = v5)))
% 3.61/1.29
% 3.61/1.29 Those formulas are unsatisfiable:
% 3.61/1.29 ---------------------------------
% 3.61/1.29
% 3.61/1.29 Begin of proof
% 3.61/1.29 |
% 3.61/1.29 | DELTA: instantiating (f_mon_implies_f_a_b_1) with fresh symbols all_3_0,
% 3.61/1.29 | all_3_1 gives:
% 3.61/1.29 | (1) $lesseq(1, $difference(all_3_0, all_3_1)) & $lesseq(b, a) & f(b) =
% 3.61/1.29 | all_3_0 & f(a) = all_3_1 & ! [v0: int] : ! [v1: int] : ! [v2: int] :
% 3.61/1.29 | ! [v3: int] : ( ~ ($lesseq(1, $difference(v3, v2))) | ~ ($lesseq(v0,
% 3.61/1.29 | v1)) | ~ (f(v1) = v2) | ~ (f(v0) = v3))
% 3.61/1.29 |
% 3.61/1.29 | ALPHA: (1) implies:
% 3.61/1.30 | (2) $lesseq(b, a)
% 3.61/1.30 | (3) $lesseq(1, $difference(all_3_0, all_3_1))
% 3.61/1.30 | (4) f(a) = all_3_1
% 3.61/1.30 | (5) f(b) = all_3_0
% 3.61/1.30 | (6) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ( ~
% 3.61/1.30 | ($lesseq(1, $difference(v3, v2))) | ~ ($lesseq(v0, v1)) | ~ (f(v1)
% 3.61/1.30 | = v2) | ~ (f(v0) = v3))
% 3.61/1.30 |
% 3.61/1.30 | GROUND_INST: instantiating (6) with b, a, all_3_1, all_3_0, simplifying with
% 3.61/1.30 | (4), (5) gives:
% 3.61/1.30 | (7) ~ ($lesseq(1, $difference(all_3_0, all_3_1))) | ~ ($lesseq(b, a))
% 3.61/1.30 |
% 3.61/1.30 | BETA: splitting (7) gives:
% 3.61/1.30 |
% 3.61/1.30 | Case 1:
% 3.61/1.30 | |
% 3.61/1.30 | | (8) $lesseq(1, $difference(b, a))
% 3.61/1.30 | |
% 3.61/1.30 | | COMBINE_INEQS: (2), (8) imply:
% 3.61/1.30 | | (9) $false
% 3.61/1.30 | |
% 3.61/1.30 | | CLOSE: (9) is inconsistent.
% 3.61/1.30 | |
% 3.61/1.30 | Case 2:
% 3.61/1.30 | |
% 3.61/1.30 | | (10) $lesseq(all_3_0, all_3_1)
% 3.61/1.30 | |
% 3.61/1.30 | | COMBINE_INEQS: (3), (10) imply:
% 3.61/1.30 | | (11) $false
% 3.61/1.30 | |
% 3.61/1.30 | | CLOSE: (11) is inconsistent.
% 3.61/1.30 | |
% 3.61/1.30 | End of split
% 3.61/1.30 |
% 3.61/1.30 End of proof
% 3.61/1.30 % SZS output end Proof for theBenchmark
% 3.61/1.30
% 3.61/1.30 662ms
%------------------------------------------------------------------------------