%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM435+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 : n005.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:44 EDT 2023 % Result : Theorem 9.71s 2.09s % Output : Proof 14.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.13 % Problem : NUM435+1 : TPTP v8.1.2. Released v4.0.0. % 0.09/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n005.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 14:17:23 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.98/1.15 Prover 1: Preprocessing ... % 2.98/1.15 Prover 4: Preprocessing ... % 3.31/1.19 Prover 0: Preprocessing ... % 3.31/1.19 Prover 6: Preprocessing ... % 3.31/1.19 Prover 3: Preprocessing ... % 3.31/1.19 Prover 2: Preprocessing ... % 3.31/1.19 Prover 5: Preprocessing ... % 6.32/1.61 Prover 1: Constructing countermodel ... % 6.32/1.67 Prover 6: Proving ... % 6.87/1.67 Prover 3: Constructing countermodel ... % 7.16/1.74 Prover 5: Constructing countermodel ... % 7.92/1.85 Prover 4: Constructing countermodel ... % 7.92/1.88 Prover 2: Proving ... % 8.48/1.93 Prover 0: Proving ... % 9.71/2.09 Prover 3: proved (1443ms) % 9.71/2.09 % 9.71/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.71/2.09 % 9.71/2.09 Prover 0: stopped % 9.71/2.09 Prover 2: stopped % 9.71/2.09 Prover 5: stopped % 9.71/2.09 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.71/2.09 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.71/2.09 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.71/2.11 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.03/2.12 Prover 6: stopped % 10.03/2.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.28/2.20 Prover 8: Preprocessing ... % 10.28/2.20 Prover 10: Preprocessing ... % 10.28/2.21 Prover 11: Preprocessing ... % 10.28/2.21 Prover 13: Preprocessing ... % 10.28/2.22 Prover 7: Preprocessing ... % 11.15/2.33 Prover 8: Warning: ignoring some quantifiers % 11.65/2.35 Prover 8: Constructing countermodel ... % 11.65/2.35 Prover 10: Constructing countermodel ... % 11.65/2.36 Prover 7: Constructing countermodel ... % 12.27/2.43 Prover 13: Constructing countermodel ... % 12.53/2.49 Prover 11: Constructing countermodel ... % 14.31/2.70 Prover 10: Found proof (size 36) % 14.31/2.71 Prover 10: proved (594ms) % 14.31/2.71 Prover 13: stopped % 14.31/2.71 Prover 4: stopped % 14.31/2.71 Prover 7: stopped % 14.31/2.71 Prover 8: stopped % 14.31/2.71 Prover 1: stopped % 14.31/2.71 Prover 11: stopped % 14.31/2.71 % 14.31/2.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.31/2.71 % 14.31/2.71 % SZS output start Proof for theBenchmark % 14.31/2.72 Assumptions after simplification: % 14.31/2.72 --------------------------------- % 14.31/2.72 % 14.31/2.72 (mEquModRef) % 14.31/2.72 $i(sz00) & ! [v0: $i] : ! [v1: $i] : (v1 = sz00 | ~ $i(v1) | ~ $i(v0) | ~ % 14.31/2.72 aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v0, v1)) % 14.31/2.72 % 14.31/2.72 (mIntZero) % 14.31/2.73 $i(sz00) & aInteger0(sz00) % 14.31/2.73 % 14.31/2.73 (mMulAsso) % 14.31/2.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 14.31/2.75 (sdtasdt0(v3, v2) = v4) | ~ (sdtasdt0(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) % 14.31/2.75 | ~ $i(v0) | ~ aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) | ? % 14.31/2.75 [v5: $i] : (sdtasdt0(v1, v2) = v5 & sdtasdt0(v0, v5) = v4 & $i(v5) & % 14.31/2.75 $i(v4))) % 14.31/2.75 % 14.31/2.75 (mMulComm) % 14.31/2.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 14.31/2.75 $i(v1) | ~ $i(v0) | ~ aInteger0(v1) | ~ aInteger0(v0) | (sdtasdt0(v1, v0) % 14.31/2.75 = v2 & $i(v2))) % 14.31/2.75 % 14.31/2.75 (m__) % 14.31/2.75 $i(xm) & $i(xq) & $i(xp) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : ? % 14.31/2.75 [v2: $i] : ? [v3: $i] : ( ~ (v3 = v1) & sdtasdt0(xq, v2) = v3 & sdtasdt0(xp, % 14.31/2.75 xm) = v2 & sdtpldt0(xa, v0) = v1 & smndt0(xb) = v0 & $i(v3) & $i(v2) & % 14.31/2.75 $i(v1) & $i(v0)) % 14.31/2.75 % 14.31/2.75 (m__1003) % 14.31/2.75 $i(xq) & $i(xp) & $i(xb) & $i(xa) & ? [v0: $i] : (sdtasdt0(xp, xq) = v0 & % 14.31/2.75 $i(v0) & sdteqdtlpzmzozddtrp0(xa, xb, v0)) % 14.31/2.75 % 14.31/2.75 (m__1032) % 14.31/2.75 $i(xm) & $i(xq) & $i(xp) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : ? % 14.31/2.75 [v2: $i] : (sdtasdt0(v0, xm) = v1 & sdtasdt0(xp, xq) = v0 & sdtpldt0(xa, v2) = % 14.31/2.75 v1 & smndt0(xb) = v2 & $i(v2) & $i(v1) & $i(v0) & aInteger0(xm)) % 14.31/2.75 % 14.31/2.75 (m__979) % 14.31/2.75 ~ (xq = sz00) & ~ (xp = sz00) & $i(xq) & $i(xp) & $i(xb) & $i(xa) & $i(sz00) % 14.31/2.75 & aInteger0(xq) & aInteger0(xp) & aInteger0(xb) & aInteger0(xa) % 14.31/2.75 % 14.31/2.75 (function-axioms) % 14.31/2.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.31/2.75 (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 14.31/2.75 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | % 14.31/2.75 ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 % 14.31/2.75 = v0 | ~ (smndt0(v2) = v1) | ~ (smndt0(v2) = v0)) % 14.31/2.75 % 14.31/2.75 Further assumptions not needed in the proof: % 14.31/2.75 -------------------------------------------- % 14.31/2.75 mAddAsso, mAddComm, mAddNeg, mAddZero, mDistrib, mDivisor, mEquMod, mEquModSym, % 14.31/2.75 mEquModTrn, mIntMult, mIntNeg, mIntOne, mIntPlus, mIntegers, mMulMinOne, % 14.31/2.75 mMulOne, mMulZero, mZeroDiv % 14.31/2.75 % 14.31/2.75 Those formulas are unsatisfiable: % 14.31/2.75 --------------------------------- % 14.31/2.75 % 14.31/2.75 Begin of proof % 14.31/2.76 | % 14.31/2.76 | ALPHA: (mIntZero) implies: % 14.31/2.76 | (1) aInteger0(sz00) % 14.31/2.76 | % 14.31/2.76 | ALPHA: (mEquModRef) implies: % 14.69/2.76 | (2) ! [v0: $i] : ! [v1: $i] : (v1 = sz00 | ~ $i(v1) | ~ $i(v0) | ~ % 14.69/2.76 | aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v0, v1)) % 14.69/2.76 | % 14.69/2.76 | ALPHA: (m__979) implies: % 14.69/2.76 | (3) ~ (xp = sz00) % 14.69/2.76 | (4) aInteger0(xp) % 14.69/2.76 | (5) aInteger0(xq) % 14.69/2.76 | (6) $i(sz00) % 14.69/2.76 | % 14.69/2.76 | ALPHA: (m__1003) implies: % 14.69/2.76 | (7) ? [v0: $i] : (sdtasdt0(xp, xq) = v0 & $i(v0) & % 14.69/2.76 | sdteqdtlpzmzozddtrp0(xa, xb, v0)) % 14.69/2.76 | % 14.69/2.76 | ALPHA: (m__1032) implies: % 14.69/2.76 | (8) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (sdtasdt0(v0, xm) = v1 & % 14.69/2.76 | sdtasdt0(xp, xq) = v0 & sdtpldt0(xa, v2) = v1 & smndt0(xb) = v2 & % 14.69/2.76 | $i(v2) & $i(v1) & $i(v0) & aInteger0(xm)) % 14.69/2.76 | % 14.69/2.76 | ALPHA: (m__) implies: % 14.69/2.76 | (9) $i(xp) % 14.69/2.76 | (10) $i(xq) % 14.69/2.76 | (11) $i(xm) % 14.69/2.76 | (12) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v1) % 14.69/2.76 | & sdtasdt0(xq, v2) = v3 & sdtasdt0(xp, xm) = v2 & sdtpldt0(xa, v0) = % 14.69/2.76 | v1 & smndt0(xb) = v0 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 14.69/2.76 | % 14.69/2.76 | ALPHA: (function-axioms) implies: % 14.69/2.76 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = % 14.69/2.76 | v1) | ~ (smndt0(v2) = v0)) % 14.72/2.76 | (14) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.72/2.76 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 14.72/2.76 | (15) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.72/2.76 | (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 14.72/2.76 | % 14.72/2.76 | DELTA: instantiating (7) with fresh symbol all_22_0 gives: % 14.72/2.76 | (16) sdtasdt0(xp, xq) = all_22_0 & $i(all_22_0) & sdteqdtlpzmzozddtrp0(xa, % 14.72/2.76 | xb, all_22_0) % 14.72/2.76 | % 14.72/2.76 | ALPHA: (16) implies: % 14.72/2.76 | (17) sdtasdt0(xp, xq) = all_22_0 % 14.72/2.76 | % 14.72/2.76 | DELTA: instantiating (8) with fresh symbols all_27_0, all_27_1, all_27_2 % 14.72/2.76 | gives: % 14.72/2.77 | (18) sdtasdt0(all_27_2, xm) = all_27_1 & sdtasdt0(xp, xq) = all_27_2 & % 14.72/2.77 | sdtpldt0(xa, all_27_0) = all_27_1 & smndt0(xb) = all_27_0 & % 14.72/2.77 | $i(all_27_0) & $i(all_27_1) & $i(all_27_2) & aInteger0(xm) % 14.72/2.77 | % 14.72/2.77 | ALPHA: (18) implies: % 14.72/2.77 | (19) aInteger0(xm) % 14.72/2.77 | (20) smndt0(xb) = all_27_0 % 14.72/2.77 | (21) sdtpldt0(xa, all_27_0) = all_27_1 % 14.72/2.77 | (22) sdtasdt0(xp, xq) = all_27_2 % 14.72/2.77 | (23) sdtasdt0(all_27_2, xm) = all_27_1 % 14.72/2.77 | % 14.72/2.77 | DELTA: instantiating (12) with fresh symbols all_29_0, all_29_1, all_29_2, % 14.72/2.77 | all_29_3 gives: % 14.72/2.77 | (24) ~ (all_29_0 = all_29_2) & sdtasdt0(xq, all_29_1) = all_29_0 & % 14.72/2.77 | sdtasdt0(xp, xm) = all_29_1 & sdtpldt0(xa, all_29_3) = all_29_2 & % 14.72/2.77 | smndt0(xb) = all_29_3 & $i(all_29_0) & $i(all_29_1) & $i(all_29_2) & % 14.72/2.77 | $i(all_29_3) % 14.72/2.77 | % 14.72/2.77 | ALPHA: (24) implies: % 14.72/2.77 | (25) ~ (all_29_0 = all_29_2) % 14.72/2.77 | (26) smndt0(xb) = all_29_3 % 14.72/2.77 | (27) sdtpldt0(xa, all_29_3) = all_29_2 % 14.72/2.77 | (28) sdtasdt0(xp, xm) = all_29_1 % 14.72/2.77 | (29) sdtasdt0(xq, all_29_1) = all_29_0 % 14.72/2.77 | % 14.72/2.77 | GROUND_INST: instantiating (13) with all_27_0, all_29_3, xb, simplifying with % 14.72/2.77 | (20), (26) gives: % 14.72/2.77 | (30) all_29_3 = all_27_0 % 14.72/2.77 | % 14.72/2.77 | GROUND_INST: instantiating (15) with all_22_0, all_27_2, xq, xp, simplifying % 14.72/2.77 | with (17), (22) gives: % 14.72/2.77 | (31) all_27_2 = all_22_0 % 14.72/2.77 | % 14.72/2.77 | REDUCE: (23), (31) imply: % 14.72/2.77 | (32) sdtasdt0(all_22_0, xm) = all_27_1 % 14.72/2.77 | % 14.72/2.77 | REDUCE: (27), (30) imply: % 14.72/2.77 | (33) sdtpldt0(xa, all_27_0) = all_29_2 % 14.72/2.77 | % 14.72/2.77 | GROUND_INST: instantiating (14) with all_27_1, all_29_2, all_27_0, xa, % 14.72/2.77 | simplifying with (21), (33) gives: % 14.72/2.77 | (34) all_29_2 = all_27_1 % 14.72/2.77 | % 14.72/2.77 | REDUCE: (25), (34) imply: % 14.72/2.77 | (35) ~ (all_29_0 = all_27_1) % 14.72/2.77 | % 14.72/2.77 | GROUND_INST: instantiating (2) with sz00, xp, simplifying with (1), (4), (6), % 14.72/2.77 | (9) gives: % 14.72/2.77 | (36) xp = sz00 | sdteqdtlpzmzozddtrp0(sz00, sz00, xp) % 14.72/2.77 | % 14.72/2.77 | GROUND_INST: instantiating (mMulComm) with xp, xq, all_22_0, simplifying with % 14.72/2.77 | (4), (5), (9), (10), (17) gives: % 14.72/2.77 | (37) sdtasdt0(xq, xp) = all_22_0 & $i(all_22_0) % 14.72/2.77 | % 14.72/2.77 | ALPHA: (37) implies: % 14.72/2.77 | (38) sdtasdt0(xq, xp) = all_22_0 % 14.72/2.77 | % 14.72/2.77 | BETA: splitting (36) gives: % 14.72/2.77 | % 14.72/2.77 | Case 1: % 14.72/2.77 | | % 14.72/2.77 | | % 14.72/2.77 | | GROUND_INST: instantiating (mMulAsso) with xq, xp, xm, all_22_0, all_27_1, % 14.72/2.77 | | simplifying with (4), (5), (9), (10), (11), (19), (32), (38) % 14.72/2.77 | | gives: % 14.72/2.78 | | (39) ? [v0: $i] : (sdtasdt0(xq, v0) = all_27_1 & sdtasdt0(xp, xm) = v0 & % 14.72/2.78 | | $i(v0) & $i(all_27_1)) % 14.72/2.78 | | % 14.72/2.78 | | DELTA: instantiating (39) with fresh symbol all_109_0 gives: % 14.72/2.78 | | (40) sdtasdt0(xq, all_109_0) = all_27_1 & sdtasdt0(xp, xm) = all_109_0 & % 14.72/2.78 | | $i(all_109_0) & $i(all_27_1) % 14.72/2.78 | | % 14.72/2.78 | | ALPHA: (40) implies: % 14.72/2.78 | | (41) sdtasdt0(xp, xm) = all_109_0 % 14.72/2.78 | | (42) sdtasdt0(xq, all_109_0) = all_27_1 % 14.72/2.78 | | % 14.72/2.78 | | GROUND_INST: instantiating (15) with all_29_1, all_109_0, xm, xp, % 14.72/2.78 | | simplifying with (28), (41) gives: % 14.72/2.78 | | (43) all_109_0 = all_29_1 % 14.72/2.78 | | % 14.72/2.78 | | REDUCE: (42), (43) imply: % 14.72/2.78 | | (44) sdtasdt0(xq, all_29_1) = all_27_1 % 14.72/2.78 | | % 14.72/2.78 | | GROUND_INST: instantiating (15) with all_29_0, all_27_1, all_29_1, xq, % 14.72/2.78 | | simplifying with (29), (44) gives: % 14.72/2.78 | | (45) all_29_0 = all_27_1 % 14.72/2.78 | | % 14.72/2.78 | | REDUCE: (35), (45) imply: % 14.72/2.78 | | (46) $false % 14.72/2.78 | | % 14.72/2.78 | | CLOSE: (46) is inconsistent. % 14.72/2.78 | | % 14.72/2.78 | Case 2: % 14.72/2.78 | | % 14.72/2.78 | | (47) xp = sz00 % 14.72/2.78 | | % 14.72/2.78 | | REDUCE: (3), (47) imply: % 14.72/2.78 | | (48) $false % 14.72/2.78 | | % 14.72/2.78 | | CLOSE: (48) is inconsistent. % 14.72/2.78 | | % 14.72/2.78 | End of split % 14.72/2.78 | % 14.72/2.78 End of proof % 14.72/2.78 % SZS output end Proof for theBenchmark % 14.72/2.78 % 14.72/2.78 2158ms %------------------------------------------------------------------------------