%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS137+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 : n005.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:23 EDT 2023 % Result : Theorem 3.74s 1.33s % Output : Proof 6.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KRS137+1 : TPTP v8.1.2. Released v3.1.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n005.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Mon Aug 28 02:00:08 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.75/0.96 Prover 4: Preprocessing ... % 1.75/0.97 Prover 1: Preprocessing ... % 2.17/1.01 Prover 5: Preprocessing ... % 2.17/1.01 Prover 0: Preprocessing ... % 2.17/1.01 Prover 3: Preprocessing ... % 2.17/1.01 Prover 2: Preprocessing ... % 2.17/1.01 Prover 6: Preprocessing ... % 3.22/1.13 Prover 5: Proving ... % 3.22/1.13 Prover 2: Proving ... % 3.22/1.16 Prover 1: Constructing countermodel ... % 3.22/1.16 Prover 6: Constructing countermodel ... % 3.22/1.16 Prover 4: Constructing countermodel ... % 3.22/1.16 Prover 3: Constructing countermodel ... % 3.22/1.19 Prover 0: Proving ... % 3.74/1.32 Prover 3: proved (703ms) % 3.74/1.33 % 3.74/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.74/1.33 % 3.74/1.33 Prover 5: stopped % 3.74/1.33 Prover 0: stopped % 3.74/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.74/1.33 Prover 2: stopped % 3.74/1.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.74/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.74/1.34 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.46/1.34 Prover 6: stopped % 4.46/1.35 Prover 7: Preprocessing ... % 4.46/1.35 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.46/1.36 Prover 10: Preprocessing ... % 4.46/1.36 Prover 8: Preprocessing ... % 4.46/1.36 Prover 7: Warning: ignoring some quantifiers % 4.46/1.37 Prover 11: Preprocessing ... % 4.46/1.37 Prover 7: Constructing countermodel ... % 4.46/1.37 Prover 10: Warning: ignoring some quantifiers % 4.46/1.37 Prover 13: Preprocessing ... % 4.46/1.37 Prover 10: Constructing countermodel ... % 4.46/1.39 Prover 13: Warning: ignoring some quantifiers % 4.46/1.39 Prover 13: Constructing countermodel ... % 4.46/1.43 Prover 11: Constructing countermodel ... % 5.43/1.44 Prover 10: gave up % 5.43/1.44 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.43/1.45 Prover 13: gave up % 5.43/1.46 Prover 8: Warning: ignoring some quantifiers % 5.43/1.46 Prover 8: Constructing countermodel ... % 5.43/1.46 Prover 7: gave up % 5.43/1.46 Prover 16: Preprocessing ... % 5.43/1.46 Prover 4: Found proof (size 61) % 5.43/1.46 Prover 4: proved (837ms) % 5.43/1.46 Prover 1: stopped % 5.43/1.46 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 5.43/1.46 Prover 11: stopped % 5.43/1.46 Prover 8: stopped % 5.59/1.47 Prover 19: Preprocessing ... % 5.59/1.48 Prover 16: Warning: ignoring some quantifiers % 5.59/1.48 Prover 16: Constructing countermodel ... % 5.59/1.48 Prover 16: stopped % 5.59/1.51 Prover 19: Warning: ignoring some quantifiers % 5.59/1.51 Prover 19: Constructing countermodel ... % 5.89/1.52 Prover 19: stopped % 5.89/1.52 % 5.89/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.89/1.52 % 5.89/1.53 % SZS output start Proof for theBenchmark % 5.89/1.54 Assumptions after simplification: % 5.89/1.54 --------------------------------- % 5.89/1.54 % 5.89/1.54 (axiom_0) % 6.07/1.57 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) & % 6.07/1.57 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 6.07/1.57 % 6.07/1.57 (axiom_1) % 6.07/1.57 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~ $i(v0) | % 6.07/1.57 xsd_string(v0) = 0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 6.07/1.57 (xsd_string(v0) = v1) | ~ $i(v0) | xsd_integer(v0) = 0) & ! [v0: $i] : ( ~ % 6.07/1.57 (xsd_integer(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.07/1.57 xsd_string(v0) = v1)) & ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) % 6.07/1.57 | ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) % 6.07/1.57 % 6.07/1.57 (axiom_2) % 6.07/1.57 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cAutomobile(v0) = v1) | ~ $i(v0) | % 6.07/1.57 ? [v2: int] : ( ~ (v2 = 0) & cCar(v0) = v2)) & ! [v0: $i] : ! [v1: int] : % 6.07/1.57 (v1 = 0 | ~ (cCar(v0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 6.07/1.57 cAutomobile(v0) = v2)) & ! [v0: $i] : ( ~ (cAutomobile(v0) = 0) | ~ % 6.07/1.57 $i(v0) | cCar(v0) = 0) & ! [v0: $i] : ( ~ (cCar(v0) = 0) | ~ $i(v0) | % 6.07/1.57 cAutomobile(v0) = 0) % 6.07/1.57 % 6.07/1.57 (axiom_3) % 6.07/1.57 cowlThing(iauto) = 0 & $i(iauto) % 6.07/1.57 % 6.07/1.57 (axiom_4) % 6.07/1.57 cAutomobile(iauto) = 0 & $i(iauto) % 6.07/1.57 % 6.07/1.57 (axiom_5) % 6.07/1.57 cowlThing(icar) = 0 & $i(icar) % 6.07/1.57 % 6.07/1.58 (axiom_6) % 6.07/1.58 cCar(icar) = 0 & $i(icar) % 6.07/1.58 % 6.07/1.58 (the_axiom) % 6.07/1.58 $i(icar) & $i(iauto) & ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: % 6.07/1.58 any] : ? [v4: $i] : ? [v5: any] : ? [v6: any] : ? [v7: $i] : ? [v8: % 6.07/1.58 any] : ? [v9: any] : (cAutomobile(icar) = v3 & cCar(iauto) = v0 & % 6.07/1.58 cowlThing(icar) = v2 & cowlThing(iauto) = v1 & $i(v7) & $i(v4) & ( ~ (v3 = % 6.07/1.58 0) | ~ (v2 = 0) | ~ (v1 = 0) | ~ (v0 = 0) | (xsd_integer(v4) = v6 & % 6.07/1.58 xsd_string(v4) = v5 & ((v6 = 0 & v5 = 0) | ( ~ (v6 = 0) & ~ (v5 = 0)))) % 6.07/1.58 | (cowlNothing(v7) = v9 & cowlThing(v7) = v8 & ( ~ (v8 = 0) | v9 = 0)))) % 6.07/1.58 % 6.07/1.58 (function-axioms) % 6.07/1.59 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = % 6.07/1.59 v0 | ~ (cAutomobile(v2) = v1) | ~ (cAutomobile(v2) = v0)) & ! [v0: % 6.07/1.59 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.07/1.59 ~ (cCar(v2) = v1) | ~ (cCar(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 6.07/1.59 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | % 6.07/1.59 ~ (xsd_integer(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.07/1.59 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ % 6.07/1.59 (xsd_string(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.07/1.59 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~ % 6.07/1.59 (cowlNothing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.07/1.59 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ % 6.07/1.59 (cowlThing(v2) = v0)) % 6.07/1.59 % 6.07/1.59 Those formulas are unsatisfiable: % 6.07/1.59 --------------------------------- % 6.07/1.59 % 6.07/1.59 Begin of proof % 6.07/1.59 | % 6.07/1.59 | ALPHA: (axiom_0) implies: % 6.07/1.59 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 6.07/1.59 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ % 6.07/1.59 | $i(v0)) % 6.07/1.59 | % 6.07/1.59 | ALPHA: (axiom_1) implies: % 6.07/1.59 | (3) ! [v0: $i] : ( ~ (xsd_integer(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( % 6.07/1.59 | ~ (v1 = 0) & xsd_string(v0) = v1)) % 6.07/1.59 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~ % 6.07/1.59 | $i(v0) | xsd_string(v0) = 0) % 6.07/1.59 | % 6.07/1.59 | ALPHA: (axiom_2) implies: % 6.07/1.59 | (5) ! [v0: $i] : ( ~ (cCar(v0) = 0) | ~ $i(v0) | cAutomobile(v0) = 0) % 6.07/1.59 | (6) ! [v0: $i] : ( ~ (cAutomobile(v0) = 0) | ~ $i(v0) | cCar(v0) = 0) % 6.07/1.59 | % 6.07/1.59 | ALPHA: (axiom_3) implies: % 6.07/1.59 | (7) cowlThing(iauto) = 0 % 6.07/1.59 | % 6.07/1.59 | ALPHA: (axiom_4) implies: % 6.07/1.59 | (8) cAutomobile(iauto) = 0 % 6.07/1.59 | % 6.07/1.59 | ALPHA: (axiom_5) implies: % 6.07/1.60 | (9) cowlThing(icar) = 0 % 6.07/1.60 | % 6.07/1.60 | ALPHA: (axiom_6) implies: % 6.07/1.60 | (10) cCar(icar) = 0 % 6.07/1.60 | % 6.07/1.60 | ALPHA: (the_axiom) implies: % 6.07/1.60 | (11) $i(iauto) % 6.07/1.60 | (12) $i(icar) % 6.07/1.60 | (13) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : ? [v4: % 6.07/1.60 | $i] : ? [v5: any] : ? [v6: any] : ? [v7: $i] : ? [v8: any] : ? % 6.07/1.60 | [v9: any] : (cAutomobile(icar) = v3 & cCar(iauto) = v0 & % 6.07/1.60 | cowlThing(icar) = v2 & cowlThing(iauto) = v1 & $i(v7) & $i(v4) & ( ~ % 6.07/1.60 | (v3 = 0) | ~ (v2 = 0) | ~ (v1 = 0) | ~ (v0 = 0) | % 6.07/1.60 | (xsd_integer(v4) = v6 & xsd_string(v4) = v5 & ((v6 = 0 & v5 = 0) | % 6.07/1.60 | ( ~ (v6 = 0) & ~ (v5 = 0)))) | (cowlNothing(v7) = v9 & % 6.07/1.60 | cowlThing(v7) = v8 & ( ~ (v8 = 0) | v9 = 0)))) % 6.07/1.60 | % 6.07/1.60 | ALPHA: (function-axioms) implies: % 6.07/1.60 | (14) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.07/1.60 | : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 6.07/1.60 | (15) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.07/1.60 | : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 6.07/1.60 | (16) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.07/1.60 | : (v1 = v0 | ~ (cCar(v2) = v1) | ~ (cCar(v2) = v0)) % 6.07/1.60 | (17) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.07/1.60 | : (v1 = v0 | ~ (cAutomobile(v2) = v1) | ~ (cAutomobile(v2) = v0)) % 6.07/1.60 | % 6.07/1.60 | DELTA: instantiating (13) with fresh symbols all_7_0, all_7_1, all_7_2, % 6.07/1.60 | all_7_3, all_7_4, all_7_5, all_7_6, all_7_7, all_7_8, all_7_9 gives: % 6.07/1.60 | (18) cAutomobile(icar) = all_7_6 & cCar(iauto) = all_7_9 & cowlThing(icar) % 6.07/1.60 | = all_7_7 & cowlThing(iauto) = all_7_8 & $i(all_7_2) & $i(all_7_5) & ( % 6.07/1.60 | ~ (all_7_6 = 0) | ~ (all_7_7 = 0) | ~ (all_7_8 = 0) | ~ (all_7_9 % 6.07/1.60 | = 0) | (xsd_integer(all_7_5) = all_7_3 & xsd_string(all_7_5) = % 6.07/1.60 | all_7_4 & ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ % 6.07/1.60 | (all_7_4 = 0)))) | (cowlNothing(all_7_2) = all_7_0 & % 6.07/1.60 | cowlThing(all_7_2) = all_7_1 & ( ~ (all_7_1 = 0) | all_7_0 = 0))) % 6.07/1.60 | % 6.07/1.60 | ALPHA: (18) implies: % 6.07/1.60 | (19) $i(all_7_5) % 6.07/1.60 | (20) $i(all_7_2) % 6.07/1.60 | (21) cowlThing(iauto) = all_7_8 % 6.07/1.61 | (22) cowlThing(icar) = all_7_7 % 6.07/1.61 | (23) cCar(iauto) = all_7_9 % 6.07/1.61 | (24) cAutomobile(icar) = all_7_6 % 6.07/1.61 | (25) ~ (all_7_6 = 0) | ~ (all_7_7 = 0) | ~ (all_7_8 = 0) | ~ (all_7_9 = % 6.07/1.61 | 0) | (xsd_integer(all_7_5) = all_7_3 & xsd_string(all_7_5) = all_7_4 % 6.07/1.61 | & ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ (all_7_4 = % 6.07/1.61 | 0)))) | (cowlNothing(all_7_2) = all_7_0 & cowlThing(all_7_2) = % 6.07/1.61 | all_7_1 & ( ~ (all_7_1 = 0) | all_7_0 = 0)) % 6.07/1.61 | % 6.07/1.61 | GROUND_INST: instantiating (14) with 0, all_7_8, iauto, simplifying with (7), % 6.07/1.61 | (21) gives: % 6.07/1.61 | (26) all_7_8 = 0 % 6.07/1.61 | % 6.07/1.61 | GROUND_INST: instantiating (14) with 0, all_7_7, icar, simplifying with (9), % 6.07/1.61 | (22) gives: % 6.07/1.61 | (27) all_7_7 = 0 % 6.07/1.61 | % 6.07/1.61 | GROUND_INST: instantiating (5) with icar, simplifying with (10), (12) gives: % 6.07/1.61 | (28) cAutomobile(icar) = 0 % 6.07/1.61 | % 6.07/1.61 | GROUND_INST: instantiating (6) with iauto, simplifying with (8), (11) gives: % 6.07/1.61 | (29) cCar(iauto) = 0 % 6.07/1.61 | % 6.07/1.61 | BETA: splitting (25) gives: % 6.07/1.61 | % 6.07/1.61 | Case 1: % 6.07/1.61 | | % 6.07/1.61 | | (30) ~ (all_7_6 = 0) % 6.07/1.61 | | % 6.07/1.61 | | GROUND_INST: instantiating (17) with all_7_6, 0, icar, simplifying with % 6.07/1.61 | | (24), (28) gives: % 6.07/1.61 | | (31) all_7_6 = 0 % 6.07/1.61 | | % 6.07/1.61 | | REDUCE: (30), (31) imply: % 6.07/1.61 | | (32) $false % 6.07/1.61 | | % 6.07/1.61 | | CLOSE: (32) is inconsistent. % 6.07/1.61 | | % 6.07/1.61 | Case 2: % 6.07/1.61 | | % 6.07/1.61 | | (33) ~ (all_7_7 = 0) | ~ (all_7_8 = 0) | ~ (all_7_9 = 0) | % 6.07/1.61 | | (xsd_integer(all_7_5) = all_7_3 & xsd_string(all_7_5) = all_7_4 & % 6.07/1.61 | | ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ (all_7_4 = % 6.07/1.61 | | 0)))) | (cowlNothing(all_7_2) = all_7_0 & cowlThing(all_7_2) % 6.07/1.61 | | = all_7_1 & ( ~ (all_7_1 = 0) | all_7_0 = 0)) % 6.07/1.61 | | % 6.07/1.61 | | BETA: splitting (33) gives: % 6.07/1.61 | | % 6.07/1.61 | | Case 1: % 6.07/1.61 | | | % 6.07/1.61 | | | (34) ~ (all_7_7 = 0) % 6.07/1.61 | | | % 6.07/1.61 | | | REDUCE: (27), (34) imply: % 6.07/1.61 | | | (35) $false % 6.07/1.61 | | | % 6.07/1.61 | | | CLOSE: (35) is inconsistent. % 6.07/1.61 | | | % 6.07/1.61 | | Case 2: % 6.07/1.61 | | | % 6.07/1.61 | | | (36) ~ (all_7_8 = 0) | ~ (all_7_9 = 0) | (xsd_integer(all_7_5) = % 6.07/1.61 | | | all_7_3 & xsd_string(all_7_5) = all_7_4 & ((all_7_3 = 0 & % 6.07/1.61 | | | all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ (all_7_4 = 0)))) | % 6.07/1.61 | | | (cowlNothing(all_7_2) = all_7_0 & cowlThing(all_7_2) = all_7_1 & ( % 6.07/1.61 | | | ~ (all_7_1 = 0) | all_7_0 = 0)) % 6.07/1.61 | | | % 6.07/1.61 | | | BETA: splitting (36) gives: % 6.07/1.61 | | | % 6.07/1.61 | | | Case 1: % 6.07/1.61 | | | | % 6.07/1.61 | | | | (37) ~ (all_7_8 = 0) % 6.07/1.61 | | | | % 6.07/1.61 | | | | REDUCE: (26), (37) imply: % 6.07/1.62 | | | | (38) $false % 6.07/1.62 | | | | % 6.07/1.62 | | | | CLOSE: (38) is inconsistent. % 6.07/1.62 | | | | % 6.07/1.62 | | | Case 2: % 6.07/1.62 | | | | % 6.07/1.62 | | | | (39) ~ (all_7_9 = 0) | (xsd_integer(all_7_5) = all_7_3 & % 6.07/1.62 | | | | xsd_string(all_7_5) = all_7_4 & ((all_7_3 = 0 & all_7_4 = 0) | % 6.07/1.62 | | | | ( ~ (all_7_3 = 0) & ~ (all_7_4 = 0)))) | % 6.07/1.62 | | | | (cowlNothing(all_7_2) = all_7_0 & cowlThing(all_7_2) = all_7_1 & % 6.07/1.62 | | | | ( ~ (all_7_1 = 0) | all_7_0 = 0)) % 6.07/1.62 | | | | % 6.07/1.62 | | | | BETA: splitting (39) gives: % 6.07/1.62 | | | | % 6.07/1.62 | | | | Case 1: % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | (40) ~ (all_7_9 = 0) % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | GROUND_INST: instantiating (16) with all_7_9, 0, iauto, simplifying % 6.07/1.62 | | | | | with (23), (29) gives: % 6.07/1.62 | | | | | (41) all_7_9 = 0 % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | REDUCE: (40), (41) imply: % 6.07/1.62 | | | | | (42) $false % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | CLOSE: (42) is inconsistent. % 6.07/1.62 | | | | | % 6.07/1.62 | | | | Case 2: % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | (43) (xsd_integer(all_7_5) = all_7_3 & xsd_string(all_7_5) = % 6.07/1.62 | | | | | all_7_4 & ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & % 6.07/1.62 | | | | | ~ (all_7_4 = 0)))) | (cowlNothing(all_7_2) = all_7_0 & % 6.07/1.62 | | | | | cowlThing(all_7_2) = all_7_1 & ( ~ (all_7_1 = 0) | all_7_0 = % 6.07/1.62 | | | | | 0)) % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | BETA: splitting (43) gives: % 6.07/1.62 | | | | | % 6.07/1.62 | | | | | Case 1: % 6.07/1.62 | | | | | | % 6.07/1.62 | | | | | | (44) xsd_integer(all_7_5) = all_7_3 & xsd_string(all_7_5) = % 6.07/1.62 | | | | | | all_7_4 & ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & % 6.07/1.62 | | | | | | ~ (all_7_4 = 0))) % 6.07/1.62 | | | | | | % 6.07/1.62 | | | | | | ALPHA: (44) implies: % 6.07/1.62 | | | | | | (45) xsd_string(all_7_5) = all_7_4 % 6.07/1.62 | | | | | | (46) xsd_integer(all_7_5) = all_7_3 % 6.07/1.62 | | | | | | (47) (all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ % 6.07/1.62 | | | | | | (all_7_4 = 0)) % 6.07/1.62 | | | | | | % 6.07/1.62 | | | | | | GROUND_INST: instantiating (4) with all_7_5, all_7_3, simplifying % 6.07/1.62 | | | | | | with (19), (46) gives: % 6.07/1.62 | | | | | | (48) all_7_3 = 0 | xsd_string(all_7_5) = 0 % 6.07/1.62 | | | | | | % 6.07/1.62 | | | | | | BETA: splitting (47) gives: % 6.07/1.62 | | | | | | % 6.07/1.62 | | | | | | Case 1: % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | (49) all_7_3 = 0 & all_7_4 = 0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | ALPHA: (49) implies: % 6.07/1.62 | | | | | | | (50) all_7_4 = 0 % 6.07/1.62 | | | | | | | (51) all_7_3 = 0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | REDUCE: (46), (51) imply: % 6.07/1.62 | | | | | | | (52) xsd_integer(all_7_5) = 0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | REDUCE: (45), (50) imply: % 6.07/1.62 | | | | | | | (53) xsd_string(all_7_5) = 0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | GROUND_INST: instantiating (3) with all_7_5, simplifying with % 6.07/1.62 | | | | | | | (19), (52) gives: % 6.07/1.62 | | | | | | | (54) ? [v0: int] : ( ~ (v0 = 0) & xsd_string(all_7_5) = v0) % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | DELTA: instantiating (54) with fresh symbol all_74_0 gives: % 6.07/1.62 | | | | | | | (55) ~ (all_74_0 = 0) & xsd_string(all_7_5) = all_74_0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | ALPHA: (55) implies: % 6.07/1.62 | | | | | | | (56) ~ (all_74_0 = 0) % 6.07/1.62 | | | | | | | (57) xsd_string(all_7_5) = all_74_0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | GROUND_INST: instantiating (15) with 0, all_74_0, all_7_5, % 6.07/1.62 | | | | | | | simplifying with (53), (57) gives: % 6.07/1.62 | | | | | | | (58) all_74_0 = 0 % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | REDUCE: (56), (58) imply: % 6.07/1.62 | | | | | | | (59) $false % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | CLOSE: (59) is inconsistent. % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | Case 2: % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | (60) ~ (all_7_3 = 0) & ~ (all_7_4 = 0) % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | ALPHA: (60) implies: % 6.07/1.62 | | | | | | | (61) ~ (all_7_4 = 0) % 6.07/1.62 | | | | | | | (62) ~ (all_7_3 = 0) % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | BETA: splitting (48) gives: % 6.07/1.62 | | | | | | | % 6.07/1.62 | | | | | | | Case 1: % 6.07/1.62 | | | | | | | | % 6.07/1.63 | | | | | | | | (63) xsd_string(all_7_5) = 0 % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | | GROUND_INST: instantiating (15) with all_7_4, 0, all_7_5, % 6.07/1.63 | | | | | | | | simplifying with (45), (63) gives: % 6.07/1.63 | | | | | | | | (64) all_7_4 = 0 % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | | REDUCE: (61), (64) imply: % 6.07/1.63 | | | | | | | | (65) $false % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | | CLOSE: (65) is inconsistent. % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | Case 2: % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | | (66) all_7_3 = 0 % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | | REDUCE: (62), (66) imply: % 6.07/1.63 | | | | | | | | (67) $false % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | | CLOSE: (67) is inconsistent. % 6.07/1.63 | | | | | | | | % 6.07/1.63 | | | | | | | End of split % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | End of split % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | Case 2: % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | | (68) cowlNothing(all_7_2) = all_7_0 & cowlThing(all_7_2) = % 6.07/1.63 | | | | | | all_7_1 & ( ~ (all_7_1 = 0) | all_7_0 = 0) % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | | ALPHA: (68) implies: % 6.07/1.63 | | | | | | (69) cowlThing(all_7_2) = all_7_1 % 6.07/1.63 | | | | | | (70) cowlNothing(all_7_2) = all_7_0 % 6.07/1.63 | | | | | | (71) ~ (all_7_1 = 0) | all_7_0 = 0 % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | | GROUND_INST: instantiating (2) with all_7_2, all_7_1, simplifying % 6.07/1.63 | | | | | | with (20), (69) gives: % 6.07/1.63 | | | | | | (72) all_7_1 = 0 % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | | BETA: splitting (71) gives: % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | | Case 1: % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | (73) ~ (all_7_1 = 0) % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | REDUCE: (72), (73) imply: % 6.07/1.63 | | | | | | | (74) $false % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | CLOSE: (74) is inconsistent. % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | Case 2: % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | (75) all_7_0 = 0 % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | REDUCE: (70), (75) imply: % 6.07/1.63 | | | | | | | (76) cowlNothing(all_7_2) = 0 % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | GROUND_INST: instantiating (1) with all_7_2, simplifying with % 6.07/1.63 | | | | | | | (20), (76) gives: % 6.07/1.63 | | | | | | | (77) $false % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | | CLOSE: (77) is inconsistent. % 6.07/1.63 | | | | | | | % 6.07/1.63 | | | | | | End of split % 6.07/1.63 | | | | | | % 6.07/1.63 | | | | | End of split % 6.07/1.63 | | | | | % 6.07/1.63 | | | | End of split % 6.07/1.63 | | | | % 6.07/1.63 | | | End of split % 6.07/1.63 | | | % 6.07/1.63 | | End of split % 6.07/1.63 | | % 6.07/1.63 | End of split % 6.07/1.63 | % 6.07/1.63 End of proof % 6.07/1.63 % SZS output end Proof for theBenchmark % 6.07/1.63 % 6.07/1.63 1037ms %------------------------------------------------------------------------------