TSTP Solution File: KRS139+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS139+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 : n019.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:24 EDT 2023
% Result : Theorem 4.20s 1.29s
% Output : Proof 5.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS139+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 01:51:43 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.10/0.98 Prover 4: Preprocessing ...
% 2.10/0.98 Prover 1: Preprocessing ...
% 2.49/1.02 Prover 0: Preprocessing ...
% 2.49/1.02 Prover 5: Preprocessing ...
% 2.49/1.02 Prover 6: Preprocessing ...
% 2.49/1.02 Prover 2: Preprocessing ...
% 2.49/1.02 Prover 3: Preprocessing ...
% 2.79/1.12 Prover 5: Proving ...
% 2.79/1.13 Prover 2: Proving ...
% 3.34/1.14 Prover 6: Constructing countermodel ...
% 3.34/1.15 Prover 3: Constructing countermodel ...
% 3.34/1.15 Prover 1: Constructing countermodel ...
% 3.34/1.16 Prover 4: Constructing countermodel ...
% 3.34/1.17 Prover 0: Proving ...
% 4.20/1.28 Prover 3: proved (645ms)
% 4.20/1.28
% 4.20/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.29
% 4.20/1.29 Prover 5: stopped
% 4.20/1.29 Prover 2: stopped
% 4.20/1.29 Prover 6: stopped
% 4.20/1.29 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.20/1.29 Prover 0: proved (654ms)
% 4.20/1.29
% 4.20/1.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.29
% 4.20/1.29 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.20/1.29 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.20/1.29 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.20/1.31 Prover 7: Preprocessing ...
% 4.20/1.31 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.20/1.31 Prover 11: Preprocessing ...
% 4.20/1.32 Prover 10: Preprocessing ...
% 4.20/1.32 Prover 8: Preprocessing ...
% 4.20/1.32 Prover 13: Preprocessing ...
% 4.20/1.34 Prover 7: Warning: ignoring some quantifiers
% 4.20/1.34 Prover 7: Constructing countermodel ...
% 4.20/1.35 Prover 10: Warning: ignoring some quantifiers
% 4.20/1.35 Prover 10: Constructing countermodel ...
% 4.20/1.39 Prover 13: Warning: ignoring some quantifiers
% 4.20/1.39 Prover 8: Warning: ignoring some quantifiers
% 4.20/1.39 Prover 11: Constructing countermodel ...
% 4.20/1.39 Prover 13: Constructing countermodel ...
% 4.20/1.41 Prover 8: Constructing countermodel ...
% 4.20/1.41 Prover 1: Found proof (size 52)
% 4.20/1.41 Prover 1: proved (768ms)
% 4.20/1.41 Prover 10: gave up
% 4.20/1.41 Prover 7: stopped
% 4.20/1.41 Prover 4: stopped
% 4.20/1.41 Prover 8: stopped
% 4.20/1.41 Prover 11: stopped
% 4.20/1.41 Prover 13: stopped
% 4.20/1.41
% 4.20/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/1.41
% 4.20/1.43 % SZS output start Proof for theBenchmark
% 4.20/1.43 Assumptions after simplification:
% 4.20/1.43 ---------------------------------
% 4.20/1.43
% 4.20/1.43 (axiom_0)
% 4.83/1.46 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) &
% 4.83/1.46 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 4.83/1.46
% 4.83/1.46 (axiom_1)
% 4.83/1.46 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) |
% 4.83/1.46 xsd_integer(v0) = 0) & ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) |
% 4.83/1.46 ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1))
% 4.83/1.46
% 4.83/1.46 (axiom_2)
% 4.83/1.46 ! [v0: $i] : ! [v1: $i] : ( ~ (rpath(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) |
% 4.83/1.46 rpath(v1, v0) = 0)
% 4.83/1.46
% 4.83/1.46 (axiom_3)
% 4.83/1.46 cowlThing(iAntwerp) = 0 & $i(iAntwerp)
% 4.83/1.46
% 4.83/1.46 (axiom_4)
% 4.83/1.46 cowlThing(iGhent) = 0 & $i(iGhent)
% 4.83/1.46
% 4.83/1.46 (axiom_5)
% 4.83/1.46 rpath(iGhent, iAntwerp) = 0 & $i(iGhent) & $i(iAntwerp)
% 4.83/1.46
% 4.83/1.46 (the_axiom)
% 4.83/1.47 $i(iGhent) & $i(iAntwerp) & ? [v0: any] : ? [v1: any] : ? [v2: any] :
% 4.83/1.47 (rpath(iAntwerp, iGhent) = v1 & cowlThing(iGhent) = v2 & cowlThing(iAntwerp) =
% 4.83/1.47 v0 & ( ~ (v2 = 0) | ~ (v1 = 0) | ~ (v0 = 0) | ? [v3: $i] : ? [v4: any] :
% 4.83/1.47 ? [v5: any] : (xsd_string(v3) = v4 & xsd_integer(v3) = v5 & $i(v3) & ((v5
% 4.83/1.47 = 0 & v4 = 0) | ( ~ (v5 = 0) & ~ (v4 = 0)))) | ? [v3: $i] : ?
% 4.83/1.47 [v4: any] : ? [v5: any] : (cowlNothing(v3) = v5 & cowlThing(v3) = v4 &
% 4.83/1.47 $i(v3) & ( ~ (v4 = 0) | v5 = 0))))
% 4.83/1.47
% 4.83/1.47 (function-axioms)
% 4.83/1.47 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 4.83/1.47 [v3: $i] : (v1 = v0 | ~ (rpath(v3, v2) = v1) | ~ (rpath(v3, v2) = v0)) & !
% 4.83/1.47 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0
% 4.83/1.47 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0:
% 4.83/1.47 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 4.83/1.47 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0:
% 4.83/1.47 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 4.83/1.47 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0:
% 4.83/1.47 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 4.83/1.47 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0))
% 4.83/1.47
% 4.83/1.47 Those formulas are unsatisfiable:
% 4.83/1.47 ---------------------------------
% 4.83/1.47
% 4.83/1.47 Begin of proof
% 4.83/1.47 |
% 4.83/1.47 | ALPHA: (axiom_0) implies:
% 5.53/1.47 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 5.53/1.48 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~
% 5.53/1.48 | $i(v0))
% 5.53/1.48 |
% 5.53/1.48 | ALPHA: (axiom_1) implies:
% 5.53/1.48 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~
% 5.53/1.48 | (v1 = 0) & xsd_integer(v0) = v1))
% 5.53/1.48 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~
% 5.53/1.48 | $i(v0) | xsd_integer(v0) = 0)
% 5.53/1.48 |
% 5.53/1.48 | ALPHA: (axiom_3) implies:
% 5.53/1.48 | (5) cowlThing(iAntwerp) = 0
% 5.53/1.48 |
% 5.53/1.48 | ALPHA: (axiom_4) implies:
% 5.53/1.48 | (6) cowlThing(iGhent) = 0
% 5.53/1.48 |
% 5.53/1.48 | ALPHA: (axiom_5) implies:
% 5.53/1.48 | (7) rpath(iGhent, iAntwerp) = 0
% 5.53/1.48 |
% 5.53/1.48 | ALPHA: (the_axiom) implies:
% 5.53/1.48 | (8) $i(iAntwerp)
% 5.53/1.48 | (9) $i(iGhent)
% 5.53/1.48 | (10) ? [v0: any] : ? [v1: any] : ? [v2: any] : (rpath(iAntwerp, iGhent)
% 5.53/1.48 | = v1 & cowlThing(iGhent) = v2 & cowlThing(iAntwerp) = v0 & ( ~ (v2 =
% 5.53/1.48 | 0) | ~ (v1 = 0) | ~ (v0 = 0) | ? [v3: $i] : ? [v4: any] : ?
% 5.53/1.48 | [v5: any] : (xsd_string(v3) = v4 & xsd_integer(v3) = v5 & $i(v3) &
% 5.53/1.48 | ((v5 = 0 & v4 = 0) | ( ~ (v5 = 0) & ~ (v4 = 0)))) | ? [v3: $i]
% 5.53/1.48 | : ? [v4: any] : ? [v5: any] : (cowlNothing(v3) = v5 &
% 5.53/1.48 | cowlThing(v3) = v4 & $i(v3) & ( ~ (v4 = 0) | v5 = 0))))
% 5.53/1.48 |
% 5.53/1.48 | ALPHA: (function-axioms) implies:
% 5.53/1.49 | (11) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 5.53/1.49 | : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0))
% 5.53/1.49 | (12) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 5.53/1.49 | : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0))
% 5.53/1.49 | (13) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 5.53/1.49 | : ! [v3: $i] : (v1 = v0 | ~ (rpath(v3, v2) = v1) | ~ (rpath(v3, v2)
% 5.53/1.49 | = v0))
% 5.53/1.49 |
% 5.53/1.49 | DELTA: instantiating (10) with fresh symbols all_7_0, all_7_1, all_7_2 gives:
% 5.53/1.49 | (14) rpath(iAntwerp, iGhent) = all_7_1 & cowlThing(iGhent) = all_7_0 &
% 5.53/1.49 | cowlThing(iAntwerp) = all_7_2 & ( ~ (all_7_0 = 0) | ~ (all_7_1 = 0) |
% 5.53/1.49 | ~ (all_7_2 = 0) | ? [v0: $i] : ? [v1: any] : ? [v2: any] :
% 5.53/1.49 | (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1
% 5.53/1.49 | = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1:
% 5.53/1.49 | any] : ? [v2: any] : (cowlNothing(v0) = v2 & cowlThing(v0) = v1 &
% 5.53/1.49 | $i(v0) & ( ~ (v1 = 0) | v2 = 0)))
% 5.53/1.49 |
% 5.53/1.49 | ALPHA: (14) implies:
% 5.53/1.49 | (15) cowlThing(iAntwerp) = all_7_2
% 5.53/1.49 | (16) cowlThing(iGhent) = all_7_0
% 5.53/1.49 | (17) rpath(iAntwerp, iGhent) = all_7_1
% 5.53/1.49 | (18) ~ (all_7_0 = 0) | ~ (all_7_1 = 0) | ~ (all_7_2 = 0) | ? [v0: $i] :
% 5.53/1.49 | ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0) =
% 5.53/1.49 | v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) |
% 5.53/1.49 | ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlNothing(v0) = v2 &
% 5.53/1.49 | cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 5.53/1.49 |
% 5.53/1.49 | GROUND_INST: instantiating (11) with 0, all_7_2, iAntwerp, simplifying with
% 5.53/1.49 | (5), (15) gives:
% 5.53/1.49 | (19) all_7_2 = 0
% 5.53/1.49 |
% 5.53/1.49 | GROUND_INST: instantiating (11) with 0, all_7_0, iGhent, simplifying with (6),
% 5.53/1.49 | (16) gives:
% 5.53/1.50 | (20) all_7_0 = 0
% 5.53/1.50 |
% 5.53/1.50 | GROUND_INST: instantiating (axiom_2) with iGhent, iAntwerp, simplifying with
% 5.53/1.50 | (7), (8), (9) gives:
% 5.53/1.50 | (21) rpath(iAntwerp, iGhent) = 0
% 5.53/1.50 |
% 5.53/1.50 | GROUND_INST: instantiating (13) with all_7_1, 0, iGhent, iAntwerp, simplifying
% 5.53/1.50 | with (17), (21) gives:
% 5.53/1.50 | (22) all_7_1 = 0
% 5.53/1.50 |
% 5.53/1.50 | BETA: splitting (18) gives:
% 5.53/1.50 |
% 5.53/1.50 | Case 1:
% 5.53/1.50 | |
% 5.53/1.50 | | (23) ~ (all_7_0 = 0)
% 5.53/1.50 | |
% 5.53/1.50 | | REDUCE: (20), (23) imply:
% 5.53/1.50 | | (24) $false
% 5.53/1.50 | |
% 5.53/1.50 | | CLOSE: (24) is inconsistent.
% 5.53/1.50 | |
% 5.53/1.50 | Case 2:
% 5.53/1.50 | |
% 5.53/1.50 | | (25) ~ (all_7_1 = 0) | ~ (all_7_2 = 0) | ? [v0: $i] : ? [v1: any] :
% 5.53/1.50 | | ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) &
% 5.53/1.50 | | ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] :
% 5.53/1.50 | | ? [v1: any] : ? [v2: any] : (cowlNothing(v0) = v2 & cowlThing(v0)
% 5.53/1.50 | | = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 5.53/1.50 | |
% 5.53/1.50 | | BETA: splitting (25) gives:
% 5.53/1.50 | |
% 5.53/1.50 | | Case 1:
% 5.53/1.50 | | |
% 5.53/1.50 | | | (26) ~ (all_7_1 = 0)
% 5.53/1.50 | | |
% 5.53/1.50 | | | REDUCE: (22), (26) imply:
% 5.53/1.50 | | | (27) $false
% 5.53/1.50 | | |
% 5.53/1.50 | | | CLOSE: (27) is inconsistent.
% 5.53/1.50 | | |
% 5.53/1.50 | | Case 2:
% 5.53/1.50 | | |
% 5.53/1.50 | | | (28) ~ (all_7_2 = 0) | ? [v0: $i] : ? [v1: any] : ? [v2: any] :
% 5.53/1.50 | | | (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 &
% 5.53/1.50 | | | v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ?
% 5.53/1.50 | | | [v1: any] : ? [v2: any] : (cowlNothing(v0) = v2 & cowlThing(v0) =
% 5.53/1.50 | | | v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 5.53/1.50 | | |
% 5.53/1.50 | | | BETA: splitting (28) gives:
% 5.53/1.50 | | |
% 5.53/1.50 | | | Case 1:
% 5.53/1.50 | | | |
% 5.53/1.50 | | | | (29) ~ (all_7_2 = 0)
% 5.53/1.50 | | | |
% 5.53/1.50 | | | | REDUCE: (19), (29) imply:
% 5.53/1.50 | | | | (30) $false
% 5.53/1.50 | | | |
% 5.53/1.50 | | | | CLOSE: (30) is inconsistent.
% 5.53/1.50 | | | |
% 5.53/1.50 | | | Case 2:
% 5.53/1.50 | | | |
% 5.53/1.50 | | | | (31) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1
% 5.53/1.50 | | | | & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2
% 5.53/1.50 | | | | = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1: any] : ?
% 5.53/1.50 | | | | [v2: any] : (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & $i(v0)
% 5.53/1.50 | | | | & ( ~ (v1 = 0) | v2 = 0))
% 5.53/1.50 | | | |
% 5.53/1.51 | | | | BETA: splitting (31) gives:
% 5.53/1.51 | | | |
% 5.53/1.51 | | | | Case 1:
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | | (32) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) =
% 5.53/1.51 | | | | | v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | (
% 5.53/1.51 | | | | | ~ (v2 = 0) & ~ (v1 = 0))))
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | | DELTA: instantiating (32) with fresh symbols all_50_0, all_50_1,
% 5.53/1.51 | | | | | all_50_2 gives:
% 5.53/1.51 | | | | | (33) xsd_string(all_50_2) = all_50_1 & xsd_integer(all_50_2) =
% 5.53/1.51 | | | | | all_50_0 & $i(all_50_2) & ((all_50_0 = 0 & all_50_1 = 0) | ( ~
% 5.53/1.51 | | | | | (all_50_0 = 0) & ~ (all_50_1 = 0)))
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | | ALPHA: (33) implies:
% 5.53/1.51 | | | | | (34) $i(all_50_2)
% 5.53/1.51 | | | | | (35) xsd_integer(all_50_2) = all_50_0
% 5.53/1.51 | | | | | (36) xsd_string(all_50_2) = all_50_1
% 5.53/1.51 | | | | | (37) (all_50_0 = 0 & all_50_1 = 0) | ( ~ (all_50_0 = 0) & ~
% 5.53/1.51 | | | | | (all_50_1 = 0))
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | | GROUND_INST: instantiating (4) with all_50_2, all_50_1, simplifying
% 5.53/1.51 | | | | | with (34), (36) gives:
% 5.53/1.51 | | | | | (38) all_50_1 = 0 | xsd_integer(all_50_2) = 0
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | | BETA: splitting (37) gives:
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | | Case 1:
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | (39) all_50_0 = 0 & all_50_1 = 0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | ALPHA: (39) implies:
% 5.53/1.51 | | | | | | (40) all_50_1 = 0
% 5.53/1.51 | | | | | | (41) all_50_0 = 0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | REDUCE: (36), (40) imply:
% 5.53/1.51 | | | | | | (42) xsd_string(all_50_2) = 0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | REDUCE: (35), (41) imply:
% 5.53/1.51 | | | | | | (43) xsd_integer(all_50_2) = 0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | GROUND_INST: instantiating (3) with all_50_2, simplifying with (34),
% 5.53/1.51 | | | | | | (42) gives:
% 5.53/1.51 | | | | | | (44) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_50_2) = v0)
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | DELTA: instantiating (44) with fresh symbol all_64_0 gives:
% 5.53/1.51 | | | | | | (45) ~ (all_64_0 = 0) & xsd_integer(all_50_2) = all_64_0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | ALPHA: (45) implies:
% 5.53/1.51 | | | | | | (46) ~ (all_64_0 = 0)
% 5.53/1.51 | | | | | | (47) xsd_integer(all_50_2) = all_64_0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | GROUND_INST: instantiating (12) with 0, all_64_0, all_50_2,
% 5.53/1.51 | | | | | | simplifying with (43), (47) gives:
% 5.53/1.51 | | | | | | (48) all_64_0 = 0
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | REDUCE: (46), (48) imply:
% 5.53/1.51 | | | | | | (49) $false
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | CLOSE: (49) is inconsistent.
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | Case 2:
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | (50) ~ (all_50_0 = 0) & ~ (all_50_1 = 0)
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | ALPHA: (50) implies:
% 5.53/1.51 | | | | | | (51) ~ (all_50_1 = 0)
% 5.53/1.51 | | | | | | (52) ~ (all_50_0 = 0)
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | BETA: splitting (38) gives:
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | | Case 1:
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | (53) xsd_integer(all_50_2) = 0
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | GROUND_INST: instantiating (12) with all_50_0, 0, all_50_2,
% 5.53/1.51 | | | | | | | simplifying with (35), (53) gives:
% 5.53/1.51 | | | | | | | (54) all_50_0 = 0
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | REDUCE: (52), (54) imply:
% 5.53/1.51 | | | | | | | (55) $false
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | CLOSE: (55) is inconsistent.
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | Case 2:
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | (56) all_50_1 = 0
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | REDUCE: (51), (56) imply:
% 5.53/1.51 | | | | | | | (57) $false
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | | CLOSE: (57) is inconsistent.
% 5.53/1.51 | | | | | | |
% 5.53/1.51 | | | | | | End of split
% 5.53/1.51 | | | | | |
% 5.53/1.51 | | | | | End of split
% 5.53/1.51 | | | | |
% 5.53/1.51 | | | | Case 2:
% 5.53/1.51 | | | | |
% 5.53/1.52 | | | | | (58) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlNothing(v0) =
% 5.53/1.52 | | | | | v2 & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 5.53/1.52 | | | | |
% 5.53/1.52 | | | | | DELTA: instantiating (58) with fresh symbols all_50_0, all_50_1,
% 5.53/1.52 | | | | | all_50_2 gives:
% 5.53/1.52 | | | | | (59) cowlNothing(all_50_2) = all_50_0 & cowlThing(all_50_2) =
% 5.53/1.52 | | | | | all_50_1 & $i(all_50_2) & ( ~ (all_50_1 = 0) | all_50_0 = 0)
% 5.53/1.52 | | | | |
% 5.53/1.52 | | | | | ALPHA: (59) implies:
% 5.53/1.52 | | | | | (60) $i(all_50_2)
% 5.53/1.52 | | | | | (61) cowlThing(all_50_2) = all_50_1
% 5.53/1.52 | | | | | (62) cowlNothing(all_50_2) = all_50_0
% 5.53/1.52 | | | | | (63) ~ (all_50_1 = 0) | all_50_0 = 0
% 5.53/1.52 | | | | |
% 5.53/1.52 | | | | | GROUND_INST: instantiating (2) with all_50_2, all_50_1, simplifying
% 5.53/1.52 | | | | | with (60), (61) gives:
% 5.53/1.52 | | | | | (64) all_50_1 = 0
% 5.53/1.52 | | | | |
% 5.53/1.52 | | | | | BETA: splitting (63) gives:
% 5.53/1.52 | | | | |
% 5.53/1.52 | | | | | Case 1:
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | (65) ~ (all_50_1 = 0)
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | REDUCE: (64), (65) imply:
% 5.53/1.52 | | | | | | (66) $false
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | CLOSE: (66) is inconsistent.
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | Case 2:
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | (67) all_50_0 = 0
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | REDUCE: (62), (67) imply:
% 5.53/1.52 | | | | | | (68) cowlNothing(all_50_2) = 0
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | GROUND_INST: instantiating (1) with all_50_2, simplifying with (60),
% 5.53/1.52 | | | | | | (68) gives:
% 5.53/1.52 | | | | | | (69) $false
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | | CLOSE: (69) is inconsistent.
% 5.53/1.52 | | | | | |
% 5.53/1.52 | | | | | End of split
% 5.53/1.52 | | | | |
% 5.53/1.52 | | | | End of split
% 5.53/1.52 | | | |
% 5.53/1.52 | | | End of split
% 5.53/1.52 | | |
% 5.53/1.52 | | End of split
% 5.53/1.52 | |
% 5.53/1.52 | End of split
% 5.53/1.52 |
% 5.53/1.52 End of proof
% 5.53/1.52 % SZS output end Proof for theBenchmark
% 5.53/1.52
% 5.53/1.52 901ms
%------------------------------------------------------------------------------