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