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

View Problem - Process Solution

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

% Computer : n017.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 : Wed Aug 30 21:36:31 EDT 2023

% Result   : Theorem 10.38s 2.19s
% Output   : Proof 11.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR030+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n017.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 : Mon Aug 28 13:14:27 EDT 2023
% 0.13/0.35  % 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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63  Running up to 7 provers in parallel.
% 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 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 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
% 3.10/1.17  Prover 1: Preprocessing ...
% 3.10/1.17  Prover 4: Preprocessing ...
% 3.10/1.21  Prover 0: Preprocessing ...
% 3.10/1.21  Prover 5: Preprocessing ...
% 3.10/1.21  Prover 3: Preprocessing ...
% 3.10/1.21  Prover 2: Preprocessing ...
% 3.10/1.21  Prover 6: Preprocessing ...
% 5.73/1.55  Prover 5: Proving ...
% 5.73/1.55  Prover 2: Constructing countermodel ...
% 6.08/1.64  Prover 6: Proving ...
% 6.65/1.66  Prover 3: Warning: ignoring some quantifiers
% 6.93/1.68  Prover 3: Constructing countermodel ...
% 6.93/1.69  Prover 1: Warning: ignoring some quantifiers
% 6.93/1.72  Prover 1: Constructing countermodel ...
% 7.46/1.79  Prover 4: Constructing countermodel ...
% 7.46/1.79  Prover 0: Proving ...
% 9.33/2.04  Prover 3: gave up
% 9.33/2.05  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.81/2.11  Prover 1: gave up
% 9.81/2.12  Prover 7: Preprocessing ...
% 9.81/2.12  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.38/2.15  Prover 7: Constructing countermodel ...
% 10.38/2.16  Prover 8: Preprocessing ...
% 10.38/2.19  Prover 2: proved (1551ms)
% 10.38/2.19  
% 10.38/2.19  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.38/2.19  
% 10.38/2.20  Prover 6: proved (1549ms)
% 10.38/2.20  
% 10.38/2.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.38/2.20  
% 10.38/2.20  Prover 5: stopped
% 10.38/2.20  Prover 0: stopped
% 10.38/2.20  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 10.38/2.20  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 10.38/2.20  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 10.38/2.20  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 10.98/2.24  Prover 10: Preprocessing ...
% 10.98/2.26  Prover 16: Preprocessing ...
% 10.98/2.26  Prover 13: Preprocessing ...
% 11.36/2.28  Prover 10: Constructing countermodel ...
% 11.36/2.28  Prover 11: Preprocessing ...
% 11.36/2.29  Prover 4: Found proof (size 36)
% 11.36/2.29  Prover 4: proved (1644ms)
% 11.36/2.29  Prover 7: stopped
% 11.36/2.29  Prover 10: stopped
% 11.36/2.29  Prover 13: stopped
% 11.36/2.30  Prover 16: stopped
% 11.36/2.31  Prover 8: Warning: ignoring some quantifiers
% 11.36/2.32  Prover 8: Constructing countermodel ...
% 11.36/2.33  Prover 8: stopped
% 11.36/2.33  Prover 11: stopped
% 11.36/2.33  
% 11.36/2.33  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.36/2.33  
% 11.36/2.34  % SZS output start Proof for theBenchmark
% 11.36/2.34  Assumptions after simplification:
% 11.36/2.34  ---------------------------------
% 11.36/2.34  
% 11.36/2.34    (just10)
% 11.81/2.37    genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = 0 & $i(c_tptp_spindleheadmt) &
% 11.81/2.37    $i(c_cyclistsmt)
% 11.81/2.37  
% 11.81/2.37    (just11)
% 11.81/2.37    genlmt(c_tptp_member3393_mt, c_tptp_spindleheadmt) = 0 &
% 11.81/2.37    $i(c_tptp_member3393_mt) & $i(c_tptp_spindleheadmt)
% 11.81/2.37  
% 11.81/2.37    (just12)
% 11.94/2.37    $i(c_tptpcol_16_4451) & $i(c_pushingwithopenhand) & $i(c_tptp_spindleheadmt) &
% 11.94/2.37     ? [v0: any] :  ? [v1: any] : (mtvisible(c_tptp_spindleheadmt) = v0 &
% 11.94/2.37      tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) = v1 & ( ~ (v0 =
% 11.94/2.37          0) | v1 = 0))
% 11.94/2.37  
% 11.94/2.37    (just21)
% 11.94/2.37    $i(c_tptpcol_16_4451) &  ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (isa(v0,
% 11.94/2.37          c_tptpcol_16_4451) = v1) |  ~ $i(v0) |  ? [v2: int] : ( ~ (v2 = 0) &
% 11.94/2.37        tptpcol_16_4451(v0) = v2)) &  ! [v0: $i] : ( ~ (tptpcol_16_4451(v0) = 0) |
% 11.94/2.37       ~ $i(v0) | isa(v0, c_tptpcol_16_4451) = 0)
% 11.94/2.37  
% 11.94/2.37    (just49)
% 11.94/2.38     ! [v0: $i] :  ! [v1: $i] : ( ~ (genlmt(v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0) |
% 11.94/2.38       ? [v2: any] :  ? [v3: any] : (mtvisible(v1) = v3 & mtvisible(v0) = v2 & ( ~
% 11.94/2.38          (v2 = 0) | v3 = 0)))
% 11.94/2.38  
% 11.94/2.38    (just7)
% 11.94/2.38     ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] : (v2 = 0 |  ~ (tptptypes_5_387(v0,
% 11.94/2.38          v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int] : ( ~ (v3 = 0) &
% 11.94/2.38        tptptypes_6_388(v0, v1) = v3)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 11.94/2.38      (tptptypes_6_388(v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0) | tptptypes_5_387(v0,
% 11.94/2.38        v1) = 0)
% 11.94/2.38  
% 11.94/2.38    (just9)
% 11.94/2.38     ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] : (v2 = 0 |  ~ (tptptypes_6_388(v1,
% 11.94/2.38          v0) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int] : ( ~ (v3 = 0) &
% 11.94/2.38        tptptypes_7_389(v0, v1) = v3)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 11.94/2.38      (tptptypes_7_389(v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0) | tptptypes_6_388(v1,
% 11.94/2.38        v0) = 0)
% 11.94/2.38  
% 11.94/2.38    (query30)
% 11.94/2.38    mtvisible(c_tptp_member3393_mt) = 0 & $i(c_pushingwithopenhand) &
% 11.94/2.38    $i(c_tptp_member3393_mt) &  ! [v0: $i] : ( ~ (tptptypes_5_387(v0,
% 11.94/2.38          c_pushingwithopenhand) = 0) |  ~ $i(v0))
% 11.94/2.38  
% 11.94/2.38    (function-axioms)
% 11.94/2.39     ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  !
% 11.94/2.39    [v3: $i] : (v1 = v0 |  ~ (genls(v3, v2) = v1) |  ~ (genls(v3, v2) = v0)) &  !
% 11.94/2.39    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 11.94/2.39      $i] : (v1 = v0 |  ~ (disjointwith(v3, v2) = v1) |  ~ (disjointwith(v3, v2) =
% 11.94/2.39        v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 11.94/2.39      $i] :  ! [v3: $i] : (v1 = v0 |  ~ (isa(v3, v2) = v1) |  ~ (isa(v3, v2) =
% 11.94/2.39        v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 11.94/2.39      $i] :  ! [v3: $i] : (v1 = v0 |  ~ (tptptypes_7_389(v3, v2) = v1) |  ~
% 11.94/2.39      (tptptypes_7_389(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 11.94/2.39      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 11.94/2.39      (genlinverse(v3, v2) = v1) |  ~ (genlinverse(v3, v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 11.94/2.39    : (v1 = v0 |  ~ (tptptypes_5_387(v3, v2) = v1) |  ~ (tptptypes_5_387(v3, v2) =
% 11.94/2.39        v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 11.94/2.39      $i] :  ! [v3: $i] : (v1 = v0 |  ~ (tptptypes_6_388(v3, v2) = v1) |  ~
% 11.94/2.39      (tptptypes_6_388(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 11.94/2.39      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 11.94/2.39      (genlpreds(v3, v2) = v1) |  ~ (genlpreds(v3, v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 11.94/2.39    : (v1 = v0 |  ~ (genlmt(v3, v2) = v1) |  ~ (genlmt(v3, v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 11.94/2.39      ~ (microtheory(v2) = v1) |  ~ (microtheory(v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 11.94/2.39      ~ (thing(v2) = v1) |  ~ (thing(v2) = v0)) &  ! [v0: MultipleValueBool] :  !
% 11.94/2.39    [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (predicate(v2) = v1) | 
% 11.94/2.39      ~ (predicate(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 11.94/2.39      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (binarypredicate(v2) = v1)
% 11.94/2.39      |  ~ (binarypredicate(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 11.94/2.39      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (firstordercollection(v2) =
% 11.94/2.39        v1) |  ~ (firstordercollection(v2) = v0)) &  ! [v0: MultipleValueBool] : 
% 11.94/2.39    ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~
% 11.94/2.39      (pushingwithopenhand(v2) = v1) |  ~ (pushingwithopenhand(v2) = v0)) &  !
% 11.94/2.39    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0
% 11.94/2.39      |  ~ (tptpcol_16_4451(v2) = v1) |  ~ (tptpcol_16_4451(v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 11.94/2.39      ~ (collection(v2) = v1) |  ~ (collection(v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 11.94/2.39      ~ (mtvisible(v2) = v1) |  ~ (mtvisible(v2) = v0)) &  ! [v0:
% 11.94/2.39      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 11.94/2.39      ~ (transitivebinarypredicate(v2) = v1) |  ~ (transitivebinarypredicate(v2) =
% 11.94/2.39        v0))
% 11.94/2.39  
% 11.94/2.39  Further assumptions not needed in the proof:
% 11.94/2.39  --------------------------------------------
% 11.94/2.39  just1, just13, just14, just15, just16, just17, just18, just19, just2, just20,
% 11.94/2.39  just22, just23, just24, just25, just26, just27, just28, just29, just3, just30,
% 11.94/2.39  just31, just32, just33, just34, just35, just36, just37, just38, just39, just4,
% 11.94/2.39  just40, just41, just42, just43, just44, just45, just46, just47, just48, just5,
% 11.94/2.39  just50, just51, just52, just53, just54, just55, just56, just57, just6, just8
% 11.94/2.39  
% 11.94/2.39  Those formulas are unsatisfiable:
% 11.94/2.39  ---------------------------------
% 11.94/2.39  
% 11.94/2.39  Begin of proof
% 11.94/2.39  | 
% 11.94/2.39  | ALPHA: (just7) implies:
% 11.94/2.40  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (tptptypes_6_388(v0, v1) = 0) |  ~
% 11.94/2.40  |          $i(v1) |  ~ $i(v0) | tptptypes_5_387(v0, v1) = 0)
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (just9) implies:
% 11.94/2.40  |   (2)   ! [v0: $i] :  ! [v1: $i] : ( ~ (tptptypes_7_389(v0, v1) = 0) |  ~
% 11.94/2.40  |          $i(v1) |  ~ $i(v0) | tptptypes_6_388(v1, v0) = 0)
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (just10) implies:
% 11.94/2.40  |   (3)  $i(c_cyclistsmt)
% 11.94/2.40  |   (4)  genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = 0
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (just11) implies:
% 11.94/2.40  |   (5)  genlmt(c_tptp_member3393_mt, c_tptp_spindleheadmt) = 0
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (just12) implies:
% 11.94/2.40  |   (6)  $i(c_tptp_spindleheadmt)
% 11.94/2.40  |   (7)   ? [v0: any] :  ? [v1: any] : (mtvisible(c_tptp_spindleheadmt) = v0 &
% 11.94/2.40  |          tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) = v1 & ( ~
% 11.94/2.40  |            (v0 = 0) | v1 = 0))
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (just21) implies:
% 11.94/2.40  |   (8)  $i(c_tptpcol_16_4451)
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (query30) implies:
% 11.94/2.40  |   (9)  $i(c_tptp_member3393_mt)
% 11.94/2.40  |   (10)  $i(c_pushingwithopenhand)
% 11.94/2.40  |   (11)  mtvisible(c_tptp_member3393_mt) = 0
% 11.94/2.40  |   (12)   ! [v0: $i] : ( ~ (tptptypes_5_387(v0, c_pushingwithopenhand) = 0) | 
% 11.94/2.40  |           ~ $i(v0))
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (function-axioms) implies:
% 11.94/2.40  |   (13)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i]
% 11.94/2.40  |         : (v1 = v0 |  ~ (mtvisible(v2) = v1) |  ~ (mtvisible(v2) = v0))
% 11.94/2.40  | 
% 11.94/2.40  | DELTA: instantiating (7) with fresh symbols all_50_0, all_50_1 gives:
% 11.94/2.40  |   (14)  mtvisible(c_tptp_spindleheadmt) = all_50_1 &
% 11.94/2.40  |         tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) = all_50_0 &
% 11.94/2.40  |         ( ~ (all_50_1 = 0) | all_50_0 = 0)
% 11.94/2.40  | 
% 11.94/2.40  | ALPHA: (14) implies:
% 11.94/2.40  |   (15)  tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) = all_50_0
% 11.94/2.40  |   (16)  mtvisible(c_tptp_spindleheadmt) = all_50_1
% 11.94/2.40  |   (17)   ~ (all_50_1 = 0) | all_50_0 = 0
% 11.94/2.40  | 
% 11.94/2.40  | GROUND_INST: instantiating (just49) with c_tptp_spindleheadmt, c_cyclistsmt,
% 11.94/2.40  |              simplifying with (3), (4), (6) gives:
% 11.94/2.40  |   (18)   ? [v0: any] :  ? [v1: any] : (mtvisible(c_tptp_spindleheadmt) = v0 &
% 11.94/2.40  |           mtvisible(c_cyclistsmt) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 11.94/2.40  | 
% 11.94/2.40  | GROUND_INST: instantiating (just49) with c_tptp_member3393_mt,
% 11.94/2.40  |              c_tptp_spindleheadmt, simplifying with (5), (6), (9) gives:
% 11.94/2.41  |   (19)   ? [v0: any] :  ? [v1: any] : (mtvisible(c_tptp_member3393_mt) = v0 &
% 11.94/2.41  |           mtvisible(c_tptp_spindleheadmt) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 11.94/2.41  | 
% 11.94/2.41  | DELTA: instantiating (19) with fresh symbols all_62_0, all_62_1 gives:
% 11.94/2.41  |   (20)  mtvisible(c_tptp_member3393_mt) = all_62_1 &
% 11.94/2.41  |         mtvisible(c_tptp_spindleheadmt) = all_62_0 & ( ~ (all_62_1 = 0) |
% 11.94/2.41  |           all_62_0 = 0)
% 11.94/2.41  | 
% 11.94/2.41  | ALPHA: (20) implies:
% 11.94/2.41  |   (21)  mtvisible(c_tptp_spindleheadmt) = all_62_0
% 11.94/2.41  |   (22)  mtvisible(c_tptp_member3393_mt) = all_62_1
% 11.94/2.41  |   (23)   ~ (all_62_1 = 0) | all_62_0 = 0
% 11.94/2.41  | 
% 11.94/2.41  | DELTA: instantiating (18) with fresh symbols all_64_0, all_64_1 gives:
% 11.94/2.41  |   (24)  mtvisible(c_tptp_spindleheadmt) = all_64_1 & mtvisible(c_cyclistsmt) =
% 11.94/2.41  |         all_64_0 & ( ~ (all_64_1 = 0) | all_64_0 = 0)
% 11.94/2.41  | 
% 11.94/2.41  | ALPHA: (24) implies:
% 11.94/2.41  |   (25)  mtvisible(c_tptp_spindleheadmt) = all_64_1
% 11.94/2.41  | 
% 11.94/2.41  | GROUND_INST: instantiating (13) with all_50_1, all_64_1, c_tptp_spindleheadmt,
% 11.94/2.41  |              simplifying with (16), (25) gives:
% 11.94/2.41  |   (26)  all_64_1 = all_50_1
% 11.94/2.41  | 
% 11.94/2.41  | GROUND_INST: instantiating (13) with all_62_0, all_64_1, c_tptp_spindleheadmt,
% 11.94/2.41  |              simplifying with (21), (25) gives:
% 11.94/2.41  |   (27)  all_64_1 = all_62_0
% 11.94/2.41  | 
% 11.94/2.41  | GROUND_INST: instantiating (13) with 0, all_62_1, c_tptp_member3393_mt,
% 11.94/2.41  |              simplifying with (11), (22) gives:
% 11.94/2.41  |   (28)  all_62_1 = 0
% 11.94/2.41  | 
% 11.94/2.41  | COMBINE_EQS: (26), (27) imply:
% 11.94/2.41  |   (29)  all_62_0 = all_50_1
% 11.94/2.41  | 
% 11.94/2.41  | SIMP: (29) implies:
% 11.94/2.41  |   (30)  all_62_0 = all_50_1
% 11.94/2.41  | 
% 11.94/2.41  | BETA: splitting (23) gives:
% 11.94/2.41  | 
% 11.94/2.41  | Case 1:
% 11.94/2.41  | | 
% 11.94/2.41  | |   (31)   ~ (all_62_1 = 0)
% 11.94/2.41  | | 
% 11.94/2.41  | | REDUCE: (28), (31) imply:
% 11.94/2.41  | |   (32)  $false
% 11.94/2.41  | | 
% 11.94/2.41  | | CLOSE: (32) is inconsistent.
% 11.94/2.41  | | 
% 11.94/2.41  | Case 2:
% 11.94/2.41  | | 
% 11.94/2.41  | |   (33)  all_62_0 = 0
% 11.94/2.41  | | 
% 11.94/2.41  | | COMBINE_EQS: (30), (33) imply:
% 11.94/2.41  | |   (34)  all_50_1 = 0
% 11.94/2.41  | | 
% 11.94/2.41  | | SIMP: (34) implies:
% 11.94/2.41  | |   (35)  all_50_1 = 0
% 11.94/2.41  | | 
% 11.94/2.41  | | BETA: splitting (17) gives:
% 11.94/2.41  | | 
% 11.94/2.41  | | Case 1:
% 11.94/2.41  | | | 
% 11.94/2.41  | | |   (36)   ~ (all_50_1 = 0)
% 11.94/2.41  | | | 
% 11.94/2.41  | | | REDUCE: (35), (36) imply:
% 11.94/2.41  | | |   (37)  $false
% 11.94/2.41  | | | 
% 11.94/2.41  | | | CLOSE: (37) is inconsistent.
% 11.94/2.41  | | | 
% 11.94/2.41  | | Case 2:
% 11.94/2.41  | | | 
% 11.94/2.41  | | |   (38)  all_50_0 = 0
% 11.94/2.41  | | | 
% 11.94/2.41  | | | REDUCE: (15), (38) imply:
% 11.94/2.41  | | |   (39)  tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) = 0
% 11.94/2.41  | | | 
% 11.94/2.41  | | | GROUND_INST: instantiating (2) with c_pushingwithopenhand,
% 11.94/2.41  | | |              c_tptpcol_16_4451, simplifying with (8), (10), (39) gives:
% 11.94/2.41  | | |   (40)  tptptypes_6_388(c_tptpcol_16_4451, c_pushingwithopenhand) = 0
% 11.94/2.41  | | | 
% 11.94/2.41  | | | GROUND_INST: instantiating (1) with c_tptpcol_16_4451,
% 11.94/2.41  | | |              c_pushingwithopenhand, simplifying with (8), (10), (40)
% 11.94/2.41  | | |              gives:
% 11.94/2.41  | | |   (41)  tptptypes_5_387(c_tptpcol_16_4451, c_pushingwithopenhand) = 0
% 11.94/2.41  | | | 
% 11.94/2.41  | | | GROUND_INST: instantiating (12) with c_tptpcol_16_4451, simplifying with
% 11.94/2.41  | | |              (8), (41) gives:
% 11.94/2.41  | | |   (42)  $false
% 11.94/2.41  | | | 
% 11.94/2.41  | | | CLOSE: (42) is inconsistent.
% 11.94/2.41  | | | 
% 11.94/2.41  | | End of split
% 11.94/2.41  | | 
% 11.94/2.41  | End of split
% 11.94/2.41  | 
% 11.94/2.41  End of proof
% 11.94/2.41  % SZS output end Proof for theBenchmark
% 11.94/2.42  
% 11.94/2.42  1794ms
%------------------------------------------------------------------------------