%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU040+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 17:42:22 EDT 2023 % Result : Theorem 7.35s 1.76s % Output : Proof 10.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU040+1 : TPTP v8.1.2. Released v3.2.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n003.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 12:54:07 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.59 ________ _____ % 0.20/0.59 ___ __ \_________(_)________________________________ % 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.59 % 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.59 (2023-06-19) % 0.20/0.59 % 0.20/0.59 (c) Philipp Rümmer, 2009-2023 % 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.59 Amanda Stjerna. % 0.20/0.59 Free software under BSD-3-Clause. % 0.20/0.59 % 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.59 % 0.20/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.49/1.06 Prover 4: Preprocessing ... % 2.49/1.06 Prover 1: Preprocessing ... % 2.93/1.11 Prover 2: Preprocessing ... % 2.93/1.11 Prover 6: Preprocessing ... % 2.93/1.11 Prover 5: Preprocessing ... % 2.93/1.11 Prover 3: Preprocessing ... % 2.93/1.11 Prover 0: Preprocessing ... % 5.66/1.50 Prover 1: Warning: ignoring some quantifiers % 5.66/1.50 Prover 5: Proving ... % 5.66/1.52 Prover 2: Proving ... % 5.66/1.53 Prover 1: Constructing countermodel ... % 5.66/1.55 Prover 6: Proving ... % 5.66/1.55 Prover 3: Warning: ignoring some quantifiers % 6.34/1.57 Prover 4: Warning: ignoring some quantifiers % 6.34/1.58 Prover 3: Constructing countermodel ... % 6.78/1.64 Prover 0: Proving ... % 6.78/1.65 Prover 4: Constructing countermodel ... % 7.35/1.76 Prover 3: proved (1141ms) % 7.35/1.76 % 7.35/1.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.35/1.76 % 7.35/1.76 Prover 6: stopped % 7.35/1.76 Prover 5: stopped % 7.35/1.76 Prover 2: stopped % 7.35/1.76 Prover 0: stopped % 7.35/1.77 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.35/1.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.35/1.77 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.35/1.77 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.35/1.77 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.84/1.83 Prover 11: Preprocessing ... % 7.84/1.84 Prover 7: Preprocessing ... % 8.48/1.86 Prover 10: Preprocessing ... % 8.48/1.87 Prover 8: Preprocessing ... % 8.62/1.89 Prover 13: Preprocessing ... % 8.62/1.96 Prover 7: Warning: ignoring some quantifiers % 8.62/1.98 Prover 7: Constructing countermodel ... % 8.62/2.00 Prover 10: Warning: ignoring some quantifiers % 8.62/2.01 Prover 13: Warning: ignoring some quantifiers % 8.62/2.02 Prover 8: Warning: ignoring some quantifiers % 8.62/2.02 Prover 10: Constructing countermodel ... % 8.62/2.03 Prover 13: Constructing countermodel ... % 8.62/2.03 Prover 8: Constructing countermodel ... % 9.82/2.10 Prover 11: Warning: ignoring some quantifiers % 9.82/2.12 Prover 11: Constructing countermodel ... % 9.82/2.13 Prover 1: Found proof (size 57) % 9.82/2.13 Prover 1: proved (1512ms) % 9.82/2.13 Prover 7: stopped % 9.82/2.13 Prover 8: stopped % 9.82/2.13 Prover 13: stopped % 9.82/2.13 Prover 4: stopped % 9.82/2.13 Prover 10: stopped % 9.82/2.13 Prover 11: stopped % 9.82/2.13 % 9.82/2.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.82/2.13 % 10.41/2.15 % SZS output start Proof for theBenchmark % 10.41/2.15 Assumptions after simplification: % 10.41/2.15 --------------------------------- % 10.41/2.15 % 10.41/2.15 (dt_k7_relat_1) % 10.60/2.17 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 10.60/2.17 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : % 10.60/2.17 (relation(v2) = v4 & relation(v0) = v3 & ( ~ (v3 = 0) | v4 = 0))) % 10.60/2.18 % 10.60/2.18 (fc13_relat_1) % 10.60/2.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 10.60/2.18 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? % 10.60/2.18 [v5: any] : ? [v6: any] : (relation_empty_yielding(v2) = v6 & % 10.60/2.18 relation_empty_yielding(v0) = v4 & relation(v2) = v5 & relation(v0) = v3 & % 10.60/2.18 ( ~ (v4 = 0) | ~ (v3 = 0) | (v6 = 0 & v5 = 0)))) % 10.60/2.18 % 10.60/2.18 (fc4_funct_1) % 10.60/2.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 10.60/2.18 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? % 10.60/2.18 [v5: any] : ? [v6: any] : (function(v2) = v6 & function(v0) = v4 & % 10.60/2.18 relation(v2) = v5 & relation(v0) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0) | (v6 = % 10.60/2.18 0 & v5 = 0)))) % 10.60/2.18 % 10.60/2.18 (fc5_relat_1) % 10.60/2.18 ! [v0: $i] : ! [v1: $i] : ( ~ (relation_dom(v0) = v1) | ~ $i(v0) | ? [v2: % 10.60/2.18 any] : ? [v3: any] : ? [v4: any] : (empty(v1) = v4 & empty(v0) = v2 & % 10.60/2.18 relation(v0) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0) | v2 = 0))) % 10.60/2.18 % 10.60/2.18 (fc6_relat_1) % 10.60/2.18 ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | ? [v2: % 10.60/2.18 any] : ? [v3: any] : ? [v4: any] : (empty(v1) = v4 & empty(v0) = v2 & % 10.60/2.18 relation(v0) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0) | v2 = 0))) % 10.60/2.18 % 10.60/2.18 (t76_funct_1) % 10.60/2.19 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.60/2.19 any] : ? [v6: $i] : ? [v7: $i] : ? [v8: any] : (subset(v6, v7) = v8 & % 10.60/2.19 subset(v3, v4) = v5 & relation_dom_restriction(v1, v0) = v2 & % 10.60/2.19 relation_rng(v2) = v6 & relation_rng(v1) = v7 & relation_dom(v2) = v3 & % 10.60/2.19 relation_dom(v1) = v4 & function(v1) = 0 & relation(v1) = 0 & $i(v7) & % 10.60/2.19 $i(v6) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ( ~ (v8 = 0) | ~ (v5 % 10.60/2.19 = 0))) % 10.60/2.19 % 10.60/2.19 (t89_relat_1) % 10.60/2.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.60/2.19 int] : (v5 = 0 | ~ (subset(v3, v4) = v5) | ~ (relation_dom_restriction(v1, % 10.60/2.19 v0) = v2) | ~ (relation_dom(v2) = v3) | ~ (relation_dom(v1) = v4) | ~ % 10.60/2.19 $i(v1) | ~ $i(v0) | ? [v6: int] : ( ~ (v6 = 0) & relation(v1) = v6)) % 10.60/2.19 % 10.60/2.19 (t99_relat_1) % 10.60/2.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.60/2.19 int] : (v5 = 0 | ~ (subset(v3, v4) = v5) | ~ (relation_dom_restriction(v1, % 10.60/2.19 v0) = v2) | ~ (relation_rng(v2) = v3) | ~ (relation_rng(v1) = v4) | ~ % 10.60/2.19 $i(v1) | ~ $i(v0) | ? [v6: int] : ( ~ (v6 = 0) & relation(v1) = v6)) % 10.60/2.19 % 10.60/2.19 (function-axioms) % 10.60/2.19 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 10.60/2.19 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & % 10.60/2.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.60/2.19 (relation_dom_restriction(v3, v2) = v1) | ~ (relation_dom_restriction(v3, % 10.60/2.19 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 10.60/2.19 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (element(v3, v2) = v1) | ~ % 10.60/2.19 (element(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.60/2.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = % 10.60/2.19 v1) | ~ (in(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 10.60/2.19 (v1 = v0 | ~ (relation_rng(v2) = v1) | ~ (relation_rng(v2) = v0)) & ! [v0: % 10.60/2.19 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (relation_dom(v2) = v1) | ~ % 10.60/2.19 (relation_dom(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.60/2.19 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (one_to_one(v2) = v1) | ~ % 10.60/2.19 (one_to_one(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.60/2.19 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (function(v2) = v1) | ~ % 10.60/2.19 (function(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | % 10.60/2.19 ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) & ! [v0: MultipleValueBool] % 10.60/2.19 : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ % 10.60/2.19 (relation_empty_yielding(v2) = v1) | ~ (relation_empty_yielding(v2) = v0)) % 10.60/2.19 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 % 10.60/2.19 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: % 10.60/2.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 10.60/2.20 ~ (relation(v2) = v1) | ~ (relation(v2) = v0)) % 10.60/2.20 % 10.60/2.20 Further assumptions not needed in the proof: % 10.60/2.20 -------------------------------------------- % 10.60/2.20 antisymmetry_r2_hidden, cc1_funct_1, cc1_relat_1, cc2_funct_1, % 10.60/2.20 existence_m1_subset_1, fc12_relat_1, fc1_subset_1, fc1_xboole_0, fc4_relat_1, % 10.60/2.20 fc7_relat_1, fc8_relat_1, rc1_funct_1, rc1_relat_1, rc1_subset_1, rc1_xboole_0, % 10.60/2.20 rc2_funct_1, rc2_relat_1, rc2_subset_1, rc2_xboole_0, rc3_funct_1, rc3_relat_1, % 10.60/2.20 reflexivity_r1_tarski, t1_subset, t2_subset, t3_subset, t4_subset, t5_subset, % 10.60/2.20 t6_boole, t7_boole, t8_boole % 10.60/2.20 % 10.60/2.20 Those formulas are unsatisfiable: % 10.60/2.20 --------------------------------- % 10.60/2.20 % 10.60/2.20 Begin of proof % 10.60/2.20 | % 10.60/2.20 | ALPHA: (function-axioms) implies: % 10.60/2.20 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 10.60/2.20 | (v1 = v0 | ~ (relation(v2) = v1) | ~ (relation(v2) = v0)) % 10.60/2.20 | % 10.60/2.20 | DELTA: instantiating (t76_funct_1) with fresh symbols all_47_0, all_47_1, % 10.60/2.20 | all_47_2, all_47_3, all_47_4, all_47_5, all_47_6, all_47_7, all_47_8 % 10.60/2.20 | gives: % 10.60/2.20 | (2) subset(all_47_2, all_47_1) = all_47_0 & subset(all_47_5, all_47_4) = % 10.60/2.20 | all_47_3 & relation_dom_restriction(all_47_7, all_47_8) = all_47_6 & % 10.60/2.20 | relation_rng(all_47_6) = all_47_2 & relation_rng(all_47_7) = all_47_1 & % 10.60/2.20 | relation_dom(all_47_6) = all_47_5 & relation_dom(all_47_7) = all_47_4 & % 10.60/2.20 | function(all_47_7) = 0 & relation(all_47_7) = 0 & $i(all_47_1) & % 10.60/2.20 | $i(all_47_2) & $i(all_47_4) & $i(all_47_5) & $i(all_47_6) & % 10.60/2.20 | $i(all_47_7) & $i(all_47_8) & ( ~ (all_47_0 = 0) | ~ (all_47_3 = 0)) % 10.60/2.20 | % 10.60/2.20 | ALPHA: (2) implies: % 10.60/2.20 | (3) $i(all_47_8) % 10.60/2.20 | (4) $i(all_47_7) % 10.60/2.20 | (5) relation(all_47_7) = 0 % 10.60/2.20 | (6) relation_dom(all_47_7) = all_47_4 % 10.60/2.20 | (7) relation_dom(all_47_6) = all_47_5 % 10.60/2.20 | (8) relation_rng(all_47_7) = all_47_1 % 10.60/2.20 | (9) relation_rng(all_47_6) = all_47_2 % 10.60/2.20 | (10) relation_dom_restriction(all_47_7, all_47_8) = all_47_6 % 10.60/2.20 | (11) subset(all_47_5, all_47_4) = all_47_3 % 10.60/2.20 | (12) subset(all_47_2, all_47_1) = all_47_0 % 10.60/2.20 | (13) ~ (all_47_0 = 0) | ~ (all_47_3 = 0) % 10.60/2.20 | % 10.60/2.20 | GROUND_INST: instantiating (fc5_relat_1) with all_47_7, all_47_4, simplifying % 10.60/2.20 | with (4), (6) gives: % 10.60/2.20 | (14) ? [v0: any] : ? [v1: any] : ? [v2: any] : (empty(all_47_4) = v2 & % 10.60/2.20 | empty(all_47_7) = v0 & relation(all_47_7) = v1 & ( ~ (v2 = 0) | ~ % 10.60/2.20 | (v1 = 0) | v0 = 0)) % 10.60/2.20 | % 10.60/2.20 | GROUND_INST: instantiating (fc6_relat_1) with all_47_7, all_47_1, simplifying % 10.60/2.20 | with (4), (8) gives: % 10.60/2.20 | (15) ? [v0: any] : ? [v1: any] : ? [v2: any] : (empty(all_47_1) = v2 & % 10.60/2.20 | empty(all_47_7) = v0 & relation(all_47_7) = v1 & ( ~ (v2 = 0) | ~ % 10.60/2.21 | (v1 = 0) | v0 = 0)) % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (fc4_funct_1) with all_47_7, all_47_8, all_47_6, % 10.60/2.21 | simplifying with (3), (4), (10) gives: % 10.60/2.21 | (16) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 10.60/2.21 | (function(all_47_6) = v3 & function(all_47_7) = v1 & % 10.60/2.21 | relation(all_47_6) = v2 & relation(all_47_7) = v0 & ( ~ (v1 = 0) | % 10.60/2.21 | ~ (v0 = 0) | (v3 = 0 & v2 = 0))) % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (fc13_relat_1) with all_47_7, all_47_8, all_47_6, % 10.60/2.21 | simplifying with (3), (4), (10) gives: % 10.60/2.21 | (17) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 10.60/2.21 | (relation_empty_yielding(all_47_6) = v3 & % 10.60/2.21 | relation_empty_yielding(all_47_7) = v1 & relation(all_47_6) = v2 & % 10.60/2.21 | relation(all_47_7) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0) | (v3 = 0 & v2 % 10.60/2.21 | = 0))) % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (dt_k7_relat_1) with all_47_7, all_47_8, all_47_6, % 10.60/2.21 | simplifying with (3), (4), (10) gives: % 10.60/2.21 | (18) ? [v0: any] : ? [v1: any] : (relation(all_47_6) = v1 & % 10.60/2.21 | relation(all_47_7) = v0 & ( ~ (v0 = 0) | v1 = 0)) % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (t89_relat_1) with all_47_8, all_47_7, all_47_6, % 10.60/2.21 | all_47_5, all_47_4, all_47_3, simplifying with (3), (4), (6), % 10.60/2.21 | (7), (10), (11) gives: % 10.60/2.21 | (19) all_47_3 = 0 | ? [v0: int] : ( ~ (v0 = 0) & relation(all_47_7) = v0) % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (t99_relat_1) with all_47_8, all_47_7, all_47_6, % 10.60/2.21 | all_47_2, all_47_1, all_47_0, simplifying with (3), (4), (8), % 10.60/2.21 | (9), (10), (12) gives: % 10.60/2.21 | (20) all_47_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & relation(all_47_7) = v0) % 10.60/2.21 | % 10.60/2.21 | DELTA: instantiating (18) with fresh symbols all_57_0, all_57_1 gives: % 10.60/2.21 | (21) relation(all_47_6) = all_57_0 & relation(all_47_7) = all_57_1 & ( ~ % 10.60/2.21 | (all_57_1 = 0) | all_57_0 = 0) % 10.60/2.21 | % 10.60/2.21 | ALPHA: (21) implies: % 10.60/2.21 | (22) relation(all_47_7) = all_57_1 % 10.60/2.21 | % 10.60/2.21 | DELTA: instantiating (14) with fresh symbols all_65_0, all_65_1, all_65_2 % 10.60/2.21 | gives: % 10.60/2.21 | (23) empty(all_47_4) = all_65_0 & empty(all_47_7) = all_65_2 & % 10.60/2.21 | relation(all_47_7) = all_65_1 & ( ~ (all_65_0 = 0) | ~ (all_65_1 = 0) % 10.60/2.21 | | all_65_2 = 0) % 10.60/2.21 | % 10.60/2.21 | ALPHA: (23) implies: % 10.60/2.21 | (24) relation(all_47_7) = all_65_1 % 10.60/2.21 | % 10.60/2.21 | DELTA: instantiating (15) with fresh symbols all_67_0, all_67_1, all_67_2 % 10.60/2.21 | gives: % 10.60/2.21 | (25) empty(all_47_1) = all_67_0 & empty(all_47_7) = all_67_2 & % 10.60/2.21 | relation(all_47_7) = all_67_1 & ( ~ (all_67_0 = 0) | ~ (all_67_1 = 0) % 10.60/2.21 | | all_67_2 = 0) % 10.60/2.21 | % 10.60/2.21 | ALPHA: (25) implies: % 10.60/2.21 | (26) relation(all_47_7) = all_67_1 % 10.60/2.21 | % 10.60/2.21 | DELTA: instantiating (17) with fresh symbols all_75_0, all_75_1, all_75_2, % 10.60/2.21 | all_75_3 gives: % 10.60/2.21 | (27) relation_empty_yielding(all_47_6) = all_75_0 & % 10.60/2.21 | relation_empty_yielding(all_47_7) = all_75_2 & relation(all_47_6) = % 10.60/2.21 | all_75_1 & relation(all_47_7) = all_75_3 & ( ~ (all_75_2 = 0) | ~ % 10.60/2.21 | (all_75_3 = 0) | (all_75_0 = 0 & all_75_1 = 0)) % 10.60/2.21 | % 10.60/2.21 | ALPHA: (27) implies: % 10.60/2.21 | (28) relation(all_47_7) = all_75_3 % 10.60/2.21 | % 10.60/2.21 | DELTA: instantiating (16) with fresh symbols all_77_0, all_77_1, all_77_2, % 10.60/2.21 | all_77_3 gives: % 10.60/2.21 | (29) function(all_47_6) = all_77_0 & function(all_47_7) = all_77_2 & % 10.60/2.21 | relation(all_47_6) = all_77_1 & relation(all_47_7) = all_77_3 & ( ~ % 10.60/2.21 | (all_77_2 = 0) | ~ (all_77_3 = 0) | (all_77_0 = 0 & all_77_1 = 0)) % 10.60/2.21 | % 10.60/2.21 | ALPHA: (29) implies: % 10.60/2.21 | (30) relation(all_47_7) = all_77_3 % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (1) with 0, all_65_1, all_47_7, simplifying with % 10.60/2.21 | (5), (24) gives: % 10.60/2.21 | (31) all_65_1 = 0 % 10.60/2.21 | % 10.60/2.21 | GROUND_INST: instantiating (1) with all_75_3, all_77_3, all_47_7, simplifying % 10.60/2.21 | with (28), (30) gives: % 10.60/2.21 | (32) all_77_3 = all_75_3 % 10.60/2.21 | % 10.60/2.22 | GROUND_INST: instantiating (1) with all_67_1, all_77_3, all_47_7, simplifying % 10.60/2.22 | with (26), (30) gives: % 10.60/2.22 | (33) all_77_3 = all_67_1 % 10.60/2.22 | % 10.60/2.22 | GROUND_INST: instantiating (1) with all_65_1, all_77_3, all_47_7, simplifying % 10.60/2.22 | with (24), (30) gives: % 10.60/2.22 | (34) all_77_3 = all_65_1 % 10.60/2.22 | % 10.60/2.22 | GROUND_INST: instantiating (1) with all_57_1, all_77_3, all_47_7, simplifying % 10.60/2.22 | with (22), (30) gives: % 10.60/2.22 | (35) all_77_3 = all_57_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (32), (35) imply: % 10.60/2.22 | (36) all_75_3 = all_57_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (32), (34) imply: % 10.60/2.22 | (37) all_75_3 = all_65_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (32), (33) imply: % 10.60/2.22 | (38) all_75_3 = all_67_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (36), (38) imply: % 10.60/2.22 | (39) all_67_1 = all_57_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (37), (38) imply: % 10.60/2.22 | (40) all_67_1 = all_65_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (39), (40) imply: % 10.60/2.22 | (41) all_65_1 = all_57_1 % 10.60/2.22 | % 10.60/2.22 | SIMP: (41) implies: % 10.60/2.22 | (42) all_65_1 = all_57_1 % 10.60/2.22 | % 10.60/2.22 | COMBINE_EQS: (31), (42) imply: % 10.60/2.22 | (43) all_57_1 = 0 % 10.60/2.22 | % 10.60/2.22 | BETA: splitting (20) gives: % 10.60/2.22 | % 10.60/2.22 | Case 1: % 10.60/2.22 | | % 10.60/2.22 | | (44) all_47_0 = 0 % 10.60/2.22 | | % 10.60/2.22 | | BETA: splitting (19) gives: % 10.60/2.22 | | % 10.60/2.22 | | Case 1: % 10.60/2.22 | | | % 10.60/2.22 | | | (45) all_47_3 = 0 % 10.60/2.22 | | | % 10.60/2.22 | | | BETA: splitting (13) gives: % 10.60/2.22 | | | % 10.60/2.22 | | | Case 1: % 10.60/2.22 | | | | % 10.60/2.22 | | | | (46) ~ (all_47_0 = 0) % 10.60/2.22 | | | | % 10.60/2.22 | | | | REDUCE: (44), (46) imply: % 10.60/2.22 | | | | (47) $false % 10.60/2.22 | | | | % 10.60/2.22 | | | | CLOSE: (47) is inconsistent. % 10.60/2.22 | | | | % 10.60/2.22 | | | Case 2: % 10.60/2.22 | | | | % 10.60/2.22 | | | | (48) ~ (all_47_3 = 0) % 10.60/2.22 | | | | % 10.60/2.22 | | | | REDUCE: (45), (48) imply: % 10.60/2.22 | | | | (49) $false % 10.60/2.22 | | | | % 10.60/2.22 | | | | CLOSE: (49) is inconsistent. % 10.60/2.22 | | | | % 10.60/2.22 | | | End of split % 10.60/2.22 | | | % 10.60/2.22 | | Case 2: % 10.60/2.22 | | | % 10.60/2.22 | | | (50) ? [v0: int] : ( ~ (v0 = 0) & relation(all_47_7) = v0) % 10.60/2.22 | | | % 10.60/2.22 | | | DELTA: instantiating (50) with fresh symbol all_103_0 gives: % 10.60/2.22 | | | (51) ~ (all_103_0 = 0) & relation(all_47_7) = all_103_0 % 10.60/2.22 | | | % 10.60/2.22 | | | ALPHA: (51) implies: % 10.60/2.22 | | | (52) ~ (all_103_0 = 0) % 10.60/2.22 | | | (53) relation(all_47_7) = all_103_0 % 10.60/2.22 | | | % 10.60/2.22 | | | GROUND_INST: instantiating (1) with 0, all_103_0, all_47_7, simplifying % 10.60/2.22 | | | with (5), (53) gives: % 10.60/2.22 | | | (54) all_103_0 = 0 % 10.60/2.22 | | | % 10.60/2.22 | | | REDUCE: (52), (54) imply: % 10.60/2.22 | | | (55) $false % 10.60/2.22 | | | % 10.60/2.22 | | | CLOSE: (55) is inconsistent. % 10.60/2.22 | | | % 10.60/2.22 | | End of split % 10.60/2.22 | | % 10.60/2.22 | Case 2: % 10.60/2.22 | | % 10.60/2.22 | | (56) ? [v0: int] : ( ~ (v0 = 0) & relation(all_47_7) = v0) % 10.60/2.22 | | % 10.60/2.22 | | DELTA: instantiating (56) with fresh symbol all_99_0 gives: % 10.60/2.22 | | (57) ~ (all_99_0 = 0) & relation(all_47_7) = all_99_0 % 10.60/2.22 | | % 10.60/2.22 | | ALPHA: (57) implies: % 10.60/2.22 | | (58) ~ (all_99_0 = 0) % 10.60/2.22 | | (59) relation(all_47_7) = all_99_0 % 10.60/2.22 | | % 10.60/2.22 | | DELTA: instantiating (56) with fresh symbol all_105_0 gives: % 10.60/2.22 | | (60) ~ (all_105_0 = 0) & relation(all_47_7) = all_105_0 % 10.60/2.22 | | % 10.60/2.22 | | ALPHA: (60) implies: % 10.60/2.22 | | (61) relation(all_47_7) = all_105_0 % 10.60/2.22 | | % 10.60/2.22 | | GROUND_INST: instantiating (1) with 0, all_105_0, all_47_7, simplifying with % 10.60/2.22 | | (5), (61) gives: % 10.60/2.22 | | (62) all_105_0 = 0 % 10.60/2.22 | | % 10.60/2.22 | | GROUND_INST: instantiating (1) with all_99_0, all_105_0, all_47_7, % 10.60/2.22 | | simplifying with (59), (61) gives: % 10.60/2.22 | | (63) all_105_0 = all_99_0 % 10.60/2.22 | | % 10.60/2.22 | | COMBINE_EQS: (62), (63) imply: % 10.60/2.22 | | (64) all_99_0 = 0 % 10.60/2.22 | | % 10.60/2.22 | | REDUCE: (58), (64) imply: % 10.60/2.22 | | (65) $false % 10.60/2.22 | | % 10.60/2.22 | | CLOSE: (65) is inconsistent. % 10.60/2.22 | | % 10.60/2.23 | End of split % 10.60/2.23 | % 10.60/2.23 End of proof % 10.60/2.23 % SZS output end Proof for theBenchmark % 10.60/2.23 % 10.60/2.23 1630ms %------------------------------------------------------------------------------