%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI672_1 : TPTP v8.1.2. Released v6.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n027.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 : Wed Aug 30 17:48:45 EDT 2023 % Result : Theorem 3.67s 1.36s % Output : Proof 4.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : ARI672_1 : TPTP v8.1.2. Released v6.3.0. % 0.13/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n027.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 : Tue Aug 29 18:41:38 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.58 ________ _____ % 0.20/0.58 ___ __ \_________(_)________________________________ % 0.20/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.58 % 0.20/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.58 (2023-06-19) % 0.20/0.58 % 0.20/0.58 (c) Philipp Rümmer, 2009-2023 % 0.20/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.58 Amanda Stjerna. % 0.20/0.58 Free software under BSD-3-Clause. % 0.20/0.58 % 0.20/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.58 % 0.20/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.59 Running up to 7 provers in parallel. % 0.20/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.05/1.12 Prover 0: Preprocessing ... % 2.05/1.12 Prover 4: Preprocessing ... % 2.05/1.12 Prover 1: Preprocessing ... % 2.05/1.12 Prover 2: Preprocessing ... % 2.05/1.12 Prover 5: Preprocessing ... % 2.05/1.12 Prover 3: Preprocessing ... % 2.05/1.12 Prover 6: Preprocessing ... % 2.78/1.19 Prover 2: Constructing countermodel ... % 2.78/1.19 Prover 4: Constructing countermodel ... % 2.78/1.19 Prover 3: Constructing countermodel ... % 2.78/1.19 Prover 0: Constructing countermodel ... % 2.78/1.19 Prover 6: Constructing countermodel ... % 2.78/1.19 Prover 1: Constructing countermodel ... % 2.78/1.19 Prover 5: Constructing countermodel ... % 3.67/1.36 Prover 5: proved (754ms) % 3.67/1.36 % 3.67/1.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.67/1.36 % 3.67/1.36 Prover 6: stopped % 3.67/1.36 Prover 2: stopped % 3.67/1.36 Prover 0: stopped % 3.67/1.36 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.67/1.36 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.67/1.36 Prover 3: stopped % 3.67/1.36 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.67/1.36 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.67/1.36 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.91/1.38 Prover 11: Preprocessing ... % 3.91/1.38 Prover 10: Preprocessing ... % 3.91/1.38 Prover 7: Preprocessing ... % 3.91/1.38 Prover 13: Preprocessing ... % 3.91/1.38 Prover 8: Preprocessing ... % 3.91/1.39 Prover 7: Constructing countermodel ... % 3.91/1.39 Prover 11: Constructing countermodel ... % 4.07/1.39 Prover 13: Constructing countermodel ... % 4.07/1.40 Prover 8: Constructing countermodel ... % 4.07/1.40 Prover 10: Constructing countermodel ... % 4.30/1.44 Prover 1: Found proof (size 61) % 4.30/1.44 Prover 1: proved (841ms) % 4.30/1.44 Prover 11: stopped % 4.30/1.44 Prover 10: stopped % 4.30/1.44 Prover 8: stopped % 4.30/1.44 Prover 7: stopped % 4.30/1.44 Prover 4: Found proof (size 61) % 4.30/1.44 Prover 4: proved (840ms) % 4.30/1.45 Prover 13: stopped % 4.30/1.45 % 4.30/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.30/1.45 % 4.30/1.46 % SZS output start Proof for theBenchmark % 4.30/1.46 Assumptions after simplification: % 4.30/1.46 --------------------------------- % 4.30/1.46 % 4.30/1.46 (conj) % 4.30/1.47 ? [v0: int] : ($product(a, b) = v0 & ((v0 = 1 & ( ~ (b = a) | ( ~ (a = 1) & % 4.30/1.47 ~ (a = -1)))) | (b = a & ~ (v0 = 1) & (a = 1 | a = -1)))) % 4.30/1.47 % 4.30/1.47 Those formulas are unsatisfiable: % 4.30/1.47 --------------------------------- % 4.30/1.47 % 4.30/1.47 Begin of proof % 4.30/1.47 | % 4.30/1.47 | DELTA: instantiating (conj) with fresh symbol all_2_0 gives: % 4.30/1.47 | (1) $product(a, b) = all_2_0 & ((all_2_0 = 1 & ( ~ (b = a) | ( ~ (a = 1) & % 4.30/1.47 | ~ (a = -1)))) | (b = a & ~ (all_2_0 = 1) & (a = 1 | a = -1))) % 4.30/1.47 | % 4.30/1.47 | ALPHA: (1) implies: % 4.30/1.47 | (2) $product(a, b) = all_2_0 % 4.30/1.48 | (3) (all_2_0 = 1 & ( ~ (b = a) | ( ~ (a = 1) & ~ (a = -1)))) | (b = a & ~ % 4.30/1.48 | (all_2_0 = 1) & (a = 1 | a = -1)) % 4.30/1.48 | % 4.30/1.48 | BETA: splitting (3) gives: % 4.30/1.48 | % 4.30/1.48 | Case 1: % 4.30/1.48 | | % 4.30/1.48 | | (4) all_2_0 = 1 & ( ~ (b = a) | ( ~ (a = 1) & ~ (a = -1))) % 4.30/1.48 | | % 4.30/1.48 | | ALPHA: (4) implies: % 4.30/1.48 | | (5) all_2_0 = 1 % 4.30/1.48 | | (6) ~ (b = a) | ( ~ (a = 1) & ~ (a = -1)) % 4.30/1.48 | | % 4.30/1.48 | | REDUCE: (2), (5) imply: % 4.30/1.48 | | (7) $product(a, b) = 1 % 4.30/1.48 | | % 4.30/1.48 | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.48 | | (8) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, -2)) | ~ % 4.30/1.48 | | ($product(v0, v1) = 1)) % 4.30/1.48 | | % 4.30/1.48 | | GROUND_INST: instantiating (8) with a, b, simplifying with (7) gives: % 4.30/1.48 | | (9) $lesseq(-1, b) % 4.30/1.48 | | % 4.30/1.48 | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.48 | | (10) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(2, v1)) | ~ % 4.30/1.48 | | ($product(v0, v1) = 1)) % 4.30/1.48 | | % 4.30/1.48 | | GROUND_INST: instantiating (10) with a, b, simplifying with (7) gives: % 4.30/1.48 | | (11) $lesseq(b, 1) % 4.30/1.48 | | % 4.30/1.48 | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.48 | | (12) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v0, -2)) | ~ % 4.30/1.48 | | ($product(v0, v1) = 1)) % 4.30/1.48 | | % 4.30/1.48 | | GROUND_INST: instantiating (12) with a, b, simplifying with (7) gives: % 4.30/1.48 | | (13) $lesseq(-1, a) % 4.30/1.48 | | % 4.30/1.48 | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.49 | | (14) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(2, v0)) | ~ % 4.30/1.49 | | ($product(v0, v1) = 1)) % 4.30/1.49 | | % 4.30/1.49 | | GROUND_INST: instantiating (14) with a, b, simplifying with (7) gives: % 4.30/1.49 | | (15) $lesseq(a, 1) % 4.30/1.49 | | % 4.30/1.49 | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.49 | | (16) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 1)) | ~ ($lesseq(1, % 4.30/1.49 | | $difference(v1, v0))) | ~ ($lesseq(-1, v0)) | ~ % 4.30/1.49 | | ($product(v0, v1) = 1)) % 4.30/1.49 | | % 4.30/1.49 | | GROUND_INST: instantiating (16) with a, b, simplifying with (7) gives: % 4.30/1.49 | | (17) ~ ($lesseq(b, 1)) | ~ ($lesseq(1, $difference(b, a))) | ~ % 4.30/1.49 | | ($lesseq(-1, a)) % 4.30/1.49 | | % 4.30/1.49 | | BETA: splitting (17) gives: % 4.30/1.49 | | % 4.30/1.49 | | Case 1: % 4.30/1.49 | | | % 4.30/1.49 | | | (18) $lesseq(2, b) % 4.30/1.49 | | | % 4.30/1.49 | | | COMBINE_INEQS: (11), (18) imply: % 4.30/1.49 | | | (19) $false % 4.30/1.49 | | | % 4.30/1.49 | | | CLOSE: (19) is inconsistent. % 4.30/1.49 | | | % 4.30/1.49 | | Case 2: % 4.30/1.49 | | | % 4.30/1.49 | | | (20) ~ ($lesseq(1, $difference(b, a))) | ~ ($lesseq(-1, a)) % 4.30/1.49 | | | % 4.30/1.49 | | | BETA: splitting (20) gives: % 4.30/1.49 | | | % 4.30/1.49 | | | Case 1: % 4.30/1.49 | | | | % 4.30/1.49 | | | | (21) $lesseq(a, -2) % 4.30/1.49 | | | | % 4.30/1.49 | | | | COMBINE_INEQS: (13), (21) imply: % 4.30/1.49 | | | | (22) $false % 4.30/1.49 | | | | % 4.30/1.49 | | | | CLOSE: (22) is inconsistent. % 4.30/1.49 | | | | % 4.30/1.49 | | | Case 2: % 4.30/1.49 | | | | % 4.30/1.49 | | | | (23) $lesseq(b, a) % 4.30/1.49 | | | | % 4.30/1.49 | | | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.49 | | | | (24) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(1, $difference(v0, % 4.30/1.49 | | | | v1))) | ~ ($lesseq(-1, v1)) | ~ ($lesseq(v0, 1)) | ~ % 4.30/1.49 | | | | ($product(v0, v1) = 1)) % 4.30/1.49 | | | | % 4.30/1.49 | | | | GROUND_INST: instantiating (24) with a, b, simplifying with (7) gives: % 4.30/1.49 | | | | (25) ~ ($lesseq(1, $difference(a, b))) | ~ ($lesseq(-1, b)) | ~ % 4.30/1.49 | | | | ($lesseq(a, 1)) % 4.30/1.49 | | | | % 4.30/1.49 | | | | BETA: splitting (25) gives: % 4.30/1.49 | | | | % 4.30/1.49 | | | | Case 1: % 4.30/1.49 | | | | | % 4.30/1.49 | | | | | (26) $lesseq(b, -2) % 4.30/1.49 | | | | | % 4.30/1.49 | | | | | COMBINE_INEQS: (9), (26) imply: % 4.30/1.49 | | | | | (27) $false % 4.30/1.49 | | | | | % 4.30/1.49 | | | | | CLOSE: (27) is inconsistent. % 4.30/1.49 | | | | | % 4.30/1.49 | | | | Case 2: % 4.30/1.49 | | | | | % 4.30/1.49 | | | | | (28) ~ ($lesseq(1, $difference(a, b))) | ~ ($lesseq(a, 1)) % 4.30/1.49 | | | | | % 4.30/1.49 | | | | | BETA: splitting (28) gives: % 4.30/1.49 | | | | | % 4.30/1.49 | | | | | Case 1: % 4.30/1.49 | | | | | | % 4.30/1.49 | | | | | | (29) $lesseq(2, a) % 4.30/1.49 | | | | | | % 4.30/1.49 | | | | | | COMBINE_INEQS: (15), (29) imply: % 4.30/1.49 | | | | | | (30) $false % 4.30/1.49 | | | | | | % 4.30/1.49 | | | | | | CLOSE: (30) is inconsistent. % 4.30/1.49 | | | | | | % 4.30/1.49 | | | | | Case 2: % 4.30/1.49 | | | | | | % 4.30/1.49 | | | | | | (31) $lesseq(a, b) % 4.30/1.49 | | | | | | % 4.30/1.49 | | | | | | ANTI_SYMM: (23), (31) imply: % 4.30/1.50 | | | | | | (32) b = a % 4.30/1.50 | | | | | | % 4.30/1.50 | | | | | | REDUCE: (7), (32) imply: % 4.30/1.50 | | | | | | (33) $product(a, a) = 1 % 4.30/1.50 | | | | | | % 4.30/1.50 | | | | | | BETA: splitting (6) gives: % 4.30/1.50 | | | | | | % 4.30/1.50 | | | | | | Case 1: % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | (34) ~ (b = a) % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | REDUCE: (32), (34) imply: % 4.30/1.50 | | | | | | | (35) $false % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | CLOSE: (35) is inconsistent. % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | Case 2: % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | (36) ~ (a = 1) & ~ (a = -1) % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | ALPHA: (36) implies: % 4.30/1.50 | | | | | | | (37) ~ (a = -1) % 4.30/1.50 | | | | | | | (38) ~ (a = 1) % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | STRENGTHEN: (15), (38) imply: % 4.30/1.50 | | | | | | | (39) $lesseq(a, 0) % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | STRENGTHEN: (13), (37) imply: % 4.30/1.50 | | | | | | | (40) $lesseq(0, a) % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | ANTI_SYMM: (39), (40) imply: % 4.30/1.50 | | | | | | | (41) a = 0 % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | REDUCE: (33), (41) imply: % 4.30/1.50 | | | | | | | (42) $product(0, 0) = 1 % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.50 | | | | | | | (43) ~ ($product(0, 0) = 1) % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | PRED_UNIFY: (42), (43) imply: % 4.30/1.50 | | | | | | | (44) $false % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | | CLOSE: (44) is inconsistent. % 4.30/1.50 | | | | | | | % 4.30/1.50 | | | | | | End of split % 4.30/1.50 | | | | | | % 4.30/1.50 | | | | | End of split % 4.30/1.50 | | | | | % 4.30/1.50 | | | | End of split % 4.30/1.50 | | | | % 4.30/1.50 | | | End of split % 4.30/1.50 | | | % 4.30/1.50 | | End of split % 4.30/1.50 | | % 4.30/1.50 | Case 2: % 4.30/1.50 | | % 4.30/1.50 | | (45) b = a & ~ (all_2_0 = 1) & (a = 1 | a = -1) % 4.30/1.50 | | % 4.30/1.50 | | ALPHA: (45) implies: % 4.30/1.50 | | (46) b = a % 4.30/1.50 | | (47) ~ (all_2_0 = 1) % 4.30/1.50 | | (48) a = 1 | a = -1 % 4.30/1.50 | | % 4.30/1.50 | | REDUCE: (2), (46) imply: % 4.30/1.50 | | (49) $product(a, a) = all_2_0 % 4.30/1.50 | | % 4.30/1.50 | | BETA: splitting (48) gives: % 4.30/1.50 | | % 4.30/1.50 | | Case 1: % 4.30/1.50 | | | % 4.30/1.50 | | | (50) a = 1 % 4.30/1.50 | | | % 4.30/1.50 | | | REDUCE: (49), (50) imply: % 4.30/1.50 | | | (51) $product(1, 1) = all_2_0 % 4.30/1.50 | | | % 4.30/1.50 | | | THEORY_AXIOM GroebnerMultiplication: % 4.30/1.50 | | | (52) ! [v0: int] : (v0 = 1 | ~ ($product(1, 1) = v0)) % 4.30/1.50 | | | % 4.30/1.50 | | | GROUND_INST: instantiating (52) with all_2_0, simplifying with (51) gives: % 4.30/1.50 | | | (53) all_2_0 = 1 % 4.30/1.50 | | | % 4.30/1.50 | | | REDUCE: (47), (53) imply: % 4.30/1.50 | | | (54) $false % 4.30/1.50 | | | % 4.30/1.50 | | | CLOSE: (54) is inconsistent. % 4.30/1.50 | | | % 4.62/1.50 | | Case 2: % 4.62/1.50 | | | % 4.62/1.50 | | | (55) a = -1 % 4.62/1.50 | | | % 4.62/1.50 | | | REDUCE: (49), (55) imply: % 4.62/1.50 | | | (56) $product(-1, -1) = all_2_0 % 4.62/1.50 | | | % 4.62/1.50 | | | THEORY_AXIOM GroebnerMultiplication: % 4.62/1.51 | | | (57) ! [v0: int] : (v0 = 1 | ~ ($product(-1, -1) = v0)) % 4.62/1.51 | | | % 4.62/1.51 | | | GROUND_INST: instantiating (57) with all_2_0, simplifying with (56) gives: % 4.62/1.51 | | | (58) all_2_0 = 1 % 4.62/1.51 | | | % 4.62/1.51 | | | REDUCE: (47), (58) imply: % 4.62/1.51 | | | (59) $false % 4.62/1.51 | | | % 4.62/1.51 | | | CLOSE: (59) is inconsistent. % 4.62/1.51 | | | % 4.62/1.51 | | End of split % 4.62/1.51 | | % 4.62/1.51 | End of split % 4.62/1.51 | % 4.62/1.51 End of proof % 4.62/1.51 % SZS output end Proof for theBenchmark % 4.62/1.51 % 4.62/1.51 926ms %------------------------------------------------------------------------------