%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS129+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n013.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 05:51:21 EDT 2023 % Result : Theorem 6.83s 1.67s % Output : Proof 8.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS129+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n013.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Mon Aug 28 01:56:47 EDT 2023 % 0.12/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/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.61 Running up to 7 provers in parallel. % 0.18/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.61/1.05 Prover 4: Preprocessing ... % 2.61/1.05 Prover 1: Preprocessing ... % 2.61/1.09 Prover 5: Preprocessing ... % 2.61/1.09 Prover 0: Preprocessing ... % 2.61/1.09 Prover 6: Preprocessing ... % 2.61/1.09 Prover 2: Preprocessing ... % 2.61/1.09 Prover 3: Preprocessing ... % 4.07/1.34 Prover 5: Proving ... % 4.77/1.34 Prover 2: Proving ... % 4.77/1.39 Prover 6: Proving ... % 4.77/1.40 Prover 1: Constructing countermodel ... % 4.77/1.42 Prover 3: Constructing countermodel ... % 4.77/1.46 Prover 4: Constructing countermodel ... % 4.77/1.49 Prover 0: Proving ... % 6.52/1.64 Prover 3: gave up % 6.83/1.64 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.83/1.66 Prover 0: proved (1044ms) % 6.83/1.67 % 6.83/1.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.83/1.67 % 6.83/1.68 Prover 6: stopped % 6.83/1.69 Prover 5: stopped % 6.83/1.69 Prover 2: stopped % 6.83/1.69 Prover 7: Preprocessing ... % 6.83/1.69 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.83/1.69 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.83/1.69 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.83/1.69 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.83/1.70 Prover 1: gave up % 6.83/1.71 Prover 4: Found proof (size 49) % 6.83/1.71 Prover 4: proved (1088ms) % 6.83/1.71 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 6.83/1.73 Prover 10: Preprocessing ... % 6.83/1.73 Prover 8: Preprocessing ... % 6.83/1.74 Prover 10: stopped % 7.50/1.74 Prover 11: Preprocessing ... % 7.50/1.74 Prover 13: Preprocessing ... % 7.50/1.75 Prover 16: Preprocessing ... % 7.50/1.76 Prover 13: stopped % 7.50/1.76 Prover 16: stopped % 7.50/1.77 Prover 7: Warning: ignoring some quantifiers % 7.50/1.77 Prover 7: Constructing countermodel ... % 7.50/1.78 Prover 7: stopped % 7.50/1.78 Prover 11: stopped % 7.86/1.82 Prover 8: Warning: ignoring some quantifiers % 7.86/1.82 Prover 8: Constructing countermodel ... % 7.86/1.83 Prover 8: stopped % 7.86/1.83 % 7.86/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.86/1.83 % 7.86/1.84 % SZS output start Proof for theBenchmark % 7.86/1.84 Assumptions after simplification: % 7.86/1.84 --------------------------------- % 7.86/1.84 % 7.86/1.84 (axiom_0) % 8.18/1.87 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) & % 8.18/1.87 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 8.18/1.87 % 8.18/1.87 (axiom_1) % 8.18/1.87 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) | % 8.18/1.87 xsd_integer(v0) = 0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 8.18/1.87 (xsd_integer(v0) = v1) | ~ $i(v0) | xsd_string(v0) = 0) & ! [v0: $i] : ( ~ % 8.18/1.87 (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 8.18/1.87 xsd_integer(v0) = v1)) & ! [v0: $i] : ( ~ (xsd_integer(v0) = 0) | ~ % 8.18/1.87 $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & xsd_string(v0) = v1)) % 8.18/1.87 % 8.18/1.87 (axiom_13) % 8.18/1.87 rhasEuroMP(iUK, iKinnock) = 0 & $i(iKinnock) & $i(iUK) % 8.18/1.87 % 8.18/1.87 (axiom_3) % 8.18/1.88 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (risEuroMPFrom(v0, v2) % 8.18/1.88 = 0) | ~ (cEuroMP(v0) = v1) | ~ $i(v2) | ~ $i(v0) | ? [v3: int] : ( ~ % 8.18/1.88 (v3 = 0) & cowlThing(v2) = v3)) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] % 8.18/1.88 : (v1 = 0 | ~ (cowlThing(v2) = 0) | ~ (cEuroMP(v0) = v1) | ~ $i(v2) | ~ % 8.18/1.88 $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & risEuroMPFrom(v0, v2) = v3)) & ! % 8.18/1.88 [v0: $i] : ( ~ (cEuroMP(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 8.18/1.88 (risEuroMPFrom(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1))) % 8.18/1.88 % 8.18/1.88 (axiom_5) % 8.18/1.88 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (risEuroMPFrom(v0, v1) % 8.18/1.88 = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 8.18/1.88 rhasEuroMP(v1, v0) = v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 % 8.18/1.88 = 0 | ~ (rhasEuroMP(v1, v0) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : % 8.18/1.88 ( ~ (v3 = 0) & risEuroMPFrom(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( % 8.18/1.88 ~ (risEuroMPFrom(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | rhasEuroMP(v1, v0) = % 8.18/1.88 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (rhasEuroMP(v1, v0) = 0) | ~ $i(v1) | % 8.18/1.88 ~ $i(v0) | risEuroMPFrom(v0, v1) = 0) % 8.18/1.88 % 8.18/1.88 (the_axiom) % 8.18/1.88 $i(iKinnock) & ? [v0: any] : ? [v1: $i] : ? [v2: any] : ? [v3: any] : ? % 8.18/1.88 [v4: $i] : ? [v5: any] : ? [v6: any] : (cEuroMP(iKinnock) = v0 & $i(v4) & % 8.18/1.88 $i(v1) & ( ~ (v0 = 0) | (xsd_string(v1) = v2 & xsd_integer(v1) = v3 & ((v3 = % 8.18/1.88 0 & v2 = 0) | ( ~ (v3 = 0) & ~ (v2 = 0)))) | (cowlThing(v4) = v5 & % 8.18/1.88 cowlNothing(v4) = v6 & ( ~ (v5 = 0) | v6 = 0)))) % 8.18/1.88 % 8.18/1.88 (function-axioms) % 8.18/1.89 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.18/1.89 [v3: $i] : (v1 = v0 | ~ (risEuroMPFrom(v3, v2) = v1) | ~ (risEuroMPFrom(v3, % 8.18/1.89 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 8.18/1.89 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (rhasEuroMP(v3, v2) = v1) | ~ % 8.18/1.89 (rhasEuroMP(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ % 8.18/1.89 (xsd_string(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ % 8.18/1.89 (xsd_integer(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ % 8.18/1.89 (cowlThing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ % 8.18/1.89 (cowlNothing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cPerson(v2) = v1) | ~ % 8.18/1.89 (cPerson(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cEuropeanCountry(v2) = v1) % 8.18/1.89 | ~ (cEuropeanCountry(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cEuroMP(v2) = v1) | ~ % 8.18/1.89 (cEuroMP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.18/1.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cEUCountry(v2) = v1) | ~ % 8.18/1.89 (cEUCountry(v2) = v0)) % 8.18/1.89 % 8.18/1.89 Further assumptions not needed in the proof: % 8.18/1.89 -------------------------------------------- % 8.18/1.89 axiom_10, axiom_11, axiom_12, axiom_2, axiom_4, axiom_6, axiom_7, axiom_8, % 8.18/1.89 axiom_9, cEUCountry_substitution_1, cEuroMP_substitution_1, % 8.18/1.89 cEuropeanCountry_substitution_1, cPerson_substitution_1, % 8.18/1.89 cowlNothing_substitution_1, cowlThing_substitution_1, rhasEuroMP_substitution_1, % 8.18/1.89 rhasEuroMP_substitution_2, risEuroMPFrom_substitution_1, % 8.18/1.89 risEuroMPFrom_substitution_2, xsd_integer_substitution_1, % 8.18/1.89 xsd_string_substitution_1 % 8.18/1.89 % 8.18/1.89 Those formulas are unsatisfiable: % 8.18/1.89 --------------------------------- % 8.18/1.89 % 8.18/1.89 Begin of proof % 8.18/1.89 | % 8.18/1.89 | ALPHA: (axiom_0) implies: % 8.18/1.89 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 8.18/1.89 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ % 8.18/1.89 | $i(v0)) % 8.18/1.89 | % 8.18/1.89 | ALPHA: (axiom_1) implies: % 8.18/1.89 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 8.18/1.89 | (v1 = 0) & xsd_integer(v0) = v1)) % 8.18/1.90 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~ % 8.18/1.90 | $i(v0) | xsd_string(v0) = 0) % 8.18/1.90 | % 8.18/1.90 | ALPHA: (axiom_3) implies: % 8.18/1.90 | (5) ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ % 8.18/1.90 | (risEuroMPFrom(v0, v2) = 0) | ~ (cEuroMP(v0) = v1) | ~ $i(v2) | ~ % 8.18/1.90 | $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & cowlThing(v2) = v3)) % 8.18/1.90 | % 8.18/1.90 | ALPHA: (axiom_5) implies: % 8.18/1.90 | (6) ! [v0: $i] : ! [v1: $i] : ( ~ (rhasEuroMP(v1, v0) = 0) | ~ $i(v1) | % 8.18/1.90 | ~ $i(v0) | risEuroMPFrom(v0, v1) = 0) % 8.18/1.90 | % 8.18/1.90 | ALPHA: (axiom_13) implies: % 8.18/1.90 | (7) $i(iUK) % 8.18/1.90 | (8) rhasEuroMP(iUK, iKinnock) = 0 % 8.18/1.90 | % 8.18/1.90 | ALPHA: (the_axiom) implies: % 8.18/1.90 | (9) $i(iKinnock) % 8.18/1.90 | (10) ? [v0: any] : ? [v1: $i] : ? [v2: any] : ? [v3: any] : ? [v4: $i] % 8.18/1.90 | : ? [v5: any] : ? [v6: any] : (cEuroMP(iKinnock) = v0 & $i(v4) & % 8.18/1.90 | $i(v1) & ( ~ (v0 = 0) | (xsd_string(v1) = v2 & xsd_integer(v1) = v3 % 8.18/1.90 | & ((v3 = 0 & v2 = 0) | ( ~ (v3 = 0) & ~ (v2 = 0)))) | % 8.18/1.90 | (cowlThing(v4) = v5 & cowlNothing(v4) = v6 & ( ~ (v5 = 0) | v6 = % 8.18/1.90 | 0)))) % 8.18/1.90 | % 8.18/1.90 | ALPHA: (function-axioms) implies: % 8.40/1.90 | (11) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 8.40/1.90 | : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 8.40/1.90 | (12) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 8.40/1.90 | : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 8.40/1.90 | % 8.40/1.90 | DELTA: instantiating (10) with fresh symbols all_10_0, all_10_1, all_10_2, % 8.40/1.90 | all_10_3, all_10_4, all_10_5, all_10_6 gives: % 8.40/1.90 | (13) cEuroMP(iKinnock) = all_10_6 & $i(all_10_2) & $i(all_10_5) & ( ~ % 8.40/1.90 | (all_10_6 = 0) | (xsd_string(all_10_5) = all_10_4 & % 8.40/1.90 | xsd_integer(all_10_5) = all_10_3 & ((all_10_3 = 0 & all_10_4 = 0) % 8.40/1.90 | | ( ~ (all_10_3 = 0) & ~ (all_10_4 = 0)))) | % 8.40/1.90 | (cowlThing(all_10_2) = all_10_1 & cowlNothing(all_10_2) = all_10_0 & % 8.40/1.90 | ( ~ (all_10_1 = 0) | all_10_0 = 0))) % 8.40/1.90 | % 8.40/1.90 | ALPHA: (13) implies: % 8.40/1.90 | (14) $i(all_10_5) % 8.40/1.90 | (15) $i(all_10_2) % 8.40/1.90 | (16) cEuroMP(iKinnock) = all_10_6 % 8.40/1.90 | (17) ~ (all_10_6 = 0) | (xsd_string(all_10_5) = all_10_4 & % 8.40/1.90 | xsd_integer(all_10_5) = all_10_3 & ((all_10_3 = 0 & all_10_4 = 0) | % 8.40/1.90 | ( ~ (all_10_3 = 0) & ~ (all_10_4 = 0)))) | (cowlThing(all_10_2) = % 8.40/1.90 | all_10_1 & cowlNothing(all_10_2) = all_10_0 & ( ~ (all_10_1 = 0) | % 8.40/1.90 | all_10_0 = 0)) % 8.40/1.90 | % 8.40/1.91 | GROUND_INST: instantiating (6) with iKinnock, iUK, simplifying with (7), (8), % 8.40/1.91 | (9) gives: % 8.40/1.91 | (18) risEuroMPFrom(iKinnock, iUK) = 0 % 8.40/1.91 | % 8.40/1.91 | GROUND_INST: instantiating (5) with iKinnock, all_10_6, iUK, simplifying with % 8.40/1.91 | (7), (9), (16), (18) gives: % 8.40/1.91 | (19) all_10_6 = 0 | ? [v0: int] : ( ~ (v0 = 0) & cowlThing(iUK) = v0) % 8.40/1.91 | % 8.40/1.91 | BETA: splitting (17) gives: % 8.40/1.91 | % 8.40/1.91 | Case 1: % 8.40/1.91 | | % 8.40/1.91 | | (20) ~ (all_10_6 = 0) % 8.40/1.91 | | % 8.40/1.91 | | BETA: splitting (19) gives: % 8.40/1.91 | | % 8.40/1.91 | | Case 1: % 8.40/1.91 | | | % 8.40/1.91 | | | (21) all_10_6 = 0 % 8.40/1.91 | | | % 8.40/1.91 | | | REDUCE: (20), (21) imply: % 8.40/1.91 | | | (22) $false % 8.40/1.91 | | | % 8.40/1.91 | | | CLOSE: (22) is inconsistent. % 8.40/1.91 | | | % 8.40/1.91 | | Case 2: % 8.40/1.91 | | | % 8.40/1.91 | | | (23) ? [v0: int] : ( ~ (v0 = 0) & cowlThing(iUK) = v0) % 8.40/1.91 | | | % 8.40/1.91 | | | DELTA: instantiating (23) with fresh symbol all_29_0 gives: % 8.40/1.91 | | | (24) ~ (all_29_0 = 0) & cowlThing(iUK) = all_29_0 % 8.40/1.91 | | | % 8.40/1.91 | | | ALPHA: (24) implies: % 8.40/1.91 | | | (25) ~ (all_29_0 = 0) % 8.40/1.91 | | | (26) cowlThing(iUK) = all_29_0 % 8.40/1.91 | | | % 8.40/1.91 | | | GROUND_INST: instantiating (2) with iUK, all_29_0, simplifying with (7), % 8.40/1.91 | | | (26) gives: % 8.40/1.91 | | | (27) all_29_0 = 0 % 8.40/1.91 | | | % 8.40/1.91 | | | REDUCE: (25), (27) imply: % 8.40/1.91 | | | (28) $false % 8.40/1.91 | | | % 8.40/1.91 | | | CLOSE: (28) is inconsistent. % 8.40/1.91 | | | % 8.40/1.91 | | End of split % 8.40/1.91 | | % 8.40/1.91 | Case 2: % 8.40/1.91 | | % 8.40/1.91 | | (29) (xsd_string(all_10_5) = all_10_4 & xsd_integer(all_10_5) = all_10_3 % 8.40/1.91 | | & ((all_10_3 = 0 & all_10_4 = 0) | ( ~ (all_10_3 = 0) & ~ % 8.40/1.91 | | (all_10_4 = 0)))) | (cowlThing(all_10_2) = all_10_1 & % 8.40/1.91 | | cowlNothing(all_10_2) = all_10_0 & ( ~ (all_10_1 = 0) | all_10_0 = % 8.40/1.91 | | 0)) % 8.40/1.91 | | % 8.40/1.91 | | BETA: splitting (29) gives: % 8.40/1.91 | | % 8.40/1.91 | | Case 1: % 8.40/1.91 | | | % 8.40/1.91 | | | (30) xsd_string(all_10_5) = all_10_4 & xsd_integer(all_10_5) = all_10_3 % 8.40/1.91 | | | & ((all_10_3 = 0 & all_10_4 = 0) | ( ~ (all_10_3 = 0) & ~ % 8.40/1.91 | | | (all_10_4 = 0))) % 8.40/1.91 | | | % 8.40/1.91 | | | ALPHA: (30) implies: % 8.40/1.91 | | | (31) xsd_integer(all_10_5) = all_10_3 % 8.40/1.91 | | | (32) xsd_string(all_10_5) = all_10_4 % 8.40/1.91 | | | (33) (all_10_3 = 0 & all_10_4 = 0) | ( ~ (all_10_3 = 0) & ~ (all_10_4 % 8.40/1.91 | | | = 0)) % 8.40/1.91 | | | % 8.40/1.91 | | | GROUND_INST: instantiating (4) with all_10_5, all_10_3, simplifying with % 8.40/1.91 | | | (14), (31) gives: % 8.40/1.91 | | | (34) all_10_3 = 0 | xsd_string(all_10_5) = 0 % 8.40/1.91 | | | % 8.40/1.91 | | | BETA: splitting (33) gives: % 8.40/1.91 | | | % 8.40/1.91 | | | Case 1: % 8.40/1.91 | | | | % 8.40/1.91 | | | | (35) all_10_3 = 0 & all_10_4 = 0 % 8.40/1.91 | | | | % 8.40/1.91 | | | | ALPHA: (35) implies: % 8.40/1.91 | | | | (36) all_10_4 = 0 % 8.40/1.91 | | | | (37) all_10_3 = 0 % 8.40/1.91 | | | | % 8.40/1.91 | | | | REDUCE: (32), (36) imply: % 8.40/1.91 | | | | (38) xsd_string(all_10_5) = 0 % 8.40/1.91 | | | | % 8.40/1.91 | | | | REDUCE: (31), (37) imply: % 8.40/1.91 | | | | (39) xsd_integer(all_10_5) = 0 % 8.40/1.91 | | | | % 8.40/1.92 | | | | GROUND_INST: instantiating (3) with all_10_5, simplifying with (14), % 8.40/1.92 | | | | (38) gives: % 8.40/1.92 | | | | (40) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_10_5) = v0) % 8.40/1.92 | | | | % 8.40/1.92 | | | | DELTA: instantiating (40) with fresh symbol all_63_0 gives: % 8.40/1.92 | | | | (41) ~ (all_63_0 = 0) & xsd_integer(all_10_5) = all_63_0 % 8.40/1.92 | | | | % 8.40/1.92 | | | | ALPHA: (41) implies: % 8.40/1.92 | | | | (42) ~ (all_63_0 = 0) % 8.40/1.92 | | | | (43) xsd_integer(all_10_5) = all_63_0 % 8.40/1.92 | | | | % 8.40/1.92 | | | | GROUND_INST: instantiating (11) with 0, all_63_0, all_10_5, simplifying % 8.40/1.92 | | | | with (39), (43) gives: % 8.40/1.92 | | | | (44) all_63_0 = 0 % 8.40/1.92 | | | | % 8.40/1.92 | | | | REDUCE: (42), (44) imply: % 8.40/1.92 | | | | (45) $false % 8.40/1.92 | | | | % 8.40/1.92 | | | | CLOSE: (45) is inconsistent. % 8.40/1.92 | | | | % 8.40/1.92 | | | Case 2: % 8.40/1.92 | | | | % 8.40/1.92 | | | | (46) ~ (all_10_3 = 0) & ~ (all_10_4 = 0) % 8.40/1.92 | | | | % 8.40/1.92 | | | | ALPHA: (46) implies: % 8.40/1.92 | | | | (47) ~ (all_10_4 = 0) % 8.40/1.92 | | | | (48) ~ (all_10_3 = 0) % 8.40/1.92 | | | | % 8.40/1.92 | | | | BETA: splitting (34) gives: % 8.40/1.92 | | | | % 8.40/1.92 | | | | Case 1: % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | (49) xsd_string(all_10_5) = 0 % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | GROUND_INST: instantiating (12) with all_10_4, 0, all_10_5, % 8.40/1.92 | | | | | simplifying with (32), (49) gives: % 8.40/1.92 | | | | | (50) all_10_4 = 0 % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | REDUCE: (47), (50) imply: % 8.40/1.92 | | | | | (51) $false % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | CLOSE: (51) is inconsistent. % 8.40/1.92 | | | | | % 8.40/1.92 | | | | Case 2: % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | (52) all_10_3 = 0 % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | REDUCE: (48), (52) imply: % 8.40/1.92 | | | | | (53) $false % 8.40/1.92 | | | | | % 8.40/1.92 | | | | | CLOSE: (53) is inconsistent. % 8.40/1.92 | | | | | % 8.40/1.92 | | | | End of split % 8.40/1.92 | | | | % 8.40/1.92 | | | End of split % 8.40/1.92 | | | % 8.40/1.92 | | Case 2: % 8.40/1.92 | | | % 8.40/1.92 | | | (54) cowlThing(all_10_2) = all_10_1 & cowlNothing(all_10_2) = all_10_0 % 8.40/1.92 | | | & ( ~ (all_10_1 = 0) | all_10_0 = 0) % 8.40/1.92 | | | % 8.40/1.92 | | | ALPHA: (54) implies: % 8.40/1.92 | | | (55) cowlNothing(all_10_2) = all_10_0 % 8.40/1.92 | | | (56) cowlThing(all_10_2) = all_10_1 % 8.40/1.92 | | | (57) ~ (all_10_1 = 0) | all_10_0 = 0 % 8.40/1.92 | | | % 8.40/1.92 | | | GROUND_INST: instantiating (2) with all_10_2, all_10_1, simplifying with % 8.40/1.92 | | | (15), (56) gives: % 8.40/1.92 | | | (58) all_10_1 = 0 % 8.40/1.92 | | | % 8.40/1.92 | | | BETA: splitting (57) gives: % 8.40/1.92 | | | % 8.40/1.92 | | | Case 1: % 8.40/1.92 | | | | % 8.40/1.92 | | | | (59) ~ (all_10_1 = 0) % 8.40/1.92 | | | | % 8.40/1.92 | | | | REDUCE: (58), (59) imply: % 8.40/1.92 | | | | (60) $false % 8.40/1.92 | | | | % 8.40/1.92 | | | | CLOSE: (60) is inconsistent. % 8.40/1.92 | | | | % 8.40/1.92 | | | Case 2: % 8.40/1.92 | | | | % 8.40/1.92 | | | | (61) all_10_0 = 0 % 8.40/1.92 | | | | % 8.40/1.92 | | | | REDUCE: (55), (61) imply: % 8.40/1.92 | | | | (62) cowlNothing(all_10_2) = 0 % 8.40/1.92 | | | | % 8.40/1.92 | | | | GROUND_INST: instantiating (1) with all_10_2, simplifying with (15), % 8.40/1.92 | | | | (62) gives: % 8.40/1.92 | | | | (63) $false % 8.40/1.92 | | | | % 8.40/1.92 | | | | CLOSE: (63) is inconsistent. % 8.40/1.92 | | | | % 8.40/1.92 | | | End of split % 8.40/1.92 | | | % 8.40/1.92 | | End of split % 8.40/1.92 | | % 8.40/1.92 | End of split % 8.40/1.92 | % 8.40/1.92 End of proof % 8.40/1.92 % SZS output end Proof for theBenchmark % 8.40/1.92 % 8.40/1.92 1329ms %------------------------------------------------------------------------------