%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET148+4 : TPTP v8.1.2. Released v2.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n008.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 15:24:02 EDT 2023 % Result : Theorem 6.32s 1.64s % Output : Proof 8.03s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET148+4 : TPTP v8.1.2. Released v2.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n008.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sat Aug 26 10:42:02 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.65 ________ _____ % 0.20/0.65 ___ __ \_________(_)________________________________ % 0.20/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.65 % 0.20/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.65 (2023-06-19) % 0.20/0.65 % 0.20/0.65 (c) Philipp Rümmer, 2009-2023 % 0.20/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.65 Amanda Stjerna. % 0.20/0.65 Free software under BSD-3-Clause. % 0.20/0.65 % 0.20/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.65 % 0.20/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.67 Running up to 7 provers in parallel. % 0.20/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.34/1.05 Prover 4: Preprocessing ... % 2.34/1.05 Prover 1: Preprocessing ... % 2.34/1.09 Prover 0: Preprocessing ... % 2.34/1.09 Prover 3: Preprocessing ... % 2.34/1.09 Prover 5: Preprocessing ... % 2.34/1.11 Prover 2: Preprocessing ... % 2.34/1.11 Prover 6: Preprocessing ... % 4.71/1.45 Prover 5: Proving ... % 4.71/1.45 Prover 6: Proving ... % 5.30/1.50 Prover 3: Constructing countermodel ... % 5.30/1.50 Prover 2: Proving ... % 5.30/1.51 Prover 1: Constructing countermodel ... % 5.30/1.53 Prover 4: Constructing countermodel ... % 5.30/1.54 Prover 0: Proving ... % 6.32/1.63 Prover 3: proved (946ms) % 6.32/1.63 % 6.32/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.32/1.64 % 6.32/1.64 Prover 2: stopped % 6.32/1.64 Prover 0: stopped % 6.32/1.64 Prover 6: stopped % 6.32/1.65 Prover 5: stopped % 6.32/1.66 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.32/1.66 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.32/1.66 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.32/1.66 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.32/1.66 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.32/1.69 Prover 7: Preprocessing ... % 6.32/1.69 Prover 11: Preprocessing ... % 6.32/1.69 Prover 8: Preprocessing ... % 6.92/1.71 Prover 13: Preprocessing ... % 6.92/1.71 Prover 10: Preprocessing ... % 6.92/1.74 Prover 1: Found proof (size 45) % 6.92/1.74 Prover 1: proved (1055ms) % 6.92/1.74 Prover 4: stopped % 6.92/1.75 Prover 13: stopped % 6.92/1.75 Prover 7: Warning: ignoring some quantifiers % 6.92/1.76 Prover 10: Warning: ignoring some quantifiers % 6.92/1.76 Prover 11: stopped % 6.92/1.77 Prover 10: Constructing countermodel ... % 6.92/1.77 Prover 7: Constructing countermodel ... % 6.92/1.78 Prover 10: stopped % 7.49/1.78 Prover 7: stopped % 7.49/1.78 Prover 8: Warning: ignoring some quantifiers % 7.49/1.79 Prover 8: Constructing countermodel ... % 7.49/1.80 Prover 8: stopped % 7.49/1.80 % 7.49/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.49/1.80 % 7.49/1.80 % SZS output start Proof for theBenchmark % 7.49/1.81 Assumptions after simplification: % 7.49/1.81 --------------------------------- % 7.49/1.81 % 7.49/1.81 (equal_set) % 7.49/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (equal_set(v0, v1) = % 7.49/1.84 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : (subset(v1, % 7.49/1.84 v0) = v4 & subset(v0, v1) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0)))) & ! [v0: % 7.49/1.84 $i] : ! [v1: $i] : ( ~ (equal_set(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | % 7.49/1.84 (subset(v1, v0) = 0 & subset(v0, v1) = 0)) % 7.49/1.84 % 7.49/1.84 (intersection) % 7.49/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 7.49/1.84 | ~ (intersection(v1, v2) = v3) | ~ (member(v0, v3) = v4) | ~ $i(v2) | ~ % 7.49/1.84 $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (member(v0, v2) = v6 & % 7.49/1.84 member(v0, v1) = v5 & ( ~ (v6 = 0) | ~ (v5 = 0)))) & ! [v0: $i] : ! % 7.49/1.84 [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (intersection(v1, v2) = v3) | ~ % 7.49/1.84 (member(v0, v3) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (member(v0, v2) = % 7.49/1.84 0 & member(v0, v1) = 0)) % 7.49/1.84 % 7.49/1.84 (subset) % 7.49/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) % 7.49/1.84 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & % 7.49/1.84 member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! % 7.49/1.84 [v1: $i] : ( ~ (subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ( % 7.49/1.84 ~ (member(v2, v0) = 0) | ~ $i(v2) | member(v2, v1) = 0)) % 7.49/1.84 % 7.49/1.84 (thI13) % 7.49/1.85 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & intersection(v0, v0) % 7.49/1.85 = v1 & equal_set(v1, v0) = v2 & $i(v1) & $i(v0)) % 7.49/1.85 % 7.49/1.85 (function-axioms) % 7.49/1.85 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.49/1.85 (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0: % 7.49/1.85 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.49/1.85 (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) & ! [v0: $i] : ! % 7.49/1.85 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (union(v3, v2) = v1) | ~ % 7.49/1.85 (union(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 7.49/1.85 $i] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = % 7.49/1.85 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 7.49/1.85 $i] : ! [v3: $i] : (v1 = v0 | ~ (equal_set(v3, v2) = v1) | ~ % 7.49/1.85 (equal_set(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.49/1.85 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (subset(v3, % 7.49/1.85 v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 7.49/1.85 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.49/1.85 (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & ! [v0: $i] : ! [v1: % 7.49/1.85 $i] : ! [v2: $i] : (v1 = v0 | ~ (product(v2) = v1) | ~ (product(v2) = % 7.49/1.85 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (sum(v2) = % 7.49/1.85 v1) | ~ (sum(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 7.49/1.85 v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0: $i] : ! % 7.49/1.85 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (power_set(v2) = v1) | ~ % 7.49/1.85 (power_set(v2) = v0)) % 7.49/1.85 % 7.49/1.85 Further assumptions not needed in the proof: % 7.49/1.85 -------------------------------------------- % 7.49/1.85 difference, empty_set, power_set, product, singleton, sum, union, unordered_pair % 7.49/1.85 % 7.49/1.85 Those formulas are unsatisfiable: % 7.49/1.85 --------------------------------- % 7.49/1.85 % 7.49/1.85 Begin of proof % 7.49/1.85 | % 7.49/1.85 | ALPHA: (subset) implies: % 7.49/1.86 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) % 7.49/1.86 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ % 7.49/1.86 | (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) % 7.49/1.86 | % 7.49/1.86 | ALPHA: (equal_set) implies: % 7.49/1.86 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (equal_set(v0, % 7.49/1.86 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : % 7.49/1.86 | (subset(v1, v0) = v4 & subset(v0, v1) = v3 & ( ~ (v4 = 0) | ~ (v3 = % 7.49/1.86 | 0)))) % 7.49/1.86 | % 7.49/1.86 | ALPHA: (intersection) implies: % 7.49/1.86 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 7.49/1.86 | (intersection(v1, v2) = v3) | ~ (member(v0, v3) = 0) | ~ $i(v2) | % 7.49/1.86 | ~ $i(v1) | ~ $i(v0) | (member(v0, v2) = 0 & member(v0, v1) = 0)) % 7.49/1.86 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : % 7.49/1.86 | (v4 = 0 | ~ (intersection(v1, v2) = v3) | ~ (member(v0, v3) = v4) | % 7.49/1.86 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : % 7.49/1.86 | (member(v0, v2) = v6 & member(v0, v1) = v5 & ( ~ (v6 = 0) | ~ (v5 = % 7.49/1.86 | 0)))) % 7.49/1.86 | % 7.49/1.86 | ALPHA: (function-axioms) implies: % 7.49/1.86 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.49/1.86 | ! [v3: $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) % 7.49/1.86 | = v0)) % 7.49/1.86 | % 7.49/1.86 | DELTA: instantiating (thI13) with fresh symbols all_15_0, all_15_1, all_15_2 % 7.49/1.86 | gives: % 7.49/1.86 | (6) ~ (all_15_0 = 0) & intersection(all_15_2, all_15_2) = all_15_1 & % 7.49/1.86 | equal_set(all_15_1, all_15_2) = all_15_0 & $i(all_15_1) & $i(all_15_2) % 7.49/1.86 | % 7.49/1.86 | ALPHA: (6) implies: % 7.49/1.86 | (7) ~ (all_15_0 = 0) % 7.49/1.86 | (8) $i(all_15_2) % 7.49/1.86 | (9) $i(all_15_1) % 7.49/1.86 | (10) equal_set(all_15_1, all_15_2) = all_15_0 % 7.49/1.87 | (11) intersection(all_15_2, all_15_2) = all_15_1 % 7.49/1.87 | % 7.49/1.87 | GROUND_INST: instantiating (2) with all_15_1, all_15_2, all_15_0, simplifying % 7.49/1.87 | with (8), (9), (10) gives: % 7.49/1.87 | (12) all_15_0 = 0 | ? [v0: any] : ? [v1: any] : (subset(all_15_1, % 7.49/1.87 | all_15_2) = v0 & subset(all_15_2, all_15_1) = v1 & ( ~ (v1 = 0) | % 7.49/1.87 | ~ (v0 = 0))) % 7.49/1.87 | % 7.49/1.87 | BETA: splitting (12) gives: % 7.49/1.87 | % 7.49/1.87 | Case 1: % 7.49/1.87 | | % 7.49/1.87 | | (13) all_15_0 = 0 % 7.49/1.87 | | % 7.49/1.87 | | REDUCE: (7), (13) imply: % 7.49/1.87 | | (14) $false % 7.49/1.87 | | % 7.49/1.87 | | CLOSE: (14) is inconsistent. % 7.49/1.87 | | % 7.49/1.87 | Case 2: % 7.49/1.87 | | % 7.49/1.87 | | (15) ? [v0: any] : ? [v1: any] : (subset(all_15_1, all_15_2) = v0 & % 7.49/1.87 | | subset(all_15_2, all_15_1) = v1 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 7.49/1.87 | | % 7.49/1.87 | | DELTA: instantiating (15) with fresh symbols all_24_0, all_24_1 gives: % 7.49/1.87 | | (16) subset(all_15_1, all_15_2) = all_24_1 & subset(all_15_2, all_15_1) = % 7.49/1.87 | | all_24_0 & ( ~ (all_24_0 = 0) | ~ (all_24_1 = 0)) % 7.49/1.87 | | % 7.49/1.87 | | ALPHA: (16) implies: % 7.49/1.87 | | (17) subset(all_15_2, all_15_1) = all_24_0 % 7.49/1.87 | | (18) subset(all_15_1, all_15_2) = all_24_1 % 7.49/1.87 | | (19) ~ (all_24_0 = 0) | ~ (all_24_1 = 0) % 7.49/1.87 | | % 7.49/1.87 | | GROUND_INST: instantiating (1) with all_15_2, all_15_1, all_24_0, % 7.49/1.87 | | simplifying with (8), (9), (17) gives: % 7.49/1.87 | | (20) all_24_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 7.49/1.87 | | member(v0, all_15_1) = v1 & member(v0, all_15_2) = 0 & $i(v0)) % 7.49/1.87 | | % 7.94/1.87 | | GROUND_INST: instantiating (1) with all_15_1, all_15_2, all_24_1, % 7.94/1.87 | | simplifying with (8), (9), (18) gives: % 7.94/1.87 | | (21) all_24_1 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 7.94/1.87 | | member(v0, all_15_1) = 0 & member(v0, all_15_2) = v1 & $i(v0)) % 7.94/1.87 | | % 7.94/1.87 | | BETA: splitting (19) gives: % 7.94/1.87 | | % 7.94/1.87 | | Case 1: % 7.94/1.87 | | | % 7.94/1.87 | | | (22) ~ (all_24_0 = 0) % 7.94/1.87 | | | % 7.94/1.87 | | | BETA: splitting (20) gives: % 7.94/1.87 | | | % 7.94/1.87 | | | Case 1: % 7.94/1.87 | | | | % 7.94/1.87 | | | | (23) all_24_0 = 0 % 7.94/1.87 | | | | % 7.94/1.87 | | | | REDUCE: (22), (23) imply: % 7.94/1.87 | | | | (24) $false % 7.94/1.87 | | | | % 7.94/1.87 | | | | CLOSE: (24) is inconsistent. % 7.94/1.87 | | | | % 7.94/1.87 | | | Case 2: % 7.94/1.87 | | | | % 7.94/1.88 | | | | (25) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_15_1) % 7.94/1.88 | | | | = v1 & member(v0, all_15_2) = 0 & $i(v0)) % 7.94/1.88 | | | | % 7.94/1.88 | | | | DELTA: instantiating (25) with fresh symbols all_37_0, all_37_1 gives: % 7.94/1.88 | | | | (26) ~ (all_37_0 = 0) & member(all_37_1, all_15_1) = all_37_0 & % 7.94/1.88 | | | | member(all_37_1, all_15_2) = 0 & $i(all_37_1) % 7.94/1.88 | | | | % 7.94/1.88 | | | | ALPHA: (26) implies: % 7.94/1.88 | | | | (27) ~ (all_37_0 = 0) % 7.94/1.88 | | | | (28) $i(all_37_1) % 7.94/1.88 | | | | (29) member(all_37_1, all_15_2) = 0 % 7.94/1.88 | | | | (30) member(all_37_1, all_15_1) = all_37_0 % 7.94/1.88 | | | | % 7.94/1.88 | | | | GROUND_INST: instantiating (4) with all_37_1, all_15_2, all_15_2, % 7.94/1.88 | | | | all_15_1, all_37_0, simplifying with (8), (11), (28), (30) % 7.94/1.88 | | | | gives: % 7.94/1.88 | | | | (31) all_37_0 = 0 | ? [v0: any] : ? [v1: any] : (member(all_37_1, % 7.94/1.88 | | | | all_15_2) = v1 & member(all_37_1, all_15_2) = v0 & ( ~ (v1 = % 7.94/1.88 | | | | 0) | ~ (v0 = 0))) % 7.94/1.88 | | | | % 7.94/1.88 | | | | BETA: splitting (31) gives: % 7.94/1.88 | | | | % 7.94/1.88 | | | | Case 1: % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | (32) all_37_0 = 0 % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | REDUCE: (27), (32) imply: % 7.94/1.88 | | | | | (33) $false % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | CLOSE: (33) is inconsistent. % 7.94/1.88 | | | | | % 7.94/1.88 | | | | Case 2: % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | (34) ? [v0: any] : ? [v1: any] : (member(all_37_1, all_15_2) = v1 % 7.94/1.88 | | | | | & member(all_37_1, all_15_2) = v0 & ( ~ (v1 = 0) | ~ (v0 = % 7.94/1.88 | | | | | 0))) % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | DELTA: instantiating (34) with fresh symbols all_52_0, all_52_1 gives: % 7.94/1.88 | | | | | (35) member(all_37_1, all_15_2) = all_52_0 & member(all_37_1, % 7.94/1.88 | | | | | all_15_2) = all_52_1 & ( ~ (all_52_0 = 0) | ~ (all_52_1 = % 7.94/1.88 | | | | | 0)) % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | ALPHA: (35) implies: % 7.94/1.88 | | | | | (36) member(all_37_1, all_15_2) = all_52_1 % 7.94/1.88 | | | | | (37) member(all_37_1, all_15_2) = all_52_0 % 7.94/1.88 | | | | | (38) ~ (all_52_0 = 0) | ~ (all_52_1 = 0) % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | GROUND_INST: instantiating (5) with 0, all_52_0, all_15_2, all_37_1, % 7.94/1.88 | | | | | simplifying with (29), (37) gives: % 7.94/1.88 | | | | | (39) all_52_0 = 0 % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | GROUND_INST: instantiating (5) with all_52_1, all_52_0, all_15_2, % 7.94/1.88 | | | | | all_37_1, simplifying with (36), (37) gives: % 7.94/1.88 | | | | | (40) all_52_0 = all_52_1 % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | COMBINE_EQS: (39), (40) imply: % 7.94/1.88 | | | | | (41) all_52_1 = 0 % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | BETA: splitting (38) gives: % 7.94/1.88 | | | | | % 7.94/1.88 | | | | | Case 1: % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | | (42) ~ (all_52_0 = 0) % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | | REDUCE: (39), (42) imply: % 7.94/1.88 | | | | | | (43) $false % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | | CLOSE: (43) is inconsistent. % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | Case 2: % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | | (44) ~ (all_52_1 = 0) % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | | REDUCE: (41), (44) imply: % 7.94/1.88 | | | | | | (45) $false % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | | CLOSE: (45) is inconsistent. % 7.94/1.88 | | | | | | % 7.94/1.88 | | | | | End of split % 7.94/1.88 | | | | | % 7.94/1.88 | | | | End of split % 7.94/1.88 | | | | % 7.94/1.88 | | | End of split % 7.94/1.88 | | | % 7.94/1.88 | | Case 2: % 7.94/1.88 | | | % 7.94/1.88 | | | (46) ~ (all_24_1 = 0) % 7.94/1.88 | | | % 7.94/1.88 | | | BETA: splitting (21) gives: % 7.94/1.88 | | | % 7.94/1.88 | | | Case 1: % 7.94/1.88 | | | | % 7.94/1.88 | | | | (47) all_24_1 = 0 % 7.94/1.88 | | | | % 7.94/1.89 | | | | REDUCE: (46), (47) imply: % 7.94/1.89 | | | | (48) $false % 7.94/1.89 | | | | % 7.94/1.89 | | | | CLOSE: (48) is inconsistent. % 7.94/1.89 | | | | % 7.94/1.89 | | | Case 2: % 7.94/1.89 | | | | % 7.94/1.89 | | | | (49) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_15_1) % 7.94/1.89 | | | | = 0 & member(v0, all_15_2) = v1 & $i(v0)) % 7.94/1.89 | | | | % 7.94/1.89 | | | | DELTA: instantiating (49) with fresh symbols all_37_0, all_37_1 gives: % 7.94/1.89 | | | | (50) ~ (all_37_0 = 0) & member(all_37_1, all_15_1) = 0 & % 7.94/1.89 | | | | member(all_37_1, all_15_2) = all_37_0 & $i(all_37_1) % 7.94/1.89 | | | | % 7.94/1.89 | | | | ALPHA: (50) implies: % 7.94/1.89 | | | | (51) ~ (all_37_0 = 0) % 7.94/1.89 | | | | (52) $i(all_37_1) % 7.94/1.89 | | | | (53) member(all_37_1, all_15_2) = all_37_0 % 7.94/1.89 | | | | (54) member(all_37_1, all_15_1) = 0 % 7.94/1.89 | | | | % 7.94/1.89 | | | | GROUND_INST: instantiating (3) with all_37_1, all_15_2, all_15_2, % 7.94/1.89 | | | | all_15_1, simplifying with (8), (11), (52), (54) gives: % 7.94/1.89 | | | | (55) member(all_37_1, all_15_2) = 0 % 7.94/1.89 | | | | % 7.94/1.89 | | | | GROUND_INST: instantiating (5) with all_37_0, 0, all_15_2, all_37_1, % 7.94/1.89 | | | | simplifying with (53), (55) gives: % 7.94/1.89 | | | | (56) all_37_0 = 0 % 7.94/1.89 | | | | % 7.94/1.89 | | | | REDUCE: (51), (56) imply: % 7.94/1.89 | | | | (57) $false % 7.94/1.89 | | | | % 7.94/1.89 | | | | CLOSE: (57) is inconsistent. % 7.94/1.89 | | | | % 7.94/1.89 | | | End of split % 7.94/1.89 | | | % 7.94/1.89 | | End of split % 7.94/1.89 | | % 7.94/1.89 | End of split % 7.94/1.89 | % 7.94/1.89 End of proof % 8.03/1.89 % SZS output end Proof for theBenchmark % 8.03/1.89 % 8.03/1.89 1237ms %------------------------------------------------------------------------------