TSTP Solution File: SEU200+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n029.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 17:43:13 EDT 2023

% Result   : Theorem 9.75s 2.07s
% Output   : Proof 11.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Thu Aug 24 01:53:53 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.63  ________       _____
% 0.19/0.63  ___  __ \_________(_)________________________________
% 0.19/0.63  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.63  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.63  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.63  
% 0.19/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.63  (2023-06-19)
% 0.19/0.63  
% 0.19/0.63  (c) Philipp Rümmer, 2009-2023
% 0.19/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.63                Amanda Stjerna.
% 0.19/0.63  Free software under BSD-3-Clause.
% 0.19/0.63  
% 0.19/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.64  
% 0.19/0.64  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.65  Running up to 7 provers in parallel.
% 0.19/0.67  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.67  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.67  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.67  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.67  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.67  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.67  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.76/1.07  Prover 4: Preprocessing ...
% 2.76/1.08  Prover 1: Preprocessing ...
% 2.76/1.11  Prover 5: Preprocessing ...
% 2.76/1.11  Prover 2: Preprocessing ...
% 2.76/1.11  Prover 3: Preprocessing ...
% 2.76/1.11  Prover 0: Preprocessing ...
% 2.76/1.12  Prover 6: Preprocessing ...
% 4.92/1.42  Prover 1: Warning: ignoring some quantifiers
% 4.92/1.46  Prover 1: Constructing countermodel ...
% 4.92/1.46  Prover 5: Proving ...
% 4.92/1.47  Prover 2: Proving ...
% 4.92/1.52  Prover 3: Warning: ignoring some quantifiers
% 4.92/1.52  Prover 6: Proving ...
% 4.92/1.54  Prover 3: Constructing countermodel ...
% 4.92/1.56  Prover 4: Warning: ignoring some quantifiers
% 5.88/1.59  Prover 4: Constructing countermodel ...
% 6.85/1.67  Prover 0: Proving ...
% 7.53/1.75  Prover 3: gave up
% 7.53/1.76  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.91/1.79  Prover 7: Preprocessing ...
% 8.80/1.91  Prover 7: Warning: ignoring some quantifiers
% 8.80/1.92  Prover 7: Constructing countermodel ...
% 9.05/1.94  Prover 1: gave up
% 9.05/1.94  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.05/1.97  Prover 8: Preprocessing ...
% 9.75/2.07  Prover 0: proved (1410ms)
% 9.75/2.07  
% 9.75/2.07  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.75/2.07  
% 9.75/2.07  Prover 5: stopped
% 9.75/2.07  Prover 2: stopped
% 9.75/2.08  Prover 6: stopped
% 9.75/2.09  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.75/2.09  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.75/2.09  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.75/2.09  Prover 8: Warning: ignoring some quantifiers
% 9.75/2.09  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 10.15/2.09  Prover 8: Constructing countermodel ...
% 10.15/2.10  Prover 10: Preprocessing ...
% 10.15/2.11  Prover 13: Preprocessing ...
% 10.15/2.11  Prover 16: Preprocessing ...
% 10.15/2.11  Prover 11: Preprocessing ...
% 10.15/2.17  Prover 10: Warning: ignoring some quantifiers
% 10.15/2.18  Prover 10: Constructing countermodel ...
% 10.15/2.18  Prover 7: Found proof (size 10)
% 10.15/2.18  Prover 7: proved (422ms)
% 10.15/2.18  Prover 8: stopped
% 10.15/2.18  Prover 4: stopped
% 10.15/2.19  Prover 10: stopped
% 10.15/2.20  Prover 16: Warning: ignoring some quantifiers
% 10.15/2.20  Prover 11: stopped
% 10.15/2.20  Prover 13: Warning: ignoring some quantifiers
% 10.15/2.20  Prover 16: Constructing countermodel ...
% 10.15/2.21  Prover 16: stopped
% 10.15/2.21  Prover 13: Constructing countermodel ...
% 10.15/2.21  Prover 13: stopped
% 10.15/2.22  
% 10.15/2.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.15/2.22  
% 10.15/2.22  % SZS output start Proof for theBenchmark
% 10.15/2.22  Assumptions after simplification:
% 10.15/2.22  ---------------------------------
% 10.15/2.22  
% 10.15/2.22    (dt_k8_relat_1)
% 10.15/2.24     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_rng_restriction(v0,
% 10.15/2.24          v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ relation(v1) | relation(v2))
% 10.15/2.25  
% 10.15/2.25    (t117_relat_1)
% 10.15/2.25     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_rng_restriction(v0,
% 10.15/2.25          v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ relation(v1) | subset(v2, v1))
% 10.15/2.25  
% 10.15/2.25    (t118_relat_1)
% 10.15/2.25     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :
% 10.15/2.25    (relation_rng(v2) = v3 & relation_rng(v1) = v4 & relation_rng_restriction(v0,
% 10.15/2.25        v1) = v2 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & relation(v1) &  ~
% 10.15/2.25      subset(v3, v4))
% 10.15/2.25  
% 10.15/2.25    (t25_relat_1)
% 10.15/2.26     ! [v0: $i] :  ! [v1: $i] : ( ~ (relation_rng(v0) = v1) |  ~ $i(v0) |  ~
% 10.15/2.26      relation(v0) |  ? [v2: $i] : (relation_dom(v0) = v2 & $i(v2) &  ! [v3: $i] :
% 10.15/2.26         ! [v4: $i] : ( ~ (relation_rng(v3) = v4) |  ~ $i(v3) |  ~ subset(v0, v3)
% 10.15/2.26          |  ~ relation(v3) | subset(v1, v4)) &  ! [v3: $i] :  ! [v4: $i] : ( ~
% 10.15/2.26          (relation_rng(v3) = v4) |  ~ $i(v3) |  ~ subset(v0, v3) |  ~
% 10.15/2.26          relation(v3) |  ? [v5: $i] : (relation_dom(v3) = v5 & $i(v5) &
% 10.15/2.26            subset(v2, v5))) &  ! [v3: $i] :  ! [v4: $i] : ( ~ (relation_dom(v3) =
% 10.15/2.26            v4) |  ~ $i(v3) |  ~ subset(v0, v3) |  ~ relation(v3) | subset(v2,
% 10.15/2.26            v4)) &  ! [v3: $i] :  ! [v4: $i] : ( ~ (relation_dom(v3) = v4) |  ~
% 10.15/2.26          $i(v3) |  ~ subset(v0, v3) |  ~ relation(v3) |  ? [v5: $i] :
% 10.15/2.26          (relation_rng(v3) = v5 & $i(v5) & subset(v1, v5))))) &  ! [v0: $i] :  !
% 10.15/2.26    [v1: $i] : ( ~ (relation_dom(v0) = v1) |  ~ $i(v0) |  ~ relation(v0) |  ? [v2:
% 10.15/2.26        $i] : (relation_rng(v0) = v2 & $i(v2) &  ! [v3: $i] :  ! [v4: $i] : ( ~
% 10.15/2.26          (relation_rng(v3) = v4) |  ~ $i(v3) |  ~ subset(v0, v3) |  ~
% 10.15/2.26          relation(v3) | subset(v2, v4)) &  ! [v3: $i] :  ! [v4: $i] : ( ~
% 10.15/2.26          (relation_rng(v3) = v4) |  ~ $i(v3) |  ~ subset(v0, v3) |  ~
% 10.15/2.26          relation(v3) |  ? [v5: $i] : (relation_dom(v3) = v5 & $i(v5) &
% 10.15/2.26            subset(v1, v5))) &  ! [v3: $i] :  ! [v4: $i] : ( ~ (relation_dom(v3) =
% 10.15/2.26            v4) |  ~ $i(v3) |  ~ subset(v0, v3) |  ~ relation(v3) | subset(v1,
% 10.15/2.26            v4)) &  ! [v3: $i] :  ! [v4: $i] : ( ~ (relation_dom(v3) = v4) |  ~
% 10.15/2.26          $i(v3) |  ~ subset(v0, v3) |  ~ relation(v3) |  ? [v5: $i] :
% 10.15/2.26          (relation_rng(v3) = v5 & $i(v5) & subset(v2, v5)))))
% 10.15/2.26  
% 10.15/2.26  Further assumptions not needed in the proof:
% 10.15/2.26  --------------------------------------------
% 10.15/2.26  antisymmetry_r2_hidden, cc1_relat_1, dt_k1_relat_1, dt_k1_xboole_0,
% 10.15/2.26  dt_k1_zfmisc_1, dt_k2_relat_1, dt_m1_subset_1, existence_m1_subset_1,
% 10.15/2.26  fc1_subset_1, fc1_xboole_0, fc4_relat_1, fc5_relat_1, fc6_relat_1, fc7_relat_1,
% 10.15/2.26  fc8_relat_1, rc1_relat_1, rc1_subset_1, rc1_xboole_0, rc2_relat_1, rc2_subset_1,
% 10.15/2.26  rc2_xboole_0, reflexivity_r1_tarski, t1_subset, t2_subset, t3_subset, t4_subset,
% 10.15/2.26  t5_subset, t6_boole, t7_boole, t8_boole
% 10.15/2.26  
% 10.15/2.26  Those formulas are unsatisfiable:
% 10.15/2.26  ---------------------------------
% 10.15/2.26  
% 10.15/2.26  Begin of proof
% 10.89/2.26  | 
% 10.89/2.26  | ALPHA: (t25_relat_1) implies:
% 10.89/2.27  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (relation_rng(v0) = v1) |  ~ $i(v0) | 
% 10.89/2.27  |          ~ relation(v0) |  ? [v2: $i] : (relation_dom(v0) = v2 & $i(v2) &  !
% 10.89/2.27  |            [v3: $i] :  ! [v4: $i] : ( ~ (relation_rng(v3) = v4) |  ~ $i(v3) | 
% 10.89/2.27  |              ~ subset(v0, v3) |  ~ relation(v3) | subset(v1, v4)) &  ! [v3:
% 10.89/2.27  |              $i] :  ! [v4: $i] : ( ~ (relation_rng(v3) = v4) |  ~ $i(v3) |  ~
% 10.89/2.27  |              subset(v0, v3) |  ~ relation(v3) |  ? [v5: $i] :
% 10.89/2.27  |              (relation_dom(v3) = v5 & $i(v5) & subset(v2, v5))) &  ! [v3: $i]
% 10.89/2.27  |            :  ! [v4: $i] : ( ~ (relation_dom(v3) = v4) |  ~ $i(v3) |  ~
% 10.89/2.27  |              subset(v0, v3) |  ~ relation(v3) | subset(v2, v4)) &  ! [v3: $i]
% 10.89/2.27  |            :  ! [v4: $i] : ( ~ (relation_dom(v3) = v4) |  ~ $i(v3) |  ~
% 10.89/2.27  |              subset(v0, v3) |  ~ relation(v3) |  ? [v5: $i] :
% 10.89/2.27  |              (relation_rng(v3) = v5 & $i(v5) & subset(v1, v5)))))
% 10.89/2.27  | 
% 10.89/2.27  | DELTA: instantiating (t118_relat_1) with fresh symbols all_34_0, all_34_1,
% 10.89/2.27  |        all_34_2, all_34_3, all_34_4 gives:
% 10.89/2.27  |   (2)  relation_rng(all_34_2) = all_34_1 & relation_rng(all_34_3) = all_34_0 &
% 10.89/2.27  |        relation_rng_restriction(all_34_4, all_34_3) = all_34_2 & $i(all_34_0)
% 10.89/2.27  |        & $i(all_34_1) & $i(all_34_2) & $i(all_34_3) & $i(all_34_4) &
% 10.89/2.27  |        relation(all_34_3) &  ~ subset(all_34_1, all_34_0)
% 10.89/2.27  | 
% 10.89/2.27  | ALPHA: (2) implies:
% 10.89/2.27  |   (3)   ~ subset(all_34_1, all_34_0)
% 10.89/2.27  |   (4)  relation(all_34_3)
% 10.89/2.27  |   (5)  $i(all_34_4)
% 10.89/2.27  |   (6)  $i(all_34_3)
% 10.89/2.27  |   (7)  $i(all_34_2)
% 11.35/2.28  |   (8)  relation_rng_restriction(all_34_4, all_34_3) = all_34_2
% 11.35/2.28  |   (9)  relation_rng(all_34_3) = all_34_0
% 11.35/2.28  |   (10)  relation_rng(all_34_2) = all_34_1
% 11.35/2.28  | 
% 11.35/2.28  | GROUND_INST: instantiating (t117_relat_1) with all_34_4, all_34_3, all_34_2,
% 11.35/2.28  |              simplifying with (4), (5), (6), (8) gives:
% 11.35/2.28  |   (11)  subset(all_34_2, all_34_3)
% 11.35/2.28  | 
% 11.35/2.28  | GROUND_INST: instantiating (dt_k8_relat_1) with all_34_4, all_34_3, all_34_2,
% 11.35/2.28  |              simplifying with (4), (5), (6), (8) gives:
% 11.35/2.28  |   (12)  relation(all_34_2)
% 11.35/2.28  | 
% 11.35/2.28  | GROUND_INST: instantiating (1) with all_34_2, all_34_1, simplifying with (7),
% 11.35/2.28  |              (10), (12) gives:
% 11.35/2.28  |   (13)   ? [v0: $i] : (relation_dom(all_34_2) = v0 & $i(v0) &  ! [v1: $i] :  !
% 11.35/2.28  |           [v2: $i] : ( ~ (relation_rng(v1) = v2) |  ~ $i(v1) |  ~
% 11.35/2.28  |             subset(all_34_2, v1) |  ~ relation(v1) | subset(all_34_1, v2)) & 
% 11.35/2.28  |           ! [v1: $i] :  ! [v2: $i] : ( ~ (relation_rng(v1) = v2) |  ~ $i(v1) |
% 11.35/2.28  |              ~ subset(all_34_2, v1) |  ~ relation(v1) |  ? [v3: $i] :
% 11.35/2.28  |             (relation_dom(v1) = v3 & $i(v3) & subset(v0, v3))) &  ! [v1: $i] :
% 11.35/2.28  |            ! [v2: $i] : ( ~ (relation_dom(v1) = v2) |  ~ $i(v1) |  ~
% 11.35/2.28  |             subset(all_34_2, v1) |  ~ relation(v1) | subset(v0, v2)) &  ! [v1:
% 11.35/2.28  |             $i] :  ! [v2: $i] : ( ~ (relation_dom(v1) = v2) |  ~ $i(v1) |  ~
% 11.35/2.28  |             subset(all_34_2, v1) |  ~ relation(v1) |  ? [v3: $i] :
% 11.35/2.28  |             (relation_rng(v1) = v3 & $i(v3) & subset(all_34_1, v3))))
% 11.35/2.28  | 
% 11.35/2.28  | DELTA: instantiating (13) with fresh symbol all_57_0 gives:
% 11.35/2.28  |   (14)  relation_dom(all_34_2) = all_57_0 & $i(all_57_0) &  ! [v0: $i] :  !
% 11.35/2.28  |         [v1: $i] : ( ~ (relation_rng(v0) = v1) |  ~ $i(v0) |  ~
% 11.35/2.28  |           subset(all_34_2, v0) |  ~ relation(v0) | subset(all_34_1, v1)) &  !
% 11.35/2.28  |         [v0: $i] :  ! [v1: $i] : ( ~ (relation_rng(v0) = v1) |  ~ $i(v0) |  ~
% 11.35/2.28  |           subset(all_34_2, v0) |  ~ relation(v0) |  ? [v2: $i] :
% 11.35/2.28  |           (relation_dom(v0) = v2 & $i(v2) & subset(all_57_0, v2))) &  ! [v0:
% 11.35/2.28  |           $i] :  ! [v1: $i] : ( ~ (relation_dom(v0) = v1) |  ~ $i(v0) |  ~
% 11.35/2.28  |           subset(all_34_2, v0) |  ~ relation(v0) | subset(all_57_0, v1)) &  !
% 11.35/2.28  |         [v0: $i] :  ! [v1: $i] : ( ~ (relation_dom(v0) = v1) |  ~ $i(v0) |  ~
% 11.35/2.28  |           subset(all_34_2, v0) |  ~ relation(v0) |  ? [v2: $i] :
% 11.35/2.28  |           (relation_rng(v0) = v2 & $i(v2) & subset(all_34_1, v2)))
% 11.35/2.28  | 
% 11.35/2.28  | ALPHA: (14) implies:
% 11.35/2.29  |   (15)   ! [v0: $i] :  ! [v1: $i] : ( ~ (relation_rng(v0) = v1) |  ~ $i(v0) | 
% 11.35/2.29  |           ~ subset(all_34_2, v0) |  ~ relation(v0) | subset(all_34_1, v1))
% 11.35/2.29  | 
% 11.35/2.29  | GROUND_INST: instantiating (15) with all_34_3, all_34_0, simplifying with (3),
% 11.35/2.29  |              (4), (6), (9), (11) gives:
% 11.35/2.29  |   (16)  $false
% 11.35/2.29  | 
% 11.35/2.29  | CLOSE: (16) is inconsistent.
% 11.35/2.29  | 
% 11.35/2.29  End of proof
% 11.35/2.29  % SZS output end Proof for theBenchmark
% 11.35/2.29  
% 11.35/2.29  1651ms
%------------------------------------------------------------------------------