%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LAT381+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 : n028.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 7.27s 1.80s % Output : Proof 10.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : LAT381+3 : TPTP v8.1.2. Released v4.0.0. % 0.14/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.35 % Computer : n028.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Thu Aug 24 04:32:19 EDT 2023 % 0.15/0.35 % CPUTime : % 0.22/0.62 ________ _____ % 0.22/0.62 ___ __ \_________(_)________________________________ % 0.22/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.62 % 0.22/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.62 (2023-06-19) % 0.22/0.62 % 0.22/0.62 (c) Philipp Rümmer, 2009-2023 % 0.22/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.62 Amanda Stjerna. % 0.22/0.62 Free software under BSD-3-Clause. % 0.22/0.62 % 0.22/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.62 % 0.22/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.22/0.63 Running up to 7 provers in parallel. % 0.22/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.48/1.12 Prover 1: Preprocessing ... % 2.48/1.12 Prover 4: Preprocessing ... % 3.03/1.15 Prover 0: Preprocessing ... % 3.03/1.15 Prover 6: Preprocessing ... % 3.03/1.15 Prover 5: Preprocessing ... % 3.03/1.15 Prover 3: Preprocessing ... % 3.03/1.16 Prover 2: Preprocessing ... % 5.25/1.51 Prover 5: Proving ... % 5.25/1.52 Prover 2: Constructing countermodel ... % 6.52/1.70 Prover 3: Constructing countermodel ... % 6.52/1.70 Prover 1: Constructing countermodel ... % 6.92/1.74 Prover 6: Proving ... % 7.27/1.80 Prover 2: proved (1154ms) % 7.27/1.80 % 7.27/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.27/1.80 % 7.27/1.81 Prover 3: stopped % 7.27/1.82 Prover 5: stopped % 7.27/1.82 Prover 6: stopped % 7.27/1.82 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.27/1.82 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.27/1.82 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.27/1.82 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.92/1.88 Prover 7: Preprocessing ... % 8.24/1.89 Prover 8: Preprocessing ... % 8.24/1.91 Prover 10: Preprocessing ... % 8.24/1.92 Prover 11: Preprocessing ... % 8.61/1.95 Prover 4: Constructing countermodel ... % 8.76/1.96 Prover 7: Constructing countermodel ... % 8.76/1.98 Prover 10: Constructing countermodel ... % 9.22/2.04 Prover 0: Proving ... % 9.22/2.04 Prover 0: stopped % 9.22/2.05 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.22/2.07 Prover 1: gave up % 9.22/2.08 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.22/2.09 Prover 8: Warning: ignoring some quantifiers % 9.22/2.09 Prover 13: Preprocessing ... % 9.22/2.10 Prover 8: Constructing countermodel ... % 9.22/2.11 Prover 10: Found proof (size 12) % 9.22/2.11 Prover 10: proved (287ms) % 9.22/2.11 Prover 8: stopped % 9.22/2.11 Prover 7: stopped % 9.22/2.11 Prover 4: stopped % 9.22/2.11 Prover 16: Preprocessing ... % 9.22/2.13 Prover 16: stopped % 9.22/2.13 Prover 13: stopped % 10.15/2.22 Prover 11: Constructing countermodel ... % 10.15/2.23 Prover 11: stopped % 10.15/2.23 % 10.15/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.15/2.23 % 10.15/2.23 % SZS output start Proof for theBenchmark % 10.15/2.23 Assumptions after simplification: % 10.15/2.23 --------------------------------- % 10.15/2.24 % 10.15/2.24 (mASymm) % 10.15/2.24 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 10.15/2.24 sdtlseqdt0(v1, v0) | ~ sdtlseqdt0(v0, v1) | ~ aElement0(v1) | ~ % 10.15/2.24 aElement0(v0)) % 10.15/2.24 % 10.15/2.24 (mDefSup) % 10.15/2.25 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 10.15/2.25 | ~ $i(v1) | ~ $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | ~ % 10.15/2.25 aUpperBoundOfIn0(v3, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | % 10.15/2.25 sdtlseqdt0(v2, v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | % 10.15/2.25 ~ $i(v1) | ~ $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | ~ aSubsetOf0(v1, % 10.15/2.25 v0) | ~ aSet0(v0) | aUpperBoundOfIn0(v2, v1, v0)) & ! [v0: $i] : ! [v1: % 10.15/2.25 $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.15/2.25 aSupremumOfIn0(v2, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | % 10.15/2.25 aElementOf0(v2, v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) % 10.15/2.25 | ~ $i(v1) | ~ $i(v0) | ~ aUpperBoundOfIn0(v2, v1, v0) | ~ % 10.15/2.25 aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v0) | ~ aSet0(v0) | % 10.15/2.25 aSupremumOfIn0(v2, v1, v0) | ? [v3: $i] : ($i(v3) & aUpperBoundOfIn0(v3, % 10.15/2.25 v1, v0) & ~ sdtlseqdt0(v2, v3))) % 10.15/2.25 % 10.15/2.25 (mEOfElem) % 10.15/2.25 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aElementOf0(v1, v0) | % 10.15/2.25 ~ aSet0(v0) | aElement0(v1)) % 10.15/2.25 % 10.15/2.25 (m__) % 10.15/2.25 ~ (xv = xu) & $i(xv) & $i(xu) % 10.15/2.25 % 10.15/2.25 (m__725) % 10.15/2.25 $i(xT) & aSet0(xT) % 10.15/2.25 % 10.15/2.25 (m__725_01) % 10.15/2.25 $i(xS) & $i(xT) & aSubsetOf0(xS, xT) & aSet0(xS) & ! [v0: $i] : ( ~ $i(v0) | % 10.15/2.25 ~ aElementOf0(v0, xS) | aElementOf0(v0, xT)) % 10.15/2.25 % 10.15/2.25 (m__744) % 10.15/2.25 $i(xv) & $i(xu) & $i(xS) & $i(xT) & aSupremumOfIn0(xv, xS, xT) & % 10.15/2.25 aSupremumOfIn0(xu, xS, xT) & aUpperBoundOfIn0(xv, xS, xT) & % 10.15/2.25 aUpperBoundOfIn0(xu, xS, xT) & aElementOf0(xv, xT) & aElementOf0(xu, xT) & ! % 10.15/2.25 [v0: $i] : ( ~ $i(v0) | ~ aUpperBoundOfIn0(v0, xS, xT) | sdtlseqdt0(xv, v0)) % 10.15/2.25 & ! [v0: $i] : ( ~ $i(v0) | ~ aUpperBoundOfIn0(v0, xS, xT) | sdtlseqdt0(xu, % 10.15/2.25 v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xS) | sdtlseqdt0(v0, % 10.15/2.25 xv)) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xS) | sdtlseqdt0(v0, % 10.15/2.25 xu)) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xT) | sdtlseqdt0(xv, % 10.15/2.25 v0) | ? [v1: $i] : ($i(v1) & aElementOf0(v1, xS) & ~ sdtlseqdt0(v1, % 10.15/2.25 v0))) & ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xT) | % 10.15/2.25 sdtlseqdt0(xu, v0) | ? [v1: $i] : ($i(v1) & aElementOf0(v1, xS) & ~ % 10.15/2.25 sdtlseqdt0(v1, v0))) % 10.15/2.25 % 10.15/2.25 Further assumptions not needed in the proof: % 10.15/2.25 -------------------------------------------- % 10.15/2.25 mARefl, mDefEmpty, mDefInf, mDefLB, mDefSub, mDefUB, mElmSort, mLessRel, % 10.15/2.25 mSetSort, mTrans % 10.15/2.25 % 10.15/2.25 Those formulas are unsatisfiable: % 10.15/2.25 --------------------------------- % 10.15/2.25 % 10.15/2.25 Begin of proof % 10.15/2.26 | % 10.15/2.26 | ALPHA: (m__) implies: % 10.15/2.26 | (1) ~ (xv = xu) % 10.15/2.26 | % 10.15/2.26 | ALPHA: (m__744) implies: % 10.15/2.26 | (2) aElementOf0(xu, xT) % 10.15/2.26 | (3) aElementOf0(xv, xT) % 10.15/2.26 | (4) aUpperBoundOfIn0(xu, xS, xT) % 10.15/2.26 | (5) aUpperBoundOfIn0(xv, xS, xT) % 10.15/2.26 | (6) aSupremumOfIn0(xu, xS, xT) % 10.15/2.26 | (7) aSupremumOfIn0(xv, xS, xT) % 10.15/2.26 | (8) $i(xu) % 10.15/2.26 | (9) $i(xv) % 10.15/2.26 | % 10.15/2.26 | ALPHA: (m__725_01) implies: % 10.15/2.26 | (10) aSubsetOf0(xS, xT) % 10.15/2.26 | (11) $i(xS) % 10.15/2.26 | % 10.15/2.26 | ALPHA: (m__725) implies: % 10.15/2.26 | (12) aSet0(xT) % 10.15/2.26 | (13) $i(xT) % 10.15/2.26 | % 10.15/2.26 | ALPHA: (mDefSup) implies: % 10.15/2.26 | (14) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 10.15/2.26 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aSupremumOfIn0(v2, v1, v0) | % 10.15/2.26 | ~ aUpperBoundOfIn0(v3, v1, v0) | ~ aSubsetOf0(v1, v0) | ~ % 10.15/2.26 | aSet0(v0) | sdtlseqdt0(v2, v3)) % 10.15/2.26 | % 10.15/2.26 | GROUND_INST: instantiating (mEOfElem) with xT, xu, simplifying with (2), (8), % 10.15/2.26 | (12), (13) gives: % 10.15/2.26 | (15) aElement0(xu) % 10.15/2.26 | % 10.15/2.26 | GROUND_INST: instantiating (mEOfElem) with xT, xv, simplifying with (3), (9), % 10.15/2.27 | (12), (13) gives: % 10.15/2.27 | (16) aElement0(xv) % 10.15/2.27 | % 10.15/2.27 | GROUND_INST: instantiating (14) with xT, xS, xu, xv, simplifying with (5), % 10.15/2.27 | (6), (8), (9), (10), (11), (12), (13) gives: % 10.15/2.27 | (17) sdtlseqdt0(xu, xv) % 10.15/2.27 | % 10.15/2.27 | GROUND_INST: instantiating (14) with xT, xS, xv, xu, simplifying with (4), % 10.15/2.27 | (7), (8), (9), (10), (11), (12), (13) gives: % 10.15/2.27 | (18) sdtlseqdt0(xv, xu) % 10.15/2.27 | % 10.15/2.27 | GROUND_INST: instantiating (mASymm) with xu, xv, simplifying with (8), (9), % 10.15/2.27 | (15), (16), (17), (18) gives: % 10.15/2.27 | (19) xv = xu % 10.15/2.27 | % 10.15/2.27 | REDUCE: (1), (19) imply: % 10.15/2.27 | (20) $false % 10.15/2.27 | % 10.15/2.27 | CLOSE: (20) is inconsistent. % 10.15/2.27 | % 10.15/2.27 End of proof % 10.15/2.27 % SZS output end Proof for theBenchmark % 10.15/2.27 % 10.15/2.27 1650ms %------------------------------------------------------------------------------