TSTP Solution File: NUM523+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM523+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 : n008.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:22 EDT 2023
% Result : Theorem 43.78s 6.72s
% Output : Proof 48.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM523+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.13/0.34 % Computer : n008.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 12:56:47 EDT 2023
% 0.13/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.62 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.21/1.23 Prover 4: Preprocessing ...
% 3.21/1.23 Prover 1: Preprocessing ...
% 3.21/1.27 Prover 6: Preprocessing ...
% 3.21/1.27 Prover 3: Preprocessing ...
% 3.21/1.27 Prover 5: Preprocessing ...
% 3.21/1.27 Prover 2: Preprocessing ...
% 3.21/1.27 Prover 0: Preprocessing ...
% 8.29/2.02 Prover 1: Constructing countermodel ...
% 8.29/2.02 Prover 3: Constructing countermodel ...
% 8.29/2.02 Prover 6: Proving ...
% 9.58/2.14 Prover 5: Constructing countermodel ...
% 11.42/2.38 Prover 2: Proving ...
% 11.93/2.49 Prover 4: Constructing countermodel ...
% 12.99/2.64 Prover 0: Proving ...
% 43.78/6.71 Prover 3: proved (6079ms)
% 43.78/6.72
% 43.78/6.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 43.78/6.72
% 43.78/6.73 Prover 5: stopped
% 44.45/6.73 Prover 0: stopped
% 44.45/6.73 Prover 2: stopped
% 44.45/6.74 Prover 6: stopped
% 44.45/6.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 44.45/6.75 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 44.45/6.75 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 44.45/6.75 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 44.45/6.75 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 45.44/6.87 Prover 11: Preprocessing ...
% 45.44/6.91 Prover 7: Preprocessing ...
% 45.44/6.91 Prover 8: Preprocessing ...
% 45.80/6.91 Prover 10: Preprocessing ...
% 45.80/6.91 Prover 13: Preprocessing ...
% 45.80/7.06 Prover 10: Constructing countermodel ...
% 45.80/7.06 Prover 8: Warning: ignoring some quantifiers
% 45.80/7.07 Prover 8: Constructing countermodel ...
% 46.60/7.10 Prover 7: Constructing countermodel ...
% 46.60/7.15 Prover 13: Constructing countermodel ...
% 48.37/7.28 Prover 11: Constructing countermodel ...
% 48.37/7.28 Prover 10: Found proof (size 30)
% 48.37/7.28 Prover 10: proved (544ms)
% 48.37/7.28 Prover 7: stopped
% 48.37/7.28 Prover 8: stopped
% 48.37/7.28 Prover 1: stopped
% 48.37/7.28 Prover 13: stopped
% 48.37/7.28 Prover 4: stopped
% 48.37/7.29 Prover 11: stopped
% 48.37/7.29
% 48.37/7.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 48.37/7.29
% 48.37/7.29 % SZS output start Proof for theBenchmark
% 48.37/7.30 Assumptions after simplification:
% 48.37/7.30 ---------------------------------
% 48.37/7.30
% 48.37/7.30 (mDefDiv)
% 48.75/7.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v2) = v1) | ~
% 48.75/7.33 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v2) | ~
% 48.75/7.33 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | doDivides0(v0, v1)) & ! [v0:
% 48.75/7.33 $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ doDivides0(v0, v1) | ~
% 48.75/7.33 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | ? [v2: $i] : (sdtasdt0(v0,
% 48.75/7.33 v2) = v1 & $i(v2) & aNaturalNumber0(v2)))
% 48.75/7.33
% 48.75/7.33 (mDefPrime)
% 48.75/7.33 $i(sz10) & $i(sz00) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | v1 = sz10 | ~
% 48.75/7.33 $i(v1) | ~ $i(v0) | ~ isPrime0(v0) | ~ doDivides0(v1, v0) | ~
% 48.75/7.33 aNaturalNumber0(v1) | ~ aNaturalNumber0(v0)) & ! [v0: $i] : (v0 = sz10 |
% 48.75/7.33 v0 = sz00 | ~ $i(v0) | ~ aNaturalNumber0(v0) | isPrime0(v0) | ? [v1: $i]
% 48.75/7.33 : ( ~ (v1 = v0) & ~ (v1 = sz10) & $i(v1) & doDivides0(v1, v0) &
% 48.75/7.33 aNaturalNumber0(v1))) & ( ~ isPrime0(sz10) | ~ aNaturalNumber0(sz10)) & (
% 48.75/7.33 ~ isPrime0(sz00) | ~ aNaturalNumber0(sz00))
% 48.75/7.33
% 48.75/7.33 (mMulComm)
% 48.75/7.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~
% 48.75/7.33 $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) |
% 48.75/7.33 (sdtasdt0(v1, v0) = v2 & $i(v2)))
% 48.75/7.33
% 48.75/7.33 (mPDP)
% 48.75/7.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (sdtasdt0(v0, v1)
% 48.75/7.33 = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ isPrime0(v2) | ~
% 48.75/7.33 doDivides0(v2, v3) | ~ aNaturalNumber0(v2) | ~ aNaturalNumber0(v1) | ~
% 48.75/7.33 aNaturalNumber0(v0) | doDivides0(v2, v1) | doDivides0(v2, v0))
% 48.75/7.33
% 48.75/7.33 (mSortsB_02)
% 48.75/7.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~
% 48.75/7.34 $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) |
% 48.75/7.34 aNaturalNumber0(v2))
% 48.75/7.34
% 48.75/7.34 (mSortsC_01)
% 48.75/7.34 ~ (sz10 = sz00) & $i(sz10) & $i(sz00) & aNaturalNumber0(sz10)
% 48.75/7.34
% 48.75/7.34 (m__)
% 48.75/7.34 $i(xp) & $i(xn) & ? [v0: $i] : ( ~ doDivides0(xp, xn) | (sdtasdt0(xn, xn) =
% 48.75/7.34 v0 & $i(v0) & ~ doDivides0(xp, v0)))
% 48.75/7.34
% 48.75/7.34 (m__2987)
% 48.75/7.34 ~ (xp = sz00) & ~ (xm = sz00) & ~ (xn = sz00) & $i(xp) & $i(xm) & $i(xn) &
% 48.75/7.34 $i(sz00) & aNaturalNumber0(xp) & aNaturalNumber0(xm) & aNaturalNumber0(xn)
% 48.75/7.34
% 48.75/7.34 (m__3014)
% 48.75/7.34 $i(xp) & $i(xm) & $i(xn) & ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xp, v0) = v1
% 48.75/7.34 & sdtasdt0(xm, xm) = v0 & sdtasdt0(xn, xn) = v1 & $i(v1) & $i(v0))
% 48.75/7.34
% 48.75/7.34 (m__3025)
% 48.75/7.34 $i(xp) & isPrime0(xp)
% 48.75/7.34
% 48.75/7.34 (function-axioms)
% 48.75/7.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 48.75/7.34 (sdtsldt0(v3, v2) = v1) | ~ (sdtsldt0(v3, v2) = v0)) & ! [v0: $i] : !
% 48.75/7.34 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtmndt0(v3, v2) = v1) |
% 48.75/7.34 ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 48.75/7.34 [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0))
% 48.75/7.34 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 48.75/7.34 (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0))
% 48.75/7.34
% 48.75/7.34 Further assumptions not needed in the proof:
% 48.75/7.34 --------------------------------------------
% 48.75/7.34 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefLE, mDefQuot, mDivAsso,
% 48.75/7.34 mDivLE, mDivMin, mDivSum, mDivTrans, mIH, mIH_03, mLEAsym, mLENTr, mLERefl,
% 48.75/7.34 mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, mMulAsso, mMulCanc, mNatSort,
% 48.75/7.34 mPrimDiv, mSortsB, mSortsC, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero,
% 48.75/7.34 m__2963
% 48.75/7.34
% 48.75/7.34 Those formulas are unsatisfiable:
% 48.75/7.34 ---------------------------------
% 48.75/7.34
% 48.75/7.34 Begin of proof
% 48.75/7.34 |
% 48.75/7.34 | ALPHA: (mSortsC_01) implies:
% 48.75/7.34 | (1) aNaturalNumber0(sz10)
% 48.75/7.34 |
% 48.75/7.34 | ALPHA: (mDefDiv) implies:
% 48.75/7.35 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v2) = v1) |
% 48.75/7.35 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v2) | ~
% 48.75/7.35 | aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | doDivides0(v0, v1))
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (mDefPrime) implies:
% 48.75/7.35 | (3) ~ isPrime0(sz10) | ~ aNaturalNumber0(sz10)
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (m__2987) implies:
% 48.75/7.35 | (4) aNaturalNumber0(xn)
% 48.75/7.35 | (5) aNaturalNumber0(xm)
% 48.75/7.35 | (6) aNaturalNumber0(xp)
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (m__3014) implies:
% 48.75/7.35 | (7) $i(xm)
% 48.75/7.35 | (8) ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xp, v0) = v1 & sdtasdt0(xm, xm) =
% 48.75/7.35 | v0 & sdtasdt0(xn, xn) = v1 & $i(v1) & $i(v0))
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (m__3025) implies:
% 48.75/7.35 | (9) isPrime0(xp)
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (m__) implies:
% 48.75/7.35 | (10) $i(xn)
% 48.75/7.35 | (11) $i(xp)
% 48.75/7.35 | (12) ? [v0: $i] : ( ~ doDivides0(xp, xn) | (sdtasdt0(xn, xn) = v0 & $i(v0)
% 48.75/7.35 | & ~ doDivides0(xp, v0)))
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (function-axioms) implies:
% 48.75/7.35 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 48.75/7.35 | (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0))
% 48.75/7.35 |
% 48.75/7.35 | DELTA: instantiating (12) with fresh symbol all_40_0 gives:
% 48.75/7.35 | (14) ~ doDivides0(xp, xn) | (sdtasdt0(xn, xn) = all_40_0 & $i(all_40_0) &
% 48.75/7.35 | ~ doDivides0(xp, all_40_0))
% 48.75/7.35 |
% 48.75/7.35 | DELTA: instantiating (8) with fresh symbols all_41_0, all_41_1 gives:
% 48.75/7.35 | (15) sdtasdt0(xp, all_41_1) = all_41_0 & sdtasdt0(xm, xm) = all_41_1 &
% 48.75/7.35 | sdtasdt0(xn, xn) = all_41_0 & $i(all_41_0) & $i(all_41_1)
% 48.75/7.35 |
% 48.75/7.35 | ALPHA: (15) implies:
% 48.75/7.35 | (16) $i(all_41_1)
% 48.75/7.35 | (17) sdtasdt0(xn, xn) = all_41_0
% 48.75/7.35 | (18) sdtasdt0(xm, xm) = all_41_1
% 48.75/7.35 | (19) sdtasdt0(xp, all_41_1) = all_41_0
% 48.75/7.35 |
% 48.75/7.35 | BETA: splitting (3) gives:
% 48.75/7.35 |
% 48.75/7.35 | Case 1:
% 48.75/7.35 | |
% 48.75/7.35 | | (20) ~ aNaturalNumber0(sz10)
% 48.75/7.35 | |
% 48.75/7.35 | | PRED_UNIFY: (1), (20) imply:
% 48.75/7.35 | | (21) $false
% 48.75/7.36 | |
% 48.75/7.36 | | CLOSE: (21) is inconsistent.
% 48.75/7.36 | |
% 48.75/7.36 | Case 2:
% 48.75/7.36 | |
% 48.75/7.36 | |
% 48.75/7.36 | | GROUND_INST: instantiating (mSortsB_02) with xn, xn, all_41_0, simplifying
% 48.75/7.36 | | with (4), (10), (17) gives:
% 48.75/7.36 | | (22) aNaturalNumber0(all_41_0)
% 48.75/7.36 | |
% 48.75/7.36 | | GROUND_INST: instantiating (mSortsB_02) with xm, xm, all_41_1, simplifying
% 48.75/7.36 | | with (5), (7), (18) gives:
% 48.75/7.36 | | (23) aNaturalNumber0(all_41_1)
% 48.75/7.36 | |
% 48.75/7.36 | | GROUND_INST: instantiating (mMulComm) with xp, all_41_1, all_41_0,
% 48.75/7.36 | | simplifying with (6), (11), (16), (19), (23) gives:
% 48.75/7.36 | | (24) sdtasdt0(all_41_1, xp) = all_41_0 & $i(all_41_0)
% 48.75/7.36 | |
% 48.75/7.36 | | ALPHA: (24) implies:
% 48.75/7.36 | | (25) $i(all_41_0)
% 48.75/7.36 | |
% 48.75/7.36 | | GROUND_INST: instantiating (2) with xp, all_41_0, all_41_1, simplifying with
% 48.75/7.36 | | (6), (11), (16), (19), (22), (23), (25) gives:
% 48.75/7.36 | | (26) doDivides0(xp, all_41_0)
% 48.75/7.36 | |
% 48.75/7.36 | | GROUND_INST: instantiating (mPDP) with xn, xn, xp, all_41_0, simplifying
% 48.75/7.36 | | with (4), (6), (9), (10), (11), (17), (26) gives:
% 48.75/7.36 | | (27) doDivides0(xp, xn)
% 48.75/7.36 | |
% 48.75/7.36 | | BETA: splitting (14) gives:
% 48.75/7.36 | |
% 48.75/7.36 | | Case 1:
% 48.75/7.36 | | |
% 48.75/7.36 | | | (28) ~ doDivides0(xp, xn)
% 48.75/7.36 | | |
% 48.75/7.36 | | | PRED_UNIFY: (27), (28) imply:
% 48.75/7.36 | | | (29) $false
% 48.75/7.36 | | |
% 48.75/7.36 | | | CLOSE: (29) is inconsistent.
% 48.75/7.36 | | |
% 48.75/7.36 | | Case 2:
% 48.75/7.36 | | |
% 48.75/7.36 | | | (30) sdtasdt0(xn, xn) = all_40_0 & $i(all_40_0) & ~ doDivides0(xp,
% 48.75/7.36 | | | all_40_0)
% 48.75/7.36 | | |
% 48.75/7.36 | | | ALPHA: (30) implies:
% 48.75/7.36 | | | (31) ~ doDivides0(xp, all_40_0)
% 48.75/7.36 | | | (32) sdtasdt0(xn, xn) = all_40_0
% 48.75/7.36 | | |
% 48.75/7.36 | | | GROUND_INST: instantiating (13) with all_41_0, all_40_0, xn, xn,
% 48.75/7.36 | | | simplifying with (17), (32) gives:
% 48.75/7.36 | | | (33) all_41_0 = all_40_0
% 48.75/7.36 | | |
% 48.75/7.36 | | | REDUCE: (26), (33) imply:
% 48.75/7.36 | | | (34) doDivides0(xp, all_40_0)
% 48.75/7.36 | | |
% 48.75/7.36 | | | PRED_UNIFY: (31), (34) imply:
% 48.75/7.36 | | | (35) $false
% 48.75/7.36 | | |
% 48.75/7.36 | | | CLOSE: (35) is inconsistent.
% 48.75/7.36 | | |
% 48.75/7.36 | | End of split
% 48.75/7.36 | |
% 48.75/7.36 | End of split
% 48.75/7.36 |
% 48.75/7.36 End of proof
% 48.75/7.37 % SZS output end Proof for theBenchmark
% 48.75/7.37
% 48.75/7.37 6753ms
%------------------------------------------------------------------------------