%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : RNG086+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 : n029.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:46 EDT 2023 % Result : Theorem 9.92s 2.11s % Output : Proof 12.68s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : RNG086+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.14/0.34 % Computer : n029.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 : Sun Aug 27 02:10:55 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.57 ________ _____ % 0.20/0.57 ___ __ \_________(_)________________________________ % 0.20/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.57 % 0.20/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.57 (2023-06-19) % 0.20/0.57 % 0.20/0.57 (c) Philipp Rümmer, 2009-2023 % 0.20/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.57 Amanda Stjerna. % 0.20/0.57 Free software under BSD-3-Clause. % 0.20/0.57 % 0.20/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.57 % 0.20/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.59 Running up to 7 provers in parallel. % 0.20/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.64/1.13 Prover 4: Preprocessing ... % 2.64/1.13 Prover 1: Preprocessing ... % 3.28/1.16 Prover 5: Preprocessing ... % 3.28/1.16 Prover 3: Preprocessing ... % 3.28/1.16 Prover 0: Preprocessing ... % 3.28/1.16 Prover 6: Preprocessing ... % 3.28/1.16 Prover 2: Preprocessing ... % 6.73/1.78 Prover 3: Constructing countermodel ... % 6.73/1.78 Prover 1: Constructing countermodel ... % 8.05/1.84 Prover 6: Proving ... % 8.05/1.84 Prover 5: Proving ... % 8.72/1.91 Prover 4: Constructing countermodel ... % 8.72/1.99 Prover 2: Proving ... % 9.92/2.11 Prover 3: proved (1509ms) % 9.92/2.11 % 9.92/2.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.92/2.11 % 9.92/2.12 Prover 6: stopped % 9.92/2.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.92/2.15 Prover 5: stopped % 9.92/2.15 Prover 2: stopped % 9.92/2.16 Prover 0: Proving ... % 9.92/2.16 Prover 0: stopped % 9.92/2.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.92/2.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.92/2.16 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.92/2.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.92/2.17 Prover 7: Preprocessing ... % 10.78/2.21 Prover 10: Preprocessing ... % 10.78/2.21 Prover 8: Preprocessing ... % 10.78/2.24 Prover 13: Preprocessing ... % 10.78/2.24 Prover 11: Preprocessing ... % 11.49/2.32 Prover 7: Constructing countermodel ... % 11.49/2.33 Prover 10: Constructing countermodel ... % 11.49/2.37 Prover 1: Found proof (size 14) % 11.49/2.37 Prover 1: proved (1769ms) % 11.49/2.37 Prover 4: stopped % 11.49/2.38 Prover 10: stopped % 11.49/2.38 Prover 7: stopped % 11.49/2.39 Prover 8: Warning: ignoring some quantifiers % 12.13/2.41 Prover 8: Constructing countermodel ... % 12.13/2.42 Prover 8: stopped % 12.13/2.45 Prover 13: Warning: ignoring some quantifiers % 12.13/2.46 Prover 13: Constructing countermodel ... % 12.13/2.47 Prover 13: stopped % 12.68/2.49 Prover 11: Constructing countermodel ... % 12.68/2.50 Prover 11: stopped % 12.68/2.50 % 12.68/2.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.68/2.50 % 12.68/2.50 % SZS output start Proof for theBenchmark % 12.68/2.51 Assumptions after simplification: % 12.68/2.51 --------------------------------- % 12.68/2.51 % 12.68/2.51 (m__) % 12.68/2.53 $i(xx) & $i(xJ) & $i(xI) & ! [v0: $i] : ! [v1: $i] : ( ~ (aElementOf0(v1, % 12.68/2.53 xJ) = 0) | ~ (aElementOf0(v0, xI) = 0) | ~ $i(v1) | ~ $i(v0) | ? % 12.68/2.53 [v2: $i] : ( ~ (v2 = xx) & sdtpldt0(v0, v1) = v2 & $i(v2))) % 12.68/2.53 % 12.68/2.53 (m__901) % 12.68/2.54 $i(xz) & $i(xy) & $i(xx) & $i(xJ) & $i(xI) & ? [v0: $i] : (sdtpldt1(xI, xJ) = % 12.68/2.54 v0 & aElementOf0(xy, v0) = 0 & aElementOf0(xx, v0) = 0 & aElement0(xz) = 0 & % 12.68/2.54 $i(v0) & ? [v1: $i] : ? [v2: $i] : (aElementOf0(v2, xJ) = 0 & % 12.68/2.54 aElementOf0(v1, xI) = 0 & sdtpldt0(v1, v2) = xy & $i(v2) & $i(v1)) & ? % 12.68/2.54 [v1: $i] : ? [v2: $i] : (aElementOf0(v2, xJ) = 0 & aElementOf0(v1, xI) = 0 % 12.68/2.54 & sdtpldt0(v1, v2) = xx & $i(v2) & $i(v1))) % 12.68/2.54 % 12.68/2.54 (function-axioms) % 12.68/2.54 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.68/2.54 (sdtasasdt0(v3, v2) = v1) | ~ (sdtasasdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 12.68/2.54 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt1(v3, v2) = v1) | % 12.68/2.54 ~ (sdtpldt1(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.68/2.54 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.68/2.54 (aElementOf0(v3, v2) = v1) | ~ (aElementOf0(v3, v2) = v0)) & ! [v0: $i] : % 12.68/2.54 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) % 12.68/2.54 | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 12.68/2.54 [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 12.68/2.54 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 % 12.68/2.54 = v0 | ~ (aIdeal0(v2) = v1) | ~ (aIdeal0(v2) = v0)) & ! [v0: % 12.68/2.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 12.68/2.54 ~ (aSet0(v2) = v1) | ~ (aSet0(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 12.68/2.54 [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = v1) | ~ (smndt0(v2) = v0)) & ! [v0: % 12.68/2.54 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 12.68/2.54 ~ (aElement0(v2) = v1) | ~ (aElement0(v2) = v0)) % 12.68/2.54 % 12.68/2.54 Further assumptions not needed in the proof: % 12.68/2.54 -------------------------------------------- % 12.68/2.54 mAMDistr, mAddAsso, mAddComm, mAddInvr, mAddZero, mCancel, mDefIdeal, mDefSInt, % 12.68/2.54 mDefSSum, mEOfElem, mElmSort, mMulAsso, mMulComm, mMulMnOne, mMulUnit, mMulZero, % 12.68/2.54 mSetEq, mSetSort, mSortsB, mSortsB_02, mSortsC, mSortsC_01, mSortsU, mUnNeZr, % 12.68/2.54 m__870 % 12.68/2.54 % 12.68/2.54 Those formulas are unsatisfiable: % 12.68/2.54 --------------------------------- % 12.68/2.54 % 12.68/2.54 Begin of proof % 12.68/2.54 | % 12.68/2.54 | ALPHA: (m__901) implies: % 12.68/2.55 | (1) ? [v0: $i] : (sdtpldt1(xI, xJ) = v0 & aElementOf0(xy, v0) = 0 & % 12.68/2.55 | aElementOf0(xx, v0) = 0 & aElement0(xz) = 0 & $i(v0) & ? [v1: $i] : % 12.68/2.55 | ? [v2: $i] : (aElementOf0(v2, xJ) = 0 & aElementOf0(v1, xI) = 0 & % 12.68/2.55 | sdtpldt0(v1, v2) = xy & $i(v2) & $i(v1)) & ? [v1: $i] : ? [v2: % 12.68/2.55 | $i] : (aElementOf0(v2, xJ) = 0 & aElementOf0(v1, xI) = 0 & % 12.68/2.55 | sdtpldt0(v1, v2) = xx & $i(v2) & $i(v1))) % 12.68/2.55 | % 12.68/2.55 | ALPHA: (m__) implies: % 12.68/2.55 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (aElementOf0(v1, xJ) = 0) | ~ % 12.68/2.55 | (aElementOf0(v0, xI) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : ( ~ % 12.68/2.55 | (v2 = xx) & sdtpldt0(v0, v1) = v2 & $i(v2))) % 12.68/2.55 | % 12.68/2.55 | ALPHA: (function-axioms) implies: % 12.68/2.55 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.68/2.55 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 12.68/2.55 | % 12.68/2.55 | DELTA: instantiating (1) with fresh symbol all_27_0 gives: % 12.68/2.55 | (4) sdtpldt1(xI, xJ) = all_27_0 & aElementOf0(xy, all_27_0) = 0 & % 12.68/2.55 | aElementOf0(xx, all_27_0) = 0 & aElement0(xz) = 0 & $i(all_27_0) & ? % 12.68/2.55 | [v0: $i] : ? [v1: $i] : (aElementOf0(v1, xJ) = 0 & aElementOf0(v0, xI) % 12.68/2.55 | = 0 & sdtpldt0(v0, v1) = xy & $i(v1) & $i(v0)) & ? [v0: $i] : ? % 12.68/2.55 | [v1: $i] : (aElementOf0(v1, xJ) = 0 & aElementOf0(v0, xI) = 0 & % 12.68/2.55 | sdtpldt0(v0, v1) = xx & $i(v1) & $i(v0)) % 12.68/2.55 | % 12.68/2.55 | ALPHA: (4) implies: % 12.68/2.55 | (5) ? [v0: $i] : ? [v1: $i] : (aElementOf0(v1, xJ) = 0 & aElementOf0(v0, % 12.68/2.55 | xI) = 0 & sdtpldt0(v0, v1) = xx & $i(v1) & $i(v0)) % 12.68/2.55 | % 12.68/2.55 | DELTA: instantiating (5) with fresh symbols all_31_0, all_31_1 gives: % 12.68/2.55 | (6) aElementOf0(all_31_0, xJ) = 0 & aElementOf0(all_31_1, xI) = 0 & % 12.68/2.55 | sdtpldt0(all_31_1, all_31_0) = xx & $i(all_31_0) & $i(all_31_1) % 12.68/2.55 | % 12.68/2.55 | ALPHA: (6) implies: % 12.68/2.55 | (7) $i(all_31_1) % 12.68/2.55 | (8) $i(all_31_0) % 12.68/2.55 | (9) sdtpldt0(all_31_1, all_31_0) = xx % 12.68/2.55 | (10) aElementOf0(all_31_1, xI) = 0 % 12.68/2.55 | (11) aElementOf0(all_31_0, xJ) = 0 % 12.68/2.55 | % 12.68/2.56 | GROUND_INST: instantiating (2) with all_31_1, all_31_0, simplifying with (7), % 12.68/2.56 | (8), (10), (11) gives: % 12.68/2.56 | (12) ? [v0: $i] : ( ~ (v0 = xx) & sdtpldt0(all_31_1, all_31_0) = v0 & % 12.68/2.56 | $i(v0)) % 12.68/2.56 | % 12.68/2.56 | DELTA: instantiating (12) with fresh symbol all_57_0 gives: % 12.68/2.56 | (13) ~ (all_57_0 = xx) & sdtpldt0(all_31_1, all_31_0) = all_57_0 & % 12.68/2.56 | $i(all_57_0) % 12.68/2.56 | % 12.68/2.56 | ALPHA: (13) implies: % 12.68/2.56 | (14) ~ (all_57_0 = xx) % 12.68/2.56 | (15) sdtpldt0(all_31_1, all_31_0) = all_57_0 % 12.68/2.56 | % 12.68/2.56 | GROUND_INST: instantiating (3) with xx, all_57_0, all_31_0, all_31_1, % 12.68/2.56 | simplifying with (9), (15) gives: % 12.68/2.56 | (16) all_57_0 = xx % 12.68/2.56 | % 12.68/2.56 | REDUCE: (14), (16) imply: % 12.68/2.56 | (17) $false % 12.68/2.56 | % 12.68/2.56 | CLOSE: (17) is inconsistent. % 12.68/2.56 | % 12.68/2.56 End of proof % 12.68/2.56 % SZS output end Proof for theBenchmark % 12.68/2.56 % 12.68/2.56 1983ms %------------------------------------------------------------------------------