TSTP Solution File: NUM564+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM564+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 : n010.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 11:48:38 EDT 2023
% Result : Theorem 14.98s 2.77s
% Output : Proof 21.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM564+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n010.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 : Fri Aug 25 16:04:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.59
% 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.59 (2023-06-19)
% 0.20/0.59
% 0.20/0.59 (c) Philipp Rümmer, 2009-2023
% 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.59 Amanda Stjerna.
% 0.20/0.59 Free software under BSD-3-Clause.
% 0.20/0.59
% 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59
% 0.20/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.82/1.38 Prover 4: Preprocessing ...
% 3.82/1.40 Prover 1: Preprocessing ...
% 3.82/1.42 Prover 3: Preprocessing ...
% 3.82/1.42 Prover 2: Preprocessing ...
% 3.82/1.42 Prover 5: Preprocessing ...
% 3.82/1.42 Prover 6: Preprocessing ...
% 3.82/1.42 Prover 0: Preprocessing ...
% 11.89/2.40 Prover 3: Constructing countermodel ...
% 11.89/2.41 Prover 1: Constructing countermodel ...
% 13.02/2.52 Prover 6: Proving ...
% 13.02/2.54 Prover 5: Proving ...
% 14.98/2.76 Prover 3: proved (2134ms)
% 14.98/2.76
% 14.98/2.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.98/2.77
% 14.98/2.77 Prover 5: stopped
% 14.98/2.77 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 14.98/2.77 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 14.98/2.77 Prover 6: stopped
% 14.98/2.77 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 15.66/2.85 Prover 1: Found proof (size 8)
% 15.66/2.85 Prover 1: proved (2233ms)
% 15.66/2.87 Prover 7: Preprocessing ...
% 16.02/2.89 Prover 10: Preprocessing ...
% 16.02/2.91 Prover 8: Preprocessing ...
% 16.02/2.94 Prover 7: stopped
% 16.54/2.99 Prover 10: stopped
% 16.94/3.04 Prover 2: Proving ...
% 17.28/3.05 Prover 2: stopped
% 18.13/3.20 Prover 8: Warning: ignoring some quantifiers
% 18.13/3.21 Prover 8: Constructing countermodel ...
% 18.13/3.22 Prover 8: stopped
% 19.51/3.53 Prover 4: Constructing countermodel ...
% 20.05/3.56 Prover 4: stopped
% 20.54/3.74 Prover 0: Proving ...
% 20.54/3.75 Prover 0: stopped
% 20.54/3.75
% 20.54/3.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.54/3.75
% 20.54/3.75 % SZS output start Proof for theBenchmark
% 20.98/3.76 Assumptions after simplification:
% 20.98/3.76 ---------------------------------
% 20.98/3.76
% 20.98/3.76 (m__)
% 21.18/3.80 $i(xS) & $i(sz00) & $i(slcrc0) & ? [v0: int] : ? [v1: $i] : ? [v2: int] : (
% 21.18/3.80 ~ (v2 = 0) & ~ (v0 = 0) & slbdtsldtrb0(xS, sz00) = v1 & aSubsetOf0(slcrc0,
% 21.18/3.80 xS) = v0 & aSet0(slcrc0) = 0 & aElementOf0(slcrc0, v1) = v2 & $i(v1) & !
% 21.18/3.80 [v3: $i] : ( ~ (aElementOf0(v3, slcrc0) = 0) | ~ $i(v3)) & ? [v3: $i] : ?
% 21.18/3.80 [v4: int] : ( ~ (v4 = 0) & aElementOf0(v3, xS) = v4 & aElementOf0(v3,
% 21.18/3.80 slcrc0) = 0 & $i(v3)))
% 21.18/3.80
% 21.18/3.80 Further assumptions not needed in the proof:
% 21.18/3.80 --------------------------------------------
% 21.18/3.80 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS,
% 21.18/3.80 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01,
% 21.18/3.80 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg,
% 21.18/3.80 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort,
% 21.18/3.80 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort,
% 21.18/3.80 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc,
% 21.18/3.80 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr,
% 21.18/3.80 mPttSet, mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet,
% 21.18/3.80 mSelNSet, mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans,
% 21.18/3.80 mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__3291, m__3398,
% 21.18/3.80 m__3418, m__3435, m__3453, m__3462
% 21.18/3.80
% 21.18/3.80 Those formulas are unsatisfiable:
% 21.18/3.80 ---------------------------------
% 21.18/3.80
% 21.18/3.80 Begin of proof
% 21.18/3.80 |
% 21.18/3.80 | ALPHA: (m__) implies:
% 21.18/3.81 | (1) ? [v0: int] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & ~ (v0 = 0)
% 21.18/3.81 | & slbdtsldtrb0(xS, sz00) = v1 & aSubsetOf0(slcrc0, xS) = v0 &
% 21.18/3.81 | aSet0(slcrc0) = 0 & aElementOf0(slcrc0, v1) = v2 & $i(v1) & ! [v3:
% 21.18/3.81 | $i] : ( ~ (aElementOf0(v3, slcrc0) = 0) | ~ $i(v3)) & ? [v3: $i]
% 21.18/3.81 | : ? [v4: int] : ( ~ (v4 = 0) & aElementOf0(v3, xS) = v4 &
% 21.18/3.81 | aElementOf0(v3, slcrc0) = 0 & $i(v3)))
% 21.18/3.81 |
% 21.18/3.81 | DELTA: instantiating (1) with fresh symbols all_66_0, all_66_1, all_66_2
% 21.18/3.81 | gives:
% 21.18/3.81 | (2) ~ (all_66_0 = 0) & ~ (all_66_2 = 0) & slbdtsldtrb0(xS, sz00) =
% 21.18/3.81 | all_66_1 & aSubsetOf0(slcrc0, xS) = all_66_2 & aSet0(slcrc0) = 0 &
% 21.18/3.81 | aElementOf0(slcrc0, all_66_1) = all_66_0 & $i(all_66_1) & ! [v0: $i] :
% 21.18/3.81 | ( ~ (aElementOf0(v0, slcrc0) = 0) | ~ $i(v0)) & ? [v0: $i] : ? [v1:
% 21.18/3.81 | int] : ( ~ (v1 = 0) & aElementOf0(v0, xS) = v1 & aElementOf0(v0,
% 21.18/3.81 | slcrc0) = 0 & $i(v0))
% 21.18/3.81 |
% 21.18/3.81 | ALPHA: (2) implies:
% 21.18/3.81 | (3) ! [v0: $i] : ( ~ (aElementOf0(v0, slcrc0) = 0) | ~ $i(v0))
% 21.18/3.81 | (4) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & aElementOf0(v0, xS) = v1 &
% 21.18/3.81 | aElementOf0(v0, slcrc0) = 0 & $i(v0))
% 21.18/3.81 |
% 21.18/3.81 | DELTA: instantiating (4) with fresh symbols all_72_0, all_72_1 gives:
% 21.18/3.81 | (5) ~ (all_72_0 = 0) & aElementOf0(all_72_1, xS) = all_72_0 &
% 21.18/3.81 | aElementOf0(all_72_1, slcrc0) = 0 & $i(all_72_1)
% 21.18/3.81 |
% 21.18/3.81 | ALPHA: (5) implies:
% 21.18/3.81 | (6) $i(all_72_1)
% 21.18/3.81 | (7) aElementOf0(all_72_1, slcrc0) = 0
% 21.18/3.82 |
% 21.18/3.82 | GROUND_INST: instantiating (3) with all_72_1, simplifying with (6), (7) gives:
% 21.18/3.82 | (8) $false
% 21.18/3.82 |
% 21.18/3.82 | CLOSE: (8) is inconsistent.
% 21.18/3.82 |
% 21.18/3.82 End of proof
% 21.18/3.82 % SZS output end Proof for theBenchmark
% 21.18/3.82
% 21.18/3.82 3222ms
%------------------------------------------------------------------------------