%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET976+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 : n001.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:15 EDT 2023 % Result : Theorem 6.12s 1.57s % Output : Proof 7.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SET976+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.34 % Computer : n001.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 16:57:00 EDT 2023 % 0.13/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/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 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 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 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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.10/1.01 Prover 4: Preprocessing ... % 2.10/1.01 Prover 1: Preprocessing ... % 2.10/1.06 Prover 6: Preprocessing ... % 2.10/1.06 Prover 2: Preprocessing ... % 2.10/1.06 Prover 5: Preprocessing ... % 2.10/1.06 Prover 0: Preprocessing ... % 2.10/1.06 Prover 3: Preprocessing ... % 3.55/1.27 Prover 1: Warning: ignoring some quantifiers % 3.55/1.28 Prover 4: Warning: ignoring some quantifiers % 3.55/1.29 Prover 3: Warning: ignoring some quantifiers % 4.20/1.30 Prover 1: Constructing countermodel ... % 4.20/1.30 Prover 3: Constructing countermodel ... % 4.20/1.30 Prover 4: Constructing countermodel ... % 4.20/1.32 Prover 6: Proving ... % 4.20/1.32 Prover 5: Proving ... % 4.20/1.34 Prover 0: Proving ... % 4.20/1.38 Prover 2: Proving ... % 6.05/1.57 Prover 3: proved (933ms) % 6.05/1.57 % 6.12/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.12/1.57 % 6.12/1.57 Prover 6: stopped % 6.12/1.57 Prover 2: stopped % 6.12/1.57 Prover 0: stopped % 6.12/1.59 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.12/1.59 Prover 5: stopped % 6.12/1.59 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.12/1.59 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.12/1.59 Prover 7: Preprocessing ... % 6.12/1.59 Prover 8: Preprocessing ... % 6.12/1.59 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.12/1.59 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.36/1.61 Prover 10: Preprocessing ... % 6.36/1.62 Prover 13: Preprocessing ... % 6.36/1.62 Prover 11: Preprocessing ... % 6.53/1.67 Prover 7: Warning: ignoring some quantifiers % 6.53/1.67 Prover 10: Warning: ignoring some quantifiers % 6.53/1.67 Prover 7: Constructing countermodel ... % 6.53/1.67 Prover 8: Warning: ignoring some quantifiers % 6.53/1.68 Prover 13: Warning: ignoring some quantifiers % 6.53/1.68 Prover 8: Constructing countermodel ... % 6.53/1.69 Prover 10: Constructing countermodel ... % 6.53/1.69 Prover 13: Constructing countermodel ... % 6.53/1.70 Prover 1: Found proof (size 39) % 6.53/1.70 Prover 1: proved (1067ms) % 6.53/1.70 Prover 13: stopped % 6.53/1.70 Prover 4: stopped % 6.53/1.70 Prover 7: stopped % 6.53/1.70 Prover 10: stopped % 6.53/1.70 Prover 8: stopped % 6.53/1.71 Prover 11: Warning: ignoring some quantifiers % 6.53/1.72 Prover 11: Constructing countermodel ... % 7.17/1.73 Prover 11: stopped % 7.17/1.73 % 7.17/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.17/1.73 % 7.17/1.73 % SZS output start Proof for theBenchmark % 7.17/1.73 Assumptions after simplification: % 7.17/1.73 --------------------------------- % 7.17/1.73 % 7.17/1.73 (d1_tarski) % 7.17/1.77 ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v1) = v2) | % 7.17/1.77 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: any] : (in(v3, v0) = v4 & % 7.17/1.77 $i(v3) & ( ~ (v4 = 0) | ~ (v3 = v1)) & (v4 = 0 | v3 = v1))) & ! [v0: $i] % 7.17/1.77 : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ( ! [v2: % 7.17/1.77 $i] : (v2 = v0 | ~ (in(v2, v1) = 0) | ~ $i(v2)) & ! [v2: int] : (v2 = % 7.17/1.77 0 | ~ (in(v0, v1) = v2)))) % 7.17/1.77 % 7.17/1.77 (l55_zfmisc_1) % 7.17/1.77 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 7.17/1.77 $i] : ! [v6: int] : (v6 = 0 | ~ (cartesian_product2(v2, v3) = v5) | ~ % 7.17/1.77 (ordered_pair(v0, v1) = v4) | ~ (in(v4, v5) = v6) | ~ $i(v3) | ~ $i(v2) | % 7.17/1.77 ~ $i(v1) | ~ $i(v0) | ? [v7: any] : ? [v8: any] : (in(v1, v3) = v8 & % 7.17/1.77 in(v0, v2) = v7 & ( ~ (v8 = 0) | ~ (v7 = 0)))) & ! [v0: $i] : ! [v1: % 7.17/1.77 $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ % 7.17/1.77 (cartesian_product2(v2, v3) = v5) | ~ (ordered_pair(v0, v1) = v4) | ~ % 7.17/1.77 (in(v4, v5) = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (in(v1, % 7.17/1.77 v3) = 0 & in(v0, v2) = 0)) % 7.17/1.77 % 7.17/1.77 (t129_zfmisc_1) % 7.17/1.78 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 7.17/1.78 $i] : ? [v6: $i] : ? [v7: any] : ? [v8: any] : (cartesian_product2(v2, % 7.17/1.78 v5) = v6 & ordered_pair(v0, v1) = v4 & singleton(v3) = v5 & in(v4, v6) = % 7.17/1.78 v7 & in(v0, v2) = v8 & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 7.17/1.78 $i(v0) & ((v8 = 0 & v3 = v1 & ~ (v7 = 0)) | (v7 = 0 & ( ~ (v8 = 0) | ~ (v3 % 7.17/1.78 = v1))))) % 7.17/1.78 % 7.17/1.78 (function-axioms) % 7.17/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.17/1.78 (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) & % 7.17/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.17/1.78 (ordered_pair(v3, v2) = v1) | ~ (ordered_pair(v3, v2) = v0)) & ! [v0: $i] % 7.17/1.79 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (unordered_pair(v3, % 7.17/1.79 v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0: % 7.17/1.79 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.17/1.79 : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 7.17/1.79 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.17/1.79 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 7.17/1.79 [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 7.17/1.79 % 7.17/1.79 Further assumptions not needed in the proof: % 7.17/1.79 -------------------------------------------- % 7.17/1.79 antisymmetry_r2_hidden, commutativity_k2_tarski, d5_tarski, fc1_zfmisc_1, % 7.17/1.79 rc1_xboole_0, rc2_xboole_0 % 7.17/1.79 % 7.17/1.79 Those formulas are unsatisfiable: % 7.17/1.79 --------------------------------- % 7.17/1.79 % 7.17/1.79 Begin of proof % 7.50/1.79 | % 7.50/1.79 | ALPHA: (d1_tarski) implies: % 7.50/1.79 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ % 7.50/1.79 | $i(v0) | ( ! [v2: $i] : (v2 = v0 | ~ (in(v2, v1) = 0) | ~ $i(v2)) & % 7.50/1.79 | ! [v2: int] : (v2 = 0 | ~ (in(v0, v1) = v2)))) % 7.50/1.79 | % 7.50/1.79 | ALPHA: (l55_zfmisc_1) implies: % 7.50/1.79 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 7.50/1.79 | ! [v5: $i] : ( ~ (cartesian_product2(v2, v3) = v5) | ~ % 7.50/1.79 | (ordered_pair(v0, v1) = v4) | ~ (in(v4, v5) = 0) | ~ $i(v3) | ~ % 7.50/1.79 | $i(v2) | ~ $i(v1) | ~ $i(v0) | (in(v1, v3) = 0 & in(v0, v2) = 0)) % 7.50/1.80 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 7.50/1.80 | ! [v5: $i] : ! [v6: int] : (v6 = 0 | ~ (cartesian_product2(v2, v3) = % 7.50/1.80 | v5) | ~ (ordered_pair(v0, v1) = v4) | ~ (in(v4, v5) = v6) | ~ % 7.50/1.80 | $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v7: any] : ? [v8: % 7.50/1.80 | any] : (in(v1, v3) = v8 & in(v0, v2) = v7 & ( ~ (v8 = 0) | ~ (v7 = % 7.50/1.80 | 0)))) % 7.50/1.80 | % 7.50/1.80 | ALPHA: (function-axioms) implies: % 7.50/1.80 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.50/1.80 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 7.50/1.80 | % 7.50/1.80 | DELTA: instantiating (t129_zfmisc_1) with fresh symbols all_15_0, all_15_1, % 7.50/1.80 | all_15_2, all_15_3, all_15_4, all_15_5, all_15_6, all_15_7, all_15_8 % 7.50/1.80 | gives: % 7.50/1.80 | (5) cartesian_product2(all_15_6, all_15_3) = all_15_2 & % 7.50/1.80 | ordered_pair(all_15_8, all_15_7) = all_15_4 & singleton(all_15_5) = % 7.50/1.80 | all_15_3 & in(all_15_4, all_15_2) = all_15_1 & in(all_15_8, all_15_6) = % 7.50/1.80 | all_15_0 & $i(all_15_2) & $i(all_15_3) & $i(all_15_4) & $i(all_15_5) & % 7.50/1.80 | $i(all_15_6) & $i(all_15_7) & $i(all_15_8) & ((all_15_0 = 0 & all_15_5 % 7.50/1.80 | = all_15_7 & ~ (all_15_1 = 0)) | (all_15_1 = 0 & ( ~ (all_15_0 = % 7.50/1.80 | 0) | ~ (all_15_5 = all_15_7)))) % 7.50/1.80 | % 7.50/1.80 | ALPHA: (5) implies: % 7.50/1.80 | (6) $i(all_15_8) % 7.50/1.80 | (7) $i(all_15_7) % 7.50/1.80 | (8) $i(all_15_6) % 7.50/1.80 | (9) $i(all_15_5) % 7.50/1.80 | (10) $i(all_15_3) % 7.50/1.80 | (11) in(all_15_8, all_15_6) = all_15_0 % 7.50/1.80 | (12) in(all_15_4, all_15_2) = all_15_1 % 7.50/1.80 | (13) singleton(all_15_5) = all_15_3 % 7.50/1.81 | (14) ordered_pair(all_15_8, all_15_7) = all_15_4 % 7.50/1.81 | (15) cartesian_product2(all_15_6, all_15_3) = all_15_2 % 7.50/1.81 | (16) (all_15_0 = 0 & all_15_5 = all_15_7 & ~ (all_15_1 = 0)) | (all_15_1 = % 7.50/1.81 | 0 & ( ~ (all_15_0 = 0) | ~ (all_15_5 = all_15_7))) % 7.50/1.81 | % 7.50/1.81 | GROUND_INST: instantiating (1) with all_15_5, all_15_3, simplifying with (9), % 7.50/1.81 | (10), (13) gives: % 7.50/1.81 | (17) ! [v0: any] : (v0 = all_15_5 | ~ (in(v0, all_15_3) = 0) | ~ $i(v0)) % 7.50/1.81 | & ! [v0: int] : (v0 = 0 | ~ (in(all_15_5, all_15_3) = v0)) % 7.50/1.81 | % 7.50/1.81 | ALPHA: (17) implies: % 7.50/1.81 | (18) ! [v0: int] : (v0 = 0 | ~ (in(all_15_5, all_15_3) = v0)) % 7.50/1.81 | (19) ! [v0: any] : (v0 = all_15_5 | ~ (in(v0, all_15_3) = 0) | ~ $i(v0)) % 7.50/1.81 | % 7.50/1.81 | GROUND_INST: instantiating (3) with all_15_8, all_15_7, all_15_6, all_15_3, % 7.50/1.81 | all_15_4, all_15_2, all_15_1, simplifying with (6), (7), (8), % 7.50/1.81 | (10), (12), (14), (15) gives: % 7.50/1.81 | (20) all_15_1 = 0 | ? [v0: any] : ? [v1: any] : (in(all_15_7, all_15_3) = % 7.50/1.81 | v1 & in(all_15_8, all_15_6) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 7.50/1.81 | % 7.50/1.81 | BETA: splitting (16) gives: % 7.50/1.81 | % 7.50/1.81 | Case 1: % 7.50/1.81 | | % 7.50/1.81 | | (21) all_15_0 = 0 & all_15_5 = all_15_7 & ~ (all_15_1 = 0) % 7.50/1.81 | | % 7.50/1.81 | | ALPHA: (21) implies: % 7.50/1.81 | | (22) all_15_5 = all_15_7 % 7.50/1.81 | | (23) all_15_0 = 0 % 7.50/1.81 | | (24) ~ (all_15_1 = 0) % 7.50/1.81 | | % 7.50/1.81 | | REDUCE: (11), (23) imply: % 7.50/1.81 | | (25) in(all_15_8, all_15_6) = 0 % 7.50/1.81 | | % 7.50/1.81 | | BETA: splitting (20) gives: % 7.50/1.81 | | % 7.50/1.81 | | Case 1: % 7.50/1.81 | | | % 7.50/1.81 | | | (26) all_15_1 = 0 % 7.50/1.81 | | | % 7.50/1.81 | | | REDUCE: (24), (26) imply: % 7.50/1.81 | | | (27) $false % 7.50/1.82 | | | % 7.50/1.82 | | | CLOSE: (27) is inconsistent. % 7.50/1.82 | | | % 7.50/1.82 | | Case 2: % 7.50/1.82 | | | % 7.50/1.82 | | | (28) ? [v0: any] : ? [v1: any] : (in(all_15_7, all_15_3) = v1 & % 7.50/1.82 | | | in(all_15_8, all_15_6) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 7.50/1.82 | | | % 7.50/1.82 | | | DELTA: instantiating (28) with fresh symbols all_36_0, all_36_1 gives: % 7.50/1.82 | | | (29) in(all_15_7, all_15_3) = all_36_0 & in(all_15_8, all_15_6) = % 7.50/1.82 | | | all_36_1 & ( ~ (all_36_0 = 0) | ~ (all_36_1 = 0)) % 7.50/1.82 | | | % 7.50/1.82 | | | ALPHA: (29) implies: % 7.50/1.82 | | | (30) in(all_15_8, all_15_6) = all_36_1 % 7.50/1.82 | | | (31) in(all_15_7, all_15_3) = all_36_0 % 7.50/1.82 | | | (32) ~ (all_36_0 = 0) | ~ (all_36_1 = 0) % 7.50/1.82 | | | % 7.50/1.82 | | | GROUND_INST: instantiating (4) with 0, all_36_1, all_15_6, all_15_8, % 7.50/1.82 | | | simplifying with (25), (30) gives: % 7.50/1.82 | | | (33) all_36_1 = 0 % 7.50/1.82 | | | % 7.50/1.82 | | | BETA: splitting (32) gives: % 7.50/1.82 | | | % 7.50/1.82 | | | Case 1: % 7.50/1.82 | | | | % 7.50/1.82 | | | | (34) ~ (all_36_0 = 0) % 7.50/1.82 | | | | % 7.50/1.82 | | | | GROUND_INST: instantiating (18) with all_36_0 gives: % 7.50/1.82 | | | | (35) all_36_0 = 0 | ~ (in(all_15_5, all_15_3) = all_36_0) % 7.50/1.82 | | | | % 7.50/1.82 | | | | BETA: splitting (35) gives: % 7.50/1.82 | | | | % 7.50/1.82 | | | | Case 1: % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | (36) ~ (in(all_15_5, all_15_3) = all_36_0) % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | REDUCE: (22), (36) imply: % 7.50/1.82 | | | | | (37) ~ (in(all_15_7, all_15_3) = all_36_0) % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | PRED_UNIFY: (31), (37) imply: % 7.50/1.82 | | | | | (38) $false % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | CLOSE: (38) is inconsistent. % 7.50/1.82 | | | | | % 7.50/1.82 | | | | Case 2: % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | (39) all_36_0 = 0 % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | REDUCE: (34), (39) imply: % 7.50/1.82 | | | | | (40) $false % 7.50/1.82 | | | | | % 7.50/1.82 | | | | | CLOSE: (40) is inconsistent. % 7.50/1.82 | | | | | % 7.50/1.82 | | | | End of split % 7.50/1.82 | | | | % 7.50/1.82 | | | Case 2: % 7.50/1.82 | | | | % 7.50/1.82 | | | | (41) ~ (all_36_1 = 0) % 7.50/1.82 | | | | % 7.50/1.82 | | | | REDUCE: (33), (41) imply: % 7.50/1.82 | | | | (42) $false % 7.50/1.82 | | | | % 7.50/1.82 | | | | CLOSE: (42) is inconsistent. % 7.50/1.82 | | | | % 7.50/1.82 | | | End of split % 7.50/1.82 | | | % 7.50/1.82 | | End of split % 7.50/1.82 | | % 7.50/1.82 | Case 2: % 7.50/1.82 | | % 7.50/1.82 | | (43) all_15_1 = 0 & ( ~ (all_15_0 = 0) | ~ (all_15_5 = all_15_7)) % 7.50/1.82 | | % 7.50/1.82 | | ALPHA: (43) implies: % 7.50/1.82 | | (44) all_15_1 = 0 % 7.50/1.82 | | (45) ~ (all_15_0 = 0) | ~ (all_15_5 = all_15_7) % 7.50/1.82 | | % 7.50/1.82 | | REDUCE: (12), (44) imply: % 7.50/1.82 | | (46) in(all_15_4, all_15_2) = 0 % 7.50/1.82 | | % 7.50/1.82 | | GROUND_INST: instantiating (2) with all_15_8, all_15_7, all_15_6, all_15_3, % 7.50/1.82 | | all_15_4, all_15_2, simplifying with (6), (7), (8), (10), (14), % 7.50/1.82 | | (15), (46) gives: % 7.50/1.82 | | (47) in(all_15_7, all_15_3) = 0 & in(all_15_8, all_15_6) = 0 % 7.50/1.82 | | % 7.50/1.82 | | ALPHA: (47) implies: % 7.50/1.83 | | (48) in(all_15_8, all_15_6) = 0 % 7.50/1.83 | | (49) in(all_15_7, all_15_3) = 0 % 7.50/1.83 | | % 7.50/1.83 | | GROUND_INST: instantiating (4) with all_15_0, 0, all_15_6, all_15_8, % 7.50/1.83 | | simplifying with (11), (48) gives: % 7.50/1.83 | | (50) all_15_0 = 0 % 7.50/1.83 | | % 7.50/1.83 | | BETA: splitting (45) gives: % 7.50/1.83 | | % 7.50/1.83 | | Case 1: % 7.50/1.83 | | | % 7.50/1.83 | | | (51) ~ (all_15_0 = 0) % 7.50/1.83 | | | % 7.50/1.83 | | | REDUCE: (50), (51) imply: % 7.50/1.83 | | | (52) $false % 7.50/1.83 | | | % 7.50/1.83 | | | CLOSE: (52) is inconsistent. % 7.50/1.83 | | | % 7.50/1.83 | | Case 2: % 7.50/1.83 | | | % 7.50/1.83 | | | (53) ~ (all_15_5 = all_15_7) % 7.50/1.83 | | | % 7.50/1.83 | | | GROUND_INST: instantiating (19) with all_15_7, simplifying with (7), (49) % 7.50/1.83 | | | gives: % 7.50/1.83 | | | (54) all_15_5 = all_15_7 % 7.50/1.83 | | | % 7.50/1.83 | | | REDUCE: (53), (54) imply: % 7.50/1.83 | | | (55) $false % 7.50/1.83 | | | % 7.50/1.83 | | | CLOSE: (55) is inconsistent. % 7.50/1.83 | | | % 7.50/1.83 | | End of split % 7.50/1.83 | | % 7.50/1.83 | End of split % 7.50/1.83 | % 7.50/1.83 End of proof % 7.50/1.83 % SZS output end Proof for theBenchmark % 7.50/1.83 % 7.50/1.83 1218ms %------------------------------------------------------------------------------