%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV397+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 : n031.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 22:56:10 EDT 2023 % Result : Theorem 10.07s 2.12s % Output : Proof 12.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SWV397+1 : TPTP v8.1.2. Released v3.3.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n031.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Aug 29 08:51:41 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.27/1.19 Prover 1: Preprocessing ... % 3.27/1.19 Prover 4: Preprocessing ... % 3.87/1.25 Prover 2: Preprocessing ... % 3.87/1.25 Prover 0: Preprocessing ... % 3.87/1.25 Prover 3: Preprocessing ... % 3.87/1.25 Prover 5: Preprocessing ... % 3.87/1.25 Prover 6: Preprocessing ... % 7.35/1.80 Prover 1: Warning: ignoring some quantifiers % 7.91/1.86 Prover 1: Constructing countermodel ... % 8.48/1.91 Prover 3: Warning: ignoring some quantifiers % 8.48/1.91 Prover 5: Proving ... % 8.48/1.91 Prover 6: Proving ... % 8.48/1.95 Prover 3: Constructing countermodel ... % 8.48/1.96 Prover 4: Constructing countermodel ... % 8.48/1.97 Prover 0: Proving ... % 8.48/2.01 Prover 2: Proving ... % 10.07/2.11 Prover 0: proved (1463ms) % 10.07/2.11 % 10.07/2.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.07/2.12 % 10.07/2.12 Prover 3: stopped % 10.07/2.12 Prover 6: stopped % 10.20/2.14 Prover 2: stopped % 10.20/2.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.20/2.14 Prover 5: stopped % 10.20/2.15 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.20/2.15 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.20/2.15 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.20/2.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.20/2.16 Prover 8: Preprocessing ... % 10.20/2.17 Prover 7: Preprocessing ... % 10.20/2.20 Prover 11: Preprocessing ... % 10.20/2.21 Prover 10: Preprocessing ... % 10.83/2.24 Prover 13: Preprocessing ... % 10.83/2.26 Prover 1: Found proof (size 27) % 10.83/2.26 Prover 1: proved (1607ms) % 10.83/2.26 Prover 4: stopped % 10.83/2.26 Prover 7: stopped % 10.83/2.28 Prover 10: stopped % 10.83/2.28 Prover 11: stopped % 11.29/2.32 Prover 13: stopped % 11.29/2.34 Prover 8: Warning: ignoring some quantifiers % 11.29/2.35 Prover 8: Constructing countermodel ... % 11.29/2.36 Prover 8: stopped % 11.29/2.36 % 11.29/2.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.29/2.37 % 11.73/2.37 % SZS output start Proof for theBenchmark % 11.73/2.37 Assumptions after simplification: % 11.73/2.37 --------------------------------- % 11.73/2.37 % 11.73/2.37 (ax40) % 11.78/2.40 $i(bad) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (triple(v0, v1, bad) = % 11.78/2.40 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & ok(v2) = v3)) % 11.78/2.40 % 11.78/2.40 (ax43) % 11.78/2.40 $i(bad) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 11.78/2.40 : ! [v5: $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (remove_cpq(v4, v3) = v5) | % 11.78/2.40 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: any] : ? [v7: $i] : % 11.78/2.40 (triple(v0, v1, bad) = v7 & contains_slb(v1, v3) = v6 & $i(v7) & (v7 = v5 | % 11.78/2.40 v6 = 0))) % 11.78/2.40 % 11.78/2.40 (ax45) % 11.78/2.40 $i(bad) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 11.78/2.40 : ! [v5: $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (remove_cpq(v4, v3) = v5) | % 11.78/2.40 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: any] : ? [v7: $i] : % 11.78/2.40 ? [v8: any] : ? [v9: $i] : ? [v10: $i] : ? [v11: $i] : (remove_pqp(v0, % 11.78/2.40 v3) = v9 & triple(v9, v10, bad) = v11 & lookup_slb(v1, v3) = v7 & % 11.78/2.40 remove_slb(v1, v3) = v10 & contains_slb(v1, v3) = v6 & % 11.78/2.40 strictly_less_than(v3, v7) = v8 & $i(v11) & $i(v10) & $i(v9) & $i(v7) & ( % 11.78/2.40 ~ (v8 = 0) | ~ (v6 = 0) | v11 = v5))) % 11.78/2.40 % 11.78/2.40 (l33_co) % 11.78/2.40 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 11.78/2.40 $i] : ? [v6: int] : ( ~ (v6 = 0) & ok(v5) = 0 & triple(v0, v1, v2) = v4 & % 11.78/2.40 remove_cpq(v4, v3) = v5 & contains_slb(v1, v3) = v6 & $i(v5) & $i(v4) & % 11.78/2.40 $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 11.78/2.40 % 11.78/2.40 (function-axioms) % 11.93/2.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 11.93/2.41 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0: % 11.93/2.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.93/2.41 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~ % 11.93/2.41 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.93/2.41 ! [v3: $i] : (v1 = v0 | ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2) % 11.93/2.41 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 % 11.93/2.41 | ~ (insert_pqp(v3, v2) = v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0: % 11.93/2.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.93/2.41 : (v1 = v0 | ~ (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0)) % 11.93/2.41 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.93/2.41 (remove_cpq(v3, v2) = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : ! % 11.93/2.41 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1) % 11.93/2.41 | ~ (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.93/2.41 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3, % 11.93/2.41 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 11.93/2.41 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~ % 11.93/2.41 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 11.93/2.41 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) = % 11.93/2.41 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 11.93/2.41 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0: % 11.93/2.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.93/2.41 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0)) % 11.93/2.41 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.93/2.41 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 11.93/2.41 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~ % 11.93/2.41 (insert_slb(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.93/2.41 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.93/2.41 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) & % 11.93/2.41 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 11.93/2.41 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0)) % 11.93/2.41 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 11.93/2.41 (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) = v0)) & ! [v0: % 11.93/2.41 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_res(v2) = v1) | % 11.93/2.41 ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.93/2.41 (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ (findmin_pqp_res(v2) = v0)) & ! % 11.93/2.41 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 11.93/2.41 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.93/2.41 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) | % 11.93/2.41 ~ (check_cpq(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 11.93/2.41 | ~ (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0)) & ! % 11.93/2.41 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) = % 11.93/2.42 v1) | ~ (findmin_cpq_eff(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.93/2.42 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isnonempty_slb(v2) = % 11.93/2.42 v1) | ~ (isnonempty_slb(v2) = v0)) % 11.93/2.42 % 11.93/2.42 Further assumptions not needed in the proof: % 11.93/2.42 -------------------------------------------- % 11.93/2.42 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, % 11.93/2.42 ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax41, ax42, ax44, ax46, % 11.93/2.42 ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest, reflexivity, % 11.93/2.42 stricly_smaller_definition, totality, transitivity % 11.93/2.42 % 11.93/2.42 Those formulas are unsatisfiable: % 11.93/2.42 --------------------------------- % 11.93/2.42 % 11.93/2.42 Begin of proof % 11.93/2.42 | % 11.93/2.42 | ALPHA: (ax40) implies: % 11.93/2.42 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (triple(v0, v1, bad) = % 11.93/2.42 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & ok(v2) % 11.93/2.42 | = v3)) % 11.93/2.42 | % 11.93/2.42 | ALPHA: (ax43) implies: % 11.93/2.42 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 11.93/2.42 | ! [v5: $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (remove_cpq(v4, v3) = % 11.93/2.42 | v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: any] % 11.93/2.42 | : ? [v7: $i] : (triple(v0, v1, bad) = v7 & contains_slb(v1, v3) = v6 % 11.93/2.42 | & $i(v7) & (v7 = v5 | v6 = 0))) % 11.93/2.42 | % 11.93/2.42 | ALPHA: (ax45) implies: % 11.93/2.42 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 11.93/2.42 | ! [v5: $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (remove_cpq(v4, v3) = % 11.93/2.42 | v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: any] % 11.93/2.42 | : ? [v7: $i] : ? [v8: any] : ? [v9: $i] : ? [v10: $i] : ? [v11: % 11.93/2.42 | $i] : (remove_pqp(v0, v3) = v9 & triple(v9, v10, bad) = v11 & % 11.93/2.42 | lookup_slb(v1, v3) = v7 & remove_slb(v1, v3) = v10 & % 11.93/2.42 | contains_slb(v1, v3) = v6 & strictly_less_than(v3, v7) = v8 & % 11.93/2.42 | $i(v11) & $i(v10) & $i(v9) & $i(v7) & ( ~ (v8 = 0) | ~ (v6 = 0) | % 11.93/2.42 | v11 = v5))) % 11.93/2.42 | % 11.93/2.42 | ALPHA: (function-axioms) implies: % 11.93/2.42 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 11.93/2.42 | (v1 = v0 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) % 11.93/2.42 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 11.93/2.42 | ! [v3: $i] : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ % 11.93/2.42 | (contains_slb(v3, v2) = v0)) % 11.93/2.42 | % 11.93/2.42 | DELTA: instantiating (l33_co) with fresh symbols all_44_0, all_44_1, all_44_2, % 11.93/2.42 | all_44_3, all_44_4, all_44_5, all_44_6 gives: % 11.93/2.42 | (6) ~ (all_44_0 = 0) & ok(all_44_1) = 0 & triple(all_44_6, all_44_5, % 11.93/2.42 | all_44_4) = all_44_2 & remove_cpq(all_44_2, all_44_3) = all_44_1 & % 11.93/2.42 | contains_slb(all_44_5, all_44_3) = all_44_0 & $i(all_44_1) & % 11.93/2.42 | $i(all_44_2) & $i(all_44_3) & $i(all_44_4) & $i(all_44_5) & % 11.93/2.42 | $i(all_44_6) % 11.93/2.42 | % 11.93/2.42 | ALPHA: (6) implies: % 11.93/2.43 | (7) ~ (all_44_0 = 0) % 11.93/2.43 | (8) $i(all_44_6) % 11.93/2.43 | (9) $i(all_44_5) % 11.93/2.43 | (10) $i(all_44_4) % 11.93/2.43 | (11) $i(all_44_3) % 11.93/2.43 | (12) contains_slb(all_44_5, all_44_3) = all_44_0 % 12.02/2.43 | (13) remove_cpq(all_44_2, all_44_3) = all_44_1 % 12.02/2.43 | (14) triple(all_44_6, all_44_5, all_44_4) = all_44_2 % 12.02/2.43 | (15) ok(all_44_1) = 0 % 12.02/2.43 | % 12.02/2.43 | GROUND_INST: instantiating (3) with all_44_6, all_44_5, all_44_4, all_44_3, % 12.02/2.43 | all_44_2, all_44_1, simplifying with (8), (9), (10), (11), (13), % 12.02/2.43 | (14) gives: % 12.02/2.43 | (16) ? [v0: any] : ? [v1: $i] : ? [v2: any] : ? [v3: $i] : ? [v4: $i] % 12.02/2.43 | : ? [v5: $i] : (remove_pqp(all_44_6, all_44_3) = v3 & triple(v3, v4, % 12.02/2.43 | bad) = v5 & lookup_slb(all_44_5, all_44_3) = v1 & % 12.02/2.43 | remove_slb(all_44_5, all_44_3) = v4 & contains_slb(all_44_5, % 12.02/2.43 | all_44_3) = v0 & strictly_less_than(all_44_3, v1) = v2 & $i(v5) & % 12.02/2.43 | $i(v4) & $i(v3) & $i(v1) & ( ~ (v2 = 0) | ~ (v0 = 0) | v5 = % 12.02/2.43 | all_44_1)) % 12.02/2.43 | % 12.02/2.43 | GROUND_INST: instantiating (2) with all_44_6, all_44_5, all_44_4, all_44_3, % 12.02/2.43 | all_44_2, all_44_1, simplifying with (8), (9), (10), (11), (13), % 12.02/2.43 | (14) gives: % 12.02/2.43 | (17) ? [v0: any] : ? [v1: $i] : (triple(all_44_6, all_44_5, bad) = v1 & % 12.02/2.43 | contains_slb(all_44_5, all_44_3) = v0 & $i(v1) & (v1 = all_44_1 | v0 % 12.02/2.43 | = 0)) % 12.02/2.43 | % 12.02/2.43 | DELTA: instantiating (17) with fresh symbols all_57_0, all_57_1 gives: % 12.02/2.43 | (18) triple(all_44_6, all_44_5, bad) = all_57_0 & contains_slb(all_44_5, % 12.02/2.43 | all_44_3) = all_57_1 & $i(all_57_0) & (all_57_0 = all_44_1 | % 12.02/2.43 | all_57_1 = 0) % 12.02/2.43 | % 12.02/2.43 | ALPHA: (18) implies: % 12.02/2.43 | (19) contains_slb(all_44_5, all_44_3) = all_57_1 % 12.02/2.43 | (20) triple(all_44_6, all_44_5, bad) = all_57_0 % 12.02/2.43 | (21) all_57_0 = all_44_1 | all_57_1 = 0 % 12.02/2.43 | % 12.02/2.43 | DELTA: instantiating (16) with fresh symbols all_59_0, all_59_1, all_59_2, % 12.02/2.43 | all_59_3, all_59_4, all_59_5 gives: % 12.02/2.43 | (22) remove_pqp(all_44_6, all_44_3) = all_59_2 & triple(all_59_2, all_59_1, % 12.02/2.43 | bad) = all_59_0 & lookup_slb(all_44_5, all_44_3) = all_59_4 & % 12.02/2.43 | remove_slb(all_44_5, all_44_3) = all_59_1 & contains_slb(all_44_5, % 12.02/2.43 | all_44_3) = all_59_5 & strictly_less_than(all_44_3, all_59_4) = % 12.02/2.43 | all_59_3 & $i(all_59_0) & $i(all_59_1) & $i(all_59_2) & $i(all_59_4) & % 12.02/2.43 | ( ~ (all_59_3 = 0) | ~ (all_59_5 = 0) | all_59_0 = all_44_1) % 12.02/2.43 | % 12.02/2.43 | ALPHA: (22) implies: % 12.02/2.43 | (23) contains_slb(all_44_5, all_44_3) = all_59_5 % 12.02/2.43 | % 12.02/2.43 | GROUND_INST: instantiating (5) with all_44_0, all_59_5, all_44_3, all_44_5, % 12.02/2.43 | simplifying with (12), (23) gives: % 12.02/2.43 | (24) all_59_5 = all_44_0 % 12.02/2.43 | % 12.02/2.43 | GROUND_INST: instantiating (5) with all_57_1, all_59_5, all_44_3, all_44_5, % 12.02/2.43 | simplifying with (19), (23) gives: % 12.02/2.43 | (25) all_59_5 = all_57_1 % 12.02/2.43 | % 12.02/2.43 | COMBINE_EQS: (24), (25) imply: % 12.02/2.43 | (26) all_57_1 = all_44_0 % 12.02/2.43 | % 12.02/2.43 | BETA: splitting (21) gives: % 12.02/2.43 | % 12.02/2.43 | Case 1: % 12.02/2.43 | | % 12.02/2.43 | | (27) all_57_1 = 0 % 12.02/2.43 | | % 12.02/2.43 | | COMBINE_EQS: (26), (27) imply: % 12.02/2.43 | | (28) all_44_0 = 0 % 12.02/2.43 | | % 12.02/2.43 | | SIMP: (28) implies: % 12.02/2.43 | | (29) all_44_0 = 0 % 12.02/2.43 | | % 12.02/2.43 | | REDUCE: (7), (29) imply: % 12.02/2.44 | | (30) $false % 12.02/2.44 | | % 12.02/2.44 | | CLOSE: (30) is inconsistent. % 12.02/2.44 | | % 12.02/2.44 | Case 2: % 12.02/2.44 | | % 12.02/2.44 | | (31) all_57_0 = all_44_1 % 12.02/2.44 | | % 12.02/2.44 | | REDUCE: (20), (31) imply: % 12.02/2.44 | | (32) triple(all_44_6, all_44_5, bad) = all_44_1 % 12.02/2.44 | | % 12.02/2.44 | | GROUND_INST: instantiating (1) with all_44_6, all_44_5, all_44_1, % 12.02/2.44 | | simplifying with (8), (9), (32) gives: % 12.02/2.44 | | (33) ? [v0: int] : ( ~ (v0 = 0) & ok(all_44_1) = v0) % 12.02/2.44 | | % 12.02/2.44 | | DELTA: instantiating (33) with fresh symbol all_76_0 gives: % 12.02/2.44 | | (34) ~ (all_76_0 = 0) & ok(all_44_1) = all_76_0 % 12.02/2.44 | | % 12.02/2.44 | | ALPHA: (34) implies: % 12.02/2.44 | | (35) ~ (all_76_0 = 0) % 12.02/2.44 | | (36) ok(all_44_1) = all_76_0 % 12.02/2.44 | | % 12.02/2.44 | | GROUND_INST: instantiating (4) with 0, all_76_0, all_44_1, simplifying with % 12.02/2.44 | | (15), (36) gives: % 12.02/2.44 | | (37) all_76_0 = 0 % 12.02/2.44 | | % 12.02/2.44 | | REDUCE: (35), (37) imply: % 12.02/2.44 | | (38) $false % 12.02/2.44 | | % 12.02/2.44 | | CLOSE: (38) is inconsistent. % 12.02/2.44 | | % 12.02/2.44 | End of split % 12.02/2.44 | % 12.02/2.44 End of proof % 12.02/2.44 % SZS output end Proof for theBenchmark % 12.02/2.44 % 12.02/2.44 1817ms %------------------------------------------------------------------------------