%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM464+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 : 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:55 EDT 2023 % Result : Theorem 7.78s 2.00s % Output : Proof 10.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NUM464+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n013.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Fri Aug 25 08:55:32 EDT 2023 % 0.14/0.36 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.57/1.14 Prover 1: Preprocessing ... % 2.96/1.15 Prover 4: Preprocessing ... % 3.06/1.18 Prover 0: Preprocessing ... % 3.06/1.18 Prover 3: Preprocessing ... % 3.06/1.18 Prover 6: Preprocessing ... % 3.06/1.18 Prover 5: Preprocessing ... % 3.06/1.18 Prover 2: Preprocessing ... % 6.99/1.82 Prover 3: Constructing countermodel ... % 6.99/1.83 Prover 1: Constructing countermodel ... % 6.99/1.83 Prover 6: Proving ... % 6.99/1.85 Prover 5: Constructing countermodel ... % 7.78/2.00 Prover 3: proved (1340ms) % 7.78/2.00 % 7.78/2.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.78/2.00 % 7.78/2.00 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.78/2.00 Prover 2: Proving ... % 7.78/2.00 Prover 2: stopped % 7.78/2.01 Prover 5: stopped % 8.39/2.02 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.39/2.02 Prover 6: stopped % 8.39/2.04 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.39/2.04 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.39/2.05 Prover 4: Constructing countermodel ... % 8.90/2.13 Prover 7: Preprocessing ... % 8.90/2.14 Prover 8: Preprocessing ... % 8.90/2.15 Prover 10: Preprocessing ... % 8.90/2.16 Prover 11: Preprocessing ... % 8.90/2.20 Prover 1: Found proof (size 40) % 8.90/2.20 Prover 1: proved (1560ms) % 8.90/2.20 Prover 4: stopped % 8.90/2.23 Prover 7: stopped % 8.90/2.23 Prover 0: Proving ... % 8.90/2.23 Prover 0: stopped % 8.90/2.24 Prover 10: stopped % 8.90/2.28 Prover 11: stopped % 8.90/2.29 Prover 8: Warning: ignoring some quantifiers % 8.90/2.30 Prover 8: Constructing countermodel ... % 8.90/2.31 Prover 8: stopped % 8.90/2.31 % 8.90/2.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.90/2.31 % 8.90/2.31 % SZS output start Proof for theBenchmark % 8.90/2.31 Assumptions after simplification: % 8.90/2.31 --------------------------------- % 9.83/2.31 % 9.83/2.31 (mLENTr) % 10.28/2.34 $i(sz10) & $i(sz00) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | v0 = sz10 | v0 = % 10.28/2.34 sz00 | ~ (sdtlseqdt0(sz10, v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = % 10.28/2.34 0) & aNaturalNumber0(v0) = v2)) % 10.28/2.34 % 10.28/2.34 (mLETotal) % 10.28/2.34 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (sdtlseqdt0(v0, v1) = % 10.28/2.34 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] : % 10.28/2.34 (sdtlseqdt0(v1, v0) = v5 & aNaturalNumber0(v1) = v4 & aNaturalNumber0(v0) = % 10.28/2.34 v3 & ( ~ (v4 = 0) | ~ (v3 = 0) | (v5 = 0 & ~ (v1 = v0))))) % 10.28/2.34 % 10.28/2.34 (mSortsC_01) % 10.28/2.34 ~ (sz10 = sz00) & aNaturalNumber0(sz10) = 0 & $i(sz10) & $i(sz00) % 10.28/2.34 % 10.28/2.34 (m__) % 10.28/2.34 $i(xm) & $i(sz10) & $i(sz00) & ? [v0: int] : ( ~ (v0 = 0) & ~ (xm = sz00) & % 10.28/2.35 sdtlseqdt0(sz10, xm) = v0) % 10.28/2.35 % 10.28/2.35 (m__987) % 10.28/2.35 aNaturalNumber0(xn) = 0 & aNaturalNumber0(xm) = 0 & $i(xn) & $i(xm) % 10.28/2.35 % 10.28/2.35 (function-axioms) % 10.39/2.35 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.39/2.35 (sdtmndt0(v3, v2) = v1) | ~ (sdtmndt0(v3, v2) = v0)) & ! [v0: % 10.39/2.35 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 10.39/2.35 : (v1 = v0 | ~ (sdtlseqdt0(v3, v2) = v1) | ~ (sdtlseqdt0(v3, v2) = v0)) & ! % 10.39/2.35 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.39/2.35 (sdtasdt0(v3, v2) = v1) | ~ (sdtasdt0(v3, v2) = v0)) & ! [v0: $i] : ! % 10.39/2.35 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (sdtpldt0(v3, v2) = v1) | % 10.39/2.35 ~ (sdtpldt0(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.39/2.35 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (aNaturalNumber0(v2) = v1) % 10.39/2.35 | ~ (aNaturalNumber0(v2) = v0)) % 10.39/2.35 % 10.39/2.35 Further assumptions not needed in the proof: % 10.39/2.35 -------------------------------------------- % 10.39/2.35 mAMDistr, mAddAsso, mAddCanc, mAddComm, mDefDiff, mDefLE, mLEAsym, mLERefl, % 10.39/2.35 mLETran, mMonAdd, mMonMul, mMulAsso, mMulCanc, mMulComm, mNatSort, mSortsB, % 10.39/2.35 mSortsB_02, mSortsC, mZeroAdd, mZeroMul, m_AddZero, m_MulUnit, m_MulZero % 10.39/2.35 % 10.39/2.35 Those formulas are unsatisfiable: % 10.39/2.35 --------------------------------- % 10.39/2.35 % 10.39/2.35 Begin of proof % 10.39/2.35 | % 10.39/2.35 | ALPHA: (mSortsC_01) implies: % 10.39/2.35 | (1) aNaturalNumber0(sz10) = 0 % 10.39/2.35 | % 10.39/2.35 | ALPHA: (mLENTr) implies: % 10.39/2.35 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | v0 = sz10 | v0 = sz00 | ~ % 10.39/2.35 | (sdtlseqdt0(sz10, v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) % 10.39/2.35 | & aNaturalNumber0(v0) = v2)) % 10.39/2.35 | % 10.39/2.35 | ALPHA: (m__987) implies: % 10.39/2.35 | (3) aNaturalNumber0(xm) = 0 % 10.39/2.35 | % 10.39/2.35 | ALPHA: (m__) implies: % 10.39/2.36 | (4) $i(sz10) % 10.39/2.36 | (5) $i(xm) % 10.39/2.36 | (6) ? [v0: int] : ( ~ (v0 = 0) & ~ (xm = sz00) & sdtlseqdt0(sz10, xm) = % 10.39/2.36 | v0) % 10.39/2.36 | % 10.39/2.36 | ALPHA: (function-axioms) implies: % 10.39/2.36 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 10.39/2.36 | (v1 = v0 | ~ (aNaturalNumber0(v2) = v1) | ~ (aNaturalNumber0(v2) = % 10.39/2.36 | v0)) % 10.39/2.36 | % 10.39/2.36 | DELTA: instantiating (6) with fresh symbol all_27_0 gives: % 10.39/2.36 | (8) ~ (all_27_0 = 0) & ~ (xm = sz00) & sdtlseqdt0(sz10, xm) = all_27_0 % 10.39/2.36 | % 10.39/2.36 | ALPHA: (8) implies: % 10.39/2.36 | (9) ~ (xm = sz00) % 10.39/2.36 | (10) ~ (all_27_0 = 0) % 10.39/2.36 | (11) sdtlseqdt0(sz10, xm) = all_27_0 % 10.39/2.36 | % 10.39/2.36 | GROUND_INST: instantiating (2) with xm, all_27_0, simplifying with (5), (11) % 10.39/2.36 | gives: % 10.39/2.36 | (12) all_27_0 = 0 | xm = sz10 | xm = sz00 | ? [v0: int] : ( ~ (v0 = 0) & % 10.39/2.36 | aNaturalNumber0(xm) = v0) % 10.39/2.36 | % 10.39/2.36 | GROUND_INST: instantiating (mLETotal) with sz10, xm, all_27_0, simplifying % 10.39/2.36 | with (4), (5), (11) gives: % 10.39/2.36 | (13) all_27_0 = 0 | ? [v0: any] : ? [v1: any] : ? [v2: any] : % 10.39/2.36 | (sdtlseqdt0(xm, sz10) = v2 & aNaturalNumber0(xm) = v1 & % 10.39/2.36 | aNaturalNumber0(sz10) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0) | (v2 = 0 & % 10.39/2.36 | ~ (xm = sz10)))) % 10.39/2.36 | % 10.39/2.36 | BETA: splitting (13) gives: % 10.39/2.36 | % 10.39/2.36 | Case 1: % 10.39/2.36 | | % 10.39/2.36 | | (14) all_27_0 = 0 % 10.39/2.36 | | % 10.39/2.36 | | REDUCE: (10), (14) imply: % 10.39/2.36 | | (15) $false % 10.39/2.36 | | % 10.39/2.36 | | CLOSE: (15) is inconsistent. % 10.39/2.36 | | % 10.39/2.36 | Case 2: % 10.39/2.36 | | % 10.39/2.36 | | (16) ? [v0: any] : ? [v1: any] : ? [v2: any] : (sdtlseqdt0(xm, sz10) = % 10.39/2.36 | | v2 & aNaturalNumber0(xm) = v1 & aNaturalNumber0(sz10) = v0 & ( ~ % 10.39/2.36 | | (v1 = 0) | ~ (v0 = 0) | (v2 = 0 & ~ (xm = sz10)))) % 10.39/2.37 | | % 10.39/2.37 | | DELTA: instantiating (16) with fresh symbols all_49_0, all_49_1, all_49_2 % 10.39/2.37 | | gives: % 10.39/2.37 | | (17) sdtlseqdt0(xm, sz10) = all_49_0 & aNaturalNumber0(xm) = all_49_1 & % 10.39/2.37 | | aNaturalNumber0(sz10) = all_49_2 & ( ~ (all_49_1 = 0) | ~ (all_49_2 % 10.39/2.37 | | = 0) | (all_49_0 = 0 & ~ (xm = sz10))) % 10.39/2.37 | | % 10.39/2.37 | | ALPHA: (17) implies: % 10.39/2.37 | | (18) aNaturalNumber0(sz10) = all_49_2 % 10.39/2.37 | | (19) aNaturalNumber0(xm) = all_49_1 % 10.39/2.37 | | (20) ~ (all_49_1 = 0) | ~ (all_49_2 = 0) | (all_49_0 = 0 & ~ (xm = % 10.39/2.37 | | sz10)) % 10.39/2.37 | | % 10.39/2.37 | | GROUND_INST: instantiating (7) with 0, all_49_2, sz10, simplifying with (1), % 10.39/2.37 | | (18) gives: % 10.39/2.37 | | (21) all_49_2 = 0 % 10.39/2.37 | | % 10.39/2.37 | | GROUND_INST: instantiating (7) with 0, all_49_1, xm, simplifying with (3), % 10.39/2.37 | | (19) gives: % 10.39/2.37 | | (22) all_49_1 = 0 % 10.39/2.37 | | % 10.39/2.37 | | BETA: splitting (20) gives: % 10.39/2.37 | | % 10.39/2.37 | | Case 1: % 10.39/2.37 | | | % 10.39/2.37 | | | (23) ~ (all_49_1 = 0) % 10.39/2.37 | | | % 10.39/2.37 | | | REDUCE: (22), (23) imply: % 10.39/2.37 | | | (24) $false % 10.39/2.37 | | | % 10.39/2.37 | | | CLOSE: (24) is inconsistent. % 10.39/2.37 | | | % 10.39/2.37 | | Case 2: % 10.39/2.37 | | | % 10.39/2.37 | | | (25) ~ (all_49_2 = 0) | (all_49_0 = 0 & ~ (xm = sz10)) % 10.39/2.37 | | | % 10.39/2.37 | | | BETA: splitting (25) gives: % 10.39/2.37 | | | % 10.39/2.37 | | | Case 1: % 10.39/2.37 | | | | % 10.39/2.37 | | | | (26) ~ (all_49_2 = 0) % 10.39/2.37 | | | | % 10.39/2.37 | | | | REDUCE: (21), (26) imply: % 10.39/2.37 | | | | (27) $false % 10.39/2.37 | | | | % 10.39/2.37 | | | | CLOSE: (27) is inconsistent. % 10.39/2.37 | | | | % 10.39/2.37 | | | Case 2: % 10.39/2.37 | | | | % 10.39/2.37 | | | | (28) all_49_0 = 0 & ~ (xm = sz10) % 10.39/2.37 | | | | % 10.39/2.37 | | | | ALPHA: (28) implies: % 10.39/2.37 | | | | (29) ~ (xm = sz10) % 10.39/2.37 | | | | % 10.39/2.37 | | | | BETA: splitting (12) gives: % 10.39/2.37 | | | | % 10.39/2.37 | | | | Case 1: % 10.39/2.37 | | | | | % 10.39/2.37 | | | | | (30) xm = sz00 % 10.39/2.37 | | | | | % 10.39/2.37 | | | | | REDUCE: (9), (30) imply: % 10.39/2.37 | | | | | (31) $false % 10.39/2.37 | | | | | % 10.39/2.37 | | | | | CLOSE: (31) is inconsistent. % 10.39/2.37 | | | | | % 10.39/2.37 | | | | Case 2: % 10.39/2.37 | | | | | % 10.39/2.37 | | | | | (32) all_27_0 = 0 | xm = sz10 | ? [v0: int] : ( ~ (v0 = 0) & % 10.39/2.37 | | | | | aNaturalNumber0(xm) = v0) % 10.39/2.37 | | | | | % 10.39/2.37 | | | | | BETA: splitting (32) gives: % 10.39/2.37 | | | | | % 10.39/2.37 | | | | | Case 1: % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | | (33) all_27_0 = 0 % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | | REDUCE: (10), (33) imply: % 10.39/2.37 | | | | | | (34) $false % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | | CLOSE: (34) is inconsistent. % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | Case 2: % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | | (35) xm = sz10 | ? [v0: int] : ( ~ (v0 = 0) & % 10.39/2.37 | | | | | | aNaturalNumber0(xm) = v0) % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | | BETA: splitting (35) gives: % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | | Case 1: % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | (36) xm = sz10 % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | REDUCE: (29), (36) imply: % 10.39/2.37 | | | | | | | (37) $false % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | CLOSE: (37) is inconsistent. % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | Case 2: % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | (38) ? [v0: int] : ( ~ (v0 = 0) & aNaturalNumber0(xm) = v0) % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | DELTA: instantiating (38) with fresh symbol all_80_0 gives: % 10.39/2.37 | | | | | | | (39) ~ (all_80_0 = 0) & aNaturalNumber0(xm) = all_80_0 % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | ALPHA: (39) implies: % 10.39/2.37 | | | | | | | (40) ~ (all_80_0 = 0) % 10.39/2.37 | | | | | | | (41) aNaturalNumber0(xm) = all_80_0 % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | GROUND_INST: instantiating (7) with 0, all_80_0, xm, simplifying % 10.39/2.37 | | | | | | | with (3), (41) gives: % 10.39/2.37 | | | | | | | (42) all_80_0 = 0 % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | REDUCE: (40), (42) imply: % 10.39/2.37 | | | | | | | (43) $false % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | | CLOSE: (43) is inconsistent. % 10.39/2.37 | | | | | | | % 10.39/2.37 | | | | | | End of split % 10.39/2.37 | | | | | | % 10.39/2.37 | | | | | End of split % 10.39/2.37 | | | | | % 10.39/2.37 | | | | End of split % 10.39/2.37 | | | | % 10.39/2.37 | | | End of split % 10.39/2.37 | | | % 10.39/2.37 | | End of split % 10.39/2.37 | | % 10.39/2.37 | End of split % 10.39/2.37 | % 10.39/2.37 End of proof % 10.39/2.37 % SZS output end Proof for theBenchmark % 10.39/2.38 % 10.39/2.38 1758ms %------------------------------------------------------------------------------