%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM468+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 : n025.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:57 EDT 2023 % Result : Theorem 11.58s 2.34s % Output : Proof 16.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM468+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n025.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 : Fri Aug 25 13:39:22 EDT 2023 % 0.19/0.34 % CPUTime : % 0.20/0.59 ________ _____ % 0.20/0.59 ___ __ \_________(_)________________________________ % 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.59 % 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.59 (2023-06-19) % 0.20/0.59 % 0.20/0.59 (c) Philipp Rümmer, 2009-2023 % 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.59 Amanda Stjerna. % 0.20/0.59 Free software under BSD-3-Clause. % 0.20/0.59 % 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.59 % 0.20/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.60 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 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 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 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.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.14/1.10 Prover 4: Preprocessing ... % 3.14/1.11 Prover 1: Preprocessing ... % 3.14/1.15 Prover 3: Preprocessing ... % 3.14/1.15 Prover 0: Preprocessing ... % 3.14/1.15 Prover 5: Preprocessing ... % 3.14/1.15 Prover 6: Preprocessing ... % 3.14/1.15 Prover 2: Preprocessing ... % 8.54/1.94 Prover 1: Constructing countermodel ... % 9.42/2.02 Prover 3: Constructing countermodel ... % 9.42/2.03 Prover 6: Proving ... % 9.73/2.06 Prover 5: Constructing countermodel ... % 9.73/2.19 Prover 2: Proving ... % 10.64/2.27 Prover 4: Constructing countermodel ... % 11.58/2.34 Prover 3: proved (1722ms) % 11.58/2.34 % 11.58/2.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.58/2.34 % 11.58/2.34 Prover 5: stopped % 11.58/2.34 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.58/2.34 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.58/2.34 Prover 2: stopped % 11.58/2.35 Prover 6: stopped % 11.58/2.35 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.58/2.35 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.99/2.42 Prover 8: Preprocessing ... % 11.99/2.42 Prover 0: Proving ... % 11.99/2.42 Prover 0: stopped % 11.99/2.42 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 11.99/2.44 Prover 10: Preprocessing ... % 11.99/2.44 Prover 7: Preprocessing ... % 11.99/2.45 Prover 11: Preprocessing ... % 12.72/2.47 Prover 13: Preprocessing ... % 13.34/2.58 Prover 10: Constructing countermodel ... % 13.78/2.63 Prover 8: Warning: ignoring some quantifiers % 13.78/2.65 Prover 8: Constructing countermodel ... % 14.23/2.66 Prover 13: Constructing countermodel ... % 14.23/2.71 Prover 7: Constructing countermodel ... % 15.31/2.87 Prover 10: Found proof (size 32) % 15.31/2.87 Prover 10: proved (517ms) % 15.31/2.87 Prover 13: stopped % 15.31/2.87 Prover 8: stopped % 15.31/2.87 Prover 4: stopped % 15.31/2.87 Prover 7: stopped % 15.31/2.87 Prover 1: stopped % 15.31/2.91 Prover 11: Constructing countermodel ... % 15.31/2.93 Prover 11: stopped % 15.31/2.93 % 15.31/2.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.31/2.93 % 15.31/2.93 % SZS output start Proof for theBenchmark % 15.31/2.94 Assumptions after simplification: % 15.31/2.94 --------------------------------- % 15.31/2.94 % 15.31/2.94 (mAMDistr) % 16.24/2.96 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 16.24/2.96 $i] : ( ~ (sdtasdt0(v0, v2) = v4) | ~ (sdtasdt0(v0, v1) = v3) | ~ % 16.24/2.96 (sdtpldt0(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 16.24/2.96 aNaturalNumber0(v2) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | ? % 16.24/2.96 [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : (sdtasdt0(v6, v0) = v7 % 16.24/2.96 & sdtasdt0(v2, v0) = v9 & sdtasdt0(v1, v0) = v8 & sdtasdt0(v0, v6) = v5 & % 16.24/2.96 sdtpldt0(v8, v9) = v7 & sdtpldt0(v1, v2) = v6 & $i(v9) & $i(v8) & $i(v7) & % 16.24/2.96 $i(v6) & $i(v5))) % 16.24/2.96 % 16.24/2.96 (mDefDiv) % 16.24/2.96 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v2) = v1) | ~ % 16.24/2.96 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v2) | ~ % 16.24/2.96 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | doDivides0(v0, v1)) & ! [v0: % 16.24/2.96 $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ doDivides0(v0, v1) | ~ % 16.24/2.96 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | ? [v2: $i] : (sdtasdt0(v0, % 16.24/2.96 v2) = v1 & $i(v2) & aNaturalNumber0(v2))) % 16.24/2.97 % 16.24/2.97 (mDefQuot) % 16.24/2.97 $i(sz00) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | % 16.24/2.97 v0 = sz00 | ~ (sdtsldt0(v1, v0) = v2) | ~ (sdtasdt0(v0, v3) = v1) | ~ % 16.24/2.97 $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ doDivides0(v0, v1) | ~ % 16.24/2.97 aNaturalNumber0(v3) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0)) & ! % 16.24/2.97 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v1 | v0 = sz00 | ~ % 16.24/2.97 (sdtsldt0(v1, v0) = v2) | ~ (sdtasdt0(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) % 16.24/2.97 | ~ $i(v0) | ~ doDivides0(v0, v1) | ~ aNaturalNumber0(v1) | ~ % 16.24/2.97 aNaturalNumber0(v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 16.24/2.97 : (v0 = sz00 | ~ (sdtsldt0(v1, v0) = v2) | ~ (sdtasdt0(v0, v2) = v3) | ~ % 16.24/2.97 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ doDivides0(v0, v1) | ~ % 16.24/2.97 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | aNaturalNumber0(v2)) % 16.24/2.97 % 16.24/2.97 (m__) % 16.24/2.97 $i(xn) & $i(xm) & $i(xl) & $i(sz00) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] % 16.24/2.97 : ? [v3: $i] : ? [v4: $i] : ( ~ (v4 = v0) & ~ (xl = sz00) & sdtsldt0(xn, % 16.24/2.97 xl) = v2 & sdtsldt0(xm, xl) = v1 & sdtasdt0(xl, v3) = v4 & sdtpldt0(v1, % 16.24/2.97 v2) = v3 & sdtpldt0(xm, xn) = v0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 16.24/2.97 $i(v0)) % 16.24/2.97 % 16.24/2.97 (m__1240) % 16.24/2.97 $i(xn) & $i(xm) & $i(xl) & aNaturalNumber0(xn) & aNaturalNumber0(xm) & % 16.24/2.97 aNaturalNumber0(xl) % 16.24/2.97 % 16.24/2.97 (m__1240_04) % 16.24/2.97 $i(xn) & $i(xm) & $i(xl) & doDivides0(xl, xn) & doDivides0(xl, xm) % 16.24/2.97 % 16.24/2.97 (function-axioms) % 16.24/2.97 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.24/2.97 (sdtsldt0(v3, v2) = v1) | ~ (sdtsldt0(v3, v2) = v0)) & ! [v0: $i] : ! % 16.24/2.97 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtmndt0(v3, v2) = v1) | % 16.24/2.97 ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 16.24/2.97 [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 16.24/2.97 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.24/2.97 (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 16.24/2.97 % 16.24/2.97 Further assumptions not needed in the proof: % 16.24/2.97 -------------------------------------------- % 16.24/2.97 mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefLE, mDivTrans, mIH, mIH_03, mLEAsym, % 16.24/2.97 mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, % 16.24/2.97 mMulCanc, mMulComm, mNatSort, mSortsB, mSortsB_02, mSortsC, mSortsC_01, % 16.24/2.97 mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero % 16.24/2.97 % 16.24/2.97 Those formulas are unsatisfiable: % 16.24/2.97 --------------------------------- % 16.24/2.97 % 16.24/2.97 Begin of proof % 16.24/2.97 | % 16.24/2.97 | ALPHA: (mDefDiv) implies: % 16.24/2.98 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ doDivides0(v0, % 16.24/2.98 | v1) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | ? [v2: $i] % 16.24/2.98 | : (sdtasdt0(v0, v2) = v1 & $i(v2) & aNaturalNumber0(v2))) % 16.24/2.98 | % 16.24/2.98 | ALPHA: (mDefQuot) implies: % 16.24/2.98 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | v0 = % 16.24/2.98 | sz00 | ~ (sdtsldt0(v1, v0) = v2) | ~ (sdtasdt0(v0, v3) = v1) | ~ % 16.24/2.98 | $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ doDivides0(v0, v1) | ~ % 16.24/2.98 | aNaturalNumber0(v3) | ~ aNaturalNumber0(v1) | ~ % 16.24/2.98 | aNaturalNumber0(v0)) % 16.24/2.98 | % 16.24/2.98 | ALPHA: (m__1240) implies: % 16.24/2.98 | (3) aNaturalNumber0(xl) % 16.24/2.98 | (4) aNaturalNumber0(xm) % 16.24/2.98 | (5) aNaturalNumber0(xn) % 16.24/2.98 | % 16.24/2.98 | ALPHA: (m__1240_04) implies: % 16.24/2.98 | (6) doDivides0(xl, xm) % 16.24/2.98 | (7) doDivides0(xl, xn) % 16.24/2.98 | % 16.24/2.98 | ALPHA: (m__) implies: % 16.24/2.98 | (8) $i(xl) % 16.24/2.98 | (9) $i(xm) % 16.24/2.98 | (10) $i(xn) % 16.24/2.98 | (11) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 16.24/2.98 | ( ~ (v4 = v0) & ~ (xl = sz00) & sdtsldt0(xn, xl) = v2 & sdtsldt0(xm, % 16.24/2.98 | xl) = v1 & sdtasdt0(xl, v3) = v4 & sdtpldt0(v1, v2) = v3 & % 16.24/2.98 | sdtpldt0(xm, xn) = v0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 16.24/2.98 | % 16.24/2.98 | ALPHA: (function-axioms) implies: % 16.24/2.98 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.24/2.98 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 16.24/2.98 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.24/2.98 | (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 16.24/2.98 | % 16.24/2.98 | DELTA: instantiating (11) with fresh symbols all_32_0, all_32_1, all_32_2, % 16.24/2.98 | all_32_3, all_32_4 gives: % 16.24/2.98 | (14) ~ (all_32_0 = all_32_4) & ~ (xl = sz00) & sdtsldt0(xn, xl) = % 16.24/2.98 | all_32_2 & sdtsldt0(xm, xl) = all_32_3 & sdtasdt0(xl, all_32_1) = % 16.24/2.98 | all_32_0 & sdtpldt0(all_32_3, all_32_2) = all_32_1 & sdtpldt0(xm, xn) % 16.24/2.98 | = all_32_4 & $i(all_32_0) & $i(all_32_1) & $i(all_32_2) & $i(all_32_3) % 16.24/2.98 | & $i(all_32_4) % 16.24/2.98 | % 16.24/2.98 | ALPHA: (14) implies: % 16.24/2.98 | (15) ~ (xl = sz00) % 16.24/2.98 | (16) ~ (all_32_0 = all_32_4) % 16.24/2.98 | (17) sdtpldt0(xm, xn) = all_32_4 % 16.24/2.98 | (18) sdtpldt0(all_32_3, all_32_2) = all_32_1 % 16.24/2.98 | (19) sdtasdt0(xl, all_32_1) = all_32_0 % 16.24/2.98 | (20) sdtsldt0(xm, xl) = all_32_3 % 16.24/2.98 | (21) sdtsldt0(xn, xl) = all_32_2 % 16.24/2.98 | % 16.24/2.98 | GROUND_INST: instantiating (1) with xl, xm, simplifying with (3), (4), (6), % 16.24/2.98 | (8), (9) gives: % 16.24/2.98 | (22) ? [v0: $i] : (sdtasdt0(xl, v0) = xm & $i(v0) & aNaturalNumber0(v0)) % 16.24/2.99 | % 16.24/2.99 | GROUND_INST: instantiating (1) with xl, xn, simplifying with (3), (5), (7), % 16.24/2.99 | (8), (10) gives: % 16.24/2.99 | (23) ? [v0: $i] : (sdtasdt0(xl, v0) = xn & $i(v0) & aNaturalNumber0(v0)) % 16.24/2.99 | % 16.24/2.99 | DELTA: instantiating (23) with fresh symbol all_40_0 gives: % 16.24/2.99 | (24) sdtasdt0(xl, all_40_0) = xn & $i(all_40_0) & aNaturalNumber0(all_40_0) % 16.24/2.99 | % 16.24/2.99 | ALPHA: (24) implies: % 16.24/2.99 | (25) aNaturalNumber0(all_40_0) % 16.24/2.99 | (26) $i(all_40_0) % 16.24/2.99 | (27) sdtasdt0(xl, all_40_0) = xn % 16.24/2.99 | % 16.24/2.99 | DELTA: instantiating (22) with fresh symbol all_42_0 gives: % 16.24/2.99 | (28) sdtasdt0(xl, all_42_0) = xm & $i(all_42_0) & aNaturalNumber0(all_42_0) % 16.24/2.99 | % 16.24/2.99 | ALPHA: (28) implies: % 16.24/2.99 | (29) aNaturalNumber0(all_42_0) % 16.24/2.99 | (30) $i(all_42_0) % 16.24/2.99 | (31) sdtasdt0(xl, all_42_0) = xm % 16.24/2.99 | % 16.24/2.99 | GROUND_INST: instantiating (2) with xl, xn, all_32_2, all_40_0, simplifying % 16.24/2.99 | with (3), (5), (7), (8), (10), (21), (25), (26), (27) gives: % 16.24/2.99 | (32) all_40_0 = all_32_2 | xl = sz00 % 16.24/2.99 | % 16.24/2.99 | GROUND_INST: instantiating (mAMDistr) with xl, all_42_0, all_40_0, xm, xn, % 16.24/2.99 | all_32_4, simplifying with (3), (8), (17), (25), (26), (27), % 16.24/2.99 | (29), (30), (31) gives: % 16.24/2.99 | (33) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (sdtasdt0(v0, % 16.24/2.99 | xl) = v1 & sdtasdt0(all_42_0, xl) = v2 & sdtasdt0(all_40_0, xl) = % 16.24/2.99 | v3 & sdtasdt0(xl, v0) = all_32_4 & sdtpldt0(v2, v3) = v1 & % 16.24/2.99 | sdtpldt0(all_42_0, all_40_0) = v0 & $i(v3) & $i(v2) & $i(v1) & % 16.24/2.99 | $i(v0) & $i(all_32_4)) % 16.24/2.99 | % 16.24/2.99 | GROUND_INST: instantiating (2) with xl, xm, all_32_3, all_42_0, simplifying % 16.24/2.99 | with (3), (4), (6), (8), (9), (20), (29), (30), (31) gives: % 16.24/2.99 | (34) all_42_0 = all_32_3 | xl = sz00 % 16.24/2.99 | % 16.24/2.99 | DELTA: instantiating (33) with fresh symbols all_62_0, all_62_1, all_62_2, % 16.24/2.99 | all_62_3 gives: % 16.24/2.99 | (35) sdtasdt0(all_62_3, xl) = all_62_2 & sdtasdt0(all_42_0, xl) = all_62_1 % 16.24/2.99 | & sdtasdt0(all_40_0, xl) = all_62_0 & sdtasdt0(xl, all_62_3) = % 16.24/2.99 | all_32_4 & sdtpldt0(all_62_1, all_62_0) = all_62_2 & % 16.24/2.99 | sdtpldt0(all_42_0, all_40_0) = all_62_3 & $i(all_62_0) & $i(all_62_1) % 16.24/2.99 | & $i(all_62_2) & $i(all_62_3) & $i(all_32_4) % 16.24/2.99 | % 16.24/2.99 | ALPHA: (35) implies: % 16.24/2.99 | (36) sdtpldt0(all_42_0, all_40_0) = all_62_3 % 16.24/2.99 | (37) sdtasdt0(xl, all_62_3) = all_32_4 % 16.24/2.99 | % 16.24/2.99 | BETA: splitting (34) gives: % 16.24/2.99 | % 16.24/2.99 | Case 1: % 16.24/2.99 | | % 16.24/2.99 | | (38) xl = sz00 % 16.24/2.99 | | % 16.24/2.99 | | REDUCE: (15), (38) imply: % 16.24/2.99 | | (39) $false % 16.24/2.99 | | % 16.24/2.99 | | CLOSE: (39) is inconsistent. % 16.24/2.99 | | % 16.24/2.99 | Case 2: % 16.24/2.99 | | % 16.24/2.99 | | (40) all_42_0 = all_32_3 % 16.24/2.99 | | % 16.24/2.99 | | REDUCE: (36), (40) imply: % 16.24/3.00 | | (41) sdtpldt0(all_32_3, all_40_0) = all_62_3 % 16.24/3.00 | | % 16.24/3.00 | | BETA: splitting (32) gives: % 16.24/3.00 | | % 16.24/3.00 | | Case 1: % 16.24/3.00 | | | % 16.24/3.00 | | | (42) xl = sz00 % 16.24/3.00 | | | % 16.24/3.00 | | | REDUCE: (15), (42) imply: % 16.24/3.00 | | | (43) $false % 16.24/3.00 | | | % 16.24/3.00 | | | CLOSE: (43) is inconsistent. % 16.24/3.00 | | | % 16.24/3.00 | | Case 2: % 16.24/3.00 | | | % 16.24/3.00 | | | (44) all_40_0 = all_32_2 % 16.24/3.00 | | | % 16.24/3.00 | | | REDUCE: (41), (44) imply: % 16.24/3.00 | | | (45) sdtpldt0(all_32_3, all_32_2) = all_62_3 % 16.24/3.00 | | | % 16.24/3.00 | | | GROUND_INST: instantiating (12) with all_32_1, all_62_3, all_32_2, % 16.24/3.00 | | | all_32_3, simplifying with (18), (45) gives: % 16.24/3.00 | | | (46) all_62_3 = all_32_1 % 16.24/3.00 | | | % 16.24/3.00 | | | REDUCE: (37), (46) imply: % 16.24/3.00 | | | (47) sdtasdt0(xl, all_32_1) = all_32_4 % 16.24/3.00 | | | % 16.24/3.00 | | | GROUND_INST: instantiating (13) with all_32_0, all_32_4, all_32_1, xl, % 16.24/3.00 | | | simplifying with (19), (47) gives: % 16.24/3.00 | | | (48) all_32_0 = all_32_4 % 16.24/3.00 | | | % 16.24/3.00 | | | REDUCE: (16), (48) imply: % 16.24/3.00 | | | (49) $false % 16.24/3.00 | | | % 16.24/3.00 | | | CLOSE: (49) is inconsistent. % 16.24/3.00 | | | % 16.24/3.00 | | End of split % 16.24/3.00 | | % 16.24/3.00 | End of split % 16.24/3.00 | % 16.24/3.00 End of proof % 16.24/3.00 % SZS output end Proof for theBenchmark % 16.24/3.00 % 16.24/3.00 2405ms %------------------------------------------------------------------------------