%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET932+1 : TPTP v8.1.2. Released v3.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n003.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:27:06 EDT 2023 % Result : Theorem 5.05s 1.67s % Output : Proof 8.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET932+1 : TPTP v8.1.2. Released v3.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n003.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sat Aug 26 15:34:54 EDT 2023 % 0.13/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/sandbox/benchmark/theBenchmark.p ... % 0.18/0.61 Running up to 7 provers in parallel. % 0.18/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.08/1.03 Prover 4: Preprocessing ... % 2.08/1.03 Prover 1: Preprocessing ... % 2.30/1.10 Prover 3: Preprocessing ... % 2.30/1.10 Prover 0: Preprocessing ... % 2.30/1.10 Prover 6: Preprocessing ... % 2.30/1.10 Prover 2: Preprocessing ... % 2.30/1.10 Prover 5: Preprocessing ... % 4.09/1.36 Prover 1: Warning: ignoring some quantifiers % 4.09/1.37 Prover 5: Proving ... % 4.09/1.37 Prover 2: Proving ... % 4.09/1.37 Prover 6: Proving ... % 4.09/1.38 Prover 4: Warning: ignoring some quantifiers % 4.09/1.38 Prover 3: Warning: ignoring some quantifiers % 4.09/1.39 Prover 3: Constructing countermodel ... % 4.09/1.40 Prover 4: Constructing countermodel ... % 4.09/1.40 Prover 1: Constructing countermodel ... % 4.09/1.43 Prover 0: Proving ... % 5.05/1.67 Prover 3: proved (1048ms) % 5.05/1.67 % 5.05/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.05/1.67 % 5.05/1.68 Prover 5: stopped % 5.05/1.68 Prover 0: stopped % 5.05/1.68 Prover 6: stopped % 5.05/1.69 Prover 2: stopped % 5.05/1.69 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.05/1.69 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.05/1.69 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.05/1.69 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.85/1.70 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.47/1.72 Prover 11: Preprocessing ... % 6.47/1.73 Prover 8: Preprocessing ... % 6.47/1.73 Prover 13: Preprocessing ... % 6.47/1.74 Prover 10: Preprocessing ... % 6.47/1.74 Prover 7: Preprocessing ... % 6.85/1.79 Prover 1: Found proof (size 33) % 6.85/1.79 Prover 1: proved (1172ms) % 6.85/1.79 Prover 7: Warning: ignoring some quantifiers % 6.85/1.79 Prover 10: Warning: ignoring some quantifiers % 6.85/1.79 Prover 4: stopped % 6.85/1.80 Prover 13: Warning: ignoring some quantifiers % 6.85/1.80 Prover 10: Constructing countermodel ... % 6.85/1.80 Prover 7: Constructing countermodel ... % 6.85/1.80 Prover 10: stopped % 6.85/1.81 Prover 7: stopped % 6.85/1.81 Prover 13: Constructing countermodel ... % 6.85/1.82 Prover 8: Warning: ignoring some quantifiers % 6.85/1.82 Prover 13: stopped % 6.85/1.83 Prover 8: Constructing countermodel ... % 6.85/1.83 Prover 8: stopped % 6.85/1.84 Prover 11: Warning: ignoring some quantifiers % 6.85/1.85 Prover 11: Constructing countermodel ... % 7.46/1.86 Prover 11: stopped % 7.46/1.86 % 7.46/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.46/1.86 % 7.46/1.86 % SZS output start Proof for theBenchmark % 7.46/1.87 Assumptions after simplification: % 7.46/1.87 --------------------------------- % 7.46/1.87 % 7.46/1.87 (d1_zfmisc_1) % 7.66/1.92 ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (powerset(v1) = v2) | % 7.66/1.92 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: any] : ? [v5: any] : % 7.66/1.92 (subset(v3, v1) = v5 & in(v3, v0) = v4 & $i(v3) & ( ~ (v5 = 0) | ~ (v4 = % 7.66/1.92 0)) & (v5 = 0 | v4 = 0))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 7.66/1.92 (powerset(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ( ! [v2: $i] : ! [v3: int] : % 7.66/1.92 (v3 = 0 | ~ (in(v2, v1) = v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 7.66/1.92 subset(v2, v0) = v4)) & ! [v2: $i] : ( ~ (in(v2, v1) = 0) | ~ $i(v2) % 7.66/1.92 | subset(v2, v0) = 0))) % 7.66/1.92 % 7.66/1.92 (d3_tarski) % 7.66/1.93 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) % 7.66/1.93 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, % 7.66/1.93 v1) = v4 & in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 7.66/1.93 (subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ( ~ (in(v2, v0) % 7.66/1.93 = 0) | ~ $i(v2) | in(v2, v1) = 0)) % 7.66/1.93 % 7.66/1.93 (t1_xboole_1) % 7.66/1.93 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 7.66/1.93 (subset(v0, v2) = v3) | ~ (subset(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 7.66/1.93 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & subset(v1, v2) = v4)) % 7.66/1.93 % 7.66/1.93 (t79_zfmisc_1) % 7.66/1.94 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 7.66/1.94 = 0) & powerset(v1) = v3 & powerset(v0) = v2 & subset(v2, v3) = v4 & % 7.66/1.94 subset(v0, v1) = 0 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 7.89/1.94 % 7.89/1.94 (function-axioms) % 7.89/1.94 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 7.89/1.94 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & % 7.89/1.94 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 7.89/1.94 $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 7.89/1.94 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.89/1.94 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 7.89/1.94 [v2: $i] : (v1 = v0 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) % 7.89/1.94 % 7.89/1.94 Further assumptions not needed in the proof: % 7.89/1.94 -------------------------------------------- % 7.93/1.95 antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski % 7.93/1.95 % 7.93/1.95 Those formulas are unsatisfiable: % 7.93/1.95 --------------------------------- % 7.93/1.95 % 7.93/1.95 Begin of proof % 7.93/1.95 | % 7.93/1.95 | ALPHA: (d1_zfmisc_1) implies: % 7.93/1.95 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (powerset(v0) = v1) | ~ $i(v1) | ~ % 7.93/1.95 | $i(v0) | ( ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (in(v2, v1) = v3) % 7.93/1.95 | | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & subset(v2, v0) = v4)) % 7.93/1.95 | & ! [v2: $i] : ( ~ (in(v2, v1) = 0) | ~ $i(v2) | subset(v2, v0) = % 7.93/1.95 | 0))) % 7.93/1.95 | % 7.93/1.95 | ALPHA: (d3_tarski) implies: % 7.93/1.96 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) % 7.93/1.96 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ % 7.93/1.96 | (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0 & $i(v3))) % 7.93/1.96 | % 7.93/1.96 | ALPHA: (function-axioms) implies: % 7.93/1.96 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.93/1.96 | ! [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) % 7.93/1.96 | = v0)) % 7.93/1.96 | % 7.93/1.96 | DELTA: instantiating (t79_zfmisc_1) with fresh symbols all_13_0, all_13_1, % 7.93/1.96 | all_13_2, all_13_3, all_13_4 gives: % 7.93/1.96 | (4) ~ (all_13_0 = 0) & powerset(all_13_3) = all_13_1 & powerset(all_13_4) % 7.93/1.96 | = all_13_2 & subset(all_13_2, all_13_1) = all_13_0 & subset(all_13_4, % 7.93/1.96 | all_13_3) = 0 & $i(all_13_1) & $i(all_13_2) & $i(all_13_3) & % 7.93/1.96 | $i(all_13_4) % 7.93/1.96 | % 7.93/1.96 | ALPHA: (4) implies: % 7.93/1.97 | (5) ~ (all_13_0 = 0) % 7.93/1.97 | (6) $i(all_13_4) % 7.93/1.97 | (7) $i(all_13_3) % 7.93/1.97 | (8) $i(all_13_2) % 7.93/1.97 | (9) $i(all_13_1) % 7.93/1.97 | (10) subset(all_13_4, all_13_3) = 0 % 7.93/1.97 | (11) subset(all_13_2, all_13_1) = all_13_0 % 7.93/1.97 | (12) powerset(all_13_4) = all_13_2 % 7.93/1.97 | (13) powerset(all_13_3) = all_13_1 % 7.93/1.97 | % 7.93/1.97 | GROUND_INST: instantiating (2) with all_13_2, all_13_1, all_13_0, simplifying % 7.93/1.97 | with (8), (9), (11) gives: % 7.93/1.97 | (14) all_13_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, % 7.93/1.97 | all_13_1) = v1 & in(v0, all_13_2) = 0 & $i(v0)) % 7.93/1.97 | % 7.93/1.97 | GROUND_INST: instantiating (1) with all_13_4, all_13_2, simplifying with (6), % 7.93/1.97 | (8), (12) gives: % 7.93/1.98 | (15) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (in(v0, all_13_2) = v1) | ~ % 7.93/1.98 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & subset(v0, all_13_4) = v2)) & % 7.93/1.98 | ! [v0: $i] : ( ~ (in(v0, all_13_2) = 0) | ~ $i(v0) | subset(v0, % 7.93/1.98 | all_13_4) = 0) % 7.93/1.98 | % 7.93/1.98 | ALPHA: (15) implies: % 7.93/1.98 | (16) ! [v0: $i] : ( ~ (in(v0, all_13_2) = 0) | ~ $i(v0) | subset(v0, % 7.93/1.98 | all_13_4) = 0) % 7.93/1.98 | % 7.93/1.98 | GROUND_INST: instantiating (1) with all_13_3, all_13_1, simplifying with (7), % 7.93/1.98 | (9), (13) gives: % 7.93/1.98 | (17) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (in(v0, all_13_1) = v1) | ~ % 7.93/1.98 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & subset(v0, all_13_3) = v2)) & % 7.93/1.98 | ! [v0: $i] : ( ~ (in(v0, all_13_1) = 0) | ~ $i(v0) | subset(v0, % 7.93/1.98 | all_13_3) = 0) % 7.93/1.98 | % 7.93/1.98 | ALPHA: (17) implies: % 7.93/1.98 | (18) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (in(v0, all_13_1) = v1) | ~ % 7.93/1.98 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & subset(v0, all_13_3) = v2)) % 7.93/1.98 | % 7.93/1.98 | BETA: splitting (14) gives: % 7.93/1.98 | % 7.93/1.99 | Case 1: % 7.93/1.99 | | % 7.93/1.99 | | (19) all_13_0 = 0 % 7.93/1.99 | | % 7.93/1.99 | | REDUCE: (5), (19) imply: % 7.93/1.99 | | (20) $false % 7.93/1.99 | | % 7.93/1.99 | | CLOSE: (20) is inconsistent. % 7.93/1.99 | | % 7.93/1.99 | Case 2: % 7.93/1.99 | | % 7.93/1.99 | | (21) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, all_13_1) = v1 & % 7.93/1.99 | | in(v0, all_13_2) = 0 & $i(v0)) % 7.93/1.99 | | % 7.93/1.99 | | DELTA: instantiating (21) with fresh symbols all_28_0, all_28_1 gives: % 7.93/1.99 | | (22) ~ (all_28_0 = 0) & in(all_28_1, all_13_1) = all_28_0 & in(all_28_1, % 7.93/1.99 | | all_13_2) = 0 & $i(all_28_1) % 7.93/1.99 | | % 7.93/1.99 | | ALPHA: (22) implies: % 7.93/1.99 | | (23) ~ (all_28_0 = 0) % 7.93/1.99 | | (24) $i(all_28_1) % 7.93/1.99 | | (25) in(all_28_1, all_13_2) = 0 % 7.93/1.99 | | (26) in(all_28_1, all_13_1) = all_28_0 % 7.93/1.99 | | % 7.93/1.99 | | GROUND_INST: instantiating (16) with all_28_1, simplifying with (24), (25) % 7.93/1.99 | | gives: % 7.93/1.99 | | (27) subset(all_28_1, all_13_4) = 0 % 7.93/1.99 | | % 7.93/1.99 | | GROUND_INST: instantiating (18) with all_28_1, all_28_0, simplifying with % 7.93/1.99 | | (24), (26) gives: % 7.93/1.99 | | (28) all_28_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & subset(all_28_1, % 7.93/2.00 | | all_13_3) = v0) % 7.93/2.00 | | % 7.93/2.00 | | BETA: splitting (28) gives: % 7.93/2.00 | | % 7.93/2.00 | | Case 1: % 7.93/2.00 | | | % 7.93/2.00 | | | (29) all_28_0 = 0 % 7.93/2.00 | | | % 7.93/2.00 | | | REDUCE: (23), (29) imply: % 7.93/2.00 | | | (30) $false % 7.93/2.00 | | | % 7.93/2.00 | | | CLOSE: (30) is inconsistent. % 7.93/2.00 | | | % 7.93/2.00 | | Case 2: % 7.93/2.00 | | | % 7.93/2.00 | | | (31) ? [v0: int] : ( ~ (v0 = 0) & subset(all_28_1, all_13_3) = v0) % 7.93/2.00 | | | % 7.93/2.00 | | | DELTA: instantiating (31) with fresh symbol all_42_0 gives: % 7.93/2.00 | | | (32) ~ (all_42_0 = 0) & subset(all_28_1, all_13_3) = all_42_0 % 7.93/2.00 | | | % 7.93/2.00 | | | ALPHA: (32) implies: % 7.93/2.00 | | | (33) ~ (all_42_0 = 0) % 7.93/2.00 | | | (34) subset(all_28_1, all_13_3) = all_42_0 % 7.93/2.00 | | | % 7.93/2.00 | | | GROUND_INST: instantiating (t1_xboole_1) with all_28_1, all_13_4, % 7.93/2.00 | | | all_13_3, all_42_0, simplifying with (6), (7), (24), (27), % 7.93/2.00 | | | (34) gives: % 7.93/2.00 | | | (35) all_42_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & subset(all_13_4, % 7.93/2.00 | | | all_13_3) = v0) % 7.93/2.00 | | | % 7.93/2.00 | | | BETA: splitting (35) gives: % 7.93/2.00 | | | % 7.93/2.00 | | | Case 1: % 7.93/2.00 | | | | % 7.93/2.00 | | | | (36) all_42_0 = 0 % 7.93/2.00 | | | | % 7.93/2.00 | | | | REDUCE: (33), (36) imply: % 7.93/2.00 | | | | (37) $false % 7.93/2.00 | | | | % 7.93/2.00 | | | | CLOSE: (37) is inconsistent. % 7.93/2.00 | | | | % 7.93/2.00 | | | Case 2: % 7.93/2.00 | | | | % 7.93/2.00 | | | | (38) ? [v0: int] : ( ~ (v0 = 0) & subset(all_13_4, all_13_3) = v0) % 7.93/2.00 | | | | % 7.93/2.00 | | | | DELTA: instantiating (38) with fresh symbol all_58_0 gives: % 7.93/2.00 | | | | (39) ~ (all_58_0 = 0) & subset(all_13_4, all_13_3) = all_58_0 % 7.93/2.00 | | | | % 8.22/2.00 | | | | ALPHA: (39) implies: % 8.22/2.00 | | | | (40) ~ (all_58_0 = 0) % 8.22/2.01 | | | | (41) subset(all_13_4, all_13_3) = all_58_0 % 8.22/2.01 | | | | % 8.22/2.01 | | | | GROUND_INST: instantiating (3) with 0, all_58_0, all_13_3, all_13_4, % 8.22/2.01 | | | | simplifying with (10), (41) gives: % 8.22/2.01 | | | | (42) all_58_0 = 0 % 8.22/2.01 | | | | % 8.22/2.01 | | | | REDUCE: (40), (42) imply: % 8.22/2.01 | | | | (43) $false % 8.22/2.01 | | | | % 8.22/2.01 | | | | CLOSE: (43) is inconsistent. % 8.22/2.01 | | | | % 8.22/2.01 | | | End of split % 8.22/2.01 | | | % 8.22/2.01 | | End of split % 8.22/2.01 | | % 8.22/2.01 | End of split % 8.22/2.01 | % 8.22/2.01 End of proof % 8.22/2.01 % SZS output end Proof for theBenchmark % 8.22/2.01 % 8.22/2.01 1416ms %------------------------------------------------------------------------------