%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM425+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 : n013.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:40 EDT 2023 % Result : Theorem 8.28s 1.92s % Output : Proof 10.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM425+3 : 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 : n013.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 15:24:47 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/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 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 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 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 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 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 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.32/1.10 Prover 4: Preprocessing ... % 2.32/1.10 Prover 1: Preprocessing ... % 2.97/1.14 Prover 3: Preprocessing ... % 2.97/1.14 Prover 0: Preprocessing ... % 2.97/1.14 Prover 2: Preprocessing ... % 2.97/1.14 Prover 5: Preprocessing ... % 2.97/1.14 Prover 6: Preprocessing ... % 6.14/1.63 Prover 1: Constructing countermodel ... % 6.14/1.63 Prover 3: Constructing countermodel ... % 6.14/1.65 Prover 6: Proving ... % 7.01/1.72 Prover 5: Constructing countermodel ... % 7.01/1.74 Prover 4: Constructing countermodel ... % 7.01/1.80 Prover 2: Proving ... % 8.28/1.90 Prover 0: Proving ... % 8.28/1.92 Prover 3: proved (1264ms) % 8.28/1.92 % 8.28/1.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.28/1.92 % 8.28/1.92 Prover 5: stopped % 8.28/1.92 Prover 6: stopped % 8.28/1.93 Prover 2: stopped % 8.28/1.94 Prover 0: stopped % 8.28/1.94 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.28/1.94 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.28/1.94 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.28/1.94 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.28/1.94 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.87/1.98 Prover 8: Preprocessing ... % 8.87/1.99 Prover 7: Preprocessing ... % 8.87/2.03 Prover 10: Preprocessing ... % 8.87/2.04 Prover 11: Preprocessing ... % 8.87/2.05 Prover 13: Preprocessing ... % 8.87/2.11 Prover 8: Warning: ignoring some quantifiers % 8.87/2.11 Prover 1: Found proof (size 30) % 8.87/2.11 Prover 1: proved (1483ms) % 8.87/2.11 Prover 4: stopped % 8.87/2.11 Prover 13: stopped % 9.54/2.12 Prover 8: Constructing countermodel ... % 9.54/2.12 Prover 8: stopped % 9.54/2.13 Prover 11: stopped % 9.94/2.14 Prover 10: Constructing countermodel ... % 9.94/2.15 Prover 10: stopped % 10.05/2.19 Prover 7: Constructing countermodel ... % 10.05/2.20 Prover 7: stopped % 10.05/2.20 % 10.05/2.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.05/2.20 % 10.05/2.21 % SZS output start Proof for theBenchmark % 10.34/2.22 Assumptions after simplification: % 10.34/2.22 --------------------------------- % 10.34/2.22 % 10.34/2.22 (mIntMult) % 10.34/2.25 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 10.34/2.25 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] : % 10.34/2.25 (aInteger0(v2) = v5 & aInteger0(v1) = v4 & aInteger0(v0) = v3 & ( ~ (v4 = 0) % 10.34/2.25 | ~ (v3 = 0) | v5 = 0))) % 10.34/2.25 % 10.34/2.25 (mMulComm) % 10.50/2.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtasdt0(v0, v1) = v2) | ~ % 10.50/2.26 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: $i] : % 10.50/2.26 (sdtasdt0(v1, v0) = v5 & aInteger0(v1) = v4 & aInteger0(v0) = v3 & $i(v5) & % 10.50/2.26 ( ~ (v4 = 0) | ~ (v3 = 0) | v5 = v2))) % 10.50/2.26 % 10.50/2.26 (m__) % 10.50/2.26 $i(xq) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : (sdtpldt0(xa, v0) = v1 % 10.50/2.26 & smndt0(xb) = v0 & $i(v1) & $i(v0) & ! [v2: $i] : ( ~ (sdtasdt0(xq, v2) = % 10.50/2.26 v1) | ~ $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & aInteger0(v2) = v3))) % 10.50/2.26 % 10.50/2.26 (m__724) % 10.50/2.27 $i(xq) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : % 10.50/2.27 (sdteqdtlpzmzozddtrp0(xa, xb, xq) = 0 & aDivisorOf0(xq, v1) = 0 & sdtpldt0(xa, % 10.50/2.27 v0) = v1 & smndt0(xb) = v0 & $i(v1) & $i(v0) & ? [v2: $i] : (sdtasdt0(xq, % 10.50/2.27 v2) = v1 & aInteger0(v2) = 0 & $i(v2))) % 10.50/2.27 % 10.50/2.27 (function-axioms) % 10.50/2.27 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 10.50/2.27 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sdteqdtlpzmzozddtrp0(v4, v3, v2) = v1) % 10.50/2.27 | ~ (sdteqdtlpzmzozddtrp0(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : % 10.50/2.27 ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.50/2.27 (aDivisorOf0(v3, v2) = v1) | ~ (aDivisorOf0(v3, v2) = v0)) & ! [v0: $i] : % 10.50/2.27 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) % 10.50/2.27 | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 10.50/2.27 [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 10.50/2.27 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = v1) | % 10.50/2.27 ~ (smndt0(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.50/2.27 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aInteger0(v2) = v1) | ~ % 10.50/2.27 (aInteger0(v2) = v0)) % 10.50/2.28 % 10.50/2.28 Further assumptions not needed in the proof: % 10.50/2.28 -------------------------------------------- % 10.50/2.28 mAddAsso, mAddComm, mAddNeg, mAddZero, mDistrib, mDivisor, mEquMod, mEquModRef, % 10.50/2.28 mIntNeg, mIntOne, mIntPlus, mIntZero, mIntegers, mMulAsso, mMulMinOne, mMulOne, % 10.50/2.28 mMulZero, mZeroDiv, m__704 % 10.50/2.28 % 10.50/2.28 Those formulas are unsatisfiable: % 10.50/2.28 --------------------------------- % 10.50/2.28 % 10.50/2.28 Begin of proof % 10.50/2.28 | % 10.50/2.28 | ALPHA: (m__724) implies: % 10.50/2.28 | (1) ? [v0: $i] : ? [v1: $i] : (sdteqdtlpzmzozddtrp0(xa, xb, xq) = 0 & % 10.50/2.28 | aDivisorOf0(xq, v1) = 0 & sdtpldt0(xa, v0) = v1 & smndt0(xb) = v0 & % 10.50/2.28 | $i(v1) & $i(v0) & ? [v2: $i] : (sdtasdt0(xq, v2) = v1 & % 10.50/2.28 | aInteger0(v2) = 0 & $i(v2))) % 10.50/2.28 | % 10.50/2.28 | ALPHA: (m__) implies: % 10.50/2.28 | (2) $i(xq) % 10.50/2.29 | (3) ? [v0: $i] : ? [v1: $i] : (sdtpldt0(xa, v0) = v1 & smndt0(xb) = v0 & % 10.50/2.29 | $i(v1) & $i(v0) & ! [v2: $i] : ( ~ (sdtasdt0(xq, v2) = v1) | ~ % 10.50/2.29 | $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & aInteger0(v2) = v3))) % 10.50/2.29 | % 10.50/2.29 | ALPHA: (function-axioms) implies: % 10.50/2.29 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 10.50/2.29 | (v1 = v0 | ~ (aInteger0(v2) = v1) | ~ (aInteger0(v2) = v0)) % 10.50/2.29 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (smndt0(v2) = % 10.50/2.29 | v1) | ~ (smndt0(v2) = v0)) % 10.50/2.29 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.50/2.29 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 10.50/2.29 | % 10.50/2.29 | DELTA: instantiating (3) with fresh symbols all_20_0, all_20_1 gives: % 10.50/2.29 | (7) sdtpldt0(xa, all_20_1) = all_20_0 & smndt0(xb) = all_20_1 & % 10.50/2.29 | $i(all_20_0) & $i(all_20_1) & ! [v0: $i] : ( ~ (sdtasdt0(xq, v0) = % 10.50/2.30 | all_20_0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & aInteger0(v0) % 10.50/2.30 | = v1)) % 10.50/2.30 | % 10.50/2.30 | ALPHA: (7) implies: % 10.50/2.30 | (8) smndt0(xb) = all_20_1 % 10.50/2.30 | (9) sdtpldt0(xa, all_20_1) = all_20_0 % 10.50/2.30 | (10) ! [v0: $i] : ( ~ (sdtasdt0(xq, v0) = all_20_0) | ~ $i(v0) | ? [v1: % 10.50/2.30 | int] : ( ~ (v1 = 0) & aInteger0(v0) = v1)) % 10.50/2.30 | % 10.50/2.30 | DELTA: instantiating (1) with fresh symbols all_23_0, all_23_1 gives: % 10.50/2.30 | (11) sdteqdtlpzmzozddtrp0(xa, xb, xq) = 0 & aDivisorOf0(xq, all_23_0) = 0 & % 10.50/2.30 | sdtpldt0(xa, all_23_1) = all_23_0 & smndt0(xb) = all_23_1 & % 10.50/2.30 | $i(all_23_0) & $i(all_23_1) & ? [v0: $i] : (sdtasdt0(xq, v0) = % 10.50/2.30 | all_23_0 & aInteger0(v0) = 0 & $i(v0)) % 10.50/2.30 | % 10.50/2.30 | ALPHA: (11) implies: % 10.50/2.30 | (12) smndt0(xb) = all_23_1 % 10.50/2.30 | (13) sdtpldt0(xa, all_23_1) = all_23_0 % 10.50/2.30 | (14) ? [v0: $i] : (sdtasdt0(xq, v0) = all_23_0 & aInteger0(v0) = 0 & % 10.50/2.30 | $i(v0)) % 10.50/2.30 | % 10.50/2.30 | DELTA: instantiating (14) with fresh symbol all_28_0 gives: % 10.50/2.30 | (15) sdtasdt0(xq, all_28_0) = all_23_0 & aInteger0(all_28_0) = 0 & % 10.50/2.30 | $i(all_28_0) % 10.50/2.30 | % 10.50/2.30 | ALPHA: (15) implies: % 10.50/2.30 | (16) $i(all_28_0) % 10.50/2.30 | (17) aInteger0(all_28_0) = 0 % 10.50/2.30 | (18) sdtasdt0(xq, all_28_0) = all_23_0 % 10.50/2.30 | % 10.50/2.30 | GROUND_INST: instantiating (5) with all_20_1, all_23_1, xb, simplifying with % 10.50/2.30 | (8), (12) gives: % 10.50/2.30 | (19) all_23_1 = all_20_1 % 10.50/2.30 | % 10.50/2.30 | REDUCE: (13), (19) imply: % 10.50/2.30 | (20) sdtpldt0(xa, all_20_1) = all_23_0 % 10.50/2.30 | % 10.50/2.31 | GROUND_INST: instantiating (6) with all_20_0, all_23_0, all_20_1, xa, % 10.50/2.31 | simplifying with (9), (20) gives: % 10.50/2.31 | (21) all_23_0 = all_20_0 % 10.50/2.31 | % 10.50/2.31 | REDUCE: (18), (21) imply: % 10.50/2.31 | (22) sdtasdt0(xq, all_28_0) = all_20_0 % 10.50/2.31 | % 10.50/2.31 | GROUND_INST: instantiating (10) with all_28_0, simplifying with (16), (22) % 10.50/2.31 | gives: % 10.50/2.31 | (23) ? [v0: int] : ( ~ (v0 = 0) & aInteger0(all_28_0) = v0) % 10.50/2.31 | % 10.50/2.31 | GROUND_INST: instantiating (mMulComm) with xq, all_28_0, all_20_0, simplifying % 10.50/2.31 | with (2), (16), (22) gives: % 10.50/2.31 | (24) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (sdtasdt0(all_28_0, xq) = % 10.50/2.31 | v2 & aInteger0(all_28_0) = v1 & aInteger0(xq) = v0 & $i(v2) & ( ~ % 10.50/2.31 | (v1 = 0) | ~ (v0 = 0) | v2 = all_20_0)) % 10.50/2.31 | % 10.50/2.31 | GROUND_INST: instantiating (mIntMult) with xq, all_28_0, all_20_0, simplifying % 10.50/2.31 | with (2), (16), (22) gives: % 10.50/2.31 | (25) ? [v0: any] : ? [v1: any] : ? [v2: any] : (aInteger0(all_28_0) = v1 % 10.50/2.31 | & aInteger0(all_20_0) = v2 & aInteger0(xq) = v0 & ( ~ (v1 = 0) | ~ % 10.50/2.31 | (v0 = 0) | v2 = 0)) % 10.50/2.31 | % 10.50/2.31 | DELTA: instantiating (23) with fresh symbol all_49_0 gives: % 10.50/2.31 | (26) ~ (all_49_0 = 0) & aInteger0(all_28_0) = all_49_0 % 10.50/2.31 | % 10.50/2.31 | ALPHA: (26) implies: % 10.50/2.31 | (27) ~ (all_49_0 = 0) % 10.50/2.31 | (28) aInteger0(all_28_0) = all_49_0 % 10.50/2.31 | % 10.50/2.31 | DELTA: instantiating (25) with fresh symbols all_55_0, all_55_1, all_55_2 % 10.50/2.31 | gives: % 10.50/2.31 | (29) aInteger0(all_28_0) = all_55_1 & aInteger0(all_20_0) = all_55_0 & % 10.50/2.31 | aInteger0(xq) = all_55_2 & ( ~ (all_55_1 = 0) | ~ (all_55_2 = 0) | % 10.50/2.31 | all_55_0 = 0) % 10.50/2.31 | % 10.50/2.31 | ALPHA: (29) implies: % 10.50/2.31 | (30) aInteger0(all_28_0) = all_55_1 % 10.50/2.31 | % 10.50/2.31 | DELTA: instantiating (24) with fresh symbols all_59_0, all_59_1, all_59_2 % 10.50/2.31 | gives: % 10.50/2.31 | (31) sdtasdt0(all_28_0, xq) = all_59_0 & aInteger0(all_28_0) = all_59_1 & % 10.50/2.31 | aInteger0(xq) = all_59_2 & $i(all_59_0) & ( ~ (all_59_1 = 0) | ~ % 10.50/2.31 | (all_59_2 = 0) | all_59_0 = all_20_0) % 10.50/2.31 | % 10.50/2.31 | ALPHA: (31) implies: % 10.50/2.31 | (32) aInteger0(all_28_0) = all_59_1 % 10.50/2.31 | % 10.50/2.31 | GROUND_INST: instantiating (4) with 0, all_55_1, all_28_0, simplifying with % 10.50/2.31 | (17), (30) gives: % 10.50/2.31 | (33) all_55_1 = 0 % 10.50/2.31 | % 10.50/2.31 | GROUND_INST: instantiating (4) with all_55_1, all_59_1, all_28_0, simplifying % 10.50/2.31 | with (30), (32) gives: % 10.50/2.31 | (34) all_59_1 = all_55_1 % 10.50/2.31 | % 10.50/2.31 | GROUND_INST: instantiating (4) with all_49_0, all_59_1, all_28_0, simplifying % 10.50/2.31 | with (28), (32) gives: % 10.50/2.31 | (35) all_59_1 = all_49_0 % 10.50/2.31 | % 10.50/2.31 | COMBINE_EQS: (34), (35) imply: % 10.50/2.31 | (36) all_55_1 = all_49_0 % 10.50/2.31 | % 10.50/2.31 | SIMP: (36) implies: % 10.50/2.31 | (37) all_55_1 = all_49_0 % 10.50/2.31 | % 10.50/2.31 | COMBINE_EQS: (33), (37) imply: % 10.50/2.31 | (38) all_49_0 = 0 % 10.50/2.31 | % 10.50/2.31 | REDUCE: (27), (38) imply: % 10.50/2.31 | (39) $false % 10.50/2.32 | % 10.50/2.32 | CLOSE: (39) is inconsistent. % 10.50/2.32 | % 10.50/2.32 End of proof % 10.50/2.32 % SZS output end Proof for theBenchmark % 10.50/2.32 % 10.50/2.32 1708ms %------------------------------------------------------------------------------