↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KRS130+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:21 EDT 2023

% Result   : Theorem 4.08s 1.29s
% Output   : Proof 5.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : KRS130+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.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Aug 28 01:54:05 EDT 2023
% 0.19/0.34  % CPUTime  : 
% 0.62/0.60  ________       _____
% 0.62/0.60  ___  __ \_________(_)________________________________
% 0.62/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.62/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.62/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.62/0.60  
% 0.62/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.62/0.60  (2023-06-19)
% 0.62/0.60  
% 0.62/0.60  (c) Philipp Rümmer, 2009-2023
% 0.62/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.62/0.60                Amanda Stjerna.
% 0.62/0.60  Free software under BSD-3-Clause.
% 0.62/0.60  
% 0.62/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.62/0.60  
% 0.62/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.62/0.61  Running up to 7 provers in parallel.
% 0.62/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.62/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.62/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.62/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.62/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.62/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.62/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.04/0.95  Prover 4: Preprocessing ...
% 2.04/0.96  Prover 1: Preprocessing ...
% 2.41/1.00  Prover 2: Preprocessing ...
% 2.41/1.00  Prover 5: Preprocessing ...
% 2.41/1.00  Prover 6: Preprocessing ...
% 2.41/1.00  Prover 0: Preprocessing ...
% 2.41/1.00  Prover 3: Preprocessing ...
% 2.89/1.12  Prover 5: Proving ...
% 2.89/1.13  Prover 2: Proving ...
% 2.89/1.13  Prover 3: Constructing countermodel ...
% 2.89/1.13  Prover 6: Proving ...
% 2.89/1.13  Prover 1: Constructing countermodel ...
% 2.89/1.14  Prover 0: Proving ...
% 2.89/1.14  Prover 4: Constructing countermodel ...
% 4.08/1.28  Prover 3: proved (662ms)
% 4.08/1.28  
% 4.08/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.08/1.29  
% 4.08/1.29  Prover 5: stopped
% 4.08/1.29  Prover 0: stopped
% 4.08/1.29  Prover 6: stopped
% 4.08/1.29  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.08/1.29  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.08/1.29  Prover 2: proved (677ms)
% 4.08/1.29  
% 4.08/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.08/1.30  
% 4.08/1.31  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.08/1.31  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.08/1.31  Prover 8: Preprocessing ...
% 4.08/1.31  Prover 7: Preprocessing ...
% 4.08/1.32  Prover 10: Preprocessing ...
% 4.08/1.32  Prover 11: Preprocessing ...
% 4.08/1.32  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.73/1.33  Prover 13: Preprocessing ...
% 4.73/1.35  Prover 10: Warning: ignoring some quantifiers
% 4.73/1.36  Prover 10: Constructing countermodel ...
% 4.73/1.36  Prover 13: Warning: ignoring some quantifiers
% 4.73/1.36  Prover 13: Constructing countermodel ...
% 4.73/1.37  Prover 7: Warning: ignoring some quantifiers
% 4.73/1.37  Prover 7: Constructing countermodel ...
% 4.73/1.37  Prover 8: Warning: ignoring some quantifiers
% 4.73/1.38  Prover 1: Found proof (size 49)
% 4.73/1.38  Prover 1: proved (760ms)
% 4.73/1.38  Prover 10: gave up
% 4.73/1.38  Prover 4: stopped
% 4.73/1.38  Prover 13: stopped
% 4.73/1.38  Prover 7: stopped
% 4.73/1.38  Prover 8: Constructing countermodel ...
% 4.73/1.39  Prover 11: Constructing countermodel ...
% 4.73/1.39  Prover 8: stopped
% 5.11/1.39  Prover 11: stopped
% 5.11/1.39  
% 5.11/1.39  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.11/1.39  
% 5.11/1.40  % SZS output start Proof for theBenchmark
% 5.11/1.40  Assumptions after simplification:
% 5.11/1.40  ---------------------------------
% 5.11/1.40  
% 5.11/1.40    (axiom_0)
% 5.11/1.43     ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (cowlThing(v0) = v1) |  ~ $i(v0)) & 
% 5.11/1.43    ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) |  ~ $i(v0))
% 5.11/1.43  
% 5.11/1.43    (axiom_1)
% 5.11/1.43     ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (xsd_string(v0) = v1) |  ~ $i(v0) |
% 5.11/1.43      xsd_integer(v0) = 0) &  ! [v0: $i] : ( ~ (xsd_string(v0) = 0) |  ~ $i(v0) | 
% 5.11/1.43      ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1))
% 5.11/1.43  
% 5.11/1.43    (axiom_2)
% 5.11/1.43     ! [v0: $i] : ( ~ (cNothing(v0) = 0) |  ~ $i(v0) |  ! [v1: $i] : ( ~ (rp(v0,
% 5.11/1.43            v1) = 0) |  ~ $i(v1)))
% 5.11/1.43  
% 5.11/1.43    (axiom_3)
% 5.11/1.43     ! [v0: $i] : ( ~ (cNothing(v0) = 0) |  ~ $i(v0) |  ? [v1: $i] : (rp(v0, v1) =
% 5.11/1.43        0 & $i(v1)))
% 5.11/1.43  
% 5.11/1.43    (the_axiom)
% 5.11/1.44     ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (cNothing(v0) = v1 &
% 5.11/1.44      cowlNothing(v0) = v2 & $i(v0) & ((v2 = 0 &  ~ (v1 = 0)) | (v1 = 0 &  ~ (v2 =
% 5.11/1.44            0)))) |  ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (xsd_string(v0) =
% 5.11/1.44      v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) &  ~
% 5.11/1.44          (v1 = 0)))) |  ? [v0: $i] :  ? [v1: any] :  ? [v2: any] :
% 5.11/1.44    (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 5.11/1.44  
% 5.11/1.44    (function-axioms)
% 5.11/1.44     ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  !
% 5.11/1.44    [v3: $i] : (v1 = v0 |  ~ (rp(v3, v2) = v1) |  ~ (rp(v3, v2) = v0)) &  ! [v0:
% 5.11/1.44      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 5.11/1.44      ~ (cNothing(v2) = v1) |  ~ (cNothing(v2) = v0)) &  ! [v0: MultipleValueBool]
% 5.11/1.44    :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (xsd_string(v2) =
% 5.11/1.44        v1) |  ~ (xsd_string(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 5.11/1.44      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (xsd_integer(v2) = v1) |  ~
% 5.11/1.44      (xsd_integer(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 5.11/1.44      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (cowlNothing(v2) = v1) |  ~
% 5.11/1.44      (cowlNothing(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 5.11/1.44      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (cowlThing(v2) = v1) |  ~
% 5.11/1.44      (cowlThing(v2) = v0))
% 5.11/1.44  
% 5.11/1.44  Those formulas are unsatisfiable:
% 5.11/1.44  ---------------------------------
% 5.11/1.44  
% 5.11/1.44  Begin of proof
% 5.11/1.44  | 
% 5.11/1.45  | ALPHA: (axiom_0) implies:
% 5.11/1.45  |   (1)   ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) |  ~ $i(v0))
% 5.11/1.45  |   (2)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (cowlThing(v0) = v1) |  ~
% 5.11/1.45  |          $i(v0))
% 5.11/1.45  | 
% 5.11/1.45  | ALPHA: (axiom_1) implies:
% 5.11/1.45  |   (3)   ! [v0: $i] : ( ~ (xsd_string(v0) = 0) |  ~ $i(v0) |  ? [v1: int] : ( ~
% 5.11/1.45  |            (v1 = 0) & xsd_integer(v0) = v1))
% 5.11/1.45  |   (4)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (xsd_string(v0) = v1) |  ~
% 5.11/1.45  |          $i(v0) | xsd_integer(v0) = 0)
% 5.11/1.45  | 
% 5.11/1.45  | ALPHA: (function-axioms) implies:
% 5.11/1.45  |   (5)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 5.11/1.45  |        (v1 = v0 |  ~ (xsd_integer(v2) = v1) |  ~ (xsd_integer(v2) = v0))
% 5.11/1.45  | 
% 5.11/1.45  | BETA: splitting (the_axiom) gives:
% 5.11/1.45  | 
% 5.11/1.45  | Case 1:
% 5.11/1.45  | | 
% 5.11/1.45  | |   (6)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (cNothing(v0) = v1 &
% 5.11/1.45  | |          cowlNothing(v0) = v2 & $i(v0) & ((v2 = 0 &  ~ (v1 = 0)) | (v1 = 0 &
% 5.11/1.45  | |               ~ (v2 = 0))))
% 5.11/1.45  | | 
% 5.11/1.45  | | DELTA: instantiating (6) with fresh symbols all_13_0, all_13_1, all_13_2
% 5.11/1.45  | |        gives:
% 5.11/1.45  | |   (7)  cNothing(all_13_2) = all_13_1 & cowlNothing(all_13_2) = all_13_0 &
% 5.11/1.45  | |        $i(all_13_2) & ((all_13_0 = 0 &  ~ (all_13_1 = 0)) | (all_13_1 = 0 & 
% 5.11/1.45  | |            ~ (all_13_0 = 0)))
% 5.11/1.46  | | 
% 5.11/1.46  | | ALPHA: (7) implies:
% 5.11/1.46  | |   (8)  $i(all_13_2)
% 5.11/1.46  | |   (9)  cowlNothing(all_13_2) = all_13_0
% 5.11/1.46  | |   (10)  cNothing(all_13_2) = all_13_1
% 5.11/1.46  | |   (11)  (all_13_0 = 0 &  ~ (all_13_1 = 0)) | (all_13_1 = 0 &  ~ (all_13_0 =
% 5.11/1.46  | |             0))
% 5.11/1.46  | | 
% 5.11/1.46  | | BETA: splitting (11) gives:
% 5.11/1.46  | | 
% 5.11/1.46  | | Case 1:
% 5.11/1.46  | | | 
% 5.11/1.46  | | |   (12)  all_13_0 = 0 &  ~ (all_13_1 = 0)
% 5.11/1.46  | | | 
% 5.11/1.46  | | | ALPHA: (12) implies:
% 5.11/1.46  | | |   (13)  all_13_0 = 0
% 5.11/1.46  | | | 
% 5.11/1.46  | | | REDUCE: (9), (13) imply:
% 5.11/1.46  | | |   (14)  cowlNothing(all_13_2) = 0
% 5.11/1.46  | | | 
% 5.45/1.46  | | | GROUND_INST: instantiating (1) with all_13_2, simplifying with (8), (14)
% 5.45/1.46  | | |              gives:
% 5.45/1.46  | | |   (15)  $false
% 5.45/1.46  | | | 
% 5.45/1.46  | | | CLOSE: (15) is inconsistent.
% 5.45/1.46  | | | 
% 5.45/1.46  | | Case 2:
% 5.45/1.46  | | | 
% 5.45/1.46  | | |   (16)  all_13_1 = 0 &  ~ (all_13_0 = 0)
% 5.45/1.46  | | | 
% 5.45/1.46  | | | ALPHA: (16) implies:
% 5.45/1.46  | | |   (17)  all_13_1 = 0
% 5.45/1.46  | | | 
% 5.45/1.46  | | | REDUCE: (10), (17) imply:
% 5.45/1.46  | | |   (18)  cNothing(all_13_2) = 0
% 5.45/1.46  | | | 
% 5.45/1.46  | | | GROUND_INST: instantiating (axiom_3) with all_13_2, simplifying with (8),
% 5.45/1.46  | | |              (18) gives:
% 5.45/1.46  | | |   (19)   ? [v0: $i] : (rp(all_13_2, v0) = 0 & $i(v0))
% 5.45/1.46  | | | 
% 5.45/1.46  | | | GROUND_INST: instantiating (axiom_2) with all_13_2, simplifying with (8),
% 5.45/1.46  | | |              (18) gives:
% 5.45/1.46  | | |   (20)   ! [v0: $i] : ( ~ (rp(all_13_2, v0) = 0) |  ~ $i(v0))
% 5.45/1.46  | | | 
% 5.45/1.46  | | | DELTA: instantiating (19) with fresh symbol all_28_0 gives:
% 5.45/1.46  | | |   (21)  rp(all_13_2, all_28_0) = 0 & $i(all_28_0)
% 5.45/1.46  | | | 
% 5.45/1.46  | | | ALPHA: (21) implies:
% 5.45/1.46  | | |   (22)  $i(all_28_0)
% 5.45/1.46  | | |   (23)  rp(all_13_2, all_28_0) = 0
% 5.45/1.46  | | | 
% 5.45/1.46  | | | GROUND_INST: instantiating (20) with all_28_0, simplifying with (22), (23)
% 5.45/1.46  | | |              gives:
% 5.45/1.46  | | |   (24)  $false
% 5.45/1.46  | | | 
% 5.45/1.46  | | | CLOSE: (24) is inconsistent.
% 5.45/1.46  | | | 
% 5.45/1.46  | | End of split
% 5.45/1.46  | | 
% 5.45/1.46  | Case 2:
% 5.45/1.46  | | 
% 5.45/1.47  | |   (25)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (xsd_string(v0) = v1 &
% 5.45/1.47  | |           xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0)
% 5.45/1.47  | |               &  ~ (v1 = 0)))) |  ? [v0: $i] :  ? [v1: any] :  ? [v2: any] :
% 5.45/1.47  | |         (cowlNothing(v0) = v2 & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) |
% 5.45/1.47  | |             v2 = 0))
% 5.45/1.47  | | 
% 5.45/1.47  | | BETA: splitting (25) gives:
% 5.45/1.47  | | 
% 5.45/1.47  | | Case 1:
% 5.45/1.47  | | | 
% 5.49/1.47  | | |   (26)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (xsd_string(v0) = v1 &
% 5.49/1.47  | | |           xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 =
% 5.49/1.47  | | |                 0) &  ~ (v1 = 0))))
% 5.49/1.47  | | | 
% 5.49/1.47  | | | DELTA: instantiating (26) with fresh symbols all_13_0, all_13_1, all_13_2
% 5.49/1.47  | | |        gives:
% 5.49/1.47  | | |   (27)  xsd_string(all_13_2) = all_13_1 & xsd_integer(all_13_2) = all_13_0
% 5.49/1.47  | | |         & $i(all_13_2) & ((all_13_0 = 0 & all_13_1 = 0) | ( ~ (all_13_0 =
% 5.49/1.47  | | |               0) &  ~ (all_13_1 = 0)))
% 5.49/1.47  | | | 
% 5.49/1.47  | | | ALPHA: (27) implies:
% 5.49/1.47  | | |   (28)  $i(all_13_2)
% 5.49/1.47  | | |   (29)  xsd_integer(all_13_2) = all_13_0
% 5.49/1.47  | | |   (30)  xsd_string(all_13_2) = all_13_1
% 5.49/1.47  | | |   (31)  (all_13_0 = 0 & all_13_1 = 0) | ( ~ (all_13_0 = 0) &  ~ (all_13_1
% 5.49/1.47  | | |             = 0))
% 5.49/1.47  | | | 
% 5.49/1.47  | | | GROUND_INST: instantiating (4) with all_13_2, all_13_1, simplifying with
% 5.49/1.47  | | |              (28), (30) gives:
% 5.49/1.47  | | |   (32)  all_13_1 = 0 | xsd_integer(all_13_2) = 0
% 5.49/1.47  | | | 
% 5.49/1.47  | | | BETA: splitting (31) gives:
% 5.49/1.47  | | | 
% 5.49/1.47  | | | Case 1:
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | |   (33)  all_13_0 = 0 & all_13_1 = 0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | ALPHA: (33) implies:
% 5.49/1.47  | | | |   (34)  all_13_1 = 0
% 5.49/1.47  | | | |   (35)  all_13_0 = 0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | REDUCE: (30), (34) imply:
% 5.49/1.47  | | | |   (36)  xsd_string(all_13_2) = 0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | REDUCE: (29), (35) imply:
% 5.49/1.47  | | | |   (37)  xsd_integer(all_13_2) = 0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | GROUND_INST: instantiating (3) with all_13_2, simplifying with (28),
% 5.49/1.47  | | | |              (36) gives:
% 5.49/1.47  | | | |   (38)   ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_13_2) = v0)
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | DELTA: instantiating (38) with fresh symbol all_27_0 gives:
% 5.49/1.47  | | | |   (39)   ~ (all_27_0 = 0) & xsd_integer(all_13_2) = all_27_0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | ALPHA: (39) implies:
% 5.49/1.47  | | | |   (40)   ~ (all_27_0 = 0)
% 5.49/1.47  | | | |   (41)  xsd_integer(all_13_2) = all_27_0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | GROUND_INST: instantiating (5) with 0, all_27_0, all_13_2, simplifying
% 5.49/1.47  | | | |              with (37), (41) gives:
% 5.49/1.47  | | | |   (42)  all_27_0 = 0
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | REDUCE: (40), (42) imply:
% 5.49/1.47  | | | |   (43)  $false
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | CLOSE: (43) is inconsistent.
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | Case 2:
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | |   (44)   ~ (all_13_0 = 0) &  ~ (all_13_1 = 0)
% 5.49/1.47  | | | | 
% 5.49/1.47  | | | | ALPHA: (44) implies:
% 5.49/1.48  | | | |   (45)   ~ (all_13_1 = 0)
% 5.49/1.48  | | | |   (46)   ~ (all_13_0 = 0)
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | BETA: splitting (32) gives:
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | Case 1:
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | |   (47)  xsd_integer(all_13_2) = 0
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | | GROUND_INST: instantiating (5) with all_13_0, 0, all_13_2, simplifying
% 5.49/1.48  | | | | |              with (29), (47) gives:
% 5.49/1.48  | | | | |   (48)  all_13_0 = 0
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | | REDUCE: (46), (48) imply:
% 5.49/1.48  | | | | |   (49)  $false
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | | CLOSE: (49) is inconsistent.
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | Case 2:
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | |   (50)  all_13_1 = 0
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | | REDUCE: (45), (50) imply:
% 5.49/1.48  | | | | |   (51)  $false
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | | CLOSE: (51) is inconsistent.
% 5.49/1.48  | | | | | 
% 5.49/1.48  | | | | End of split
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | End of split
% 5.49/1.48  | | | 
% 5.49/1.48  | | Case 2:
% 5.49/1.48  | | | 
% 5.49/1.48  | | |   (52)   ? [v0: $i] :  ? [v1: any] :  ? [v2: any] : (cowlNothing(v0) = v2
% 5.49/1.48  | | |           & cowlThing(v0) = v1 & $i(v0) & ( ~ (v1 = 0) | v2 = 0))
% 5.49/1.48  | | | 
% 5.49/1.48  | | | DELTA: instantiating (52) with fresh symbols all_13_0, all_13_1, all_13_2
% 5.49/1.48  | | |        gives:
% 5.49/1.48  | | |   (53)  cowlNothing(all_13_2) = all_13_0 & cowlThing(all_13_2) = all_13_1
% 5.49/1.48  | | |         & $i(all_13_2) & ( ~ (all_13_1 = 0) | all_13_0 = 0)
% 5.49/1.48  | | | 
% 5.49/1.48  | | | ALPHA: (53) implies:
% 5.49/1.48  | | |   (54)  $i(all_13_2)
% 5.49/1.48  | | |   (55)  cowlThing(all_13_2) = all_13_1
% 5.49/1.48  | | |   (56)  cowlNothing(all_13_2) = all_13_0
% 5.49/1.48  | | |   (57)   ~ (all_13_1 = 0) | all_13_0 = 0
% 5.49/1.48  | | | 
% 5.49/1.48  | | | GROUND_INST: instantiating (2) with all_13_2, all_13_1, simplifying with
% 5.49/1.48  | | |              (54), (55) gives:
% 5.49/1.48  | | |   (58)  all_13_1 = 0
% 5.49/1.48  | | | 
% 5.49/1.48  | | | BETA: splitting (57) gives:
% 5.49/1.48  | | | 
% 5.49/1.48  | | | Case 1:
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | |   (59)   ~ (all_13_1 = 0)
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | REDUCE: (58), (59) imply:
% 5.49/1.48  | | | |   (60)  $false
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | CLOSE: (60) is inconsistent.
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | Case 2:
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | |   (61)  all_13_0 = 0
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | REDUCE: (56), (61) imply:
% 5.49/1.48  | | | |   (62)  cowlNothing(all_13_2) = 0
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | GROUND_INST: instantiating (1) with all_13_2, simplifying with (54),
% 5.49/1.48  | | | |              (62) gives:
% 5.49/1.48  | | | |   (63)  $false
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | | CLOSE: (63) is inconsistent.
% 5.49/1.48  | | | | 
% 5.49/1.48  | | | End of split
% 5.49/1.48  | | | 
% 5.49/1.48  | | End of split
% 5.49/1.48  | | 
% 5.49/1.48  | End of split
% 5.49/1.48  | 
% 5.49/1.48  End of proof
% 5.49/1.48  % SZS output end Proof for theBenchmark
% 5.49/1.48  
% 5.49/1.48  884ms
%------------------------------------------------------------------------------