TSTP Solution File: NUM464+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n019.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 : Thu Aug 31 11:47:55 EDT 2023
% Result : Theorem 8.10s 1.90s
% Output : Proof 10.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM464+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n019.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 : Fri Aug 25 15:45:58 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.60 ________ _____
% 0.20/0.60 ___ __ \_________(_)________________________________
% 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.60
% 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.60 (2023-06-19)
% 0.20/0.60
% 0.20/0.60 (c) Philipp Rümmer, 2009-2023
% 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.60 Amanda Stjerna.
% 0.20/0.60 Free software under BSD-3-Clause.
% 0.20/0.60
% 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.60
% 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.25/1.15 Prover 1: Preprocessing ...
% 3.25/1.15 Prover 4: Preprocessing ...
% 3.25/1.19 Prover 3: Preprocessing ...
% 3.25/1.19 Prover 6: Preprocessing ...
% 3.25/1.19 Prover 2: Preprocessing ...
% 3.25/1.19 Prover 0: Preprocessing ...
% 3.25/1.19 Prover 5: Preprocessing ...
% 6.89/1.76 Prover 1: Constructing countermodel ...
% 7.61/1.79 Prover 3: Constructing countermodel ...
% 8.10/1.87 Prover 6: Proving ...
% 8.10/1.90 Prover 3: proved (1278ms)
% 8.10/1.90
% 8.10/1.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.10/1.90
% 8.10/1.90 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.10/1.91 Prover 6: stopped
% 8.10/1.93 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.85/1.98 Prover 7: Preprocessing ...
% 9.28/2.02 Prover 5: Constructing countermodel ...
% 9.28/2.02 Prover 8: Preprocessing ...
% 9.28/2.02 Prover 5: stopped
% 9.28/2.03 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.28/2.04 Prover 1: Found proof (size 40)
% 9.28/2.04 Prover 1: proved (1428ms)
% 9.28/2.04 Prover 7: stopped
% 9.77/2.06 Prover 10: Preprocessing ...
% 9.77/2.07 Prover 2: Proving ...
% 9.77/2.07 Prover 2: stopped
% 9.77/2.10 Prover 10: stopped
% 9.77/2.13 Prover 4: Constructing countermodel ...
% 9.77/2.15 Prover 8: Warning: ignoring some quantifiers
% 9.77/2.15 Prover 4: stopped
% 9.77/2.15 Prover 8: Constructing countermodel ...
% 10.48/2.16 Prover 8: stopped
% 10.48/2.19 Prover 0: Proving ...
% 10.48/2.19 Prover 0: stopped
% 10.48/2.19
% 10.48/2.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.48/2.19
% 10.65/2.20 % SZS output start Proof for theBenchmark
% 10.65/2.20 Assumptions after simplification:
% 10.65/2.20 ---------------------------------
% 10.65/2.20
% 10.65/2.20 (mLENTr)
% 10.65/2.22 $i(sz10) & $i(sz00) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | v0 = sz10 | v0 =
% 10.65/2.22 sz00 | ~ (sdtlseqdt0(sz10, v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 =
% 10.65/2.22 0) & aNaturalNumber0(v0) = v2))
% 10.65/2.22
% 10.65/2.22 (mLETotal)
% 10.65/2.23 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (sdtlseqdt0(v0, v1) =
% 10.65/2.23 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] :
% 10.65/2.23 (sdtlseqdt0(v1, v0) = v5 & aNaturalNumber0(v1) = v4 & aNaturalNumber0(v0) =
% 10.65/2.23 v3 & ( ~ (v4 = 0) | ~ (v3 = 0) | (v5 = 0 & ~ (v1 = v0)))))
% 10.65/2.23
% 10.65/2.23 (mSortsC_01)
% 10.65/2.23 ~ (sz10 = sz00) & aNaturalNumber0(sz10) = 0 & $i(sz10) & $i(sz00)
% 10.65/2.23
% 10.65/2.23 (m__)
% 10.65/2.23 $i(xm) & $i(sz10) & $i(sz00) & ? [v0: int] : ( ~ (v0 = 0) & ~ (xm = sz00) &
% 10.65/2.23 sdtlseqdt0(sz10, xm) = v0 & ! [v1: $i] : ( ~ (sdtpldt0(sz10, v1) = xm) | ~
% 10.81/2.23 $i(v1) | ? [v2: int] : ( ~ (v2 = 0) & aNaturalNumber0(v1) = v2)))
% 10.81/2.23
% 10.81/2.23 (m__987)
% 10.81/2.23 aNaturalNumber0(xn) = 0 & aNaturalNumber0(xm) = 0 & $i(xn) & $i(xm)
% 10.81/2.23
% 10.81/2.23 (function-axioms)
% 10.81/2.23 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.81/2.23 (sdtmndt0(v3, v2) = v1) | ~ (sdtmndt0(v3, v2) = v0)) & ! [v0:
% 10.81/2.23 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 10.81/2.23 : (v1 = v0 | ~ (sdtlseqdt0(v3, v2) = v1) | ~ (sdtlseqdt0(v3, v2) = v0)) & !
% 10.81/2.23 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.81/2.23 (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : !
% 10.81/2.23 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) |
% 10.81/2.23 ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 10.81/2.23 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aNaturalNumber0(v2) = v1)
% 10.81/2.23 | ~ (aNaturalNumber0(v2) = v0))
% 10.81/2.23
% 10.81/2.23 Further assumptions not needed in the proof:
% 10.81/2.23 --------------------------------------------
% 10.81/2.24 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefLE, mLEAsym, mLERefl,
% 10.81/2.24 mLETran, mMonAdd, mMonMul, mMulAsso, mMulCanc, mMulComm, mNatSort, mSortsB,
% 10.81/2.24 mSortsB_02, mSortsC, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero
% 10.81/2.24
% 10.81/2.24 Those formulas are unsatisfiable:
% 10.81/2.24 ---------------------------------
% 10.81/2.24
% 10.81/2.24 Begin of proof
% 10.81/2.24 |
% 10.81/2.24 | ALPHA: (mSortsC_01) implies:
% 10.81/2.24 | (1) aNaturalNumber0(sz10) = 0
% 10.81/2.24 |
% 10.81/2.24 | ALPHA: (mLENTr) implies:
% 10.81/2.24 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | v0 = sz10 | v0 = sz00 | ~
% 10.81/2.24 | (sdtlseqdt0(sz10, v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0)
% 10.81/2.24 | & aNaturalNumber0(v0) = v2))
% 10.81/2.24 |
% 10.81/2.24 | ALPHA: (m__987) implies:
% 10.81/2.24 | (3) aNaturalNumber0(xm) = 0
% 10.81/2.24 |
% 10.81/2.24 | ALPHA: (m__) implies:
% 10.81/2.24 | (4) $i(sz10)
% 10.81/2.24 | (5) $i(xm)
% 10.81/2.24 | (6) ? [v0: int] : ( ~ (v0 = 0) & ~ (xm = sz00) & sdtlseqdt0(sz10, xm) =
% 10.81/2.24 | v0 & ! [v1: $i] : ( ~ (sdtpldt0(sz10, v1) = xm) | ~ $i(v1) | ?
% 10.81/2.24 | [v2: int] : ( ~ (v2 = 0) & aNaturalNumber0(v1) = v2)))
% 10.81/2.24 |
% 10.81/2.24 | ALPHA: (function-axioms) implies:
% 10.81/2.24 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 10.81/2.24 | (v1 = v0 | ~ (aNaturalNumber0(v2) = v1) | ~ (aNaturalNumber0(v2) =
% 10.81/2.24 | v0))
% 10.81/2.24 |
% 10.81/2.24 | DELTA: instantiating (6) with fresh symbol all_27_0 gives:
% 10.81/2.24 | (8) ~ (all_27_0 = 0) & ~ (xm = sz00) & sdtlseqdt0(sz10, xm) = all_27_0 &
% 10.81/2.24 | ! [v0: $i] : ( ~ (sdtpldt0(sz10, v0) = xm) | ~ $i(v0) | ? [v1: int] :
% 10.81/2.24 | ( ~ (v1 = 0) & aNaturalNumber0(v0) = v1))
% 10.81/2.24 |
% 10.81/2.24 | ALPHA: (8) implies:
% 10.81/2.24 | (9) ~ (xm = sz00)
% 10.81/2.24 | (10) ~ (all_27_0 = 0)
% 10.81/2.24 | (11) sdtlseqdt0(sz10, xm) = all_27_0
% 10.81/2.24 |
% 10.81/2.24 | GROUND_INST: instantiating (2) with xm, all_27_0, simplifying with (5), (11)
% 10.81/2.25 | gives:
% 10.81/2.25 | (12) all_27_0 = 0 | xm = sz10 | xm = sz00 | ? [v0: int] : ( ~ (v0 = 0) &
% 10.81/2.25 | aNaturalNumber0(xm) = v0)
% 10.81/2.25 |
% 10.81/2.25 | GROUND_INST: instantiating (mLETotal) with sz10, xm, all_27_0, simplifying
% 10.81/2.25 | with (4), (5), (11) gives:
% 10.81/2.25 | (13) all_27_0 = 0 | ? [v0: any] : ? [v1: any] : ? [v2: any] :
% 10.81/2.25 | (sdtlseqdt0(xm, sz10) = v2 & aNaturalNumber0(xm) = v1 &
% 10.81/2.25 | aNaturalNumber0(sz10) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0) | (v2 = 0 &
% 10.81/2.25 | ~ (xm = sz10))))
% 10.81/2.25 |
% 10.81/2.25 | BETA: splitting (13) gives:
% 10.81/2.25 |
% 10.81/2.25 | Case 1:
% 10.81/2.25 | |
% 10.81/2.25 | | (14) all_27_0 = 0
% 10.81/2.25 | |
% 10.81/2.25 | | REDUCE: (10), (14) imply:
% 10.81/2.25 | | (15) $false
% 10.81/2.25 | |
% 10.81/2.25 | | CLOSE: (15) is inconsistent.
% 10.81/2.25 | |
% 10.81/2.25 | Case 2:
% 10.81/2.25 | |
% 10.81/2.25 | | (16) ? [v0: any] : ? [v1: any] : ? [v2: any] : (sdtlseqdt0(xm, sz10) =
% 10.81/2.25 | | v2 & aNaturalNumber0(xm) = v1 & aNaturalNumber0(sz10) = v0 & ( ~
% 10.81/2.25 | | (v1 = 0) | ~ (v0 = 0) | (v2 = 0 & ~ (xm = sz10))))
% 10.81/2.25 | |
% 10.81/2.25 | | DELTA: instantiating (16) with fresh symbols all_50_0, all_50_1, all_50_2
% 10.81/2.25 | | gives:
% 10.81/2.25 | | (17) sdtlseqdt0(xm, sz10) = all_50_0 & aNaturalNumber0(xm) = all_50_1 &
% 10.81/2.25 | | aNaturalNumber0(sz10) = all_50_2 & ( ~ (all_50_1 = 0) | ~ (all_50_2
% 10.81/2.25 | | = 0) | (all_50_0 = 0 & ~ (xm = sz10)))
% 10.81/2.25 | |
% 10.81/2.25 | | ALPHA: (17) implies:
% 10.81/2.25 | | (18) aNaturalNumber0(sz10) = all_50_2
% 10.81/2.25 | | (19) aNaturalNumber0(xm) = all_50_1
% 10.81/2.25 | | (20) ~ (all_50_1 = 0) | ~ (all_50_2 = 0) | (all_50_0 = 0 & ~ (xm =
% 10.81/2.25 | | sz10))
% 10.81/2.25 | |
% 10.81/2.25 | | GROUND_INST: instantiating (7) with 0, all_50_2, sz10, simplifying with (1),
% 10.81/2.25 | | (18) gives:
% 10.81/2.25 | | (21) all_50_2 = 0
% 10.81/2.25 | |
% 10.81/2.25 | | GROUND_INST: instantiating (7) with 0, all_50_1, xm, simplifying with (3),
% 10.81/2.25 | | (19) gives:
% 10.81/2.25 | | (22) all_50_1 = 0
% 10.81/2.25 | |
% 10.81/2.25 | | BETA: splitting (20) gives:
% 10.81/2.25 | |
% 10.81/2.25 | | Case 1:
% 10.81/2.25 | | |
% 10.81/2.25 | | | (23) ~ (all_50_1 = 0)
% 10.81/2.25 | | |
% 10.81/2.25 | | | REDUCE: (22), (23) imply:
% 10.81/2.25 | | | (24) $false
% 10.81/2.25 | | |
% 10.81/2.25 | | | CLOSE: (24) is inconsistent.
% 10.81/2.25 | | |
% 10.81/2.25 | | Case 2:
% 10.81/2.25 | | |
% 10.81/2.25 | | | (25) ~ (all_50_2 = 0) | (all_50_0 = 0 & ~ (xm = sz10))
% 10.81/2.25 | | |
% 10.81/2.25 | | | BETA: splitting (25) gives:
% 10.81/2.25 | | |
% 10.81/2.25 | | | Case 1:
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | (26) ~ (all_50_2 = 0)
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | REDUCE: (21), (26) imply:
% 10.81/2.25 | | | | (27) $false
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | CLOSE: (27) is inconsistent.
% 10.81/2.25 | | | |
% 10.81/2.25 | | | Case 2:
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | (28) all_50_0 = 0 & ~ (xm = sz10)
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | ALPHA: (28) implies:
% 10.81/2.25 | | | | (29) ~ (xm = sz10)
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | BETA: splitting (12) gives:
% 10.81/2.25 | | | |
% 10.81/2.25 | | | | Case 1:
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | | (30) xm = sz00
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | | REDUCE: (9), (30) imply:
% 10.81/2.25 | | | | | (31) $false
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | | CLOSE: (31) is inconsistent.
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | Case 2:
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | | (32) all_27_0 = 0 | xm = sz10 | ? [v0: int] : ( ~ (v0 = 0) &
% 10.81/2.25 | | | | | aNaturalNumber0(xm) = v0)
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | | BETA: splitting (32) gives:
% 10.81/2.25 | | | | |
% 10.81/2.25 | | | | | Case 1:
% 10.81/2.25 | | | | | |
% 10.81/2.26 | | | | | | (33) all_27_0 = 0
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | | REDUCE: (10), (33) imply:
% 10.81/2.26 | | | | | | (34) $false
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | | CLOSE: (34) is inconsistent.
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | Case 2:
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | | (35) xm = sz10 | ? [v0: int] : ( ~ (v0 = 0) &
% 10.81/2.26 | | | | | | aNaturalNumber0(xm) = v0)
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | | BETA: splitting (35) gives:
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | | Case 1:
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | (36) xm = sz10
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | REDUCE: (29), (36) imply:
% 10.81/2.26 | | | | | | | (37) $false
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | CLOSE: (37) is inconsistent.
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | Case 2:
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | (38) ? [v0: int] : ( ~ (v0 = 0) & aNaturalNumber0(xm) = v0)
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | DELTA: instantiating (38) with fresh symbol all_81_0 gives:
% 10.81/2.26 | | | | | | | (39) ~ (all_81_0 = 0) & aNaturalNumber0(xm) = all_81_0
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | ALPHA: (39) implies:
% 10.81/2.26 | | | | | | | (40) ~ (all_81_0 = 0)
% 10.81/2.26 | | | | | | | (41) aNaturalNumber0(xm) = all_81_0
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | GROUND_INST: instantiating (7) with 0, all_81_0, xm, simplifying
% 10.81/2.26 | | | | | | | with (3), (41) gives:
% 10.81/2.26 | | | | | | | (42) all_81_0 = 0
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | REDUCE: (40), (42) imply:
% 10.81/2.26 | | | | | | | (43) $false
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | | CLOSE: (43) is inconsistent.
% 10.81/2.26 | | | | | | |
% 10.81/2.26 | | | | | | End of split
% 10.81/2.26 | | | | | |
% 10.81/2.26 | | | | | End of split
% 10.81/2.26 | | | | |
% 10.81/2.26 | | | | End of split
% 10.81/2.26 | | | |
% 10.81/2.26 | | | End of split
% 10.81/2.26 | | |
% 10.81/2.26 | | End of split
% 10.81/2.26 | |
% 10.81/2.26 | End of split
% 10.81/2.26 |
% 10.81/2.26 End of proof
% 10.81/2.26 % SZS output end Proof for theBenchmark
% 10.81/2.26
% 10.81/2.26 1662ms
%------------------------------------------------------------------------------