%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM469+2 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n001.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:57 EDT 2023 % Result : Theorem 12.19s 2.43s % Output : Proof 20.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM469+2 : 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 : n001.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 08:32:28 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.47/1.15 Prover 1: Preprocessing ... % 3.47/1.15 Prover 4: Preprocessing ... % 3.47/1.19 Prover 3: Preprocessing ... % 3.47/1.19 Prover 6: Preprocessing ... % 3.47/1.19 Prover 5: Preprocessing ... % 3.47/1.20 Prover 2: Preprocessing ... % 3.47/1.20 Prover 0: Preprocessing ... % 8.62/1.88 Prover 1: Constructing countermodel ... % 8.62/1.92 Prover 3: Constructing countermodel ... % 9.22/1.97 Prover 6: Proving ... % 9.42/2.00 Prover 5: Constructing countermodel ... % 9.88/2.18 Prover 2: Proving ... % 11.70/2.31 Prover 4: Constructing countermodel ... % 11.70/2.35 Prover 0: Proving ... % 12.19/2.42 Prover 3: proved (1796ms) % 12.19/2.42 % 12.19/2.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.19/2.43 % 12.19/2.43 Prover 5: stopped % 12.19/2.44 Prover 6: stopped % 12.19/2.45 Prover 2: stopped % 12.19/2.45 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.19/2.45 Prover 0: stopped % 12.19/2.45 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.19/2.45 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.19/2.45 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.19/2.45 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.21/2.51 Prover 7: Preprocessing ... % 13.21/2.52 Prover 10: Preprocessing ... % 13.21/2.53 Prover 13: Preprocessing ... % 13.21/2.53 Prover 8: Preprocessing ... % 13.50/2.54 Prover 11: Preprocessing ... % 14.24/2.68 Prover 10: Constructing countermodel ... % 15.19/2.77 Prover 7: Constructing countermodel ... % 15.19/2.77 Prover 8: Warning: ignoring some quantifiers % 15.19/2.78 Prover 8: Constructing countermodel ... % 15.19/2.79 Prover 13: Constructing countermodel ... % 17.50/3.09 Prover 11: Constructing countermodel ... % 20.02/3.42 Prover 10: Found proof (size 24) % 20.02/3.42 Prover 10: proved (969ms) % 20.02/3.42 Prover 11: stopped % 20.02/3.42 Prover 4: stopped % 20.02/3.42 Prover 7: stopped % 20.02/3.42 Prover 13: stopped % 20.02/3.42 Prover 8: stopped % 20.02/3.42 Prover 1: stopped % 20.02/3.42 % 20.02/3.42 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.02/3.42 % 20.02/3.43 % SZS output start Proof for theBenchmark % 20.02/3.43 Assumptions after simplification: % 20.02/3.43 --------------------------------- % 20.02/3.43 % 20.02/3.43 (mAMDistr) % 20.02/3.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 20.02/3.46 $i] : ( ~ (sdtasdt0(v0, v2) = v4) | ~ (sdtasdt0(v0, v1) = v3) | ~ % 20.02/3.46 (sdtpldt0(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 20.02/3.46 aNaturalNumber0(v2) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | ? % 20.02/3.46 [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : (sdtasdt0(v6, v0) = v7 % 20.02/3.46 & sdtasdt0(v2, v0) = v9 & sdtasdt0(v1, v0) = v8 & sdtasdt0(v0, v6) = v5 & % 20.02/3.46 sdtpldt0(v8, v9) = v7 & sdtpldt0(v1, v2) = v6 & $i(v9) & $i(v8) & $i(v7) & % 20.02/3.46 $i(v6) & $i(v5))) % 20.02/3.46 % 20.02/3.46 (mAddComm) % 20.02/3.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtpldt0(v0, v1) = v2) | ~ % 20.02/3.46 $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | % 20.02/3.46 (sdtpldt0(v1, v0) = v2 & $i(v2))) % 20.02/3.46 % 20.02/3.46 (mSortsB) % 20.40/3.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtpldt0(v0, v1) = v2) | ~ % 20.40/3.46 $i(v1) | ~ $i(v0) | ~ aNaturalNumber0(v1) | ~ aNaturalNumber0(v0) | % 20.40/3.46 aNaturalNumber0(v2)) % 20.40/3.46 % 20.40/3.46 (m__) % 20.40/3.46 $i(xn) & $i(xm) & $i(xl) & ? [v0: $i] : (sdtpldt0(xm, xn) = v0 & $i(v0) & ~ % 20.40/3.46 doDivides0(xl, v0) & ! [v1: $i] : ( ~ (sdtasdt0(xl, v1) = v0) | ~ $i(v1) | % 20.40/3.46 ~ aNaturalNumber0(v1))) % 20.40/3.46 % 20.40/3.46 (m__1240) % 20.40/3.46 $i(xn) & $i(xm) & $i(xl) & aNaturalNumber0(xn) & aNaturalNumber0(xm) & % 20.40/3.46 aNaturalNumber0(xl) % 20.40/3.46 % 20.40/3.46 (m__1240_04) % 20.40/3.47 $i(xn) & $i(xm) & $i(xl) & ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xl, v1) = xm % 20.40/3.47 & sdtasdt0(xl, v0) = xn & $i(v1) & $i(v0) & doDivides0(xl, xn) & % 20.40/3.47 doDivides0(xl, xm) & aNaturalNumber0(v1) & aNaturalNumber0(v0)) % 20.40/3.47 % 20.40/3.47 (function-axioms) % 20.40/3.47 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 20.40/3.47 (sdtsldt0(v3, v2) = v1) | ~ (sdtsldt0(v3, v2) = v0)) & ! [v0: $i] : ! % 20.40/3.47 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtmndt0(v3, v2) = v1) | % 20.40/3.47 ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 20.40/3.47 [v3: $i] : (v1 = v0 | ~ (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) % 20.40/3.47 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 20.40/3.47 (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 20.40/3.47 % 20.40/3.47 Further assumptions not needed in the proof: % 20.40/3.47 -------------------------------------------- % 20.40/3.47 mAddAsso, mAddCanc, mDefDiff, mDefDiv, mDefLE, mDefQuot, mDivTrans, mIH, mIH_03, % 20.40/3.47 mLEAsym, mLENTr, mLERefl, mLETotal, mLETran, mMonAdd, mMonMul, mMonMul2, % 20.40/3.47 mMulAsso, mMulCanc, mMulComm, mNatSort, mSortsB_02, mSortsC, mSortsC_01, % 20.40/3.47 mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero, m__1298 % 20.40/3.47 % 20.40/3.47 Those formulas are unsatisfiable: % 20.40/3.47 --------------------------------- % 20.40/3.47 % 20.40/3.47 Begin of proof % 20.40/3.47 | % 20.40/3.47 | ALPHA: (m__1240) implies: % 20.40/3.47 | (1) aNaturalNumber0(xl) % 20.40/3.47 | (2) aNaturalNumber0(xm) % 20.40/3.47 | (3) aNaturalNumber0(xn) % 20.40/3.47 | % 20.40/3.47 | ALPHA: (m__1240_04) implies: % 20.40/3.47 | (4) ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xl, v1) = xm & sdtasdt0(xl, v0) = % 20.40/3.47 | xn & $i(v1) & $i(v0) & doDivides0(xl, xn) & doDivides0(xl, xm) & % 20.40/3.47 | aNaturalNumber0(v1) & aNaturalNumber0(v0)) % 20.40/3.47 | % 20.40/3.47 | ALPHA: (m__) implies: % 20.40/3.47 | (5) $i(xl) % 20.40/3.47 | (6) $i(xm) % 20.40/3.47 | (7) $i(xn) % 20.40/3.47 | (8) ? [v0: $i] : (sdtpldt0(xm, xn) = v0 & $i(v0) & ~ doDivides0(xl, v0) & % 20.40/3.47 | ! [v1: $i] : ( ~ (sdtasdt0(xl, v1) = v0) | ~ $i(v1) | ~ % 20.40/3.47 | aNaturalNumber0(v1))) % 20.40/3.47 | % 20.40/3.47 | ALPHA: (function-axioms) implies: % 20.40/3.47 | (9) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 20.40/3.47 | (sdtpldt0(v3, v2) = v1) | ~ (sdtpldt0(v3, v2) = v0)) % 20.40/3.47 | % 20.40/3.47 | DELTA: instantiating (8) with fresh symbol all_32_0 gives: % 20.40/3.48 | (10) sdtpldt0(xm, xn) = all_32_0 & $i(all_32_0) & ~ doDivides0(xl, % 20.40/3.48 | all_32_0) & ! [v0: $i] : ( ~ (sdtasdt0(xl, v0) = all_32_0) | ~ % 20.40/3.48 | $i(v0) | ~ aNaturalNumber0(v0)) % 20.40/3.48 | % 20.40/3.48 | ALPHA: (10) implies: % 20.40/3.48 | (11) sdtpldt0(xm, xn) = all_32_0 % 20.40/3.48 | (12) ! [v0: $i] : ( ~ (sdtasdt0(xl, v0) = all_32_0) | ~ $i(v0) | ~ % 20.40/3.48 | aNaturalNumber0(v0)) % 20.40/3.48 | % 20.40/3.48 | DELTA: instantiating (4) with fresh symbols all_35_0, all_35_1 gives: % 20.40/3.48 | (13) sdtasdt0(xl, all_35_0) = xm & sdtasdt0(xl, all_35_1) = xn & % 20.40/3.48 | $i(all_35_0) & $i(all_35_1) & doDivides0(xl, xn) & doDivides0(xl, xm) % 20.40/3.48 | & aNaturalNumber0(all_35_0) & aNaturalNumber0(all_35_1) % 20.40/3.48 | % 20.40/3.48 | ALPHA: (13) implies: % 20.40/3.48 | (14) aNaturalNumber0(all_35_1) % 20.40/3.48 | (15) aNaturalNumber0(all_35_0) % 20.40/3.48 | (16) $i(all_35_1) % 20.40/3.48 | (17) $i(all_35_0) % 20.40/3.48 | (18) sdtasdt0(xl, all_35_1) = xn % 20.40/3.48 | (19) sdtasdt0(xl, all_35_0) = xm % 20.40/3.48 | % 20.40/3.48 | GROUND_INST: instantiating (mAddComm) with xm, xn, all_32_0, simplifying with % 20.40/3.48 | (2), (3), (6), (7), (11) gives: % 20.40/3.48 | (20) sdtpldt0(xn, xm) = all_32_0 & $i(all_32_0) % 20.40/3.48 | % 20.40/3.48 | ALPHA: (20) implies: % 20.40/3.48 | (21) sdtpldt0(xn, xm) = all_32_0 % 20.40/3.48 | % 20.40/3.48 | GROUND_INST: instantiating (mAMDistr) with xl, all_35_0, all_35_1, xm, xn, % 20.40/3.48 | all_32_0, simplifying with (1), (5), (11), (14), (15), (16), % 20.40/3.48 | (17), (18), (19) gives: % 20.40/3.48 | (22) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (sdtasdt0(v0, % 20.40/3.48 | xl) = v1 & sdtasdt0(all_35_0, xl) = v2 & sdtasdt0(all_35_1, xl) = % 20.40/3.48 | v3 & sdtasdt0(xl, v0) = all_32_0 & sdtpldt0(v2, v3) = v1 & % 20.40/3.48 | sdtpldt0(all_35_0, all_35_1) = v0 & $i(v3) & $i(v2) & $i(v1) & % 20.40/3.48 | $i(v0) & $i(all_32_0)) % 20.40/3.48 | % 20.40/3.48 | DELTA: instantiating (22) with fresh symbols all_48_0, all_48_1, all_48_2, % 20.40/3.48 | all_48_3 gives: % 20.40/3.48 | (23) sdtasdt0(all_48_3, xl) = all_48_2 & sdtasdt0(all_35_0, xl) = all_48_1 % 20.40/3.48 | & sdtasdt0(all_35_1, xl) = all_48_0 & sdtasdt0(xl, all_48_3) = % 20.40/3.48 | all_32_0 & sdtpldt0(all_48_1, all_48_0) = all_48_2 & % 20.40/3.48 | sdtpldt0(all_35_0, all_35_1) = all_48_3 & $i(all_48_0) & $i(all_48_1) % 20.40/3.48 | & $i(all_48_2) & $i(all_48_3) & $i(all_32_0) % 20.40/3.48 | % 20.40/3.48 | ALPHA: (23) implies: % 20.40/3.48 | (24) sdtpldt0(all_35_0, all_35_1) = all_48_3 % 20.40/3.48 | % 20.40/3.48 | GROUND_INST: instantiating (mAMDistr) with xl, all_35_1, all_35_0, xn, xm, % 20.40/3.48 | all_32_0, simplifying with (1), (5), (14), (15), (16), (17), % 20.40/3.48 | (18), (19), (21) gives: % 20.40/3.49 | (25) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (sdtasdt0(v0, % 20.40/3.49 | xl) = v1 & sdtasdt0(all_35_0, xl) = v3 & sdtasdt0(all_35_1, xl) = % 20.40/3.49 | v2 & sdtasdt0(xl, v0) = all_32_0 & sdtpldt0(v2, v3) = v1 & % 20.40/3.49 | sdtpldt0(all_35_1, all_35_0) = v0 & $i(v3) & $i(v2) & $i(v1) & % 20.40/3.49 | $i(v0) & $i(all_32_0)) % 20.40/3.49 | % 20.40/3.49 | GROUND_INST: instantiating (mSortsB) with all_35_0, all_35_1, all_48_3, % 20.40/3.49 | simplifying with (14), (15), (16), (17), (24) gives: % 20.40/3.49 | (26) aNaturalNumber0(all_48_3) % 20.40/3.49 | % 20.40/3.49 | GROUND_INST: instantiating (mAddComm) with all_35_0, all_35_1, all_48_3, % 20.40/3.49 | simplifying with (14), (15), (16), (17), (24) gives: % 20.40/3.49 | (27) sdtpldt0(all_35_1, all_35_0) = all_48_3 & $i(all_48_3) % 20.40/3.49 | % 20.40/3.49 | ALPHA: (27) implies: % 20.40/3.49 | (28) sdtpldt0(all_35_1, all_35_0) = all_48_3 % 20.40/3.49 | % 20.40/3.49 | DELTA: instantiating (25) with fresh symbols all_88_0, all_88_1, all_88_2, % 20.40/3.49 | all_88_3 gives: % 20.40/3.49 | (29) sdtasdt0(all_88_3, xl) = all_88_2 & sdtasdt0(all_35_0, xl) = all_88_0 % 20.40/3.49 | & sdtasdt0(all_35_1, xl) = all_88_1 & sdtasdt0(xl, all_88_3) = % 20.40/3.49 | all_32_0 & sdtpldt0(all_88_1, all_88_0) = all_88_2 & % 20.40/3.49 | sdtpldt0(all_35_1, all_35_0) = all_88_3 & $i(all_88_0) & $i(all_88_1) % 20.40/3.49 | & $i(all_88_2) & $i(all_88_3) & $i(all_32_0) % 20.40/3.49 | % 20.40/3.49 | ALPHA: (29) implies: % 20.40/3.49 | (30) $i(all_88_3) % 20.40/3.49 | (31) sdtpldt0(all_35_1, all_35_0) = all_88_3 % 20.40/3.49 | (32) sdtasdt0(xl, all_88_3) = all_32_0 % 20.40/3.49 | % 20.40/3.49 | GROUND_INST: instantiating (9) with all_48_3, all_88_3, all_35_0, all_35_1, % 20.40/3.49 | simplifying with (28), (31) gives: % 20.40/3.49 | (33) all_88_3 = all_48_3 % 20.40/3.49 | % 20.40/3.49 | REDUCE: (32), (33) imply: % 20.40/3.49 | (34) sdtasdt0(xl, all_48_3) = all_32_0 % 20.40/3.49 | % 20.40/3.49 | REDUCE: (30), (33) imply: % 20.40/3.49 | (35) $i(all_48_3) % 20.40/3.49 | % 20.40/3.49 | GROUND_INST: instantiating (12) with all_48_3, simplifying with (26), (34), % 20.40/3.49 | (35) gives: % 20.40/3.49 | (36) $false % 20.40/3.49 | % 20.40/3.49 | CLOSE: (36) is inconsistent. % 20.40/3.49 | % 20.40/3.49 End of proof % 20.40/3.49 % SZS output end Proof for theBenchmark % 20.40/3.49 % 20.40/3.49 2886ms %------------------------------------------------------------------------------