%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM521+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 : n008.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:21 EDT 2023 % Result : Theorem 11.64s 2.39s % Output : Proof 18.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NUM521+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.15/0.36 % Computer : n008.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 300 % 0.15/0.36 % DateTime : Fri Aug 25 16:30:17 EDT 2023 % 0.15/0.36 % CPUTime : % 0.22/0.62 ________ _____ % 0.22/0.62 ___ __ \_________(_)________________________________ % 0.22/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.62 % 0.22/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.62 (2023-06-19) % 0.22/0.62 % 0.22/0.62 (c) Philipp Rümmer, 2009-2023 % 0.22/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.62 Amanda Stjerna. % 0.22/0.62 Free software under BSD-3-Clause. % 0.22/0.62 % 0.22/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.62 % 0.22/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.22/0.64 Running up to 7 provers in parallel. % 0.22/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.62/1.22 Prover 1: Preprocessing ... % 3.62/1.22 Prover 4: Preprocessing ... % 3.72/1.26 Prover 3: Preprocessing ... % 3.72/1.26 Prover 0: Preprocessing ... % 3.72/1.26 Prover 2: Preprocessing ... % 3.72/1.26 Prover 5: Preprocessing ... % 3.72/1.26 Prover 6: Preprocessing ... % 8.90/1.99 Prover 1: Constructing countermodel ... % 8.90/2.00 Prover 6: Proving ... % 9.16/2.00 Prover 3: Constructing countermodel ... % 9.16/2.03 Prover 5: Constructing countermodel ... % 10.06/2.18 Prover 2: Proving ... % 10.54/2.39 Prover 3: proved (1740ms) % 11.64/2.39 % 11.64/2.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.64/2.39 % 11.64/2.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.64/2.39 Prover 6: stopped % 11.93/2.40 Prover 5: stopped % 11.93/2.41 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.93/2.41 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.93/2.41 Prover 2: stopped % 11.93/2.41 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.73/2.50 Prover 7: Preprocessing ... % 12.73/2.50 Prover 11: Preprocessing ... % 12.73/2.51 Prover 4: Constructing countermodel ... % 12.73/2.52 Prover 10: Preprocessing ... % 12.73/2.53 Prover 8: Preprocessing ... % 13.95/2.68 Prover 0: Proving ... % 13.95/2.69 Prover 0: stopped % 13.95/2.69 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 14.55/2.76 Prover 10: Constructing countermodel ... % 14.55/2.76 Prover 13: Preprocessing ... % 15.05/2.81 Prover 8: Warning: ignoring some quantifiers % 15.05/2.84 Prover 8: Constructing countermodel ... % 15.05/2.85 Prover 7: Constructing countermodel ... % 16.04/3.03 Prover 13: Constructing countermodel ... % 17.27/3.12 Prover 11: Constructing countermodel ... % 18.16/3.28 Prover 7: Found proof (size 30) % 18.16/3.28 Prover 7: proved (886ms) % 18.16/3.28 Prover 13: stopped % 18.16/3.28 Prover 4: stopped % 18.16/3.28 Prover 11: stopped % 18.16/3.28 Prover 10: stopped % 18.16/3.28 Prover 8: stopped % 18.16/3.28 Prover 1: stopped % 18.16/3.28 % 18.16/3.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.16/3.28 % 18.64/3.29 % SZS output start Proof for theBenchmark % 18.64/3.29 Assumptions after simplification: % 18.64/3.29 --------------------------------- % 18.64/3.29 % 18.64/3.29 (mDefPrime) % 18.64/3.30 $i(sz10) & $i(sz00) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | v1 = sz10 | ~ % 18.64/3.30 $i(v1) | ~ $i(v0) | ~ isPrime0(v0) | ~ doDivides0(v1, v0) | ~ % 18.64/3.30 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0)) & ! [v0: $i] : (v0 = sz10 | % 18.64/3.30 v0 = sz00 | ~ $i(v0) | ~ aNaturalNumber0(v0) | isPrime0(v0) | ? [v1: $i] % 18.64/3.30 : ( ~ (v1 = v0) & ~ (v1 = sz10) & $i(v1) & doDivides0(v1, v0) & % 18.64/3.30 aNaturalNumber0(v1))) & ( ~ isPrime0(sz10) | ~ aNaturalNumber0(sz10)) & ( % 18.64/3.30 ~ isPrime0(sz00) | ~ aNaturalNumber0(sz00)) % 18.64/3.30 % 18.64/3.30 (mLETotal) % 18.64/3.30 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v1) | % 18.64/3.30 ~ aNaturalNumber0(v0) | sdtlseqdt0(v1, v0) | sdtlseqdt0(v0, v1)) & ! [v0: % 18.64/3.30 $i] : ( ~ $i(v0) | ~ aNaturalNumber0(v0) | sdtlseqdt0(v0, v0)) % 18.64/3.30 % 18.64/3.30 (mSortsC_01) % 18.64/3.30 ~ (sz10 = sz00) & $i(sz10) & $i(sz00) & aNaturalNumber0(sz10) % 18.64/3.30 % 18.64/3.30 (m__) % 18.64/3.30 $i(xp) & $i(xm) & $i(xn) & ~ doDivides0(xp, xm) & ~ doDivides0(xp, xn) % 18.64/3.30 % 18.64/3.30 (m__1837) % 18.64/3.30 $i(xp) & $i(xm) & $i(xn) & aNaturalNumber0(xp) & aNaturalNumber0(xm) & % 18.64/3.30 aNaturalNumber0(xn) % 18.64/3.30 % 18.64/3.30 (m__1870) % 18.64/3.31 $i(xp) & $i(xn) & ~ sdtlseqdt0(xp, xn) % 18.64/3.31 % 18.64/3.31 (m__2075) % 18.64/3.31 $i(xp) & $i(xm) & ~ sdtlseqdt0(xp, xm) % 18.64/3.31 % 18.64/3.31 (m__2287) % 18.64/3.31 $i(xp) & $i(xm) & $i(xn) & (xp = xm | xp = xn | ~ sdtlseqdt0(xm, xp) | ~ % 18.64/3.31 sdtlseqdt0(xn, xp)) % 18.64/3.31 % 18.64/3.31 Further assumptions not needed in the proof: % 18.64/3.31 -------------------------------------------- % 18.64/3.31 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefDiv, mDefLE, mDefQuot, % 18.64/3.31 mDivAsso, mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym, mLENTr, % 18.64/3.31 mLERefl, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, mMulCanc, mMulComm, % 18.64/3.31 mNatSort, mPrimDiv, mSortsB, mSortsB_02, mSortsC, mZeroAdd, mZeroMul, m_AddZero, % 18.64/3.31 m_MulUnit, m_MulZero, m__1799, m__1860 % 18.64/3.31 % 18.64/3.31 Those formulas are unsatisfiable: % 18.64/3.31 --------------------------------- % 18.64/3.31 % 18.64/3.31 Begin of proof % 18.64/3.31 | % 18.64/3.31 | ALPHA: (mSortsC_01) implies: % 18.64/3.31 | (1) aNaturalNumber0(sz10) % 18.64/3.31 | % 18.64/3.31 | ALPHA: (mLETotal) implies: % 18.64/3.31 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 18.64/3.31 | aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | sdtlseqdt0(v1, v0) | % 18.64/3.31 | sdtlseqdt0(v0, v1)) % 18.64/3.31 | % 18.64/3.31 | ALPHA: (mDefPrime) implies: % 18.64/3.31 | (3) ~ isPrime0(sz10) | ~ aNaturalNumber0(sz10) % 18.64/3.31 | % 18.64/3.31 | ALPHA: (m__1837) implies: % 18.64/3.31 | (4) aNaturalNumber0(xn) % 18.64/3.31 | (5) aNaturalNumber0(xm) % 18.64/3.31 | (6) aNaturalNumber0(xp) % 18.64/3.31 | % 18.64/3.31 | ALPHA: (m__1870) implies: % 18.64/3.31 | (7) ~ sdtlseqdt0(xp, xn) % 18.64/3.31 | % 18.64/3.31 | ALPHA: (m__2075) implies: % 18.64/3.31 | (8) ~ sdtlseqdt0(xp, xm) % 18.64/3.31 | % 18.64/3.31 | ALPHA: (m__2287) implies: % 18.64/3.32 | (9) xp = xm | xp = xn | ~ sdtlseqdt0(xm, xp) | ~ sdtlseqdt0(xn, xp) % 18.64/3.32 | % 18.64/3.32 | ALPHA: (m__) implies: % 18.64/3.32 | (10) $i(xn) % 18.64/3.32 | (11) $i(xm) % 18.64/3.32 | (12) $i(xp) % 18.64/3.32 | % 18.64/3.32 | BETA: splitting (3) gives: % 18.64/3.32 | % 18.64/3.32 | Case 1: % 18.64/3.32 | | % 18.64/3.32 | | (13) ~ aNaturalNumber0(sz10) % 18.64/3.32 | | % 18.64/3.32 | | PRED_UNIFY: (1), (13) imply: % 18.64/3.32 | | (14) $false % 18.64/3.32 | | % 18.64/3.32 | | CLOSE: (14) is inconsistent. % 18.64/3.32 | | % 18.64/3.32 | Case 2: % 18.64/3.32 | | % 18.64/3.32 | | % 18.64/3.32 | | GROUND_INST: instantiating (2) with xn, xn, simplifying with (4), (10) % 18.64/3.32 | | gives: % 18.64/3.32 | | (15) sdtlseqdt0(xn, xn) % 18.64/3.32 | | % 18.64/3.32 | | GROUND_INST: instantiating (2) with xm, xm, simplifying with (5), (11) % 18.64/3.32 | | gives: % 18.64/3.32 | | (16) sdtlseqdt0(xm, xm) % 18.64/3.32 | | % 18.64/3.32 | | GROUND_INST: instantiating (2) with xm, xp, simplifying with (5), (6), (8), % 18.64/3.32 | | (11), (12) gives: % 18.64/3.32 | | (17) sdtlseqdt0(xm, xp) % 18.64/3.32 | | % 18.64/3.32 | | GROUND_INST: instantiating (2) with xn, xp, simplifying with (4), (6), (7), % 18.64/3.32 | | (10), (12) gives: % 18.64/3.32 | | (18) sdtlseqdt0(xn, xp) % 18.64/3.32 | | % 18.64/3.32 | | PRED_UNIFY: (7), (15) imply: % 18.64/3.32 | | (19) ~ (xp = xn) % 18.64/3.32 | | % 18.64/3.32 | | PRED_UNIFY: (8), (16) imply: % 18.64/3.32 | | (20) ~ (xp = xm) % 18.64/3.32 | | % 18.64/3.32 | | BETA: splitting (9) gives: % 18.64/3.32 | | % 18.64/3.32 | | Case 1: % 18.64/3.32 | | | % 18.64/3.32 | | | (21) ~ sdtlseqdt0(xm, xp) % 18.64/3.32 | | | % 18.64/3.32 | | | PRED_UNIFY: (17), (21) imply: % 18.64/3.32 | | | (22) $false % 18.64/3.32 | | | % 18.64/3.32 | | | CLOSE: (22) is inconsistent. % 18.64/3.32 | | | % 18.64/3.32 | | Case 2: % 18.64/3.32 | | | % 18.64/3.32 | | | (23) xp = xm | xp = xn | ~ sdtlseqdt0(xn, xp) % 18.64/3.32 | | | % 18.64/3.32 | | | BETA: splitting (23) gives: % 18.64/3.32 | | | % 18.64/3.32 | | | Case 1: % 18.64/3.32 | | | | % 18.64/3.32 | | | | (24) ~ sdtlseqdt0(xn, xp) % 18.64/3.32 | | | | % 18.64/3.32 | | | | PRED_UNIFY: (18), (24) imply: % 18.64/3.32 | | | | (25) $false % 18.64/3.32 | | | | % 18.64/3.32 | | | | CLOSE: (25) is inconsistent. % 18.64/3.32 | | | | % 18.64/3.32 | | | Case 2: % 18.64/3.32 | | | | % 18.64/3.32 | | | | (26) xp = xm | xp = xn % 18.64/3.32 | | | | % 18.64/3.33 | | | | BETA: splitting (26) gives: % 18.64/3.33 | | | | % 18.64/3.33 | | | | Case 1: % 18.64/3.33 | | | | | % 18.64/3.33 | | | | | (27) xp = xm % 18.64/3.33 | | | | | % 18.64/3.33 | | | | | REDUCE: (20), (27) imply: % 18.64/3.33 | | | | | (28) $false % 18.64/3.33 | | | | | % 18.64/3.33 | | | | | CLOSE: (28) is inconsistent. % 18.64/3.33 | | | | | % 18.64/3.33 | | | | Case 2: % 18.64/3.33 | | | | | % 18.64/3.33 | | | | | (29) xp = xn % 18.64/3.33 | | | | | % 18.64/3.33 | | | | | REDUCE: (19), (29) imply: % 18.64/3.33 | | | | | (30) $false % 18.64/3.33 | | | | | % 18.64/3.33 | | | | | CLOSE: (30) is inconsistent. % 18.64/3.33 | | | | | % 18.64/3.33 | | | | End of split % 18.64/3.33 | | | | % 18.64/3.33 | | | End of split % 18.64/3.33 | | | % 18.64/3.33 | | End of split % 18.64/3.33 | | % 18.64/3.33 | End of split % 18.64/3.33 | % 18.64/3.33 End of proof % 18.64/3.33 % SZS output end Proof for theBenchmark % 18.64/3.33 % 18.64/3.33 2702ms %------------------------------------------------------------------------------