%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM520+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 : n027.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 8.54s 2.09s % Output : Proof 13.92s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM520+3 : 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 : n027.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 09:16:48 EDT 2023 % 0.12/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.80/1.30 Prover 1: Preprocessing ... % 3.80/1.30 Prover 4: Preprocessing ... % 4.35/1.34 Prover 3: Preprocessing ... % 4.35/1.34 Prover 6: Preprocessing ... % 4.35/1.34 Prover 0: Preprocessing ... % 4.35/1.34 Prover 5: Preprocessing ... % 4.35/1.34 Prover 2: Preprocessing ... % 8.54/2.05 Prover 3: Constructing countermodel ... % 8.54/2.05 Prover 6: Constructing countermodel ... % 8.54/2.08 Prover 3: proved (1449ms) % 8.54/2.09 % 8.54/2.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.54/2.09 % 8.54/2.11 Prover 6: proved (1447ms) % 8.54/2.11 % 8.54/2.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.54/2.11 % 8.54/2.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.54/2.11 Prover 5: Constructing countermodel ... % 8.54/2.12 Prover 5: stopped % 9.79/2.15 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.79/2.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.79/2.18 Prover 1: Constructing countermodel ... % 10.53/2.22 Prover 7: Preprocessing ... % 10.53/2.23 Prover 8: Preprocessing ... % 10.53/2.27 Prover 10: Preprocessing ... % 11.18/2.33 Prover 2: Constructing countermodel ... % 11.18/2.33 Prover 2: stopped % 11.18/2.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.83/2.42 Prover 1: Found proof (size 7) % 11.83/2.42 Prover 1: proved (1789ms) % 12.62/2.51 Prover 11: Preprocessing ... % 12.62/2.53 Prover 0: Constructing countermodel ... % 12.62/2.53 Prover 0: stopped % 12.62/2.55 Prover 8: Warning: ignoring some quantifiers % 12.62/2.56 Prover 8: Constructing countermodel ... % 12.62/2.58 Prover 10: Constructing countermodel ... % 12.62/2.58 Prover 8: stopped % 13.38/2.60 Prover 11: stopped % 13.38/2.60 Prover 10: stopped % 13.38/2.63 Prover 4: Constructing countermodel ... % 13.38/2.65 Prover 4: stopped % 13.38/2.66 Prover 7: Constructing countermodel ... % 13.38/2.67 Prover 7: stopped % 13.38/2.67 % 13.38/2.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.38/2.67 % 13.38/2.68 % SZS output start Proof for theBenchmark % 13.38/2.68 Assumptions after simplification: % 13.38/2.68 --------------------------------- % 13.38/2.68 % 13.38/2.68 (m__2315) % 13.38/2.69 ~ (xk = sz10) & ~ (xk = sz00) & $i(xk) & $i(sz10) & $i(sz00) % 13.38/2.69 % 13.38/2.69 (m__2327) % 13.38/2.69 $i(xk) & $i(sz10) & $i(sz00) & (xk = sz10 | xk = sz00) % 13.38/2.69 % 13.38/2.69 Further assumptions not needed in the proof: % 13.38/2.69 -------------------------------------------- % 13.38/2.69 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefDiv, mDefLE, mDefPrime, % 13.38/2.69 mDefQuot, mDivAsso, mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym, % 13.38/2.69 mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, % 13.38/2.69 mMulCanc, mMulComm, mNatSort, mPrimDiv, mSortsB, mSortsB_02, mSortsC, % 13.38/2.69 mSortsC_01, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero, m__, m__1799, % 13.38/2.69 m__1837, m__1860, m__1870, m__2075, m__2287, m__2306 % 13.38/2.69 % 13.38/2.69 Those formulas are unsatisfiable: % 13.38/2.69 --------------------------------- % 13.38/2.69 % 13.38/2.69 Begin of proof % 13.38/2.69 | % 13.38/2.69 | ALPHA: (m__2315) implies: % 13.38/2.69 | (1) ~ (xk = sz00) % 13.38/2.69 | (2) ~ (xk = sz10) % 13.38/2.69 | % 13.38/2.69 | ALPHA: (m__2327) implies: % 13.38/2.69 | (3) xk = sz10 | xk = sz00 % 13.38/2.69 | % 13.38/2.69 | BETA: splitting (3) gives: % 13.38/2.69 | % 13.38/2.69 | Case 1: % 13.38/2.69 | | % 13.38/2.69 | | (4) xk = sz00 % 13.38/2.69 | | % 13.38/2.69 | | REDUCE: (1), (4) imply: % 13.38/2.69 | | (5) $false % 13.38/2.69 | | % 13.38/2.69 | | CLOSE: (5) is inconsistent. % 13.38/2.69 | | % 13.38/2.69 | Case 2: % 13.38/2.69 | | % 13.38/2.69 | | (6) xk = sz10 % 13.38/2.69 | | % 13.38/2.69 | | REDUCE: (2), (6) imply: % 13.38/2.69 | | (7) $false % 13.92/2.69 | | % 13.92/2.69 | | CLOSE: (7) is inconsistent. % 13.92/2.69 | | % 13.92/2.69 | End of split % 13.92/2.69 | % 13.92/2.69 End of proof % 13.92/2.69 % SZS output end Proof for theBenchmark % 13.92/2.69 % 13.92/2.69 2080ms %------------------------------------------------------------------------------