%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : RNG102+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 : n013.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:53 EDT 2023 % Result : Theorem 11.69s 2.39s % Output : Proof 16.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : RNG102+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.35 % Computer : n013.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Sun Aug 27 02:29:02 EDT 2023 % 0.13/0.35 % 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/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 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 % 2.80/1.17 Prover 1: Preprocessing ... % 2.80/1.17 Prover 4: Preprocessing ... % 3.59/1.20 Prover 2: Preprocessing ... % 3.59/1.20 Prover 6: Preprocessing ... % 3.59/1.21 Prover 5: Preprocessing ... % 3.59/1.21 Prover 0: Preprocessing ... % 3.66/1.21 Prover 3: Preprocessing ... % 8.53/1.92 Prover 1: Constructing countermodel ... % 8.53/1.94 Prover 3: Constructing countermodel ... % 9.15/1.99 Prover 6: Proving ... % 9.15/2.02 Prover 5: Proving ... % 9.87/2.15 Prover 2: Proving ... % 9.87/2.19 Prover 4: Constructing countermodel ... % 11.45/2.32 Prover 0: Proving ... % 11.69/2.39 Prover 3: proved (1765ms) % 11.69/2.39 % 11.69/2.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.69/2.39 % 11.69/2.39 Prover 6: stopped % 11.69/2.40 Prover 5: stopped % 11.69/2.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.69/2.41 Prover 2: stopped % 11.69/2.41 Prover 0: stopped % 11.69/2.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.69/2.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.69/2.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.69/2.43 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.40/2.47 Prover 7: Preprocessing ... % 12.85/2.49 Prover 8: Preprocessing ... % 12.85/2.52 Prover 13: Preprocessing ... % 12.85/2.52 Prover 10: Preprocessing ... % 12.85/2.53 Prover 11: Preprocessing ... % 13.97/2.74 Prover 8: Warning: ignoring some quantifiers % 13.97/2.74 Prover 7: Constructing countermodel ... % 13.97/2.75 Prover 8: Constructing countermodel ... % 13.97/2.75 Prover 10: Constructing countermodel ... % 13.97/2.79 Prover 13: Warning: ignoring some quantifiers % 13.97/2.83 Prover 13: Constructing countermodel ... % 13.97/2.84 Prover 1: Found proof (size 24) % 13.97/2.84 Prover 1: proved (2221ms) % 13.97/2.84 Prover 10: Found proof (size 6) % 13.97/2.84 Prover 10: proved (434ms) % 13.97/2.84 Prover 8: stopped % 13.97/2.85 Prover 7: stopped % 13.97/2.86 Prover 4: stopped % 13.97/2.86 Prover 13: stopped % 15.88/2.95 Prover 11: Constructing countermodel ... % 15.88/2.96 Prover 11: stopped % 15.88/2.96 % 15.88/2.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.88/2.96 % 15.88/2.97 % SZS output start Proof for theBenchmark % 15.88/2.97 Assumptions after simplification: % 15.88/2.97 --------------------------------- % 15.88/2.97 % 15.88/2.97 (mMulComm) % 16.19/3.00 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 16.19/3.00 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: $i] : % 16.19/3.00 (sdtasdt0(v1, v0) = v5 & aElement0(v1) = v4 & aElement0(v0) = v3 & $i(v5) & % 16.19/3.00 ( ~ (v4 = 0) | ~ (v3 = 0) | v5 = v2))) % 16.19/3.00 % 16.19/3.00 (mSortsB_02) % 16.19/3.00 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 16.19/3.00 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] : % 16.19/3.00 (aElement0(v2) = v5 & aElement0(v1) = v4 & aElement0(v0) = v3 & ( ~ (v4 = 0) % 16.19/3.00 | ~ (v3 = 0) | v5 = 0))) % 16.19/3.00 % 16.19/3.00 (m__) % 16.19/3.00 $i(xy) & $i(xc) & ! [v0: $i] : ( ~ (sdtasdt0(xc, v0) = xy) | ~ $i(v0) | ? % 16.19/3.00 [v1: int] : ( ~ (v1 = 0) & aElement0(v0) = v1)) % 16.19/3.00 % 16.19/3.00 (m__1933) % 16.19/3.00 $i(xz) & $i(xy) & $i(xx) & $i(xc) & ? [v0: $i] : (slsdtgt0(xc) = v0 & % 16.19/3.00 aElementOf0(xy, v0) = 0 & aElementOf0(xx, v0) = 0 & aElement0(xz) = 0 & % 16.19/3.00 $i(v0) & ? [v1: $i] : (sdtasdt0(xc, v1) = xy & aElement0(v1) = 0 & $i(v1)) % 16.19/3.00 & ? [v1: $i] : (sdtasdt0(xc, v1) = xx & aElement0(v1) = 0 & $i(v1))) % 16.19/3.00 % 16.19/3.00 (function-axioms) % 16.19/3.01 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 16.19/3.01 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (aGcdOfAnd0(v4, v3, v2) = v1) | ~ % 16.19/3.01 (aGcdOfAnd0(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 16.19/3.01 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ % 16.19/3.01 (sdteqdtlpzmzozddtrp0(v4, v3, v2) = v1) | ~ (sdteqdtlpzmzozddtrp0(v4, v3, % 16.19/3.01 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 16.19/3.01 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (misRelativelyPrime0(v3, v2) = v1) | % 16.19/3.01 ~ (misRelativelyPrime0(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 16.19/3.01 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.19/3.01 (aDivisorOf0(v3, v2) = v1) | ~ (aDivisorOf0(v3, v2) = v0)) & ! [v0: % 16.19/3.01 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 16.19/3.01 : (v1 = v0 | ~ (doDivides0(v3, v2) = v1) | ~ (doDivides0(v3, v2) = v0)) & ! % 16.19/3.01 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 16.19/3.01 $i] : (v1 = v0 | ~ (iLess0(v3, v2) = v1) | ~ (iLess0(v3, v2) = v0)) & ! % 16.19/3.01 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.19/3.01 (sdtasasdt0(v3, v2) = v1) | ~ (sdtasasdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 16.19/3.01 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt1(v3, v2) = v1) | % 16.19/3.01 ~ (sdtpldt1(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 16.19/3.01 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.19/3.01 (aElementOf0(v3, v2) = v1) | ~ (aElementOf0(v3, v2) = v0)) & ! [v0: $i] : % 16.19/3.01 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) % 16.19/3.01 | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 16.19/3.01 [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 16.19/3.01 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (slsdtgt0(v2) = v1) % 16.19/3.01 | ~ (slsdtgt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 16.19/3.01 v0 | ~ (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: % 16.19/3.01 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 16.19/3.01 ~ (aNaturalNumber0(v2) = v1) | ~ (aNaturalNumber0(v2) = v0)) & ! [v0: % 16.19/3.01 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 16.19/3.01 ~ (aIdeal0(v2) = v1) | ~ (aIdeal0(v2) = v0)) & ! [v0: MultipleValueBool] : % 16.19/3.01 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aSet0(v2) = v1) | ~ % 16.19/3.01 (aSet0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 16.19/3.01 (smndt0(v2) = v1) | ~ (smndt0(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 16.19/3.01 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aElement0(v2) = v1) | % 16.19/3.01 ~ (aElement0(v2) = v0)) % 16.19/3.01 % 16.19/3.01 Further assumptions not needed in the proof: % 16.19/3.01 -------------------------------------------- % 16.19/3.01 mAMDistr, mAddAsso, mAddComm, mAddInvr, mAddZero, mCancel, mChineseRemainder, % 16.19/3.01 mDefDiv, mDefDvs, mDefGCD, mDefIdeal, mDefMod, mDefPrIdeal, mDefRel, mDefSInt, % 16.19/3.01 mDefSSum, mDivision, mEOfElem, mElmSort, mEucSort, mIdeInt, mIdeSum, mMulAsso, % 16.19/3.01 mMulMnOne, mMulUnit, mMulZero, mNatLess, mNatSort, mSetEq, mSetSort, mSortsB, % 16.19/3.01 mSortsC, mSortsC_01, mSortsU, mUnNeZr, m__1905, m__1956 % 16.19/3.01 % 16.19/3.01 Those formulas are unsatisfiable: % 16.19/3.01 --------------------------------- % 16.19/3.01 % 16.19/3.01 Begin of proof % 16.19/3.02 | % 16.19/3.02 | ALPHA: (m__1933) implies: % 16.19/3.02 | (1) ? [v0: $i] : (slsdtgt0(xc) = v0 & aElementOf0(xy, v0) = 0 & % 16.19/3.02 | aElementOf0(xx, v0) = 0 & aElement0(xz) = 0 & $i(v0) & ? [v1: $i] : % 16.19/3.02 | (sdtasdt0(xc, v1) = xy & aElement0(v1) = 0 & $i(v1)) & ? [v1: $i] : % 16.19/3.02 | (sdtasdt0(xc, v1) = xx & aElement0(v1) = 0 & $i(v1))) % 16.19/3.02 | % 16.19/3.02 | ALPHA: (m__) implies: % 16.19/3.02 | (2) $i(xc) % 16.19/3.02 | (3) ! [v0: $i] : ( ~ (sdtasdt0(xc, v0) = xy) | ~ $i(v0) | ? [v1: int] : % 16.19/3.02 | ( ~ (v1 = 0) & aElement0(v0) = v1)) % 16.19/3.02 | % 16.19/3.02 | ALPHA: (function-axioms) implies: % 16.19/3.02 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 16.19/3.02 | (v1 = v0 | ~ (aElement0(v2) = v1) | ~ (aElement0(v2) = v0)) % 16.19/3.02 | % 16.19/3.02 | DELTA: instantiating (1) with fresh symbol all_34_0 gives: % 16.19/3.02 | (5) slsdtgt0(xc) = all_34_0 & aElementOf0(xy, all_34_0) = 0 & % 16.19/3.02 | aElementOf0(xx, all_34_0) = 0 & aElement0(xz) = 0 & $i(all_34_0) & ? % 16.19/3.02 | [v0: $i] : (sdtasdt0(xc, v0) = xy & aElement0(v0) = 0 & $i(v0)) & ? % 16.19/3.02 | [v0: $i] : (sdtasdt0(xc, v0) = xx & aElement0(v0) = 0 & $i(v0)) % 16.19/3.02 | % 16.19/3.02 | ALPHA: (5) implies: % 16.19/3.02 | (6) ? [v0: $i] : (sdtasdt0(xc, v0) = xy & aElement0(v0) = 0 & $i(v0)) % 16.19/3.02 | % 16.19/3.02 | DELTA: instantiating (6) with fresh symbol all_41_0 gives: % 16.19/3.02 | (7) sdtasdt0(xc, all_41_0) = xy & aElement0(all_41_0) = 0 & $i(all_41_0) % 16.19/3.02 | % 16.19/3.02 | ALPHA: (7) implies: % 16.19/3.03 | (8) $i(all_41_0) % 16.19/3.03 | (9) aElement0(all_41_0) = 0 % 16.19/3.03 | (10) sdtasdt0(xc, all_41_0) = xy % 16.19/3.03 | % 16.19/3.03 | GROUND_INST: instantiating (3) with all_41_0, simplifying with (8), (10) % 16.19/3.03 | gives: % 16.19/3.03 | (11) ? [v0: int] : ( ~ (v0 = 0) & aElement0(all_41_0) = v0) % 16.19/3.03 | % 16.19/3.03 | GROUND_INST: instantiating (mMulComm) with xc, all_41_0, xy, simplifying with % 16.19/3.03 | (2), (8), (10) gives: % 16.19/3.03 | (12) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (sdtasdt0(all_41_0, xc) = % 16.19/3.03 | v2 & aElement0(all_41_0) = v1 & aElement0(xc) = v0 & $i(v2) & ( ~ % 16.19/3.03 | (v1 = 0) | ~ (v0 = 0) | v2 = xy)) % 16.19/3.03 | % 16.19/3.03 | GROUND_INST: instantiating (mSortsB_02) with xc, all_41_0, xy, simplifying % 16.19/3.03 | with (2), (8), (10) gives: % 16.19/3.03 | (13) ? [v0: any] : ? [v1: any] : ? [v2: any] : (aElement0(all_41_0) = v1 % 16.19/3.03 | & aElement0(xy) = v2 & aElement0(xc) = v0 & ( ~ (v1 = 0) | ~ (v0 = % 16.19/3.03 | 0) | v2 = 0)) % 16.19/3.03 | % 16.19/3.03 | DELTA: instantiating (11) with fresh symbol all_104_0 gives: % 16.19/3.03 | (14) ~ (all_104_0 = 0) & aElement0(all_41_0) = all_104_0 % 16.19/3.03 | % 16.19/3.03 | ALPHA: (14) implies: % 16.19/3.03 | (15) ~ (all_104_0 = 0) % 16.19/3.03 | (16) aElement0(all_41_0) = all_104_0 % 16.19/3.03 | % 16.19/3.03 | DELTA: instantiating (13) with fresh symbols all_110_0, all_110_1, all_110_2 % 16.19/3.03 | gives: % 16.19/3.03 | (17) aElement0(all_41_0) = all_110_1 & aElement0(xy) = all_110_0 & % 16.19/3.03 | aElement0(xc) = all_110_2 & ( ~ (all_110_1 = 0) | ~ (all_110_2 = 0) | % 16.19/3.03 | all_110_0 = 0) % 16.19/3.03 | % 16.19/3.03 | ALPHA: (17) implies: % 16.19/3.03 | (18) aElement0(all_41_0) = all_110_1 % 16.19/3.03 | % 16.19/3.03 | DELTA: instantiating (12) with fresh symbols all_116_0, all_116_1, all_116_2 % 16.19/3.03 | gives: % 16.19/3.03 | (19) sdtasdt0(all_41_0, xc) = all_116_0 & aElement0(all_41_0) = all_116_1 & % 16.19/3.03 | aElement0(xc) = all_116_2 & $i(all_116_0) & ( ~ (all_116_1 = 0) | ~ % 16.19/3.03 | (all_116_2 = 0) | all_116_0 = xy) % 16.19/3.03 | % 16.19/3.03 | ALPHA: (19) implies: % 16.19/3.03 | (20) aElement0(all_41_0) = all_116_1 % 16.19/3.03 | % 16.19/3.03 | GROUND_INST: instantiating (4) with 0, all_110_1, all_41_0, simplifying with % 16.19/3.03 | (9), (18) gives: % 16.19/3.03 | (21) all_110_1 = 0 % 16.19/3.03 | % 16.19/3.03 | GROUND_INST: instantiating (4) with all_110_1, all_116_1, all_41_0, % 16.19/3.03 | simplifying with (18), (20) gives: % 16.19/3.03 | (22) all_116_1 = all_110_1 % 16.19/3.03 | % 16.19/3.03 | GROUND_INST: instantiating (4) with all_104_0, all_116_1, all_41_0, % 16.19/3.03 | simplifying with (16), (20) gives: % 16.19/3.03 | (23) all_116_1 = all_104_0 % 16.19/3.03 | % 16.19/3.03 | COMBINE_EQS: (22), (23) imply: % 16.19/3.03 | (24) all_110_1 = all_104_0 % 16.19/3.03 | % 16.19/3.03 | SIMP: (24) implies: % 16.19/3.03 | (25) all_110_1 = all_104_0 % 16.19/3.03 | % 16.19/3.03 | COMBINE_EQS: (21), (25) imply: % 16.19/3.03 | (26) all_104_0 = 0 % 16.19/3.03 | % 16.19/3.03 | REDUCE: (15), (26) imply: % 16.19/3.03 | (27) $false % 16.19/3.04 | % 16.19/3.04 | CLOSE: (27) is inconsistent. % 16.19/3.04 | % 16.19/3.04 End of proof % 16.19/3.04 % SZS output end Proof for theBenchmark % 16.19/3.04 % 16.19/3.04 2432ms %------------------------------------------------------------------------------