TSTP Solution File: SWV455+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n027.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 22:56:33 EDT 2023

% Result   : Theorem 34.84s 5.41s
% Output   : Proof 42.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 04:16:08 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.61  ________       _____
% 0.20/0.61  ___  __ \_________(_)________________________________
% 0.20/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61  
% 0.20/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61  (2023-06-19)
% 0.20/0.61  
% 0.20/0.61  (c) Philipp Rümmer, 2009-2023
% 0.20/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61                Amanda Stjerna.
% 0.20/0.61  Free software under BSD-3-Clause.
% 0.20/0.61  
% 0.20/0.61  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61  
% 0.20/0.61  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62  Running up to 7 provers in parallel.
% 0.20/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.61/1.22  Prover 4: Preprocessing ...
% 3.61/1.22  Prover 1: Preprocessing ...
% 3.61/1.27  Prover 6: Preprocessing ...
% 3.61/1.27  Prover 2: Preprocessing ...
% 3.61/1.27  Prover 0: Preprocessing ...
% 3.61/1.27  Prover 3: Preprocessing ...
% 3.61/1.27  Prover 5: Preprocessing ...
% 10.08/2.13  Prover 1: Constructing countermodel ...
% 10.48/2.18  Prover 3: Constructing countermodel ...
% 10.48/2.27  Prover 4: Constructing countermodel ...
% 10.48/2.27  Prover 6: Proving ...
% 10.48/2.27  Prover 5: Proving ...
% 10.48/2.31  Prover 2: Proving ...
% 10.48/2.33  Prover 0: Proving ...
% 17.31/3.12  Prover 3: gave up
% 17.31/3.14  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 18.14/3.20  Prover 7: Preprocessing ...
% 20.36/3.50  Prover 7: Warning: ignoring some quantifiers
% 20.40/3.52  Prover 7: Constructing countermodel ...
% 34.84/5.41  Prover 2: proved (4778ms)
% 34.84/5.41  
% 34.84/5.41  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.84/5.41  
% 34.84/5.41  Prover 0: stopped
% 34.84/5.43  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 34.84/5.43  Prover 6: stopped
% 34.84/5.44  Prover 5: stopped
% 34.84/5.44  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 34.84/5.44  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 34.84/5.44  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 35.41/5.47  Prover 8: Preprocessing ...
% 35.41/5.50  Prover 10: Preprocessing ...
% 35.73/5.51  Prover 13: Preprocessing ...
% 35.98/5.55  Prover 11: Preprocessing ...
% 36.69/5.65  Prover 8: Warning: ignoring some quantifiers
% 36.69/5.66  Prover 10: Warning: ignoring some quantifiers
% 36.69/5.66  Prover 10: Constructing countermodel ...
% 36.69/5.67  Prover 8: Constructing countermodel ...
% 37.15/5.69  Prover 13: Warning: ignoring some quantifiers
% 37.15/5.70  Prover 13: Constructing countermodel ...
% 37.15/5.84  Prover 11: Constructing countermodel ...
% 41.36/6.28  Prover 1: gave up
% 41.36/6.28  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 42.01/6.32  Prover 16: Preprocessing ...
% 42.01/6.32  Prover 10: Found proof (size 58)
% 42.01/6.33  Prover 10: proved (899ms)
% 42.01/6.33  Prover 4: stopped
% 42.01/6.33  Prover 11: stopped
% 42.01/6.33  Prover 7: stopped
% 42.01/6.33  Prover 13: stopped
% 42.01/6.33  Prover 8: stopped
% 42.01/6.37  Prover 16: stopped
% 42.01/6.37  
% 42.01/6.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.01/6.37  
% 42.01/6.37  % SZS output start Proof for theBenchmark
% 42.01/6.38  Assumptions after simplification:
% 42.01/6.38  ---------------------------------
% 42.01/6.38  
% 42.01/6.38    (axiom_46)
% 42.01/6.40     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 42.01/6.40      (cons(v1, v2) = v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ elem(v0, v3) |
% 42.01/6.40      elem(v0, v2)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~
% 42.01/6.40      (cons(v1, v2) = v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ elem(v0, v2) |
% 42.01/6.40      elem(v0, v3)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (cons(v0, v1)
% 42.01/6.40        = v2) |  ~ $i(v1) |  ~ $i(v0) | elem(v0, v2))
% 42.01/6.40  
% 42.01/6.40    (conj)
% 42.01/6.42    $i(down) & $i(elid) & $i(status) & $i(ldr) & $i(alive) & $i(norm) & $i(wait) &
% 42.01/6.42    $i(elec_1) & $i(zero) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i]
% 42.01/6.42    :  ? [v4: $i] :  ? [v5: $i] :  ? [v6: $i] :  ? [v7: $i] :  ? [v8: $i] :  ?
% 42.01/6.42    [v9: $i] :  ? [v10: $i] :  ? [v11: $i] :  ? [v12: $i] :  ? [v13: $i] :  ?
% 42.01/6.42    [v14: $i] :  ? [v15: $i] :  ? [v16: $i] :  ? [v17: $i] :  ? [v18: $i] :  ?
% 42.01/6.42    [v19: $i] :  ? [v20: $i] :  ? [v21: $i] :  ? [v22: $i] : ( ~ (v15 = v5) &
% 42.01/6.42      cons(v7, v1) = v6 & m_Down(v20) = v21 & m_Down(v17) = v19 & m_Down(v4) = v7
% 42.01/6.42      & s(zero) = v0 & host(v20) = v5 & host(v18) = v5 & host(v17) = v15 &
% 42.01/6.42      host(v14) = v15 & host(v4) = v8 & host(v3) = v5 & queue(v15) = v16 &
% 42.01/6.42      queue(v5) = v6 & $i(v22) & $i(v21) & $i(v20) & $i(v19) & $i(v18) & $i(v17) &
% 42.01/6.42      $i(v16) & $i(v15) & $i(v14) & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) &
% 42.01/6.42      $i(v3) & $i(v2) & $i(v1) & $i(v0) & setIn(v18, alive) & setIn(v14, alive) &
% 42.01/6.42      setIn(v3, alive) & elem(v21, v16) & elem(v19, v1) &  ~ leq(v5, v8) &  !
% 42.01/6.42      [v23: $i] :  ! [v24: $i] :  ! [v25: $i] :  ! [v26: $i] :  ! [v27: $i] :  !
% 42.01/6.42      [v28: $i] :  ! [v29: $i] :  ! [v30: $i] : (v28 = v27 |  ~ (m_Down(v26) =
% 42.01/6.42          v29) |  ~ (m_Down(v24) = v30) |  ~ (host(v25) = v27) |  ~ (host(v23) =
% 42.01/6.42          v28) |  ~ $i(v26) |  ~ $i(v25) |  ~ $i(v24) |  ~ $i(v23) |  ~ setIn(v25,
% 42.01/6.42          alive) |  ~ setIn(v23, alive) |  ? [v31: $i] :  ? [v32: $i] :  ? [v33:
% 42.01/6.42          $i] :  ? [v34: $i] : (( ~ (v32 = v27) & host(v26) = v32 & $i(v32)) | ( ~
% 42.01/6.42            (v31 = v28) & host(v24) = v31 & $i(v31)) | (queue(v28) = v33 & $i(v33)
% 42.01/6.42            &  ~ elem(v29, v33)) | (queue(v27) = v34 & $i(v34) &  ~ elem(v30,
% 42.01/6.42              v34)))) &  ! [v23: $i] :  ! [v24: $i] :  ! [v25: $i] :  ! [v26: $i]
% 42.01/6.42      :  ! [v27: $i] : ( ~ (m_Ack(v25, v23) = v26) |  ~ (host(v24) = v27) |  ~
% 42.01/6.42        $i(v25) |  ~ $i(v24) |  ~ $i(v23) |  ? [v28: $i] :  ? [v29: $i] :  ? [v30:
% 42.01/6.42          $i] : ((host(v25) = v30 & host(v23) = v29 & $i(v30) & $i(v29) &  ~
% 42.01/6.42            leq(v29, v30)) | (queue(v27) = v28 & $i(v28) &  ~ elem(v26, v28)))) & 
% 42.01/6.42      ! [v23: $i] :  ! [v24: $i] :  ! [v25: $i] :  ! [v26: $i] : ( ~ (m_Down(v24)
% 42.01/6.42          = v25) |  ~ (host(v23) = v26) |  ~ $i(v24) |  ~ $i(v23) |  ~ setIn(v24,
% 42.01/6.42          alive) |  ? [v27: $i] : (queue(v26) = v27 & $i(v27) &  ~ elem(v25,
% 42.01/6.42            v27))) &  ! [v23: $i] :  ! [v24: $i] :  ! [v25: $i] :  ! [v26: $i] : (
% 42.01/6.42        ~ (m_Down(v24) = v25) |  ~ (host(v23) = v26) |  ~ $i(v24) |  ~ $i(v23) | 
% 42.01/6.42        ? [v27: $i] :  ? [v28: $i] : (( ~ (v28 = v26) & host(v24) = v28 & $i(v28))
% 42.01/6.42          | (queue(v26) = v27 & $i(v27) &  ~ elem(v25, v27)))) &  ! [v23: $i] :  !
% 42.01/6.42      [v24: $i] :  ! [v25: $i] :  ! [v26: $i] : ( ~ (m_Halt(v24) = v25) |  ~
% 42.01/6.42        (host(v23) = v26) |  ~ $i(v24) |  ~ $i(v23) |  ? [v27: $i] :  ? [v28: $i]
% 42.01/6.42        : ((host(v24) = v28 & $i(v28) &  ~ leq(v26, v28)) | (queue(v26) = v27 &
% 42.01/6.42            $i(v27) &  ~ elem(v25, v27)))) &  ! [v23: $i] :  ! [v24: $i] :  !
% 42.01/6.42      [v25: $i] : (v24 = v23 |  ~ (host(v24) = v25) |  ~ (host(v23) = v25) |  ~
% 42.01/6.42        $i(v24) |  ~ $i(v23) |  ~ setIn(v24, alive) |  ~ setIn(v23, alive)) &  !
% 42.01/6.42      [v23: $i] :  ! [v24: $i] :  ! [v25: $i] : ( ~ (host(v24) = v25) |  ~
% 42.01/6.42        (host(v23) = v25) |  ~ $i(v24) |  ~ $i(v23) |  ~ leq(v24, v23) |  ~
% 42.01/6.42        setIn(v24, alive) | setIn(v23, alive)) & (( ~ (v22 = v8) & index(down, v5)
% 42.01/6.42          = v13 & $i(v13) & leq(v0, v22) &  ~ leq(v5, v22) &  ~ setIn(v22, v13)) |
% 42.01/6.42        ( ~ (v10 = elec_1) & index(status, v5) = v10 & $i(v10))) & (( ~ (v12 = v8)
% 42.01/6.42          & index(elid, v5) = v11 & host(v11) = v12 & $i(v12) & $i(v11)) | ( ~
% 42.01/6.42          (v10 = wait) & index(status, v5) = v10 & $i(v10))) & (( ~ (v10 = norm) &
% 42.01/6.42          index(status, v5) = v10 & $i(v10)) | ( ~ (v9 = v8) & index(ldr, v5) = v9
% 42.01/6.42          & $i(v9))))
% 42.01/6.42  
% 42.01/6.42    (function-axioms)
% 42.01/6.42     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 42.01/6.42      (index(v3, v2) = v1) |  ~ (index(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i]
% 42.01/6.42    :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (snoc(v3, v2) = v1) |  ~ (snoc(v3,
% 42.01/6.42          v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1
% 42.01/6.42      = v0 |  ~ (cons(v3, v2) = v1) |  ~ (cons(v3, v2) = v0)) &  ! [v0: $i] :  !
% 42.01/6.42    [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (m_Ack(v3, v2) = v1) |  ~
% 42.01/6.42      (m_Ack(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |
% 42.01/6.42       ~ (pidMsg(v2) = v1) |  ~ (pidMsg(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] : 
% 42.01/6.42    ! [v2: $i] : (v1 = v0 |  ~ (init(v2) = v1) |  ~ (init(v2) = v0)) &  ! [v0: $i]
% 42.01/6.42    :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (last(v2) = v1) |  ~ (last(v2) =
% 42.01/6.42        v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (tail(v2) =
% 42.01/6.42        v1) |  ~ (tail(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1
% 42.01/6.42      = v0 |  ~ (head(v2) = v1) |  ~ (head(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i]
% 42.01/6.42    :  ! [v2: $i] : (v1 = v0 |  ~ (m_NormQ(v2) = v1) |  ~ (m_NormQ(v2) = v0)) &  !
% 42.01/6.42    [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (m_Ldr(v2) = v1) |  ~
% 42.01/6.42      (m_Ldr(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~
% 42.01/6.42      (m_NotNorm(v2) = v1) |  ~ (m_NotNorm(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i]
% 42.01/6.42    :  ! [v2: $i] : (v1 = v0 |  ~ (m_Down(v2) = v1) |  ~ (m_Down(v2) = v0)) &  !
% 42.01/6.42    [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (m_Halt(v2) = v1) |  ~
% 42.01/6.42      (m_Halt(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~
% 42.01/6.42      (s(v2) = v1) |  ~ (s(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :
% 42.01/6.42    (v1 = v0 |  ~ (host(v2) = v1) |  ~ (host(v2) = v0)) &  ! [v0: $i] :  ! [v1:
% 42.01/6.42      $i] :  ! [v2: $i] : (v1 = v0 |  ~ (queue(v2) = v1) |  ~ (queue(v2) = v0))
% 42.01/6.42  
% 42.01/6.42  Further assumptions not needed in the proof:
% 42.01/6.42  --------------------------------------------
% 42.01/6.42  axiom, axiom_01, axiom_02, axiom_03, axiom_04, axiom_05, axiom_06, axiom_07,
% 42.01/6.42  axiom_08, axiom_09, axiom_10, axiom_11, axiom_12, axiom_13, axiom_14, axiom_15,
% 42.01/6.42  axiom_16, axiom_17, axiom_18, axiom_19, axiom_20, axiom_21, axiom_22, axiom_23,
% 42.01/6.42  axiom_24, axiom_25, axiom_26, axiom_27, axiom_28, axiom_29, axiom_30, axiom_31,
% 42.01/6.42  axiom_32, axiom_33, axiom_34, axiom_35, axiom_36, axiom_37, axiom_38, axiom_39,
% 42.01/6.42  axiom_40, axiom_41, axiom_42, axiom_43, axiom_44, axiom_45, axiom_47, axiom_48,
% 42.01/6.42  axiom_49, axiom_50, axiom_51, axiom_52, axiom_53, axiom_54, axiom_55, axiom_56,
% 42.01/6.42  axiom_57, axiom_58, axiom_59, axiom_60, axiom_61, axiom_62, axiom_63, axiom_64,
% 42.01/6.42  axiom_65
% 42.01/6.42  
% 42.01/6.42  Those formulas are unsatisfiable:
% 42.01/6.42  ---------------------------------
% 42.01/6.42  
% 42.01/6.42  Begin of proof
% 42.01/6.42  | 
% 42.01/6.42  | ALPHA: (axiom_46) implies:
% 42.01/6.43  |   (1)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ (cons(v1,
% 42.01/6.43  |              v2) = v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ elem(v0, v2) |
% 42.01/6.43  |          elem(v0, v3))
% 42.01/6.43  | 
% 42.01/6.43  | ALPHA: (conj) implies:
% 42.01/6.43  |   (2)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : 
% 42.01/6.43  |        ? [v5: $i] :  ? [v6: $i] :  ? [v7: $i] :  ? [v8: $i] :  ? [v9: $i] :  ?
% 42.01/6.43  |        [v10: $i] :  ? [v11: $i] :  ? [v12: $i] :  ? [v13: $i] :  ? [v14: $i] :
% 42.01/6.43  |         ? [v15: $i] :  ? [v16: $i] :  ? [v17: $i] :  ? [v18: $i] :  ? [v19:
% 42.01/6.43  |          $i] :  ? [v20: $i] :  ? [v21: $i] :  ? [v22: $i] : ( ~ (v15 = v5) &
% 42.01/6.43  |          cons(v7, v1) = v6 & m_Down(v20) = v21 & m_Down(v17) = v19 &
% 42.01/6.43  |          m_Down(v4) = v7 & s(zero) = v0 & host(v20) = v5 & host(v18) = v5 &
% 42.01/6.43  |          host(v17) = v15 & host(v14) = v15 & host(v4) = v8 & host(v3) = v5 &
% 42.01/6.43  |          queue(v15) = v16 & queue(v5) = v6 & $i(v22) & $i(v21) & $i(v20) &
% 42.01/6.43  |          $i(v19) & $i(v18) & $i(v17) & $i(v16) & $i(v15) & $i(v14) & $i(v8) &
% 42.01/6.43  |          $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)
% 42.01/6.43  |          & setIn(v18, alive) & setIn(v14, alive) & setIn(v3, alive) &
% 42.01/6.43  |          elem(v21, v16) & elem(v19, v1) &  ~ leq(v5, v8) &  ! [v23: $i] :  !
% 42.01/6.43  |          [v24: $i] :  ! [v25: $i] :  ! [v26: $i] :  ! [v27: $i] :  ! [v28: $i]
% 42.01/6.43  |          :  ! [v29: $i] :  ! [v30: $i] : (v28 = v27 |  ~ (m_Down(v26) = v29) |
% 42.01/6.43  |             ~ (m_Down(v24) = v30) |  ~ (host(v25) = v27) |  ~ (host(v23) =
% 42.01/6.43  |              v28) |  ~ $i(v26) |  ~ $i(v25) |  ~ $i(v24) |  ~ $i(v23) |  ~
% 42.01/6.43  |            setIn(v25, alive) |  ~ setIn(v23, alive) |  ? [v31: $i] :  ? [v32:
% 42.01/6.43  |              $i] :  ? [v33: $i] :  ? [v34: $i] : (( ~ (v32 = v27) & host(v26)
% 42.01/6.43  |                = v32 & $i(v32)) | ( ~ (v31 = v28) & host(v24) = v31 & $i(v31))
% 42.01/6.43  |              | (queue(v28) = v33 & $i(v33) &  ~ elem(v29, v33)) | (queue(v27)
% 42.01/6.43  |                = v34 & $i(v34) &  ~ elem(v30, v34)))) &  ! [v23: $i] :  !
% 42.01/6.43  |          [v24: $i] :  ! [v25: $i] :  ! [v26: $i] :  ! [v27: $i] : ( ~
% 42.01/6.43  |            (m_Ack(v25, v23) = v26) |  ~ (host(v24) = v27) |  ~ $i(v25) |  ~
% 42.01/6.43  |            $i(v24) |  ~ $i(v23) |  ? [v28: $i] :  ? [v29: $i] :  ? [v30: $i] :
% 42.01/6.43  |            ((host(v25) = v30 & host(v23) = v29 & $i(v30) & $i(v29) &  ~
% 42.01/6.43  |                leq(v29, v30)) | (queue(v27) = v28 & $i(v28) &  ~ elem(v26,
% 42.01/6.43  |                  v28)))) &  ! [v23: $i] :  ! [v24: $i] :  ! [v25: $i] :  !
% 42.01/6.43  |          [v26: $i] : ( ~ (m_Down(v24) = v25) |  ~ (host(v23) = v26) |  ~
% 42.01/6.43  |            $i(v24) |  ~ $i(v23) |  ~ setIn(v24, alive) |  ? [v27: $i] :
% 42.01/6.43  |            (queue(v26) = v27 & $i(v27) &  ~ elem(v25, v27))) &  ! [v23: $i] : 
% 42.01/6.43  |          ! [v24: $i] :  ! [v25: $i] :  ! [v26: $i] : ( ~ (m_Down(v24) = v25) |
% 42.01/6.43  |             ~ (host(v23) = v26) |  ~ $i(v24) |  ~ $i(v23) |  ? [v27: $i] :  ?
% 42.01/6.43  |            [v28: $i] : (( ~ (v28 = v26) & host(v24) = v28 & $i(v28)) |
% 42.01/6.43  |              (queue(v26) = v27 & $i(v27) &  ~ elem(v25, v27)))) &  ! [v23: $i]
% 42.01/6.43  |          :  ! [v24: $i] :  ! [v25: $i] :  ! [v26: $i] : ( ~ (m_Halt(v24) =
% 42.01/6.43  |              v25) |  ~ (host(v23) = v26) |  ~ $i(v24) |  ~ $i(v23) |  ? [v27:
% 42.01/6.43  |              $i] :  ? [v28: $i] : ((host(v24) = v28 & $i(v28) &  ~ leq(v26,
% 42.01/6.43  |                  v28)) | (queue(v26) = v27 & $i(v27) &  ~ elem(v25, v27)))) & 
% 42.01/6.43  |          ! [v23: $i] :  ! [v24: $i] :  ! [v25: $i] : (v24 = v23 |  ~
% 42.01/6.43  |            (host(v24) = v25) |  ~ (host(v23) = v25) |  ~ $i(v24) |  ~ $i(v23)
% 42.01/6.43  |            |  ~ setIn(v24, alive) |  ~ setIn(v23, alive)) &  ! [v23: $i] :  !
% 42.01/6.43  |          [v24: $i] :  ! [v25: $i] : ( ~ (host(v24) = v25) |  ~ (host(v23) =
% 42.01/6.43  |              v25) |  ~ $i(v24) |  ~ $i(v23) |  ~ leq(v24, v23) |  ~ setIn(v24,
% 42.01/6.43  |              alive) | setIn(v23, alive)) & (( ~ (v22 = v8) & index(down, v5) =
% 42.01/6.43  |              v13 & $i(v13) & leq(v0, v22) &  ~ leq(v5, v22) &  ~ setIn(v22,
% 42.01/6.43  |                v13)) | ( ~ (v10 = elec_1) & index(status, v5) = v10 &
% 42.01/6.43  |              $i(v10))) & (( ~ (v12 = v8) & index(elid, v5) = v11 & host(v11) =
% 42.01/6.43  |              v12 & $i(v12) & $i(v11)) | ( ~ (v10 = wait) & index(status, v5) =
% 42.01/6.43  |              v10 & $i(v10))) & (( ~ (v10 = norm) & index(status, v5) = v10 &
% 42.01/6.43  |              $i(v10)) | ( ~ (v9 = v8) & index(ldr, v5) = v9 & $i(v9))))
% 42.01/6.43  | 
% 42.01/6.43  | ALPHA: (function-axioms) implies:
% 42.01/6.44  |   (3)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (queue(v2) =
% 42.01/6.44  |            v1) |  ~ (queue(v2) = v0))
% 42.01/6.44  |   (4)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (host(v2) = v1)
% 42.01/6.44  |          |  ~ (host(v2) = v0))
% 42.01/6.44  | 
% 42.01/6.44  | DELTA: instantiating (2) with fresh symbols all_65_0, all_65_1, all_65_2,
% 42.01/6.44  |        all_65_3, all_65_4, all_65_5, all_65_6, all_65_7, all_65_8, all_65_9,
% 42.01/6.44  |        all_65_10, all_65_11, all_65_12, all_65_13, all_65_14, all_65_15,
% 42.01/6.44  |        all_65_16, all_65_17, all_65_18, all_65_19, all_65_20, all_65_21,
% 42.01/6.44  |        all_65_22 gives:
% 42.01/6.44  |   (5)   ~ (all_65_7 = all_65_17) & cons(all_65_15, all_65_21) = all_65_16 &
% 42.01/6.44  |        m_Down(all_65_2) = all_65_1 & m_Down(all_65_5) = all_65_3 &
% 42.01/6.44  |        m_Down(all_65_18) = all_65_15 & s(zero) = all_65_22 & host(all_65_2) =
% 42.01/6.44  |        all_65_17 & host(all_65_4) = all_65_17 & host(all_65_5) = all_65_7 &
% 42.01/6.44  |        host(all_65_8) = all_65_7 & host(all_65_18) = all_65_14 &
% 42.01/6.44  |        host(all_65_19) = all_65_17 & queue(all_65_7) = all_65_6 &
% 42.01/6.44  |        queue(all_65_17) = all_65_16 & $i(all_65_0) & $i(all_65_1) &
% 42.01/6.44  |        $i(all_65_2) & $i(all_65_3) & $i(all_65_4) & $i(all_65_5) &
% 42.01/6.44  |        $i(all_65_6) & $i(all_65_7) & $i(all_65_8) & $i(all_65_14) &
% 42.01/6.44  |        $i(all_65_15) & $i(all_65_16) & $i(all_65_17) & $i(all_65_18) &
% 42.01/6.44  |        $i(all_65_19) & $i(all_65_20) & $i(all_65_21) & $i(all_65_22) &
% 42.01/6.44  |        setIn(all_65_4, alive) & setIn(all_65_8, alive) & setIn(all_65_19,
% 42.01/6.44  |          alive) & elem(all_65_1, all_65_6) & elem(all_65_3, all_65_21) &  ~
% 42.01/6.44  |        leq(all_65_17, all_65_14) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : 
% 42.01/6.44  |        ! [v3: $i] :  ! [v4: $i] :  ! [v5: $i] :  ! [v6: $i] :  ! [v7: $i] :
% 42.01/6.44  |        (v5 = v4 |  ~ (m_Down(v3) = v6) |  ~ (m_Down(v1) = v7) |  ~ (host(v2) =
% 42.01/6.44  |            v4) |  ~ (host(v0) = v5) |  ~ $i(v3) |  ~ $i(v2) |  ~ $i(v1) |  ~
% 42.01/6.44  |          $i(v0) |  ~ setIn(v2, alive) |  ~ setIn(v0, alive) |  ? [v8: $i] :  ?
% 42.01/6.44  |          [v9: $i] :  ? [v10: $i] :  ? [v11: $i] : (( ~ (v9 = v4) & host(v3) =
% 42.01/6.44  |              v9 & $i(v9)) | ( ~ (v8 = v5) & host(v1) = v8 & $i(v8)) |
% 42.01/6.44  |            (queue(v5) = v10 & $i(v10) &  ~ elem(v6, v10)) | (queue(v4) = v11 &
% 42.01/6.44  |              $i(v11) &  ~ elem(v7, v11)))) &  ! [v0: $i] :  ! [v1: $i] :  !
% 42.01/6.44  |        [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : ( ~ (m_Ack(v2, v0) = v3) |  ~
% 42.01/6.44  |          (host(v1) = v4) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v5: $i] : 
% 42.01/6.44  |          ? [v6: $i] :  ? [v7: $i] : ((host(v2) = v7 & host(v0) = v6 & $i(v7) &
% 42.01/6.44  |              $i(v6) &  ~ leq(v6, v7)) | (queue(v4) = v5 & $i(v5) &  ~ elem(v3,
% 42.01/6.44  |                v5)))) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i]
% 42.01/6.44  |        : ( ~ (m_Down(v1) = v2) |  ~ (host(v0) = v3) |  ~ $i(v1) |  ~ $i(v0) | 
% 42.01/6.44  |          ~ setIn(v1, alive) |  ? [v4: $i] : (queue(v3) = v4 & $i(v4) &  ~
% 42.01/6.44  |            elem(v2, v4))) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3:
% 42.01/6.44  |          $i] : ( ~ (m_Down(v1) = v2) |  ~ (host(v0) = v3) |  ~ $i(v1) |  ~
% 42.01/6.44  |          $i(v0) |  ? [v4: $i] :  ? [v5: $i] : (( ~ (v5 = v3) & host(v1) = v5 &
% 42.01/6.44  |              $i(v5)) | (queue(v3) = v4 & $i(v4) &  ~ elem(v2, v4)))) &  ! [v0:
% 42.01/6.44  |          $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ (m_Halt(v1) = v2)
% 42.01/6.44  |          |  ~ (host(v0) = v3) |  ~ $i(v1) |  ~ $i(v0) |  ? [v4: $i] :  ? [v5:
% 42.01/6.44  |            $i] : ((host(v1) = v5 & $i(v5) &  ~ leq(v3, v5)) | (queue(v3) = v4
% 42.01/6.44  |              & $i(v4) &  ~ elem(v2, v4)))) &  ! [v0: $i] :  ! [v1: $i] :  !
% 42.01/6.44  |        [v2: $i] : (v1 = v0 |  ~ (host(v1) = v2) |  ~ (host(v0) = v2) |  ~
% 42.01/6.44  |          $i(v1) |  ~ $i(v0) |  ~ setIn(v1, alive) |  ~ setIn(v0, alive)) &  !
% 42.01/6.44  |        [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (host(v1) = v2) |  ~
% 42.01/6.44  |          (host(v0) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ leq(v1, v0) |  ~
% 42.01/6.44  |          setIn(v1, alive) | setIn(v0, alive)) & (( ~ (all_65_0 = all_65_14) &
% 42.01/6.44  |            index(down, all_65_17) = all_65_9 & $i(all_65_9) & leq(all_65_22,
% 42.01/6.44  |              all_65_0) &  ~ leq(all_65_17, all_65_0) &  ~ setIn(all_65_0,
% 42.01/6.44  |              all_65_9)) | ( ~ (all_65_12 = elec_1) & index(status, all_65_17)
% 42.01/6.44  |            = all_65_12 & $i(all_65_12))) & (( ~ (all_65_10 = all_65_14) &
% 42.01/6.44  |            index(elid, all_65_17) = all_65_11 & host(all_65_11) = all_65_10 &
% 42.01/6.44  |            $i(all_65_10) & $i(all_65_11)) | ( ~ (all_65_12 = wait) &
% 42.01/6.44  |            index(status, all_65_17) = all_65_12 & $i(all_65_12))) & (( ~
% 42.01/6.44  |            (all_65_12 = norm) & index(status, all_65_17) = all_65_12 &
% 42.01/6.44  |            $i(all_65_12)) | ( ~ (all_65_13 = all_65_14) & index(ldr,
% 42.01/6.44  |              all_65_17) = all_65_13 & $i(all_65_13)))
% 42.01/6.44  | 
% 42.01/6.44  | ALPHA: (5) implies:
% 42.01/6.45  |   (6)   ~ (all_65_7 = all_65_17)
% 42.01/6.45  |   (7)  elem(all_65_3, all_65_21)
% 42.01/6.45  |   (8)  elem(all_65_1, all_65_6)
% 42.01/6.45  |   (9)  setIn(all_65_19, alive)
% 42.01/6.45  |   (10)  setIn(all_65_8, alive)
% 42.01/6.45  |   (11)  $i(all_65_21)
% 42.01/6.45  |   (12)  $i(all_65_19)
% 42.01/6.45  |   (13)  $i(all_65_15)
% 42.01/6.45  |   (14)  $i(all_65_8)
% 42.01/6.45  |   (15)  $i(all_65_5)
% 42.01/6.45  |   (16)  $i(all_65_3)
% 42.01/6.45  |   (17)  $i(all_65_2)
% 42.01/6.45  |   (18)  queue(all_65_17) = all_65_16
% 42.01/6.45  |   (19)  queue(all_65_7) = all_65_6
% 42.01/6.45  |   (20)  host(all_65_19) = all_65_17
% 42.01/6.45  |   (21)  host(all_65_8) = all_65_7
% 42.01/6.45  |   (22)  host(all_65_5) = all_65_7
% 42.01/6.45  |   (23)  host(all_65_2) = all_65_17
% 42.01/6.45  |   (24)  m_Down(all_65_5) = all_65_3
% 42.01/6.45  |   (25)  m_Down(all_65_2) = all_65_1
% 42.01/6.45  |   (26)  cons(all_65_15, all_65_21) = all_65_16
% 42.01/6.45  |   (27)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~
% 42.01/6.45  |           (m_Down(v1) = v2) |  ~ (host(v0) = v3) |  ~ $i(v1) |  ~ $i(v0) |  ?
% 42.01/6.45  |           [v4: $i] :  ? [v5: $i] : (( ~ (v5 = v3) & host(v1) = v5 & $i(v5)) |
% 42.01/6.45  |             (queue(v3) = v4 & $i(v4) &  ~ elem(v2, v4))))
% 42.01/6.45  |   (28)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : 
% 42.01/6.45  |         ! [v5: $i] :  ! [v6: $i] :  ! [v7: $i] : (v5 = v4 |  ~ (m_Down(v3) =
% 42.01/6.45  |             v6) |  ~ (m_Down(v1) = v7) |  ~ (host(v2) = v4) |  ~ (host(v0) =
% 42.01/6.45  |             v5) |  ~ $i(v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ setIn(v2,
% 42.01/6.45  |             alive) |  ~ setIn(v0, alive) |  ? [v8: $i] :  ? [v9: $i] :  ?
% 42.01/6.45  |           [v10: $i] :  ? [v11: $i] : (( ~ (v9 = v4) & host(v3) = v9 & $i(v9))
% 42.01/6.45  |             | ( ~ (v8 = v5) & host(v1) = v8 & $i(v8)) | (queue(v5) = v10 &
% 42.01/6.45  |               $i(v10) &  ~ elem(v6, v10)) | (queue(v4) = v11 & $i(v11) &  ~
% 42.01/6.45  |               elem(v7, v11))))
% 42.01/6.45  | 
% 42.01/6.45  | GROUND_INST: instantiating (27) with all_65_8, all_65_5, all_65_3, all_65_7,
% 42.01/6.45  |              simplifying with (14), (15), (21), (24) gives:
% 42.01/6.45  |   (29)   ? [v0: $i] :  ? [v1: any] : (( ~ (v1 = all_65_7) & host(all_65_5) =
% 42.01/6.45  |             v1 & $i(v1)) | (queue(all_65_7) = v0 & $i(v0) &  ~ elem(all_65_3,
% 42.01/6.45  |               v0)))
% 42.01/6.45  | 
% 42.01/6.45  | GROUND_INST: instantiating (28) with all_65_19, all_65_2, all_65_8, all_65_5,
% 42.01/6.45  |              all_65_7, all_65_17, all_65_3, all_65_1, simplifying with (9),
% 42.01/6.45  |              (10), (12), (14), (15), (17), (20), (21), (24), (25) gives:
% 42.01/6.45  |   (30)  all_65_7 = all_65_17 |  ? [v0: any] :  ? [v1: any] :  ? [v2: $i] :  ?
% 42.01/6.45  |         [v3: $i] : (( ~ (v1 = all_65_7) & host(all_65_5) = v1 & $i(v1)) | ( ~
% 42.01/6.45  |             (v0 = all_65_17) & host(all_65_2) = v0 & $i(v0)) |
% 42.01/6.45  |           (queue(all_65_7) = v3 & $i(v3) &  ~ elem(all_65_1, v3)) |
% 42.01/6.45  |           (queue(all_65_17) = v2 & $i(v2) &  ~ elem(all_65_3, v2)))
% 42.01/6.45  | 
% 42.01/6.45  | GROUND_INST: instantiating (27) with all_65_19, all_65_2, all_65_1, all_65_17,
% 42.01/6.45  |              simplifying with (12), (17), (20), (25) gives:
% 42.01/6.46  |   (31)   ? [v0: $i] :  ? [v1: any] : (( ~ (v1 = all_65_17) & host(all_65_2) =
% 42.01/6.46  |             v1 & $i(v1)) | (queue(all_65_17) = v0 & $i(v0) &  ~ elem(all_65_1,
% 42.01/6.46  |               v0)))
% 42.01/6.46  | 
% 42.01/6.46  | GROUND_INST: instantiating (1) with all_65_3, all_65_15, all_65_21, all_65_16,
% 42.01/6.46  |              simplifying with (7), (11), (13), (16), (26) gives:
% 42.01/6.46  |   (32)  elem(all_65_3, all_65_16)
% 42.01/6.46  | 
% 42.01/6.46  | DELTA: instantiating (31) with fresh symbols all_88_0, all_88_1 gives:
% 42.01/6.46  |   (33)  ( ~ (all_88_0 = all_65_17) & host(all_65_2) = all_88_0 & $i(all_88_0))
% 42.01/6.46  |         | (queue(all_65_17) = all_88_1 & $i(all_88_1) &  ~ elem(all_65_1,
% 42.01/6.46  |             all_88_1))
% 42.01/6.46  | 
% 42.01/6.46  | DELTA: instantiating (29) with fresh symbols all_90_0, all_90_1 gives:
% 42.01/6.46  |   (34)  ( ~ (all_90_0 = all_65_7) & host(all_65_5) = all_90_0 & $i(all_90_0))
% 42.01/6.46  |         | (queue(all_65_7) = all_90_1 & $i(all_90_1) &  ~ elem(all_65_3,
% 42.01/6.46  |             all_90_1))
% 42.01/6.46  | 
% 42.01/6.46  | BETA: splitting (34) gives:
% 42.01/6.46  | 
% 42.01/6.46  | Case 1:
% 42.01/6.46  | | 
% 42.01/6.46  | |   (35)   ~ (all_90_0 = all_65_7) & host(all_65_5) = all_90_0 & $i(all_90_0)
% 42.01/6.46  | | 
% 42.01/6.46  | | ALPHA: (35) implies:
% 42.01/6.46  | |   (36)   ~ (all_90_0 = all_65_7)
% 42.01/6.46  | |   (37)  host(all_65_5) = all_90_0
% 42.01/6.46  | | 
% 42.01/6.46  | | GROUND_INST: instantiating (4) with all_65_7, all_90_0, all_65_5,
% 42.01/6.46  | |              simplifying with (22), (37) gives:
% 42.01/6.46  | |   (38)  all_90_0 = all_65_7
% 42.01/6.46  | | 
% 42.01/6.46  | | REDUCE: (36), (38) imply:
% 42.01/6.46  | |   (39)  $false
% 42.01/6.46  | | 
% 42.01/6.46  | | CLOSE: (39) is inconsistent.
% 42.01/6.46  | | 
% 42.01/6.46  | Case 2:
% 42.01/6.46  | | 
% 42.01/6.46  | |   (40)  queue(all_65_7) = all_90_1 & $i(all_90_1) &  ~ elem(all_65_3,
% 42.01/6.46  | |           all_90_1)
% 42.01/6.46  | | 
% 42.01/6.46  | | ALPHA: (40) implies:
% 42.01/6.46  | |   (41)  queue(all_65_7) = all_90_1
% 42.01/6.46  | | 
% 42.01/6.46  | | BETA: splitting (33) gives:
% 42.01/6.46  | | 
% 42.01/6.46  | | Case 1:
% 42.01/6.46  | | | 
% 42.01/6.46  | | |   (42)   ~ (all_88_0 = all_65_17) & host(all_65_2) = all_88_0 &
% 42.01/6.46  | | |         $i(all_88_0)
% 42.01/6.46  | | | 
% 42.01/6.46  | | | ALPHA: (42) implies:
% 42.01/6.46  | | |   (43)   ~ (all_88_0 = all_65_17)
% 42.01/6.46  | | |   (44)  host(all_65_2) = all_88_0
% 42.01/6.46  | | | 
% 42.01/6.46  | | | GROUND_INST: instantiating (4) with all_65_17, all_88_0, all_65_2,
% 42.01/6.46  | | |              simplifying with (23), (44) gives:
% 42.01/6.46  | | |   (45)  all_88_0 = all_65_17
% 42.01/6.46  | | | 
% 42.01/6.46  | | | REDUCE: (43), (45) imply:
% 42.01/6.46  | | |   (46)  $false
% 42.01/6.46  | | | 
% 42.01/6.46  | | | CLOSE: (46) is inconsistent.
% 42.01/6.46  | | | 
% 42.01/6.46  | | Case 2:
% 42.01/6.46  | | | 
% 42.01/6.46  | | |   (47)  queue(all_65_17) = all_88_1 & $i(all_88_1) &  ~ elem(all_65_1,
% 42.01/6.46  | | |           all_88_1)
% 42.01/6.46  | | | 
% 42.01/6.46  | | | ALPHA: (47) implies:
% 42.01/6.46  | | |   (48)  queue(all_65_17) = all_88_1
% 42.01/6.46  | | | 
% 42.01/6.46  | | | BETA: splitting (30) gives:
% 42.01/6.46  | | | 
% 42.01/6.46  | | | Case 1:
% 42.01/6.46  | | | | 
% 42.01/6.46  | | | |   (49)  all_65_7 = all_65_17
% 42.01/6.46  | | | | 
% 42.01/6.46  | | | | REDUCE: (6), (49) imply:
% 42.01/6.46  | | | |   (50)  $false
% 42.01/6.46  | | | | 
% 42.01/6.46  | | | | CLOSE: (50) is inconsistent.
% 42.01/6.46  | | | | 
% 42.01/6.46  | | | Case 2:
% 42.01/6.46  | | | | 
% 42.01/6.46  | | | |   (51)   ? [v0: any] :  ? [v1: any] :  ? [v2: $i] :  ? [v3: $i] : (( ~
% 42.01/6.46  | | | |             (v1 = all_65_7) & host(all_65_5) = v1 & $i(v1)) | ( ~ (v0 =
% 42.01/6.46  | | | |               all_65_17) & host(all_65_2) = v0 & $i(v0)) |
% 42.01/6.46  | | | |           (queue(all_65_7) = v3 & $i(v3) &  ~ elem(all_65_1, v3)) |
% 42.01/6.46  | | | |           (queue(all_65_17) = v2 & $i(v2) &  ~ elem(all_65_3, v2)))
% 42.01/6.46  | | | | 
% 42.01/6.46  | | | | DELTA: instantiating (51) with fresh symbols all_162_0, all_162_1,
% 42.01/6.46  | | | |        all_162_2, all_162_3 gives:
% 42.01/6.47  | | | |   (52)  ( ~ (all_162_2 = all_65_7) & host(all_65_5) = all_162_2 &
% 42.01/6.47  | | | |           $i(all_162_2)) | ( ~ (all_162_3 = all_65_17) & host(all_65_2)
% 42.01/6.47  | | | |           = all_162_3 & $i(all_162_3)) | (queue(all_65_7) = all_162_0 &
% 42.01/6.47  | | | |           $i(all_162_0) &  ~ elem(all_65_1, all_162_0)) |
% 42.01/6.47  | | | |         (queue(all_65_17) = all_162_1 & $i(all_162_1) &  ~
% 42.01/6.47  | | | |           elem(all_65_3, all_162_1))
% 42.01/6.47  | | | | 
% 42.01/6.47  | | | | BETA: splitting (52) gives:
% 42.01/6.47  | | | | 
% 42.01/6.47  | | | | Case 1:
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | |   (53)  ( ~ (all_162_2 = all_65_7) & host(all_65_5) = all_162_2 &
% 42.01/6.47  | | | | |           $i(all_162_2)) | ( ~ (all_162_3 = all_65_17) &
% 42.01/6.47  | | | | |           host(all_65_2) = all_162_3 & $i(all_162_3))
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | | BETA: splitting (53) gives:
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | | Case 1:
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | |   (54)   ~ (all_162_2 = all_65_7) & host(all_65_5) = all_162_2 &
% 42.01/6.47  | | | | | |         $i(all_162_2)
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | ALPHA: (54) implies:
% 42.01/6.47  | | | | | |   (55)   ~ (all_162_2 = all_65_7)
% 42.01/6.47  | | | | | |   (56)  host(all_65_5) = all_162_2
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | GROUND_INST: instantiating (4) with all_65_7, all_162_2, all_65_5,
% 42.01/6.47  | | | | | |              simplifying with (22), (56) gives:
% 42.01/6.47  | | | | | |   (57)  all_162_2 = all_65_7
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | REDUCE: (55), (57) imply:
% 42.01/6.47  | | | | | |   (58)  $false
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | CLOSE: (58) is inconsistent.
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | Case 2:
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | |   (59)   ~ (all_162_3 = all_65_17) & host(all_65_2) = all_162_3 &
% 42.01/6.47  | | | | | |         $i(all_162_3)
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | ALPHA: (59) implies:
% 42.01/6.47  | | | | | |   (60)   ~ (all_162_3 = all_65_17)
% 42.01/6.47  | | | | | |   (61)  host(all_65_2) = all_162_3
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | GROUND_INST: instantiating (4) with all_65_17, all_162_3, all_65_2,
% 42.01/6.47  | | | | | |              simplifying with (23), (61) gives:
% 42.01/6.47  | | | | | |   (62)  all_162_3 = all_65_17
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | REDUCE: (60), (62) imply:
% 42.01/6.47  | | | | | |   (63)  $false
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | CLOSE: (63) is inconsistent.
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | End of split
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | Case 2:
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | |   (64)  (queue(all_65_7) = all_162_0 & $i(all_162_0) &  ~
% 42.01/6.47  | | | | |           elem(all_65_1, all_162_0)) | (queue(all_65_17) = all_162_1 &
% 42.01/6.47  | | | | |           $i(all_162_1) &  ~ elem(all_65_3, all_162_1))
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | | BETA: splitting (64) gives:
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | | Case 1:
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | |   (65)  queue(all_65_7) = all_162_0 & $i(all_162_0) &  ~
% 42.01/6.47  | | | | | |         elem(all_65_1, all_162_0)
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | ALPHA: (65) implies:
% 42.01/6.47  | | | | | |   (66)   ~ elem(all_65_1, all_162_0)
% 42.01/6.47  | | | | | |   (67)  queue(all_65_7) = all_162_0
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | GROUND_INST: instantiating (3) with all_65_6, all_162_0, all_65_7,
% 42.01/6.47  | | | | | |              simplifying with (19), (67) gives:
% 42.01/6.47  | | | | | |   (68)  all_162_0 = all_65_6
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | GROUND_INST: instantiating (3) with all_90_1, all_162_0, all_65_7,
% 42.01/6.47  | | | | | |              simplifying with (41), (67) gives:
% 42.01/6.47  | | | | | |   (69)  all_162_0 = all_90_1
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | COMBINE_EQS: (68), (69) imply:
% 42.01/6.47  | | | | | |   (70)  all_90_1 = all_65_6
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | REDUCE: (66), (68) imply:
% 42.01/6.47  | | | | | |   (71)   ~ elem(all_65_1, all_65_6)
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | PRED_UNIFY: (8), (71) imply:
% 42.01/6.47  | | | | | |   (72)  $false
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | CLOSE: (72) is inconsistent.
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | Case 2:
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | |   (73)  queue(all_65_17) = all_162_1 & $i(all_162_1) &  ~
% 42.01/6.47  | | | | | |         elem(all_65_3, all_162_1)
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | ALPHA: (73) implies:
% 42.01/6.47  | | | | | |   (74)   ~ elem(all_65_3, all_162_1)
% 42.01/6.47  | | | | | |   (75)  queue(all_65_17) = all_162_1
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | GROUND_INST: instantiating (3) with all_65_16, all_162_1, all_65_17,
% 42.01/6.47  | | | | | |              simplifying with (18), (75) gives:
% 42.01/6.47  | | | | | |   (76)  all_162_1 = all_65_16
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | GROUND_INST: instantiating (3) with all_88_1, all_162_1, all_65_17,
% 42.01/6.47  | | | | | |              simplifying with (48), (75) gives:
% 42.01/6.47  | | | | | |   (77)  all_162_1 = all_88_1
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | COMBINE_EQS: (76), (77) imply:
% 42.01/6.47  | | | | | |   (78)  all_88_1 = all_65_16
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | REDUCE: (74), (76) imply:
% 42.01/6.47  | | | | | |   (79)   ~ elem(all_65_3, all_65_16)
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | PRED_UNIFY: (32), (79) imply:
% 42.01/6.47  | | | | | |   (80)  $false
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | | CLOSE: (80) is inconsistent.
% 42.01/6.47  | | | | | | 
% 42.01/6.47  | | | | | End of split
% 42.01/6.47  | | | | | 
% 42.01/6.47  | | | | End of split
% 42.01/6.47  | | | | 
% 42.01/6.47  | | | End of split
% 42.01/6.47  | | | 
% 42.01/6.47  | | End of split
% 42.01/6.47  | | 
% 42.01/6.47  | End of split
% 42.01/6.47  | 
% 42.01/6.47  End of proof
% 42.01/6.47  % SZS output end Proof for theBenchmark
% 42.01/6.47  
% 42.01/6.47  5862ms
%------------------------------------------------------------------------------