↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KRS163+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 : n009.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.89s 1.33s
% Output   : Proof 6.34s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS163+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33  % Computer : n009.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:01:35 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/sandbox/benchmark/theBenchmark.p ...
% 0.62/0.60  Running up to 7 provers in parallel.
% 0.71/0.61  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.71/0.61  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.71/0.61  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.71/0.61  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.71/0.61  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.71/0.61  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.71/0.61  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.19/0.95  Prover 1: Preprocessing ...
% 2.19/0.95  Prover 4: Preprocessing ...
% 2.19/0.99  Prover 0: Preprocessing ...
% 2.19/0.99  Prover 2: Preprocessing ...
% 2.19/0.99  Prover 6: Preprocessing ...
% 2.19/0.99  Prover 3: Preprocessing ...
% 2.19/0.99  Prover 5: Preprocessing ...
% 3.29/1.15  Prover 2: Proving ...
% 3.29/1.16  Prover 5: Proving ...
% 3.29/1.16  Prover 6: Constructing countermodel ...
% 3.92/1.18  Prover 3: Constructing countermodel ...
% 3.92/1.18  Prover 1: Constructing countermodel ...
% 3.92/1.18  Prover 4: Constructing countermodel ...
% 4.02/1.20  Prover 0: Proving ...
% 4.89/1.33  Prover 3: proved (711ms)
% 4.89/1.33  
% 4.89/1.33  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.89/1.33  
% 4.89/1.33  Prover 6: proved (710ms)
% 4.89/1.33  
% 4.89/1.33  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.89/1.33  
% 4.89/1.33  Prover 2: stopped
% 4.89/1.33  Prover 5: stopped
% 4.89/1.33  Prover 0: stopped
% 4.89/1.34  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.89/1.34  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.89/1.34  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.89/1.34  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.89/1.34  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.89/1.36  Prover 10: Preprocessing ...
% 4.89/1.36  Prover 8: Preprocessing ...
% 4.89/1.38  Prover 13: Preprocessing ...
% 4.89/1.38  Prover 11: Preprocessing ...
% 5.42/1.39  Prover 7: Preprocessing ...
% 5.42/1.41  Prover 7: Warning: ignoring some quantifiers
% 5.42/1.41  Prover 7: Constructing countermodel ...
% 5.42/1.42  Prover 13: Warning: ignoring some quantifiers
% 5.42/1.42  Prover 13: Constructing countermodel ...
% 5.42/1.43  Prover 8: Warning: ignoring some quantifiers
% 5.42/1.43  Prover 10: Warning: ignoring some quantifiers
% 5.42/1.43  Prover 10: Constructing countermodel ...
% 5.42/1.43  Prover 8: Constructing countermodel ...
% 5.42/1.46  Prover 1: Found proof (size 56)
% 5.42/1.46  Prover 4: Found proof (size 63)
% 5.42/1.46  Prover 1: proved (851ms)
% 5.42/1.46  Prover 4: proved (846ms)
% 5.42/1.46  Prover 8: stopped
% 5.42/1.46  Prover 13: stopped
% 5.42/1.46  Prover 10: stopped
% 5.42/1.46  Prover 7: stopped
% 6.10/1.47  Prover 11: Constructing countermodel ...
% 6.10/1.48  Prover 11: stopped
% 6.10/1.48  
% 6.10/1.48  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.10/1.48  
% 6.18/1.49  % SZS output start Proof for theBenchmark
% 6.18/1.49  Assumptions after simplification:
% 6.18/1.49  ---------------------------------
% 6.18/1.49  
% 6.18/1.50    (axiom_0)
% 6.34/1.52     ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (cowlThing(v0) = v1) |  ~ $i(v0)) & 
% 6.34/1.52    ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) |  ~ $i(v0))
% 6.34/1.52  
% 6.34/1.52    (axiom_1)
% 6.34/1.53     ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (xsd_string(v0) = v1) |  ~ $i(v0) |
% 6.34/1.53      xsd_integer(v0) = 0) &  ! [v0: $i] : ( ~ (xsd_string(v0) = 0) |  ~ $i(v0) | 
% 6.34/1.53      ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1))
% 6.34/1.53  
% 6.34/1.53    (axiom_2)
% 6.34/1.53    cA(ia) = 0 & $i(ia)
% 6.34/1.53  
% 6.34/1.53    (axiom_3)
% 6.34/1.53    cowlThing(ia) = 0 & $i(ia)
% 6.34/1.53  
% 6.34/1.53    (axiom_4)
% 6.34/1.53    cB(ib) = 0 & $i(ib)
% 6.34/1.53  
% 6.34/1.53    (axiom_5)
% 6.34/1.53    cowlThing(ib) = 0 & $i(ib)
% 6.34/1.53  
% 6.34/1.53    (axiom_6)
% 6.34/1.53     ! [v0: $i] : ( ~ (cB(v0) = 0) |  ~ $i(v0) |  ? [v1: int] : ( ~ (v1 = 0) &
% 6.34/1.53        cA(v0) = v1))
% 6.34/1.53  
% 6.34/1.53    (the_axiom)
% 6.34/1.54    $i(ib) & $i(ia) &  ? [v0: any] :  ? [v1: any] : (cowlThing(ib) = v1 &
% 6.34/1.54      cowlThing(ia) = v0 & ( ~ (v1 = 0) |  ~ (v0 = 0) | ib = ia |  ? [v2: $i] :  ?
% 6.34/1.54        [v3: any] :  ? [v4: any] : (xsd_string(v2) = v3 & xsd_integer(v2) = v4 &
% 6.34/1.54          $i(v2) & ((v4 = 0 & v3 = 0) | ( ~ (v4 = 0) &  ~ (v3 = 0)))) |  ? [v2:
% 6.34/1.54          $i] :  ? [v3: any] :  ? [v4: any] : (cowlThing(v2) = v3 &
% 6.34/1.54          cowlNothing(v2) = v4 & $i(v2) & ( ~ (v3 = 0) | v4 = 0))))
% 6.34/1.54  
% 6.34/1.54    (function-axioms)
% 6.34/1.54     ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 =
% 6.34/1.54      v0 |  ~ (xsd_string(v2) = v1) |  ~ (xsd_string(v2) = v0)) &  ! [v0:
% 6.34/1.54      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 6.34/1.54      ~ (xsd_integer(v2) = v1) |  ~ (xsd_integer(v2) = v0)) &  ! [v0:
% 6.34/1.54      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 6.34/1.54      ~ (cowlThing(v2) = v1) |  ~ (cowlThing(v2) = v0)) &  ! [v0:
% 6.34/1.54      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 6.34/1.54      ~ (cowlNothing(v2) = v1) |  ~ (cowlNothing(v2) = v0)) &  ! [v0:
% 6.34/1.54      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 6.34/1.54      ~ (cB(v2) = v1) |  ~ (cB(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 6.34/1.54      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (cA(v2) = v1) |  ~ (cA(v2)
% 6.34/1.54        = v0))
% 6.34/1.54  
% 6.34/1.54  Further assumptions not needed in the proof:
% 6.34/1.54  --------------------------------------------
% 6.34/1.54  cA_substitution_1, cB_substitution_1, cowlNothing_substitution_1,
% 6.34/1.54  cowlThing_substitution_1, xsd_integer_substitution_1, xsd_string_substitution_1
% 6.34/1.54  
% 6.34/1.54  Those formulas are unsatisfiable:
% 6.34/1.54  ---------------------------------
% 6.34/1.54  
% 6.34/1.54  Begin of proof
% 6.34/1.54  | 
% 6.34/1.55  | ALPHA: (axiom_0) implies:
% 6.34/1.55  |   (1)   ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) |  ~ $i(v0))
% 6.34/1.55  |   (2)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (cowlThing(v0) = v1) |  ~
% 6.34/1.55  |          $i(v0))
% 6.34/1.55  | 
% 6.34/1.55  | ALPHA: (axiom_1) implies:
% 6.34/1.55  |   (3)   ! [v0: $i] : ( ~ (xsd_string(v0) = 0) |  ~ $i(v0) |  ? [v1: int] : ( ~
% 6.34/1.55  |            (v1 = 0) & xsd_integer(v0) = v1))
% 6.34/1.55  |   (4)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (xsd_string(v0) = v1) |  ~
% 6.34/1.55  |          $i(v0) | xsd_integer(v0) = 0)
% 6.34/1.55  | 
% 6.34/1.55  | ALPHA: (axiom_2) implies:
% 6.34/1.55  |   (5)  cA(ia) = 0
% 6.34/1.55  | 
% 6.34/1.55  | ALPHA: (axiom_3) implies:
% 6.34/1.55  |   (6)  cowlThing(ia) = 0
% 6.34/1.55  | 
% 6.34/1.55  | ALPHA: (axiom_4) implies:
% 6.34/1.55  |   (7)  cB(ib) = 0
% 6.34/1.55  | 
% 6.34/1.55  | ALPHA: (axiom_5) implies:
% 6.34/1.55  |   (8)  cowlThing(ib) = 0
% 6.34/1.55  | 
% 6.34/1.55  | ALPHA: (the_axiom) implies:
% 6.34/1.55  |   (9)  $i(ib)
% 6.34/1.56  |   (10)   ? [v0: any] :  ? [v1: any] : (cowlThing(ib) = v1 & cowlThing(ia) = v0
% 6.34/1.56  |           & ( ~ (v1 = 0) |  ~ (v0 = 0) | ib = ia |  ? [v2: $i] :  ? [v3: any]
% 6.34/1.56  |             :  ? [v4: any] : (xsd_string(v2) = v3 & xsd_integer(v2) = v4 &
% 6.34/1.56  |               $i(v2) & ((v4 = 0 & v3 = 0) | ( ~ (v4 = 0) &  ~ (v3 = 0)))) |  ?
% 6.34/1.56  |             [v2: $i] :  ? [v3: any] :  ? [v4: any] : (cowlThing(v2) = v3 &
% 6.34/1.56  |               cowlNothing(v2) = v4 & $i(v2) & ( ~ (v3 = 0) | v4 = 0))))
% 6.34/1.56  | 
% 6.34/1.56  | ALPHA: (function-axioms) implies:
% 6.34/1.56  |   (11)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i]
% 6.34/1.56  |         : (v1 = v0 |  ~ (cA(v2) = v1) |  ~ (cA(v2) = v0))
% 6.34/1.56  |   (12)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i]
% 6.34/1.56  |         : (v1 = v0 |  ~ (cowlThing(v2) = v1) |  ~ (cowlThing(v2) = v0))
% 6.34/1.56  |   (13)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i]
% 6.34/1.56  |         : (v1 = v0 |  ~ (xsd_integer(v2) = v1) |  ~ (xsd_integer(v2) = v0))
% 6.34/1.56  | 
% 6.34/1.56  | DELTA: instantiating (10) with fresh symbols all_7_0, all_7_1 gives:
% 6.34/1.56  |   (14)  cowlThing(ib) = all_7_0 & cowlThing(ia) = all_7_1 & ( ~ (all_7_0 = 0)
% 6.34/1.56  |           |  ~ (all_7_1 = 0) | ib = ia |  ? [v0: $i] :  ? [v1: any] :  ? [v2:
% 6.34/1.56  |             any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2
% 6.34/1.56  |                 = 0 & v1 = 0) | ( ~ (v2 = 0) &  ~ (v1 = 0)))) |  ? [v0: $i] : 
% 6.34/1.56  |           ? [v1: any] :  ? [v2: any] : (cowlThing(v0) = v1 & cowlNothing(v0) =
% 6.34/1.56  |             v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0)))
% 6.34/1.56  | 
% 6.34/1.56  | ALPHA: (14) implies:
% 6.34/1.56  |   (15)  cowlThing(ia) = all_7_1
% 6.34/1.56  |   (16)  cowlThing(ib) = all_7_0
% 6.34/1.56  |   (17)   ~ (all_7_0 = 0) |  ~ (all_7_1 = 0) | ib = ia |  ? [v0: $i] :  ? [v1:
% 6.34/1.56  |           any] :  ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 &
% 6.34/1.56  |           $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) &  ~ (v1 = 0)))) |  ?
% 6.34/1.56  |         [v0: $i] :  ? [v1: any] :  ? [v2: any] : (cowlThing(v0) = v1 &
% 6.34/1.56  |           cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.34/1.56  | 
% 6.34/1.57  | GROUND_INST: instantiating (12) with 0, all_7_1, ia, simplifying with (6),
% 6.34/1.57  |              (15) gives:
% 6.34/1.57  |   (18)  all_7_1 = 0
% 6.34/1.57  | 
% 6.34/1.57  | GROUND_INST: instantiating (12) with 0, all_7_0, ib, simplifying with (8),
% 6.34/1.57  |              (16) gives:
% 6.34/1.57  |   (19)  all_7_0 = 0
% 6.34/1.57  | 
% 6.34/1.57  | GROUND_INST: instantiating (axiom_6) with ib, simplifying with (7), (9) gives:
% 6.34/1.57  |   (20)   ? [v0: int] : ( ~ (v0 = 0) & cA(ib) = v0)
% 6.34/1.57  | 
% 6.34/1.57  | DELTA: instantiating (20) with fresh symbol all_18_0 gives:
% 6.34/1.57  |   (21)   ~ (all_18_0 = 0) & cA(ib) = all_18_0
% 6.34/1.57  | 
% 6.34/1.57  | ALPHA: (21) implies:
% 6.34/1.57  |   (22)   ~ (all_18_0 = 0)
% 6.34/1.57  |   (23)  cA(ib) = all_18_0
% 6.34/1.57  | 
% 6.34/1.57  | BETA: splitting (17) gives:
% 6.34/1.57  | 
% 6.34/1.57  | Case 1:
% 6.34/1.57  | | 
% 6.34/1.57  | |   (24)   ~ (all_7_0 = 0)
% 6.34/1.57  | | 
% 6.34/1.57  | | REDUCE: (19), (24) imply:
% 6.34/1.57  | |   (25)  $false
% 6.34/1.57  | | 
% 6.34/1.57  | | CLOSE: (25) is inconsistent.
% 6.34/1.57  | | 
% 6.34/1.57  | Case 2:
% 6.34/1.57  | | 
% 6.34/1.57  | |   (26)   ~ (all_7_1 = 0) | ib = ia |  ? [v0: $i] :  ? [v1: any] :  ? [v2:
% 6.34/1.57  | |           any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2
% 6.34/1.57  | |               = 0 & v1 = 0) | ( ~ (v2 = 0) &  ~ (v1 = 0)))) |  ? [v0: $i] : 
% 6.34/1.57  | |         ? [v1: any] :  ? [v2: any] : (cowlThing(v0) = v1 & cowlNothing(v0) =
% 6.34/1.57  | |           v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.34/1.57  | | 
% 6.34/1.57  | | BETA: splitting (26) gives:
% 6.34/1.57  | | 
% 6.34/1.57  | | Case 1:
% 6.34/1.57  | | | 
% 6.34/1.57  | | |   (27)   ~ (all_7_1 = 0)
% 6.34/1.57  | | | 
% 6.34/1.57  | | | REDUCE: (18), (27) imply:
% 6.34/1.57  | | |   (28)  $false
% 6.34/1.57  | | | 
% 6.34/1.57  | | | CLOSE: (28) is inconsistent.
% 6.34/1.57  | | | 
% 6.34/1.57  | | Case 2:
% 6.34/1.57  | | | 
% 6.34/1.58  | | |   (29)  ib = ia |  ? [v0: $i] :  ? [v1: any] :  ? [v2: any] :
% 6.34/1.58  | | |         (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 &
% 6.34/1.58  | | |               v1 = 0) | ( ~ (v2 = 0) &  ~ (v1 = 0)))) |  ? [v0: $i] :  ?
% 6.34/1.58  | | |         [v1: any] :  ? [v2: any] : (cowlThing(v0) = v1 & cowlNothing(v0) =
% 6.34/1.58  | | |           v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.34/1.58  | | | 
% 6.34/1.58  | | | BETA: splitting (29) gives:
% 6.34/1.58  | | | 
% 6.34/1.58  | | | Case 1:
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | |   (30)  ib = ia
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | | REDUCE: (23), (30) imply:
% 6.34/1.58  | | | |   (31)  cA(ia) = all_18_0
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | | GROUND_INST: instantiating (11) with 0, all_18_0, ia, simplifying with
% 6.34/1.58  | | | |              (5), (31) gives:
% 6.34/1.58  | | | |   (32)  all_18_0 = 0
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | | REDUCE: (22), (32) imply:
% 6.34/1.58  | | | |   (33)  $false
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | | CLOSE: (33) is inconsistent.
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | Case 2:
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | |   (34)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (xsd_string(v0) = v1
% 6.34/1.58  | | | |           & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2
% 6.34/1.58  | | | |                 = 0) &  ~ (v1 = 0)))) |  ? [v0: $i] :  ? [v1: any] :  ?
% 6.34/1.58  | | | |         [v2: any] : (cowlThing(v0) = v1 & cowlNothing(v0) = v2 & $i(v0)
% 6.34/1.58  | | | |           & ( ~ (v1 = 0) | v2 = 0))
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | | BETA: splitting (34) gives:
% 6.34/1.58  | | | | 
% 6.34/1.58  | | | | Case 1:
% 6.34/1.58  | | | | | 
% 6.34/1.58  | | | | |   (35)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (xsd_string(v0) =
% 6.34/1.58  | | | | |           v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | (
% 6.34/1.58  | | | | |               ~ (v2 = 0) &  ~ (v1 = 0))))
% 6.34/1.58  | | | | | 
% 6.34/1.58  | | | | | DELTA: instantiating (35) with fresh symbols all_47_0, all_47_1,
% 6.34/1.58  | | | | |        all_47_2 gives:
% 6.34/1.58  | | | | |   (36)  xsd_string(all_47_2) = all_47_1 & xsd_integer(all_47_2) =
% 6.34/1.58  | | | | |         all_47_0 & $i(all_47_2) & ((all_47_0 = 0 & all_47_1 = 0) | ( ~
% 6.34/1.58  | | | | |             (all_47_0 = 0) &  ~ (all_47_1 = 0)))
% 6.34/1.58  | | | | | 
% 6.34/1.58  | | | | | ALPHA: (36) implies:
% 6.34/1.58  | | | | |   (37)  $i(all_47_2)
% 6.34/1.58  | | | | |   (38)  xsd_integer(all_47_2) = all_47_0
% 6.34/1.58  | | | | |   (39)  xsd_string(all_47_2) = all_47_1
% 6.34/1.58  | | | | |   (40)  (all_47_0 = 0 & all_47_1 = 0) | ( ~ (all_47_0 = 0) &  ~
% 6.34/1.58  | | | | |           (all_47_1 = 0))
% 6.34/1.58  | | | | | 
% 6.34/1.58  | | | | | GROUND_INST: instantiating (4) with all_47_2, all_47_1, simplifying
% 6.34/1.58  | | | | |              with (37), (39) gives:
% 6.34/1.58  | | | | |   (41)  all_47_1 = 0 | xsd_integer(all_47_2) = 0
% 6.34/1.58  | | | | | 
% 6.34/1.58  | | | | | BETA: splitting (40) gives:
% 6.34/1.58  | | | | | 
% 6.34/1.58  | | | | | Case 1:
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | |   (42)  all_47_0 = 0 & all_47_1 = 0
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | | ALPHA: (42) implies:
% 6.34/1.58  | | | | | |   (43)  all_47_1 = 0
% 6.34/1.58  | | | | | |   (44)  all_47_0 = 0
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | | REDUCE: (39), (43) imply:
% 6.34/1.58  | | | | | |   (45)  xsd_string(all_47_2) = 0
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | | REDUCE: (38), (44) imply:
% 6.34/1.58  | | | | | |   (46)  xsd_integer(all_47_2) = 0
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | | GROUND_INST: instantiating (3) with all_47_2, simplifying with (37),
% 6.34/1.58  | | | | | |              (45) gives:
% 6.34/1.58  | | | | | |   (47)   ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_47_2) = v0)
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | | DELTA: instantiating (47) with fresh symbol all_61_0 gives:
% 6.34/1.58  | | | | | |   (48)   ~ (all_61_0 = 0) & xsd_integer(all_47_2) = all_61_0
% 6.34/1.58  | | | | | | 
% 6.34/1.58  | | | | | | ALPHA: (48) implies:
% 6.34/1.58  | | | | | |   (49)   ~ (all_61_0 = 0)
% 6.34/1.58  | | | | | |   (50)  xsd_integer(all_47_2) = all_61_0
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | GROUND_INST: instantiating (13) with 0, all_61_0, all_47_2,
% 6.34/1.59  | | | | | |              simplifying with (46), (50) gives:
% 6.34/1.59  | | | | | |   (51)  all_61_0 = 0
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | REDUCE: (49), (51) imply:
% 6.34/1.59  | | | | | |   (52)  $false
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | CLOSE: (52) is inconsistent.
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | Case 2:
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | |   (53)   ~ (all_47_0 = 0) &  ~ (all_47_1 = 0)
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | ALPHA: (53) implies:
% 6.34/1.59  | | | | | |   (54)   ~ (all_47_1 = 0)
% 6.34/1.59  | | | | | |   (55)   ~ (all_47_0 = 0)
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | BETA: splitting (41) gives:
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | Case 1:
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | |   (56)  xsd_integer(all_47_2) = 0
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | | GROUND_INST: instantiating (13) with all_47_0, 0, all_47_2,
% 6.34/1.59  | | | | | | |              simplifying with (38), (56) gives:
% 6.34/1.59  | | | | | | |   (57)  all_47_0 = 0
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | | REDUCE: (55), (57) imply:
% 6.34/1.59  | | | | | | |   (58)  $false
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | | CLOSE: (58) is inconsistent.
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | Case 2:
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | |   (59)  all_47_1 = 0
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | | REDUCE: (54), (59) imply:
% 6.34/1.59  | | | | | | |   (60)  $false
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | | CLOSE: (60) is inconsistent.
% 6.34/1.59  | | | | | | | 
% 6.34/1.59  | | | | | | End of split
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | End of split
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | Case 2:
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | |   (61)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (cowlThing(v0) =
% 6.34/1.59  | | | | |           v1 & cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | | DELTA: instantiating (61) with fresh symbols all_47_0, all_47_1,
% 6.34/1.59  | | | | |        all_47_2 gives:
% 6.34/1.59  | | | | |   (62)  cowlThing(all_47_2) = all_47_1 & cowlNothing(all_47_2) =
% 6.34/1.59  | | | | |         all_47_0 & $i(all_47_2) & ( ~ (all_47_1 = 0) | all_47_0 = 0)
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | | ALPHA: (62) implies:
% 6.34/1.59  | | | | |   (63)  $i(all_47_2)
% 6.34/1.59  | | | | |   (64)  cowlNothing(all_47_2) = all_47_0
% 6.34/1.59  | | | | |   (65)  cowlThing(all_47_2) = all_47_1
% 6.34/1.59  | | | | |   (66)   ~ (all_47_1 = 0) | all_47_0 = 0
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | | GROUND_INST: instantiating (2) with all_47_2, all_47_1, simplifying
% 6.34/1.59  | | | | |              with (63), (65) gives:
% 6.34/1.59  | | | | |   (67)  all_47_1 = 0
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | | BETA: splitting (66) gives:
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | | Case 1:
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | |   (68)   ~ (all_47_1 = 0)
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | REDUCE: (67), (68) imply:
% 6.34/1.59  | | | | | |   (69)  $false
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | CLOSE: (69) is inconsistent.
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | Case 2:
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | |   (70)  all_47_0 = 0
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | REDUCE: (64), (70) imply:
% 6.34/1.59  | | | | | |   (71)  cowlNothing(all_47_2) = 0
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | GROUND_INST: instantiating (1) with all_47_2, simplifying with (63),
% 6.34/1.59  | | | | | |              (71) gives:
% 6.34/1.59  | | | | | |   (72)  $false
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | | CLOSE: (72) is inconsistent.
% 6.34/1.59  | | | | | | 
% 6.34/1.59  | | | | | End of split
% 6.34/1.59  | | | | | 
% 6.34/1.59  | | | | End of split
% 6.34/1.59  | | | | 
% 6.34/1.59  | | | End of split
% 6.34/1.59  | | | 
% 6.34/1.59  | | End of split
% 6.34/1.59  | | 
% 6.34/1.59  | End of split
% 6.34/1.59  | 
% 6.34/1.59  End of proof
% 6.34/1.59  % SZS output end Proof for theBenchmark
% 6.34/1.59  
% 6.34/1.59  1005ms
%------------------------------------------------------------------------------