%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 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 : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:17:30 AM UTC 2026 % Result : Theorem 14.18s 2.67s % Output : Proof 19.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.03 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.35 % Computer : n031.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 14:20:11 UTC 2026 % 0.09/0.36 % CPUTime : % 0.12/0.37 OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release. % 0.67/0.72 ________ _____ % 0.67/0.72 ___ __ \_________(_)________________________________ % 0.67/0.72 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.67/0.72 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.67/0.72 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.67/0.72 % 0.67/0.72 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.67/0.72 (2023-06-19) % 0.67/0.72 % 0.67/0.72 (c) Philipp Rümmer, 2009-2023 % 0.67/0.72 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.67/0.72 Amanda Stjerna. % 0.67/0.72 Free software under BSD-3-Clause. % 0.67/0.72 % 0.67/0.72 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.67/0.72 % 0.67/0.72 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.67/0.74 Running up to 7 provers in parallel. % 0.67/0.76 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.76 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.76 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.76 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.76 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.76 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.76 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.76/1.41 Prover 3: Preprocessing ... % 4.76/1.41 Prover 0: Preprocessing ... % 4.76/1.41 Prover 5: Preprocessing ... % 4.76/1.41 Prover 2: Preprocessing ... % 4.76/1.41 Prover 6: Preprocessing ... % 4.76/1.42 Prover 1: Preprocessing ... % 4.76/1.43 Prover 4: Preprocessing ... % 10.67/2.19 Prover 2: Proving ... % 10.67/2.19 Prover 5: Proving ... % 11.02/2.25 Prover 3: Constructing countermodel ... % 11.02/2.29 Prover 6: Proving ... % 11.81/2.32 Prover 1: Constructing countermodel ... % 11.81/2.37 Prover 0: Proving ... % 12.60/2.42 Prover 4: Constructing countermodel ... % 14.18/2.66 Prover 3: proved (1907ms) % 14.18/2.67 % 14.18/2.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.18/2.67 % 14.18/2.67 Prover 6: stopped % 14.18/2.67 Prover 2: stopped % 14.18/2.67 Prover 5: stopped % 14.18/2.68 Prover 0: stopped % 14.18/2.69 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.18/2.69 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.18/2.69 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.18/2.69 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.18/2.69 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 14.97/2.79 Prover 11: Preprocessing ... % 15.77/2.81 Prover 13: Preprocessing ... % 15.77/2.83 Prover 7: Preprocessing ... % 15.77/2.88 Prover 10: Preprocessing ... % 15.77/2.88 Prover 8: Preprocessing ... % 16.58/2.98 Prover 10: Warning: ignoring some quantifiers % 16.58/3.00 Prover 10: Constructing countermodel ... % 17.76/3.07 Prover 7: Warning: ignoring some quantifiers % 17.76/3.08 Prover 7: Constructing countermodel ... % 17.76/3.09 Prover 13: Warning: ignoring some quantifiers % 17.76/3.11 Prover 1: Found proof (size 32) % 17.76/3.11 Prover 1: proved (2353ms) % 17.76/3.11 Prover 4: stopped % 17.76/3.11 Prover 10: stopped % 17.76/3.12 Prover 13: Constructing countermodel ... % 17.76/3.12 Prover 7: stopped % 17.76/3.15 Prover 13: stopped % 18.72/3.24 Prover 11: Constructing countermodel ... % 18.72/3.26 Prover 8: Warning: ignoring some quantifiers % 18.72/3.27 Prover 8: Constructing countermodel ... % 18.72/3.28 Prover 11: stopped % 19.29/3.30 Prover 8: stopped % 19.29/3.31 % 19.29/3.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.29/3.31 % 19.29/3.31 % SZS output start Proof for theBenchmark % 19.29/3.32 Assumptions after simplification: % 19.29/3.32 --------------------------------- % 19.29/3.32 % 19.29/3.32 (distinct) % 19.29/3.34 ~ (v601 = v600) & ~ (v601 = v500) & ~ (v601 = v300) & ~ (v601 = v32) & ~ % 19.29/3.34 (v601 = v16) & ~ (v601 = v0) & ~ (v600 = v500) & ~ (v600 = v300) & ~ (v600 % 19.29/3.34 = v32) & ~ (v600 = v16) & ~ (v600 = v0) & ~ (v500 = v300) & ~ (v500 = % 19.29/3.34 v32) & ~ (v500 = v16) & ~ (v500 = v0) & ~ (v300 = v32) & ~ (v300 = v16) % 19.29/3.34 & ~ (v300 = v0) & ~ (v32 = v16) & ~ (v32 = v0) & ~ (v16 = v0) & $i(v601) & % 19.29/3.34 $i(v600) & $i(v500) & $i(v300) & $i(v32) & $i(v16) & $i(v0) % 19.29/3.34 % 19.29/3.34 (in_closed) % 19.76/3.40 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 19.76/3.40 (in_closed(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 19.76/3.40 any] : ? [v5: any] : (leq(v1, v0) = v4 & leq(v0, v2) = v5 & ( ~ (v5 = 0) % 19.76/3.40 | ~ (v4 = 0)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 19.76/3.40 (in_closed(v0, v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v1, % 19.76/3.40 v0) = 0 & leq(v0, v2) = 0)) % 19.76/3.40 % 19.76/3.40 (leq_antisym) % 19.76/3.40 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (leq(v0, v1) = 0) | ~ $i(v1) | ~ % 19.76/3.40 $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & leq(v1, v0) = v2)) % 19.76/3.40 % 19.76/3.40 (odrl411) % 19.76/3.41 $i(v601) & $i(v600) & $i(v500) & $i(v300) & $i(v32) & $i(v16) & $i(v0) & ? % 19.76/3.41 [v0: $i] : ? [v1: $i] : ? [v2: $i] : (in_open(v1, v0, v500) = 0 & % 19.76/3.41 in_lopen(v2, v0, v32) = 0 & in_closed(v0, v601, v601) = 0 & in_closed(v0, % 19.76/3.41 v600, v600) = 0 & leq(v16, v2) = 0 & less(v300, v1) = 0 & $i(v2) & $i(v1) % 19.76/3.41 & $i(v0)) % 19.76/3.41 % 19.76/3.41 (function-axioms) % 19.76/3.43 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 19.76/3.43 [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_subsumes(v5, v4, % 19.76/3.43 v3, v2) = v1) | ~ (axis_subsumes(v5, v4, v3, v2) = v0)) & ! [v0: % 19.76/3.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.76/3.43 : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_compatible(v5, v4, v3, v2) = % 19.76/3.43 v1) | ~ (axis_compatible(v5, v4, v3, v2) = v0)) & ! [v0: % 19.76/3.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.76/3.43 : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_conflict(v5, v4, v3, v2) = % 19.76/3.43 v1) | ~ (axis_conflict(v5, v4, v3, v2) = v0)) & ! [v0: % 19.76/3.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.76/3.43 : ! [v4: $i] : (v1 = v0 | ~ (in_open(v4, v3, v2) = v1) | ~ (in_open(v4, v3, % 19.76/3.43 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 19.76/3.43 ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (in_ropen(v4, v3, v2) = % 19.76/3.43 v1) | ~ (in_ropen(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 19.76/3.43 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | % 19.76/3.43 ~ (in_lopen(v4, v3, v2) = v1) | ~ (in_lopen(v4, v3, v2) = v0)) & ! [v0: % 19.76/3.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.76/3.43 : ! [v4: $i] : (v1 = v0 | ~ (in_closed(v4, v3, v2) = v1) | ~ (in_closed(v4, % 19.76/3.43 v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 19.76/3.43 (v1 = v0 | ~ (box_verdict(v3, v2) = v1) | ~ (box_verdict(v3, v2) = v0)) & ! % 19.76/3.43 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 19.76/3.43 $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 19.76/3.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.76/3.43 : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = v0)) & ! [v0: % 19.76/3.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 19.76/3.43 ~ (val(v2) = v1) | ~ (val(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 19.76/3.43 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (is_verdict(v2) = v1) | ~ % 19.76/3.43 (is_verdict(v2) = v0)) % 19.76/3.43 % 19.76/3.43 Further assumptions not needed in the proof: % 19.76/3.43 -------------------------------------------- % 19.76/3.43 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 19.76/3.43 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 19.76/3.43 conflict_is_verdict, in_lopen, in_open, in_ropen, irreflexive, leq_def, % 19.76/3.43 leq_less_trans, leq_trans, less_implies_leq, less_leq_trans, ord_v0_v16, % 19.76/3.43 ord_v0_v300, ord_v0_v32, ord_v0_v500, ord_v0_v600, ord_v0_v601, ord_v16_v300, % 19.76/3.43 ord_v16_v32, ord_v16_v500, ord_v16_v600, ord_v16_v601, ord_v300_v500, % 19.76/3.43 ord_v300_v600, ord_v300_v601, ord_v32_v300, ord_v32_v500, ord_v32_v600, % 19.76/3.43 ord_v32_v601, ord_v500_v600, ord_v500_v601, ord_v600_v601, transitive, % 19.76/3.43 trichotomy, unknown_is_verdict, val_v0, val_v16, val_v300, val_v32, val_v500, % 19.76/3.43 val_v600, val_v601, verdict_enum, verdicts_distinct_cf_cp, % 19.76/3.43 verdicts_distinct_cf_un, verdicts_distinct_cp_un % 19.76/3.43 % 19.76/3.43 Those formulas are unsatisfiable: % 19.76/3.43 --------------------------------- % 19.76/3.43 % 19.76/3.43 Begin of proof % 19.76/3.43 | % 19.76/3.43 | ALPHA: (in_closed) implies: % 19.76/3.44 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (in_closed(v0, v1, v2) = % 19.76/3.44 | 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v1, v0) = 0 & leq(v0, % 19.76/3.44 | v2) = 0)) % 19.76/3.44 | % 19.76/3.44 | ALPHA: (distinct) implies: % 19.76/3.44 | (2) ~ (v601 = v600) % 19.76/3.44 | % 19.76/3.44 | ALPHA: (odrl411) implies: % 19.76/3.44 | (3) $i(v600) % 19.76/3.44 | (4) $i(v601) % 19.76/3.44 | (5) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (in_open(v1, v0, v500) = 0 & % 19.76/3.44 | in_lopen(v2, v0, v32) = 0 & in_closed(v0, v601, v601) = 0 & % 19.76/3.44 | in_closed(v0, v600, v600) = 0 & leq(v16, v2) = 0 & less(v300, v1) = 0 % 19.76/3.44 | & $i(v2) & $i(v1) & $i(v0)) % 19.76/3.44 | % 19.76/3.44 | ALPHA: (function-axioms) implies: % 19.76/3.44 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 19.76/3.45 | ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) % 19.76/3.45 | % 19.76/3.45 | DELTA: instantiating (5) with fresh symbols all_25_0, all_25_1, all_25_2 % 19.76/3.45 | gives: % 19.76/3.45 | (7) in_open(all_25_1, v0, v500) = 0 & in_lopen(all_25_0, v0, v32) = 0 & % 19.76/3.45 | in_closed(all_25_2, v601, v601) = 0 & in_closed(all_25_2, v600, v600) = % 19.76/3.45 | 0 & leq(v16, all_25_0) = 0 & less(v300, all_25_1) = 0 & $i(all_25_0) & % 19.76/3.45 | $i(all_25_1) & $i(all_25_2) % 19.76/3.45 | % 19.76/3.45 | ALPHA: (7) implies: % 19.76/3.45 | (8) $i(all_25_2) % 19.76/3.45 | (9) in_closed(all_25_2, v600, v600) = 0 % 19.76/3.45 | (10) in_closed(all_25_2, v601, v601) = 0 % 19.76/3.45 | % 19.76/3.45 | GROUND_INST: instantiating (1) with all_25_2, v600, v600, simplifying with % 19.76/3.45 | (3), (8), (9) gives: % 19.76/3.45 | (11) leq(all_25_2, v600) = 0 & leq(v600, all_25_2) = 0 % 19.76/3.45 | % 19.76/3.45 | ALPHA: (11) implies: % 19.76/3.45 | (12) leq(v600, all_25_2) = 0 % 19.76/3.45 | (13) leq(all_25_2, v600) = 0 % 19.76/3.45 | % 19.76/3.46 | GROUND_INST: instantiating (1) with all_25_2, v601, v601, simplifying with % 19.76/3.46 | (4), (8), (10) gives: % 19.76/3.46 | (14) leq(all_25_2, v601) = 0 & leq(v601, all_25_2) = 0 % 19.76/3.46 | % 19.76/3.46 | ALPHA: (14) implies: % 19.76/3.46 | (15) leq(v601, all_25_2) = 0 % 19.76/3.46 | (16) leq(all_25_2, v601) = 0 % 19.76/3.46 | % 19.76/3.46 | GROUND_INST: instantiating (leq_antisym) with v601, all_25_2, simplifying with % 19.76/3.46 | (4), (8), (15) gives: % 19.76/3.46 | (17) all_25_2 = v601 | ? [v0: int] : ( ~ (v0 = 0) & leq(all_25_2, v601) = % 19.76/3.46 | v0) % 19.76/3.46 | % 19.76/3.46 | GROUND_INST: instantiating (leq_antisym) with all_25_2, v600, simplifying with % 19.76/3.46 | (3), (8), (13) gives: % 19.76/3.46 | (18) all_25_2 = v600 | ? [v0: int] : ( ~ (v0 = 0) & leq(v600, all_25_2) = % 19.76/3.46 | v0) % 19.76/3.46 | % 19.76/3.46 | BETA: splitting (17) gives: % 19.76/3.46 | % 19.76/3.46 | Case 1: % 19.76/3.46 | | % 19.76/3.46 | | (19) all_25_2 = v601 % 19.76/3.46 | | % 19.76/3.46 | | REDUCE: (12), (19) imply: % 19.76/3.46 | | (20) leq(v600, v601) = 0 % 19.76/3.46 | | % 19.76/3.46 | | BETA: splitting (18) gives: % 19.76/3.46 | | % 19.76/3.46 | | Case 1: % 19.76/3.46 | | | % 19.76/3.46 | | | (21) all_25_2 = v600 % 19.76/3.46 | | | % 19.76/3.46 | | | COMBINE_EQS: (19), (21) imply: % 19.76/3.46 | | | (22) v601 = v600 % 19.76/3.46 | | | % 19.76/3.46 | | | REDUCE: (2), (22) imply: % 19.76/3.47 | | | (23) $false % 19.76/3.47 | | | % 19.76/3.47 | | | CLOSE: (23) is inconsistent. % 19.76/3.47 | | | % 19.76/3.47 | | Case 2: % 19.76/3.47 | | | % 19.76/3.47 | | | (24) ? [v0: int] : ( ~ (v0 = 0) & leq(v600, all_25_2) = v0) % 19.76/3.47 | | | % 19.76/3.47 | | | DELTA: instantiating (24) with fresh symbol all_51_0 gives: % 19.76/3.47 | | | (25) ~ (all_51_0 = 0) & leq(v600, all_25_2) = all_51_0 % 19.76/3.47 | | | % 19.76/3.47 | | | ALPHA: (25) implies: % 19.76/3.47 | | | (26) ~ (all_51_0 = 0) % 19.76/3.47 | | | (27) leq(v600, all_25_2) = all_51_0 % 19.76/3.47 | | | % 19.76/3.47 | | | REDUCE: (19), (27) imply: % 19.76/3.47 | | | (28) leq(v600, v601) = all_51_0 % 19.76/3.47 | | | % 19.76/3.47 | | | GROUND_INST: instantiating (6) with 0, all_51_0, v601, v600, simplifying % 19.76/3.47 | | | with (20), (28) gives: % 19.76/3.47 | | | (29) all_51_0 = 0 % 19.76/3.47 | | | % 19.76/3.47 | | | REDUCE: (26), (29) imply: % 19.76/3.47 | | | (30) $false % 19.76/3.47 | | | % 19.76/3.47 | | | CLOSE: (30) is inconsistent. % 19.76/3.47 | | | % 19.76/3.47 | | End of split % 19.76/3.47 | | % 19.76/3.47 | Case 2: % 19.76/3.47 | | % 19.76/3.47 | | (31) ? [v0: int] : ( ~ (v0 = 0) & leq(all_25_2, v601) = v0) % 19.76/3.47 | | % 19.76/3.47 | | DELTA: instantiating (31) with fresh symbol all_43_0 gives: % 19.76/3.47 | | (32) ~ (all_43_0 = 0) & leq(all_25_2, v601) = all_43_0 % 19.76/3.47 | | % 19.76/3.47 | | ALPHA: (32) implies: % 19.76/3.48 | | (33) ~ (all_43_0 = 0) % 19.76/3.48 | | (34) leq(all_25_2, v601) = all_43_0 % 19.76/3.48 | | % 19.76/3.48 | | GROUND_INST: instantiating (6) with 0, all_43_0, v601, all_25_2, simplifying % 19.76/3.48 | | with (16), (34) gives: % 19.76/3.48 | | (35) all_43_0 = 0 % 19.76/3.48 | | % 19.76/3.48 | | REDUCE: (33), (35) imply: % 19.76/3.48 | | (36) $false % 19.76/3.48 | | % 19.76/3.48 | | CLOSE: (36) is inconsistent. % 19.76/3.48 | | % 19.76/3.48 | End of split % 19.76/3.48 | % 19.76/3.48 End of proof % 19.76/3.48 % SZS output end Proof for theBenchmark % 19.76/3.48 % 19.76/3.48 2754ms %------------------------------------------------------------------------------