TSTP Solution File: RNG101+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : RNG101+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 : n031.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 13:57:52 EDT 2023
% Result : Theorem 11.92s 2.47s
% Output : Proof 15.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG101+2 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 02:12:41 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.60 ________ _____
% 0.19/0.60 ___ __ \_________(_)________________________________
% 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60
% 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60 (2023-06-19)
% 0.19/0.60
% 0.19/0.60 (c) Philipp Rümmer, 2009-2023
% 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60 Amanda Stjerna.
% 0.19/0.60 Free software under BSD-3-Clause.
% 0.19/0.60
% 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60
% 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.61 Running up to 7 provers in parallel.
% 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.02/1.20 Prover 4: Preprocessing ...
% 3.34/1.20 Prover 1: Preprocessing ...
% 3.34/1.24 Prover 5: Preprocessing ...
% 3.34/1.24 Prover 6: Preprocessing ...
% 3.34/1.24 Prover 0: Preprocessing ...
% 3.34/1.24 Prover 2: Preprocessing ...
% 3.34/1.25 Prover 3: Preprocessing ...
% 8.77/2.08 Prover 1: Constructing countermodel ...
% 8.77/2.11 Prover 6: Proving ...
% 8.77/2.11 Prover 5: Proving ...
% 8.77/2.12 Prover 3: Constructing countermodel ...
% 10.53/2.27 Prover 2: Proving ...
% 11.35/2.38 Prover 4: Constructing countermodel ...
% 11.35/2.42 Prover 0: Proving ...
% 11.92/2.46 Prover 3: proved (1843ms)
% 11.92/2.47
% 11.92/2.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.92/2.47
% 11.92/2.47 Prover 6: stopped
% 11.92/2.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 11.92/2.47 Prover 0: stopped
% 11.92/2.47 Prover 2: stopped
% 11.92/2.47 Prover 5: stopped
% 11.92/2.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.92/2.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.92/2.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 11.92/2.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 12.79/2.59 Prover 13: Preprocessing ...
% 12.79/2.60 Prover 11: Preprocessing ...
% 12.79/2.60 Prover 7: Preprocessing ...
% 12.79/2.61 Prover 8: Preprocessing ...
% 12.79/2.62 Prover 10: Preprocessing ...
% 12.79/2.73 Prover 1: Found proof (size 24)
% 12.79/2.73 Prover 1: proved (2108ms)
% 12.79/2.73 Prover 4: stopped
% 14.23/2.79 Prover 7: Constructing countermodel ...
% 14.23/2.79 Prover 8: Warning: ignoring some quantifiers
% 14.23/2.80 Prover 8: Constructing countermodel ...
% 14.23/2.80 Prover 7: stopped
% 14.23/2.80 Prover 10: Constructing countermodel ...
% 14.23/2.82 Prover 8: stopped
% 14.23/2.82 Prover 10: stopped
% 14.64/2.84 Prover 13: Warning: ignoring some quantifiers
% 14.82/2.85 Prover 13: Constructing countermodel ...
% 14.82/2.87 Prover 13: stopped
% 14.82/2.92 Prover 11: Constructing countermodel ...
% 15.18/2.94 Prover 11: stopped
% 15.18/2.94
% 15.18/2.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.18/2.94
% 15.18/2.95 % SZS output start Proof for theBenchmark
% 15.18/2.95 Assumptions after simplification:
% 15.18/2.95 ---------------------------------
% 15.18/2.95
% 15.18/2.95 (mMulComm)
% 15.41/2.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~
% 15.41/2.98 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: $i] :
% 15.41/2.98 (sdtasdt0(v1, v0) = v5 & aElement0(v1) = v4 & aElement0(v0) = v3 & $i(v5) &
% 15.41/2.98 ( ~ (v4 = 0) | ~ (v3 = 0) | v5 = v2)))
% 15.41/2.98
% 15.41/2.98 (mSortsB_02)
% 15.41/2.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~
% 15.41/2.98 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] :
% 15.41/2.98 (aElement0(v2) = v5 & aElement0(v1) = v4 & aElement0(v0) = v3 & ( ~ (v4 = 0)
% 15.41/2.98 | ~ (v3 = 0) | v5 = 0)))
% 15.41/2.98
% 15.41/2.98 (m__)
% 15.41/2.98 $i(xx) & $i(xc) & ! [v0: $i] : ( ~ (sdtasdt0(xc, v0) = xx) | ~ $i(v0) | ?
% 15.41/2.98 [v1: int] : ( ~ (v1 = 0) & aElement0(v0) = v1))
% 15.41/2.98
% 15.41/2.98 (m__1933)
% 15.41/2.98 $i(xz) & $i(xy) & $i(xx) & $i(xc) & ? [v0: $i] : (slsdtgt0(xc) = v0 &
% 15.41/2.98 aElementOf0(xy, v0) = 0 & aElementOf0(xx, v0) = 0 & aElement0(xz) = 0 &
% 15.41/2.98 $i(v0) & ? [v1: $i] : (sdtasdt0(xc, v1) = xy & aElement0(v1) = 0 & $i(v1))
% 15.41/2.98 & ? [v1: $i] : (sdtasdt0(xc, v1) = xx & aElement0(v1) = 0 & $i(v1)))
% 15.41/2.98
% 15.41/2.98 (function-axioms)
% 15.41/2.99 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 15.41/2.99 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (aGcdOfAnd0(v4, v3, v2) = v1) | ~
% 15.41/2.99 (aGcdOfAnd0(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 15.41/2.99 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~
% 15.41/2.99 (sdteqdtlpzmzozddtrp0(v4, v3, v2) = v1) | ~ (sdteqdtlpzmzozddtrp0(v4, v3,
% 15.41/2.99 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 15.41/2.99 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (misRelativelyPrime0(v3, v2) = v1) |
% 15.41/2.99 ~ (misRelativelyPrime0(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 15.41/2.99 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 15.41/2.99 (aDivisorOf0(v3, v2) = v1) | ~ (aDivisorOf0(v3, v2) = v0)) & ! [v0:
% 15.41/2.99 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 15.41/2.99 : (v1 = v0 | ~ (doDivides0(v3, v2) = v1) | ~ (doDivides0(v3, v2) = v0)) & !
% 15.41/2.99 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 15.41/2.99 $i] : (v1 = v0 | ~ (iLess0(v3, v2) = v1) | ~ (iLess0(v3, v2) = v0)) & !
% 15.41/2.99 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 15.41/2.99 (sdtasasdt0(v3, v2) = v1) | ~ (sdtasasdt0(v3, v2) = v0)) & ! [v0: $i] : !
% 15.41/2.99 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt1(v3, v2) = v1) |
% 15.41/2.99 ~ (sdtpldt1(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 15.41/2.99 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 15.41/2.99 (aElementOf0(v3, v2) = v1) | ~ (aElementOf0(v3, v2) = v0)) & ! [v0: $i] :
% 15.41/2.99 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1)
% 15.41/2.99 | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 15.41/2.99 [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0))
% 15.41/2.99 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (slsdtgt0(v2) = v1)
% 15.41/2.99 | ~ (slsdtgt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 =
% 15.41/2.99 v0 | ~ (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0:
% 15.41/2.99 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 15.41/2.99 ~ (aNaturalNumber0(v2) = v1) | ~ (aNaturalNumber0(v2) = v0)) & ! [v0:
% 15.41/2.99 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 15.41/2.99 ~ (aIdeal0(v2) = v1) | ~ (aIdeal0(v2) = v0)) & ! [v0: MultipleValueBool] :
% 15.41/2.99 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aSet0(v2) = v1) | ~
% 15.41/2.99 (aSet0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 15.41/2.99 (smndt0(v2) = v1) | ~ (smndt0(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 15.41/2.99 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aElement0(v2) = v1) |
% 15.41/2.99 ~ (aElement0(v2) = v0))
% 15.41/2.99
% 15.41/2.99 Further assumptions not needed in the proof:
% 15.41/2.99 --------------------------------------------
% 15.41/2.99 mAMDistr, mAddAsso, mAddComm, mAddInvr, mAddZero, mCancel, mChineseRemainder,
% 15.41/2.99 mDefDiv, mDefDvs, mDefGCD, mDefIdeal, mDefMod, mDefPrIdeal, mDefRel, mDefSInt,
% 15.41/2.99 mDefSSum, mDivision, mEOfElem, mElmSort, mEucSort, mIdeInt, mIdeSum, mMulAsso,
% 15.41/2.99 mMulMnOne, mMulUnit, mMulZero, mNatLess, mNatSort, mSetEq, mSetSort, mSortsB,
% 15.41/2.99 mSortsC, mSortsC_01, mSortsU, mUnNeZr, m__1905
% 15.41/2.99
% 15.41/2.99 Those formulas are unsatisfiable:
% 15.41/2.99 ---------------------------------
% 15.41/2.99
% 15.41/2.99 Begin of proof
% 15.41/2.99 |
% 15.41/2.99 | ALPHA: (m__1933) implies:
% 15.41/2.99 | (1) ? [v0: $i] : (slsdtgt0(xc) = v0 & aElementOf0(xy, v0) = 0 &
% 15.41/2.99 | aElementOf0(xx, v0) = 0 & aElement0(xz) = 0 & $i(v0) & ? [v1: $i] :
% 15.41/2.99 | (sdtasdt0(xc, v1) = xy & aElement0(v1) = 0 & $i(v1)) & ? [v1: $i] :
% 15.41/2.99 | (sdtasdt0(xc, v1) = xx & aElement0(v1) = 0 & $i(v1)))
% 15.41/2.99 |
% 15.41/2.99 | ALPHA: (m__) implies:
% 15.41/3.00 | (2) $i(xc)
% 15.41/3.00 | (3) ! [v0: $i] : ( ~ (sdtasdt0(xc, v0) = xx) | ~ $i(v0) | ? [v1: int] :
% 15.41/3.00 | ( ~ (v1 = 0) & aElement0(v0) = v1))
% 15.41/3.00 |
% 15.41/3.00 | ALPHA: (function-axioms) implies:
% 15.41/3.00 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 15.41/3.00 | (v1 = v0 | ~ (aElement0(v2) = v1) | ~ (aElement0(v2) = v0))
% 15.41/3.00 |
% 15.41/3.00 | DELTA: instantiating (1) with fresh symbol all_34_0 gives:
% 15.41/3.00 | (5) slsdtgt0(xc) = all_34_0 & aElementOf0(xy, all_34_0) = 0 &
% 15.41/3.00 | aElementOf0(xx, all_34_0) = 0 & aElement0(xz) = 0 & $i(all_34_0) & ?
% 15.41/3.00 | [v0: $i] : (sdtasdt0(xc, v0) = xy & aElement0(v0) = 0 & $i(v0)) & ?
% 15.41/3.00 | [v0: $i] : (sdtasdt0(xc, v0) = xx & aElement0(v0) = 0 & $i(v0))
% 15.41/3.00 |
% 15.41/3.00 | ALPHA: (5) implies:
% 15.41/3.00 | (6) ? [v0: $i] : (sdtasdt0(xc, v0) = xx & aElement0(v0) = 0 & $i(v0))
% 15.41/3.00 |
% 15.41/3.00 | DELTA: instantiating (6) with fresh symbol all_39_0 gives:
% 15.41/3.00 | (7) sdtasdt0(xc, all_39_0) = xx & aElement0(all_39_0) = 0 & $i(all_39_0)
% 15.41/3.00 |
% 15.41/3.00 | ALPHA: (7) implies:
% 15.41/3.00 | (8) $i(all_39_0)
% 15.41/3.00 | (9) aElement0(all_39_0) = 0
% 15.41/3.00 | (10) sdtasdt0(xc, all_39_0) = xx
% 15.41/3.00 |
% 15.41/3.00 | GROUND_INST: instantiating (3) with all_39_0, simplifying with (8), (10)
% 15.41/3.00 | gives:
% 15.41/3.00 | (11) ? [v0: int] : ( ~ (v0 = 0) & aElement0(all_39_0) = v0)
% 15.41/3.00 |
% 15.41/3.00 | GROUND_INST: instantiating (mMulComm) with xc, all_39_0, xx, simplifying with
% 15.41/3.00 | (2), (8), (10) gives:
% 15.41/3.00 | (12) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (sdtasdt0(all_39_0, xc) =
% 15.41/3.00 | v2 & aElement0(all_39_0) = v1 & aElement0(xc) = v0 & $i(v2) & ( ~
% 15.41/3.00 | (v1 = 0) | ~ (v0 = 0) | v2 = xx))
% 15.41/3.00 |
% 15.41/3.00 | GROUND_INST: instantiating (mSortsB_02) with xc, all_39_0, xx, simplifying
% 15.41/3.00 | with (2), (8), (10) gives:
% 15.41/3.00 | (13) ? [v0: any] : ? [v1: any] : ? [v2: any] : (aElement0(all_39_0) = v1
% 15.41/3.00 | & aElement0(xx) = v2 & aElement0(xc) = v0 & ( ~ (v1 = 0) | ~ (v0 =
% 15.41/3.00 | 0) | v2 = 0))
% 15.41/3.00 |
% 15.41/3.00 | DELTA: instantiating (11) with fresh symbol all_90_0 gives:
% 15.41/3.00 | (14) ~ (all_90_0 = 0) & aElement0(all_39_0) = all_90_0
% 15.41/3.00 |
% 15.41/3.00 | ALPHA: (14) implies:
% 15.41/3.00 | (15) ~ (all_90_0 = 0)
% 15.41/3.00 | (16) aElement0(all_39_0) = all_90_0
% 15.41/3.00 |
% 15.41/3.00 | DELTA: instantiating (13) with fresh symbols all_96_0, all_96_1, all_96_2
% 15.41/3.00 | gives:
% 15.41/3.00 | (17) aElement0(all_39_0) = all_96_1 & aElement0(xx) = all_96_0 &
% 15.41/3.00 | aElement0(xc) = all_96_2 & ( ~ (all_96_1 = 0) | ~ (all_96_2 = 0) |
% 15.41/3.00 | all_96_0 = 0)
% 15.41/3.00 |
% 15.41/3.00 | ALPHA: (17) implies:
% 15.41/3.01 | (18) aElement0(all_39_0) = all_96_1
% 15.41/3.01 |
% 15.41/3.01 | DELTA: instantiating (12) with fresh symbols all_100_0, all_100_1, all_100_2
% 15.41/3.01 | gives:
% 15.41/3.01 | (19) sdtasdt0(all_39_0, xc) = all_100_0 & aElement0(all_39_0) = all_100_1 &
% 15.41/3.01 | aElement0(xc) = all_100_2 & $i(all_100_0) & ( ~ (all_100_1 = 0) | ~
% 15.41/3.01 | (all_100_2 = 0) | all_100_0 = xx)
% 15.41/3.01 |
% 15.41/3.01 | ALPHA: (19) implies:
% 15.41/3.01 | (20) aElement0(all_39_0) = all_100_1
% 15.41/3.01 |
% 15.41/3.01 | GROUND_INST: instantiating (4) with 0, all_96_1, all_39_0, simplifying with
% 15.41/3.01 | (9), (18) gives:
% 15.41/3.01 | (21) all_96_1 = 0
% 15.41/3.01 |
% 15.41/3.01 | GROUND_INST: instantiating (4) with all_96_1, all_100_1, all_39_0, simplifying
% 15.41/3.01 | with (18), (20) gives:
% 15.41/3.01 | (22) all_100_1 = all_96_1
% 15.41/3.01 |
% 15.41/3.01 | GROUND_INST: instantiating (4) with all_90_0, all_100_1, all_39_0, simplifying
% 15.41/3.01 | with (16), (20) gives:
% 15.41/3.01 | (23) all_100_1 = all_90_0
% 15.41/3.01 |
% 15.41/3.01 | COMBINE_EQS: (22), (23) imply:
% 15.41/3.01 | (24) all_96_1 = all_90_0
% 15.41/3.01 |
% 15.41/3.01 | SIMP: (24) implies:
% 15.41/3.01 | (25) all_96_1 = all_90_0
% 15.41/3.01 |
% 15.41/3.01 | COMBINE_EQS: (21), (25) imply:
% 15.41/3.01 | (26) all_90_0 = 0
% 15.41/3.01 |
% 15.41/3.01 | REDUCE: (15), (26) imply:
% 15.41/3.01 | (27) $false
% 15.41/3.01 |
% 15.41/3.01 | CLOSE: (27) is inconsistent.
% 15.41/3.01 |
% 15.41/3.01 End of proof
% 15.41/3.01 % SZS output end Proof for theBenchmark
% 15.41/3.01
% 15.41/3.01 2408ms
%------------------------------------------------------------------------------