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

View Problem - Process Solution

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

% Computer : n003.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 09:16:27 EDT 2023

% Result   : Theorem 8.02s 1.90s
% Output   : Proof 10.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Aug 28 06:31:10 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.18/0.63  ________       _____
% 0.18/0.63  ___  __ \_________(_)________________________________
% 0.18/0.63  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.18/0.63  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.18/0.63  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.18/0.63  
% 0.18/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.63  (2023-06-19)
% 0.18/0.63  
% 0.18/0.63  (c) Philipp Rümmer, 2009-2023
% 0.18/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.63                Amanda Stjerna.
% 0.18/0.63  Free software under BSD-3-Clause.
% 0.18/0.63  
% 0.18/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.63  
% 0.18/0.63  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.64  Running up to 7 provers in parallel.
% 0.18/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.66  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.66  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.66  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.66  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.66  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.66  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.45/1.10  Prover 4: Preprocessing ...
% 2.45/1.10  Prover 1: Preprocessing ...
% 2.69/1.16  Prover 6: Preprocessing ...
% 2.69/1.16  Prover 3: Preprocessing ...
% 2.69/1.16  Prover 0: Preprocessing ...
% 2.69/1.16  Prover 2: Preprocessing ...
% 2.69/1.17  Prover 5: Preprocessing ...
% 3.81/1.50  Prover 6: Constructing countermodel ...
% 3.81/1.52  Prover 2: Proving ...
% 3.81/1.53  Prover 3: Constructing countermodel ...
% 3.81/1.54  Prover 5: Proving ...
% 3.81/1.55  Prover 1: Constructing countermodel ...
% 6.06/1.63  Prover 4: Constructing countermodel ...
% 6.06/1.64  Prover 0: Proving ...
% 6.55/1.70  Prover 3: gave up
% 6.55/1.70  Prover 1: gave up
% 6.55/1.71  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.55/1.71  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.55/1.76  Prover 6: gave up
% 6.55/1.76  Prover 7: Preprocessing ...
% 7.11/1.77  Prover 8: Preprocessing ...
% 7.11/1.78  Prover 9: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 7.11/1.83  Prover 9: Preprocessing ...
% 7.83/1.88  Prover 8: Warning: ignoring some quantifiers
% 7.83/1.88  Prover 8: Constructing countermodel ...
% 7.83/1.88  Prover 7: Warning: ignoring some quantifiers
% 8.02/1.90  Prover 2: proved (1241ms)
% 8.02/1.90  
% 8.02/1.90  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.02/1.90  
% 8.02/1.90  Prover 5: stopped
% 8.02/1.90  Prover 0: stopped
% 8.02/1.90  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.02/1.90  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.02/1.91  Prover 7: Constructing countermodel ...
% 8.02/1.91  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 8.16/1.93  Prover 4: gave up
% 8.16/1.95  Prover 11: Preprocessing ...
% 8.16/1.95  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 8.16/1.96  Prover 13: Preprocessing ...
% 8.16/1.96  Prover 10: Preprocessing ...
% 8.16/1.98  Prover 16: Preprocessing ...
% 8.16/1.99  Prover 8: gave up
% 8.16/1.99  Prover 19: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 8.16/2.01  Prover 9: Constructing countermodel ...
% 8.16/2.02  Prover 19: Preprocessing ...
% 8.16/2.02  Prover 9: stopped
% 8.86/2.02  Prover 10: Warning: ignoring some quantifiers
% 8.86/2.03  Prover 10: Constructing countermodel ...
% 8.86/2.04  Prover 13: Warning: ignoring some quantifiers
% 8.86/2.04  Prover 13: Constructing countermodel ...
% 8.86/2.06  Prover 16: Warning: ignoring some quantifiers
% 8.86/2.08  Prover 16: Constructing countermodel ...
% 9.43/2.16  Prover 11: Constructing countermodel ...
% 9.43/2.17  Prover 19: Warning: ignoring some quantifiers
% 9.43/2.19  Prover 19: Constructing countermodel ...
% 9.43/2.21  Prover 10: Found proof (size 26)
% 9.43/2.21  Prover 10: proved (308ms)
% 9.43/2.21  Prover 7: stopped
% 9.43/2.21  Prover 16: stopped
% 9.43/2.21  Prover 11: stopped
% 9.43/2.22  Prover 19: stopped
% 9.43/2.22  Prover 13: stopped
% 9.43/2.22  
% 9.43/2.22  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.43/2.22  
% 9.43/2.23  % SZS output start Proof for theBenchmark
% 9.43/2.23  Assumptions after simplification:
% 9.43/2.23  ---------------------------------
% 9.43/2.23  
% 9.43/2.23    (assumption_11)
% 9.43/2.27     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : (v4 = v3
% 9.43/2.27      |  ~ (external_ties(v0, v2) = v3) |  ~ (external_ties(v0, v1) = v4) |  ~
% 9.43/2.27      $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ organization(v0))
% 9.43/2.27  
% 9.43/2.27    (assumption_6)
% 9.43/2.27     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : ( ~
% 9.43/2.27      (position(v0, v2) = v3) |  ~ (position(v0, v1) = v4) |  ~ $i(v2) |  ~ $i(v1)
% 9.43/2.27      |  ~ $i(v0) |  ~ organization(v0) |  ? [v5: $i] :  ? [v6: $i] : ((v4 = v3 |
% 9.43/2.27          ( ~ (v6 = v5) & external_ties(v0, v2) = v5 & external_ties(v0, v1) = v6
% 9.43/2.28            & $i(v6) & $i(v5))) & (greater(v3, v4) | (external_ties(v0, v2) = v5 &
% 9.43/2.28            external_ties(v0, v1) = v6 & $i(v6) & $i(v5) &  ~ greater(v5, v6)))))
% 9.43/2.28  
% 9.43/2.28    (lemma_6)
% 9.43/2.28     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 9.43/2.28      $i] :  ? [v6: $i] : ( ~ (v6 = v5) & age(v0, v2) = v3 & age(v0, v1) = v4 &
% 9.43/2.28      position(v0, v2) = v5 & position(v0, v1) = v6 & $i(v6) & $i(v5) & $i(v4) &
% 9.43/2.28      $i(v3) & $i(v2) & $i(v1) & $i(v0) & organization(v0) & greater(v3, v4))
% 9.43/2.28  
% 9.43/2.28    (function-axioms)
% 9.43/2.28     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (age(v3,
% 9.43/2.28          v2) = v1) |  ~ (age(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2:
% 9.43/2.28      $i] :  ! [v3: $i] : (v1 = v0 |  ~ (position(v3, v2) = v1) |  ~ (position(v3,
% 9.43/2.28          v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1
% 9.43/2.28      = v0 |  ~ (external_ties(v3, v2) = v1) |  ~ (external_ties(v3, v2) = v0))
% 9.43/2.28  
% 9.43/2.28  Further assumptions not needed in the proof:
% 9.43/2.28  --------------------------------------------
% 9.43/2.28  definition_greater_or_equal, definition_smaller, definition_smaller_or_equal,
% 9.43/2.28  meaning_postulate_greater_comparable, meaning_postulate_greater_strict,
% 9.43/2.28  meaning_postulate_greater_transitive
% 9.43/2.28  
% 9.43/2.28  Those formulas are unsatisfiable:
% 9.43/2.28  ---------------------------------
% 9.43/2.28  
% 9.43/2.28  Begin of proof
% 9.43/2.29  | 
% 9.43/2.29  | ALPHA: (function-axioms) implies:
% 9.43/2.29  |   (1)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 9.43/2.29  |          (external_ties(v3, v2) = v1) |  ~ (external_ties(v3, v2) = v0))
% 9.43/2.29  | 
% 9.43/2.29  | DELTA: instantiating (lemma_6) with fresh symbols all_13_0, all_13_1,
% 9.43/2.29  |        all_13_2, all_13_3, all_13_4, all_13_5, all_13_6 gives:
% 9.43/2.29  |   (2)   ~ (all_13_0 = all_13_1) & age(all_13_6, all_13_4) = all_13_3 &
% 9.43/2.29  |        age(all_13_6, all_13_5) = all_13_2 & position(all_13_6, all_13_4) =
% 9.43/2.29  |        all_13_1 & position(all_13_6, all_13_5) = all_13_0 & $i(all_13_0) &
% 9.43/2.29  |        $i(all_13_1) & $i(all_13_2) & $i(all_13_3) & $i(all_13_4) &
% 9.43/2.29  |        $i(all_13_5) & $i(all_13_6) & organization(all_13_6) &
% 9.43/2.29  |        greater(all_13_3, all_13_2)
% 9.43/2.29  | 
% 9.43/2.29  | ALPHA: (2) implies:
% 9.43/2.30  |   (3)   ~ (all_13_0 = all_13_1)
% 9.43/2.30  |   (4)  organization(all_13_6)
% 9.43/2.30  |   (5)  $i(all_13_6)
% 9.43/2.30  |   (6)  $i(all_13_5)
% 9.43/2.30  |   (7)  $i(all_13_4)
% 9.43/2.30  |   (8)  position(all_13_6, all_13_5) = all_13_0
% 9.43/2.30  |   (9)  position(all_13_6, all_13_4) = all_13_1
% 9.43/2.30  | 
% 9.43/2.30  | GROUND_INST: instantiating (assumption_6) with all_13_6, all_13_5, all_13_4,
% 9.43/2.30  |              all_13_1, all_13_0, simplifying with (4), (5), (6), (7), (8), (9)
% 9.43/2.30  |              gives:
% 10.30/2.30  |   (10)   ? [v0: $i] :  ? [v1: $i] : ((all_13_0 = all_13_1 | ( ~ (v1 = v0) &
% 10.30/2.30  |               external_ties(all_13_6, all_13_4) = v0 & external_ties(all_13_6,
% 10.30/2.30  |                 all_13_5) = v1 & $i(v1) & $i(v0))) & (greater(all_13_1,
% 10.30/2.30  |               all_13_0) | (external_ties(all_13_6, all_13_4) = v0 &
% 10.30/2.30  |               external_ties(all_13_6, all_13_5) = v1 & $i(v1) & $i(v0) &  ~
% 10.30/2.30  |               greater(v0, v1))))
% 10.30/2.30  | 
% 10.30/2.30  | GROUND_INST: instantiating (assumption_6) with all_13_6, all_13_4, all_13_5,
% 10.30/2.30  |              all_13_0, all_13_1, simplifying with (4), (5), (6), (7), (8), (9)
% 10.30/2.30  |              gives:
% 10.30/2.31  |   (11)   ? [v0: $i] :  ? [v1: $i] : ((all_13_0 = all_13_1 | ( ~ (v1 = v0) &
% 10.30/2.31  |               external_ties(all_13_6, all_13_4) = v1 & external_ties(all_13_6,
% 10.30/2.31  |                 all_13_5) = v0 & $i(v1) & $i(v0))) & (greater(all_13_0,
% 10.30/2.31  |               all_13_1) | (external_ties(all_13_6, all_13_4) = v1 &
% 10.30/2.31  |               external_ties(all_13_6, all_13_5) = v0 & $i(v1) & $i(v0) &  ~
% 10.30/2.31  |               greater(v0, v1))))
% 10.30/2.31  | 
% 10.30/2.31  | DELTA: instantiating (11) with fresh symbols all_23_0, all_23_1 gives:
% 10.30/2.31  |   (12)  (all_13_0 = all_13_1 | ( ~ (all_23_0 = all_23_1) &
% 10.30/2.31  |             external_ties(all_13_6, all_13_4) = all_23_0 &
% 10.30/2.31  |             external_ties(all_13_6, all_13_5) = all_23_1 & $i(all_23_0) &
% 10.30/2.31  |             $i(all_23_1))) & (greater(all_13_0, all_13_1) |
% 10.30/2.31  |           (external_ties(all_13_6, all_13_4) = all_23_0 &
% 10.30/2.31  |             external_ties(all_13_6, all_13_5) = all_23_1 & $i(all_23_0) &
% 10.30/2.31  |             $i(all_23_1) &  ~ greater(all_23_1, all_23_0)))
% 10.30/2.31  | 
% 10.30/2.31  | ALPHA: (12) implies:
% 10.30/2.31  |   (13)  all_13_0 = all_13_1 | ( ~ (all_23_0 = all_23_1) &
% 10.30/2.31  |           external_ties(all_13_6, all_13_4) = all_23_0 &
% 10.30/2.31  |           external_ties(all_13_6, all_13_5) = all_23_1 & $i(all_23_0) &
% 10.30/2.31  |           $i(all_23_1))
% 10.30/2.31  | 
% 10.30/2.31  | DELTA: instantiating (10) with fresh symbols all_24_0, all_24_1 gives:
% 10.30/2.31  |   (14)  (all_13_0 = all_13_1 | ( ~ (all_24_0 = all_24_1) &
% 10.30/2.31  |             external_ties(all_13_6, all_13_4) = all_24_1 &
% 10.30/2.31  |             external_ties(all_13_6, all_13_5) = all_24_0 & $i(all_24_0) &
% 10.30/2.31  |             $i(all_24_1))) & (greater(all_13_1, all_13_0) |
% 10.30/2.31  |           (external_ties(all_13_6, all_13_4) = all_24_1 &
% 10.30/2.31  |             external_ties(all_13_6, all_13_5) = all_24_0 & $i(all_24_0) &
% 10.30/2.31  |             $i(all_24_1) &  ~ greater(all_24_1, all_24_0)))
% 10.30/2.31  | 
% 10.30/2.31  | ALPHA: (14) implies:
% 10.30/2.31  |   (15)  all_13_0 = all_13_1 | ( ~ (all_24_0 = all_24_1) &
% 10.30/2.31  |           external_ties(all_13_6, all_13_4) = all_24_1 &
% 10.30/2.31  |           external_ties(all_13_6, all_13_5) = all_24_0 & $i(all_24_0) &
% 10.30/2.31  |           $i(all_24_1))
% 10.30/2.31  | 
% 10.30/2.31  | BETA: splitting (15) gives:
% 10.30/2.31  | 
% 10.30/2.31  | Case 1:
% 10.30/2.31  | | 
% 10.30/2.32  | |   (16)  all_13_0 = all_13_1
% 10.30/2.32  | | 
% 10.30/2.32  | | REDUCE: (3), (16) imply:
% 10.30/2.32  | |   (17)  $false
% 10.30/2.32  | | 
% 10.30/2.32  | | CLOSE: (17) is inconsistent.
% 10.30/2.32  | | 
% 10.30/2.32  | Case 2:
% 10.30/2.32  | | 
% 10.30/2.32  | |   (18)   ~ (all_24_0 = all_24_1) & external_ties(all_13_6, all_13_4) =
% 10.30/2.32  | |         all_24_1 & external_ties(all_13_6, all_13_5) = all_24_0 &
% 10.30/2.32  | |         $i(all_24_0) & $i(all_24_1)
% 10.30/2.32  | | 
% 10.30/2.32  | | ALPHA: (18) implies:
% 10.30/2.32  | |   (19)   ~ (all_24_0 = all_24_1)
% 10.30/2.32  | |   (20)  external_ties(all_13_6, all_13_5) = all_24_0
% 10.30/2.32  | |   (21)  external_ties(all_13_6, all_13_4) = all_24_1
% 10.30/2.32  | | 
% 10.30/2.32  | | BETA: splitting (13) gives:
% 10.30/2.32  | | 
% 10.30/2.32  | | Case 1:
% 10.30/2.32  | | | 
% 10.30/2.32  | | |   (22)  all_13_0 = all_13_1
% 10.30/2.32  | | | 
% 10.30/2.32  | | | REDUCE: (3), (22) imply:
% 10.30/2.32  | | |   (23)  $false
% 10.30/2.32  | | | 
% 10.30/2.32  | | | CLOSE: (23) is inconsistent.
% 10.30/2.32  | | | 
% 10.30/2.32  | | Case 2:
% 10.30/2.32  | | | 
% 10.30/2.32  | | |   (24)   ~ (all_23_0 = all_23_1) & external_ties(all_13_6, all_13_4) =
% 10.30/2.32  | | |         all_23_0 & external_ties(all_13_6, all_13_5) = all_23_1 &
% 10.30/2.32  | | |         $i(all_23_0) & $i(all_23_1)
% 10.30/2.32  | | | 
% 10.30/2.32  | | | ALPHA: (24) implies:
% 10.30/2.32  | | |   (25)  external_ties(all_13_6, all_13_5) = all_23_1
% 10.30/2.32  | | |   (26)  external_ties(all_13_6, all_13_4) = all_23_0
% 10.30/2.32  | | | 
% 10.30/2.32  | | | GROUND_INST: instantiating (1) with all_23_1, all_24_0, all_13_5,
% 10.30/2.32  | | |              all_13_6, simplifying with (20), (25) gives:
% 10.30/2.32  | | |   (27)  all_24_0 = all_23_1
% 10.30/2.32  | | | 
% 10.30/2.32  | | | GROUND_INST: instantiating (1) with all_23_0, all_24_1, all_13_4,
% 10.30/2.32  | | |              all_13_6, simplifying with (21), (26) gives:
% 10.30/2.32  | | |   (28)  all_24_1 = all_23_0
% 10.30/2.32  | | | 
% 10.30/2.32  | | | REDUCE: (19), (27), (28) imply:
% 10.30/2.32  | | |   (29)   ~ (all_23_0 = all_23_1)
% 10.30/2.32  | | | 
% 10.30/2.32  | | | SIMP: (29) implies:
% 10.30/2.32  | | |   (30)   ~ (all_23_0 = all_23_1)
% 10.30/2.32  | | | 
% 10.30/2.33  | | | GROUND_INST: instantiating (assumption_11) with all_13_6, all_13_5,
% 10.30/2.33  | | |              all_13_4, all_23_0, all_23_1, simplifying with (4), (5), (6),
% 10.30/2.33  | | |              (7), (25), (26) gives:
% 10.30/2.33  | | |   (31)  all_23_0 = all_23_1
% 10.30/2.33  | | | 
% 10.30/2.33  | | | REDUCE: (30), (31) imply:
% 10.30/2.33  | | |   (32)  $false
% 10.30/2.33  | | | 
% 10.30/2.33  | | | CLOSE: (32) is inconsistent.
% 10.30/2.33  | | | 
% 10.30/2.33  | | End of split
% 10.30/2.33  | | 
% 10.30/2.33  | End of split
% 10.30/2.33  | 
% 10.30/2.33  End of proof
% 10.30/2.33  % SZS output end Proof for theBenchmark
% 10.30/2.33  
% 10.30/2.33  1698ms
%------------------------------------------------------------------------------