%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET602+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 : n016.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:25:32 EDT 2023 % Result : Theorem 6.53s 1.62s % Output : Proof 8.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET602+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.17/0.34 % Computer : n016.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Sat Aug 26 09:32:57 EDT 2023 % 0.17/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.63 Running up to 7 provers in parallel. % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.39/1.02 Prover 1: Preprocessing ... % 2.39/1.03 Prover 4: Preprocessing ... % 2.64/1.08 Prover 2: Preprocessing ... % 2.64/1.08 Prover 3: Preprocessing ... % 2.64/1.08 Prover 0: Preprocessing ... % 2.64/1.08 Prover 6: Preprocessing ... % 2.64/1.08 Prover 5: Preprocessing ... % 5.39/1.47 Prover 3: Constructing countermodel ... % 5.39/1.48 Prover 6: Proving ... % 5.39/1.48 Prover 5: Proving ... % 5.39/1.48 Prover 2: Proving ... % 5.39/1.48 Prover 1: Constructing countermodel ... % 5.39/1.49 Prover 4: Constructing countermodel ... % 5.39/1.51 Prover 0: Proving ... % 6.53/1.62 Prover 3: proved (977ms) % 6.53/1.62 % 6.53/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.53/1.62 % 6.53/1.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.53/1.62 Prover 6: stopped % 6.53/1.63 Prover 2: stopped % 6.53/1.63 Prover 0: stopped % 6.53/1.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.53/1.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.53/1.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.53/1.63 Prover 5: stopped % 6.53/1.65 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.53/1.66 Prover 7: Preprocessing ... % 7.14/1.68 Prover 10: Preprocessing ... % 7.14/1.68 Prover 11: Preprocessing ... % 7.14/1.68 Prover 8: Preprocessing ... % 7.19/1.70 Prover 13: Preprocessing ... % 7.41/1.71 Prover 1: Found proof (size 35) % 7.41/1.71 Prover 1: proved (1079ms) % 7.41/1.71 Prover 4: stopped % 7.41/1.72 Prover 11: stopped % 7.53/1.73 Prover 10: Warning: ignoring some quantifiers % 7.53/1.73 Prover 7: Warning: ignoring some quantifiers % 7.53/1.74 Prover 13: stopped % 7.53/1.74 Prover 7: Constructing countermodel ... % 7.53/1.74 Prover 10: Constructing countermodel ... % 7.53/1.75 Prover 7: stopped % 7.53/1.75 Prover 10: stopped % 7.53/1.78 Prover 8: Warning: ignoring some quantifiers % 7.53/1.79 Prover 8: Constructing countermodel ... % 7.53/1.80 Prover 8: stopped % 7.53/1.80 % 7.53/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.53/1.80 % 7.53/1.80 % SZS output start Proof for theBenchmark % 7.53/1.81 Assumptions after simplification: % 7.53/1.81 --------------------------------- % 7.53/1.81 % 7.53/1.81 (difference) % 8.06/1.83 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 8.06/1.83 | ~ (difference(v2, v1) = v3) | ~ (member(v0, v3) = v4) | ~ $i(v2) | ~ % 8.06/1.83 $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (member(v0, v2) = v5 & % 8.06/1.83 member(v0, v1) = v6 & ( ~ (v5 = 0) | v6 = 0))) & ! [v0: $i] : ! [v1: $i] % 8.06/1.83 : ! [v2: $i] : ! [v3: $i] : ( ~ (difference(v2, v1) = v3) | ~ (member(v0, % 8.06/1.83 v3) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = % 8.06/1.83 0) & member(v0, v2) = 0 & member(v0, v1) = v4)) % 8.06/1.83 % 8.06/1.84 (empty_set) % 8.06/1.84 $i(empty_set) & ! [v0: $i] : ( ~ (member(v0, empty_set) = 0) | ~ $i(v0)) % 8.06/1.84 % 8.06/1.84 (equal_set) % 8.06/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (equal_set(v0, v1) = % 8.06/1.84 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : (subset(v1, % 8.06/1.84 v0) = v4 & subset(v0, v1) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0)))) & ! [v0: % 8.06/1.84 $i] : ! [v1: $i] : ( ~ (equal_set(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | % 8.06/1.84 (subset(v1, v0) = 0 & subset(v0, v1) = 0)) % 8.06/1.84 % 8.06/1.84 (subset) % 8.06/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) % 8.06/1.84 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & % 8.06/1.84 member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! % 8.06/1.84 [v1: $i] : ( ~ (subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ( % 8.06/1.84 ~ (member(v2, v0) = 0) | ~ $i(v2) | member(v2, v1) = 0)) % 8.06/1.84 % 8.06/1.84 (thI29) % 8.06/1.84 $i(empty_set) & ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & % 8.06/1.84 difference(v0, v0) = v1 & equal_set(v1, empty_set) = v2 & $i(v1) & $i(v0)) % 8.06/1.84 % 8.06/1.84 (function-axioms) % 8.06/1.85 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 8.06/1.85 (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0: % 8.06/1.85 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 8.06/1.85 (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) & ! [v0: $i] : ! % 8.06/1.85 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (union(v3, v2) = v1) | ~ % 8.06/1.85 (union(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 8.06/1.85 $i] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = % 8.06/1.85 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 8.06/1.85 $i] : ! [v3: $i] : (v1 = v0 | ~ (equal_set(v3, v2) = v1) | ~ % 8.06/1.85 (equal_set(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.06/1.85 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (subset(v3, % 8.06/1.85 v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 8.06/1.85 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 8.06/1.85 (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & ! [v0: $i] : ! [v1: % 8.06/1.85 $i] : ! [v2: $i] : (v1 = v0 | ~ (product(v2) = v1) | ~ (product(v2) = % 8.06/1.85 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (sum(v2) = % 8.06/1.85 v1) | ~ (sum(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 8.06/1.85 v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0: $i] : ! % 8.06/1.85 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (power_set(v2) = v1) | ~ % 8.06/1.85 (power_set(v2) = v0)) % 8.06/1.85 % 8.06/1.85 Further assumptions not needed in the proof: % 8.06/1.85 -------------------------------------------- % 8.06/1.85 intersection, power_set, product, singleton, sum, union, unordered_pair % 8.06/1.85 % 8.06/1.85 Those formulas are unsatisfiable: % 8.06/1.85 --------------------------------- % 8.06/1.85 % 8.06/1.85 Begin of proof % 8.06/1.85 | % 8.06/1.85 | ALPHA: (subset) implies: % 8.06/1.85 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) % 8.06/1.85 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ % 8.06/1.85 | (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) % 8.06/1.85 | % 8.06/1.85 | ALPHA: (equal_set) implies: % 8.06/1.85 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (equal_set(v0, % 8.06/1.85 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : % 8.06/1.85 | (subset(v1, v0) = v4 & subset(v0, v1) = v3 & ( ~ (v4 = 0) | ~ (v3 = % 8.06/1.85 | 0)))) % 8.06/1.85 | % 8.06/1.85 | ALPHA: (empty_set) implies: % 8.06/1.85 | (3) ! [v0: $i] : ( ~ (member(v0, empty_set) = 0) | ~ $i(v0)) % 8.06/1.85 | % 8.06/1.85 | ALPHA: (difference) implies: % 8.06/1.85 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 8.06/1.85 | (difference(v2, v1) = v3) | ~ (member(v0, v3) = 0) | ~ $i(v2) | ~ % 8.06/1.85 | $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & member(v0, v2) = 0 % 8.06/1.85 | & member(v0, v1) = v4)) % 8.06/1.85 | % 8.06/1.85 | ALPHA: (thI29) implies: % 8.06/1.85 | (5) $i(empty_set) % 8.06/1.85 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & % 8.06/1.85 | difference(v0, v0) = v1 & equal_set(v1, empty_set) = v2 & $i(v1) & % 8.06/1.85 | $i(v0)) % 8.06/1.85 | % 8.06/1.85 | ALPHA: (function-axioms) implies: % 8.06/1.85 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 8.06/1.85 | ! [v3: $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) % 8.06/1.85 | = v0)) % 8.06/1.85 | % 8.06/1.86 | DELTA: instantiating (6) with fresh symbols all_15_0, all_15_1, all_15_2 % 8.06/1.86 | gives: % 8.06/1.86 | (8) ~ (all_15_0 = 0) & difference(all_15_2, all_15_2) = all_15_1 & % 8.06/1.86 | equal_set(all_15_1, empty_set) = all_15_0 & $i(all_15_1) & $i(all_15_2) % 8.06/1.86 | % 8.06/1.86 | ALPHA: (8) implies: % 8.06/1.86 | (9) ~ (all_15_0 = 0) % 8.06/1.86 | (10) $i(all_15_2) % 8.06/1.86 | (11) $i(all_15_1) % 8.06/1.86 | (12) equal_set(all_15_1, empty_set) = all_15_0 % 8.06/1.86 | (13) difference(all_15_2, all_15_2) = all_15_1 % 8.06/1.86 | % 8.06/1.86 | GROUND_INST: instantiating (2) with all_15_1, empty_set, all_15_0, simplifying % 8.06/1.86 | with (5), (11), (12) gives: % 8.06/1.86 | (14) all_15_0 = 0 | ? [v0: any] : ? [v1: any] : (subset(all_15_1, % 8.06/1.86 | empty_set) = v0 & subset(empty_set, all_15_1) = v1 & ( ~ (v1 = 0) % 8.06/1.86 | | ~ (v0 = 0))) % 8.06/1.86 | % 8.06/1.86 | BETA: splitting (14) gives: % 8.06/1.86 | % 8.06/1.86 | Case 1: % 8.06/1.86 | | % 8.06/1.86 | | (15) all_15_0 = 0 % 8.06/1.86 | | % 8.06/1.86 | | REDUCE: (9), (15) imply: % 8.06/1.86 | | (16) $false % 8.06/1.86 | | % 8.06/1.86 | | CLOSE: (16) is inconsistent. % 8.06/1.86 | | % 8.06/1.86 | Case 2: % 8.06/1.86 | | % 8.06/1.86 | | (17) ? [v0: any] : ? [v1: any] : (subset(all_15_1, empty_set) = v0 & % 8.06/1.86 | | subset(empty_set, all_15_1) = v1 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 8.06/1.86 | | % 8.06/1.86 | | DELTA: instantiating (17) with fresh symbols all_24_0, all_24_1 gives: % 8.06/1.86 | | (18) subset(all_15_1, empty_set) = all_24_1 & subset(empty_set, all_15_1) % 8.06/1.86 | | = all_24_0 & ( ~ (all_24_0 = 0) | ~ (all_24_1 = 0)) % 8.06/1.86 | | % 8.06/1.86 | | ALPHA: (18) implies: % 8.06/1.86 | | (19) subset(empty_set, all_15_1) = all_24_0 % 8.06/1.86 | | (20) subset(all_15_1, empty_set) = all_24_1 % 8.06/1.86 | | (21) ~ (all_24_0 = 0) | ~ (all_24_1 = 0) % 8.06/1.86 | | % 8.06/1.86 | | GROUND_INST: instantiating (1) with empty_set, all_15_1, all_24_0, % 8.06/1.86 | | simplifying with (5), (11), (19) gives: % 8.06/1.86 | | (22) all_24_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 8.06/1.86 | | member(v0, all_15_1) = v1 & member(v0, empty_set) = 0 & $i(v0)) % 8.06/1.86 | | % 8.06/1.86 | | GROUND_INST: instantiating (1) with all_15_1, empty_set, all_24_1, % 8.06/1.86 | | simplifying with (5), (11), (20) gives: % 8.06/1.86 | | (23) all_24_1 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 8.06/1.86 | | member(v0, all_15_1) = 0 & member(v0, empty_set) = v1 & $i(v0)) % 8.06/1.86 | | % 8.06/1.86 | | BETA: splitting (21) gives: % 8.06/1.86 | | % 8.06/1.86 | | Case 1: % 8.06/1.86 | | | % 8.06/1.86 | | | (24) ~ (all_24_0 = 0) % 8.06/1.87 | | | % 8.06/1.87 | | | BETA: splitting (22) gives: % 8.06/1.87 | | | % 8.06/1.87 | | | Case 1: % 8.06/1.87 | | | | % 8.06/1.87 | | | | (25) all_24_0 = 0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | REDUCE: (24), (25) imply: % 8.06/1.87 | | | | (26) $false % 8.06/1.87 | | | | % 8.06/1.87 | | | | CLOSE: (26) is inconsistent. % 8.06/1.87 | | | | % 8.06/1.87 | | | Case 2: % 8.06/1.87 | | | | % 8.06/1.87 | | | | (27) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_15_1) % 8.06/1.87 | | | | = v1 & member(v0, empty_set) = 0 & $i(v0)) % 8.06/1.87 | | | | % 8.06/1.87 | | | | DELTA: instantiating (27) with fresh symbols all_37_0, all_37_1 gives: % 8.06/1.87 | | | | (28) ~ (all_37_0 = 0) & member(all_37_1, all_15_1) = all_37_0 & % 8.06/1.87 | | | | member(all_37_1, empty_set) = 0 & $i(all_37_1) % 8.06/1.87 | | | | % 8.06/1.87 | | | | ALPHA: (28) implies: % 8.06/1.87 | | | | (29) $i(all_37_1) % 8.06/1.87 | | | | (30) member(all_37_1, empty_set) = 0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | GROUND_INST: instantiating (3) with all_37_1, simplifying with (29), % 8.06/1.87 | | | | (30) gives: % 8.06/1.87 | | | | (31) $false % 8.06/1.87 | | | | % 8.06/1.87 | | | | CLOSE: (31) is inconsistent. % 8.06/1.87 | | | | % 8.06/1.87 | | | End of split % 8.06/1.87 | | | % 8.06/1.87 | | Case 2: % 8.06/1.87 | | | % 8.06/1.87 | | | (32) ~ (all_24_1 = 0) % 8.06/1.87 | | | % 8.06/1.87 | | | BETA: splitting (23) gives: % 8.06/1.87 | | | % 8.06/1.87 | | | Case 1: % 8.06/1.87 | | | | % 8.06/1.87 | | | | (33) all_24_1 = 0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | REDUCE: (32), (33) imply: % 8.06/1.87 | | | | (34) $false % 8.06/1.87 | | | | % 8.06/1.87 | | | | CLOSE: (34) is inconsistent. % 8.06/1.87 | | | | % 8.06/1.87 | | | Case 2: % 8.06/1.87 | | | | % 8.06/1.87 | | | | (35) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_15_1) % 8.06/1.87 | | | | = 0 & member(v0, empty_set) = v1 & $i(v0)) % 8.06/1.87 | | | | % 8.06/1.87 | | | | DELTA: instantiating (35) with fresh symbols all_37_0, all_37_1 gives: % 8.06/1.87 | | | | (36) ~ (all_37_0 = 0) & member(all_37_1, all_15_1) = 0 & % 8.06/1.87 | | | | member(all_37_1, empty_set) = all_37_0 & $i(all_37_1) % 8.06/1.87 | | | | % 8.06/1.87 | | | | ALPHA: (36) implies: % 8.06/1.87 | | | | (37) $i(all_37_1) % 8.06/1.87 | | | | (38) member(all_37_1, all_15_1) = 0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | GROUND_INST: instantiating (4) with all_37_1, all_15_2, all_15_2, % 8.06/1.87 | | | | all_15_1, simplifying with (10), (13), (37), (38) gives: % 8.06/1.87 | | | | (39) ? [v0: int] : ( ~ (v0 = 0) & member(all_37_1, all_15_2) = v0 & % 8.06/1.87 | | | | member(all_37_1, all_15_2) = 0) % 8.06/1.87 | | | | % 8.06/1.87 | | | | DELTA: instantiating (39) with fresh symbol all_45_0 gives: % 8.06/1.87 | | | | (40) ~ (all_45_0 = 0) & member(all_37_1, all_15_2) = all_45_0 & % 8.06/1.87 | | | | member(all_37_1, all_15_2) = 0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | ALPHA: (40) implies: % 8.06/1.87 | | | | (41) ~ (all_45_0 = 0) % 8.06/1.87 | | | | (42) member(all_37_1, all_15_2) = 0 % 8.06/1.87 | | | | (43) member(all_37_1, all_15_2) = all_45_0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | GROUND_INST: instantiating (7) with 0, all_45_0, all_15_2, all_37_1, % 8.06/1.87 | | | | simplifying with (42), (43) gives: % 8.06/1.87 | | | | (44) all_45_0 = 0 % 8.06/1.87 | | | | % 8.06/1.87 | | | | REDUCE: (41), (44) imply: % 8.06/1.87 | | | | (45) $false % 8.06/1.87 | | | | % 8.06/1.87 | | | | CLOSE: (45) is inconsistent. % 8.06/1.87 | | | | % 8.06/1.87 | | | End of split % 8.06/1.87 | | | % 8.06/1.87 | | End of split % 8.06/1.87 | | % 8.06/1.87 | End of split % 8.06/1.87 | % 8.06/1.87 End of proof % 8.06/1.87 % SZS output end Proof for theBenchmark % 8.06/1.87 % 8.06/1.87 1260ms %------------------------------------------------------------------------------