%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM539+1 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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:48:29 EDT 2023 % Result : Theorem 14.77s 2.83s % Output : Proof 19.79s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NUM539+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n016.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 : Fri Aug 25 14:54:25 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.57 ________ _____ % 0.20/0.57 ___ __ \_________(_)________________________________ % 0.20/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.57 % 0.20/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.57 (2023-06-19) % 0.20/0.57 % 0.20/0.57 (c) Philipp Rümmer, 2009-2023 % 0.20/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.57 Amanda Stjerna. % 0.20/0.57 Free software under BSD-3-Clause. % 0.20/0.57 % 0.20/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.57 % 0.20/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.59 Running up to 7 provers in parallel. % 0.20/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.20/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.03/1.18 Prover 1: Preprocessing ... % 3.03/1.18 Prover 4: Preprocessing ... % 3.79/1.22 Prover 5: Preprocessing ... % 3.79/1.22 Prover 3: Preprocessing ... % 3.79/1.22 Prover 2: Preprocessing ... % 3.79/1.22 Prover 6: Preprocessing ... % 3.79/1.22 Prover 0: Preprocessing ... % 8.97/1.97 Prover 1: Constructing countermodel ... % 9.49/2.02 Prover 5: Constructing countermodel ... % 9.49/2.02 Prover 3: Constructing countermodel ... % 9.49/2.03 Prover 6: Proving ... % 9.49/2.05 Prover 2: Proving ... % 12.47/2.41 Prover 4: Constructing countermodel ... % 12.47/2.47 Prover 0: Proving ... % 14.77/2.83 Prover 5: proved (2227ms) % 14.77/2.83 % 14.77/2.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.77/2.83 % 14.77/2.83 Prover 3: stopped % 14.77/2.84 Prover 6: stopped % 14.77/2.85 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.77/2.85 Prover 2: stopped % 14.77/2.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.77/2.86 Prover 0: stopped % 14.77/2.87 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.77/2.87 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.77/2.87 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.20/2.92 Prover 7: Preprocessing ... % 16.20/2.92 Prover 8: Preprocessing ... % 16.20/2.97 Prover 11: Preprocessing ... % 16.20/2.98 Prover 13: Preprocessing ... % 16.20/2.99 Prover 10: Preprocessing ... % 17.22/3.08 Prover 7: Constructing countermodel ... % 17.91/3.12 Prover 10: Constructing countermodel ... % 18.38/3.19 Prover 8: Warning: ignoring some quantifiers % 18.38/3.20 Prover 8: Constructing countermodel ... % 19.06/3.29 Prover 13: Constructing countermodel ... % 19.31/3.31 Prover 10: Found proof (size 36) % 19.31/3.31 Prover 10: proved (442ms) % 19.31/3.31 Prover 8: stopped % 19.31/3.31 Prover 7: stopped % 19.31/3.31 Prover 4: stopped % 19.31/3.31 Prover 1: stopped % 19.31/3.31 Prover 13: stopped % 19.41/3.40 Prover 11: Constructing countermodel ... % 19.79/3.42 Prover 11: stopped % 19.79/3.42 % 19.79/3.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.79/3.42 % 19.79/3.43 % SZS output start Proof for theBenchmark % 19.79/3.43 Assumptions after simplification: % 19.79/3.43 --------------------------------- % 19.79/3.43 % 19.79/3.43 (mDefMin) % 19.79/3.46 $i(szNzAzT0) & $i(slcrc0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 % 19.79/3.46 | v0 = slcrc0 | ~ (szmzizndt0(v0) = v1) | ~ $i(v2) | ~ $i(v0) | ~ % 19.79/3.46 aSubsetOf0(v0, szNzAzT0) | ~ aElementOf0(v2, v0) | ? [v3: $i] : ($i(v3) & % 19.79/3.46 aElementOf0(v3, v0) & ~ sdtlseqdt0(v2, v3))) & ! [v0: $i] : ! [v1: $i] % 19.79/3.46 : ! [v2: $i] : (v0 = slcrc0 | ~ (szmzizndt0(v0) = v1) | ~ $i(v2) | ~ % 19.79/3.46 $i(v1) | ~ $i(v0) | ~ aSubsetOf0(v0, szNzAzT0) | ~ aElementOf0(v2, v0) | % 19.79/3.46 sdtlseqdt0(v1, v2)) & ! [v0: $i] : ! [v1: $i] : (v0 = slcrc0 | ~ % 19.79/3.46 (szmzizndt0(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ~ aSubsetOf0(v0, szNzAzT0) % 19.79/3.46 | aElementOf0(v1, v0)) % 19.79/3.46 % 19.79/3.46 (mDefSub) % 19.79/3.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 19.79/3.46 ~ aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v1) | ~ aSet0(v0) | % 19.79/3.46 aElementOf0(v2, v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | % 19.79/3.46 ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | aSet0(v1)) & ! [v0: $i] : ! [v1: $i] % 19.79/3.46 : ( ~ $i(v1) | ~ $i(v0) | ~ aSet0(v1) | ~ aSet0(v0) | aSubsetOf0(v1, v0) | % 19.79/3.46 ? [v2: $i] : ($i(v2) & aElementOf0(v2, v1) & ~ aElementOf0(v2, v0))) % 19.79/3.46 % 19.79/3.46 (mLessASymm) % 19.79/3.46 $i(szNzAzT0) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | % 19.79/3.46 ~ sdtlseqdt0(v1, v0) | ~ sdtlseqdt0(v0, v1) | ~ aElementOf0(v1, szNzAzT0) % 19.79/3.46 | ~ aElementOf0(v0, szNzAzT0)) % 19.79/3.46 % 19.79/3.46 (mNATSet) % 19.79/3.46 $i(szNzAzT0) & isCountable0(szNzAzT0) & aSet0(szNzAzT0) % 19.79/3.46 % 19.79/3.46 (m__) % 19.79/3.46 $i(xT) & $i(xS) & ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & szmzizndt0(xT) = % 19.79/3.46 v1 & szmzizndt0(xS) = v0 & $i(v1) & $i(v0)) % 19.79/3.46 % 19.79/3.46 (m__1779) % 19.79/3.46 ~ (xT = slcrc0) & ~ (xS = slcrc0) & $i(xT) & $i(xS) & $i(szNzAzT0) & % 19.79/3.46 $i(slcrc0) & aSubsetOf0(xT, szNzAzT0) & aSubsetOf0(xS, szNzAzT0) % 19.79/3.46 % 19.79/3.46 (m__1802) % 19.79/3.46 $i(xT) & $i(xS) & ? [v0: $i] : ? [v1: $i] : (szmzizndt0(xT) = v1 & % 19.79/3.46 szmzizndt0(xS) = v0 & $i(v1) & $i(v0) & aElementOf0(v1, xS) & % 19.79/3.46 aElementOf0(v0, xT)) % 19.79/3.46 % 19.79/3.46 (function-axioms) % 19.79/3.47 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 19.79/3.47 (sdtmndt0(v3, v2) = v1) | ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! % 19.79/3.47 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | % 19.79/3.47 ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 % 19.79/3.47 = v0 | ~ (szmzazxdt0(v2) = v1) | ~ (szmzazxdt0(v2) = v0)) & ! [v0: $i] : % 19.79/3.47 ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (szmzizndt0(v2) = v1) | ~ % 19.79/3.47 (szmzizndt0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 19.79/3.47 | ~ (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: $i] : ! [v1: % 19.79/3.47 $i] : ! [v2: $i] : (v1 = v0 | ~ (szszuzczcdt0(v2) = v1) | ~ % 19.79/3.47 (szszuzczcdt0(v2) = v0)) % 19.79/3.47 % 19.79/3.47 Further assumptions not needed in the proof: % 19.79/3.47 -------------------------------------------- % 19.79/3.47 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS, % 19.79/3.47 mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01, mDefCons, % 19.79/3.47 mDefDiff, mDefEmp, mDefMax, mDiffCons, mEOfElem, mElmSort, mEmpFin, mFConsSet, % 19.79/3.47 mFDiffSet, mFinRel, mIH, mIHSort, mLessRefl, mLessRel, mLessSucc, mLessTotal, % 19.79/3.47 mLessTrans, mNatExtra, mNatNSucc, mNoScLessZr, mSetSort, mSubASymm, mSubFSet, % 19.79/3.47 mSubRefl, mSubTrans, mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum % 19.79/3.47 % 19.79/3.47 Those formulas are unsatisfiable: % 19.79/3.47 --------------------------------- % 19.79/3.47 % 19.79/3.47 Begin of proof % 19.79/3.47 | % 19.79/3.47 | ALPHA: (mDefSub) implies: % 19.79/3.47 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 19.79/3.47 | $i(v0) | ~ aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v1) | ~ % 19.79/3.47 | aSet0(v0) | aElementOf0(v2, v0)) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (mNATSet) implies: % 19.79/3.47 | (2) aSet0(szNzAzT0) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (mLessASymm) implies: % 19.79/3.47 | (3) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 19.79/3.47 | sdtlseqdt0(v1, v0) | ~ sdtlseqdt0(v0, v1) | ~ aElementOf0(v1, % 19.79/3.47 | szNzAzT0) | ~ aElementOf0(v0, szNzAzT0)) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (mDefMin) implies: % 19.79/3.47 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v0 = slcrc0 | ~ % 19.79/3.47 | (szmzizndt0(v0) = v1) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 19.79/3.47 | aSubsetOf0(v0, szNzAzT0) | ~ aElementOf0(v2, v0) | sdtlseqdt0(v1, % 19.79/3.47 | v2)) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (m__1779) implies: % 19.79/3.47 | (5) ~ (xS = slcrc0) % 19.79/3.47 | (6) ~ (xT = slcrc0) % 19.79/3.47 | (7) aSubsetOf0(xS, szNzAzT0) % 19.79/3.47 | (8) aSubsetOf0(xT, szNzAzT0) % 19.79/3.47 | (9) $i(szNzAzT0) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (m__1802) implies: % 19.79/3.47 | (10) ? [v0: $i] : ? [v1: $i] : (szmzizndt0(xT) = v1 & szmzizndt0(xS) = v0 % 19.79/3.47 | & $i(v1) & $i(v0) & aElementOf0(v1, xS) & aElementOf0(v0, xT)) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (m__) implies: % 19.79/3.47 | (11) $i(xS) % 19.79/3.47 | (12) $i(xT) % 19.79/3.47 | (13) ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & szmzizndt0(xT) = v1 & % 19.79/3.47 | szmzizndt0(xS) = v0 & $i(v1) & $i(v0)) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (function-axioms) implies: % 19.79/3.47 | (14) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 19.79/3.47 | (szmzizndt0(v2) = v1) | ~ (szmzizndt0(v2) = v0)) % 19.79/3.47 | % 19.79/3.47 | DELTA: instantiating (13) with fresh symbols all_42_0, all_42_1 gives: % 19.79/3.47 | (15) ~ (all_42_0 = all_42_1) & szmzizndt0(xT) = all_42_0 & szmzizndt0(xS) % 19.79/3.47 | = all_42_1 & $i(all_42_0) & $i(all_42_1) % 19.79/3.47 | % 19.79/3.47 | ALPHA: (15) implies: % 19.79/3.47 | (16) ~ (all_42_0 = all_42_1) % 19.79/3.47 | (17) szmzizndt0(xS) = all_42_1 % 19.79/3.48 | (18) szmzizndt0(xT) = all_42_0 % 19.79/3.48 | % 19.79/3.48 | DELTA: instantiating (10) with fresh symbols all_44_0, all_44_1 gives: % 19.79/3.48 | (19) szmzizndt0(xT) = all_44_0 & szmzizndt0(xS) = all_44_1 & $i(all_44_0) & % 19.79/3.48 | $i(all_44_1) & aElementOf0(all_44_0, xS) & aElementOf0(all_44_1, xT) % 19.79/3.48 | % 19.79/3.48 | ALPHA: (19) implies: % 19.79/3.48 | (20) aElementOf0(all_44_1, xT) % 19.79/3.48 | (21) aElementOf0(all_44_0, xS) % 19.79/3.48 | (22) $i(all_44_1) % 19.79/3.48 | (23) $i(all_44_0) % 19.79/3.48 | (24) szmzizndt0(xS) = all_44_1 % 19.79/3.48 | (25) szmzizndt0(xT) = all_44_0 % 19.79/3.48 | % 19.79/3.48 | GROUND_INST: instantiating (14) with all_42_1, all_44_1, xS, simplifying with % 19.79/3.48 | (17), (24) gives: % 19.79/3.48 | (26) all_44_1 = all_42_1 % 19.79/3.48 | % 19.79/3.48 | GROUND_INST: instantiating (14) with all_42_0, all_44_0, xT, simplifying with % 19.79/3.48 | (18), (25) gives: % 19.79/3.48 | (27) all_44_0 = all_42_0 % 19.79/3.48 | % 19.79/3.48 | REDUCE: (23), (27) imply: % 19.79/3.48 | (28) $i(all_42_0) % 19.79/3.48 | % 19.79/3.48 | REDUCE: (22), (26) imply: % 19.79/3.48 | (29) $i(all_42_1) % 19.79/3.48 | % 19.79/3.48 | REDUCE: (21), (27) imply: % 19.79/3.48 | (30) aElementOf0(all_42_0, xS) % 19.79/3.48 | % 19.79/3.48 | REDUCE: (20), (26) imply: % 19.79/3.48 | (31) aElementOf0(all_42_1, xT) % 19.79/3.48 | % 19.79/3.48 | GROUND_INST: instantiating (1) with szNzAzT0, xS, all_42_0, simplifying with % 19.79/3.48 | (2), (7), (9), (11), (28), (30) gives: % 19.79/3.48 | (32) aElementOf0(all_42_0, szNzAzT0) % 19.79/3.48 | % 19.79/3.48 | GROUND_INST: instantiating (1) with szNzAzT0, xT, all_42_1, simplifying with % 19.79/3.48 | (2), (8), (9), (12), (29), (31) gives: % 19.79/3.48 | (33) aElementOf0(all_42_1, szNzAzT0) % 19.79/3.48 | % 19.79/3.48 | GROUND_INST: instantiating (4) with xS, all_42_1, all_42_0, simplifying with % 19.79/3.48 | (7), (11), (17), (28), (29), (30) gives: % 19.79/3.48 | (34) xS = slcrc0 | sdtlseqdt0(all_42_1, all_42_0) % 19.79/3.48 | % 19.79/3.48 | GROUND_INST: instantiating (4) with xT, all_42_0, all_42_1, simplifying with % 19.79/3.48 | (8), (12), (18), (28), (29), (31) gives: % 19.79/3.48 | (35) xT = slcrc0 | sdtlseqdt0(all_42_0, all_42_1) % 19.79/3.48 | % 19.79/3.48 | BETA: splitting (35) gives: % 19.79/3.48 | % 19.79/3.48 | Case 1: % 19.79/3.48 | | % 19.79/3.48 | | (36) sdtlseqdt0(all_42_0, all_42_1) % 19.79/3.48 | | % 19.79/3.48 | | BETA: splitting (34) gives: % 19.79/3.48 | | % 19.79/3.48 | | Case 1: % 19.79/3.48 | | | % 19.79/3.48 | | | (37) sdtlseqdt0(all_42_1, all_42_0) % 19.79/3.48 | | | % 19.79/3.48 | | | GROUND_INST: instantiating (3) with all_42_1, all_42_0, simplifying with % 19.79/3.48 | | | (28), (29), (32), (33), (36), (37) gives: % 19.79/3.48 | | | (38) all_42_0 = all_42_1 % 19.79/3.48 | | | % 19.79/3.48 | | | REDUCE: (16), (38) imply: % 19.79/3.48 | | | (39) $false % 19.79/3.48 | | | % 19.79/3.48 | | | CLOSE: (39) is inconsistent. % 19.79/3.48 | | | % 19.79/3.48 | | Case 2: % 19.79/3.48 | | | % 19.79/3.48 | | | (40) xS = slcrc0 % 19.79/3.48 | | | % 19.79/3.48 | | | REDUCE: (5), (40) imply: % 19.79/3.48 | | | (41) $false % 19.79/3.48 | | | % 19.79/3.49 | | | CLOSE: (41) is inconsistent. % 19.79/3.49 | | | % 19.79/3.49 | | End of split % 19.79/3.49 | | % 19.79/3.49 | Case 2: % 19.79/3.49 | | % 19.79/3.49 | | (42) xT = slcrc0 % 19.79/3.49 | | % 19.79/3.49 | | REDUCE: (6), (42) imply: % 19.79/3.49 | | (43) $false % 19.79/3.49 | | % 19.79/3.49 | | CLOSE: (43) is inconsistent. % 19.79/3.49 | | % 19.79/3.49 | End of split % 19.79/3.49 | % 19.79/3.49 End of proof % 19.79/3.49 % SZS output end Proof for theBenchmark % 19.79/3.49 % 19.79/3.49 2911ms %------------------------------------------------------------------------------