TSTP Solution File: NUM602+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM602+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 : n011.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:53 EDT 2023
% Result : Theorem 27.94s 4.39s
% Output : Proof 36.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM602+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 16:12:08 EDT 2023
% 0.13/0.34 % 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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.84/1.35 Prover 4: Preprocessing ...
% 4.84/1.35 Prover 1: Preprocessing ...
% 5.16/1.39 Prover 5: Preprocessing ...
% 5.16/1.39 Prover 6: Preprocessing ...
% 5.16/1.39 Prover 2: Preprocessing ...
% 5.16/1.39 Prover 0: Preprocessing ...
% 5.16/1.39 Prover 3: Preprocessing ...
% 13.34/2.59 Prover 1: Constructing countermodel ...
% 13.34/2.61 Prover 3: Constructing countermodel ...
% 14.51/2.63 Prover 6: Proving ...
% 15.54/2.75 Prover 5: Proving ...
% 16.57/2.90 Prover 2: Proving ...
% 19.44/3.30 Prover 4: Constructing countermodel ...
% 20.07/3.39 Prover 0: Proving ...
% 27.94/4.38 Prover 3: proved (3756ms)
% 27.94/4.38
% 27.94/4.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.94/4.39
% 27.94/4.39 Prover 5: stopped
% 27.94/4.39 Prover 2: stopped
% 27.94/4.39 Prover 6: stopped
% 27.94/4.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 27.94/4.39 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 27.94/4.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 27.94/4.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 27.94/4.41 Prover 0: stopped
% 27.94/4.42 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 29.40/4.62 Prover 11: Preprocessing ...
% 30.05/4.67 Prover 10: Preprocessing ...
% 30.05/4.68 Prover 8: Preprocessing ...
% 30.05/4.68 Prover 7: Preprocessing ...
% 30.05/4.70 Prover 13: Preprocessing ...
% 32.38/4.96 Prover 10: Constructing countermodel ...
% 32.38/4.97 Prover 7: Constructing countermodel ...
% 32.97/5.01 Prover 8: Warning: ignoring some quantifiers
% 32.97/5.03 Prover 8: Constructing countermodel ...
% 32.97/5.03 Prover 13: Warning: ignoring some quantifiers
% 32.97/5.07 Prover 13: Constructing countermodel ...
% 35.50/5.36 Prover 10: Found proof (size 11)
% 35.50/5.36 Prover 10: proved (970ms)
% 35.50/5.36 Prover 7: stopped
% 35.50/5.36 Prover 8: stopped
% 35.50/5.36 Prover 1: stopped
% 35.50/5.36 Prover 4: stopped
% 35.50/5.36 Prover 13: stopped
% 36.52/5.59 Prover 11: Constructing countermodel ...
% 36.68/5.61 Prover 11: stopped
% 36.68/5.61
% 36.68/5.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.68/5.61
% 36.68/5.61 % SZS output start Proof for theBenchmark
% 36.68/5.62 Assumptions after simplification:
% 36.68/5.62 ---------------------------------
% 36.68/5.62
% 36.68/5.62 (m__)
% 36.84/5.66 $i(xx) & $i(xe) & $i(szNzAzT0) & ! [v0: $i] : ( ~ (sdtlpdtrp0(xe, v0) = xx) |
% 36.84/5.66 ~ $i(v0) | ~ aElementOf0(v0, szNzAzT0))
% 36.84/5.66
% 36.84/5.66 (m__4982)
% 36.84/5.66 $i(xO) & $i(xd) & $i(xe) & $i(szNzAzT0) & ? [v0: $i] : ? [v1: $i] :
% 36.84/5.66 (szDzizrdt0(xd) = v0 & sdtlbdtrb0(xd, v0) = v1 & $i(v1) & $i(v0) & ! [v2: $i]
% 36.84/5.66 : ( ~ $i(v2) | ~ aElementOf0(v2, xO) | ? [v3: $i] : (sdtlpdtrp0(xe, v3) =
% 36.84/5.66 v2 & $i(v3) & aElementOf0(v3, v1) & aElementOf0(v3, szNzAzT0))))
% 36.84/5.66
% 36.84/5.66 (m__5009)
% 36.84/5.66 $i(xx) & $i(xO) & aElementOf0(xx, xO)
% 36.84/5.66
% 36.84/5.66 Further assumptions not needed in the proof:
% 36.84/5.66 --------------------------------------------
% 36.84/5.66 mCConsSet, mCDiffSet, mCardCons, mCardDiff, mCardEmpty, mCardNum, mCardS,
% 36.84/5.66 mCardSeg, mCardSub, mCardSubEx, mCntRel, mConsDiff, mCountNFin, mCountNFin_01,
% 36.84/5.66 mDefCons, mDefDiff, mDefEmp, mDefMax, mDefMin, mDefPtt, mDefRst, mDefSImg,
% 36.84/5.66 mDefSeg, mDefSel, mDefSub, mDiffCons, mDirichlet, mDomSet, mEOfElem, mElmSort,
% 36.84/5.66 mEmpFin, mFConsSet, mFDiffSet, mFinRel, mFinSubSeg, mFunSort, mIH, mIHSort,
% 36.84/5.66 mImgCount, mImgElm, mImgRng, mLessASymm, mLessRefl, mLessRel, mLessSucc,
% 36.84/5.66 mLessTotal, mLessTrans, mMinMin, mNATSet, mNatExtra, mNatNSucc, mNoScLessZr,
% 36.84/5.66 mPttSet, mSegFin, mSegLess, mSegSucc, mSegZero, mSelCSet, mSelExtra, mSelFSet,
% 36.84/5.66 mSelNSet, mSelSub, mSetSort, mSubASymm, mSubFSet, mSubRefl, mSubTrans,
% 36.84/5.66 mSuccEquSucc, mSuccLess, mSuccNum, mZeroLess, mZeroNum, m__3291, m__3398,
% 36.84/5.66 m__3418, m__3435, m__3453, m__3462, m__3520, m__3533, m__3623, m__3671, m__3754,
% 36.84/5.66 m__3821, m__3965, m__4151, m__4182, m__4331, m__4411, m__4618, m__4660, m__4730,
% 36.84/5.66 m__4758, m__4854, m__4891, m__4908
% 36.84/5.66
% 36.84/5.66 Those formulas are unsatisfiable:
% 36.84/5.66 ---------------------------------
% 36.84/5.66
% 36.84/5.66 Begin of proof
% 36.84/5.66 |
% 36.84/5.67 | ALPHA: (m__4982) implies:
% 36.84/5.67 | (1) ? [v0: $i] : ? [v1: $i] : (szDzizrdt0(xd) = v0 & sdtlbdtrb0(xd, v0) =
% 36.84/5.67 | v1 & $i(v1) & $i(v0) & ! [v2: $i] : ( ~ $i(v2) | ~ aElementOf0(v2,
% 36.84/5.67 | xO) | ? [v3: $i] : (sdtlpdtrp0(xe, v3) = v2 & $i(v3) &
% 36.84/5.67 | aElementOf0(v3, v1) & aElementOf0(v3, szNzAzT0))))
% 36.84/5.67 |
% 36.84/5.67 | ALPHA: (m__5009) implies:
% 36.84/5.67 | (2) aElementOf0(xx, xO)
% 36.84/5.67 |
% 36.84/5.67 | ALPHA: (m__) implies:
% 36.84/5.67 | (3) $i(xx)
% 36.84/5.67 | (4) ! [v0: $i] : ( ~ (sdtlpdtrp0(xe, v0) = xx) | ~ $i(v0) | ~
% 36.84/5.67 | aElementOf0(v0, szNzAzT0))
% 36.84/5.67 |
% 36.84/5.67 | DELTA: instantiating (1) with fresh symbols all_85_0, all_85_1 gives:
% 36.84/5.67 | (5) szDzizrdt0(xd) = all_85_1 & sdtlbdtrb0(xd, all_85_1) = all_85_0 &
% 36.84/5.67 | $i(all_85_0) & $i(all_85_1) & ! [v0: $i] : ( ~ $i(v0) | ~
% 36.84/5.67 | aElementOf0(v0, xO) | ? [v1: $i] : (sdtlpdtrp0(xe, v1) = v0 & $i(v1)
% 36.84/5.67 | & aElementOf0(v1, all_85_0) & aElementOf0(v1, szNzAzT0)))
% 36.84/5.67 |
% 36.84/5.67 | ALPHA: (5) implies:
% 36.84/5.67 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ aElementOf0(v0, xO) | ? [v1: $i] :
% 36.84/5.67 | (sdtlpdtrp0(xe, v1) = v0 & $i(v1) & aElementOf0(v1, all_85_0) &
% 36.84/5.67 | aElementOf0(v1, szNzAzT0)))
% 36.84/5.67 |
% 36.84/5.67 | GROUND_INST: instantiating (6) with xx, simplifying with (2), (3) gives:
% 36.84/5.67 | (7) ? [v0: $i] : (sdtlpdtrp0(xe, v0) = xx & $i(v0) & aElementOf0(v0,
% 36.84/5.67 | all_85_0) & aElementOf0(v0, szNzAzT0))
% 36.84/5.67 |
% 36.84/5.67 | DELTA: instantiating (7) with fresh symbol all_109_0 gives:
% 36.84/5.67 | (8) sdtlpdtrp0(xe, all_109_0) = xx & $i(all_109_0) & aElementOf0(all_109_0,
% 36.84/5.67 | all_85_0) & aElementOf0(all_109_0, szNzAzT0)
% 36.84/5.67 |
% 36.84/5.67 | ALPHA: (8) implies:
% 36.84/5.67 | (9) aElementOf0(all_109_0, szNzAzT0)
% 36.84/5.67 | (10) $i(all_109_0)
% 36.84/5.67 | (11) sdtlpdtrp0(xe, all_109_0) = xx
% 36.84/5.67 |
% 36.84/5.67 | GROUND_INST: instantiating (4) with all_109_0, simplifying with (9), (10),
% 36.84/5.67 | (11) gives:
% 36.84/5.67 | (12) $false
% 36.84/5.68 |
% 36.84/5.68 | CLOSE: (12) is inconsistent.
% 36.84/5.68 |
% 36.84/5.68 End of proof
% 36.84/5.68 % SZS output end Proof for theBenchmark
% 36.84/5.68
% 36.84/5.68 5069ms
%------------------------------------------------------------------------------