TSTP Solution File: KRS164+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS164+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 : n023.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 4.50s 1.38s
% Output : Proof 6.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS164+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 02:08:55 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.53/0.62 ________ _____
% 0.53/0.62 ___ __ \_________(_)________________________________
% 0.53/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.53/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.53/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.53/0.62
% 0.53/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.53/0.62 (2023-06-19)
% 0.53/0.62
% 0.53/0.62 (c) Philipp Rümmer, 2009-2023
% 0.53/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.53/0.62 Amanda Stjerna.
% 0.53/0.62 Free software under BSD-3-Clause.
% 0.53/0.62
% 0.53/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.53/0.62
% 0.53/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.53/0.63 Running up to 7 provers in parallel.
% 0.70/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.70/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.70/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.70/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.70/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.70/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.70/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.18/1.02 Prover 1: Preprocessing ...
% 2.18/1.02 Prover 4: Preprocessing ...
% 2.18/1.07 Prover 0: Preprocessing ...
% 2.18/1.07 Prover 5: Preprocessing ...
% 2.18/1.07 Prover 6: Preprocessing ...
% 2.18/1.07 Prover 2: Preprocessing ...
% 2.18/1.07 Prover 3: Preprocessing ...
% 3.00/1.18 Prover 5: Proving ...
% 3.00/1.18 Prover 2: Proving ...
% 3.28/1.20 Prover 6: Constructing countermodel ...
% 3.28/1.21 Prover 1: Constructing countermodel ...
% 3.28/1.21 Prover 4: Constructing countermodel ...
% 3.28/1.21 Prover 3: Constructing countermodel ...
% 3.70/1.27 Prover 0: Proving ...
% 4.50/1.38 Prover 6: proved (729ms)
% 4.50/1.38
% 4.50/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.50/1.38
% 4.50/1.38 Prover 3: stopped
% 4.50/1.38 Prover 5: stopped
% 4.50/1.38 Prover 0: proved (738ms)
% 4.50/1.38
% 4.50/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.50/1.38
% 4.50/1.39 Prover 2: stopped
% 4.50/1.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.50/1.39 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.50/1.39 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.50/1.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.50/1.39 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.50/1.41 Prover 7: Preprocessing ...
% 4.50/1.41 Prover 8: Preprocessing ...
% 4.50/1.41 Prover 11: Preprocessing ...
% 4.50/1.41 Prover 10: Preprocessing ...
% 4.50/1.42 Prover 13: Preprocessing ...
% 4.50/1.44 Prover 7: Warning: ignoring some quantifiers
% 4.50/1.44 Prover 10: Warning: ignoring some quantifiers
% 4.50/1.44 Prover 7: Constructing countermodel ...
% 4.50/1.44 Prover 10: Constructing countermodel ...
% 5.11/1.45 Prover 13: Warning: ignoring some quantifiers
% 5.11/1.45 Prover 13: Constructing countermodel ...
% 5.11/1.48 Prover 11: Constructing countermodel ...
% 5.42/1.49 Prover 8: Warning: ignoring some quantifiers
% 5.42/1.49 Prover 8: Constructing countermodel ...
% 5.42/1.51 Prover 10: gave up
% 5.42/1.51 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 5.42/1.51 Prover 1: Found proof (size 64)
% 5.42/1.52 Prover 1: proved (875ms)
% 5.42/1.52 Prover 8: stopped
% 5.42/1.52 Prover 7: stopped
% 5.42/1.52 Prover 11: stopped
% 5.42/1.52 Prover 4: stopped
% 5.42/1.52 Prover 13: stopped
% 5.42/1.52 Prover 16: Preprocessing ...
% 5.42/1.54 Prover 16: Warning: ignoring some quantifiers
% 5.73/1.54 Prover 16: Constructing countermodel ...
% 5.73/1.54 Prover 16: stopped
% 5.73/1.54
% 5.73/1.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.73/1.54
% 5.79/1.55 % SZS output start Proof for theBenchmark
% 5.79/1.56 Assumptions after simplification:
% 5.79/1.56 ---------------------------------
% 5.79/1.56
% 5.79/1.56 (axiom_0)
% 5.79/1.59 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) &
% 5.79/1.59 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 5.79/1.59
% 5.79/1.59 (axiom_1)
% 5.79/1.59 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) |
% 5.79/1.59 xsd_integer(v0) = 0) & ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) |
% 5.79/1.59 ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1))
% 5.79/1.59
% 5.79/1.59 (axiom_2)
% 5.79/1.59 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cCar(v0) = v1) | ~ $i(v0) | ?
% 5.79/1.59 [v2: int] : ( ~ (v2 = 0) & cAutomobile(v0) = v2)) & ! [v0: $i] : ( ~
% 5.79/1.59 (cCar(v0) = 0) | ~ $i(v0) | cAutomobile(v0) = 0)
% 5.79/1.59
% 5.79/1.59 (axiom_3)
% 5.79/1.59 cAutomobile(iauto) = 0 & $i(iauto)
% 5.79/1.59
% 5.79/1.59 (axiom_4)
% 5.79/1.59 cowlThing(iauto) = 0 & $i(iauto)
% 5.79/1.59
% 5.79/1.59 (axiom_5)
% 5.79/1.59 cCar(icar) = 0 & $i(icar)
% 5.79/1.59
% 5.79/1.59 (axiom_6)
% 5.79/1.59 cowlThing(icar) = 0 & $i(icar)
% 5.79/1.59
% 5.79/1.59 (the_axiom)
% 5.79/1.60 $i(icar) & $i(iauto) & ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3:
% 5.79/1.60 any] : (cCar(iauto) = v0 & cAutomobile(icar) = v2 & cowlThing(icar) = v3 &
% 5.79/1.60 cowlThing(iauto) = v1 & ( ~ (v3 = 0) | ~ (v2 = 0) | ~ (v1 = 0) | ~ (v0 =
% 5.79/1.60 0) | ? [v4: $i] : ? [v5: any] : ? [v6: any] : (xsd_string(v4) = v5 &
% 5.79/1.60 xsd_integer(v4) = v6 & $i(v4) & ((v6 = 0 & v5 = 0) | ( ~ (v6 = 0) & ~
% 5.79/1.60 (v5 = 0)))) | ? [v4: $i] : ? [v5: any] : ? [v6: any] :
% 5.79/1.60 (cowlNothing(v4) = v6 & cowlThing(v4) = v5 & $i(v4) & ( ~ (v5 = 0) | v6 =
% 5.79/1.60 0))))
% 5.79/1.60
% 5.79/1.60 (function-axioms)
% 5.79/1.60 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 =
% 5.79/1.60 v0 | ~ (cCar(v2) = v1) | ~ (cCar(v2) = v0)) & ! [v0: MultipleValueBool] :
% 5.79/1.60 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cAutomobile(v2) =
% 5.79/1.60 v1) | ~ (cAutomobile(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.79/1.60 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (xsd_string(v2) = v1) | ~
% 5.79/1.60 (xsd_string(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.79/1.60 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~
% 5.79/1.60 (xsd_integer(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.79/1.60 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~
% 5.79/1.60 (cowlNothing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.79/1.60 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~
% 5.79/1.60 (cowlThing(v2) = v0))
% 5.79/1.61
% 5.79/1.61 Those formulas are unsatisfiable:
% 5.79/1.61 ---------------------------------
% 5.79/1.61
% 5.79/1.61 Begin of proof
% 5.79/1.61 |
% 5.79/1.61 | ALPHA: (axiom_0) implies:
% 5.79/1.61 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 5.79/1.61 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~
% 5.79/1.61 | $i(v0))
% 5.79/1.61 |
% 5.79/1.61 | ALPHA: (axiom_1) implies:
% 5.79/1.61 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~
% 5.79/1.61 | (v1 = 0) & xsd_integer(v0) = v1))
% 5.79/1.61 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~
% 5.79/1.61 | $i(v0) | xsd_integer(v0) = 0)
% 5.79/1.61 |
% 5.79/1.61 | ALPHA: (axiom_2) implies:
% 5.79/1.61 | (5) ! [v0: $i] : ( ~ (cCar(v0) = 0) | ~ $i(v0) | cAutomobile(v0) = 0)
% 5.79/1.61 | (6) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cCar(v0) = v1) | ~ $i(v0) |
% 5.79/1.61 | ? [v2: int] : ( ~ (v2 = 0) & cAutomobile(v0) = v2))
% 5.79/1.61 |
% 5.79/1.61 | ALPHA: (axiom_3) implies:
% 5.79/1.61 | (7) cAutomobile(iauto) = 0
% 5.79/1.61 |
% 5.79/1.61 | ALPHA: (axiom_4) implies:
% 5.79/1.62 | (8) cowlThing(iauto) = 0
% 5.79/1.62 |
% 5.79/1.62 | ALPHA: (axiom_5) implies:
% 5.79/1.62 | (9) cCar(icar) = 0
% 5.79/1.62 |
% 5.79/1.62 | ALPHA: (axiom_6) implies:
% 5.79/1.62 | (10) cowlThing(icar) = 0
% 5.79/1.62 |
% 5.79/1.62 | ALPHA: (the_axiom) implies:
% 5.79/1.62 | (11) $i(iauto)
% 5.79/1.62 | (12) $i(icar)
% 6.14/1.62 | (13) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] :
% 6.14/1.62 | (cCar(iauto) = v0 & cAutomobile(icar) = v2 & cowlThing(icar) = v3 &
% 6.14/1.62 | cowlThing(iauto) = v1 & ( ~ (v3 = 0) | ~ (v2 = 0) | ~ (v1 = 0) |
% 6.14/1.62 | ~ (v0 = 0) | ? [v4: $i] : ? [v5: any] : ? [v6: any] :
% 6.14/1.62 | (xsd_string(v4) = v5 & xsd_integer(v4) = v6 & $i(v4) & ((v6 = 0 &
% 6.14/1.62 | v5 = 0) | ( ~ (v6 = 0) & ~ (v5 = 0)))) | ? [v4: $i] : ?
% 6.14/1.62 | [v5: any] : ? [v6: any] : (cowlNothing(v4) = v6 & cowlThing(v4) =
% 6.14/1.62 | v5 & $i(v4) & ( ~ (v5 = 0) | v6 = 0))))
% 6.14/1.62 |
% 6.14/1.62 | ALPHA: (function-axioms) implies:
% 6.14/1.62 | (14) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 6.14/1.62 | : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0))
% 6.14/1.62 | (15) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 6.14/1.62 | : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0))
% 6.14/1.62 | (16) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 6.14/1.62 | : (v1 = v0 | ~ (cAutomobile(v2) = v1) | ~ (cAutomobile(v2) = v0))
% 6.14/1.62 |
% 6.14/1.62 | DELTA: instantiating (13) with fresh symbols all_7_0, all_7_1, all_7_2,
% 6.14/1.62 | all_7_3 gives:
% 6.14/1.63 | (17) cCar(iauto) = all_7_3 & cAutomobile(icar) = all_7_1 & cowlThing(icar)
% 6.14/1.63 | = all_7_0 & cowlThing(iauto) = all_7_2 & ( ~ (all_7_0 = 0) | ~
% 6.14/1.63 | (all_7_1 = 0) | ~ (all_7_2 = 0) | ~ (all_7_3 = 0) | ? [v0: $i] :
% 6.14/1.63 | ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0)
% 6.14/1.63 | = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0))))
% 6.14/1.63 | | ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlNothing(v0) = v2
% 6.14/1.63 | & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0)))
% 6.14/1.63 |
% 6.14/1.63 | ALPHA: (17) implies:
% 6.14/1.63 | (18) cowlThing(iauto) = all_7_2
% 6.14/1.63 | (19) cowlThing(icar) = all_7_0
% 6.14/1.63 | (20) cAutomobile(icar) = all_7_1
% 6.14/1.63 | (21) cCar(iauto) = all_7_3
% 6.14/1.63 | (22) ~ (all_7_0 = 0) | ~ (all_7_1 = 0) | ~ (all_7_2 = 0) | ~ (all_7_3 =
% 6.14/1.63 | 0) | ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) =
% 6.14/1.63 | v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 =
% 6.14/1.63 | 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1: any] : ? [v2:
% 6.14/1.63 | any] : (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1
% 6.14/1.63 | = 0) | v2 = 0))
% 6.14/1.63 |
% 6.14/1.63 | GROUND_INST: instantiating (14) with 0, all_7_2, iauto, simplifying with (8),
% 6.14/1.63 | (18) gives:
% 6.14/1.63 | (23) all_7_2 = 0
% 6.14/1.63 |
% 6.14/1.63 | GROUND_INST: instantiating (14) with 0, all_7_0, icar, simplifying with (10),
% 6.14/1.63 | (19) gives:
% 6.14/1.63 | (24) all_7_0 = 0
% 6.14/1.63 |
% 6.14/1.63 | GROUND_INST: instantiating (6) with iauto, all_7_3, simplifying with (11),
% 6.14/1.63 | (21) gives:
% 6.14/1.63 | (25) all_7_3 = 0 | ? [v0: int] : ( ~ (v0 = 0) & cAutomobile(iauto) = v0)
% 6.14/1.63 |
% 6.14/1.63 | GROUND_INST: instantiating (5) with icar, simplifying with (9), (12) gives:
% 6.14/1.63 | (26) cAutomobile(icar) = 0
% 6.14/1.63 |
% 6.14/1.63 | BETA: splitting (25) gives:
% 6.14/1.63 |
% 6.14/1.63 | Case 1:
% 6.14/1.63 | |
% 6.14/1.63 | | (27) all_7_3 = 0
% 6.14/1.63 | |
% 6.14/1.63 | | GROUND_INST: instantiating (16) with all_7_1, 0, icar, simplifying with
% 6.14/1.63 | | (20), (26) gives:
% 6.14/1.63 | | (28) all_7_1 = 0
% 6.14/1.63 | |
% 6.14/1.63 | | BETA: splitting (22) gives:
% 6.14/1.63 | |
% 6.14/1.63 | | Case 1:
% 6.14/1.63 | | |
% 6.14/1.63 | | | (29) ~ (all_7_0 = 0)
% 6.14/1.63 | | |
% 6.14/1.63 | | | REDUCE: (24), (29) imply:
% 6.14/1.63 | | | (30) $false
% 6.14/1.64 | | |
% 6.14/1.64 | | | CLOSE: (30) is inconsistent.
% 6.14/1.64 | | |
% 6.14/1.64 | | Case 2:
% 6.14/1.64 | | |
% 6.14/1.64 | | | (31) ~ (all_7_1 = 0) | ~ (all_7_2 = 0) | ~ (all_7_3 = 0) | ? [v0:
% 6.14/1.64 | | | $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1 &
% 6.14/1.64 | | | xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 =
% 6.14/1.64 | | | 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1: any] : ? [v2:
% 6.14/1.64 | | | any] : (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & $i(v0) & ( ~
% 6.14/1.64 | | | (v1 = 0) | v2 = 0))
% 6.14/1.64 | | |
% 6.14/1.64 | | | BETA: splitting (31) gives:
% 6.14/1.64 | | |
% 6.14/1.64 | | | Case 1:
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | (32) ~ (all_7_1 = 0)
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | REDUCE: (28), (32) imply:
% 6.14/1.64 | | | | (33) $false
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | CLOSE: (33) is inconsistent.
% 6.14/1.64 | | | |
% 6.14/1.64 | | | Case 2:
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | (34) ~ (all_7_2 = 0) | ~ (all_7_3 = 0) | ? [v0: $i] : ? [v1: any]
% 6.14/1.64 | | | | : ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 &
% 6.14/1.64 | | | | $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) |
% 6.14/1.64 | | | | ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlNothing(v0) = v2
% 6.14/1.64 | | | | & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | BETA: splitting (34) gives:
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | Case 1:
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | | (35) ~ (all_7_2 = 0)
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | | REDUCE: (23), (35) imply:
% 6.14/1.64 | | | | | (36) $false
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | | CLOSE: (36) is inconsistent.
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | Case 2:
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | | (37) ~ (all_7_3 = 0) | ? [v0: $i] : ? [v1: any] : ? [v2: any] :
% 6.14/1.64 | | | | | (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 =
% 6.14/1.64 | | | | | 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0:
% 6.14/1.64 | | | | | $i] : ? [v1: any] : ? [v2: any] : (cowlNothing(v0) = v2 &
% 6.14/1.64 | | | | | cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | | BETA: splitting (37) gives:
% 6.14/1.64 | | | | |
% 6.14/1.64 | | | | | Case 1:
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | | (38) ~ (all_7_3 = 0)
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | | REDUCE: (27), (38) imply:
% 6.14/1.64 | | | | | | (39) $false
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | | CLOSE: (39) is inconsistent.
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | Case 2:
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | | (40) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0)
% 6.14/1.64 | | | | | | = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0)
% 6.14/1.64 | | | | | | | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1:
% 6.14/1.64 | | | | | | any] : ? [v2: any] : (cowlNothing(v0) = v2 &
% 6.14/1.64 | | | | | | cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | | BETA: splitting (40) gives:
% 6.14/1.64 | | | | | |
% 6.14/1.64 | | | | | | Case 1:
% 6.14/1.64 | | | | | | |
% 6.14/1.64 | | | | | | | (41) ? [v0: $i] : ? [v1: any] : ? [v2: any] :
% 6.14/1.64 | | | | | | | (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) &
% 6.14/1.64 | | | | | | | ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0))))
% 6.14/1.64 | | | | | | |
% 6.14/1.64 | | | | | | | DELTA: instantiating (41) with fresh symbols all_61_0, all_61_1,
% 6.14/1.64 | | | | | | | all_61_2 gives:
% 6.14/1.65 | | | | | | | (42) xsd_string(all_61_2) = all_61_1 & xsd_integer(all_61_2) =
% 6.14/1.65 | | | | | | | all_61_0 & $i(all_61_2) & ((all_61_0 = 0 & all_61_1 = 0) |
% 6.14/1.65 | | | | | | | ( ~ (all_61_0 = 0) & ~ (all_61_1 = 0)))
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | ALPHA: (42) implies:
% 6.14/1.65 | | | | | | | (43) $i(all_61_2)
% 6.14/1.65 | | | | | | | (44) xsd_integer(all_61_2) = all_61_0
% 6.14/1.65 | | | | | | | (45) xsd_string(all_61_2) = all_61_1
% 6.14/1.65 | | | | | | | (46) (all_61_0 = 0 & all_61_1 = 0) | ( ~ (all_61_0 = 0) & ~
% 6.14/1.65 | | | | | | | (all_61_1 = 0))
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | GROUND_INST: instantiating (4) with all_61_2, all_61_1,
% 6.14/1.65 | | | | | | | simplifying with (43), (45) gives:
% 6.14/1.65 | | | | | | | (47) all_61_1 = 0 | xsd_integer(all_61_2) = 0
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | BETA: splitting (46) gives:
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | Case 1:
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | (48) all_61_0 = 0 & all_61_1 = 0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | ALPHA: (48) implies:
% 6.14/1.65 | | | | | | | | (49) all_61_1 = 0
% 6.14/1.65 | | | | | | | | (50) all_61_0 = 0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | REDUCE: (45), (49) imply:
% 6.14/1.65 | | | | | | | | (51) xsd_string(all_61_2) = 0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | REDUCE: (44), (50) imply:
% 6.14/1.65 | | | | | | | | (52) xsd_integer(all_61_2) = 0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | GROUND_INST: instantiating (3) with all_61_2, simplifying with
% 6.14/1.65 | | | | | | | | (43), (51) gives:
% 6.14/1.65 | | | | | | | | (53) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_61_2) =
% 6.14/1.65 | | | | | | | | v0)
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | DELTA: instantiating (53) with fresh symbol all_75_0 gives:
% 6.14/1.65 | | | | | | | | (54) ~ (all_75_0 = 0) & xsd_integer(all_61_2) = all_75_0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | ALPHA: (54) implies:
% 6.14/1.65 | | | | | | | | (55) ~ (all_75_0 = 0)
% 6.14/1.65 | | | | | | | | (56) xsd_integer(all_61_2) = all_75_0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | GROUND_INST: instantiating (15) with 0, all_75_0, all_61_2,
% 6.14/1.65 | | | | | | | | simplifying with (52), (56) gives:
% 6.14/1.65 | | | | | | | | (57) all_75_0 = 0
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | REDUCE: (55), (57) imply:
% 6.14/1.65 | | | | | | | | (58) $false
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | CLOSE: (58) is inconsistent.
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | Case 2:
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | (59) ~ (all_61_0 = 0) & ~ (all_61_1 = 0)
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | ALPHA: (59) implies:
% 6.14/1.65 | | | | | | | | (60) ~ (all_61_1 = 0)
% 6.14/1.65 | | | | | | | | (61) ~ (all_61_0 = 0)
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | BETA: splitting (47) gives:
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | | Case 1:
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | (62) xsd_integer(all_61_2) = 0
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | GROUND_INST: instantiating (15) with all_61_0, 0, all_61_2,
% 6.14/1.65 | | | | | | | | | simplifying with (44), (62) gives:
% 6.14/1.65 | | | | | | | | | (63) all_61_0 = 0
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | REDUCE: (61), (63) imply:
% 6.14/1.65 | | | | | | | | | (64) $false
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | CLOSE: (64) is inconsistent.
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | Case 2:
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | (65) all_61_1 = 0
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | REDUCE: (60), (65) imply:
% 6.14/1.65 | | | | | | | | | (66) $false
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | | CLOSE: (66) is inconsistent.
% 6.14/1.65 | | | | | | | | |
% 6.14/1.65 | | | | | | | | End of split
% 6.14/1.65 | | | | | | | |
% 6.14/1.65 | | | | | | | End of split
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | Case 2:
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | (67) ? [v0: $i] : ? [v1: any] : ? [v2: any] :
% 6.14/1.65 | | | | | | | (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & $i(v0) & ( ~
% 6.14/1.65 | | | | | | | (v1 = 0) | v2 = 0))
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | DELTA: instantiating (67) with fresh symbols all_61_0, all_61_1,
% 6.14/1.65 | | | | | | | all_61_2 gives:
% 6.14/1.65 | | | | | | | (68) cowlNothing(all_61_2) = all_61_0 & cowlThing(all_61_2) =
% 6.14/1.65 | | | | | | | all_61_1 & $i(all_61_2) & ( ~ (all_61_1 = 0) | all_61_0 =
% 6.14/1.65 | | | | | | | 0)
% 6.14/1.65 | | | | | | |
% 6.14/1.65 | | | | | | | ALPHA: (68) implies:
% 6.14/1.65 | | | | | | | (69) $i(all_61_2)
% 6.14/1.66 | | | | | | | (70) cowlThing(all_61_2) = all_61_1
% 6.14/1.66 | | | | | | | (71) cowlNothing(all_61_2) = all_61_0
% 6.14/1.66 | | | | | | | (72) ~ (all_61_1 = 0) | all_61_0 = 0
% 6.14/1.66 | | | | | | |
% 6.14/1.66 | | | | | | | GROUND_INST: instantiating (2) with all_61_2, all_61_1,
% 6.14/1.66 | | | | | | | simplifying with (69), (70) gives:
% 6.14/1.66 | | | | | | | (73) all_61_1 = 0
% 6.14/1.66 | | | | | | |
% 6.14/1.66 | | | | | | | BETA: splitting (72) gives:
% 6.14/1.66 | | | | | | |
% 6.14/1.66 | | | | | | | Case 1:
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | (74) ~ (all_61_1 = 0)
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | REDUCE: (73), (74) imply:
% 6.14/1.66 | | | | | | | | (75) $false
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | CLOSE: (75) is inconsistent.
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | Case 2:
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | (76) all_61_0 = 0
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | REDUCE: (71), (76) imply:
% 6.14/1.66 | | | | | | | | (77) cowlNothing(all_61_2) = 0
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | GROUND_INST: instantiating (1) with all_61_2, simplifying with
% 6.14/1.66 | | | | | | | | (69), (77) gives:
% 6.14/1.66 | | | | | | | | (78) $false
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | | CLOSE: (78) is inconsistent.
% 6.14/1.66 | | | | | | | |
% 6.14/1.66 | | | | | | | End of split
% 6.14/1.66 | | | | | | |
% 6.14/1.66 | | | | | | End of split
% 6.14/1.66 | | | | | |
% 6.14/1.66 | | | | | End of split
% 6.14/1.66 | | | | |
% 6.14/1.66 | | | | End of split
% 6.14/1.66 | | | |
% 6.14/1.66 | | | End of split
% 6.14/1.66 | | |
% 6.14/1.66 | | End of split
% 6.14/1.66 | |
% 6.14/1.66 | Case 2:
% 6.14/1.66 | |
% 6.14/1.66 | | (79) ? [v0: int] : ( ~ (v0 = 0) & cAutomobile(iauto) = v0)
% 6.14/1.66 | |
% 6.14/1.66 | | DELTA: instantiating (79) with fresh symbol all_23_0 gives:
% 6.14/1.66 | | (80) ~ (all_23_0 = 0) & cAutomobile(iauto) = all_23_0
% 6.14/1.66 | |
% 6.14/1.66 | | ALPHA: (80) implies:
% 6.14/1.66 | | (81) ~ (all_23_0 = 0)
% 6.14/1.66 | | (82) cAutomobile(iauto) = all_23_0
% 6.14/1.66 | |
% 6.14/1.66 | | GROUND_INST: instantiating (16) with 0, all_23_0, iauto, simplifying with
% 6.14/1.66 | | (7), (82) gives:
% 6.14/1.66 | | (83) all_23_0 = 0
% 6.14/1.66 | |
% 6.14/1.66 | | REDUCE: (81), (83) imply:
% 6.14/1.66 | | (84) $false
% 6.14/1.66 | |
% 6.14/1.66 | | CLOSE: (84) is inconsistent.
% 6.14/1.66 | |
% 6.14/1.66 | End of split
% 6.14/1.66 |
% 6.14/1.66 End of proof
% 6.14/1.66 % SZS output end Proof for theBenchmark
% 6.14/1.66
% 6.14/1.66 1039ms
%------------------------------------------------------------------------------