%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT114+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n003.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:17:32 AM UTC 2026 % Result : Unsatisfiable 10.83s 2.05s % Output : Proof 14.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT114+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.35 % Computer : n003.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 14:09:24 UTC 2026 % 0.09/0.35 % CPUTime : % 0.14/0.37 OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release. % 0.31/0.56 ________ _____ % 0.31/0.56 ___ __ \_________(_)________________________________ % 0.31/0.56 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.31/0.56 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.31/0.56 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.31/0.56 % 0.31/0.56 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.31/0.57 (2023-06-19) % 0.31/0.57 % 0.31/0.57 (c) Philipp Rümmer, 2009-2023 % 0.31/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.31/0.57 Amanda Stjerna. % 0.31/0.57 Free software under BSD-3-Clause. % 0.31/0.57 % 0.31/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.31/0.57 % 0.31/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.31/0.58 Running up to 7 provers in parallel. % 0.31/0.59 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.31/0.59 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.31/0.59 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.31/0.59 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.31/0.59 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.31/0.59 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.31/0.59 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 2.03/0.97 Prover 4: Preprocessing ... % 2.03/1.01 Prover 1: Preprocessing ... % 2.95/1.05 Prover 5: Preprocessing ... % 2.95/1.05 Prover 3: Preprocessing ... % 2.95/1.05 Prover 0: Preprocessing ... % 2.95/1.05 Prover 6: Preprocessing ... % 2.95/1.06 Prover 2: Preprocessing ... % 3.78/1.18 Prover 5: Proving ... % 4.28/1.24 Prover 2: Constructing countermodel ... % 6.62/1.53 Prover 6: Proving ... % 6.62/1.56 Prover 1: Warning: ignoring some quantifiers % 6.62/1.60 Prover 1: Constructing countermodel ... % 6.62/1.60 Prover 3: Warning: ignoring some quantifiers % 7.44/1.63 Prover 3: Constructing countermodel ... % 8.20/1.75 Prover 0: Proving ... % 9.75/1.93 Prover 4: Warning: ignoring some quantifiers % 9.75/1.96 Prover 4: Constructing countermodel ... % 9.75/1.96 Prover 1: gave up % 9.75/1.97 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.75/2.01 Prover 7: Preprocessing ... % 10.83/2.05 Prover 2: proved (1465ms) % 10.83/2.05 % 10.83/2.05 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.83/2.05 % 10.83/2.05 Prover 3: stopped % 10.83/2.06 Prover 6: stopped % 10.83/2.06 Prover 5: stopped % 10.83/2.07 Prover 0: stopped % 10.83/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.83/2.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.83/2.08 Prover 7: Constructing countermodel ... % 10.83/2.08 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.83/2.08 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.83/2.08 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 10.83/2.12 Prover 8: Preprocessing ... % 11.65/2.15 Prover 10: Preprocessing ... % 11.65/2.17 Prover 13: Preprocessing ... % 11.65/2.17 Prover 16: Preprocessing ... % 11.65/2.17 Prover 11: Preprocessing ... % 12.06/2.26 Prover 10: Constructing countermodel ... % 12.06/2.26 Prover 16: Constructing countermodel ... % 12.85/2.30 Prover 13: Constructing countermodel ... % 12.85/2.33 Prover 7: Found proof (size 33) % 12.85/2.33 Prover 7: proved (371ms) % 12.85/2.34 Prover 4: stopped % 12.85/2.34 Prover 10: stopped % 12.85/2.34 Prover 8: Warning: ignoring some quantifiers % 12.85/2.34 Prover 13: stopped % 12.85/2.35 Prover 16: stopped % 12.85/2.35 Prover 8: Constructing countermodel ... % 12.85/2.36 Prover 8: stopped % 13.50/2.48 Prover 11: Warning: ignoring some quantifiers % 13.50/2.50 Prover 11: Constructing countermodel ... % 14.00/2.51 Prover 11: stopped % 14.00/2.51 % 14.00/2.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.00/2.51 % 14.00/2.52 % SZS output start Proof for theBenchmark % 14.00/2.52 Assumptions after simplification: % 14.00/2.52 --------------------------------- % 14.00/2.52 % 14.00/2.52 (ax_correlativity_permission) % 14.00/2.55 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 14.00/2.55 | ~ $i(v1) | ~ $i(v0) | ~ no_right(v3) | ~ cnt(v3, v1, v2) | ~ % 14.00/2.55 part_of(v3, v0) | ~ odrl_rel(v0) | ? [v4: $i] : ($i(v4) & (( ~ (v4 = v3) & % 14.00/2.55 no_right(v4) & cnt(v4, v1, v2) & part_of(v4, v0)) | (cnt(v4, v1, v2) & % 14.00/2.55 part_of(v4, v0) & permission(v4) & ! [v5: $i] : (v5 = v4 | ~ $i(v5) % 14.00/2.55 | ~ cnt(v5, v1, v2) | ~ part_of(v5, v0) | ~ permission(v5)))))) & % 14.00/2.55 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 14.00/2.55 | ~ $i(v1) | ~ $i(v0) | ~ cnt(v3, v1, v2) | ~ part_of(v3, v0) | ~ % 14.00/2.55 permission(v3) | ~ odrl_rel(v0) | ? [v4: $i] : ($i(v4) & (( ~ (v4 = v3) & % 14.00/2.55 cnt(v4, v1, v2) & part_of(v4, v0) & permission(v4)) | (no_right(v4) & % 14.00/2.55 cnt(v4, v1, v2) & part_of(v4, v0) & ! [v5: $i] : (v5 = v4 | ~ $i(v5) % 14.00/2.55 | ~ no_right(v5) | ~ cnt(v5, v1, v2) | ~ part_of(v5, v0)))))) % 14.00/2.55 % 14.00/2.55 (cnt_l) % 14.00/2.55 $i(some_target) & $i(some_action) & $i(l) & cnt(l, some_action, some_target) % 14.00/2.55 % 14.00/2.55 (cnt_n1) % 14.00/2.55 $i(some_target) & $i(some_action) & $i(n1) & cnt(n1, some_action, some_target) % 14.00/2.55 % 14.00/2.55 (cnt_n2) % 14.00/2.55 $i(some_target) & $i(some_action) & $i(n2) & cnt(n2, some_action, some_target) % 14.00/2.55 % 14.00/2.55 (n1_neq_n2) % 14.00/2.55 ~ (n2 = n1) & $i(n2) & $i(n1) % 14.00/2.55 % 14.00/2.55 (no_right_n1) % 14.00/2.55 $i(n1) & no_right(n1) % 14.00/2.55 % 14.00/2.55 (no_right_n2) % 14.00/2.56 $i(n2) & no_right(n2) % 14.00/2.56 % 14.00/2.56 (odrl_rho1) % 14.00/2.56 $i(rho1) & odrl_rel(rho1) % 14.00/2.56 % 14.00/2.56 (partof_l) % 14.00/2.56 $i(rho1) & $i(l) & part_of(l, rho1) % 14.00/2.56 % 14.00/2.56 (partof_n1) % 14.00/2.56 $i(rho1) & $i(n1) & part_of(n1, rho1) % 14.00/2.56 % 14.00/2.56 (partof_n2) % 14.00/2.56 $i(rho1) & $i(n2) & part_of(n2, rho1) % 14.00/2.56 % 14.00/2.56 (perm_l_unique) % 14.00/2.56 $i(some_target) & $i(some_action) & $i(rho1) & $i(l) & ! [v0: $i] : (v0 = l | % 14.00/2.56 ~ $i(v0) | ~ cnt(v0, some_action, some_target) | ~ part_of(v0, rho1) | ~ % 14.00/2.56 permission(v0)) % 14.00/2.56 % 14.00/2.56 (permission_l) % 14.00/2.56 $i(l) & permission(l) % 14.00/2.56 % 14.00/2.56 (pos_l) % 14.00/2.56 $i(l) & position(l) % 14.00/2.56 % 14.00/2.56 (pos_n1) % 14.00/2.56 $i(n1) & position(n1) % 14.00/2.56 % 14.00/2.56 (pos_n2) % 14.00/2.56 $i(n2) & position(n2) % 14.00/2.56 % 14.00/2.56 (rel_rho1) % 14.00/2.56 $i(rho1) & legal_relator(rho1) % 14.00/2.56 % 14.00/2.56 Further assumptions not needed in the proof: % 14.00/2.56 -------------------------------------------- % 14.00/2.56 action_typed, target_typed % 14.00/2.56 % 14.00/2.56 Those formulas are unsatisfiable: % 14.00/2.56 --------------------------------- % 14.00/2.56 % 14.00/2.56 Begin of proof % 14.00/2.57 | % 14.00/2.57 | ALPHA: (perm_l_unique) implies: % 14.00/2.57 | (1) ! [v0: $i] : (v0 = l | ~ $i(v0) | ~ cnt(v0, some_action, % 14.00/2.57 | some_target) | ~ part_of(v0, rho1) | ~ permission(v0)) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (n1_neq_n2) implies: % 14.00/2.57 | (2) ~ (n2 = n1) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (cnt_n2) implies: % 14.00/2.57 | (3) cnt(n2, some_action, some_target) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (cnt_n1) implies: % 14.00/2.57 | (4) cnt(n1, some_action, some_target) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (cnt_l) implies: % 14.00/2.57 | (5) cnt(l, some_action, some_target) % 14.00/2.57 | (6) $i(some_action) % 14.00/2.57 | (7) $i(some_target) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (partof_n2) implies: % 14.00/2.57 | (8) part_of(n2, rho1) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (partof_n1) implies: % 14.00/2.57 | (9) part_of(n1, rho1) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (partof_l) implies: % 14.00/2.57 | (10) part_of(l, rho1) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (no_right_n2) implies: % 14.00/2.57 | (11) no_right(n2) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (no_right_n1) implies: % 14.00/2.57 | (12) no_right(n1) % 14.00/2.57 | % 14.00/2.57 | ALPHA: (permission_l) implies: % 14.00/2.58 | (13) permission(l) % 14.00/2.58 | % 14.00/2.58 | ALPHA: (odrl_rho1) implies: % 14.00/2.58 | (14) odrl_rel(rho1) % 14.00/2.58 | % 14.00/2.58 | ALPHA: (rel_rho1) implies: % 14.00/2.58 | (15) $i(rho1) % 14.00/2.58 | % 14.00/2.58 | ALPHA: (pos_n2) implies: % 14.00/2.58 | (16) $i(n2) % 14.00/2.58 | % 14.00/2.58 | ALPHA: (pos_n1) implies: % 14.00/2.58 | (17) $i(n1) % 14.00/2.58 | % 14.00/2.58 | ALPHA: (pos_l) implies: % 14.00/2.58 | (18) $i(l) % 14.00/2.58 | % 14.00/2.58 | ALPHA: (ax_correlativity_permission) implies: % 14.00/2.58 | (19) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 14.00/2.58 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ cnt(v3, v1, v2) | ~ % 14.00/2.58 | part_of(v3, v0) | ~ permission(v3) | ~ odrl_rel(v0) | ? [v4: $i] % 14.00/2.58 | : ($i(v4) & (( ~ (v4 = v3) & cnt(v4, v1, v2) & part_of(v4, v0) & % 14.00/2.58 | permission(v4)) | (no_right(v4) & cnt(v4, v1, v2) & % 14.00/2.58 | part_of(v4, v0) & ! [v5: $i] : (v5 = v4 | ~ $i(v5) | ~ % 14.00/2.58 | no_right(v5) | ~ cnt(v5, v1, v2) | ~ part_of(v5, v0)))))) % 14.00/2.58 | % 14.00/2.59 | GROUND_INST: instantiating (19) with rho1, some_action, some_target, l, % 14.00/2.59 | simplifying with (5), (6), (7), (10), (13), (14), (15), (18) % 14.00/2.59 | gives: % 14.00/2.59 | (20) ? [v0: $i] : ($i(v0) & (( ~ (v0 = l) & cnt(v0, some_action, % 14.00/2.59 | some_target) & part_of(v0, rho1) & permission(v0)) | % 14.00/2.59 | (no_right(v0) & cnt(v0, some_action, some_target) & part_of(v0, % 14.00/2.59 | rho1) & ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ no_right(v1) | % 14.00/2.59 | ~ cnt(v1, some_action, some_target) | ~ part_of(v1, % 14.00/2.59 | rho1))))) % 14.00/2.59 | % 14.00/2.59 | DELTA: instantiating (20) with fresh symbol all_14_0 gives: % 14.00/2.59 | (21) $i(all_14_0) & (( ~ (all_14_0 = l) & cnt(all_14_0, some_action, % 14.00/2.59 | some_target) & part_of(all_14_0, rho1) & permission(all_14_0)) | % 14.00/2.59 | (no_right(all_14_0) & cnt(all_14_0, some_action, some_target) & % 14.00/2.59 | part_of(all_14_0, rho1) & ! [v0: any] : (v0 = all_14_0 | ~ % 14.00/2.59 | $i(v0) | ~ no_right(v0) | ~ cnt(v0, some_action, some_target) % 14.00/2.59 | | ~ part_of(v0, rho1)))) % 14.00/2.59 | % 14.00/2.59 | ALPHA: (21) implies: % 14.00/2.59 | (22) $i(all_14_0) % 14.00/2.59 | (23) ( ~ (all_14_0 = l) & cnt(all_14_0, some_action, some_target) & % 14.00/2.59 | part_of(all_14_0, rho1) & permission(all_14_0)) | % 14.00/2.59 | (no_right(all_14_0) & cnt(all_14_0, some_action, some_target) & % 14.00/2.59 | part_of(all_14_0, rho1) & ! [v0: any] : (v0 = all_14_0 | ~ $i(v0) % 14.00/2.59 | | ~ no_right(v0) | ~ cnt(v0, some_action, some_target) | ~ % 14.00/2.59 | part_of(v0, rho1))) % 14.00/2.59 | % 14.00/2.59 | BETA: splitting (23) gives: % 14.00/2.59 | % 14.00/2.59 | Case 1: % 14.00/2.59 | | % 14.00/2.60 | | (24) ~ (all_14_0 = l) & cnt(all_14_0, some_action, some_target) & % 14.00/2.60 | | part_of(all_14_0, rho1) & permission(all_14_0) % 14.00/2.60 | | % 14.00/2.60 | | ALPHA: (24) implies: % 14.00/2.60 | | (25) ~ (all_14_0 = l) % 14.00/2.60 | | (26) permission(all_14_0) % 14.47/2.60 | | (27) part_of(all_14_0, rho1) % 14.47/2.60 | | (28) cnt(all_14_0, some_action, some_target) % 14.47/2.60 | | % 14.47/2.60 | | GROUND_INST: instantiating (1) with all_14_0, simplifying with (22), (26), % 14.47/2.60 | | (27), (28) gives: % 14.47/2.60 | | (29) all_14_0 = l % 14.47/2.60 | | % 14.47/2.60 | | REDUCE: (25), (29) imply: % 14.47/2.60 | | (30) $false % 14.47/2.60 | | % 14.47/2.60 | | CLOSE: (30) is inconsistent. % 14.47/2.60 | | % 14.47/2.60 | Case 2: % 14.47/2.60 | | % 14.47/2.60 | | (31) no_right(all_14_0) & cnt(all_14_0, some_action, some_target) & % 14.47/2.60 | | part_of(all_14_0, rho1) & ! [v0: any] : (v0 = all_14_0 | ~ $i(v0) % 14.47/2.60 | | | ~ no_right(v0) | ~ cnt(v0, some_action, some_target) | ~ % 14.47/2.60 | | part_of(v0, rho1)) % 14.47/2.60 | | % 14.47/2.60 | | ALPHA: (31) implies: % 14.47/2.60 | | (32) ! [v0: any] : (v0 = all_14_0 | ~ $i(v0) | ~ no_right(v0) | ~ % 14.47/2.60 | | cnt(v0, some_action, some_target) | ~ part_of(v0, rho1)) % 14.47/2.60 | | % 14.47/2.60 | | GROUND_INST: instantiating (32) with n1, simplifying with (4), (9), (12), % 14.47/2.60 | | (17) gives: % 14.47/2.60 | | (33) all_14_0 = n1 % 14.47/2.60 | | % 14.47/2.60 | | GROUND_INST: instantiating (32) with n2, simplifying with (3), (8), (11), % 14.47/2.60 | | (16) gives: % 14.47/2.61 | | (34) all_14_0 = n2 % 14.47/2.61 | | % 14.47/2.61 | | COMBINE_EQS: (33), (34) imply: % 14.47/2.61 | | (35) n2 = n1 % 14.47/2.61 | | % 14.47/2.61 | | REDUCE: (2), (35) imply: % 14.47/2.61 | | (36) $false % 14.47/2.61 | | % 14.47/2.61 | | CLOSE: (36) is inconsistent. % 14.47/2.61 | | % 14.47/2.61 | End of split % 14.47/2.61 | % 14.47/2.61 End of proof % 14.47/2.61 % SZS output end Proof for theBenchmark % 14.47/2.61 % 14.47/2.61 2040ms %------------------------------------------------------------------------------