TSTP Solution File: NUM520+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM520+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 : n023.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:20 EDT 2023
% Result : Theorem 7.67s 1.71s
% Output : Proof 10.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM520+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 08:38:12 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.58 ________ _____
% 0.18/0.58 ___ __ \_________(_)________________________________
% 0.18/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.58
% 0.18/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.58 (2023-06-19)
% 0.18/0.58
% 0.18/0.58 (c) Philipp Rümmer, 2009-2023
% 0.18/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.58 Amanda Stjerna.
% 0.18/0.58 Free software under BSD-3-Clause.
% 0.18/0.58
% 0.18/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.58
% 0.18/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.18/0.60 Running up to 7 provers in parallel.
% 0.67/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.13/1.13 Prover 1: Preprocessing ...
% 3.13/1.13 Prover 4: Preprocessing ...
% 3.13/1.17 Prover 0: Preprocessing ...
% 3.13/1.17 Prover 3: Preprocessing ...
% 3.13/1.17 Prover 2: Preprocessing ...
% 3.13/1.17 Prover 6: Preprocessing ...
% 3.80/1.19 Prover 5: Preprocessing ...
% 7.19/1.69 Prover 6: Constructing countermodel ...
% 7.67/1.70 Prover 3: Constructing countermodel ...
% 7.67/1.71 Prover 3: proved (1105ms)
% 7.67/1.71
% 7.67/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.67/1.71
% 7.67/1.73 Prover 6: proved (1101ms)
% 7.67/1.73
% 7.67/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.67/1.73
% 7.67/1.73 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.67/1.73 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.25/1.79 Prover 5: Constructing countermodel ...
% 8.25/1.79 Prover 5: stopped
% 8.25/1.80 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.50/1.82 Prover 8: Preprocessing ...
% 8.64/1.83 Prover 1: Constructing countermodel ...
% 8.64/1.87 Prover 7: Preprocessing ...
% 8.64/1.89 Prover 10: Preprocessing ...
% 9.23/1.93 Prover 2: Constructing countermodel ...
% 9.23/1.93 Prover 2: stopped
% 9.23/1.93 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.76/2.01 Prover 11: Preprocessing ...
% 9.76/2.02 Prover 0: Constructing countermodel ...
% 9.76/2.02 Prover 0: stopped
% 9.76/2.02 Prover 1: Found proof (size 7)
% 9.76/2.02 Prover 1: proved (1414ms)
% 9.76/2.02 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.76/2.04 Prover 8: Warning: ignoring some quantifiers
% 9.76/2.04 Prover 8: Constructing countermodel ...
% 9.76/2.06 Prover 8: stopped
% 10.50/2.09 Prover 10: Constructing countermodel ...
% 10.50/2.09 Prover 11: stopped
% 10.50/2.09 Prover 13: Preprocessing ...
% 10.50/2.10 Prover 10: stopped
% 10.88/2.13 Prover 4: Constructing countermodel ...
% 10.88/2.14 Prover 7: Constructing countermodel ...
% 10.88/2.16 Prover 13: stopped
% 10.88/2.16 Prover 4: stopped
% 10.88/2.16 Prover 7: stopped
% 10.88/2.16
% 10.88/2.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.88/2.16
% 10.88/2.16 % SZS output start Proof for theBenchmark
% 10.88/2.17 Assumptions after simplification:
% 10.88/2.17 ---------------------------------
% 10.88/2.17
% 10.88/2.17 (m__2315)
% 10.88/2.17 ~ (xk = sz10) & ~ (xk = sz00) & $i(xk) & $i(sz10) & $i(sz00)
% 10.88/2.17
% 10.88/2.17 (m__2327)
% 10.88/2.17 $i(xk) & $i(sz10) & $i(sz00) & (xk = sz10 | xk = sz00)
% 10.88/2.17
% 10.88/2.17 Further assumptions not needed in the proof:
% 10.88/2.17 --------------------------------------------
% 10.88/2.17 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefDiv, mDefLE, mDefPrime,
% 10.88/2.17 mDefQuot, mDivAsso, mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym,
% 10.88/2.17 mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso,
% 10.88/2.17 mMulCanc, mMulComm, mNatSort, mPrimDiv, mSortsB, mSortsB_02, mSortsC,
% 10.88/2.17 mSortsC_01, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero, m__, m__1799,
% 10.88/2.17 m__1837, m__1860, m__1870, m__2075, m__2287, m__2306
% 10.88/2.17
% 10.88/2.17 Those formulas are unsatisfiable:
% 10.88/2.17 ---------------------------------
% 10.88/2.17
% 10.88/2.17 Begin of proof
% 10.88/2.17 |
% 10.88/2.17 | ALPHA: (m__2315) implies:
% 10.88/2.17 | (1) ~ (xk = sz00)
% 10.88/2.17 | (2) ~ (xk = sz10)
% 10.88/2.17 |
% 10.88/2.17 | ALPHA: (m__2327) implies:
% 10.88/2.18 | (3) xk = sz10 | xk = sz00
% 10.88/2.18 |
% 10.88/2.18 | BETA: splitting (3) gives:
% 10.88/2.18 |
% 10.88/2.18 | Case 1:
% 10.88/2.18 | |
% 10.88/2.18 | | (4) xk = sz00
% 10.88/2.18 | |
% 10.88/2.18 | | REDUCE: (1), (4) imply:
% 10.88/2.18 | | (5) $false
% 10.88/2.18 | |
% 10.88/2.18 | | CLOSE: (5) is inconsistent.
% 10.88/2.18 | |
% 10.88/2.18 | Case 2:
% 10.88/2.18 | |
% 10.88/2.18 | | (6) xk = sz10
% 10.88/2.18 | |
% 10.88/2.18 | | REDUCE: (2), (6) imply:
% 10.88/2.18 | | (7) $false
% 10.88/2.18 | |
% 10.88/2.18 | | CLOSE: (7) is inconsistent.
% 10.88/2.18 | |
% 10.88/2.18 | End of split
% 10.88/2.18 |
% 10.88/2.18 End of proof
% 10.88/2.18 % SZS output end Proof for theBenchmark
% 10.88/2.18
% 10.88/2.18 1594ms
%------------------------------------------------------------------------------