%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS175+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.42s 1.34s % Output : Proof 7.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : KRS175+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.10 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.29 % Computer : n032.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 300 % 0.09/0.29 % DateTime : Mon Aug 28 01:34:00 EDT 2023 % 0.09/0.29 % CPUTime : % 0.15/0.49 ________ _____ % 0.15/0.49 ___ __ \_________(_)________________________________ % 0.15/0.49 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.15/0.49 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.15/0.49 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.15/0.49 % 0.15/0.49 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.15/0.49 (2023-06-19) % 0.15/0.49 % 0.15/0.49 (c) Philipp Rümmer, 2009-2023 % 0.15/0.49 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.15/0.49 Amanda Stjerna. % 0.15/0.49 Free software under BSD-3-Clause. % 0.15/0.49 % 0.15/0.49 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.15/0.49 % 0.15/0.49 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.15/0.50 Running up to 7 provers in parallel. % 0.15/0.51 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.15/0.51 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.15/0.51 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.15/0.51 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.15/0.51 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.15/0.51 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.15/0.51 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.94/0.85 Prover 1: Preprocessing ... % 1.94/0.85 Prover 4: Preprocessing ... % 1.95/0.89 Prover 0: Preprocessing ... % 1.95/0.89 Prover 3: Preprocessing ... % 1.95/0.89 Prover 6: Preprocessing ... % 1.95/0.89 Prover 2: Preprocessing ... % 1.95/0.89 Prover 5: Preprocessing ... % 3.62/1.10 Prover 5: Proving ... % 3.62/1.10 Prover 2: Proving ... % 3.62/1.12 Prover 3: Constructing countermodel ... % 3.62/1.12 Prover 6: Constructing countermodel ... % 4.02/1.15 Prover 1: Constructing countermodel ... % 4.02/1.16 Prover 4: Constructing countermodel ... % 4.02/1.19 Prover 0: Proving ... % 4.42/1.24 Prover 3: gave up % 4.42/1.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.42/1.26 Prover 6: gave up % 4.42/1.28 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.42/1.28 Prover 7: Preprocessing ... % 4.42/1.32 Prover 8: Preprocessing ... % 4.42/1.34 Prover 2: proved (831ms) % 4.42/1.34 % 4.42/1.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.42/1.34 % 4.42/1.35 Prover 0: stopped % 4.42/1.35 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.42/1.35 Prover 5: stopped % 4.42/1.35 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.42/1.35 Prover 7: Warning: ignoring some quantifiers % 4.42/1.35 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.42/1.35 Prover 7: Constructing countermodel ... % 4.42/1.35 Prover 1: gave up % 4.42/1.35 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.42/1.37 Prover 10: Preprocessing ... % 4.42/1.37 Prover 11: Preprocessing ... % 4.42/1.38 Prover 13: Preprocessing ... % 5.45/1.38 Prover 16: Preprocessing ... % 5.45/1.40 Prover 10: Warning: ignoring some quantifiers % 5.45/1.41 Prover 10: Constructing countermodel ... % 5.45/1.41 Prover 16: Warning: ignoring some quantifiers % 5.45/1.42 Prover 13: Warning: ignoring some quantifiers % 5.45/1.42 Prover 13: Constructing countermodel ... % 5.45/1.42 Prover 8: Warning: ignoring some quantifiers % 5.45/1.43 Prover 8: Constructing countermodel ... % 5.45/1.43 Prover 16: Constructing countermodel ... % 5.45/1.46 Prover 7: gave up % 6.37/1.48 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 6.37/1.48 Prover 13: gave up % 6.37/1.48 Prover 16: gave up % 6.37/1.49 Prover 11: Constructing countermodel ... % 6.37/1.49 Prover 19: Preprocessing ... % 6.37/1.50 Prover 10: gave up % 6.37/1.52 Prover 4: Found proof (size 81) % 6.37/1.52 Prover 4: proved (1006ms) % 6.37/1.52 Prover 8: stopped % 6.37/1.52 Prover 11: stopped % 6.79/1.55 Prover 19: Warning: ignoring some quantifiers % 6.79/1.55 Prover 19: Constructing countermodel ... % 6.79/1.55 Prover 19: stopped % 6.79/1.56 % 6.79/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.79/1.56 % 6.79/1.57 % SZS output start Proof for theBenchmark % 6.79/1.57 Assumptions after simplification: % 6.79/1.57 --------------------------------- % 6.79/1.57 % 6.79/1.57 (axiom_0) % 6.79/1.60 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) & % 6.79/1.60 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 6.79/1.60 % 6.79/1.60 (axiom_1) % 6.79/1.60 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) | % 6.79/1.60 xsd_integer(v0) = 0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 6.79/1.60 (xsd_integer(v0) = v1) | ~ $i(v0) | xsd_string(v0) = 0) & ! [v0: $i] : ( ~ % 6.79/1.60 (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.79/1.60 xsd_integer(v0) = v1)) & ! [v0: $i] : ( ~ (xsd_integer(v0) = 0) | ~ % 6.79/1.60 $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & xsd_string(v0) = v1)) % 6.79/1.60 % 6.79/1.60 (axiom_2) % 6.79/1.60 $i(ia) & ! [v0: $i] : (v0 = ia | ~ (cA(v0) = 0) | ~ $i(v0)) & ! [v0: int] % 6.79/1.60 : (v0 = 0 | ~ (cA(ia) = v0)) % 6.79/1.60 % 6.79/1.60 (axiom_3) % 6.79/1.61 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cB(v0) = v1) | ~ $i(v0) | ? [v2: % 6.79/1.61 any] : ? [v3: any] : (cA_and_B(v0) = v2 & cA(v0) = v3 & ( ~ (v2 = 0) | v3 % 6.79/1.61 = 0))) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cA_and_B(v0) = v1) | % 6.79/1.61 ~ $i(v0) | ? [v2: int] : ? [v3: int] : ( ~ (v3 = 0) & ~ (v2 = 0) & % 6.79/1.61 cB(v0) = v3 & cA(v0) = v2)) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 6.79/1.61 (cA(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cB(v0) = v3 & % 6.79/1.61 cA_and_B(v0) = v2 & ( ~ (v2 = 0) | v3 = 0))) & ! [v0: $i] : ! [v1: any] % 6.79/1.61 : ( ~ (cB(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cA_and_B(v0) % 6.79/1.61 = v3 & cA(v0) = v2 & (v3 = 0 | ( ~ (v2 = 0) & ~ (v1 = 0))))) & ! [v0: % 6.79/1.61 $i] : ! [v1: any] : ( ~ (cA(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: % 6.79/1.61 any] : (cB(v0) = v2 & cA_and_B(v0) = v3 & (v3 = 0 | ( ~ (v2 = 0) & ~ (v1 % 6.79/1.61 = 0))))) & ! [v0: $i] : ( ~ (cA_and_B(v0) = 0) | ~ $i(v0) | ? % 6.79/1.61 [v1: any] : ? [v2: any] : (cB(v0) = v2 & cA(v0) = v1 & (v2 = 0 | v1 = 0))) % 6.79/1.61 % 6.79/1.61 (axiom_4) % 6.79/1.61 $i(ib) & ! [v0: $i] : (v0 = ib | ~ (cB(v0) = 0) | ~ $i(v0)) & ! [v0: int] % 6.79/1.61 : (v0 = 0 | ~ (cB(ib) = v0)) % 6.79/1.61 % 6.79/1.61 (axiom_5) % 6.79/1.61 cowlThing(ia) = 0 & $i(ia) % 6.79/1.61 % 6.79/1.61 (axiom_6) % 6.79/1.61 cowlThing(ib) = 0 & $i(ib) % 6.79/1.61 % 6.79/1.61 (the_axiom) % 7.15/1.62 $i(ib) & $i(ia) & ? [v0: any] : ? [v1: any] : ? [v2: $i] : ? [v3: any] : % 7.15/1.62 ? [v4: $i] : ? [v5: any] : ? [v6: any] : ? [v7: $i] : ? [v8: any] : ? % 7.15/1.62 [v9: any] : (cowlThing(ib) = v1 & cowlThing(ia) = v0 & $i(v7) & $i(v4) & % 7.15/1.62 $i(v2) & ( ~ (v1 = 0) | ~ (v0 = 0) | (xsd_string(v4) = v5 & xsd_integer(v4) % 7.15/1.62 = v6 & ((v6 = 0 & v5 = 0) | ( ~ (v6 = 0) & ~ (v5 = 0)))) | % 7.15/1.62 (cowlThing(v7) = v8 & cowlNothing(v7) = v9 & ( ~ (v8 = 0) | v9 = 0)) | % 7.15/1.62 (cA_and_B(v2) = v3 & ((v3 = 0 & ~ (v2 = ib) & ~ (v2 = ia)) | ( ~ (v3 = % 7.15/1.62 0) & (v2 = ib | v2 = ia)))))) % 7.15/1.62 % 7.15/1.62 (function-axioms) % 7.15/1.62 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = % 7.15/1.62 v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 7.15/1.62 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.15/1.62 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 7.15/1.62 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.15/1.62 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0: % 7.15/1.62 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.15/1.62 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 7.15/1.62 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.15/1.62 ~ (cB(v2) = v1) | ~ (cB(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.15/1.62 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cA_and_B(v2) = v1) | ~ % 7.15/1.62 (cA_and_B(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.15/1.62 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cA(v2) = v1) | ~ (cA(v2) % 7.15/1.62 = v0)) % 7.15/1.63 % 7.15/1.63 Further assumptions not needed in the proof: % 7.15/1.63 -------------------------------------------- % 7.15/1.63 cA_and_B_substitution_1, cA_substitution_1, cB_substitution_1, % 7.15/1.63 cowlNothing_substitution_1, cowlThing_substitution_1, % 7.15/1.63 xsd_integer_substitution_1, xsd_string_substitution_1 % 7.15/1.63 % 7.15/1.63 Those formulas are unsatisfiable: % 7.15/1.63 --------------------------------- % 7.15/1.63 % 7.15/1.63 Begin of proof % 7.15/1.63 | % 7.15/1.63 | ALPHA: (axiom_0) implies: % 7.15/1.63 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 7.15/1.63 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ % 7.15/1.63 | $i(v0)) % 7.15/1.63 | % 7.15/1.63 | ALPHA: (axiom_1) implies: % 7.15/1.63 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 7.15/1.63 | (v1 = 0) & xsd_integer(v0) = v1)) % 7.15/1.63 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~ % 7.15/1.63 | $i(v0) | xsd_string(v0) = 0) % 7.15/1.63 | % 7.15/1.63 | ALPHA: (axiom_2) implies: % 7.15/1.63 | (5) ! [v0: int] : (v0 = 0 | ~ (cA(ia) = v0)) % 7.15/1.63 | (6) ! [v0: $i] : (v0 = ia | ~ (cA(v0) = 0) | ~ $i(v0)) % 7.15/1.63 | % 7.15/1.63 | ALPHA: (axiom_3) implies: % 7.15/1.63 | (7) ! [v0: $i] : ( ~ (cA_and_B(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? % 7.15/1.63 | [v2: any] : (cB(v0) = v2 & cA(v0) = v1 & (v2 = 0 | v1 = 0))) % 7.15/1.63 | (8) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cA_and_B(v0) = v1) | ~ % 7.15/1.63 | $i(v0) | ? [v2: int] : ? [v3: int] : ( ~ (v3 = 0) & ~ (v2 = 0) & % 7.15/1.63 | cB(v0) = v3 & cA(v0) = v2)) % 7.15/1.63 | % 7.15/1.63 | ALPHA: (axiom_4) implies: % 7.15/1.64 | (9) ! [v0: int] : (v0 = 0 | ~ (cB(ib) = v0)) % 7.15/1.64 | (10) ! [v0: $i] : (v0 = ib | ~ (cB(v0) = 0) | ~ $i(v0)) % 7.15/1.64 | % 7.15/1.64 | ALPHA: (axiom_5) implies: % 7.15/1.64 | (11) cowlThing(ia) = 0 % 7.15/1.64 | % 7.15/1.64 | ALPHA: (axiom_6) implies: % 7.15/1.64 | (12) cowlThing(ib) = 0 % 7.15/1.64 | % 7.15/1.64 | ALPHA: (the_axiom) implies: % 7.15/1.64 | (13) ? [v0: any] : ? [v1: any] : ? [v2: $i] : ? [v3: any] : ? [v4: $i] % 7.15/1.64 | : ? [v5: any] : ? [v6: any] : ? [v7: $i] : ? [v8: any] : ? [v9: % 7.15/1.64 | any] : (cowlThing(ib) = v1 & cowlThing(ia) = v0 & $i(v7) & $i(v4) & % 7.15/1.64 | $i(v2) & ( ~ (v1 = 0) | ~ (v0 = 0) | (xsd_string(v4) = v5 & % 7.15/1.64 | xsd_integer(v4) = v6 & ((v6 = 0 & v5 = 0) | ( ~ (v6 = 0) & ~ % 7.15/1.64 | (v5 = 0)))) | (cowlThing(v7) = v8 & cowlNothing(v7) = v9 & ( % 7.15/1.64 | ~ (v8 = 0) | v9 = 0)) | (cA_and_B(v2) = v3 & ((v3 = 0 & ~ (v2 % 7.15/1.64 | = ib) & ~ (v2 = ia)) | ( ~ (v3 = 0) & (v2 = ib | v2 = % 7.15/1.64 | ia)))))) % 7.15/1.64 | % 7.15/1.64 | ALPHA: (function-axioms) implies: % 7.15/1.64 | (14) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 7.15/1.64 | : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 7.15/1.64 | (15) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 7.15/1.64 | : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 7.15/1.64 | (16) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 7.15/1.64 | : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 7.15/1.64 | % 7.15/1.64 | DELTA: instantiating (13) with fresh symbols all_9_0, all_9_1, all_9_2, % 7.15/1.64 | all_9_3, all_9_4, all_9_5, all_9_6, all_9_7, all_9_8, all_9_9 gives: % 7.15/1.64 | (17) cowlThing(ib) = all_9_8 & cowlThing(ia) = all_9_9 & $i(all_9_2) & % 7.15/1.64 | $i(all_9_5) & $i(all_9_7) & ( ~ (all_9_8 = 0) | ~ (all_9_9 = 0) | % 7.15/1.64 | (xsd_string(all_9_5) = all_9_4 & xsd_integer(all_9_5) = all_9_3 & % 7.15/1.64 | ((all_9_3 = 0 & all_9_4 = 0) | ( ~ (all_9_3 = 0) & ~ (all_9_4 = % 7.15/1.64 | 0)))) | (cowlThing(all_9_2) = all_9_1 & cowlNothing(all_9_2) % 7.15/1.64 | = all_9_0 & ( ~ (all_9_1 = 0) | all_9_0 = 0)) | (cA_and_B(all_9_7) % 7.15/1.64 | = all_9_6 & ((all_9_6 = 0 & ~ (all_9_7 = ib) & ~ (all_9_7 = ia)) % 7.15/1.64 | | ( ~ (all_9_6 = 0) & (all_9_7 = ib | all_9_7 = ia))))) % 7.15/1.64 | % 7.15/1.64 | ALPHA: (17) implies: % 7.15/1.65 | (18) $i(all_9_7) % 7.15/1.65 | (19) $i(all_9_5) % 7.15/1.65 | (20) $i(all_9_2) % 7.15/1.65 | (21) cowlThing(ia) = all_9_9 % 7.15/1.65 | (22) cowlThing(ib) = all_9_8 % 7.15/1.65 | (23) ~ (all_9_8 = 0) | ~ (all_9_9 = 0) | (xsd_string(all_9_5) = all_9_4 & % 7.15/1.65 | xsd_integer(all_9_5) = all_9_3 & ((all_9_3 = 0 & all_9_4 = 0) | ( ~ % 7.15/1.65 | (all_9_3 = 0) & ~ (all_9_4 = 0)))) | (cowlThing(all_9_2) = % 7.15/1.65 | all_9_1 & cowlNothing(all_9_2) = all_9_0 & ( ~ (all_9_1 = 0) | % 7.15/1.65 | all_9_0 = 0)) | (cA_and_B(all_9_7) = all_9_6 & ((all_9_6 = 0 & ~ % 7.15/1.65 | (all_9_7 = ib) & ~ (all_9_7 = ia)) | ( ~ (all_9_6 = 0) & % 7.15/1.65 | (all_9_7 = ib | all_9_7 = ia)))) % 7.15/1.65 | % 7.15/1.65 | GROUND_INST: instantiating (14) with 0, all_9_9, ia, simplifying with (11), % 7.15/1.65 | (21) gives: % 7.15/1.65 | (24) all_9_9 = 0 % 7.15/1.65 | % 7.15/1.65 | GROUND_INST: instantiating (14) with 0, all_9_8, ib, simplifying with (12), % 7.15/1.65 | (22) gives: % 7.15/1.65 | (25) all_9_8 = 0 % 7.15/1.65 | % 7.15/1.65 | BETA: splitting (23) gives: % 7.15/1.65 | % 7.15/1.65 | Case 1: % 7.15/1.65 | | % 7.15/1.65 | | (26) ~ (all_9_8 = 0) % 7.15/1.65 | | % 7.15/1.65 | | REDUCE: (25), (26) imply: % 7.15/1.65 | | (27) $false % 7.15/1.65 | | % 7.15/1.65 | | CLOSE: (27) is inconsistent. % 7.15/1.65 | | % 7.15/1.65 | Case 2: % 7.15/1.65 | | % 7.15/1.65 | | (28) ~ (all_9_9 = 0) | (xsd_string(all_9_5) = all_9_4 & % 7.15/1.65 | | xsd_integer(all_9_5) = all_9_3 & ((all_9_3 = 0 & all_9_4 = 0) | ( % 7.15/1.65 | | ~ (all_9_3 = 0) & ~ (all_9_4 = 0)))) | (cowlThing(all_9_2) = % 7.15/1.65 | | all_9_1 & cowlNothing(all_9_2) = all_9_0 & ( ~ (all_9_1 = 0) | % 7.15/1.65 | | all_9_0 = 0)) | (cA_and_B(all_9_7) = all_9_6 & ((all_9_6 = 0 & % 7.15/1.65 | | ~ (all_9_7 = ib) & ~ (all_9_7 = ia)) | ( ~ (all_9_6 = 0) & % 7.15/1.65 | | (all_9_7 = ib | all_9_7 = ia)))) % 7.15/1.65 | | % 7.15/1.65 | | BETA: splitting (28) gives: % 7.15/1.65 | | % 7.15/1.65 | | Case 1: % 7.15/1.65 | | | % 7.15/1.65 | | | (29) ~ (all_9_9 = 0) % 7.15/1.65 | | | % 7.15/1.65 | | | REDUCE: (24), (29) imply: % 7.15/1.65 | | | (30) $false % 7.15/1.65 | | | % 7.15/1.65 | | | CLOSE: (30) is inconsistent. % 7.15/1.65 | | | % 7.15/1.65 | | Case 2: % 7.15/1.65 | | | % 7.15/1.65 | | | (31) (xsd_string(all_9_5) = all_9_4 & xsd_integer(all_9_5) = all_9_3 & % 7.15/1.65 | | | ((all_9_3 = 0 & all_9_4 = 0) | ( ~ (all_9_3 = 0) & ~ (all_9_4 = % 7.15/1.65 | | | 0)))) | (cowlThing(all_9_2) = all_9_1 & % 7.15/1.65 | | | cowlNothing(all_9_2) = all_9_0 & ( ~ (all_9_1 = 0) | all_9_0 = % 7.15/1.65 | | | 0)) | (cA_and_B(all_9_7) = all_9_6 & ((all_9_6 = 0 & ~ % 7.15/1.65 | | | (all_9_7 = ib) & ~ (all_9_7 = ia)) | ( ~ (all_9_6 = 0) & % 7.15/1.65 | | | (all_9_7 = ib | all_9_7 = ia)))) % 7.15/1.65 | | | % 7.15/1.65 | | | BETA: splitting (31) gives: % 7.15/1.65 | | | % 7.15/1.65 | | | Case 1: % 7.15/1.65 | | | | % 7.15/1.66 | | | | (32) xsd_string(all_9_5) = all_9_4 & xsd_integer(all_9_5) = all_9_3 & % 7.15/1.66 | | | | ((all_9_3 = 0 & all_9_4 = 0) | ( ~ (all_9_3 = 0) & ~ (all_9_4 = % 7.15/1.66 | | | | 0))) % 7.15/1.66 | | | | % 7.15/1.66 | | | | ALPHA: (32) implies: % 7.15/1.66 | | | | (33) xsd_integer(all_9_5) = all_9_3 % 7.15/1.66 | | | | (34) xsd_string(all_9_5) = all_9_4 % 7.15/1.66 | | | | (35) (all_9_3 = 0 & all_9_4 = 0) | ( ~ (all_9_3 = 0) & ~ (all_9_4 = % 7.15/1.66 | | | | 0)) % 7.15/1.66 | | | | % 7.15/1.66 | | | | GROUND_INST: instantiating (4) with all_9_5, all_9_3, simplifying with % 7.15/1.66 | | | | (19), (33) gives: % 7.15/1.66 | | | | (36) all_9_3 = 0 | xsd_string(all_9_5) = 0 % 7.15/1.66 | | | | % 7.15/1.66 | | | | BETA: splitting (35) gives: % 7.15/1.66 | | | | % 7.15/1.66 | | | | Case 1: % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | (37) all_9_3 = 0 & all_9_4 = 0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | ALPHA: (37) implies: % 7.15/1.66 | | | | | (38) all_9_4 = 0 % 7.15/1.66 | | | | | (39) all_9_3 = 0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | REDUCE: (34), (38) imply: % 7.15/1.66 | | | | | (40) xsd_string(all_9_5) = 0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | REDUCE: (33), (39) imply: % 7.15/1.66 | | | | | (41) xsd_integer(all_9_5) = 0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | GROUND_INST: instantiating (3) with all_9_5, simplifying with (19), % 7.15/1.66 | | | | | (40) gives: % 7.15/1.66 | | | | | (42) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_9_5) = v0) % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | DELTA: instantiating (42) with fresh symbol all_48_0 gives: % 7.15/1.66 | | | | | (43) ~ (all_48_0 = 0) & xsd_integer(all_9_5) = all_48_0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | ALPHA: (43) implies: % 7.15/1.66 | | | | | (44) ~ (all_48_0 = 0) % 7.15/1.66 | | | | | (45) xsd_integer(all_9_5) = all_48_0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | GROUND_INST: instantiating (15) with 0, all_48_0, all_9_5, simplifying % 7.15/1.66 | | | | | with (41), (45) gives: % 7.15/1.66 | | | | | (46) all_48_0 = 0 % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | REDUCE: (44), (46) imply: % 7.15/1.66 | | | | | (47) $false % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | CLOSE: (47) is inconsistent. % 7.15/1.66 | | | | | % 7.15/1.66 | | | | Case 2: % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | (48) ~ (all_9_3 = 0) & ~ (all_9_4 = 0) % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | ALPHA: (48) implies: % 7.15/1.66 | | | | | (49) ~ (all_9_4 = 0) % 7.15/1.66 | | | | | (50) ~ (all_9_3 = 0) % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | BETA: splitting (36) gives: % 7.15/1.66 | | | | | % 7.15/1.66 | | | | | Case 1: % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | (51) xsd_string(all_9_5) = 0 % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | GROUND_INST: instantiating (16) with all_9_4, 0, all_9_5, % 7.15/1.66 | | | | | | simplifying with (34), (51) gives: % 7.15/1.66 | | | | | | (52) all_9_4 = 0 % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | REDUCE: (49), (52) imply: % 7.15/1.66 | | | | | | (53) $false % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | CLOSE: (53) is inconsistent. % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | Case 2: % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | (54) all_9_3 = 0 % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | REDUCE: (50), (54) imply: % 7.15/1.66 | | | | | | (55) $false % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | | CLOSE: (55) is inconsistent. % 7.15/1.66 | | | | | | % 7.15/1.66 | | | | | End of split % 7.15/1.66 | | | | | % 7.15/1.66 | | | | End of split % 7.15/1.66 | | | | % 7.15/1.66 | | | Case 2: % 7.15/1.66 | | | | % 7.15/1.67 | | | | (56) (cowlThing(all_9_2) = all_9_1 & cowlNothing(all_9_2) = all_9_0 & % 7.15/1.67 | | | | ( ~ (all_9_1 = 0) | all_9_0 = 0)) | (cA_and_B(all_9_7) = % 7.15/1.67 | | | | all_9_6 & ((all_9_6 = 0 & ~ (all_9_7 = ib) & ~ (all_9_7 = % 7.15/1.67 | | | | ia)) | ( ~ (all_9_6 = 0) & (all_9_7 = ib | all_9_7 = % 7.15/1.67 | | | | ia)))) % 7.15/1.67 | | | | % 7.15/1.67 | | | | BETA: splitting (56) gives: % 7.15/1.67 | | | | % 7.15/1.67 | | | | Case 1: % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | (57) cowlThing(all_9_2) = all_9_1 & cowlNothing(all_9_2) = all_9_0 % 7.15/1.67 | | | | | & ( ~ (all_9_1 = 0) | all_9_0 = 0) % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | ALPHA: (57) implies: % 7.15/1.67 | | | | | (58) cowlNothing(all_9_2) = all_9_0 % 7.15/1.67 | | | | | (59) cowlThing(all_9_2) = all_9_1 % 7.15/1.67 | | | | | (60) ~ (all_9_1 = 0) | all_9_0 = 0 % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | GROUND_INST: instantiating (2) with all_9_2, all_9_1, simplifying with % 7.15/1.67 | | | | | (20), (59) gives: % 7.15/1.67 | | | | | (61) all_9_1 = 0 % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | BETA: splitting (60) gives: % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | Case 1: % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | (62) ~ (all_9_1 = 0) % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | REDUCE: (61), (62) imply: % 7.15/1.67 | | | | | | (63) $false % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | CLOSE: (63) is inconsistent. % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | Case 2: % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | (64) all_9_0 = 0 % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | REDUCE: (58), (64) imply: % 7.15/1.67 | | | | | | (65) cowlNothing(all_9_2) = 0 % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | GROUND_INST: instantiating (1) with all_9_2, simplifying with (20), % 7.15/1.67 | | | | | | (65) gives: % 7.15/1.67 | | | | | | (66) $false % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | CLOSE: (66) is inconsistent. % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | End of split % 7.15/1.67 | | | | | % 7.15/1.67 | | | | Case 2: % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | (67) cA_and_B(all_9_7) = all_9_6 & ((all_9_6 = 0 & ~ (all_9_7 = % 7.15/1.67 | | | | | ib) & ~ (all_9_7 = ia)) | ( ~ (all_9_6 = 0) & (all_9_7 % 7.15/1.67 | | | | | = ib | all_9_7 = ia))) % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | ALPHA: (67) implies: % 7.15/1.67 | | | | | (68) cA_and_B(all_9_7) = all_9_6 % 7.15/1.67 | | | | | (69) (all_9_6 = 0 & ~ (all_9_7 = ib) & ~ (all_9_7 = ia)) | ( ~ % 7.15/1.67 | | | | | (all_9_6 = 0) & (all_9_7 = ib | all_9_7 = ia)) % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | GROUND_INST: instantiating (8) with all_9_7, all_9_6, simplifying with % 7.15/1.67 | | | | | (18), (68) gives: % 7.15/1.67 | | | | | (70) all_9_6 = 0 | ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ % 7.15/1.67 | | | | | (v0 = 0) & cB(all_9_7) = v1 & cA(all_9_7) = v0) % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | BETA: splitting (69) gives: % 7.15/1.67 | | | | | % 7.15/1.67 | | | | | Case 1: % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | (71) all_9_6 = 0 & ~ (all_9_7 = ib) & ~ (all_9_7 = ia) % 7.15/1.67 | | | | | | % 7.15/1.67 | | | | | | ALPHA: (71) implies: % 7.42/1.67 | | | | | | (72) all_9_6 = 0 % 7.42/1.67 | | | | | | (73) ~ (all_9_7 = ia) % 7.42/1.67 | | | | | | (74) ~ (all_9_7 = ib) % 7.42/1.67 | | | | | | % 7.42/1.67 | | | | | | REDUCE: (68), (72) imply: % 7.42/1.67 | | | | | | (75) cA_and_B(all_9_7) = 0 % 7.42/1.67 | | | | | | % 7.42/1.67 | | | | | | GROUND_INST: instantiating (7) with all_9_7, simplifying with (18), % 7.42/1.67 | | | | | | (75) gives: % 7.42/1.67 | | | | | | (76) ? [v0: any] : ? [v1: any] : (cB(all_9_7) = v1 & % 7.42/1.67 | | | | | | cA(all_9_7) = v0 & (v1 = 0 | v0 = 0)) % 7.42/1.67 | | | | | | % 7.42/1.67 | | | | | | DELTA: instantiating (76) with fresh symbols all_48_0, all_48_1 % 7.42/1.67 | | | | | | gives: % 7.42/1.68 | | | | | | (77) cB(all_9_7) = all_48_0 & cA(all_9_7) = all_48_1 & (all_48_0 % 7.42/1.68 | | | | | | = 0 | all_48_1 = 0) % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | ALPHA: (77) implies: % 7.42/1.68 | | | | | | (78) cA(all_9_7) = all_48_1 % 7.42/1.68 | | | | | | (79) cB(all_9_7) = all_48_0 % 7.42/1.68 | | | | | | (80) all_48_0 = 0 | all_48_1 = 0 % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | BETA: splitting (80) gives: % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | Case 1: % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | (81) all_48_0 = 0 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | REDUCE: (79), (81) imply: % 7.42/1.68 | | | | | | | (82) cB(all_9_7) = 0 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | GROUND_INST: instantiating (10) with all_9_7, simplifying with % 7.42/1.68 | | | | | | | (18), (82) gives: % 7.42/1.68 | | | | | | | (83) all_9_7 = ib % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | REDUCE: (74), (83) imply: % 7.42/1.68 | | | | | | | (84) $false % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | CLOSE: (84) is inconsistent. % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | Case 2: % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | (85) all_48_1 = 0 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | REDUCE: (78), (85) imply: % 7.42/1.68 | | | | | | | (86) cA(all_9_7) = 0 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | GROUND_INST: instantiating (6) with all_9_7, simplifying with % 7.42/1.68 | | | | | | | (18), (86) gives: % 7.42/1.68 | | | | | | | (87) all_9_7 = ia % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | REDUCE: (73), (87) imply: % 7.42/1.68 | | | | | | | (88) $false % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | CLOSE: (88) is inconsistent. % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | End of split % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | Case 2: % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | (89) ~ (all_9_6 = 0) & (all_9_7 = ib | all_9_7 = ia) % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | ALPHA: (89) implies: % 7.42/1.68 | | | | | | (90) ~ (all_9_6 = 0) % 7.42/1.68 | | | | | | (91) all_9_7 = ib | all_9_7 = ia % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | BETA: splitting (70) gives: % 7.42/1.68 | | | | | | % 7.42/1.68 | | | | | | Case 1: % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | (92) all_9_6 = 0 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | REDUCE: (90), (92) imply: % 7.42/1.68 | | | | | | | (93) $false % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | CLOSE: (93) is inconsistent. % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | Case 2: % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | (94) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = 0) & % 7.42/1.68 | | | | | | | cB(all_9_7) = v1 & cA(all_9_7) = v0) % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | DELTA: instantiating (94) with fresh symbols all_47_0, all_47_1 % 7.42/1.68 | | | | | | | gives: % 7.42/1.68 | | | | | | | (95) ~ (all_47_0 = 0) & ~ (all_47_1 = 0) & cB(all_9_7) = % 7.42/1.68 | | | | | | | all_47_0 & cA(all_9_7) = all_47_1 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | ALPHA: (95) implies: % 7.42/1.68 | | | | | | | (96) ~ (all_47_1 = 0) % 7.42/1.68 | | | | | | | (97) ~ (all_47_0 = 0) % 7.42/1.68 | | | | | | | (98) cA(all_9_7) = all_47_1 % 7.42/1.68 | | | | | | | (99) cB(all_9_7) = all_47_0 % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | BETA: splitting (91) gives: % 7.42/1.68 | | | | | | | % 7.42/1.68 | | | | | | | Case 1: % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | (100) all_9_7 = ib % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | REDUCE: (99), (100) imply: % 7.42/1.68 | | | | | | | | (101) cB(ib) = all_47_0 % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | GROUND_INST: instantiating (9) with all_47_0, simplifying with % 7.42/1.68 | | | | | | | | (101) gives: % 7.42/1.68 | | | | | | | | (102) all_47_0 = 0 % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | REDUCE: (97), (102) imply: % 7.42/1.68 | | | | | | | | (103) $false % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | CLOSE: (103) is inconsistent. % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | Case 2: % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | (104) all_9_7 = ia % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | REDUCE: (98), (104) imply: % 7.42/1.68 | | | | | | | | (105) cA(ia) = all_47_1 % 7.42/1.68 | | | | | | | | % 7.42/1.68 | | | | | | | | GROUND_INST: instantiating (5) with all_47_1, simplifying with % 7.42/1.68 | | | | | | | | (105) gives: % 7.42/1.68 | | | | | | | | (106) all_47_1 = 0 % 7.42/1.68 | | | | | | | | % 7.42/1.69 | | | | | | | | REDUCE: (96), (106) imply: % 7.42/1.69 | | | | | | | | (107) $false % 7.42/1.69 | | | | | | | | % 7.42/1.69 | | | | | | | | CLOSE: (107) is inconsistent. % 7.42/1.69 | | | | | | | | % 7.42/1.69 | | | | | | | End of split % 7.42/1.69 | | | | | | | % 7.42/1.69 | | | | | | End of split % 7.42/1.69 | | | | | | % 7.42/1.69 | | | | | End of split % 7.42/1.69 | | | | | % 7.42/1.69 | | | | End of split % 7.42/1.69 | | | | % 7.42/1.69 | | | End of split % 7.42/1.69 | | | % 7.42/1.69 | | End of split % 7.42/1.69 | | % 7.42/1.69 | End of split % 7.42/1.69 | % 7.42/1.69 End of proof % 7.42/1.69 % SZS output end Proof for theBenchmark % 7.42/1.69 % 7.42/1.69 1195ms %------------------------------------------------------------------------------