%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV377+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 : n028.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:05 EDT 2023 % Result : Theorem 10.31s 2.13s % Output : Proof 12.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SWV377+1 : TPTP v8.1.2. Released v3.3.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.32 % Computer : n028.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 300 % 0.12/0.32 % DateTime : Tue Aug 29 03:06:55 EDT 2023 % 0.12/0.33 % CPUTime : % 0.18/0.59 ________ _____ % 0.18/0.59 ___ __ \_________(_)________________________________ % 0.18/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.59 % 0.18/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.59 (2023-06-19) % 0.18/0.59 % 0.18/0.59 (c) Philipp Rümmer, 2009-2023 % 0.18/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.59 Amanda Stjerna. % 0.18/0.59 Free software under BSD-3-Clause. % 0.18/0.59 % 0.18/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.59 % 0.18/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.61 Running up to 7 provers in parallel. % 0.18/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.61/1.21 Prover 4: Preprocessing ... % 3.61/1.22 Prover 1: Preprocessing ... % 3.61/1.26 Prover 2: Preprocessing ... % 3.61/1.26 Prover 5: Preprocessing ... % 3.61/1.26 Prover 3: Preprocessing ... % 3.61/1.26 Prover 0: Preprocessing ... % 3.61/1.27 Prover 6: Preprocessing ... % 7.87/1.77 Prover 1: Warning: ignoring some quantifiers % 7.87/1.84 Prover 3: Warning: ignoring some quantifiers % 8.50/1.86 Prover 6: Proving ... % 8.50/1.87 Prover 5: Proving ... % 8.50/1.88 Prover 3: Constructing countermodel ... % 8.50/1.89 Prover 1: Constructing countermodel ... % 8.50/1.92 Prover 4: Constructing countermodel ... % 8.97/1.95 Prover 0: Proving ... % 8.97/1.98 Prover 2: Proving ... % 10.31/2.12 Prover 0: proved (1508ms) % 10.31/2.12 % 10.31/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.31/2.13 % 10.31/2.13 Prover 5: stopped % 10.31/2.13 Prover 2: stopped % 10.31/2.13 Prover 3: stopped % 10.31/2.13 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.31/2.13 Prover 6: stopped % 10.31/2.13 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.31/2.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.31/2.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.31/2.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.31/2.19 Prover 13: Preprocessing ... % 10.31/2.19 Prover 7: Preprocessing ... % 10.89/2.19 Prover 11: Preprocessing ... % 10.89/2.20 Prover 8: Preprocessing ... % 10.89/2.20 Prover 10: Preprocessing ... % 10.89/2.25 Prover 4: Found proof (size 21) % 10.89/2.25 Prover 4: proved (1630ms) % 10.89/2.26 Prover 1: stopped % 10.89/2.27 Prover 10: stopped % 10.89/2.27 Prover 7: stopped % 11.56/2.29 Prover 11: stopped % 11.68/2.32 Prover 13: stopped % 11.68/2.35 Prover 8: Warning: ignoring some quantifiers % 11.68/2.38 Prover 8: Constructing countermodel ... % 11.68/2.39 Prover 8: stopped % 11.68/2.39 % 11.68/2.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.68/2.39 % 11.68/2.39 % SZS output start Proof for theBenchmark % 11.68/2.40 Assumptions after simplification: % 11.68/2.40 --------------------------------- % 11.68/2.40 % 11.68/2.40 (ax40) % 12.17/2.42 $i(bad) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (triple(v0, v1, bad) = % 12.17/2.42 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & ok(v2) = v3)) % 12.17/2.42 % 12.17/2.42 (ax41) % 12.17/2.43 $i(bad) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v2 = bad | % 12.17/2.43 ~ (triple(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ok(v3) = % 12.17/2.43 0) % 12.17/2.43 % 12.17/2.43 (ax42) % 12.17/2.43 $i(bottom) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: % 12.17/2.43 $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ( ~ (insert_pqp(v0, v3) = % 12.17/2.43 v4) | ~ (triple(v4, v6, v2) = v7) | ~ (pair(v3, bottom) = v5) | ~ % 12.17/2.43 (insert_slb(v1, v5) = v6) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 12.17/2.43 ? [v8: $i] : (triple(v0, v1, v2) = v8 & insert_cpq(v8, v3) = v7 & $i(v8) & % 12.17/2.43 $i(v7))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: % 12.17/2.43 $i] : ! [v5: $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (insert_cpq(v4, v3) = % 12.17/2.43 v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: $i] : ? % 12.17/2.43 [v7: $i] : ? [v8: $i] : (insert_pqp(v0, v3) = v6 & triple(v6, v8, v2) = v5 % 12.17/2.43 & pair(v3, bottom) = v7 & insert_slb(v1, v7) = v8 & $i(v8) & $i(v7) & % 12.17/2.43 $i(v6) & $i(v5))) % 12.17/2.43 % 12.17/2.43 (l13_co) % 12.17/2.43 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 12.17/2.43 int] : ? [v6: $i] : ( ~ (v5 = 0) & ok(v6) = 0 & ok(v4) = v5 & triple(v0, % 12.17/2.43 v1, v2) = v4 & insert_cpq(v4, v3) = v6 & $i(v6) & $i(v4) & $i(v3) & $i(v2) % 12.17/2.43 & $i(v1) & $i(v0)) % 12.17/2.43 % 12.17/2.43 (function-axioms) % 12.17/2.45 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 12.17/2.45 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0: % 12.17/2.45 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 12.17/2.45 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~ % 12.17/2.45 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 12.17/2.45 ! [v3: $i] : (v1 = v0 | ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2) % 12.17/2.45 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 % 12.17/2.45 | ~ (insert_pqp(v3, v2) = v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0: % 12.17/2.45 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 12.17/2.45 : (v1 = v0 | ~ (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0)) % 12.17/2.45 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.17/2.45 (remove_cpq(v3, v2) = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : ! % 12.17/2.45 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1) % 12.17/2.45 | ~ (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.17/2.45 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3, % 12.17/2.45 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 12.17/2.45 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~ % 12.17/2.45 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 12.17/2.45 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) = % 12.17/2.45 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 12.17/2.45 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0: % 12.17/2.45 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 12.17/2.45 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0)) % 12.17/2.45 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.17/2.45 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 12.17/2.45 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~ % 12.17/2.45 (insert_slb(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.17/2.45 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.17/2.45 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) & % 12.17/2.45 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 12.17/2.45 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0)) % 12.17/2.45 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 12.17/2.45 (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) = v0)) & ! [v0: % 12.17/2.45 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_res(v2) = v1) | % 12.17/2.45 ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 12.17/2.45 (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ (findmin_pqp_res(v2) = v0)) & ! % 12.17/2.45 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 12.17/2.45 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 12.17/2.45 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) | % 12.17/2.45 ~ (check_cpq(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 12.17/2.45 | ~ (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0)) & ! % 12.17/2.45 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) = % 12.17/2.45 v1) | ~ (findmin_cpq_eff(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 12.17/2.45 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isnonempty_slb(v2) = % 12.17/2.45 v1) | ~ (isnonempty_slb(v2) = v0)) % 12.17/2.45 % 12.17/2.45 Further assumptions not needed in the proof: % 12.17/2.45 -------------------------------------------- % 12.17/2.45 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, % 12.17/2.45 ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax43, ax44, ax45, ax46, % 12.17/2.45 ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest, reflexivity, % 12.17/2.45 stricly_smaller_definition, totality, transitivity % 12.17/2.45 % 12.17/2.45 Those formulas are unsatisfiable: % 12.17/2.45 --------------------------------- % 12.17/2.45 % 12.17/2.45 Begin of proof % 12.17/2.45 | % 12.17/2.45 | ALPHA: (ax40) implies: % 12.17/2.45 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (triple(v0, v1, bad) = % 12.17/2.45 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & ok(v2) % 12.17/2.45 | = v3)) % 12.17/2.45 | % 12.17/2.45 | ALPHA: (ax41) implies: % 12.17/2.45 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v2 = bad | ~ % 12.17/2.45 | (triple(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 12.17/2.45 | ok(v3) = 0) % 12.17/2.45 | % 12.17/2.45 | ALPHA: (ax42) implies: % 12.17/2.45 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 12.17/2.45 | ! [v5: $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (insert_cpq(v4, v3) = % 12.17/2.45 | v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: $i] : % 12.17/2.45 | ? [v7: $i] : ? [v8: $i] : (insert_pqp(v0, v3) = v6 & triple(v6, v8, % 12.17/2.45 | v2) = v5 & pair(v3, bottom) = v7 & insert_slb(v1, v7) = v8 & % 12.17/2.45 | $i(v8) & $i(v7) & $i(v6) & $i(v5))) % 12.17/2.45 | % 12.17/2.45 | ALPHA: (function-axioms) implies: % 12.17/2.45 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.17/2.45 | (v1 = v0 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) % 12.17/2.45 | % 12.17/2.45 | DELTA: instantiating (l13_co) with fresh symbols all_46_0, all_46_1, all_46_2, % 12.17/2.45 | all_46_3, all_46_4, all_46_5, all_46_6 gives: % 12.17/2.45 | (5) ~ (all_46_1 = 0) & ok(all_46_0) = 0 & ok(all_46_2) = all_46_1 & % 12.17/2.45 | triple(all_46_6, all_46_5, all_46_4) = all_46_2 & insert_cpq(all_46_2, % 12.17/2.45 | all_46_3) = all_46_0 & $i(all_46_0) & $i(all_46_2) & $i(all_46_3) & % 12.17/2.45 | $i(all_46_4) & $i(all_46_5) & $i(all_46_6) % 12.17/2.45 | % 12.17/2.45 | ALPHA: (5) implies: % 12.17/2.46 | (6) ~ (all_46_1 = 0) % 12.17/2.46 | (7) $i(all_46_6) % 12.17/2.46 | (8) $i(all_46_5) % 12.17/2.46 | (9) $i(all_46_4) % 12.17/2.46 | (10) $i(all_46_3) % 12.17/2.46 | (11) insert_cpq(all_46_2, all_46_3) = all_46_0 % 12.17/2.46 | (12) triple(all_46_6, all_46_5, all_46_4) = all_46_2 % 12.17/2.46 | (13) ok(all_46_2) = all_46_1 % 12.17/2.46 | (14) ok(all_46_0) = 0 % 12.17/2.46 | % 12.17/2.46 | GROUND_INST: instantiating (3) with all_46_6, all_46_5, all_46_4, all_46_3, % 12.17/2.46 | all_46_2, all_46_0, simplifying with (7), (8), (9), (10), (11), % 12.17/2.46 | (12) gives: % 12.17/2.46 | (15) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (insert_pqp(all_46_6, % 12.17/2.46 | all_46_3) = v0 & triple(v0, v2, all_46_4) = all_46_0 & % 12.17/2.46 | pair(all_46_3, bottom) = v1 & insert_slb(all_46_5, v1) = v2 & $i(v2) % 12.17/2.46 | & $i(v1) & $i(v0) & $i(all_46_0)) % 12.17/2.46 | % 12.17/2.46 | GROUND_INST: instantiating (2) with all_46_6, all_46_5, all_46_4, all_46_2, % 12.17/2.46 | simplifying with (7), (8), (9), (12) gives: % 12.17/2.46 | (16) all_46_4 = bad | ok(all_46_2) = 0 % 12.17/2.46 | % 12.17/2.46 | DELTA: instantiating (15) with fresh symbols all_53_0, all_53_1, all_53_2 % 12.17/2.46 | gives: % 12.17/2.46 | (17) insert_pqp(all_46_6, all_46_3) = all_53_2 & triple(all_53_2, all_53_0, % 12.17/2.46 | all_46_4) = all_46_0 & pair(all_46_3, bottom) = all_53_1 & % 12.17/2.46 | insert_slb(all_46_5, all_53_1) = all_53_0 & $i(all_53_0) & % 12.17/2.46 | $i(all_53_1) & $i(all_53_2) & $i(all_46_0) % 12.17/2.46 | % 12.17/2.46 | ALPHA: (17) implies: % 12.17/2.46 | (18) $i(all_53_2) % 12.17/2.46 | (19) $i(all_53_0) % 12.17/2.46 | (20) triple(all_53_2, all_53_0, all_46_4) = all_46_0 % 12.17/2.46 | % 12.17/2.46 | BETA: splitting (16) gives: % 12.17/2.46 | % 12.17/2.46 | Case 1: % 12.17/2.46 | | % 12.17/2.46 | | (21) ok(all_46_2) = 0 % 12.17/2.46 | | % 12.17/2.46 | | GROUND_INST: instantiating (4) with all_46_1, 0, all_46_2, simplifying with % 12.17/2.46 | | (13), (21) gives: % 12.17/2.46 | | (22) all_46_1 = 0 % 12.17/2.46 | | % 12.17/2.46 | | REDUCE: (6), (22) imply: % 12.17/2.46 | | (23) $false % 12.17/2.46 | | % 12.17/2.46 | | CLOSE: (23) is inconsistent. % 12.17/2.46 | | % 12.17/2.46 | Case 2: % 12.17/2.46 | | % 12.17/2.46 | | (24) all_46_4 = bad % 12.17/2.46 | | % 12.17/2.46 | | REDUCE: (20), (24) imply: % 12.17/2.46 | | (25) triple(all_53_2, all_53_0, bad) = all_46_0 % 12.17/2.46 | | % 12.17/2.46 | | GROUND_INST: instantiating (1) with all_53_2, all_53_0, all_46_0, % 12.17/2.46 | | simplifying with (18), (19), (25) gives: % 12.17/2.46 | | (26) ? [v0: int] : ( ~ (v0 = 0) & ok(all_46_0) = v0) % 12.17/2.46 | | % 12.17/2.46 | | DELTA: instantiating (26) with fresh symbol all_65_0 gives: % 12.17/2.46 | | (27) ~ (all_65_0 = 0) & ok(all_46_0) = all_65_0 % 12.17/2.46 | | % 12.17/2.46 | | ALPHA: (27) implies: % 12.17/2.46 | | (28) ~ (all_65_0 = 0) % 12.17/2.46 | | (29) ok(all_46_0) = all_65_0 % 12.17/2.46 | | % 12.17/2.46 | | GROUND_INST: instantiating (4) with 0, all_65_0, all_46_0, simplifying with % 12.17/2.46 | | (14), (29) gives: % 12.17/2.46 | | (30) all_65_0 = 0 % 12.17/2.46 | | % 12.17/2.46 | | REDUCE: (28), (30) imply: % 12.17/2.47 | | (31) $false % 12.17/2.47 | | % 12.17/2.47 | | CLOSE: (31) is inconsistent. % 12.17/2.47 | | % 12.17/2.47 | End of split % 12.17/2.47 | % 12.17/2.47 End of proof % 12.17/2.47 % SZS output end Proof for theBenchmark % 12.17/2.47 % 12.17/2.47 1871ms %------------------------------------------------------------------------------