%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : RNG103+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 13:57:53 EDT 2023 % Result : Theorem 12.36s 2.47s % Output : Proof 16.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : RNG103+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.13/0.35 % Computer : n025.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 03:00:38 EDT 2023 % 0.13/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.27/1.20 Prover 4: Preprocessing ... % 3.27/1.20 Prover 1: Preprocessing ... % 3.67/1.24 Prover 5: Preprocessing ... % 3.67/1.24 Prover 0: Preprocessing ... % 3.67/1.24 Prover 3: Preprocessing ... % 3.67/1.24 Prover 2: Preprocessing ... % 3.67/1.24 Prover 6: Preprocessing ... % 9.41/2.04 Prover 1: Constructing countermodel ... % 9.41/2.04 Prover 3: Constructing countermodel ... % 9.41/2.04 Prover 5: Proving ... % 9.41/2.07 Prover 6: Proving ... % 9.74/2.10 Prover 2: Proving ... % 9.74/2.20 Prover 4: Constructing countermodel ... % 11.10/2.31 Prover 0: Proving ... % 12.36/2.47 Prover 3: proved (1824ms) % 12.36/2.47 % 12.36/2.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.36/2.47 % 12.36/2.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.36/2.47 Prover 5: stopped % 12.36/2.47 Prover 2: stopped % 12.36/2.47 Prover 6: stopped % 12.36/2.50 Prover 0: stopped % 12.36/2.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.36/2.50 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.36/2.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.36/2.50 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.01/2.55 Prover 8: Preprocessing ... % 13.34/2.60 Prover 7: Preprocessing ... % 13.34/2.61 Prover 10: Preprocessing ... % 13.34/2.63 Prover 11: Preprocessing ... % 13.34/2.64 Prover 13: Preprocessing ... % 14.18/2.77 Prover 10: Constructing countermodel ... % 14.18/2.86 Prover 7: Constructing countermodel ... % 14.18/2.87 Prover 13: Warning: ignoring some quantifiers % 14.18/2.87 Prover 8: Warning: ignoring some quantifiers % 14.18/2.88 Prover 8: Constructing countermodel ... % 14.89/2.91 Prover 10: Found proof (size 15) % 14.89/2.91 Prover 10: proved (419ms) % 14.89/2.91 Prover 1: stopped % 14.89/2.91 Prover 7: stopped % 14.89/2.91 Prover 4: stopped % 14.89/2.91 Prover 13: Constructing countermodel ... % 14.89/2.92 Prover 8: stopped % 14.89/2.93 Prover 13: stopped % 15.99/3.03 Prover 11: Constructing countermodel ... % 16.23/3.05 Prover 11: stopped % 16.23/3.05 % 16.23/3.05 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.23/3.05 % 16.23/3.05 % SZS output start Proof for theBenchmark % 16.23/3.05 Assumptions after simplification: % 16.23/3.05 --------------------------------- % 16.23/3.05 % 16.23/3.06 (mAMDistr) % 16.23/3.08 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 16.23/3.08 $i] : ( ~ (sdtasdt0(v0, v2) = v4) | ~ (sdtasdt0(v0, v1) = v3) | ~ % 16.23/3.08 (sdtpldt0(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 16.23/3.08 aElement0(v2) | ~ aElement0(v1) | ~ aElement0(v0) | ? [v6: $i] : ? [v7: % 16.23/3.08 $i] : ? [v8: $i] : ? [v9: $i] : (sdtasdt0(v6, v0) = v7 & sdtasdt0(v2, % 16.23/3.08 v0) = v9 & sdtasdt0(v1, v0) = v8 & sdtasdt0(v0, v6) = v5 & sdtpldt0(v8, % 16.23/3.08 v9) = v7 & sdtpldt0(v1, v2) = v6 & $i(v9) & $i(v8) & $i(v7) & $i(v6) & % 16.23/3.08 $i(v5))) % 16.23/3.08 % 16.23/3.08 (m__) % 16.23/3.08 $i(xv) & $i(xu) & $i(xy) & $i(xx) & $i(xc) & ? [v0: $i] : ? [v1: $i] : ? % 16.23/3.08 [v2: $i] : ( ~ (v2 = v0) & sdtasdt0(xc, v1) = v2 & sdtpldt0(xu, xv) = v1 & % 16.23/3.08 sdtpldt0(xx, xy) = v0 & $i(v2) & $i(v1) & $i(v0)) % 16.23/3.08 % 16.23/3.08 (m__1905) % 16.23/3.08 $i(xc) & aElement0(xc) % 16.23/3.08 % 16.23/3.08 (m__1956) % 16.23/3.08 sdtasdt0(xc, xu) = xx & $i(xu) & $i(xx) & $i(xc) & aElement0(xu) % 16.23/3.08 % 16.23/3.08 (m__1979) % 16.23/3.08 sdtasdt0(xc, xv) = xy & $i(xv) & $i(xy) & $i(xc) & aElement0(xv) % 16.23/3.08 % 16.23/3.08 (function-axioms) % 16.23/3.09 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.23/3.09 (sdtasasdt0(v3, v2) = v1) | ~ (sdtasasdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 16.23/3.09 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt1(v3, v2) = v1) | % 16.23/3.09 ~ (sdtpldt1(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 16.23/3.09 [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 16.23/3.09 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.23/3.09 (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: $i] : ! % 16.23/3.09 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (slsdtgt0(v2) = v1) | ~ (slsdtgt0(v2) % 16.23/3.09 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 16.23/3.09 (sbrdtbr0(v2) = v1) | ~ (sbrdtbr0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 16.23/3.09 ! [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = v1) | ~ (smndt0(v2) = v0)) % 16.23/3.09 % 16.23/3.09 Further assumptions not needed in the proof: % 16.23/3.09 -------------------------------------------- % 16.23/3.09 mAddAsso, mAddComm, mAddInvr, mAddZero, mCancel, mChineseRemainder, mDefDiv, % 16.23/3.09 mDefDvs, mDefGCD, mDefIdeal, mDefMod, mDefPrIdeal, mDefRel, mDefSInt, mDefSSum, % 16.23/3.09 mDivision, mEOfElem, mElmSort, mEucSort, mIdeInt, mIdeSum, mMulAsso, mMulComm, % 16.23/3.09 mMulMnOne, mMulUnit, mMulZero, mNatLess, mNatSort, mSetEq, mSetSort, mSortsB, % 16.23/3.09 mSortsB_02, mSortsC, mSortsC_01, mSortsU, mUnNeZr, m__1933 % 16.23/3.09 % 16.23/3.09 Those formulas are unsatisfiable: % 16.23/3.09 --------------------------------- % 16.23/3.09 % 16.23/3.09 Begin of proof % 16.23/3.09 | % 16.23/3.09 | ALPHA: (m__1905) implies: % 16.23/3.09 | (1) aElement0(xc) % 16.23/3.09 | % 16.23/3.09 | ALPHA: (m__1956) implies: % 16.23/3.09 | (2) aElement0(xu) % 16.23/3.09 | (3) sdtasdt0(xc, xu) = xx % 16.23/3.09 | % 16.23/3.09 | ALPHA: (m__1979) implies: % 16.23/3.09 | (4) aElement0(xv) % 16.23/3.09 | (5) sdtasdt0(xc, xv) = xy % 16.23/3.09 | % 16.23/3.09 | ALPHA: (m__) implies: % 16.23/3.09 | (6) $i(xc) % 16.23/3.09 | (7) $i(xu) % 16.23/3.09 | (8) $i(xv) % 16.23/3.09 | (9) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = v0) & sdtasdt0(xc, % 16.23/3.09 | v1) = v2 & sdtpldt0(xu, xv) = v1 & sdtpldt0(xx, xy) = v0 & $i(v2) & % 16.23/3.09 | $i(v1) & $i(v0)) % 16.23/3.09 | % 16.23/3.09 | ALPHA: (function-axioms) implies: % 16.23/3.09 | (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.23/3.09 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 16.23/3.10 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 16.23/3.10 | (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 16.23/3.10 | % 16.23/3.10 | DELTA: instantiating (9) with fresh symbols all_35_0, all_35_1, all_35_2 % 16.23/3.10 | gives: % 16.23/3.10 | (12) ~ (all_35_0 = all_35_2) & sdtasdt0(xc, all_35_1) = all_35_0 & % 16.23/3.10 | sdtpldt0(xu, xv) = all_35_1 & sdtpldt0(xx, xy) = all_35_2 & % 16.23/3.10 | $i(all_35_0) & $i(all_35_1) & $i(all_35_2) % 16.23/3.10 | % 16.23/3.10 | ALPHA: (12) implies: % 16.23/3.10 | (13) ~ (all_35_0 = all_35_2) % 16.23/3.10 | (14) sdtpldt0(xx, xy) = all_35_2 % 16.23/3.10 | (15) sdtpldt0(xu, xv) = all_35_1 % 16.23/3.10 | (16) sdtasdt0(xc, all_35_1) = all_35_0 % 16.23/3.10 | % 16.23/3.10 | GROUND_INST: instantiating (mAMDistr) with xc, xu, xv, xx, xy, all_35_2, % 16.23/3.10 | simplifying with (1), (2), (3), (4), (5), (6), (7), (8), (14) % 16.23/3.10 | gives: % 16.23/3.10 | (17) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (sdtasdt0(v0, % 16.23/3.10 | xc) = v1 & sdtasdt0(xv, xc) = v3 & sdtasdt0(xu, xc) = v2 & % 16.23/3.10 | sdtasdt0(xc, v0) = all_35_2 & sdtpldt0(v2, v3) = v1 & sdtpldt0(xu, % 16.23/3.10 | xv) = v0 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & $i(all_35_2)) % 16.23/3.10 | % 16.23/3.10 | DELTA: instantiating (17) with fresh symbols all_50_0, all_50_1, all_50_2, % 16.23/3.10 | all_50_3 gives: % 16.23/3.10 | (18) sdtasdt0(all_50_3, xc) = all_50_2 & sdtasdt0(xv, xc) = all_50_0 & % 16.23/3.10 | sdtasdt0(xu, xc) = all_50_1 & sdtasdt0(xc, all_50_3) = all_35_2 & % 16.23/3.10 | sdtpldt0(all_50_1, all_50_0) = all_50_2 & sdtpldt0(xu, xv) = all_50_3 % 16.23/3.10 | & $i(all_50_0) & $i(all_50_1) & $i(all_50_2) & $i(all_50_3) & % 16.23/3.10 | $i(all_35_2) % 16.23/3.10 | % 16.23/3.10 | ALPHA: (18) implies: % 16.23/3.10 | (19) sdtpldt0(xu, xv) = all_50_3 % 16.23/3.10 | (20) sdtasdt0(xc, all_50_3) = all_35_2 % 16.23/3.10 | % 16.23/3.10 | GROUND_INST: instantiating (10) with all_35_1, all_50_3, xv, xu, simplifying % 16.23/3.10 | with (15), (19) gives: % 16.23/3.10 | (21) all_50_3 = all_35_1 % 16.23/3.10 | % 16.52/3.10 | REDUCE: (20), (21) imply: % 16.52/3.10 | (22) sdtasdt0(xc, all_35_1) = all_35_2 % 16.52/3.10 | % 16.52/3.10 | GROUND_INST: instantiating (11) with all_35_0, all_35_2, all_35_1, xc, % 16.52/3.10 | simplifying with (16), (22) gives: % 16.52/3.10 | (23) all_35_0 = all_35_2 % 16.52/3.10 | % 16.52/3.10 | REDUCE: (13), (23) imply: % 16.52/3.10 | (24) $false % 16.52/3.10 | % 16.52/3.10 | CLOSE: (24) is inconsistent. % 16.52/3.10 | % 16.52/3.11 End of proof % 16.52/3.11 % SZS output end Proof for theBenchmark % 16.52/3.11 % 16.52/3.11 2486ms %------------------------------------------------------------------------------