%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS101+1 : TPTP v8.1.2. Released v3.1.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 05:51:15 EDT 2023 % Result : Unsatisfiable 4.89s 1.45s % Output : Proof 6.96s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS101+1 : TPTP v8.1.2. Released v3.1.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 : Mon Aug 28 03:03:34 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.45/1.01 Prover 1: Preprocessing ... % 2.45/1.01 Prover 4: Preprocessing ... % 2.69/1.06 Prover 3: Preprocessing ... % 2.69/1.06 Prover 2: Preprocessing ... % 2.69/1.06 Prover 0: Preprocessing ... % 2.69/1.06 Prover 5: Preprocessing ... % 2.69/1.06 Prover 6: Preprocessing ... % 4.32/1.29 Prover 2: Proving ... % 4.32/1.29 Prover 5: Proving ... % 4.89/1.35 Prover 1: Constructing countermodel ... % 4.89/1.35 Prover 4: Constructing countermodel ... % 4.89/1.35 Prover 3: Constructing countermodel ... % 4.89/1.37 Prover 6: Proving ... % 4.89/1.37 Prover 0: Proving ... % 4.89/1.44 Prover 3: gave up % 4.89/1.44 Prover 1: gave up % 4.89/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.89/1.45 Prover 2: proved (815ms) % 4.89/1.45 % 4.89/1.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.89/1.45 % 4.89/1.46 Prover 0: stopped % 4.89/1.46 Prover 6: stopped % 5.09/1.46 Prover 5: proved (814ms) % 5.09/1.46 % 5.09/1.46 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.09/1.46 % 5.09/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.09/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.09/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.09/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.09/1.47 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.09/1.49 Prover 11: Preprocessing ... % 5.09/1.49 Prover 7: Preprocessing ... % 5.09/1.51 Prover 13: Preprocessing ... % 5.09/1.51 Prover 10: Preprocessing ... % 5.09/1.51 Prover 8: Preprocessing ... % 5.09/1.52 Prover 16: Preprocessing ... % 6.12/1.53 Prover 7: Warning: ignoring some quantifiers % 6.12/1.53 Prover 4: Found proof (size 18) % 6.12/1.53 Prover 4: proved (899ms) % 6.12/1.54 Prover 7: Constructing countermodel ... % 6.12/1.54 Prover 7: stopped % 6.12/1.55 Prover 16: stopped % 6.12/1.55 Prover 13: stopped % 6.12/1.55 Prover 11: stopped % 6.12/1.55 Prover 10: Warning: ignoring some quantifiers % 6.12/1.56 Prover 10: Constructing countermodel ... % 6.12/1.56 Prover 10: stopped % 6.50/1.60 Prover 8: Warning: ignoring some quantifiers % 6.50/1.61 Prover 8: Constructing countermodel ... % 6.50/1.61 Prover 8: stopped % 6.50/1.61 % 6.50/1.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.50/1.61 % 6.50/1.62 % SZS output start Proof for theBenchmark % 6.50/1.62 Assumptions after simplification: % 6.50/1.62 --------------------------------- % 6.50/1.62 % 6.50/1.62 (axiom_2) % 6.50/1.66 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : ! [v3: $i] : ! [v4: $i] : (v4 = % 6.50/1.66 v3 | v2 = 0 | ~ (rs(v1, v4) = 0) | ~ (rs(v1, v3) = 0) | ~ (cc(v1) = v2) | % 6.50/1.66 ~ (cUnsatisfiable(v0) = 0) | ~ $i(v4) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) % 6.50/1.66 | ? [v5: int] : ( ~ (v5 = 0) & rr(v0, v1) = v5)) & ! [v0: $i] : ! [v1: % 6.50/1.66 int] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v4 = v3 | v1 = 0 | ~ % 6.50/1.66 (rs(v2, v4) = 0) | ~ (rs(v2, v3) = 0) | ~ (rr(v0, v2) = 0) | ~ % 6.50/1.66 (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | % 6.50/1.66 ? [v5: $i] : ? [v6: int] : ? [v7: int] : ? [v8: $i] : ? [v9: $i] : ? % 6.50/1.66 [v10: int] : ? [v11: int] : ? [v12: $i] : ? [v13: int] : ? [v14: int] : % 6.50/1.66 ($i(v12) & $i(v9) & $i(v8) & $i(v5) & ((v13 = 0 & ~ (v14 = 0) & rr(v0, v12) % 6.50/1.66 = 0 & cd(v12) = v14) | (v11 = 0 & v10 = 0 & v6 = 0 & ~ (v9 = v8) & ~ % 6.50/1.66 (v7 = 0) & rs(v5, v9) = 0 & rs(v5, v8) = 0 & rr(v0, v5) = 0 & cc(v5) = % 6.50/1.66 v7)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = % 6.50/1.66 v2 | ~ (rs(v1, v3) = 0) | ~ (rs(v1, v2) = 0) | ~ (rr(v0, v1) = 0) | ~ % 6.50/1.66 (cUnsatisfiable(v0) = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 6.50/1.66 cc(v1) = 0) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 6.50/1.66 (cd(v1) = v2) | ~ (cUnsatisfiable(v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? % 6.50/1.66 [v3: int] : ( ~ (v3 = 0) & rr(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( % 6.88/1.66 ~ (rr(v0, v1) = 0) | ~ (cUnsatisfiable(v0) = 0) | ~ $i(v1) | ~ $i(v0) | % 6.88/1.66 cd(v1) = 0) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? % 6.88/1.66 [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & rs(v1, v3) = 0 & % 6.88/1.66 rs(v1, v2) = 0 & rr(v0, v1) = 0 & $i(v3) & $i(v2) & $i(v1))) % 6.88/1.66 % 6.88/1.66 (axiom_3) % 6.88/1.66 ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.88/1.66 cc(v0) = v1)) & ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | ? [v1: int] % 6.88/1.66 : ( ~ (v1 = 0) & cd(v0) = v1)) % 6.88/1.66 % 6.88/1.66 (axiom_4) % 6.88/1.66 cUnsatisfiable(i2003_11_14_17_20_36582) = 0 & $i(i2003_11_14_17_20_36582) % 6.88/1.66 % 6.88/1.66 (function-axioms) % 6.88/1.67 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 6.88/1.67 [v3: $i] : (v1 = v0 | ~ (rs(v3, v2) = v1) | ~ (rs(v3, v2) = v0)) & ! [v0: % 6.88/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 6.88/1.67 : (v1 = v0 | ~ (rr(v3, v2) = v1) | ~ (rr(v3, v2) = v0)) & ! [v0: % 6.88/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.88/1.67 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 6.88/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.88/1.67 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 6.88/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.88/1.67 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0: % 6.88/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.88/1.67 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 6.88/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.88/1.67 ~ (cd(v2) = v1) | ~ (cd(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.88/1.67 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) % 6.88/1.67 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 6.88/1.67 $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | ~ (cUnsatisfiable(v2) = % 6.88/1.67 v0)) % 6.88/1.67 % 6.88/1.67 Further assumptions not needed in the proof: % 6.88/1.67 -------------------------------------------- % 6.88/1.67 axiom_0, axiom_1, cUnsatisfiable_substitution_1, cc_substitution_1, % 6.88/1.67 cd_substitution_1, cowlNothing_substitution_1, cowlThing_substitution_1, % 6.88/1.67 rr_substitution_1, rr_substitution_2, rs_substitution_1, rs_substitution_2, % 6.88/1.67 xsd_integer_substitution_1, xsd_string_substitution_1 % 6.88/1.67 % 6.88/1.67 Those formulas are unsatisfiable: % 6.88/1.67 --------------------------------- % 6.88/1.67 % 6.88/1.67 Begin of proof % 6.88/1.67 | % 6.88/1.67 | ALPHA: (axiom_2) implies: % 6.96/1.67 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 6.96/1.67 | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & rs(v1, v3) = 0 & rs(v1, % 6.96/1.67 | v2) = 0 & rr(v0, v1) = 0 & $i(v3) & $i(v2) & $i(v1))) % 6.96/1.68 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (rr(v0, v1) = 0) | ~ % 6.96/1.68 | (cUnsatisfiable(v0) = 0) | ~ $i(v1) | ~ $i(v0) | cd(v1) = 0) % 6.96/1.68 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | ~ % 6.96/1.68 | (rs(v1, v3) = 0) | ~ (rs(v1, v2) = 0) | ~ (rr(v0, v1) = 0) | ~ % 6.96/1.68 | (cUnsatisfiable(v0) = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 6.96/1.68 | $i(v0) | cc(v1) = 0) % 6.96/1.68 | % 6.96/1.68 | ALPHA: (axiom_3) implies: % 6.96/1.68 | (4) ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = % 6.96/1.68 | 0) & cc(v0) = v1)) % 6.96/1.68 | % 6.96/1.68 | ALPHA: (axiom_4) implies: % 6.96/1.68 | (5) $i(i2003_11_14_17_20_36582) % 6.96/1.68 | (6) cUnsatisfiable(i2003_11_14_17_20_36582) = 0 % 6.96/1.68 | % 6.96/1.68 | ALPHA: (function-axioms) implies: % 6.96/1.68 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.96/1.68 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) % 6.96/1.68 | % 6.96/1.68 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_36582, simplifying with % 6.96/1.68 | (5), (6) gives: % 6.96/1.68 | (8) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = v1) & rs(v0, v2) = % 6.96/1.68 | 0 & rs(v0, v1) = 0 & rr(i2003_11_14_17_20_36582, v0) = 0 & $i(v2) & % 6.96/1.68 | $i(v1) & $i(v0)) % 6.96/1.68 | % 6.96/1.68 | DELTA: instantiating (8) with fresh symbols all_13_0, all_13_1, all_13_2 % 6.96/1.68 | gives: % 6.96/1.68 | (9) ~ (all_13_0 = all_13_1) & rs(all_13_2, all_13_0) = 0 & rs(all_13_2, % 6.96/1.68 | all_13_1) = 0 & rr(i2003_11_14_17_20_36582, all_13_2) = 0 & % 6.96/1.68 | $i(all_13_0) & $i(all_13_1) & $i(all_13_2) % 6.96/1.68 | % 6.96/1.68 | ALPHA: (9) implies: % 6.96/1.69 | (10) ~ (all_13_0 = all_13_1) % 6.96/1.69 | (11) $i(all_13_2) % 6.96/1.69 | (12) $i(all_13_1) % 6.96/1.69 | (13) $i(all_13_0) % 6.96/1.69 | (14) rr(i2003_11_14_17_20_36582, all_13_2) = 0 % 6.96/1.69 | (15) rs(all_13_2, all_13_1) = 0 % 6.96/1.69 | (16) rs(all_13_2, all_13_0) = 0 % 6.96/1.69 | % 6.96/1.69 | GROUND_INST: instantiating (2) with i2003_11_14_17_20_36582, all_13_2, % 6.96/1.69 | simplifying with (5), (6), (11), (14) gives: % 6.96/1.69 | (17) cd(all_13_2) = 0 % 6.96/1.69 | % 6.96/1.69 | GROUND_INST: instantiating (3) with i2003_11_14_17_20_36582, all_13_2, % 6.96/1.69 | all_13_1, all_13_0, simplifying with (5), (6), (11), (12), (13), % 6.96/1.69 | (14), (15), (16) gives: % 6.96/1.69 | (18) all_13_0 = all_13_1 | cc(all_13_2) = 0 % 6.96/1.69 | % 6.96/1.69 | BETA: splitting (18) gives: % 6.96/1.69 | % 6.96/1.69 | Case 1: % 6.96/1.69 | | % 6.96/1.69 | | (19) cc(all_13_2) = 0 % 6.96/1.69 | | % 6.96/1.69 | | GROUND_INST: instantiating (4) with all_13_2, simplifying with (11), (17) % 6.96/1.69 | | gives: % 6.96/1.69 | | (20) ? [v0: int] : ( ~ (v0 = 0) & cc(all_13_2) = v0) % 6.96/1.69 | | % 6.96/1.69 | | DELTA: instantiating (20) with fresh symbol all_30_0 gives: % 6.96/1.69 | | (21) ~ (all_30_0 = 0) & cc(all_13_2) = all_30_0 % 6.96/1.69 | | % 6.96/1.69 | | ALPHA: (21) implies: % 6.96/1.69 | | (22) ~ (all_30_0 = 0) % 6.96/1.69 | | (23) cc(all_13_2) = all_30_0 % 6.96/1.69 | | % 6.96/1.69 | | GROUND_INST: instantiating (7) with 0, all_30_0, all_13_2, simplifying with % 6.96/1.69 | | (19), (23) gives: % 6.96/1.69 | | (24) all_30_0 = 0 % 6.96/1.69 | | % 6.96/1.69 | | REDUCE: (22), (24) imply: % 6.96/1.69 | | (25) $false % 6.96/1.69 | | % 6.96/1.69 | | CLOSE: (25) is inconsistent. % 6.96/1.69 | | % 6.96/1.69 | Case 2: % 6.96/1.69 | | % 6.96/1.69 | | (26) all_13_0 = all_13_1 % 6.96/1.69 | | % 6.96/1.69 | | REDUCE: (10), (26) imply: % 6.96/1.69 | | (27) $false % 6.96/1.69 | | % 6.96/1.69 | | CLOSE: (27) is inconsistent. % 6.96/1.69 | | % 6.96/1.69 | End of split % 6.96/1.69 | % 6.96/1.69 End of proof % 6.96/1.69 % SZS output end Proof for theBenchmark % 6.96/1.69 % 6.96/1.69 1087ms %------------------------------------------------------------------------------