%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LAT381+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 06:25:17 EDT 2023 % Result : Theorem 6.91s 1.70s % Output : Proof 9.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT381+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.16/0.34 % Computer : n025.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Thu Aug 24 07:51:51 EDT 2023 % 0.16/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/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.29/1.03 Prover 4: Preprocessing ... % 2.51/1.05 Prover 1: Preprocessing ... % 2.51/1.08 Prover 3: Preprocessing ... % 2.51/1.08 Prover 2: Preprocessing ... % 2.51/1.08 Prover 5: Preprocessing ... % 2.51/1.08 Prover 0: Preprocessing ... % 2.51/1.08 Prover 6: Preprocessing ... % 4.43/1.39 Prover 2: Constructing countermodel ... % 4.43/1.39 Prover 5: Constructing countermodel ... % 5.61/1.48 Prover 1: Constructing countermodel ... % 5.61/1.51 Prover 3: Constructing countermodel ... % 5.61/1.55 Prover 6: Proving ... % 6.91/1.69 Prover 2: proved (1052ms) % 6.91/1.69 % 6.91/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.91/1.70 % 6.91/1.70 Prover 3: stopped % 6.91/1.70 Prover 5: stopped % 6.91/1.70 Prover 6: stopped % 6.91/1.70 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.91/1.70 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.91/1.70 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.91/1.70 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.71/1.77 Prover 8: Preprocessing ... % 7.71/1.78 Prover 11: Preprocessing ... % 7.71/1.78 Prover 10: Preprocessing ... % 7.71/1.78 Prover 7: Preprocessing ... % 7.71/1.80 Prover 4: Constructing countermodel ... % 7.71/1.83 Prover 1: gave up % 7.71/1.83 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.27/1.85 Prover 10: Constructing countermodel ... % 8.27/1.85 Prover 7: Constructing countermodel ... % 8.51/1.89 Prover 13: Preprocessing ... % 8.51/1.90 Prover 0: Proving ... % 8.51/1.90 Prover 0: stopped % 8.51/1.91 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.96/1.94 Prover 13: Constructing countermodel ... % 9.15/1.96 Prover 8: Warning: ignoring some quantifiers % 9.15/1.96 Prover 16: Preprocessing ... % 9.15/1.97 Prover 8: Constructing countermodel ... % 9.15/2.00 Prover 16: Constructing countermodel ... % 9.15/2.02 Prover 10: Found proof (size 16) % 9.15/2.02 Prover 7: Found proof (size 16) % 9.15/2.02 Prover 7: proved (321ms) % 9.15/2.02 Prover 10: proved (318ms) % 9.66/2.02 Prover 4: stopped % 9.66/2.02 Prover 8: stopped % 9.66/2.02 Prover 13: stopped % 9.66/2.02 Prover 16: stopped % 9.66/2.10 Prover 11: Constructing countermodel ... % 9.66/2.11 Prover 11: stopped % 9.66/2.11 % 9.66/2.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.66/2.11 % 9.66/2.12 % SZS output start Proof for theBenchmark % 9.66/2.12 Assumptions after simplification: % 9.66/2.12 --------------------------------- % 9.66/2.12 % 9.66/2.12 (mASymm) % 9.66/2.13 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 9.66/2.13 sdtlseqdt0(v1, v0) | ~ sdtlseqdt0(v0, v1) | ~ aElement0(v1) | ~ % 9.66/2.13 aElement0(v0)) % 9.66/2.13 % 9.66/2.13 (mDefSup) % 9.66/2.13 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 9.66/2.13 | ~ $i(v1) | ~ $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | ~ % 9.66/2.13 aUpperBoundOfIn0(v3, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | % 9.66/2.13 sdtlseqdt0(v2, v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | % 9.66/2.13 ~ $i(v1) | ~ $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | ~ aSubsetOf0(v1, % 9.66/2.13 v0) | ~ aSet0(v0) | aUpperBoundOfIn0(v2, v1, v0)) & ! [v0: $i] : ! [v1: % 9.66/2.13 $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 9.66/2.13 aSupremumOfIn0(v2, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | % 9.66/2.13 aElementOf0(v2, v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) % 9.66/2.13 | ~ $i(v1) | ~ $i(v0) | ~ aUpperBoundOfIn0(v2, v1, v0) | ~ % 9.66/2.13 aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v0) | ~ aSet0(v0) | % 9.66/2.13 aSupremumOfIn0(v2, v1, v0) | ? [v3: $i] : ($i(v3) & aUpperBoundOfIn0(v3, % 9.66/2.13 v1, v0) & ~ sdtlseqdt0(v2, v3))) % 9.66/2.13 % 9.66/2.13 (mEOfElem) % 9.66/2.14 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v1, v0) | % 9.66/2.14 ~ aSet0(v0) | aElement0(v1)) % 9.66/2.14 % 9.66/2.14 (m__) % 9.66/2.14 ~ (xv = xu) & $i(xv) & $i(xu) % 9.66/2.14 % 9.66/2.14 (m__725) % 9.66/2.14 $i(xT) & aSet0(xT) % 9.66/2.14 % 9.66/2.14 (m__725_01) % 9.66/2.14 $i(xS) & $i(xT) & aSubsetOf0(xS, xT) % 9.66/2.14 % 9.66/2.14 (m__744) % 9.66/2.14 $i(xv) & $i(xu) & $i(xS) & $i(xT) & aSupremumOfIn0(xv, xS, xT) & % 9.66/2.14 aSupremumOfIn0(xu, xS, xT) % 9.66/2.14 % 9.66/2.14 Further assumptions not needed in the proof: % 9.66/2.14 -------------------------------------------- % 9.66/2.14 mARefl, mDefEmpty, mDefInf, mDefLB, mDefSub, mDefUB, mElmSort, mLessRel, % 9.66/2.14 mSetSort, mTrans % 9.66/2.14 % 9.66/2.14 Those formulas are unsatisfiable: % 9.66/2.14 --------------------------------- % 9.66/2.14 % 9.66/2.14 Begin of proof % 9.66/2.14 | % 9.66/2.14 | ALPHA: (m__) implies: % 9.66/2.14 | (1) ~ (xv = xu) % 9.66/2.14 | % 9.66/2.14 | ALPHA: (m__744) implies: % 9.66/2.14 | (2) aSupremumOfIn0(xu, xS, xT) % 9.66/2.14 | (3) aSupremumOfIn0(xv, xS, xT) % 9.66/2.14 | (4) $i(xu) % 9.66/2.14 | (5) $i(xv) % 9.66/2.14 | % 9.66/2.14 | ALPHA: (m__725_01) implies: % 9.66/2.14 | (6) aSubsetOf0(xS, xT) % 9.66/2.14 | (7) $i(xS) % 9.66/2.14 | % 9.66/2.14 | ALPHA: (m__725) implies: % 9.66/2.14 | (8) aSet0(xT) % 9.66/2.14 | (9) $i(xT) % 9.66/2.14 | % 9.66/2.14 | ALPHA: (mDefSup) implies: % 9.66/2.14 | (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 9.66/2.14 | $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ % 9.66/2.14 | aSet0(v0) | aElementOf0(v2, v0)) % 9.66/2.14 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 9.66/2.14 | $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ % 9.66/2.14 | aSet0(v0) | aUpperBoundOfIn0(v2, v1, v0)) % 9.66/2.15 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 9.66/2.15 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | % 9.66/2.15 | ~ aUpperBoundOfIn0(v3, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ % 9.66/2.15 | aSet0(v0) | sdtlseqdt0(v2, v3)) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (11) with xT, xS, xu, simplifying with (2), (4), % 9.66/2.15 | (6), (7), (8), (9) gives: % 9.66/2.15 | (13) aUpperBoundOfIn0(xu, xS, xT) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (10) with xT, xS, xu, simplifying with (2), (4), % 9.66/2.15 | (6), (7), (8), (9) gives: % 9.66/2.15 | (14) aElementOf0(xu, xT) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (11) with xT, xS, xv, simplifying with (3), (5), % 9.66/2.15 | (6), (7), (8), (9) gives: % 9.66/2.15 | (15) aUpperBoundOfIn0(xv, xS, xT) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (10) with xT, xS, xv, simplifying with (3), (5), % 9.66/2.15 | (6), (7), (8), (9) gives: % 9.66/2.15 | (16) aElementOf0(xv, xT) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (mEOfElem) with xT, xu, simplifying with (4), (8), % 9.66/2.15 | (9), (14) gives: % 9.66/2.15 | (17) aElement0(xu) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (mEOfElem) with xT, xv, simplifying with (5), (8), % 9.66/2.15 | (9), (16) gives: % 9.66/2.15 | (18) aElement0(xv) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (12) with xT, xS, xv, xu, simplifying with (3), % 9.66/2.15 | (4), (5), (6), (7), (8), (9), (13) gives: % 9.66/2.15 | (19) sdtlseqdt0(xv, xu) % 9.66/2.15 | % 9.66/2.15 | GROUND_INST: instantiating (12) with xT, xS, xu, xv, simplifying with (2), % 9.66/2.15 | (4), (5), (6), (7), (8), (9), (15) gives: % 9.66/2.16 | (20) sdtlseqdt0(xu, xv) % 9.66/2.16 | % 9.66/2.16 | GROUND_INST: instantiating (mASymm) with xu, xv, simplifying with (4), (5), % 9.66/2.16 | (17), (18), (19), (20) gives: % 9.66/2.16 | (21) xv = xu % 9.66/2.16 | % 9.66/2.16 | REDUCE: (1), (21) imply: % 9.66/2.16 | (22) $false % 9.66/2.16 | % 9.66/2.16 | CLOSE: (22) is inconsistent. % 9.66/2.16 | % 9.66/2.16 End of proof % 9.66/2.16 % SZS output end Proof for theBenchmark % 9.66/2.16 % 9.66/2.16 1542ms %------------------------------------------------------------------------------