%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : RNG095+2 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n031.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 13:57:50 EDT 2023 % Result : Theorem 23.11s 3.86s % Output : Proof 25.99s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : RNG095+2 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n031.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 : Sun Aug 27 02:33:08 EDT 2023 % 0.20/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 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 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 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 % 2.85/1.14 Prover 4: Preprocessing ... % 2.85/1.14 Prover 1: Preprocessing ... % 3.19/1.18 Prover 2: Preprocessing ... % 3.19/1.18 Prover 3: Preprocessing ... % 3.19/1.18 Prover 5: Preprocessing ... % 3.19/1.18 Prover 0: Preprocessing ... % 3.19/1.18 Prover 6: Preprocessing ... % 8.20/1.89 Prover 6: Proving ... % 8.20/1.89 Prover 3: Constructing countermodel ... % 8.20/1.89 Prover 5: Proving ... % 8.20/1.89 Prover 1: Constructing countermodel ... % 9.30/2.01 Prover 2: Proving ... % 9.30/2.04 Prover 0: Proving ... % 9.68/2.06 Prover 4: Constructing countermodel ... % 23.11/3.86 Prover 0: proved (3235ms) % 23.11/3.86 % 23.11/3.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.11/3.86 % 23.11/3.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 23.11/3.86 Prover 2: stopped % 23.11/3.86 Prover 6: stopped % 23.11/3.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 23.11/3.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 23.41/3.87 Prover 3: stopped % 23.41/3.87 Prover 5: stopped % 23.41/3.88 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 23.41/3.88 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.41/3.92 Prover 10: Preprocessing ... % 23.92/3.95 Prover 13: Preprocessing ... % 23.92/3.95 Prover 11: Preprocessing ... % 23.92/3.95 Prover 8: Preprocessing ... % 24.16/3.97 Prover 7: Preprocessing ... % 24.60/4.08 Prover 10: Constructing countermodel ... % 24.60/4.09 Prover 13: Warning: ignoring some quantifiers % 24.60/4.09 Prover 8: Warning: ignoring some quantifiers % 24.60/4.10 Prover 8: Constructing countermodel ... % 24.60/4.10 Prover 13: Constructing countermodel ... % 24.60/4.11 Prover 7: Constructing countermodel ... % 24.60/4.17 Prover 10: Found proof (size 10) % 24.60/4.17 Prover 10: proved (306ms) % 25.23/4.17 Prover 13: stopped % 25.23/4.17 Prover 7: stopped % 25.23/4.18 Prover 8: stopped % 25.23/4.18 Prover 1: stopped % 25.23/4.19 Prover 4: stopped % 25.23/4.19 Prover 11: Constructing countermodel ... % 25.23/4.20 Prover 11: stopped % 25.23/4.20 % 25.23/4.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 25.23/4.20 % 25.23/4.21 % SZS output start Proof for theBenchmark % 25.23/4.21 Assumptions after simplification: % 25.23/4.21 --------------------------------- % 25.23/4.21 % 25.23/4.21 (mSortsC_01) % 25.23/4.21 $i(sz10) & aElement0(sz10) % 25.23/4.21 % 25.23/4.21 (m__) % 25.23/4.23 $i(xJ) & $i(xI) & $i(sz10) & ! [v0: $i] : ! [v1: $i] : ( ~ (sdtpldt0(v0, v1) % 25.23/4.23 = sz10) | ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v1, xJ) | ~ % 25.23/4.23 aElementOf0(v0, xI)) % 25.23/4.23 % 25.23/4.23 (m__1205_03) % 25.23/4.23 $i(xJ) & $i(xI) & ? [v0: $i] : (sdtpldt1(xI, xJ) = v0 & $i(v0) & ! [v1: $i] % 25.23/4.23 : ( ~ $i(v1) | ~ aElement0(v1) | aElementOf0(v1, v0)) & ! [v1: $i] : ( ~ % 25.23/4.23 $i(v1) | ~ aElement0(v1) | ? [v2: $i] : ? [v3: $i] : (sdtpldt0(v2, v3) % 25.23/4.23 = v1 & $i(v3) & $i(v2) & aElementOf0(v3, xJ) & aElementOf0(v2, xI)))) % 25.23/4.23 % 25.23/4.23 Further assumptions not needed in the proof: % 25.23/4.23 -------------------------------------------- % 25.23/4.23 mAMDistr, mAddAsso, mAddComm, mAddInvr, mAddZero, mCancel, mDefIdeal, mDefMod, % 25.23/4.24 mDefSInt, mDefSSum, mEOfElem, mElmSort, mIdeInt, mIdeSum, mMulAsso, mMulComm, % 25.23/4.24 mMulMnOne, mMulUnit, mMulZero, mSetEq, mSetSort, mSortsB, mSortsB_02, mSortsC, % 25.23/4.24 mSortsU, mUnNeZr, m__1205, m__1217 % 25.23/4.24 % 25.23/4.24 Those formulas are unsatisfiable: % 25.23/4.24 --------------------------------- % 25.23/4.24 % 25.23/4.24 Begin of proof % 25.23/4.24 | % 25.23/4.24 | ALPHA: (mSortsC_01) implies: % 25.23/4.24 | (1) aElement0(sz10) % 25.23/4.24 | % 25.23/4.24 | ALPHA: (m__1205_03) implies: % 25.23/4.24 | (2) ? [v0: $i] : (sdtpldt1(xI, xJ) = v0 & $i(v0) & ! [v1: $i] : ( ~ % 25.23/4.24 | $i(v1) | ~ aElement0(v1) | aElementOf0(v1, v0)) & ! [v1: $i] : ( % 25.23/4.24 | ~ $i(v1) | ~ aElement0(v1) | ? [v2: $i] : ? [v3: $i] : % 25.23/4.24 | (sdtpldt0(v2, v3) = v1 & $i(v3) & $i(v2) & aElementOf0(v3, xJ) & % 25.23/4.24 | aElementOf0(v2, xI)))) % 25.23/4.24 | % 25.23/4.24 | ALPHA: (m__) implies: % 25.23/4.24 | (3) $i(sz10) % 25.23/4.24 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ (sdtpldt0(v0, v1) = sz10) | ~ $i(v1) | % 25.23/4.24 | ~ $i(v0) | ~ aElementOf0(v1, xJ) | ~ aElementOf0(v0, xI)) % 25.23/4.24 | % 25.23/4.24 | DELTA: instantiating (2) with fresh symbol all_30_0 gives: % 25.23/4.24 | (5) sdtpldt1(xI, xJ) = all_30_0 & $i(all_30_0) & ! [v0: $i] : ( ~ $i(v0) | % 25.23/4.24 | ~ aElement0(v0) | aElementOf0(v0, all_30_0)) & ! [v0: $i] : ( ~ % 25.23/4.24 | $i(v0) | ~ aElement0(v0) | ? [v1: $i] : ? [v2: $i] : (sdtpldt0(v1, % 25.23/4.24 | v2) = v0 & $i(v2) & $i(v1) & aElementOf0(v2, xJ) & % 25.23/4.24 | aElementOf0(v1, xI))) % 25.23/4.24 | % 25.23/4.24 | ALPHA: (5) implies: % 25.99/4.24 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ aElement0(v0) | ? [v1: $i] : ? [v2: $i] % 25.99/4.24 | : (sdtpldt0(v1, v2) = v0 & $i(v2) & $i(v1) & aElementOf0(v2, xJ) & % 25.99/4.24 | aElementOf0(v1, xI))) % 25.99/4.24 | % 25.99/4.24 | GROUND_INST: instantiating (6) with sz10, simplifying with (1), (3) gives: % 25.99/4.24 | (7) ? [v0: $i] : ? [v1: $i] : (sdtpldt0(v0, v1) = sz10 & $i(v1) & $i(v0) % 25.99/4.24 | & aElementOf0(v1, xJ) & aElementOf0(v0, xI)) % 25.99/4.24 | % 25.99/4.24 | DELTA: instantiating (7) with fresh symbols all_45_0, all_45_1 gives: % 25.99/4.24 | (8) sdtpldt0(all_45_1, all_45_0) = sz10 & $i(all_45_0) & $i(all_45_1) & % 25.99/4.24 | aElementOf0(all_45_0, xJ) & aElementOf0(all_45_1, xI) % 25.99/4.24 | % 25.99/4.24 | ALPHA: (8) implies: % 25.99/4.25 | (9) aElementOf0(all_45_1, xI) % 25.99/4.25 | (10) aElementOf0(all_45_0, xJ) % 25.99/4.25 | (11) $i(all_45_1) % 25.99/4.25 | (12) $i(all_45_0) % 25.99/4.25 | (13) sdtpldt0(all_45_1, all_45_0) = sz10 % 25.99/4.25 | % 25.99/4.25 | GROUND_INST: instantiating (4) with all_45_1, all_45_0, simplifying with (9), % 25.99/4.25 | (10), (11), (12), (13) gives: % 25.99/4.25 | (14) $false % 25.99/4.25 | % 25.99/4.25 | CLOSE: (14) is inconsistent. % 25.99/4.25 | % 25.99/4.25 End of proof % 25.99/4.25 % SZS output end Proof for theBenchmark % 25.99/4.25 % 25.99/4.25 3638ms %------------------------------------------------------------------------------