%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM514+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n024.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:17 EDT 2023 % Result : Theorem 14.80s 2.78s % Output : Proof 24.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM514+3 : TPTP v8.1.2. Released v4.0.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n024.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Aug 25 16:05:09 EDT 2023 % 0.14/0.34 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.91/1.34 Prover 4: Preprocessing ... % 3.91/1.35 Prover 1: Preprocessing ... % 3.91/1.38 Prover 3: Preprocessing ... % 3.91/1.39 Prover 0: Preprocessing ... % 3.91/1.39 Prover 6: Preprocessing ... % 3.91/1.39 Prover 2: Preprocessing ... % 3.91/1.39 Prover 5: Preprocessing ... % 11.02/2.27 Prover 1: Constructing countermodel ... % 11.02/2.30 Prover 3: Constructing countermodel ... % 11.02/2.31 Prover 6: Proving ... % 11.71/2.37 Prover 5: Constructing countermodel ... % 13.32/2.60 Prover 4: Constructing countermodel ... % 13.32/2.62 Prover 2: Proving ... % 14.80/2.76 Prover 0: Proving ... % 14.80/2.77 Prover 3: proved (2140ms) % 14.80/2.78 % 14.80/2.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.80/2.78 % 14.80/2.78 Prover 5: stopped % 14.80/2.78 Prover 6: stopped % 14.80/2.78 Prover 0: stopped % 14.80/2.78 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.80/2.78 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.80/2.78 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.80/2.78 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 15.24/2.84 Prover 2: stopped % 15.24/2.85 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.65/3.01 Prover 8: Preprocessing ... % 16.65/3.04 Prover 7: Preprocessing ... % 17.13/3.09 Prover 11: Preprocessing ... % 17.13/3.10 Prover 13: Preprocessing ... % 17.55/3.10 Prover 10: Preprocessing ... % 19.05/3.39 Prover 10: Constructing countermodel ... % 19.05/3.39 Prover 8: Warning: ignoring some quantifiers % 19.05/3.39 Prover 7: Constructing countermodel ... % 19.05/3.39 Prover 8: Constructing countermodel ... % 20.62/3.56 Prover 13: Constructing countermodel ... % 22.97/3.88 Prover 11: Constructing countermodel ... % 23.68/3.99 Prover 10: Found proof (size 32) % 23.68/3.99 Prover 10: proved (1209ms) % 23.68/3.99 Prover 13: stopped % 23.68/3.99 Prover 1: stopped % 23.68/3.99 Prover 4: stopped % 23.68/3.99 Prover 7: stopped % 23.68/3.99 Prover 8: stopped % 23.68/4.00 Prover 11: stopped % 23.68/4.00 % 23.68/4.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.68/4.00 % 23.68/4.00 % SZS output start Proof for theBenchmark % 23.68/4.01 Assumptions after simplification: % 23.68/4.01 --------------------------------- % 23.68/4.01 % 23.68/4.01 (m__) % 23.68/4.03 $i(xr) & $i(xp) & $i(xm) & $i(xn) & ? [v0: $i] : ? [v1: $i] : (sdtsldt0(xn, % 23.68/4.03 xr) = v0 & sdtasdt0(v0, xm) = v1 & sdtasdt0(xr, v0) = xn & $i(v1) & $i(v0) % 23.68/4.03 & aNaturalNumber0(v0) & ~ doDivides0(xp, v1) & ! [v2: $i] : ( ~ % 23.68/4.03 (sdtasdt0(xp, v2) = v1) | ~ $i(v2) | ~ aNaturalNumber0(v2))) % 23.68/4.03 % 23.68/4.03 (m__2504) % 23.68/4.03 $i(xr) & $i(xn) & ? [v0: $i] : ? [v1: $i] : ( ~ (v0 = xn) & sdtsldt0(xn, xr) % 23.68/4.03 = v0 & sdtasdt0(xr, v0) = xn & sdtpldt0(v0, v1) = xn & $i(v1) & $i(v0) & % 23.68/4.03 sdtlseqdt0(v0, xn) & aNaturalNumber0(v1) & aNaturalNumber0(v0)) % 23.68/4.03 % 23.68/4.03 (m__2576) % 23.68/4.04 $i(xr) & $i(xk) & $i(xp) & $i(xm) & $i(xn) & ? [v0: $i] : ? [v1: $i] : ? % 23.68/4.04 [v2: $i] : ? [v3: $i] : ? [v4: $i] : (sdtsldt0(v3, xr) = v4 & sdtsldt0(xn, % 23.68/4.04 xr) = v0 & sdtasdt0(v4, xr) = v2 & sdtasdt0(v1, xr) = v2 & sdtasdt0(v0, % 23.68/4.04 xm) = v1 & sdtasdt0(xr, v4) = v3 & sdtasdt0(xr, v0) = xn & sdtasdt0(xp, % 23.68/4.04 xk) = v3 & sdtasdt0(xn, xm) = v2 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 23.68/4.04 $i(v0) & aNaturalNumber0(v4) & aNaturalNumber0(v0)) % 23.68/4.04 % 23.68/4.04 (m__2613) % 23.68/4.04 $i(xr) & $i(xk) & $i(xp) & $i(xm) & $i(xn) & ? [v0: $i] : ? [v1: $i] : ? % 23.68/4.04 [v2: $i] : (sdtsldt0(xk, xr) = v0 & sdtsldt0(xn, xr) = v1 & sdtasdt0(v1, xm) = % 23.68/4.04 v2 & sdtasdt0(xr, v1) = xn & sdtasdt0(xr, v0) = xk & sdtasdt0(xp, v0) = v2 & % 23.68/4.04 $i(v2) & $i(v1) & $i(v0) & aNaturalNumber0(v1) & aNaturalNumber0(v0)) % 23.68/4.04 % 23.68/4.04 (function-axioms) % 23.68/4.04 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 23.68/4.04 (sdtsldt0(v3, v2) = v1) | ~ (sdtsldt0(v3, v2) = v0)) & ! [v0: $i] : ! % 23.68/4.04 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtmndt0(v3, v2) = v1) | % 23.68/4.04 ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 23.68/4.04 [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 23.68/4.04 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 23.68/4.04 (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 23.68/4.04 % 23.68/4.04 Further assumptions not needed in the proof: % 23.68/4.04 -------------------------------------------- % 23.68/4.04 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefDiv, mDefLE, mDefPrime, % 23.68/4.04 mDefQuot, mDivAsso, mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym, % 23.68/4.04 mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, % 23.68/4.04 mMulCanc, mMulComm, mNatSort, mPrimDiv, mSortsB, mSortsB_02, mSortsC, % 23.68/4.04 mSortsC_01, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero, m__1799, % 23.68/4.04 m__1837, m__1860, m__1870, m__2075, m__2287, m__2306, m__2315, m__2327, m__2342, % 23.68/4.04 m__2362, m__2377, m__2449, m__2487 % 23.68/4.04 % 23.68/4.04 Those formulas are unsatisfiable: % 23.68/4.04 --------------------------------- % 23.68/4.04 % 23.68/4.04 Begin of proof % 23.68/4.04 | % 23.68/4.04 | ALPHA: (m__2504) implies: % 24.44/4.04 | (1) ? [v0: $i] : ? [v1: $i] : ( ~ (v0 = xn) & sdtsldt0(xn, xr) = v0 & % 24.44/4.04 | sdtasdt0(xr, v0) = xn & sdtpldt0(v0, v1) = xn & $i(v1) & $i(v0) & % 24.44/4.04 | sdtlseqdt0(v0, xn) & aNaturalNumber0(v1) & aNaturalNumber0(v0)) % 24.44/4.04 | % 24.44/4.04 | ALPHA: (m__2576) implies: % 24.44/4.05 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 24.44/4.05 | (sdtsldt0(v3, xr) = v4 & sdtsldt0(xn, xr) = v0 & sdtasdt0(v4, xr) = v2 % 24.44/4.05 | & sdtasdt0(v1, xr) = v2 & sdtasdt0(v0, xm) = v1 & sdtasdt0(xr, v4) = % 24.44/4.05 | v3 & sdtasdt0(xr, v0) = xn & sdtasdt0(xp, xk) = v3 & sdtasdt0(xn, xm) % 24.44/4.05 | = v2 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 24.44/4.05 | aNaturalNumber0(v4) & aNaturalNumber0(v0)) % 24.44/4.05 | % 24.44/4.05 | ALPHA: (m__2613) implies: % 24.67/4.05 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (sdtsldt0(xk, xr) = v0 & % 24.67/4.05 | sdtsldt0(xn, xr) = v1 & sdtasdt0(v1, xm) = v2 & sdtasdt0(xr, v1) = xn % 24.67/4.05 | & sdtasdt0(xr, v0) = xk & sdtasdt0(xp, v0) = v2 & $i(v2) & $i(v1) & % 24.67/4.05 | $i(v0) & aNaturalNumber0(v1) & aNaturalNumber0(v0)) % 24.67/4.05 | % 24.67/4.05 | ALPHA: (m__) implies: % 24.67/4.05 | (4) ? [v0: $i] : ? [v1: $i] : (sdtsldt0(xn, xr) = v0 & sdtasdt0(v0, xm) = % 24.67/4.05 | v1 & sdtasdt0(xr, v0) = xn & $i(v1) & $i(v0) & aNaturalNumber0(v0) & % 24.67/4.05 | ~ doDivides0(xp, v1) & ! [v2: $i] : ( ~ (sdtasdt0(xp, v2) = v1) | ~ % 24.67/4.05 | $i(v2) | ~ aNaturalNumber0(v2))) % 24.67/4.05 | % 24.67/4.05 | ALPHA: (function-axioms) implies: % 24.67/4.05 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 24.67/4.05 | (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 24.67/4.05 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 24.67/4.05 | (sdtsldt0(v3, v2) = v1) | ~ (sdtsldt0(v3, v2) = v0)) % 24.67/4.05 | % 24.67/4.05 | DELTA: instantiating (1) with fresh symbols all_46_0, all_46_1 gives: % 24.67/4.05 | (7) ~ (all_46_1 = xn) & sdtsldt0(xn, xr) = all_46_1 & sdtasdt0(xr, % 24.67/4.05 | all_46_1) = xn & sdtpldt0(all_46_1, all_46_0) = xn & $i(all_46_0) & % 24.67/4.05 | $i(all_46_1) & sdtlseqdt0(all_46_1, xn) & aNaturalNumber0(all_46_0) & % 24.67/4.05 | aNaturalNumber0(all_46_1) % 24.67/4.05 | % 24.67/4.05 | ALPHA: (7) implies: % 24.67/4.05 | (8) sdtsldt0(xn, xr) = all_46_1 % 24.67/4.05 | % 24.67/4.05 | DELTA: instantiating (4) with fresh symbols all_52_0, all_52_1 gives: % 24.67/4.05 | (9) sdtsldt0(xn, xr) = all_52_1 & sdtasdt0(all_52_1, xm) = all_52_0 & % 24.67/4.05 | sdtasdt0(xr, all_52_1) = xn & $i(all_52_0) & $i(all_52_1) & % 24.67/4.05 | aNaturalNumber0(all_52_1) & ~ doDivides0(xp, all_52_0) & ! [v0: $i] : % 24.67/4.05 | ( ~ (sdtasdt0(xp, v0) = all_52_0) | ~ $i(v0) | ~ aNaturalNumber0(v0)) % 24.67/4.05 | % 24.67/4.05 | ALPHA: (9) implies: % 24.67/4.05 | (10) sdtasdt0(all_52_1, xm) = all_52_0 % 24.67/4.05 | (11) sdtsldt0(xn, xr) = all_52_1 % 24.67/4.05 | (12) ! [v0: $i] : ( ~ (sdtasdt0(xp, v0) = all_52_0) | ~ $i(v0) | ~ % 24.67/4.05 | aNaturalNumber0(v0)) % 24.67/4.05 | % 24.67/4.05 | DELTA: instantiating (3) with fresh symbols all_57_0, all_57_1, all_57_2 % 24.67/4.05 | gives: % 24.67/4.05 | (13) sdtsldt0(xk, xr) = all_57_2 & sdtsldt0(xn, xr) = all_57_1 & % 24.67/4.05 | sdtasdt0(all_57_1, xm) = all_57_0 & sdtasdt0(xr, all_57_1) = xn & % 24.67/4.05 | sdtasdt0(xr, all_57_2) = xk & sdtasdt0(xp, all_57_2) = all_57_0 & % 24.67/4.05 | $i(all_57_0) & $i(all_57_1) & $i(all_57_2) & aNaturalNumber0(all_57_1) % 24.67/4.05 | & aNaturalNumber0(all_57_2) % 24.67/4.05 | % 24.67/4.05 | ALPHA: (13) implies: % 24.67/4.05 | (14) aNaturalNumber0(all_57_2) % 24.67/4.05 | (15) $i(all_57_2) % 24.67/4.05 | (16) sdtasdt0(xp, all_57_2) = all_57_0 % 24.67/4.05 | (17) sdtasdt0(all_57_1, xm) = all_57_0 % 24.67/4.05 | (18) sdtsldt0(xn, xr) = all_57_1 % 24.67/4.05 | % 24.67/4.05 | DELTA: instantiating (2) with fresh symbols all_59_0, all_59_1, all_59_2, % 24.67/4.05 | all_59_3, all_59_4 gives: % 24.67/4.06 | (19) sdtsldt0(all_59_1, xr) = all_59_0 & sdtsldt0(xn, xr) = all_59_4 & % 24.67/4.06 | sdtasdt0(all_59_0, xr) = all_59_2 & sdtasdt0(all_59_3, xr) = all_59_2 % 24.67/4.06 | & sdtasdt0(all_59_4, xm) = all_59_3 & sdtasdt0(xr, all_59_0) = % 24.67/4.06 | all_59_1 & sdtasdt0(xr, all_59_4) = xn & sdtasdt0(xp, xk) = all_59_1 & % 24.67/4.06 | sdtasdt0(xn, xm) = all_59_2 & $i(all_59_0) & $i(all_59_1) & % 24.67/4.06 | $i(all_59_2) & $i(all_59_3) & $i(all_59_4) & aNaturalNumber0(all_59_0) % 24.67/4.06 | & aNaturalNumber0(all_59_4) % 24.67/4.06 | % 24.67/4.06 | ALPHA: (19) implies: % 24.72/4.06 | (20) sdtasdt0(all_59_4, xm) = all_59_3 % 24.72/4.06 | (21) sdtsldt0(xn, xr) = all_59_4 % 24.72/4.06 | % 24.72/4.06 | GROUND_INST: instantiating (6) with all_46_1, all_57_1, xr, xn, simplifying % 24.72/4.06 | with (8), (18) gives: % 24.72/4.06 | (22) all_57_1 = all_46_1 % 24.72/4.06 | % 24.72/4.06 | GROUND_INST: instantiating (6) with all_57_1, all_59_4, xr, xn, simplifying % 24.72/4.06 | with (18), (21) gives: % 24.72/4.06 | (23) all_59_4 = all_57_1 % 24.72/4.06 | % 24.72/4.06 | GROUND_INST: instantiating (6) with all_52_1, all_59_4, xr, xn, simplifying % 24.72/4.06 | with (11), (21) gives: % 24.72/4.06 | (24) all_59_4 = all_52_1 % 24.72/4.06 | % 24.72/4.06 | COMBINE_EQS: (23), (24) imply: % 24.72/4.06 | (25) all_57_1 = all_52_1 % 24.72/4.06 | % 24.72/4.06 | SIMP: (25) implies: % 24.72/4.06 | (26) all_57_1 = all_52_1 % 24.72/4.06 | % 24.72/4.06 | COMBINE_EQS: (22), (26) imply: % 24.72/4.06 | (27) all_52_1 = all_46_1 % 24.72/4.06 | % 24.72/4.06 | COMBINE_EQS: (24), (27) imply: % 24.72/4.06 | (28) all_59_4 = all_46_1 % 24.72/4.06 | % 24.72/4.06 | REDUCE: (20), (28) imply: % 24.72/4.06 | (29) sdtasdt0(all_46_1, xm) = all_59_3 % 24.72/4.06 | % 24.72/4.06 | REDUCE: (17), (22) imply: % 24.72/4.06 | (30) sdtasdt0(all_46_1, xm) = all_57_0 % 24.72/4.06 | % 24.72/4.06 | REDUCE: (10), (27) imply: % 24.72/4.06 | (31) sdtasdt0(all_46_1, xm) = all_52_0 % 24.72/4.06 | % 24.72/4.06 | GROUND_INST: instantiating (5) with all_57_0, all_59_3, xm, all_46_1, % 24.72/4.06 | simplifying with (29), (30) gives: % 24.72/4.06 | (32) all_59_3 = all_57_0 % 24.72/4.06 | % 24.72/4.06 | GROUND_INST: instantiating (5) with all_52_0, all_59_3, xm, all_46_1, % 24.72/4.06 | simplifying with (29), (31) gives: % 24.72/4.06 | (33) all_59_3 = all_52_0 % 24.72/4.06 | % 24.72/4.06 | COMBINE_EQS: (32), (33) imply: % 24.72/4.06 | (34) all_57_0 = all_52_0 % 24.72/4.06 | % 24.72/4.06 | SIMP: (34) implies: % 24.72/4.06 | (35) all_57_0 = all_52_0 % 24.72/4.06 | % 24.72/4.06 | REDUCE: (16), (35) imply: % 24.72/4.06 | (36) sdtasdt0(xp, all_57_2) = all_52_0 % 24.72/4.06 | % 24.72/4.06 | GROUND_INST: instantiating (12) with all_57_2, simplifying with (14), (15), % 24.72/4.06 | (36) gives: % 24.72/4.06 | (37) $false % 24.72/4.06 | % 24.72/4.06 | CLOSE: (37) is inconsistent. % 24.72/4.06 | % 24.72/4.06 End of proof % 24.72/4.06 % SZS output end Proof for theBenchmark % 24.72/4.06 % 24.72/4.06 3450ms %------------------------------------------------------------------------------