%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS174+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 : n032.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:32 EDT 2023 % Result : Theorem 4.46s 1.38s % Output : Proof 6.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : KRS174+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.31 % Computer : n032.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 300 % 0.11/0.31 % DateTime : Mon Aug 28 01:46:00 EDT 2023 % 0.11/0.31 % CPUTime : % 0.16/0.55 ________ _____ % 0.16/0.55 ___ __ \_________(_)________________________________ % 0.16/0.55 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.16/0.55 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.16/0.55 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.16/0.55 % 0.16/0.55 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.16/0.55 (2023-06-19) % 0.16/0.55 % 0.16/0.55 (c) Philipp Rümmer, 2009-2023 % 0.16/0.55 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.16/0.56 Amanda Stjerna. % 0.16/0.56 Free software under BSD-3-Clause. % 0.16/0.56 % 0.16/0.56 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.16/0.56 % 0.16/0.56 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.16/0.57 Running up to 7 provers in parallel. % 0.16/0.58 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.16/0.58 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.16/0.58 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.16/0.58 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.16/0.58 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.16/0.58 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.16/0.58 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.79/0.92 Prover 4: Preprocessing ... % 1.79/0.92 Prover 1: Preprocessing ... % 2.31/0.96 Prover 6: Preprocessing ... % 2.31/0.96 Prover 3: Preprocessing ... % 2.31/0.96 Prover 5: Preprocessing ... % 2.31/0.96 Prover 0: Preprocessing ... % 2.31/0.97 Prover 2: Preprocessing ... % 3.52/1.15 Prover 2: Proving ... % 3.52/1.15 Prover 5: Proving ... % 3.52/1.17 Prover 1: Constructing countermodel ... % 3.52/1.17 Prover 6: Constructing countermodel ... % 3.89/1.18 Prover 3: Constructing countermodel ... % 3.89/1.19 Prover 4: Constructing countermodel ... % 3.89/1.21 Prover 0: Proving ... % 4.46/1.38 Prover 6: proved (798ms) % 4.46/1.38 % 4.46/1.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.46/1.38 % 4.46/1.38 Prover 3: stopped % 4.46/1.39 Prover 5: stopped % 4.46/1.39 Prover 0: stopped % 4.46/1.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.46/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.46/1.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.46/1.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.46/1.40 Prover 2: proved (829ms) % 4.46/1.41 % 4.46/1.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.46/1.41 % 4.46/1.42 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.46/1.43 Prover 10: Preprocessing ... % 5.47/1.43 Prover 11: Preprocessing ... % 5.47/1.44 Prover 7: Preprocessing ... % 5.47/1.45 Prover 13: Preprocessing ... % 5.72/1.46 Prover 8: Preprocessing ... % 5.72/1.48 Prover 10: Warning: ignoring some quantifiers % 5.72/1.49 Prover 10: Constructing countermodel ... % 5.72/1.49 Prover 7: Warning: ignoring some quantifiers % 5.72/1.49 Prover 7: Constructing countermodel ... % 5.72/1.50 Prover 13: Warning: ignoring some quantifiers % 5.72/1.50 Prover 1: Found proof (size 67) % 5.72/1.50 Prover 1: proved (922ms) % 5.72/1.50 Prover 7: stopped % 5.72/1.50 Prover 13: Constructing countermodel ... % 5.72/1.50 Prover 13: stopped % 5.72/1.50 Prover 10: stopped % 5.72/1.51 Prover 4: Found proof (size 73) % 5.72/1.51 Prover 4: proved (929ms) % 5.72/1.53 Prover 8: Warning: ignoring some quantifiers % 5.72/1.53 Prover 8: Constructing countermodel ... % 5.72/1.54 Prover 8: stopped % 6.29/1.54 Prover 11: Constructing countermodel ... % 6.29/1.55 Prover 11: stopped % 6.29/1.55 % 6.29/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.29/1.55 % 6.29/1.56 % SZS output start Proof for theBenchmark % 6.29/1.57 Assumptions after simplification: % 6.29/1.57 --------------------------------- % 6.29/1.57 % 6.29/1.57 (axiom_0) % 6.47/1.61 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) & % 6.47/1.61 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 6.47/1.61 % 6.47/1.61 (axiom_1) % 6.47/1.61 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) | % 6.47/1.61 xsd_integer(v0) = 0) & ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | % 6.47/1.61 ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) % 6.47/1.61 % 6.47/1.61 (axiom_2) % 6.47/1.62 $i(ia) & ! [v0: $i] : (v0 = ia | ~ (cA(v0) = 0) | ~ $i(v0)) & ! [v0: int] % 6.47/1.62 : (v0 = 0 | ~ (cA(ia) = v0)) % 6.47/1.62 % 6.47/1.62 (axiom_3) % 6.47/1.62 $i(ib) & $i(ia) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cA_and_B(v0) = % 6.47/1.62 v1) | ~ $i(v0) | ( ~ (v0 = ib) & ~ (v0 = ia))) & ! [v0: $i] : (v0 = ib % 6.47/1.62 | v0 = ia | ~ (cA_and_B(v0) = 0) | ~ $i(v0)) % 6.47/1.62 % 6.47/1.62 (axiom_4) % 6.47/1.62 $i(ib) & ! [v0: $i] : (v0 = ib | ~ (cB(v0) = 0) | ~ $i(v0)) & ! [v0: int] % 6.47/1.62 : (v0 = 0 | ~ (cB(ib) = v0)) % 6.47/1.62 % 6.47/1.62 (the_axiom) % 6.47/1.63 ? [v0: $i] : ? [v1: any] : ? [v2: any] : ? [v3: any] : (cB(v0) = v2 & % 6.47/1.63 cA_and_B(v0) = v1 & cA(v0) = v3 & $i(v0) & ((v1 = 0 & ~ (v3 = 0) & ~ (v2 = % 6.47/1.63 0)) | ( ~ (v1 = 0) & (v3 = 0 | v2 = 0)))) | ? [v0: $i] : ? [v1: any] % 6.47/1.63 : ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = % 6.47/1.63 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1: any] % 6.47/1.63 : ? [v2: any] : (cowlThing(v0) = v1 & cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 % 6.47/1.63 = 0) | v2 = 0)) % 6.47/1.63 % 6.47/1.63 (function-axioms) % 6.47/1.63 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = % 6.47/1.63 v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 6.47/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.47/1.63 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 6.47/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.47/1.63 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0: % 6.47/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.47/1.63 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 6.47/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.47/1.63 ~ (cB(v2) = v1) | ~ (cB(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.47/1.63 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cA_and_B(v2) = v1) | ~ % 6.47/1.63 (cA_and_B(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.47/1.63 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cA(v2) = v1) | ~ (cA(v2) % 6.47/1.63 = v0)) % 6.47/1.63 % 6.47/1.63 Further assumptions not needed in the proof: % 6.47/1.63 -------------------------------------------- % 6.47/1.64 axiom_5, axiom_6, cA_and_B_substitution_1, cA_substitution_1, cB_substitution_1, % 6.47/1.64 cowlNothing_substitution_1, cowlThing_substitution_1, % 6.47/1.64 xsd_integer_substitution_1, xsd_string_substitution_1 % 6.47/1.64 % 6.47/1.64 Those formulas are unsatisfiable: % 6.47/1.64 --------------------------------- % 6.47/1.64 % 6.47/1.64 Begin of proof % 6.47/1.64 | % 6.74/1.64 | ALPHA: (axiom_0) implies: % 6.74/1.64 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 6.74/1.64 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ % 6.74/1.64 | $i(v0)) % 6.74/1.64 | % 6.74/1.64 | ALPHA: (axiom_1) implies: % 6.74/1.64 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 6.74/1.64 | (v1 = 0) & xsd_integer(v0) = v1)) % 6.74/1.64 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ % 6.74/1.64 | $i(v0) | xsd_integer(v0) = 0) % 6.74/1.64 | % 6.74/1.64 | ALPHA: (axiom_2) implies: % 6.74/1.64 | (5) ! [v0: int] : (v0 = 0 | ~ (cA(ia) = v0)) % 6.74/1.64 | (6) ! [v0: $i] : (v0 = ia | ~ (cA(v0) = 0) | ~ $i(v0)) % 6.74/1.64 | % 6.74/1.64 | ALPHA: (axiom_3) implies: % 6.74/1.64 | (7) ! [v0: $i] : (v0 = ib | v0 = ia | ~ (cA_and_B(v0) = 0) | ~ $i(v0)) % 6.74/1.64 | (8) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cA_and_B(v0) = v1) | ~ % 6.74/1.65 | $i(v0) | ( ~ (v0 = ib) & ~ (v0 = ia))) % 6.74/1.65 | % 6.74/1.65 | ALPHA: (axiom_4) implies: % 6.74/1.65 | (9) ! [v0: int] : (v0 = 0 | ~ (cB(ib) = v0)) % 6.74/1.65 | (10) ! [v0: $i] : (v0 = ib | ~ (cB(v0) = 0) | ~ $i(v0)) % 6.74/1.65 | % 6.74/1.65 | ALPHA: (function-axioms) implies: % 6.74/1.65 | (11) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.74/1.65 | : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 6.74/1.65 | % 6.74/1.65 | BETA: splitting (the_axiom) gives: % 6.74/1.65 | % 6.74/1.65 | Case 1: % 6.74/1.65 | | % 6.74/1.65 | | (12) ? [v0: $i] : ? [v1: any] : ? [v2: any] : ? [v3: any] : (cB(v0) = % 6.74/1.65 | | v2 & cA_and_B(v0) = v1 & cA(v0) = v3 & $i(v0) & ((v1 = 0 & ~ (v3 % 6.74/1.65 | | = 0) & ~ (v2 = 0)) | ( ~ (v1 = 0) & (v3 = 0 | v2 = 0)))) % 6.74/1.65 | | % 6.74/1.65 | | DELTA: instantiating (12) with fresh symbols all_15_0, all_15_1, all_15_2, % 6.74/1.65 | | all_15_3 gives: % 6.74/1.65 | | (13) cB(all_15_3) = all_15_1 & cA_and_B(all_15_3) = all_15_2 & % 6.74/1.65 | | cA(all_15_3) = all_15_0 & $i(all_15_3) & ((all_15_2 = 0 & ~ % 6.74/1.65 | | (all_15_0 = 0) & ~ (all_15_1 = 0)) | ( ~ (all_15_2 = 0) & % 6.74/1.65 | | (all_15_0 = 0 | all_15_1 = 0))) % 6.74/1.65 | | % 6.74/1.65 | | ALPHA: (13) implies: % 6.74/1.65 | | (14) $i(all_15_3) % 6.74/1.65 | | (15) cA(all_15_3) = all_15_0 % 6.74/1.65 | | (16) cA_and_B(all_15_3) = all_15_2 % 6.74/1.65 | | (17) cB(all_15_3) = all_15_1 % 6.83/1.65 | | (18) (all_15_2 = 0 & ~ (all_15_0 = 0) & ~ (all_15_1 = 0)) | ( ~ % 6.83/1.65 | | (all_15_2 = 0) & (all_15_0 = 0 | all_15_1 = 0)) % 6.83/1.65 | | % 6.83/1.65 | | GROUND_INST: instantiating (8) with all_15_3, all_15_2, simplifying with % 6.83/1.65 | | (14), (16) gives: % 6.83/1.65 | | (19) all_15_2 = 0 | ( ~ (all_15_3 = ib) & ~ (all_15_3 = ia)) % 6.83/1.66 | | % 6.83/1.66 | | BETA: splitting (18) gives: % 6.83/1.66 | | % 6.83/1.66 | | Case 1: % 6.83/1.66 | | | % 6.83/1.66 | | | (20) all_15_2 = 0 & ~ (all_15_0 = 0) & ~ (all_15_1 = 0) % 6.83/1.66 | | | % 6.83/1.66 | | | ALPHA: (20) implies: % 6.83/1.66 | | | (21) all_15_2 = 0 % 6.83/1.66 | | | (22) ~ (all_15_1 = 0) % 6.83/1.66 | | | (23) ~ (all_15_0 = 0) % 6.83/1.66 | | | % 6.83/1.66 | | | REDUCE: (16), (21) imply: % 6.83/1.66 | | | (24) cA_and_B(all_15_3) = 0 % 6.83/1.66 | | | % 6.83/1.66 | | | GROUND_INST: instantiating (7) with all_15_3, simplifying with (14), (24) % 6.83/1.66 | | | gives: % 6.83/1.66 | | | (25) all_15_3 = ib | all_15_3 = ia % 6.83/1.66 | | | % 6.83/1.66 | | | BETA: splitting (25) gives: % 6.83/1.66 | | | % 6.83/1.66 | | | Case 1: % 6.83/1.66 | | | | % 6.83/1.66 | | | | (26) all_15_3 = ib % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (17), (26) imply: % 6.83/1.66 | | | | (27) cB(ib) = all_15_1 % 6.83/1.66 | | | | % 6.83/1.66 | | | | GROUND_INST: instantiating (9) with all_15_1, simplifying with (27) % 6.83/1.66 | | | | gives: % 6.83/1.66 | | | | (28) all_15_1 = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (22), (28) imply: % 6.83/1.66 | | | | (29) $false % 6.83/1.66 | | | | % 6.83/1.66 | | | | CLOSE: (29) is inconsistent. % 6.83/1.66 | | | | % 6.83/1.66 | | | Case 2: % 6.83/1.66 | | | | % 6.83/1.66 | | | | (30) all_15_3 = ia % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (15), (30) imply: % 6.83/1.66 | | | | (31) cA(ia) = all_15_0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | GROUND_INST: instantiating (5) with all_15_0, simplifying with (31) % 6.83/1.66 | | | | gives: % 6.83/1.66 | | | | (32) all_15_0 = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (23), (32) imply: % 6.83/1.66 | | | | (33) $false % 6.83/1.66 | | | | % 6.83/1.66 | | | | CLOSE: (33) is inconsistent. % 6.83/1.66 | | | | % 6.83/1.66 | | | End of split % 6.83/1.66 | | | % 6.83/1.66 | | Case 2: % 6.83/1.66 | | | % 6.83/1.66 | | | (34) ~ (all_15_2 = 0) & (all_15_0 = 0 | all_15_1 = 0) % 6.83/1.66 | | | % 6.83/1.66 | | | ALPHA: (34) implies: % 6.83/1.66 | | | (35) ~ (all_15_2 = 0) % 6.83/1.66 | | | (36) all_15_0 = 0 | all_15_1 = 0 % 6.83/1.66 | | | % 6.83/1.66 | | | BETA: splitting (19) gives: % 6.83/1.66 | | | % 6.83/1.66 | | | Case 1: % 6.83/1.66 | | | | % 6.83/1.66 | | | | (37) all_15_2 = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (35), (37) imply: % 6.83/1.66 | | | | (38) $false % 6.83/1.66 | | | | % 6.83/1.66 | | | | CLOSE: (38) is inconsistent. % 6.83/1.66 | | | | % 6.83/1.66 | | | Case 2: % 6.83/1.66 | | | | % 6.83/1.66 | | | | (39) ~ (all_15_3 = ib) & ~ (all_15_3 = ia) % 6.83/1.66 | | | | % 6.83/1.66 | | | | ALPHA: (39) implies: % 6.83/1.66 | | | | (40) ~ (all_15_3 = ia) % 6.83/1.66 | | | | (41) ~ (all_15_3 = ib) % 6.83/1.66 | | | | % 6.83/1.66 | | | | BETA: splitting (36) gives: % 6.83/1.66 | | | | % 6.83/1.66 | | | | Case 1: % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | (42) all_15_0 = 0 % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | REDUCE: (15), (42) imply: % 6.83/1.66 | | | | | (43) cA(all_15_3) = 0 % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | GROUND_INST: instantiating (6) with all_15_3, simplifying with (14), % 6.83/1.66 | | | | | (43) gives: % 6.83/1.66 | | | | | (44) all_15_3 = ia % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | REDUCE: (40), (44) imply: % 6.83/1.66 | | | | | (45) $false % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | CLOSE: (45) is inconsistent. % 6.83/1.67 | | | | | % 6.83/1.67 | | | | Case 2: % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | (46) all_15_1 = 0 % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | REDUCE: (17), (46) imply: % 6.83/1.67 | | | | | (47) cB(all_15_3) = 0 % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | GROUND_INST: instantiating (10) with all_15_3, simplifying with (14), % 6.83/1.67 | | | | | (47) gives: % 6.83/1.67 | | | | | (48) all_15_3 = ib % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | REDUCE: (41), (48) imply: % 6.83/1.67 | | | | | (49) $false % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | CLOSE: (49) is inconsistent. % 6.83/1.67 | | | | | % 6.83/1.67 | | | | End of split % 6.83/1.67 | | | | % 6.83/1.67 | | | End of split % 6.83/1.67 | | | % 6.83/1.67 | | End of split % 6.83/1.67 | | % 6.83/1.67 | Case 2: % 6.83/1.67 | | % 6.83/1.67 | | (50) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1 & % 6.83/1.67 | | xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) % 6.83/1.67 | | & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1: any] : ? [v2: any] : % 6.83/1.67 | | (cowlThing(v0) = v1 & cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) | % 6.83/1.67 | | v2 = 0)) % 6.83/1.67 | | % 6.83/1.67 | | BETA: splitting (50) gives: % 6.83/1.67 | | % 6.83/1.67 | | Case 1: % 6.83/1.67 | | | % 6.83/1.67 | | | (51) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1 & % 6.83/1.67 | | | xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = % 6.83/1.67 | | | 0) & ~ (v1 = 0)))) % 6.83/1.67 | | | % 6.83/1.67 | | | DELTA: instantiating (51) with fresh symbols all_15_0, all_15_1, all_15_2 % 6.83/1.67 | | | gives: % 6.83/1.67 | | | (52) xsd_string(all_15_2) = all_15_1 & xsd_integer(all_15_2) = all_15_0 % 6.83/1.67 | | | & $i(all_15_2) & ((all_15_0 = 0 & all_15_1 = 0) | ( ~ (all_15_0 = % 6.83/1.67 | | | 0) & ~ (all_15_1 = 0))) % 6.83/1.67 | | | % 6.83/1.67 | | | ALPHA: (52) implies: % 6.83/1.67 | | | (53) $i(all_15_2) % 6.83/1.67 | | | (54) xsd_integer(all_15_2) = all_15_0 % 6.83/1.67 | | | (55) xsd_string(all_15_2) = all_15_1 % 6.83/1.67 | | | (56) (all_15_0 = 0 & all_15_1 = 0) | ( ~ (all_15_0 = 0) & ~ (all_15_1 % 6.83/1.67 | | | = 0)) % 6.83/1.67 | | | % 6.83/1.67 | | | GROUND_INST: instantiating (4) with all_15_2, all_15_1, simplifying with % 6.83/1.67 | | | (53), (55) gives: % 6.83/1.67 | | | (57) all_15_1 = 0 | xsd_integer(all_15_2) = 0 % 6.83/1.67 | | | % 6.83/1.67 | | | BETA: splitting (56) gives: % 6.83/1.67 | | | % 6.83/1.67 | | | Case 1: % 6.83/1.67 | | | | % 6.83/1.67 | | | | (58) all_15_0 = 0 & all_15_1 = 0 % 6.83/1.67 | | | | % 6.83/1.67 | | | | ALPHA: (58) implies: % 6.83/1.67 | | | | (59) all_15_1 = 0 % 6.83/1.67 | | | | (60) all_15_0 = 0 % 6.83/1.67 | | | | % 6.83/1.67 | | | | REDUCE: (55), (59) imply: % 6.83/1.67 | | | | (61) xsd_string(all_15_2) = 0 % 6.83/1.67 | | | | % 6.83/1.67 | | | | REDUCE: (54), (60) imply: % 6.83/1.68 | | | | (62) xsd_integer(all_15_2) = 0 % 6.83/1.68 | | | | % 6.83/1.68 | | | | GROUND_INST: instantiating (3) with all_15_2, simplifying with (53), % 6.83/1.68 | | | | (61) gives: % 6.83/1.68 | | | | (63) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_15_2) = v0) % 6.83/1.68 | | | | % 6.83/1.68 | | | | DELTA: instantiating (63) with fresh symbol all_29_0 gives: % 6.83/1.68 | | | | (64) ~ (all_29_0 = 0) & xsd_integer(all_15_2) = all_29_0 % 6.83/1.68 | | | | % 6.83/1.68 | | | | ALPHA: (64) implies: % 6.83/1.68 | | | | (65) ~ (all_29_0 = 0) % 6.83/1.68 | | | | (66) xsd_integer(all_15_2) = all_29_0 % 6.83/1.68 | | | | % 6.83/1.68 | | | | GROUND_INST: instantiating (11) with 0, all_29_0, all_15_2, simplifying % 6.83/1.68 | | | | with (62), (66) gives: % 6.83/1.68 | | | | (67) all_29_0 = 0 % 6.83/1.68 | | | | % 6.83/1.68 | | | | REDUCE: (65), (67) imply: % 6.83/1.68 | | | | (68) $false % 6.83/1.68 | | | | % 6.83/1.68 | | | | CLOSE: (68) is inconsistent. % 6.83/1.68 | | | | % 6.83/1.68 | | | Case 2: % 6.83/1.68 | | | | % 6.83/1.68 | | | | (69) ~ (all_15_0 = 0) & ~ (all_15_1 = 0) % 6.83/1.68 | | | | % 6.83/1.68 | | | | ALPHA: (69) implies: % 6.83/1.68 | | | | (70) ~ (all_15_1 = 0) % 6.83/1.68 | | | | (71) ~ (all_15_0 = 0) % 6.83/1.68 | | | | % 6.83/1.68 | | | | BETA: splitting (57) gives: % 6.83/1.68 | | | | % 6.83/1.68 | | | | Case 1: % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | (72) xsd_integer(all_15_2) = 0 % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | GROUND_INST: instantiating (11) with all_15_0, 0, all_15_2, % 6.83/1.68 | | | | | simplifying with (54), (72) gives: % 6.83/1.68 | | | | | (73) all_15_0 = 0 % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | REDUCE: (71), (73) imply: % 6.83/1.68 | | | | | (74) $false % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | CLOSE: (74) is inconsistent. % 6.83/1.68 | | | | | % 6.83/1.68 | | | | Case 2: % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | (75) all_15_1 = 0 % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | REDUCE: (70), (75) imply: % 6.83/1.68 | | | | | (76) $false % 6.83/1.68 | | | | | % 6.83/1.68 | | | | | CLOSE: (76) is inconsistent. % 6.83/1.68 | | | | | % 6.83/1.68 | | | | End of split % 6.83/1.68 | | | | % 6.83/1.68 | | | End of split % 6.83/1.68 | | | % 6.83/1.68 | | Case 2: % 6.83/1.68 | | | % 6.83/1.68 | | | (77) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlThing(v0) = v1 & % 6.83/1.68 | | | cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0)) % 6.83/1.68 | | | % 6.83/1.68 | | | DELTA: instantiating (77) with fresh symbols all_15_0, all_15_1, all_15_2 % 6.83/1.68 | | | gives: % 6.83/1.68 | | | (78) cowlThing(all_15_2) = all_15_1 & cowlNothing(all_15_2) = all_15_0 % 6.83/1.68 | | | & $i(all_15_2) & ( ~ (all_15_1 = 0) | all_15_0 = 0) % 6.83/1.68 | | | % 6.83/1.68 | | | ALPHA: (78) implies: % 6.83/1.68 | | | (79) $i(all_15_2) % 6.83/1.68 | | | (80) cowlNothing(all_15_2) = all_15_0 % 6.83/1.68 | | | (81) cowlThing(all_15_2) = all_15_1 % 6.83/1.68 | | | (82) ~ (all_15_1 = 0) | all_15_0 = 0 % 6.83/1.68 | | | % 6.83/1.68 | | | GROUND_INST: instantiating (2) with all_15_2, all_15_1, simplifying with % 6.83/1.68 | | | (79), (81) gives: % 6.83/1.68 | | | (83) all_15_1 = 0 % 6.83/1.68 | | | % 6.83/1.68 | | | BETA: splitting (82) gives: % 6.83/1.68 | | | % 6.83/1.68 | | | Case 1: % 6.83/1.68 | | | | % 6.83/1.68 | | | | (84) ~ (all_15_1 = 0) % 6.83/1.68 | | | | % 6.83/1.68 | | | | REDUCE: (83), (84) imply: % 6.83/1.68 | | | | (85) $false % 6.83/1.68 | | | | % 6.83/1.68 | | | | CLOSE: (85) is inconsistent. % 6.83/1.68 | | | | % 6.83/1.68 | | | Case 2: % 6.83/1.68 | | | | % 6.83/1.68 | | | | (86) all_15_0 = 0 % 6.83/1.68 | | | | % 6.83/1.68 | | | | REDUCE: (80), (86) imply: % 6.83/1.69 | | | | (87) cowlNothing(all_15_2) = 0 % 6.83/1.69 | | | | % 6.83/1.69 | | | | GROUND_INST: instantiating (1) with all_15_2, simplifying with (79), % 6.83/1.69 | | | | (87) gives: % 6.83/1.69 | | | | (88) $false % 6.83/1.69 | | | | % 6.83/1.69 | | | | CLOSE: (88) is inconsistent. % 6.83/1.69 | | | | % 6.83/1.69 | | | End of split % 6.83/1.69 | | | % 6.83/1.69 | | End of split % 6.83/1.69 | | % 6.83/1.69 | End of split % 6.83/1.69 | % 6.83/1.69 End of proof % 6.83/1.69 % SZS output end Proof for theBenchmark % 6.83/1.69 % 6.83/1.69 1129ms %------------------------------------------------------------------------------