%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT080+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 : n020.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:29 AM UTC 2026 % Result : Theorem 16.62s 2.92s % Output : Proof 21.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT080+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.35 % Computer : n020.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:16:28 UTC 2026 % 0.09/0.35 % CPUTime : % 0.14/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.72/0.72 ________ _____ % 0.72/0.72 ___ __ \_________(_)________________________________ % 0.72/0.72 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.72/0.72 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.72/0.72 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.72/0.72 % 0.72/0.72 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.72/0.72 (2023-06-19) % 0.72/0.72 % 0.72/0.72 (c) Philipp Rümmer, 2009-2023 % 0.72/0.72 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.72/0.72 Amanda Stjerna. % 0.72/0.72 Free software under BSD-3-Clause. % 0.72/0.72 % 0.72/0.72 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.72/0.72 % 0.72/0.72 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.72/0.74 Running up to 7 provers in parallel. % 0.72/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.72/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.72/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.72/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.72/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.72/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.72/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.82/1.41 Prover 4: Preprocessing ... % 4.82/1.43 Prover 1: Preprocessing ... % 4.82/1.48 Prover 0: Preprocessing ... % 4.82/1.48 Prover 3: Preprocessing ... % 4.82/1.48 Prover 2: Preprocessing ... % 4.82/1.48 Prover 5: Preprocessing ... % 4.82/1.48 Prover 6: Preprocessing ... % 10.55/2.13 Prover 5: Proving ... % 10.55/2.13 Prover 2: Proving ... % 11.07/2.27 Prover 6: Proving ... % 11.07/2.29 Prover 1: Constructing countermodel ... % 11.07/2.29 Prover 3: Constructing countermodel ... % 12.73/2.42 Prover 4: Constructing countermodel ... % 13.45/2.50 Prover 0: Proving ... % 16.62/2.92 Prover 3: proved (2166ms) % 16.62/2.92 % 16.62/2.92 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.62/2.92 % 16.62/2.92 Prover 5: stopped % 16.62/2.92 Prover 0: stopped % 16.62/2.92 Prover 6: stopped % 16.62/2.92 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 16.62/2.92 Prover 2: stopped % 16.62/2.93 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 16.62/2.93 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 16.62/2.93 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 16.62/2.93 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 17.88/3.08 Prover 11: Preprocessing ... % 17.88/3.08 Prover 8: Preprocessing ... % 17.88/3.09 Prover 7: Preprocessing ... % 17.88/3.10 Prover 13: Preprocessing ... % 17.88/3.11 Prover 10: Preprocessing ... % 18.97/3.28 Prover 10: Warning: ignoring some quantifiers % 18.97/3.28 Prover 7: Warning: ignoring some quantifiers % 18.97/3.29 Prover 10: Constructing countermodel ... % 19.80/3.30 Prover 7: Constructing countermodel ... % 19.80/3.31 Prover 1: Found proof (size 32) % 19.80/3.31 Prover 1: proved (2563ms) % 19.80/3.31 Prover 4: stopped % 19.80/3.33 Prover 10: stopped % 19.80/3.33 Prover 7: stopped % 19.80/3.36 Prover 13: Warning: ignoring some quantifiers % 19.80/3.36 Prover 11: Constructing countermodel ... % 19.80/3.37 Prover 13: Constructing countermodel ... % 19.80/3.38 Prover 11: stopped % 20.49/3.40 Prover 13: stopped % 20.49/3.42 Prover 8: Warning: ignoring some quantifiers % 20.49/3.43 Prover 8: Constructing countermodel ... % 20.49/3.47 Prover 8: stopped % 20.49/3.47 % 20.49/3.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.49/3.47 % 20.49/3.47 % SZS output start Proof for theBenchmark % 20.49/3.48 Assumptions after simplification: % 20.49/3.48 --------------------------------- % 20.49/3.48 % 20.49/3.49 (distinct) % 20.97/3.50 ~ (v800 = v600) & ~ (v800 = v500) & ~ (v800 = v300) & ~ (v800 = v150) & ~ % 20.97/3.50 (v800 = v100) & ~ (v800 = v32) & ~ (v800 = v8) & ~ (v800 = v0) & ~ (v600 = % 20.97/3.50 v500) & ~ (v600 = v300) & ~ (v600 = v150) & ~ (v600 = v100) & ~ (v600 = % 20.97/3.50 v32) & ~ (v600 = v8) & ~ (v600 = v0) & ~ (v500 = v300) & ~ (v500 = v150) % 20.97/3.50 & ~ (v500 = v100) & ~ (v500 = v32) & ~ (v500 = v8) & ~ (v500 = v0) & ~ % 20.97/3.50 (v300 = v150) & ~ (v300 = v100) & ~ (v300 = v32) & ~ (v300 = v8) & ~ (v300 % 20.97/3.50 = v0) & ~ (v150 = v100) & ~ (v150 = v32) & ~ (v150 = v8) & ~ (v150 = v0) % 20.97/3.51 & ~ (v100 = v32) & ~ (v100 = v8) & ~ (v100 = v0) & ~ (v32 = v8) & ~ (v32 % 20.97/3.51 = v0) & ~ (v8 = v0) & $i(v800) & $i(v600) & $i(v500) & $i(v300) & $i(v150) % 20.97/3.51 & $i(v100) & $i(v32) & $i(v8) & $i(v0) % 20.97/3.51 % 20.97/3.51 (in_closed) % 20.97/3.55 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 20.97/3.55 (in_closed(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 20.97/3.55 any] : ? [v5: any] : (leq(v1, v0) = v4 & leq(v0, v2) = v5 & ( ~ (v5 = 0) % 20.97/3.55 | ~ (v4 = 0)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 20.97/3.55 (in_closed(v0, v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v1, % 20.97/3.55 v0) = 0 & leq(v0, v2) = 0)) % 20.97/3.55 % 20.97/3.55 (leq_antisym) % 20.97/3.56 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (leq(v0, v1) = 0) | ~ $i(v1) | ~ % 20.97/3.56 $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & leq(v1, v0) = v2)) % 20.97/3.56 % 20.97/3.56 (odrl365) % 20.97/3.56 $i(v800) & $i(v600) & $i(v500) & $i(v300) & $i(v150) & $i(v100) & $i(v32) & % 20.97/3.56 $i(v8) & $i(v0) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : % 20.97/3.56 (in_open(v1, v0, v500) = 0 & in_lopen(v3, v0, v300) = 0 & in_lopen(v2, v0, % 20.97/3.56 v32) = 0 & in_closed(v0, v800, v800) = 0 & in_closed(v0, v600, v600) = 0 & % 20.97/3.56 leq(v150, v3) = 0 & leq(v8, v2) = 0 & less(v100, v1) = 0 & $i(v3) & $i(v2) & % 20.97/3.56 $i(v1) & $i(v0)) % 20.97/3.56 % 20.97/3.56 (function-axioms) % 20.97/3.57 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 20.97/3.57 [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_subsumes(v5, v4, % 20.97/3.57 v3, v2) = v1) | ~ (axis_subsumes(v5, v4, v3, v2) = v0)) & ! [v0: % 20.97/3.57 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 20.97/3.57 : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_compatible(v5, v4, v3, v2) = % 20.97/3.57 v1) | ~ (axis_compatible(v5, v4, v3, v2) = v0)) & ! [v0: % 20.97/3.57 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 20.97/3.57 : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_conflict(v5, v4, v3, v2) = % 20.97/3.57 v1) | ~ (axis_conflict(v5, v4, v3, v2) = v0)) & ! [v0: % 20.97/3.57 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 20.97/3.57 : ! [v4: $i] : (v1 = v0 | ~ (in_open(v4, v3, v2) = v1) | ~ (in_open(v4, v3, % 20.97/3.57 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 20.97/3.57 ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (in_ropen(v4, v3, v2) = % 20.97/3.57 v1) | ~ (in_ropen(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 20.97/3.57 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | % 20.97/3.57 ~ (in_lopen(v4, v3, v2) = v1) | ~ (in_lopen(v4, v3, v2) = v0)) & ! [v0: % 20.97/3.57 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 20.97/3.57 : ! [v4: $i] : (v1 = v0 | ~ (in_closed(v4, v3, v2) = v1) | ~ (in_closed(v4, % 20.97/3.57 v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 20.97/3.57 (v1 = v0 | ~ (box_verdict(v3, v2) = v1) | ~ (box_verdict(v3, v2) = v0)) & ! % 20.97/3.57 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 20.97/3.57 $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 20.97/3.57 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 20.97/3.57 : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = v0)) & ! [v0: % 20.97/3.57 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 20.97/3.57 ~ (val(v2) = v1) | ~ (val(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 20.97/3.57 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (is_verdict(v2) = v1) | ~ % 20.97/3.57 (is_verdict(v2) = v0)) % 20.97/3.57 % 20.97/3.57 Further assumptions not needed in the proof: % 20.97/3.57 -------------------------------------------- % 20.97/3.58 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 20.97/3.58 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 20.97/3.58 conflict_is_verdict, in_lopen, in_open, in_ropen, irreflexive, leq_def, % 20.97/3.58 leq_less_trans, leq_trans, less_implies_leq, less_leq_trans, ord_v0_v100, % 20.97/3.58 ord_v0_v150, ord_v0_v300, ord_v0_v32, ord_v0_v500, ord_v0_v600, ord_v0_v8, % 20.97/3.58 ord_v0_v800, ord_v100_v150, ord_v100_v300, ord_v100_v500, ord_v100_v600, % 20.97/3.58 ord_v100_v800, ord_v150_v300, ord_v150_v500, ord_v150_v600, ord_v150_v800, % 20.97/3.58 ord_v300_v500, ord_v300_v600, ord_v300_v800, ord_v32_v100, ord_v32_v150, % 20.97/3.58 ord_v32_v300, ord_v32_v500, ord_v32_v600, ord_v32_v800, ord_v500_v600, % 20.97/3.58 ord_v500_v800, ord_v600_v800, ord_v8_v100, ord_v8_v150, ord_v8_v300, ord_v8_v32, % 20.97/3.58 ord_v8_v500, ord_v8_v600, ord_v8_v800, transitive, trichotomy, % 20.97/3.58 unknown_is_verdict, val_v0, val_v100, val_v150, val_v300, val_v32, val_v500, % 20.97/3.58 val_v600, val_v8, val_v800, verdict_enum, verdicts_distinct_cf_cp, % 20.97/3.58 verdicts_distinct_cf_un, verdicts_distinct_cp_un % 20.97/3.58 % 20.97/3.58 Those formulas are unsatisfiable: % 20.97/3.58 --------------------------------- % 20.97/3.58 % 20.97/3.58 Begin of proof % 20.97/3.58 | % 20.97/3.58 | ALPHA: (in_closed) implies: % 20.97/3.58 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (in_closed(v0, v1, v2) = % 20.97/3.58 | 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v1, v0) = 0 & leq(v0, % 20.97/3.58 | v2) = 0)) % 20.97/3.58 | % 20.97/3.58 | ALPHA: (distinct) implies: % 20.97/3.58 | (2) ~ (v800 = v600) % 20.97/3.58 | % 20.97/3.58 | ALPHA: (odrl365) implies: % 20.97/3.58 | (3) $i(v600) % 20.97/3.58 | (4) $i(v800) % 20.97/3.59 | (5) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (in_open(v1, % 20.97/3.59 | v0, v500) = 0 & in_lopen(v3, v0, v300) = 0 & in_lopen(v2, v0, v32) % 20.97/3.59 | = 0 & in_closed(v0, v800, v800) = 0 & in_closed(v0, v600, v600) = 0 & % 20.97/3.59 | leq(v150, v3) = 0 & leq(v8, v2) = 0 & less(v100, v1) = 0 & $i(v3) & % 20.97/3.59 | $i(v2) & $i(v1) & $i(v0)) % 20.97/3.59 | % 20.97/3.59 | ALPHA: (function-axioms) implies: % 20.97/3.59 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 20.97/3.59 | ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) % 20.97/3.59 | % 20.97/3.59 | DELTA: instantiating (5) with fresh symbols all_25_0, all_25_1, all_25_2, % 20.97/3.59 | all_25_3 gives: % 20.97/3.59 | (7) in_open(all_25_2, v0, v500) = 0 & in_lopen(all_25_0, v0, v300) = 0 & % 20.97/3.59 | in_lopen(all_25_1, v0, v32) = 0 & in_closed(all_25_3, v800, v800) = 0 & % 20.97/3.59 | in_closed(all_25_3, v600, v600) = 0 & leq(v150, all_25_0) = 0 & leq(v8, % 20.97/3.59 | all_25_1) = 0 & less(v100, all_25_2) = 0 & $i(all_25_0) & % 20.97/3.59 | $i(all_25_1) & $i(all_25_2) & $i(all_25_3) % 20.97/3.59 | % 20.97/3.59 | ALPHA: (7) implies: % 20.97/3.59 | (8) $i(all_25_3) % 20.97/3.59 | (9) in_closed(all_25_3, v600, v600) = 0 % 20.97/3.59 | (10) in_closed(all_25_3, v800, v800) = 0 % 20.97/3.59 | % 20.97/3.60 | GROUND_INST: instantiating (1) with all_25_3, v600, v600, simplifying with % 20.97/3.60 | (3), (8), (9) gives: % 20.97/3.60 | (11) leq(all_25_3, v600) = 0 & leq(v600, all_25_3) = 0 % 20.97/3.60 | % 21.46/3.60 | ALPHA: (11) implies: % 21.46/3.60 | (12) leq(v600, all_25_3) = 0 % 21.46/3.60 | (13) leq(all_25_3, v600) = 0 % 21.46/3.60 | % 21.46/3.60 | GROUND_INST: instantiating (1) with all_25_3, v800, v800, simplifying with % 21.46/3.60 | (4), (8), (10) gives: % 21.46/3.60 | (14) leq(all_25_3, v800) = 0 & leq(v800, all_25_3) = 0 % 21.46/3.60 | % 21.46/3.60 | ALPHA: (14) implies: % 21.46/3.60 | (15) leq(v800, all_25_3) = 0 % 21.46/3.60 | (16) leq(all_25_3, v800) = 0 % 21.46/3.60 | % 21.46/3.60 | GROUND_INST: instantiating (leq_antisym) with v600, all_25_3, simplifying with % 21.46/3.60 | (3), (8), (12) gives: % 21.46/3.60 | (17) all_25_3 = v600 | ? [v0: int] : ( ~ (v0 = 0) & leq(all_25_3, v600) = % 21.46/3.60 | v0) % 21.46/3.60 | % 21.46/3.60 | GROUND_INST: instantiating (leq_antisym) with v800, all_25_3, simplifying with % 21.46/3.60 | (4), (8), (15) gives: % 21.46/3.60 | (18) all_25_3 = v800 | ? [v0: int] : ( ~ (v0 = 0) & leq(all_25_3, v800) = % 21.46/3.60 | v0) % 21.46/3.60 | % 21.46/3.60 | BETA: splitting (18) gives: % 21.46/3.60 | % 21.46/3.60 | Case 1: % 21.46/3.60 | | % 21.46/3.60 | | (19) all_25_3 = v800 % 21.46/3.60 | | % 21.46/3.60 | | REDUCE: (13), (19) imply: % 21.46/3.60 | | (20) leq(v800, v600) = 0 % 21.46/3.60 | | % 21.46/3.60 | | BETA: splitting (17) gives: % 21.46/3.60 | | % 21.46/3.61 | | Case 1: % 21.46/3.61 | | | % 21.46/3.61 | | | (21) all_25_3 = v600 % 21.46/3.61 | | | % 21.46/3.61 | | | COMBINE_EQS: (19), (21) imply: % 21.46/3.61 | | | (22) v800 = v600 % 21.46/3.61 | | | % 21.46/3.61 | | | REDUCE: (2), (22) imply: % 21.46/3.61 | | | (23) $false % 21.46/3.61 | | | % 21.46/3.61 | | | CLOSE: (23) is inconsistent. % 21.46/3.61 | | | % 21.46/3.61 | | Case 2: % 21.46/3.61 | | | % 21.46/3.61 | | | (24) ? [v0: int] : ( ~ (v0 = 0) & leq(all_25_3, v600) = v0) % 21.46/3.61 | | | % 21.46/3.61 | | | DELTA: instantiating (24) with fresh symbol all_51_0 gives: % 21.46/3.61 | | | (25) ~ (all_51_0 = 0) & leq(all_25_3, v600) = all_51_0 % 21.46/3.61 | | | % 21.46/3.61 | | | ALPHA: (25) implies: % 21.46/3.61 | | | (26) ~ (all_51_0 = 0) % 21.46/3.61 | | | (27) leq(all_25_3, v600) = all_51_0 % 21.46/3.61 | | | % 21.46/3.61 | | | REDUCE: (19), (27) imply: % 21.46/3.61 | | | (28) leq(v800, v600) = all_51_0 % 21.46/3.61 | | | % 21.46/3.61 | | | GROUND_INST: instantiating (6) with 0, all_51_0, v600, v800, simplifying % 21.46/3.61 | | | with (20), (28) gives: % 21.46/3.61 | | | (29) all_51_0 = 0 % 21.46/3.61 | | | % 21.46/3.61 | | | REDUCE: (26), (29) imply: % 21.46/3.61 | | | (30) $false % 21.46/3.61 | | | % 21.46/3.61 | | | CLOSE: (30) is inconsistent. % 21.46/3.61 | | | % 21.46/3.61 | | End of split % 21.46/3.61 | | % 21.46/3.61 | Case 2: % 21.46/3.61 | | % 21.46/3.61 | | (31) ? [v0: int] : ( ~ (v0 = 0) & leq(all_25_3, v800) = v0) % 21.46/3.61 | | % 21.46/3.61 | | DELTA: instantiating (31) with fresh symbol all_43_0 gives: % 21.46/3.62 | | (32) ~ (all_43_0 = 0) & leq(all_25_3, v800) = all_43_0 % 21.46/3.62 | | % 21.46/3.62 | | ALPHA: (32) implies: % 21.46/3.62 | | (33) ~ (all_43_0 = 0) % 21.46/3.62 | | (34) leq(all_25_3, v800) = all_43_0 % 21.46/3.62 | | % 21.46/3.62 | | GROUND_INST: instantiating (6) with 0, all_43_0, v800, all_25_3, simplifying % 21.46/3.62 | | with (16), (34) gives: % 21.46/3.62 | | (35) all_43_0 = 0 % 21.46/3.62 | | % 21.46/3.62 | | REDUCE: (33), (35) imply: % 21.46/3.62 | | (36) $false % 21.46/3.62 | | % 21.46/3.62 | | CLOSE: (36) is inconsistent. % 21.46/3.62 | | % 21.46/3.62 | End of split % 21.46/3.62 | % 21.46/3.62 End of proof % 21.46/3.62 % SZS output end Proof for theBenchmark % 21.46/3.62 % 21.46/3.62 2900ms %------------------------------------------------------------------------------