TSTP Solution File: DAT045_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : DAT045_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 : n006.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 22:19:00 EDT 2023
% Result : Theorem 7.82s 1.93s
% Output : Proof 11.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT045_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu Aug 24 14:02:23 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.61 ________ _____
% 0.18/0.61 ___ __ \_________(_)________________________________
% 0.18/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.61
% 0.18/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.61 (2023-06-19)
% 0.18/0.61
% 0.18/0.61 (c) Philipp Rümmer, 2009-2023
% 0.18/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.61 Amanda Stjerna.
% 0.18/0.61 Free software under BSD-3-Clause.
% 0.18/0.61
% 0.18/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.61
% 0.18/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.63 Running up to 7 provers in parallel.
% 0.18/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.90/1.20 Prover 4: Preprocessing ...
% 2.90/1.20 Prover 1: Preprocessing ...
% 3.11/1.25 Prover 0: Preprocessing ...
% 3.11/1.25 Prover 6: Preprocessing ...
% 3.11/1.25 Prover 3: Preprocessing ...
% 3.11/1.25 Prover 2: Preprocessing ...
% 3.11/1.26 Prover 5: Preprocessing ...
% 5.84/1.65 Prover 5: Proving ...
% 5.84/1.65 Prover 6: Proving ...
% 6.30/1.69 Prover 1: Constructing countermodel ...
% 6.30/1.70 Prover 3: Constructing countermodel ...
% 6.30/1.74 Prover 4: Constructing countermodel ...
% 6.85/1.78 Prover 2: Proving ...
% 6.85/1.79 Prover 0: Proving ...
% 7.82/1.93 Prover 2: proved (1284ms)
% 7.82/1.93 Prover 5: proved (1279ms)
% 7.82/1.93
% 7.82/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.82/1.93
% 7.82/1.93
% 7.82/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.82/1.93
% 7.82/1.93 Prover 0: stopped
% 7.82/1.93 Prover 3: proved (1287ms)
% 7.82/1.93
% 7.82/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.82/1.93
% 7.82/1.93 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.82/1.93 Prover 6: stopped
% 7.82/1.96 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.82/1.96 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.82/1.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.82/1.96 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.29/1.99 Prover 10: Preprocessing ...
% 8.29/1.99 Prover 8: Preprocessing ...
% 8.29/2.01 Prover 7: Preprocessing ...
% 8.29/2.01 Prover 13: Preprocessing ...
% 8.29/2.03 Prover 11: Preprocessing ...
% 8.90/2.11 Prover 13: Warning: ignoring some quantifiers
% 8.90/2.11 Prover 10: Constructing countermodel ...
% 8.90/2.13 Prover 8: Warning: ignoring some quantifiers
% 8.90/2.14 Prover 13: Constructing countermodel ...
% 8.90/2.15 Prover 8: Constructing countermodel ...
% 8.90/2.16 Prover 7: Constructing countermodel ...
% 10.35/2.28 Prover 1: Found proof (size 54)
% 10.35/2.28 Prover 1: proved (1637ms)
% 10.35/2.28 Prover 4: Found proof (size 60)
% 10.35/2.28 Prover 4: proved (1631ms)
% 10.35/2.28 Prover 8: stopped
% 10.35/2.28 Prover 13: stopped
% 10.35/2.28 Prover 10: Found proof (size 16)
% 10.35/2.28 Prover 10: proved (348ms)
% 10.35/2.28 Prover 7: stopped
% 10.48/2.31 Prover 11: Constructing countermodel ...
% 10.48/2.32 Prover 11: stopped
% 10.48/2.32
% 10.48/2.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.48/2.32
% 10.58/2.34 % SZS output start Proof for theBenchmark
% 10.58/2.34 Assumptions after simplification:
% 10.58/2.34 ---------------------------------
% 10.58/2.35
% 10.58/2.35 (ax3)
% 10.58/2.38 ! [v0: int] : ! [v1: collection] : ! [v2: collection] : ( ~ (remove(v0, v1)
% 10.58/2.38 = v2) | ~ (in(v0, v2) = 0) | ~ collection(v1)) & ! [v0: int] : ! [v1:
% 10.58/2.38 collection] : ! [v2: collection] : ( ~ (add(v0, v1) = v2) | ~
% 10.58/2.38 collection(v1) | ? [v3: any] : ? [v4: int] : ? [v5: int] : (count(v2) =
% 10.58/2.38 v4 & count(v1) = v5 & in(v0, v1) = v3 & ($difference(v5, v4) = -1 | v3 =
% 10.58/2.38 0))) & ! [v0: int] : ! [v1: collection] : ! [v2: collection] : ( ~
% 10.58/2.38 (add(v0, v1) = v2) | ~ collection(v1) | ? [v3: int] : ? [v4: int] : ?
% 10.58/2.38 [v5: any] : (count(v2) = v3 & count(v1) = v4 & in(v0, v1) = v5 & ( ~ (v5 =
% 10.58/2.38 0) | ~ ($difference(v4, v3) = -1))))
% 10.58/2.39
% 10.58/2.39 (ax4)
% 10.58/2.39 ! [v0: int] : ! [v1: collection] : ! [v2: int] : ! [v3: collection] : !
% 10.58/2.39 [v4: int] : (v4 = 0 | ~ (add(v2, v1) = v3) | ~ (in(v0, v3) = v4) | ~
% 10.58/2.39 collection(v1) | ( ~ (v2 = v0) & ? [v5: int] : ( ~ (v5 = 0) & in(v0, v1) =
% 10.58/2.39 v5))) & ! [v0: int] : ! [v1: collection] : ! [v2: int] : ! [v3:
% 10.58/2.40 collection] : (v2 = v0 | ~ (add(v2, v1) = v3) | ~ (in(v0, v3) = 0) | ~
% 10.58/2.40 collection(v1) | in(v0, v1) = 0) & ! [v0: int] : ! [v1: collection] : !
% 10.58/2.40 [v2: collection] : ( ~ (add(v0, v1) = v2) | ~ collection(v1) | ? [v3: any] :
% 10.58/2.40 ? [v4: int] : ? [v5: int] : (count(v2) = v4 & count(v1) = v5 & in(v0, v1)
% 10.58/2.40 = v3 & ( ~ (v3 = 0) | v5 = v4))) & ! [v0: int] : ! [v1: collection] : !
% 10.58/2.40 [v2: collection] : ( ~ (add(v0, v1) = v2) | ~ collection(v1) | ? [v3: int] :
% 10.58/2.40 ? [v4: int] : ? [v5: any] : (count(v2) = v3 & count(v1) = v4 & in(v0, v1)
% 10.58/2.40 = v5 & ( ~ (v4 = v3) | v5 = 0)))
% 10.58/2.40
% 10.58/2.40 (co1)
% 10.58/2.40 ? [v0: collection] : ? [v1: int] : ? [v2: collection] : ? [v3: int] : ?
% 10.58/2.40 [v4: int] : ($lesseq(v3, v4) & add(v1, v0) = v2 & count(v2) = v3 & count(v0) =
% 10.58/2.40 v4 & collection(v2) & collection(v0) & ! [v5: int] : ( ~ ($lesseq(v1, v5))
% 10.58/2.40 | ~ (in(v5, v0) = 0)))
% 10.58/2.40
% 10.58/2.40 (function-axioms)
% 10.58/2.41 ! [v0: collection] : ! [v1: collection] : ! [v2: collection] : ! [v3: int]
% 10.58/2.41 : (v1 = v0 | ~ (remove(v3, v2) = v1) | ~ (remove(v3, v2) = v0)) & ! [v0:
% 10.58/2.41 collection] : ! [v1: collection] : ! [v2: collection] : ! [v3: int] : (v1
% 10.58/2.41 = v0 | ~ (add(v3, v2) = v1) | ~ (add(v3, v2) = v0)) & ! [v0:
% 10.58/2.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: collection] : !
% 10.58/2.41 [v3: int] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0:
% 10.58/2.41 int] : ! [v1: int] : ! [v2: collection] : (v1 = v0 | ~ (count(v2) = v1) |
% 10.58/2.41 ~ (count(v2) = v0))
% 10.58/2.41
% 10.58/2.41 Further assumptions not needed in the proof:
% 10.58/2.41 --------------------------------------------
% 10.58/2.41 ax1, ax2, ax5, ax6, ax7
% 10.58/2.41
% 10.58/2.41 Those formulas are unsatisfiable:
% 10.58/2.41 ---------------------------------
% 10.58/2.41
% 10.58/2.41 Begin of proof
% 10.58/2.41 |
% 10.58/2.41 | ALPHA: (ax3) implies:
% 10.58/2.41 | (1) ! [v0: int] : ! [v1: collection] : ! [v2: collection] : ( ~ (add(v0,
% 10.58/2.41 | v1) = v2) | ~ collection(v1) | ? [v3: int] : ? [v4: int] : ?
% 10.58/2.41 | [v5: any] : (count(v2) = v3 & count(v1) = v4 & in(v0, v1) = v5 & ( ~
% 10.58/2.41 | (v5 = 0) | ~ ($difference(v4, v3) = -1))))
% 10.58/2.42 | (2) ! [v0: int] : ! [v1: collection] : ! [v2: collection] : ( ~ (add(v0,
% 10.58/2.42 | v1) = v2) | ~ collection(v1) | ? [v3: any] : ? [v4: int] : ?
% 10.58/2.42 | [v5: int] : (count(v2) = v4 & count(v1) = v5 & in(v0, v1) = v3 &
% 10.58/2.42 | ($difference(v5, v4) = -1 | v3 = 0)))
% 10.58/2.42 |
% 10.58/2.42 | ALPHA: (ax4) implies:
% 11.04/2.42 | (3) ! [v0: int] : ! [v1: collection] : ! [v2: collection] : ( ~ (add(v0,
% 11.04/2.42 | v1) = v2) | ~ collection(v1) | ? [v3: int] : ? [v4: int] : ?
% 11.04/2.42 | [v5: any] : (count(v2) = v3 & count(v1) = v4 & in(v0, v1) = v5 & ( ~
% 11.04/2.42 | (v4 = v3) | v5 = 0)))
% 11.04/2.42 | (4) ! [v0: int] : ! [v1: collection] : ! [v2: collection] : ( ~ (add(v0,
% 11.04/2.42 | v1) = v2) | ~ collection(v1) | ? [v3: any] : ? [v4: int] : ?
% 11.04/2.42 | [v5: int] : (count(v2) = v4 & count(v1) = v5 & in(v0, v1) = v3 & ( ~
% 11.04/2.42 | (v3 = 0) | v5 = v4)))
% 11.04/2.42 |
% 11.04/2.42 | ALPHA: (function-axioms) implies:
% 11.04/2.42 | (5) ! [v0: int] : ! [v1: int] : ! [v2: collection] : (v1 = v0 | ~
% 11.04/2.42 | (count(v2) = v1) | ~ (count(v2) = v0))
% 11.04/2.43 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 11.04/2.43 | collection] : ! [v3: int] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~
% 11.04/2.43 | (in(v3, v2) = v0))
% 11.04/2.43 |
% 11.04/2.43 | DELTA: instantiating (co1) with fresh symbols all_13_0, all_13_1, all_13_2,
% 11.04/2.43 | all_13_3, all_13_4 gives:
% 11.04/2.43 | (7) $lesseq(all_13_1, all_13_0) & add(all_13_3, all_13_4) = all_13_2 &
% 11.04/2.43 | count(all_13_2) = all_13_1 & count(all_13_4) = all_13_0 &
% 11.04/2.43 | collection(all_13_2) & collection(all_13_4) & ! [v0: int] : ( ~
% 11.04/2.43 | ($lesseq(all_13_3, v0)) | ~ (in(v0, all_13_4) = 0))
% 11.04/2.43 |
% 11.04/2.43 | ALPHA: (7) implies:
% 11.04/2.43 | (8) $lesseq(all_13_1, all_13_0)
% 11.04/2.43 | (9) collection(all_13_4)
% 11.04/2.43 | (10) count(all_13_4) = all_13_0
% 11.04/2.43 | (11) count(all_13_2) = all_13_1
% 11.04/2.43 | (12) add(all_13_3, all_13_4) = all_13_2
% 11.04/2.43 | (13) ! [v0: int] : ( ~ ($lesseq(all_13_3, v0)) | ~ (in(v0, all_13_4) =
% 11.04/2.43 | 0))
% 11.04/2.43 |
% 11.04/2.43 | GROUND_INST: instantiating (4) with all_13_3, all_13_4, all_13_2, simplifying
% 11.04/2.43 | with (9), (12) gives:
% 11.04/2.43 | (14) ? [v0: any] : ? [v1: int] : ? [v2: int] : (count(all_13_2) = v1 &
% 11.04/2.43 | count(all_13_4) = v2 & in(all_13_3, all_13_4) = v0 & ( ~ (v0 = 0) |
% 11.04/2.44 | v2 = v1))
% 11.04/2.44 |
% 11.04/2.44 | GROUND_INST: instantiating (2) with all_13_3, all_13_4, all_13_2, simplifying
% 11.04/2.44 | with (9), (12) gives:
% 11.04/2.44 | (15) ? [v0: any] : ? [v1: int] : ? [v2: int] : (count(all_13_2) = v1 &
% 11.04/2.44 | count(all_13_4) = v2 & in(all_13_3, all_13_4) = v0 &
% 11.04/2.44 | ($difference(v2, v1) = -1 | v0 = 0))
% 11.04/2.44 |
% 11.04/2.44 | GROUND_INST: instantiating (1) with all_13_3, all_13_4, all_13_2, simplifying
% 11.04/2.44 | with (9), (12) gives:
% 11.04/2.44 | (16) ? [v0: int] : ? [v1: int] : ? [v2: any] : (count(all_13_2) = v0 &
% 11.04/2.44 | count(all_13_4) = v1 & in(all_13_3, all_13_4) = v2 & ( ~ (v2 = 0) |
% 11.04/2.44 | ~ ($difference(v1, v0) = -1)))
% 11.04/2.44 |
% 11.04/2.44 | GROUND_INST: instantiating (3) with all_13_3, all_13_4, all_13_2, simplifying
% 11.04/2.44 | with (9), (12) gives:
% 11.04/2.44 | (17) ? [v0: int] : ? [v1: int] : ? [v2: any] : (count(all_13_2) = v0 &
% 11.04/2.44 | count(all_13_4) = v1 & in(all_13_3, all_13_4) = v2 & ( ~ (v1 = v0) |
% 11.04/2.44 | v2 = 0))
% 11.04/2.44 |
% 11.04/2.44 | DELTA: instantiating (17) with fresh symbols all_23_0, all_23_1, all_23_2
% 11.04/2.44 | gives:
% 11.04/2.44 | (18) count(all_13_2) = all_23_2 & count(all_13_4) = all_23_1 & in(all_13_3,
% 11.04/2.44 | all_13_4) = all_23_0 & ( ~ (all_23_1 = all_23_2) | all_23_0 = 0)
% 11.04/2.44 |
% 11.04/2.44 | ALPHA: (18) implies:
% 11.04/2.44 | (19) in(all_13_3, all_13_4) = all_23_0
% 11.04/2.44 | (20) count(all_13_2) = all_23_2
% 11.04/2.44 |
% 11.04/2.44 | DELTA: instantiating (16) with fresh symbols all_25_0, all_25_1, all_25_2
% 11.04/2.44 | gives:
% 11.04/2.44 | (21) count(all_13_2) = all_25_2 & count(all_13_4) = all_25_1 & in(all_13_3,
% 11.04/2.44 | all_13_4) = all_25_0 & ( ~ (all_25_0 = 0) | ~
% 11.04/2.44 | ($difference(all_25_1, all_25_2) = -1))
% 11.04/2.44 |
% 11.04/2.44 | ALPHA: (21) implies:
% 11.04/2.44 | (22) in(all_13_3, all_13_4) = all_25_0
% 11.04/2.44 | (23) count(all_13_4) = all_25_1
% 11.04/2.45 | (24) count(all_13_2) = all_25_2
% 11.04/2.45 |
% 11.04/2.45 | DELTA: instantiating (15) with fresh symbols all_27_0, all_27_1, all_27_2
% 11.04/2.45 | gives:
% 11.04/2.45 | (25) count(all_13_2) = all_27_1 & count(all_13_4) = all_27_0 & in(all_13_3,
% 11.04/2.45 | all_13_4) = all_27_2 & ($difference(all_27_0, all_27_1) = -1 |
% 11.04/2.45 | all_27_2 = 0)
% 11.04/2.45 |
% 11.04/2.45 | ALPHA: (25) implies:
% 11.04/2.45 | (26) in(all_13_3, all_13_4) = all_27_2
% 11.04/2.45 | (27) count(all_13_4) = all_27_0
% 11.04/2.45 | (28) count(all_13_2) = all_27_1
% 11.04/2.45 | (29) $difference(all_27_0, all_27_1) = -1 | all_27_2 = 0
% 11.04/2.45 |
% 11.04/2.45 | DELTA: instantiating (14) with fresh symbols all_29_0, all_29_1, all_29_2
% 11.04/2.45 | gives:
% 11.04/2.45 | (30) count(all_13_2) = all_29_1 & count(all_13_4) = all_29_0 & in(all_13_3,
% 11.04/2.45 | all_13_4) = all_29_2 & ( ~ (all_29_2 = 0) | all_29_0 = all_29_1)
% 11.04/2.45 |
% 11.04/2.45 | ALPHA: (30) implies:
% 11.04/2.45 | (31) in(all_13_3, all_13_4) = all_29_2
% 11.04/2.45 | (32) count(all_13_2) = all_29_1
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (6) with all_23_0, all_27_2, all_13_4, all_13_3,
% 11.04/2.45 | simplifying with (19), (26) gives:
% 11.04/2.45 | (33) all_27_2 = all_23_0
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (6) with all_27_2, all_29_2, all_13_4, all_13_3,
% 11.04/2.45 | simplifying with (26), (31) gives:
% 11.04/2.45 | (34) all_29_2 = all_27_2
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (6) with all_25_0, all_29_2, all_13_4, all_13_3,
% 11.04/2.45 | simplifying with (22), (31) gives:
% 11.04/2.45 | (35) all_29_2 = all_25_0
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (5) with all_13_0, all_27_0, all_13_4, simplifying
% 11.04/2.45 | with (10), (27) gives:
% 11.04/2.45 | (36) all_27_0 = all_13_0
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (5) with all_25_1, all_27_0, all_13_4, simplifying
% 11.04/2.45 | with (23), (27) gives:
% 11.04/2.45 | (37) all_27_0 = all_25_1
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (5) with all_23_2, all_27_1, all_13_2, simplifying
% 11.04/2.45 | with (20), (28) gives:
% 11.04/2.45 | (38) all_27_1 = all_23_2
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (5) with all_13_1, all_29_1, all_13_2, simplifying
% 11.04/2.45 | with (11), (32) gives:
% 11.04/2.45 | (39) all_29_1 = all_13_1
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (5) with all_27_1, all_29_1, all_13_2, simplifying
% 11.04/2.45 | with (28), (32) gives:
% 11.04/2.45 | (40) all_29_1 = all_27_1
% 11.04/2.45 |
% 11.04/2.45 | GROUND_INST: instantiating (5) with all_25_2, all_29_1, all_13_2, simplifying
% 11.04/2.46 | with (24), (32) gives:
% 11.04/2.46 | (41) all_29_1 = all_25_2
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (40), (41) imply:
% 11.04/2.46 | (42) all_27_1 = all_25_2
% 11.04/2.46 |
% 11.04/2.46 | SIMP: (42) implies:
% 11.04/2.46 | (43) all_27_1 = all_25_2
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (39), (41) imply:
% 11.04/2.46 | (44) all_25_2 = all_13_1
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (34), (35) imply:
% 11.04/2.46 | (45) all_27_2 = all_25_0
% 11.04/2.46 |
% 11.04/2.46 | SIMP: (45) implies:
% 11.04/2.46 | (46) all_27_2 = all_25_0
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (36), (37) imply:
% 11.04/2.46 | (47) all_25_1 = all_13_0
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (38), (43) imply:
% 11.04/2.46 | (48) all_25_2 = all_23_2
% 11.04/2.46 |
% 11.04/2.46 | SIMP: (48) implies:
% 11.04/2.46 | (49) all_25_2 = all_23_2
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (33), (46) imply:
% 11.04/2.46 | (50) all_25_0 = all_23_0
% 11.04/2.46 |
% 11.04/2.46 | SIMP: (50) implies:
% 11.04/2.46 | (51) all_25_0 = all_23_0
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (44), (49) imply:
% 11.04/2.46 | (52) all_23_2 = all_13_1
% 11.04/2.46 |
% 11.04/2.46 | SIMP: (52) implies:
% 11.04/2.46 | (53) all_23_2 = all_13_1
% 11.04/2.46 |
% 11.04/2.46 | COMBINE_EQS: (38), (53) imply:
% 11.04/2.46 | (54) all_27_1 = all_13_1
% 11.04/2.46 |
% 11.04/2.46 | BETA: splitting (29) gives:
% 11.04/2.46 |
% 11.04/2.46 | Case 1:
% 11.04/2.46 | |
% 11.04/2.46 | | (55) all_27_2 = 0
% 11.04/2.46 | |
% 11.04/2.46 | | COMBINE_EQS: (33), (55) imply:
% 11.04/2.46 | | (56) all_23_0 = 0
% 11.04/2.46 | |
% 11.04/2.46 | | SIMP: (56) implies:
% 11.04/2.46 | | (57) all_23_0 = 0
% 11.04/2.46 | |
% 11.04/2.46 | | REDUCE: (19), (57) imply:
% 11.04/2.46 | | (58) in(all_13_3, all_13_4) = 0
% 11.04/2.46 | |
% 11.04/2.46 | | GROUND_INST: instantiating (13) with all_13_3, simplifying with (58) gives:
% 11.04/2.46 | | (59) $false
% 11.04/2.46 | |
% 11.04/2.46 | | CLOSE: (59) is inconsistent.
% 11.04/2.46 | |
% 11.04/2.46 | Case 2:
% 11.04/2.46 | |
% 11.04/2.46 | | (60) $difference(all_27_0, all_27_1) = -1
% 11.04/2.46 | |
% 11.04/2.47 | | COMBINE_EQS: (36), (60) imply:
% 11.04/2.47 | | (61) $difference(all_27_1, all_13_0) = 1
% 11.04/2.47 | |
% 11.04/2.47 | | SIMP: (61) implies:
% 11.04/2.47 | | (62) $difference(all_27_1, all_13_0) = 1
% 11.04/2.47 | |
% 11.04/2.47 | | COMBINE_EQS: (54), (62) imply:
% 11.04/2.47 | | (63) $difference(all_13_0, all_13_1) = -1
% 11.04/2.47 | |
% 11.04/2.47 | | SIMP: (63) implies:
% 11.04/2.47 | | (64) $difference(all_13_0, all_13_1) = -1
% 11.04/2.47 | |
% 11.04/2.47 | | REDUCE: (8), (64) imply:
% 11.04/2.47 | | (65) $false
% 11.04/2.47 | |
% 11.04/2.47 | | CLOSE: (65) is inconsistent.
% 11.04/2.47 | |
% 11.04/2.47 | End of split
% 11.04/2.47 |
% 11.04/2.47 End of proof
% 11.04/2.47 % SZS output end Proof for theBenchmark
% 11.04/2.47
% 11.04/2.47 1851ms
%------------------------------------------------------------------------------