%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM430+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 : 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:47:42 EDT 2023 % Result : Theorem 8.30s 1.92s % Output : Proof 11.69s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM430+3 : TPTP v8.1.2. Released v4.0.0. % 0.06/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 10:53:27 EDT 2023 % 0.12/0.33 % CPUTime : % 0.66/0.64 ________ _____ % 0.66/0.64 ___ __ \_________(_)________________________________ % 0.66/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.66/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.66/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.66/0.64 % 0.66/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.66/0.64 (2023-06-19) % 0.66/0.64 % 0.66/0.64 (c) Philipp Rümmer, 2009-2023 % 0.66/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.66/0.64 Amanda Stjerna. % 0.66/0.64 Free software under BSD-3-Clause. % 0.66/0.64 % 0.66/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.66/0.64 % 0.66/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.65 Running up to 7 provers in parallel. % 0.66/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.66/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.66/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.66/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.66/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.66/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.66/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.81/1.13 Prover 1: Preprocessing ... % 2.81/1.13 Prover 4: Preprocessing ... % 3.00/1.17 Prover 5: Preprocessing ... % 3.00/1.17 Prover 6: Preprocessing ... % 3.00/1.17 Prover 3: Preprocessing ... % 3.00/1.17 Prover 2: Preprocessing ... % 3.00/1.17 Prover 0: Preprocessing ... % 6.12/1.63 Prover 1: Constructing countermodel ... % 6.12/1.64 Prover 3: Constructing countermodel ... % 6.86/1.70 Prover 6: Proving ... % 6.86/1.71 Prover 4: Constructing countermodel ... % 7.32/1.75 Prover 5: Constructing countermodel ... % 7.32/1.80 Prover 2: Proving ... % 7.87/1.84 Prover 0: Proving ... % 8.30/1.92 Prover 3: proved (1261ms) % 8.30/1.92 % 8.30/1.92 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.30/1.92 % 8.30/1.92 Prover 5: stopped % 8.30/1.92 Prover 2: stopped % 8.30/1.92 Prover 0: stopped % 8.30/1.93 Prover 6: stopped % 8.30/1.93 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.30/1.93 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.30/1.93 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.30/1.94 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.30/1.94 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.10/2.00 Prover 8: Preprocessing ... % 9.10/2.01 Prover 10: Preprocessing ... % 9.10/2.01 Prover 11: Preprocessing ... % 9.10/2.02 Prover 7: Preprocessing ... % 9.10/2.02 Prover 13: Preprocessing ... % 9.53/2.10 Prover 8: Warning: ignoring some quantifiers % 9.53/2.10 Prover 10: Constructing countermodel ... % 9.53/2.11 Prover 8: Constructing countermodel ... % 10.09/2.15 Prover 13: Constructing countermodel ... % 10.57/2.19 Prover 7: Constructing countermodel ... % 11.21/2.27 Prover 11: Constructing countermodel ... % 11.45/2.30 Prover 1: Found proof (size 32) % 11.45/2.30 Prover 1: proved (1637ms) % 11.45/2.30 Prover 11: stopped % 11.45/2.30 Prover 13: stopped % 11.45/2.30 Prover 4: stopped % 11.45/2.30 Prover 8: stopped % 11.45/2.30 Prover 7: stopped % 11.45/2.30 Prover 10: Found proof (size 13) % 11.45/2.30 Prover 10: proved (375ms) % 11.45/2.30 % 11.45/2.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.45/2.30 % 11.45/2.31 % SZS output start Proof for theBenchmark % 11.45/2.31 Assumptions after simplification: % 11.45/2.31 --------------------------------- % 11.45/2.31 % 11.45/2.31 (mIntMult) % 11.69/2.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 11.69/2.34 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] : % 11.69/2.34 (aInteger0(v2) = v5 & aInteger0(v1) = v4 & aInteger0(v0) = v3 & ( ~ (v4 = 0) % 11.69/2.34 | ~ (v3 = 0) | v5 = 0))) % 11.69/2.34 % 11.69/2.34 (mMulComm) % 11.69/2.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 11.69/2.34 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: $i] : % 11.69/2.34 (sdtasdt0(v1, v0) = v5 & aInteger0(v1) = v4 & aInteger0(v0) = v3 & $i(v5) & % 11.69/2.34 ( ~ (v4 = 0) | ~ (v3 = 0) | v5 = v2))) % 11.69/2.34 % 11.69/2.34 (m__) % 11.69/2.34 $i(xc) & $i(xq) & $i(xb) & ? [v0: $i] : ? [v1: $i] : (sdtpldt0(xb, v0) = v1 % 11.69/2.34 & smndt0(xc) = v0 & $i(v1) & $i(v0) & ! [v2: $i] : ( ~ (sdtasdt0(xq, v2) = % 11.69/2.34 v1) | ~ $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & aInteger0(v2) = v3))) % 11.69/2.34 % 11.69/2.35 (m__853) % 11.69/2.35 $i(xc) & $i(xq) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : % 11.69/2.35 ? [v3: $i] : (sdteqdtlpzmzozddtrp0(xb, xc, xq) = 0 & sdteqdtlpzmzozddtrp0(xa, % 11.69/2.35 xb, xq) = 0 & aDivisorOf0(xq, v3) = 0 & aDivisorOf0(xq, v1) = 0 & % 11.69/2.35 sdtpldt0(xb, v2) = v3 & sdtpldt0(xa, v0) = v1 & smndt0(xc) = v2 & smndt0(xb) % 11.69/2.35 = v0 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ? [v4: $i] : (sdtasdt0(xq, v4) = % 11.69/2.35 v3 & aInteger0(v4) = 0 & $i(v4)) & ? [v4: $i] : (sdtasdt0(xq, v4) = v1 & % 11.69/2.35 aInteger0(v4) = 0 & $i(v4))) % 11.69/2.35 % 11.69/2.35 (function-axioms) % 11.69/2.35 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.69/2.35 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sdteqdtlpzmzozddtrp0(v4, v3, v2) = v1) % 11.69/2.35 | ~ (sdteqdtlpzmzozddtrp0(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : % 11.69/2.35 ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.69/2.35 (aDivisorOf0(v3, v2) = v1) | ~ (aDivisorOf0(v3, v2) = v0)) & ! [v0: $i] : % 11.69/2.35 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) % 11.69/2.35 | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 11.69/2.35 [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 11.69/2.35 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = v1) | % 11.69/2.35 ~ (smndt0(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.69/2.35 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aInteger0(v2) = v1) | ~ % 11.69/2.35 (aInteger0(v2) = v0)) % 11.69/2.35 % 11.69/2.35 Further assumptions not needed in the proof: % 11.69/2.35 -------------------------------------------- % 11.69/2.35 mAddAsso, mAddComm, mAddNeg, mAddZero, mDistrib, mDivisor, mEquMod, mEquModRef, % 11.69/2.35 mEquModSym, mIntNeg, mIntOne, mIntPlus, mIntZero, mIntegers, mMulAsso, % 11.69/2.35 mMulMinOne, mMulOne, mMulZero, mZeroDiv, m__818, m__876 % 11.69/2.35 % 11.69/2.35 Those formulas are unsatisfiable: % 11.69/2.35 --------------------------------- % 11.69/2.35 % 11.69/2.35 Begin of proof % 11.69/2.35 | % 11.69/2.36 | ALPHA: (m__853) implies: % 11.69/2.36 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : % 11.69/2.36 | (sdteqdtlpzmzozddtrp0(xb, xc, xq) = 0 & sdteqdtlpzmzozddtrp0(xa, xb, % 11.69/2.36 | xq) = 0 & aDivisorOf0(xq, v3) = 0 & aDivisorOf0(xq, v1) = 0 & % 11.69/2.36 | sdtpldt0(xb, v2) = v3 & sdtpldt0(xa, v0) = v1 & smndt0(xc) = v2 & % 11.69/2.36 | smndt0(xb) = v0 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ? [v4: $i] : % 11.69/2.36 | (sdtasdt0(xq, v4) = v3 & aInteger0(v4) = 0 & $i(v4)) & ? [v4: $i] : % 11.69/2.36 | (sdtasdt0(xq, v4) = v1 & aInteger0(v4) = 0 & $i(v4))) % 11.69/2.36 | % 11.69/2.36 | ALPHA: (m__) implies: % 11.69/2.36 | (2) $i(xq) % 11.69/2.36 | (3) ? [v0: $i] : ? [v1: $i] : (sdtpldt0(xb, v0) = v1 & smndt0(xc) = v0 & % 11.69/2.36 | $i(v1) & $i(v0) & ! [v2: $i] : ( ~ (sdtasdt0(xq, v2) = v1) | ~ % 11.69/2.36 | $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & aInteger0(v2) = v3))) % 11.69/2.36 | % 11.69/2.36 | ALPHA: (function-axioms) implies: % 11.69/2.36 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 11.69/2.36 | (v1 = v0 | ~ (aInteger0(v2) = v1) | ~ (aInteger0(v2) = v0)) % 11.69/2.36 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = % 11.69/2.36 | v1) | ~ (smndt0(v2) = v0)) % 11.69/2.36 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.69/2.36 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 11.69/2.36 | % 11.69/2.36 | DELTA: instantiating (3) with fresh symbols all_23_0, all_23_1 gives: % 11.69/2.36 | (7) sdtpldt0(xb, all_23_1) = all_23_0 & smndt0(xc) = all_23_1 & % 11.69/2.36 | $i(all_23_0) & $i(all_23_1) & ! [v0: $i] : ( ~ (sdtasdt0(xq, v0) = % 11.69/2.36 | all_23_0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & aInteger0(v0) % 11.69/2.36 | = v1)) % 11.69/2.36 | % 11.69/2.36 | ALPHA: (7) implies: % 11.69/2.36 | (8) smndt0(xc) = all_23_1 % 11.69/2.36 | (9) sdtpldt0(xb, all_23_1) = all_23_0 % 11.69/2.37 | (10) ! [v0: $i] : ( ~ (sdtasdt0(xq, v0) = all_23_0) | ~ $i(v0) | ? [v1: % 11.69/2.37 | int] : ( ~ (v1 = 0) & aInteger0(v0) = v1)) % 11.69/2.37 | % 11.69/2.37 | DELTA: instantiating (1) with fresh symbols all_29_0, all_29_1, all_29_2, % 11.69/2.37 | all_29_3 gives: % 11.69/2.37 | (11) sdteqdtlpzmzozddtrp0(xb, xc, xq) = 0 & sdteqdtlpzmzozddtrp0(xa, xb, % 11.69/2.37 | xq) = 0 & aDivisorOf0(xq, all_29_0) = 0 & aDivisorOf0(xq, all_29_2) % 11.69/2.37 | = 0 & sdtpldt0(xb, all_29_1) = all_29_0 & sdtpldt0(xa, all_29_3) = % 11.69/2.37 | all_29_2 & smndt0(xc) = all_29_1 & smndt0(xb) = all_29_3 & % 11.69/2.37 | $i(all_29_0) & $i(all_29_1) & $i(all_29_2) & $i(all_29_3) & ? [v0: % 11.69/2.37 | $i] : (sdtasdt0(xq, v0) = all_29_0 & aInteger0(v0) = 0 & $i(v0)) & % 11.69/2.37 | ? [v0: $i] : (sdtasdt0(xq, v0) = all_29_2 & aInteger0(v0) = 0 & % 11.69/2.37 | $i(v0)) % 11.69/2.37 | % 11.69/2.37 | ALPHA: (11) implies: % 11.69/2.37 | (12) smndt0(xc) = all_29_1 % 11.69/2.37 | (13) sdtpldt0(xb, all_29_1) = all_29_0 % 11.69/2.37 | (14) ? [v0: $i] : (sdtasdt0(xq, v0) = all_29_0 & aInteger0(v0) = 0 & % 11.69/2.37 | $i(v0)) % 11.69/2.37 | % 11.69/2.37 | DELTA: instantiating (14) with fresh symbol all_31_0 gives: % 11.69/2.37 | (15) sdtasdt0(xq, all_31_0) = all_29_0 & aInteger0(all_31_0) = 0 & % 11.69/2.37 | $i(all_31_0) % 11.69/2.37 | % 11.69/2.37 | ALPHA: (15) implies: % 11.69/2.37 | (16) $i(all_31_0) % 11.69/2.37 | (17) aInteger0(all_31_0) = 0 % 11.69/2.37 | (18) sdtasdt0(xq, all_31_0) = all_29_0 % 11.69/2.37 | % 11.69/2.37 | GROUND_INST: instantiating (5) with all_23_1, all_29_1, xc, simplifying with % 11.69/2.37 | (8), (12) gives: % 11.69/2.37 | (19) all_29_1 = all_23_1 % 11.69/2.37 | % 11.69/2.37 | REDUCE: (13), (19) imply: % 11.69/2.37 | (20) sdtpldt0(xb, all_23_1) = all_29_0 % 11.69/2.37 | % 11.69/2.37 | GROUND_INST: instantiating (6) with all_23_0, all_29_0, all_23_1, xb, % 11.69/2.37 | simplifying with (9), (20) gives: % 11.69/2.37 | (21) all_29_0 = all_23_0 % 11.69/2.37 | % 11.69/2.37 | REDUCE: (18), (21) imply: % 11.69/2.37 | (22) sdtasdt0(xq, all_31_0) = all_23_0 % 11.69/2.37 | % 11.69/2.37 | GROUND_INST: instantiating (10) with all_31_0, simplifying with (16), (22) % 11.69/2.37 | gives: % 11.69/2.37 | (23) ? [v0: int] : ( ~ (v0 = 0) & aInteger0(all_31_0) = v0) % 11.69/2.37 | % 11.69/2.37 | GROUND_INST: instantiating (mMulComm) with xq, all_31_0, all_23_0, simplifying % 11.69/2.37 | with (2), (16), (22) gives: % 11.69/2.37 | (24) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (sdtasdt0(all_31_0, xq) = % 11.69/2.37 | v2 & aInteger0(all_31_0) = v1 & aInteger0(xq) = v0 & $i(v2) & ( ~ % 11.69/2.37 | (v1 = 0) | ~ (v0 = 0) | v2 = all_23_0)) % 11.69/2.37 | % 11.69/2.37 | GROUND_INST: instantiating (mIntMult) with xq, all_31_0, all_23_0, simplifying % 11.69/2.37 | with (2), (16), (22) gives: % 11.69/2.37 | (25) ? [v0: any] : ? [v1: any] : ? [v2: any] : (aInteger0(all_31_0) = v1 % 11.69/2.37 | & aInteger0(all_23_0) = v2 & aInteger0(xq) = v0 & ( ~ (v1 = 0) | ~ % 11.69/2.37 | (v0 = 0) | v2 = 0)) % 11.69/2.37 | % 11.69/2.37 | DELTA: instantiating (23) with fresh symbol all_57_0 gives: % 11.69/2.37 | (26) ~ (all_57_0 = 0) & aInteger0(all_31_0) = all_57_0 % 11.69/2.37 | % 11.69/2.37 | ALPHA: (26) implies: % 11.69/2.37 | (27) ~ (all_57_0 = 0) % 11.69/2.37 | (28) aInteger0(all_31_0) = all_57_0 % 11.69/2.37 | % 11.69/2.37 | DELTA: instantiating (25) with fresh symbols all_67_0, all_67_1, all_67_2 % 11.69/2.37 | gives: % 11.69/2.38 | (29) aInteger0(all_31_0) = all_67_1 & aInteger0(all_23_0) = all_67_0 & % 11.69/2.38 | aInteger0(xq) = all_67_2 & ( ~ (all_67_1 = 0) | ~ (all_67_2 = 0) | % 11.69/2.38 | all_67_0 = 0) % 11.69/2.38 | % 11.69/2.38 | ALPHA: (29) implies: % 11.69/2.38 | (30) aInteger0(all_31_0) = all_67_1 % 11.69/2.38 | % 11.69/2.38 | DELTA: instantiating (24) with fresh symbols all_77_0, all_77_1, all_77_2 % 11.69/2.38 | gives: % 11.69/2.38 | (31) sdtasdt0(all_31_0, xq) = all_77_0 & aInteger0(all_31_0) = all_77_1 & % 11.69/2.38 | aInteger0(xq) = all_77_2 & $i(all_77_0) & ( ~ (all_77_1 = 0) | ~ % 11.69/2.38 | (all_77_2 = 0) | all_77_0 = all_23_0) % 11.69/2.38 | % 11.69/2.38 | ALPHA: (31) implies: % 11.69/2.38 | (32) aInteger0(all_31_0) = all_77_1 % 11.69/2.38 | % 11.69/2.38 | GROUND_INST: instantiating (4) with 0, all_67_1, all_31_0, simplifying with % 11.69/2.38 | (17), (30) gives: % 11.69/2.38 | (33) all_67_1 = 0 % 11.69/2.38 | % 11.69/2.38 | GROUND_INST: instantiating (4) with all_67_1, all_77_1, all_31_0, simplifying % 11.69/2.38 | with (30), (32) gives: % 11.69/2.38 | (34) all_77_1 = all_67_1 % 11.69/2.38 | % 11.69/2.38 | GROUND_INST: instantiating (4) with all_57_0, all_77_1, all_31_0, simplifying % 11.69/2.38 | with (28), (32) gives: % 11.69/2.38 | (35) all_77_1 = all_57_0 % 11.69/2.38 | % 11.69/2.38 | COMBINE_EQS: (34), (35) imply: % 11.69/2.38 | (36) all_67_1 = all_57_0 % 11.69/2.38 | % 11.69/2.38 | SIMP: (36) implies: % 11.69/2.38 | (37) all_67_1 = all_57_0 % 11.69/2.38 | % 11.69/2.38 | COMBINE_EQS: (33), (37) imply: % 11.69/2.38 | (38) all_57_0 = 0 % 11.69/2.38 | % 11.69/2.38 | SIMP: (38) implies: % 11.69/2.38 | (39) all_57_0 = 0 % 11.69/2.38 | % 11.69/2.38 | REDUCE: (27), (39) imply: % 11.69/2.38 | (40) $false % 11.69/2.38 | % 11.69/2.38 | CLOSE: (40) is inconsistent. % 11.69/2.38 | % 11.69/2.38 End of proof % 11.69/2.38 % SZS output end Proof for theBenchmark % 11.69/2.38 % 11.69/2.38 1740ms %------------------------------------------------------------------------------