%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU162+3 : TPTP v8.1.2. Released v3.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n006.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 17:42:56 EDT 2023 % Result : Theorem 4.91s 1.49s % Output : Proof 6.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU162+3 : 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.34 % Computer : n006.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 : Wed Aug 23 17:06:53 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.66 ________ _____ % 0.20/0.66 ___ __ \_________(_)________________________________ % 0.20/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.66 % 0.20/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.66 (2023-06-19) % 0.20/0.66 % 0.20/0.66 (c) Philipp Rümmer, 2009-2023 % 0.20/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.66 Amanda Stjerna. % 0.20/0.66 Free software under BSD-3-Clause. % 0.20/0.66 % 0.20/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.66 % 0.20/0.66 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.68 Running up to 7 provers in parallel. % 0.20/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.15/1.07 Prover 4: Preprocessing ... % 2.15/1.07 Prover 1: Preprocessing ... % 2.51/1.11 Prover 6: Preprocessing ... % 2.51/1.11 Prover 2: Preprocessing ... % 2.51/1.11 Prover 0: Preprocessing ... % 2.51/1.11 Prover 5: Preprocessing ... % 2.51/1.11 Prover 3: Preprocessing ... % 3.23/1.26 Prover 5: Proving ... % 3.23/1.26 Prover 6: Constructing countermodel ... % 3.23/1.27 Prover 1: Constructing countermodel ... % 3.23/1.27 Prover 2: Proving ... % 3.23/1.27 Prover 3: Constructing countermodel ... % 3.23/1.27 Prover 4: Constructing countermodel ... % 3.23/1.30 Prover 0: Proving ... % 4.09/1.40 Prover 1: gave up % 4.09/1.40 Prover 3: gave up % 4.09/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.09/1.41 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.09/1.42 Prover 7: Preprocessing ... % 4.09/1.43 Prover 8: Preprocessing ... % 4.91/1.45 Prover 6: gave up % 4.91/1.45 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 4.91/1.46 Prover 9: Preprocessing ... % 4.91/1.47 Prover 7: Warning: ignoring some quantifiers % 4.91/1.47 Prover 7: Constructing countermodel ... % 4.91/1.49 Prover 0: proved (804ms) % 4.91/1.49 % 4.91/1.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.91/1.49 % 4.91/1.49 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.91/1.49 Prover 5: stopped % 5.34/1.50 Prover 2: stopped % 5.34/1.51 Prover 10: Preprocessing ... % 5.34/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.34/1.51 Prover 11: Preprocessing ... % 5.34/1.52 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.34/1.52 Prover 8: Warning: ignoring some quantifiers % 5.34/1.53 Prover 13: Preprocessing ... % 5.34/1.53 Prover 9: Constructing countermodel ... % 5.34/1.53 Prover 8: Constructing countermodel ... % 5.34/1.53 Prover 9: stopped % 5.34/1.54 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.34/1.54 Prover 10: Warning: ignoring some quantifiers % 5.34/1.54 Prover 10: Constructing countermodel ... % 5.34/1.54 Prover 7: gave up % 5.34/1.55 Prover 16: Preprocessing ... % 5.34/1.55 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 5.80/1.57 Prover 19: Preprocessing ... % 5.80/1.57 Prover 13: Warning: ignoring some quantifiers % 5.80/1.58 Prover 13: Constructing countermodel ... % 5.80/1.58 Prover 11: Constructing countermodel ... % 5.80/1.59 Prover 4: Found proof (size 45) % 5.80/1.59 Prover 10: gave up % 5.80/1.60 Prover 4: proved (909ms) % 5.80/1.60 Prover 11: stopped % 5.80/1.60 Prover 16: Warning: ignoring some quantifiers % 5.80/1.60 Prover 13: stopped % 5.80/1.60 Prover 8: stopped % 5.80/1.60 Prover 16: Constructing countermodel ... % 6.10/1.60 Prover 16: stopped % 6.10/1.62 Prover 19: Warning: ignoring some quantifiers % 6.10/1.62 Prover 19: Constructing countermodel ... % 6.10/1.62 Prover 19: stopped % 6.10/1.62 % 6.10/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.10/1.62 % 6.10/1.63 % SZS output start Proof for theBenchmark % 6.10/1.63 Assumptions after simplification: % 6.10/1.63 --------------------------------- % 6.10/1.63 % 6.10/1.63 (l25_zfmisc_1) % 6.30/1.66 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (singleton(v0) = v2) | ~ % 6.30/1.66 (disjoint(v2, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) % 6.30/1.66 & in(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ (in(v0, v1) = 0) | % 6.30/1.66 ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 6.30/1.66 singleton(v0) = v2 & disjoint(v2, v1) = v3 & $i(v2))) % 6.30/1.66 % 6.30/1.66 (l28_zfmisc_1) % 6.30/1.67 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 6.30/1.67 (singleton(v0) = v2) | ~ (disjoint(v2, v1) = v3) | ~ $i(v1) | ~ $i(v0) | % 6.30/1.67 in(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 6.30/1.67 (in(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : (singleton(v0) = % 6.30/1.67 v3 & disjoint(v3, v1) = 0 & $i(v3))) % 6.30/1.67 % 6.30/1.67 (symmetry_r1_xboole_0) % 6.30/1.67 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (disjoint(v1, v0) = % 6.30/1.67 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & disjoint(v0, % 6.30/1.67 v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ (disjoint(v0, v1) = 0) | ~ % 6.30/1.67 $i(v1) | ~ $i(v0) | disjoint(v1, v0) = 0) % 6.30/1.67 % 6.30/1.67 (t65_zfmisc_1) % 6.30/1.67 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: any] : % 6.30/1.67 (set_difference(v0, v2) = v3 & singleton(v1) = v2 & in(v1, v0) = v4 & $i(v3) & % 6.30/1.67 $i(v2) & $i(v1) & $i(v0) & ((v4 = 0 & v3 = v0) | ( ~ (v4 = 0) & ~ (v3 = % 6.30/1.67 v0)))) % 6.30/1.67 % 6.30/1.67 (t83_xboole_1) % 6.30/1.68 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (set_difference(v0, % 6.30/1.68 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 6.30/1.68 disjoint(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = % 6.30/1.68 0 | ~ (disjoint(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ( ~ % 6.30/1.68 (v3 = v0) & set_difference(v0, v1) = v3 & $i(v3))) & ! [v0: $i] : ! [v1: % 6.30/1.68 $i] : ( ~ (set_difference(v0, v1) = v0) | ~ $i(v1) | ~ $i(v0) | % 6.30/1.68 disjoint(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (disjoint(v0, v1) = % 6.30/1.68 0) | ~ $i(v1) | ~ $i(v0) | set_difference(v0, v1) = v0) % 6.30/1.68 % 6.30/1.68 (function-axioms) % 6.30/1.68 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.30/1.68 (set_difference(v3, v2) = v1) | ~ (set_difference(v3, v2) = v0)) & ! [v0: % 6.30/1.68 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 6.30/1.68 : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! % 6.30/1.68 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.30/1.68 $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 6.30/1.68 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.30/1.68 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 6.30/1.68 [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 6.30/1.68 % 6.30/1.68 Further assumptions not needed in the proof: % 6.30/1.68 -------------------------------------------- % 6.30/1.68 antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0 % 6.30/1.68 % 6.30/1.68 Those formulas are unsatisfiable: % 6.30/1.68 --------------------------------- % 6.30/1.68 % 6.30/1.68 Begin of proof % 6.30/1.69 | % 6.30/1.69 | ALPHA: (l25_zfmisc_1) implies: % 6.30/1.69 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (in(v0, v1) = 0) | ~ $i(v1) | ~ % 6.30/1.69 | $i(v0) | ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & singleton(v0) = % 6.30/1.69 | v2 & disjoint(v2, v1) = v3 & $i(v2))) % 6.30/1.69 | % 6.30/1.69 | ALPHA: (l28_zfmisc_1) implies: % 6.30/1.69 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (in(v0, v1) = % 6.30/1.69 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : (singleton(v0) = v3 & % 6.30/1.69 | disjoint(v3, v1) = 0 & $i(v3))) % 6.30/1.69 | % 6.30/1.69 | ALPHA: (symmetry_r1_xboole_0) implies: % 6.30/1.69 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (disjoint(v0, v1) = 0) | ~ $i(v1) | ~ % 6.30/1.69 | $i(v0) | disjoint(v1, v0) = 0) % 6.30/1.69 | % 6.30/1.69 | ALPHA: (t83_xboole_1) implies: % 6.30/1.69 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ (set_difference(v0, v1) = v0) | ~ % 6.30/1.69 | $i(v1) | ~ $i(v0) | disjoint(v0, v1) = 0) % 6.30/1.69 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ % 6.30/1.69 | (set_difference(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] % 6.30/1.69 | : ( ~ (v3 = 0) & disjoint(v0, v1) = v3)) % 6.30/1.69 | % 6.30/1.69 | ALPHA: (function-axioms) implies: % 6.30/1.69 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (singleton(v2) % 6.30/1.69 | = v1) | ~ (singleton(v2) = v0)) % 6.30/1.70 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.30/1.70 | ! [v3: $i] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, % 6.30/1.70 | v2) = v0)) % 6.30/1.70 | % 6.30/1.70 | DELTA: instantiating (t65_zfmisc_1) with fresh symbols all_12_0, all_12_1, % 6.30/1.70 | all_12_2, all_12_3, all_12_4 gives: % 6.30/1.70 | (8) set_difference(all_12_4, all_12_2) = all_12_1 & singleton(all_12_3) = % 6.30/1.70 | all_12_2 & in(all_12_3, all_12_4) = all_12_0 & $i(all_12_1) & % 6.30/1.70 | $i(all_12_2) & $i(all_12_3) & $i(all_12_4) & ((all_12_0 = 0 & all_12_1 % 6.30/1.70 | = all_12_4) | ( ~ (all_12_0 = 0) & ~ (all_12_1 = all_12_4))) % 6.30/1.70 | % 6.30/1.70 | ALPHA: (8) implies: % 6.30/1.70 | (9) $i(all_12_4) % 6.30/1.70 | (10) $i(all_12_3) % 6.30/1.70 | (11) $i(all_12_2) % 6.30/1.70 | (12) $i(all_12_1) % 6.30/1.70 | (13) in(all_12_3, all_12_4) = all_12_0 % 6.30/1.70 | (14) singleton(all_12_3) = all_12_2 % 6.30/1.70 | (15) set_difference(all_12_4, all_12_2) = all_12_1 % 6.30/1.70 | (16) (all_12_0 = 0 & all_12_1 = all_12_4) | ( ~ (all_12_0 = 0) & ~ % 6.30/1.70 | (all_12_1 = all_12_4)) % 6.30/1.70 | % 6.30/1.70 | GROUND_INST: instantiating (2) with all_12_3, all_12_4, all_12_0, simplifying % 6.30/1.70 | with (9), (10), (13) gives: % 6.30/1.70 | (17) all_12_0 = 0 | ? [v0: $i] : (singleton(all_12_3) = v0 & disjoint(v0, % 6.30/1.70 | all_12_4) = 0 & $i(v0)) % 6.30/1.70 | % 6.30/1.70 | GROUND_INST: instantiating (5) with all_12_4, all_12_2, all_12_1, simplifying % 6.30/1.70 | with (9), (11), (15) gives: % 6.30/1.70 | (18) all_12_1 = all_12_4 | ? [v0: int] : ( ~ (v0 = 0) & disjoint(all_12_4, % 6.30/1.70 | all_12_2) = v0) % 6.30/1.70 | % 6.30/1.70 | BETA: splitting (16) gives: % 6.30/1.70 | % 6.30/1.70 | Case 1: % 6.30/1.70 | | % 6.30/1.70 | | (19) all_12_0 = 0 & all_12_1 = all_12_4 % 6.30/1.70 | | % 6.30/1.70 | | ALPHA: (19) implies: % 6.30/1.70 | | (20) all_12_1 = all_12_4 % 6.30/1.70 | | (21) all_12_0 = 0 % 6.30/1.70 | | % 6.30/1.70 | | REDUCE: (15), (20) imply: % 6.30/1.70 | | (22) set_difference(all_12_4, all_12_2) = all_12_4 % 6.30/1.70 | | % 6.30/1.70 | | REDUCE: (13), (21) imply: % 6.30/1.71 | | (23) in(all_12_3, all_12_4) = 0 % 6.30/1.71 | | % 6.30/1.71 | | GROUND_INST: instantiating (1) with all_12_3, all_12_4, simplifying with % 6.30/1.71 | | (9), (10), (23) gives: % 6.30/1.71 | | (24) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & singleton(all_12_3) = v0 % 6.30/1.71 | | & disjoint(v0, all_12_4) = v1 & $i(v0)) % 6.30/1.71 | | % 6.30/1.71 | | GROUND_INST: instantiating (4) with all_12_4, all_12_2, simplifying with % 6.30/1.71 | | (9), (11), (22) gives: % 6.30/1.71 | | (25) disjoint(all_12_4, all_12_2) = 0 % 6.30/1.71 | | % 6.30/1.71 | | DELTA: instantiating (24) with fresh symbols all_29_0, all_29_1 gives: % 6.30/1.71 | | (26) ~ (all_29_0 = 0) & singleton(all_12_3) = all_29_1 & % 6.30/1.71 | | disjoint(all_29_1, all_12_4) = all_29_0 & $i(all_29_1) % 6.30/1.71 | | % 6.30/1.71 | | ALPHA: (26) implies: % 6.30/1.71 | | (27) ~ (all_29_0 = 0) % 6.30/1.71 | | (28) $i(all_29_1) % 6.30/1.71 | | (29) disjoint(all_29_1, all_12_4) = all_29_0 % 6.30/1.71 | | (30) singleton(all_12_3) = all_29_1 % 6.30/1.71 | | % 6.30/1.71 | | GROUND_INST: instantiating (6) with all_12_2, all_29_1, all_12_3, % 6.30/1.71 | | simplifying with (14), (30) gives: % 6.30/1.71 | | (31) all_29_1 = all_12_2 % 6.30/1.71 | | % 6.30/1.71 | | REDUCE: (29), (31) imply: % 6.30/1.71 | | (32) disjoint(all_12_2, all_12_4) = all_29_0 % 6.30/1.71 | | % 6.30/1.71 | | GROUND_INST: instantiating (3) with all_12_4, all_12_2, simplifying with % 6.30/1.71 | | (9), (11), (25) gives: % 6.30/1.71 | | (33) disjoint(all_12_2, all_12_4) = 0 % 6.30/1.71 | | % 6.30/1.71 | | GROUND_INST: instantiating (7) with all_29_0, 0, all_12_4, all_12_2, % 6.30/1.71 | | simplifying with (32), (33) gives: % 6.30/1.71 | | (34) all_29_0 = 0 % 6.30/1.71 | | % 6.30/1.71 | | REDUCE: (27), (34) imply: % 6.30/1.71 | | (35) $false % 6.30/1.71 | | % 6.30/1.71 | | CLOSE: (35) is inconsistent. % 6.30/1.71 | | % 6.30/1.71 | Case 2: % 6.30/1.71 | | % 6.30/1.71 | | (36) ~ (all_12_0 = 0) & ~ (all_12_1 = all_12_4) % 6.30/1.71 | | % 6.30/1.71 | | ALPHA: (36) implies: % 6.30/1.71 | | (37) ~ (all_12_1 = all_12_4) % 6.30/1.71 | | (38) ~ (all_12_0 = 0) % 6.30/1.71 | | % 6.30/1.71 | | BETA: splitting (17) gives: % 6.30/1.71 | | % 6.30/1.71 | | Case 1: % 6.30/1.71 | | | % 6.30/1.71 | | | (39) all_12_0 = 0 % 6.30/1.71 | | | % 6.30/1.71 | | | REDUCE: (38), (39) imply: % 6.30/1.71 | | | (40) $false % 6.30/1.71 | | | % 6.30/1.71 | | | CLOSE: (40) is inconsistent. % 6.30/1.71 | | | % 6.30/1.71 | | Case 2: % 6.30/1.71 | | | % 6.30/1.71 | | | (41) ? [v0: $i] : (singleton(all_12_3) = v0 & disjoint(v0, all_12_4) = % 6.30/1.71 | | | 0 & $i(v0)) % 6.30/1.71 | | | % 6.30/1.71 | | | DELTA: instantiating (41) with fresh symbol all_25_0 gives: % 6.30/1.72 | | | (42) singleton(all_12_3) = all_25_0 & disjoint(all_25_0, all_12_4) = 0 % 6.30/1.72 | | | & $i(all_25_0) % 6.30/1.72 | | | % 6.30/1.72 | | | ALPHA: (42) implies: % 6.30/1.72 | | | (43) $i(all_25_0) % 6.30/1.72 | | | (44) disjoint(all_25_0, all_12_4) = 0 % 6.30/1.72 | | | (45) singleton(all_12_3) = all_25_0 % 6.30/1.72 | | | % 6.30/1.72 | | | BETA: splitting (18) gives: % 6.30/1.72 | | | % 6.30/1.72 | | | Case 1: % 6.30/1.72 | | | | % 6.30/1.72 | | | | (46) all_12_1 = all_12_4 % 6.30/1.72 | | | | % 6.30/1.72 | | | | REDUCE: (37), (46) imply: % 6.30/1.72 | | | | (47) $false % 6.30/1.72 | | | | % 6.30/1.72 | | | | CLOSE: (47) is inconsistent. % 6.30/1.72 | | | | % 6.30/1.72 | | | Case 2: % 6.30/1.72 | | | | % 6.30/1.72 | | | | (48) ? [v0: int] : ( ~ (v0 = 0) & disjoint(all_12_4, all_12_2) = v0) % 6.30/1.72 | | | | % 6.30/1.72 | | | | DELTA: instantiating (48) with fresh symbol all_31_0 gives: % 6.30/1.72 | | | | (49) ~ (all_31_0 = 0) & disjoint(all_12_4, all_12_2) = all_31_0 % 6.30/1.72 | | | | % 6.30/1.72 | | | | ALPHA: (49) implies: % 6.30/1.72 | | | | (50) ~ (all_31_0 = 0) % 6.30/1.72 | | | | (51) disjoint(all_12_4, all_12_2) = all_31_0 % 6.30/1.72 | | | | % 6.30/1.72 | | | | GROUND_INST: instantiating (6) with all_12_2, all_25_0, all_12_3, % 6.30/1.72 | | | | simplifying with (14), (45) gives: % 6.30/1.72 | | | | (52) all_25_0 = all_12_2 % 6.30/1.72 | | | | % 6.30/1.72 | | | | REDUCE: (44), (52) imply: % 6.30/1.72 | | | | (53) disjoint(all_12_2, all_12_4) = 0 % 6.30/1.72 | | | | % 6.30/1.72 | | | | GROUND_INST: instantiating (3) with all_12_2, all_12_4, simplifying with % 6.30/1.72 | | | | (9), (11), (53) gives: % 6.30/1.72 | | | | (54) disjoint(all_12_4, all_12_2) = 0 % 6.30/1.72 | | | | % 6.30/1.72 | | | | GROUND_INST: instantiating (7) with all_31_0, 0, all_12_2, all_12_4, % 6.30/1.72 | | | | simplifying with (51), (54) gives: % 6.30/1.72 | | | | (55) all_31_0 = 0 % 6.30/1.72 | | | | % 6.30/1.72 | | | | REDUCE: (50), (55) imply: % 6.30/1.72 | | | | (56) $false % 6.30/1.72 | | | | % 6.30/1.72 | | | | CLOSE: (56) is inconsistent. % 6.30/1.72 | | | | % 6.30/1.72 | | | End of split % 6.30/1.72 | | | % 6.30/1.72 | | End of split % 6.30/1.72 | | % 6.30/1.72 | End of split % 6.30/1.72 | % 6.30/1.72 End of proof % 6.30/1.72 % SZS output end Proof for theBenchmark % 6.30/1.72 % 6.30/1.72 1056ms %------------------------------------------------------------------------------