%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW951+1 : TPTP v8.1.2. Released v7.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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 : Fri Sep 1 00:51:48 EDT 2023 % Result : Theorem 12.54s 2.45s % Output : Proof 17.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWW951+1 : TPTP v8.1.2. Released v7.4.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.32 % Computer : n022.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.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Aug 27 21:04:54 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.60 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 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 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 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 % 2.43/1.04 Prover 1: Preprocessing ... % 2.43/1.04 Prover 4: Preprocessing ... % 2.43/1.08 Prover 6: Preprocessing ... % 2.43/1.08 Prover 2: Preprocessing ... % 2.43/1.08 Prover 5: Preprocessing ... % 2.43/1.08 Prover 3: Preprocessing ... % 2.43/1.08 Prover 0: Preprocessing ... % 4.58/1.40 Prover 3: Constructing countermodel ... % 4.58/1.44 Prover 6: Constructing countermodel ... % 4.58/1.45 Prover 5: Proving ... % 4.58/1.46 Prover 1: Constructing countermodel ... % 4.58/1.46 Prover 2: Proving ... % 4.58/1.47 Prover 4: Constructing countermodel ... % 5.87/1.53 Prover 0: Proving ... % 5.87/1.60 Prover 3: gave up % 6.59/1.60 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.59/1.62 Prover 6: gave up % 6.59/1.62 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.59/1.64 Prover 1: gave up % 6.59/1.64 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 6.59/1.66 Prover 7: Preprocessing ... % 6.59/1.67 Prover 8: Preprocessing ... % 7.30/1.71 Prover 9: Preprocessing ... % 8.08/1.81 Prover 7: Warning: ignoring some quantifiers % 8.08/1.83 Prover 8: Warning: ignoring some quantifiers % 8.08/1.84 Prover 7: Constructing countermodel ... % 8.08/1.87 Prover 8: Constructing countermodel ... % 8.08/1.89 Prover 9: Constructing countermodel ... % 10.28/2.15 Prover 8: gave up % 10.28/2.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.28/2.19 Prover 7: gave up % 10.28/2.19 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.28/2.19 Prover 10: Preprocessing ... % 11.04/2.22 Prover 11: Preprocessing ... % 11.04/2.24 Prover 10: Warning: ignoring some quantifiers % 11.04/2.25 Prover 10: Constructing countermodel ... % 11.78/2.38 Prover 11: Constructing countermodel ... % 12.54/2.40 Prover 10: gave up % 12.54/2.41 Prover 12: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=2024365391 % 12.54/2.45 Prover 0: proved (1841ms) % 12.54/2.45 % 12.54/2.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.54/2.45 % 12.54/2.45 Prover 12: Preprocessing ... % 12.54/2.45 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.54/2.45 Prover 2: stopped % 12.54/2.45 Prover 5: stopped % 12.54/2.46 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 12.54/2.46 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 12.54/2.47 Prover 9: stopped % 12.54/2.47 Prover 13: Preprocessing ... % 12.54/2.50 Prover 16: Preprocessing ... % 12.54/2.51 Prover 19: Preprocessing ... % 12.54/2.52 Prover 12: stopped % 12.54/2.55 Prover 13: Warning: ignoring some quantifiers % 12.54/2.57 Prover 16: Warning: ignoring some quantifiers % 12.54/2.57 Prover 13: Constructing countermodel ... % 12.54/2.57 Prover 16: Constructing countermodel ... % 13.85/2.61 Prover 19: Warning: ignoring some quantifiers % 13.85/2.63 Prover 19: Constructing countermodel ... % 14.71/2.80 Prover 19: gave up % 17.70/3.11 Prover 4: Found proof (size 37) % 17.70/3.11 Prover 4: proved (2492ms) % 17.70/3.11 Prover 13: stopped % 17.70/3.11 Prover 16: stopped % 17.70/3.11 Prover 11: stopped % 17.70/3.11 % 17.70/3.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.70/3.11 % 17.70/3.11 % SZS output start Proof for theBenchmark % 17.70/3.12 Assumptions after simplification: % 17.70/3.12 --------------------------------- % 17.70/3.12 % 17.70/3.12 (ax43) % 17.70/3.14 pred_attacker(tuple_false) = 0 & $i(tuple_false) % 17.70/3.14 % 17.70/3.14 (ax46) % 17.70/3.14 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (pred_attacker(v0) = v1) | ~ $i(v0) % 17.70/3.14 | ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & tuple_T_out_4(v0) = v2 & % 17.70/3.14 pred_attacker(v2) = v3 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 17.70/3.14 (tuple_T_out_4(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : % 17.70/3.14 (pred_attacker(v1) = v2 & pred_attacker(v0) = v3 & ( ~ (v2 = 0) | v3 = 0))) % 17.70/3.14 % 17.70/3.14 (ax49) % 17.70/3.15 ! [v0: $i] : ! [v1: $i] : ( ~ (tuple_T_in_3(v0) = v1) | ~ $i(v0) | ? [v2: % 17.70/3.15 any] : ? [v3: any] : (pred_attacker(v1) = v3 & pred_attacker(v0) = v2 & ( % 17.70/3.15 ~ (v2 = 0) | v3 = 0))) & ! [v0: $i] : ( ~ (pred_attacker(v0) = 0) | ~ % 17.70/3.15 $i(v0) | ? [v1: $i] : (tuple_T_in_3(v0) = v1 & pred_attacker(v1) = 0 & % 17.70/3.15 $i(v1))) % 17.70/3.15 % 17.70/3.15 (ax51) % 17.70/3.15 ! [v0: $i] : ! [v1: $i] : ( ~ (tuple_T_in_1(v0) = v1) | ~ $i(v0) | ? [v2: % 17.70/3.15 any] : ? [v3: any] : (pred_attacker(v1) = v3 & pred_attacker(v0) = v2 & ( % 17.70/3.15 ~ (v2 = 0) | v3 = 0))) & ! [v0: $i] : ( ~ (pred_attacker(v0) = 0) | ~ % 17.70/3.15 $i(v0) | ? [v1: $i] : (tuple_T_in_1(v0) = v1 & pred_attacker(v1) = 0 & % 17.70/3.15 $i(v1))) % 17.70/3.15 % 17.70/3.15 (ax56) % 17.70/3.15 pred_attacker(constr_CONST_1) = 0 & $i(constr_CONST_1) % 17.70/3.15 % 17.70/3.15 (ax64) % 17.70/3.15 $i(name_objective) & ? [v0: $i] : ? [v1: any] : % 17.70/3.15 (tuple_T_out_4(name_objective) = v0 & pred_attacker(v0) = v1 & $i(v0) & ! % 17.70/3.15 [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = 0 | ~ % 17.70/3.15 (tuple_T_in_1(v3) = v5) | ~ (tuple_T_in_3(v2) = v4) | ~ % 17.70/3.15 (pred_attacker(v5) = 0) | ~ (pred_attacker(v4) = 0) | ~ $i(v3) | ~ % 17.70/3.15 $i(v2))) % 17.70/3.15 % 17.70/3.15 (co0) % 17.70/3.15 $i(name_objective) & ? [v0: int] : ( ~ (v0 = 0) & % 17.70/3.15 pred_attacker(name_objective) = v0) % 17.70/3.15 % 17.70/3.15 (function-axioms) % 17.70/3.15 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 17.70/3.15 [v3: $i] : (v1 = v0 | ~ (pred_equal(v3, v2) = v1) | ~ (pred_equal(v3, v2) = % 17.70/3.16 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 17.70/3.16 $i] : ! [v3: $i] : (v1 = v0 | ~ (pred_mess(v3, v2) = v1) | ~ % 17.70/3.16 (pred_mess(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 17.70/3.16 [v3: $i] : (v1 = v0 | ~ (constr_xor(v3, v2) = v1) | ~ (constr_xor(v3, v2) = % 17.70/3.16 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 17.70/3.16 (name_new0x2Dname(v2) = v1) | ~ (name_new0x2Dname(v2) = v0)) & ! [v0: $i] % 17.70/3.16 : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tuple_T_in_1(v2) = v1) | ~ % 17.70/3.16 (tuple_T_in_1(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 17.70/3.16 v0 | ~ (tuple_T_in_3(v2) = v1) | ~ (tuple_T_in_3(v2) = v0)) & ! [v0: $i] % 17.70/3.16 : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tuple_T_out_2(v2) = v1) | ~ % 17.70/3.16 (tuple_T_out_2(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 17.70/3.16 v0 | ~ (tuple_T_out_4(v2) = v1) | ~ (tuple_T_out_4(v2) = v0)) & ! [v0: % 17.70/3.16 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (constr_h(v2) = v1) | ~ % 17.70/3.16 (constr_h(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 17.70/3.16 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (pred_attacker(v2) = v1) | % 17.70/3.16 ~ (pred_attacker(v2) = v0)) % 17.70/3.16 % 17.70/3.16 Further assumptions not needed in the proof: % 17.70/3.16 -------------------------------------------- % 17.70/3.16 ax0, ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 17.70/3.16 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 17.70/3.16 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax44, ax45, % 17.70/3.16 ax47, ax48, ax5, ax50, ax52, ax53, ax54, ax55, ax57, ax58, ax59, ax6, ax60, % 17.70/3.16 ax61, ax62, ax63, ax7, ax8, ax9 % 17.70/3.16 % 17.70/3.16 Those formulas are unsatisfiable: % 17.70/3.16 --------------------------------- % 17.70/3.16 % 17.70/3.16 Begin of proof % 17.70/3.16 | % 17.70/3.16 | ALPHA: (ax43) implies: % 17.70/3.16 | (1) $i(tuple_false) % 17.70/3.16 | (2) pred_attacker(tuple_false) = 0 % 17.70/3.16 | % 17.70/3.16 | ALPHA: (ax46) implies: % 17.70/3.16 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (tuple_T_out_4(v0) = v1) | ~ $i(v0) | % 17.70/3.16 | ? [v2: any] : ? [v3: any] : (pred_attacker(v1) = v2 & % 17.70/3.16 | pred_attacker(v0) = v3 & ( ~ (v2 = 0) | v3 = 0))) % 17.70/3.16 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (pred_attacker(v0) = v1) | ~ % 17.70/3.16 | $i(v0) | ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 17.70/3.16 | tuple_T_out_4(v0) = v2 & pred_attacker(v2) = v3 & $i(v2))) % 17.70/3.16 | % 17.70/3.16 | ALPHA: (ax49) implies: % 17.70/3.16 | (5) ! [v0: $i] : ( ~ (pred_attacker(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 17.70/3.16 | (tuple_T_in_3(v0) = v1 & pred_attacker(v1) = 0 & $i(v1))) % 17.70/3.16 | % 17.70/3.16 | ALPHA: (ax51) implies: % 17.70/3.16 | (6) ! [v0: $i] : ( ~ (pred_attacker(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 17.70/3.16 | (tuple_T_in_1(v0) = v1 & pred_attacker(v1) = 0 & $i(v1))) % 17.70/3.16 | % 17.70/3.16 | ALPHA: (ax56) implies: % 17.70/3.16 | (7) $i(constr_CONST_1) % 17.70/3.16 | (8) pred_attacker(constr_CONST_1) = 0 % 17.70/3.16 | % 17.70/3.16 | ALPHA: (ax64) implies: % 17.70/3.16 | (9) ? [v0: $i] : ? [v1: any] : (tuple_T_out_4(name_objective) = v0 & % 17.70/3.16 | pred_attacker(v0) = v1 & $i(v0) & ! [v2: $i] : ! [v3: $i] : ! [v4: % 17.70/3.16 | $i] : ! [v5: $i] : (v1 = 0 | ~ (tuple_T_in_1(v3) = v5) | ~ % 17.70/3.16 | (tuple_T_in_3(v2) = v4) | ~ (pred_attacker(v5) = 0) | ~ % 17.70/3.16 | (pred_attacker(v4) = 0) | ~ $i(v3) | ~ $i(v2))) % 17.70/3.16 | % 17.70/3.16 | ALPHA: (co0) implies: % 17.70/3.16 | (10) $i(name_objective) % 17.70/3.16 | (11) ? [v0: int] : ( ~ (v0 = 0) & pred_attacker(name_objective) = v0) % 17.70/3.16 | % 17.70/3.16 | ALPHA: (function-axioms) implies: % 17.70/3.16 | (12) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 17.70/3.16 | : (v1 = v0 | ~ (pred_attacker(v2) = v1) | ~ (pred_attacker(v2) = % 17.70/3.16 | v0)) % 17.70/3.16 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 17.70/3.16 | (tuple_T_out_4(v2) = v1) | ~ (tuple_T_out_4(v2) = v0)) % 17.70/3.16 | % 17.70/3.17 | DELTA: instantiating (11) with fresh symbol all_23_0 gives: % 17.70/3.17 | (14) ~ (all_23_0 = 0) & pred_attacker(name_objective) = all_23_0 % 17.70/3.17 | % 17.70/3.17 | ALPHA: (14) implies: % 17.70/3.17 | (15) ~ (all_23_0 = 0) % 17.70/3.17 | (16) pred_attacker(name_objective) = all_23_0 % 17.70/3.17 | % 17.70/3.17 | DELTA: instantiating (9) with fresh symbols all_25_0, all_25_1 gives: % 17.70/3.17 | (17) tuple_T_out_4(name_objective) = all_25_1 & pred_attacker(all_25_1) = % 17.70/3.17 | all_25_0 & $i(all_25_1) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 17.70/3.17 | [v3: $i] : (all_25_0 = 0 | ~ (tuple_T_in_1(v1) = v3) | ~ % 17.70/3.17 | (tuple_T_in_3(v0) = v2) | ~ (pred_attacker(v3) = 0) | ~ % 17.70/3.17 | (pred_attacker(v2) = 0) | ~ $i(v1) | ~ $i(v0)) % 17.70/3.17 | % 17.70/3.17 | ALPHA: (17) implies: % 17.70/3.17 | (18) pred_attacker(all_25_1) = all_25_0 % 17.70/3.17 | (19) tuple_T_out_4(name_objective) = all_25_1 % 17.70/3.17 | (20) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (all_25_0 = 0 % 17.70/3.17 | | ~ (tuple_T_in_1(v1) = v3) | ~ (tuple_T_in_3(v0) = v2) | ~ % 17.70/3.17 | (pred_attacker(v3) = 0) | ~ (pred_attacker(v2) = 0) | ~ $i(v1) | % 17.70/3.17 | ~ $i(v0)) % 17.70/3.17 | % 17.70/3.17 | GROUND_INST: instantiating (5) with constr_CONST_1, simplifying with (7), (8) % 17.70/3.17 | gives: % 17.70/3.17 | (21) ? [v0: $i] : (tuple_T_in_3(constr_CONST_1) = v0 & pred_attacker(v0) = % 17.70/3.17 | 0 & $i(v0)) % 17.70/3.17 | % 17.70/3.17 | GROUND_INST: instantiating (4) with name_objective, all_23_0, simplifying with % 17.70/3.17 | (10), (16) gives: % 17.70/3.17 | (22) all_23_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 17.70/3.17 | tuple_T_out_4(name_objective) = v0 & pred_attacker(v0) = v1 & % 17.70/3.17 | $i(v0)) % 17.70/3.17 | % 17.70/3.17 | GROUND_INST: instantiating (6) with tuple_false, simplifying with (1), (2) % 17.70/3.17 | gives: % 17.70/3.17 | (23) ? [v0: $i] : (tuple_T_in_1(tuple_false) = v0 & pred_attacker(v0) = 0 % 17.70/3.17 | & $i(v0)) % 17.70/3.17 | % 17.70/3.17 | GROUND_INST: instantiating (3) with name_objective, all_25_1, simplifying with % 17.70/3.17 | (10), (19) gives: % 17.70/3.17 | (24) ? [v0: any] : ? [v1: any] : (pred_attacker(all_25_1) = v0 & % 17.70/3.17 | pred_attacker(name_objective) = v1 & ( ~ (v0 = 0) | v1 = 0)) % 17.70/3.17 | % 17.70/3.17 | DELTA: instantiating (23) with fresh symbol all_67_0 gives: % 17.70/3.17 | (25) tuple_T_in_1(tuple_false) = all_67_0 & pred_attacker(all_67_0) = 0 & % 17.70/3.17 | $i(all_67_0) % 17.70/3.17 | % 17.70/3.17 | ALPHA: (25) implies: % 17.70/3.17 | (26) pred_attacker(all_67_0) = 0 % 17.70/3.17 | (27) tuple_T_in_1(tuple_false) = all_67_0 % 17.70/3.17 | % 17.70/3.17 | DELTA: instantiating (21) with fresh symbol all_97_0 gives: % 17.70/3.17 | (28) tuple_T_in_3(constr_CONST_1) = all_97_0 & pred_attacker(all_97_0) = 0 % 17.70/3.17 | & $i(all_97_0) % 17.70/3.17 | % 17.70/3.17 | ALPHA: (28) implies: % 17.70/3.17 | (29) pred_attacker(all_97_0) = 0 % 17.70/3.17 | (30) tuple_T_in_3(constr_CONST_1) = all_97_0 % 17.70/3.17 | % 17.70/3.17 | DELTA: instantiating (24) with fresh symbols all_123_0, all_123_1 gives: % 17.70/3.17 | (31) pred_attacker(all_25_1) = all_123_1 & pred_attacker(name_objective) = % 17.70/3.17 | all_123_0 & ( ~ (all_123_1 = 0) | all_123_0 = 0) % 17.70/3.17 | % 17.70/3.17 | ALPHA: (31) implies: % 17.70/3.17 | (32) pred_attacker(all_25_1) = all_123_1 % 17.70/3.17 | % 17.70/3.17 | BETA: splitting (22) gives: % 17.70/3.17 | % 17.70/3.17 | Case 1: % 17.70/3.17 | | % 17.70/3.17 | | (33) all_23_0 = 0 % 17.70/3.17 | | % 17.70/3.17 | | REDUCE: (15), (33) imply: % 17.70/3.17 | | (34) $false % 17.70/3.18 | | % 17.70/3.18 | | CLOSE: (34) is inconsistent. % 17.70/3.18 | | % 17.70/3.18 | Case 2: % 17.70/3.18 | | % 17.70/3.18 | | (35) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 17.70/3.18 | | tuple_T_out_4(name_objective) = v0 & pred_attacker(v0) = v1 & % 17.70/3.18 | | $i(v0)) % 17.70/3.18 | | % 17.70/3.18 | | DELTA: instantiating (35) with fresh symbols all_129_0, all_129_1 gives: % 17.70/3.18 | | (36) ~ (all_129_0 = 0) & tuple_T_out_4(name_objective) = all_129_1 & % 17.70/3.18 | | pred_attacker(all_129_1) = all_129_0 & $i(all_129_1) % 17.70/3.18 | | % 17.70/3.18 | | ALPHA: (36) implies: % 17.70/3.18 | | (37) ~ (all_129_0 = 0) % 17.70/3.18 | | (38) pred_attacker(all_129_1) = all_129_0 % 17.70/3.18 | | (39) tuple_T_out_4(name_objective) = all_129_1 % 17.70/3.18 | | % 17.70/3.18 | | GROUND_INST: instantiating (12) with all_25_0, all_123_1, all_25_1, % 17.70/3.18 | | simplifying with (18), (32) gives: % 17.70/3.18 | | (40) all_123_1 = all_25_0 % 17.70/3.18 | | % 17.70/3.18 | | GROUND_INST: instantiating (13) with all_25_1, all_129_1, name_objective, % 17.70/3.18 | | simplifying with (19), (39) gives: % 17.70/3.18 | | (41) all_129_1 = all_25_1 % 17.70/3.18 | | % 17.70/3.18 | | REDUCE: (38), (41) imply: % 17.70/3.18 | | (42) pred_attacker(all_25_1) = all_129_0 % 17.70/3.18 | | % 17.70/3.18 | | GROUND_INST: instantiating (12) with all_25_0, all_129_0, all_25_1, % 17.70/3.18 | | simplifying with (18), (42) gives: % 17.70/3.18 | | (43) all_129_0 = all_25_0 % 17.70/3.18 | | % 17.70/3.18 | | REDUCE: (37), (43) imply: % 17.70/3.18 | | (44) ~ (all_25_0 = 0) % 17.70/3.18 | | % 17.70/3.18 | | GROUND_INST: instantiating (20) with constr_CONST_1, tuple_false, all_97_0, % 17.70/3.18 | | all_67_0, simplifying with (1), (7), (26), (27), (29), (30) % 17.70/3.18 | | gives: % 17.70/3.18 | | (45) all_25_0 = 0 % 17.70/3.18 | | % 17.70/3.18 | | REDUCE: (44), (45) imply: % 17.70/3.18 | | (46) $false % 17.70/3.18 | | % 17.70/3.18 | | CLOSE: (46) is inconsistent. % 17.70/3.18 | | % 17.70/3.18 | End of split % 17.70/3.18 | % 17.70/3.18 End of proof % 17.70/3.18 % SZS output end Proof for theBenchmark % 17.70/3.18 % 17.70/3.18 2589ms %------------------------------------------------------------------------------