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

View Problem - Process Solution

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

% Computer : n025.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 15:27:05 EDT 2023

% Result   : Theorem 4.56s 1.41s
% Output   : Proof 6.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n025.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 : Sat Aug 26 13:42:08 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.19/0.62  ________       _____
% 0.19/0.62  ___  __ \_________(_)________________________________
% 0.19/0.62  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.62  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.62  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.62  
% 0.19/0.62  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.62  (2023-06-19)
% 0.19/0.62  
% 0.19/0.62  (c) Philipp Rümmer, 2009-2023
% 0.19/0.62  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.62                Amanda Stjerna.
% 0.19/0.62  Free software under BSD-3-Clause.
% 0.19/0.62  
% 0.19/0.62  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.62  
% 0.19/0.62  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.63  Running up to 7 provers in parallel.
% 0.19/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.19/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.89/0.98  Prover 4: Preprocessing ...
% 1.89/0.98  Prover 1: Preprocessing ...
% 1.89/1.03  Prover 5: Preprocessing ...
% 1.89/1.03  Prover 2: Preprocessing ...
% 1.89/1.03  Prover 3: Preprocessing ...
% 1.89/1.03  Prover 6: Preprocessing ...
% 1.89/1.03  Prover 0: Preprocessing ...
% 3.64/1.22  Prover 2: Proving ...
% 3.64/1.22  Prover 5: Proving ...
% 3.64/1.22  Prover 6: Constructing countermodel ...
% 3.64/1.23  Prover 1: Constructing countermodel ...
% 3.88/1.23  Prover 3: Constructing countermodel ...
% 3.88/1.24  Prover 4: Constructing countermodel ...
% 3.88/1.27  Prover 0: Proving ...
% 4.56/1.41  Prover 6: proved (768ms)
% 4.56/1.41  
% 4.56/1.41  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.56/1.41  
% 4.56/1.41  Prover 3: proved (774ms)
% 4.56/1.42  
% 4.56/1.42  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.56/1.42  
% 4.56/1.43  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.56/1.43  Prover 2: stopped
% 4.56/1.43  Prover 0: stopped
% 4.56/1.45  Prover 5: stopped
% 4.56/1.45  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.56/1.45  Prover 7: Preprocessing ...
% 4.56/1.45  Prover 8: Preprocessing ...
% 4.56/1.45  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.56/1.45  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.56/1.45  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.56/1.47  Prover 11: Preprocessing ...
% 4.56/1.48  Prover 10: Preprocessing ...
% 4.56/1.49  Prover 13: Preprocessing ...
% 4.56/1.49  Prover 7: Warning: ignoring some quantifiers
% 4.56/1.49  Prover 7: Constructing countermodel ...
% 5.38/1.52  Prover 10: Warning: ignoring some quantifiers
% 5.38/1.52  Prover 10: Constructing countermodel ...
% 5.38/1.54  Prover 8: Warning: ignoring some quantifiers
% 5.38/1.54  Prover 13: Warning: ignoring some quantifiers
% 5.38/1.54  Prover 8: Constructing countermodel ...
% 5.38/1.55  Prover 1: Found proof (size 50)
% 5.38/1.55  Prover 1: proved (910ms)
% 5.38/1.55  Prover 13: Constructing countermodel ...
% 5.38/1.55  Prover 4: stopped
% 5.38/1.55  Prover 10: stopped
% 5.38/1.55  Prover 7: stopped
% 5.38/1.55  Prover 8: stopped
% 5.38/1.55  Prover 13: stopped
% 5.38/1.56  Prover 11: Constructing countermodel ...
% 5.38/1.57  Prover 11: stopped
% 5.38/1.57  
% 5.38/1.57  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.38/1.57  
% 6.16/1.58  % SZS output start Proof for theBenchmark
% 6.16/1.58  Assumptions after simplification:
% 6.16/1.58  ---------------------------------
% 6.16/1.58  
% 6.16/1.58    (commutativity_k2_tarski)
% 6.27/1.61     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = v2) | 
% 6.27/1.61      ~ $i(v1) |  ~ $i(v0) | (unordered_pair(v1, v0) = v2 & $i(v2)))
% 6.27/1.61  
% 6.27/1.61    (t55_zfmisc_1)
% 6.27/1.61     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ (disjoint(v3, v2)
% 6.27/1.61        = 0) |  ~ (unordered_pair(v0, v1) = v3) |  ~ $i(v2) |  ~ $i(v1) |  ~
% 6.27/1.61      $i(v0) |  ? [v4: int] : ( ~ (v4 = 0) & in(v0, v2) = v4))
% 6.27/1.61  
% 6.27/1.61    (t57_zfmisc_1)
% 6.27/1.62     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: int] : (v4 = 0
% 6.27/1.62      |  ~ (disjoint(v3, v1) = v4) |  ~ (unordered_pair(v0, v2) = v3) |  ~ $i(v2)
% 6.27/1.62      |  ~ $i(v1) |  ~ $i(v0) |  ? [v5: any] :  ? [v6: any] : (in(v2, v1) = v6 &
% 6.27/1.62        in(v0, v1) = v5 & (v6 = 0 | v5 = 0)))
% 6.27/1.62  
% 6.27/1.62    (t72_zfmisc_1)
% 6.27/1.62     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 6.27/1.62      any] :  ? [v6: any] : (set_difference(v3, v2) = v4 & unordered_pair(v0, v1)
% 6.27/1.62      = v3 & in(v1, v2) = v6 & in(v0, v2) = v5 & $i(v4) & $i(v3) & $i(v2) & $i(v1)
% 6.27/1.62      & $i(v0) & ((v4 = v3 & (v6 = 0 | v5 = 0)) | ( ~ (v6 = 0) &  ~ (v5 = 0) &  ~
% 6.38/1.62          (v4 = v3))))
% 6.38/1.62  
% 6.38/1.62    (t83_xboole_1)
% 6.38/1.62     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = v0 |  ~ (set_difference(v0,
% 6.38/1.62          v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int] : ( ~ (v3 = 0) &
% 6.38/1.62        disjoint(v0, v1) = v3)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 6.38/1.62      (set_difference(v0, v1) = v0) |  ~ $i(v1) |  ~ $i(v0) | disjoint(v0, v1) =
% 6.38/1.62      0)
% 6.38/1.62  
% 6.38/1.62    (function-axioms)
% 6.38/1.63     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 6.38/1.63      (set_difference(v3, v2) = v1) |  ~ (set_difference(v3, v2) = v0)) &  ! [v0:
% 6.38/1.63      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 6.38/1.63    : (v1 = v0 |  ~ (disjoint(v3, v2) = v1) |  ~ (disjoint(v3, v2) = v0)) &  !
% 6.38/1.63    [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 6.38/1.63      (unordered_pair(v3, v2) = v1) |  ~ (unordered_pair(v3, v2) = v0)) &  ! [v0:
% 6.38/1.63      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 6.38/1.63    : (v1 = v0 |  ~ (in(v3, v2) = v1) |  ~ (in(v3, v2) = v0)) &  ! [v0:
% 6.38/1.63      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 | 
% 6.38/1.63      ~ (empty(v2) = v1) |  ~ (empty(v2) = v0))
% 6.38/1.63  
% 6.38/1.63  Further assumptions not needed in the proof:
% 6.38/1.63  --------------------------------------------
% 6.38/1.63  antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, symmetry_r1_xboole_0
% 6.38/1.63  
% 6.38/1.63  Those formulas are unsatisfiable:
% 6.38/1.63  ---------------------------------
% 6.38/1.63  
% 6.38/1.63  Begin of proof
% 6.38/1.63  | 
% 6.38/1.63  | ALPHA: (t83_xboole_1) implies:
% 6.38/1.63  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (set_difference(v0, v1) = v0) |  ~
% 6.38/1.63  |          $i(v1) |  ~ $i(v0) | disjoint(v0, v1) = 0)
% 6.38/1.63  |   (2)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = v0 |  ~
% 6.38/1.63  |          (set_difference(v0, v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 6.38/1.63  |          : ( ~ (v3 = 0) & disjoint(v0, v1) = v3))
% 6.38/1.63  | 
% 6.38/1.63  | ALPHA: (function-axioms) implies:
% 6.38/1.63  |   (3)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 6.38/1.63  |         ! [v3: $i] : (v1 = v0 |  ~ (in(v3, v2) = v1) |  ~ (in(v3, v2) = v0))
% 6.38/1.63  | 
% 6.38/1.63  | DELTA: instantiating (t72_zfmisc_1) with fresh symbols all_13_0, all_13_1,
% 6.38/1.63  |        all_13_2, all_13_3, all_13_4, all_13_5, all_13_6 gives:
% 6.38/1.64  |   (4)  set_difference(all_13_3, all_13_4) = all_13_2 &
% 6.38/1.64  |        unordered_pair(all_13_6, all_13_5) = all_13_3 & in(all_13_5, all_13_4)
% 6.38/1.64  |        = all_13_0 & in(all_13_6, all_13_4) = all_13_1 & $i(all_13_2) &
% 6.38/1.64  |        $i(all_13_3) & $i(all_13_4) & $i(all_13_5) & $i(all_13_6) & ((all_13_2
% 6.38/1.64  |            = all_13_3 & (all_13_0 = 0 | all_13_1 = 0)) | ( ~ (all_13_0 = 0) & 
% 6.38/1.64  |            ~ (all_13_1 = 0) &  ~ (all_13_2 = all_13_3)))
% 6.38/1.64  | 
% 6.38/1.64  | ALPHA: (4) implies:
% 6.38/1.64  |   (5)  $i(all_13_6)
% 6.38/1.64  |   (6)  $i(all_13_5)
% 6.38/1.64  |   (7)  $i(all_13_4)
% 6.38/1.64  |   (8)  $i(all_13_2)
% 6.38/1.64  |   (9)  in(all_13_6, all_13_4) = all_13_1
% 6.38/1.64  |   (10)  in(all_13_5, all_13_4) = all_13_0
% 6.38/1.64  |   (11)  unordered_pair(all_13_6, all_13_5) = all_13_3
% 6.38/1.64  |   (12)  set_difference(all_13_3, all_13_4) = all_13_2
% 6.38/1.64  |   (13)  (all_13_2 = all_13_3 & (all_13_0 = 0 | all_13_1 = 0)) | ( ~ (all_13_0
% 6.38/1.64  |             = 0) &  ~ (all_13_1 = 0) &  ~ (all_13_2 = all_13_3))
% 6.38/1.64  | 
% 6.38/1.64  | GROUND_INST: instantiating (commutativity_k2_tarski) with all_13_6, all_13_5,
% 6.38/1.64  |              all_13_3, simplifying with (5), (6), (11) gives:
% 6.38/1.64  |   (14)  unordered_pair(all_13_5, all_13_6) = all_13_3 & $i(all_13_3)
% 6.38/1.64  | 
% 6.38/1.64  | ALPHA: (14) implies:
% 6.38/1.64  |   (15)  $i(all_13_3)
% 6.38/1.64  |   (16)  unordered_pair(all_13_5, all_13_6) = all_13_3
% 6.38/1.64  | 
% 6.38/1.64  | GROUND_INST: instantiating (2) with all_13_3, all_13_4, all_13_2, simplifying
% 6.38/1.64  |              with (7), (12), (15) gives:
% 6.38/1.64  |   (17)  all_13_2 = all_13_3 |  ? [v0: int] : ( ~ (v0 = 0) & disjoint(all_13_3,
% 6.38/1.64  |             all_13_4) = v0)
% 6.38/1.64  | 
% 6.38/1.64  | BETA: splitting (13) gives:
% 6.38/1.64  | 
% 6.38/1.64  | Case 1:
% 6.38/1.64  | | 
% 6.38/1.65  | |   (18)  all_13_2 = all_13_3 & (all_13_0 = 0 | all_13_1 = 0)
% 6.38/1.65  | | 
% 6.38/1.65  | | ALPHA: (18) implies:
% 6.38/1.65  | |   (19)  all_13_2 = all_13_3
% 6.38/1.65  | |   (20)  all_13_0 = 0 | all_13_1 = 0
% 6.38/1.65  | | 
% 6.38/1.65  | | REDUCE: (12), (19) imply:
% 6.38/1.65  | |   (21)  set_difference(all_13_3, all_13_4) = all_13_3
% 6.38/1.65  | | 
% 6.38/1.65  | | GROUND_INST: instantiating (1) with all_13_3, all_13_4, simplifying with
% 6.38/1.65  | |              (7), (15), (21) gives:
% 6.38/1.65  | |   (22)  disjoint(all_13_3, all_13_4) = 0
% 6.38/1.65  | | 
% 6.38/1.65  | | GROUND_INST: instantiating (t55_zfmisc_1) with all_13_5, all_13_6, all_13_4,
% 6.38/1.65  | |              all_13_3, simplifying with (5), (6), (7), (16), (22) gives:
% 6.38/1.65  | |   (23)   ? [v0: int] : ( ~ (v0 = 0) & in(all_13_5, all_13_4) = v0)
% 6.38/1.65  | | 
% 6.38/1.65  | | GROUND_INST: instantiating (t55_zfmisc_1) with all_13_6, all_13_5, all_13_4,
% 6.38/1.65  | |              all_13_3, simplifying with (5), (6), (7), (11), (22) gives:
% 6.38/1.65  | |   (24)   ? [v0: int] : ( ~ (v0 = 0) & in(all_13_6, all_13_4) = v0)
% 6.38/1.65  | | 
% 6.38/1.65  | | DELTA: instantiating (23) with fresh symbol all_40_0 gives:
% 6.38/1.65  | |   (25)   ~ (all_40_0 = 0) & in(all_13_5, all_13_4) = all_40_0
% 6.38/1.65  | | 
% 6.38/1.65  | | ALPHA: (25) implies:
% 6.38/1.65  | |   (26)   ~ (all_40_0 = 0)
% 6.38/1.65  | |   (27)  in(all_13_5, all_13_4) = all_40_0
% 6.38/1.65  | | 
% 6.38/1.65  | | DELTA: instantiating (24) with fresh symbol all_42_0 gives:
% 6.38/1.65  | |   (28)   ~ (all_42_0 = 0) & in(all_13_6, all_13_4) = all_42_0
% 6.38/1.65  | | 
% 6.38/1.65  | | ALPHA: (28) implies:
% 6.38/1.65  | |   (29)   ~ (all_42_0 = 0)
% 6.38/1.65  | |   (30)  in(all_13_6, all_13_4) = all_42_0
% 6.38/1.65  | | 
% 6.38/1.65  | | GROUND_INST: instantiating (3) with all_13_1, all_42_0, all_13_4, all_13_6,
% 6.38/1.65  | |              simplifying with (9), (30) gives:
% 6.38/1.65  | |   (31)  all_42_0 = all_13_1
% 6.38/1.65  | | 
% 6.38/1.65  | | GROUND_INST: instantiating (3) with all_13_0, all_40_0, all_13_4, all_13_5,
% 6.38/1.65  | |              simplifying with (10), (27) gives:
% 6.38/1.65  | |   (32)  all_40_0 = all_13_0
% 6.38/1.65  | | 
% 6.38/1.65  | | REDUCE: (29), (31) imply:
% 6.38/1.65  | |   (33)   ~ (all_13_1 = 0)
% 6.38/1.65  | | 
% 6.38/1.65  | | REDUCE: (26), (32) imply:
% 6.38/1.65  | |   (34)   ~ (all_13_0 = 0)
% 6.38/1.65  | | 
% 6.38/1.65  | | BETA: splitting (20) gives:
% 6.38/1.65  | | 
% 6.38/1.65  | | Case 1:
% 6.38/1.65  | | | 
% 6.38/1.65  | | |   (35)  all_13_0 = 0
% 6.38/1.65  | | | 
% 6.38/1.65  | | | REDUCE: (34), (35) imply:
% 6.38/1.65  | | |   (36)  $false
% 6.38/1.66  | | | 
% 6.38/1.66  | | | CLOSE: (36) is inconsistent.
% 6.38/1.66  | | | 
% 6.38/1.66  | | Case 2:
% 6.38/1.66  | | | 
% 6.38/1.66  | | |   (37)  all_13_1 = 0
% 6.38/1.66  | | | 
% 6.38/1.66  | | | REDUCE: (33), (37) imply:
% 6.38/1.66  | | |   (38)  $false
% 6.38/1.66  | | | 
% 6.38/1.66  | | | CLOSE: (38) is inconsistent.
% 6.38/1.66  | | | 
% 6.38/1.66  | | End of split
% 6.38/1.66  | | 
% 6.38/1.66  | Case 2:
% 6.38/1.66  | | 
% 6.38/1.66  | |   (39)   ~ (all_13_0 = 0) &  ~ (all_13_1 = 0) &  ~ (all_13_2 = all_13_3)
% 6.38/1.66  | | 
% 6.38/1.66  | | ALPHA: (39) implies:
% 6.38/1.66  | |   (40)   ~ (all_13_2 = all_13_3)
% 6.38/1.66  | |   (41)   ~ (all_13_1 = 0)
% 6.38/1.66  | |   (42)   ~ (all_13_0 = 0)
% 6.38/1.66  | | 
% 6.38/1.66  | | BETA: splitting (17) gives:
% 6.38/1.66  | | 
% 6.38/1.66  | | Case 1:
% 6.38/1.66  | | | 
% 6.38/1.66  | | |   (43)  all_13_2 = all_13_3
% 6.38/1.66  | | | 
% 6.38/1.66  | | | REDUCE: (40), (43) imply:
% 6.38/1.66  | | |   (44)  $false
% 6.38/1.66  | | | 
% 6.38/1.66  | | | CLOSE: (44) is inconsistent.
% 6.38/1.66  | | | 
% 6.38/1.66  | | Case 2:
% 6.38/1.66  | | | 
% 6.38/1.66  | | |   (45)   ? [v0: int] : ( ~ (v0 = 0) & disjoint(all_13_3, all_13_4) = v0)
% 6.38/1.66  | | | 
% 6.38/1.66  | | | DELTA: instantiating (45) with fresh symbol all_32_0 gives:
% 6.38/1.66  | | |   (46)   ~ (all_32_0 = 0) & disjoint(all_13_3, all_13_4) = all_32_0
% 6.38/1.66  | | | 
% 6.38/1.66  | | | ALPHA: (46) implies:
% 6.38/1.66  | | |   (47)   ~ (all_32_0 = 0)
% 6.38/1.66  | | |   (48)  disjoint(all_13_3, all_13_4) = all_32_0
% 6.38/1.66  | | | 
% 6.38/1.66  | | | GROUND_INST: instantiating (t57_zfmisc_1) with all_13_6, all_13_4,
% 6.38/1.66  | | |              all_13_5, all_13_3, all_32_0, simplifying with (5), (6), (7),
% 6.38/1.66  | | |              (11), (48) gives:
% 6.38/1.66  | | |   (49)  all_32_0 = 0 |  ? [v0: any] :  ? [v1: any] : (in(all_13_5,
% 6.38/1.66  | | |             all_13_4) = v1 & in(all_13_6, all_13_4) = v0 & (v1 = 0 | v0 =
% 6.38/1.66  | | |             0))
% 6.38/1.66  | | | 
% 6.38/1.66  | | | BETA: splitting (49) gives:
% 6.38/1.66  | | | 
% 6.38/1.66  | | | Case 1:
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | |   (50)  all_32_0 = 0
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | | REDUCE: (47), (50) imply:
% 6.38/1.66  | | | |   (51)  $false
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | | CLOSE: (51) is inconsistent.
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | Case 2:
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | |   (52)   ? [v0: any] :  ? [v1: any] : (in(all_13_5, all_13_4) = v1 &
% 6.38/1.66  | | | |           in(all_13_6, all_13_4) = v0 & (v1 = 0 | v0 = 0))
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | | DELTA: instantiating (52) with fresh symbols all_41_0, all_41_1 gives:
% 6.38/1.66  | | | |   (53)  in(all_13_5, all_13_4) = all_41_0 & in(all_13_6, all_13_4) =
% 6.38/1.66  | | | |         all_41_1 & (all_41_0 = 0 | all_41_1 = 0)
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | | ALPHA: (53) implies:
% 6.38/1.66  | | | |   (54)  in(all_13_6, all_13_4) = all_41_1
% 6.38/1.66  | | | |   (55)  in(all_13_5, all_13_4) = all_41_0
% 6.38/1.66  | | | |   (56)  all_41_0 = 0 | all_41_1 = 0
% 6.38/1.66  | | | | 
% 6.38/1.66  | | | | GROUND_INST: instantiating (3) with all_13_1, all_41_1, all_13_4,
% 6.38/1.66  | | | |              all_13_6, simplifying with (9), (54) gives:
% 6.38/1.66  | | | |   (57)  all_41_1 = all_13_1
% 6.38/1.66  | | | | 
% 6.38/1.67  | | | | GROUND_INST: instantiating (3) with all_13_0, all_41_0, all_13_4,
% 6.38/1.67  | | | |              all_13_5, simplifying with (10), (55) gives:
% 6.38/1.67  | | | |   (58)  all_41_0 = all_13_0
% 6.38/1.67  | | | | 
% 6.38/1.67  | | | | BETA: splitting (56) gives:
% 6.38/1.67  | | | | 
% 6.38/1.67  | | | | Case 1:
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | |   (59)  all_41_0 = 0
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | COMBINE_EQS: (58), (59) imply:
% 6.38/1.67  | | | | |   (60)  all_13_0 = 0
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | REDUCE: (42), (60) imply:
% 6.38/1.67  | | | | |   (61)  $false
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | CLOSE: (61) is inconsistent.
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | Case 2:
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | |   (62)  all_41_1 = 0
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | COMBINE_EQS: (57), (62) imply:
% 6.38/1.67  | | | | |   (63)  all_13_1 = 0
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | SIMP: (63) implies:
% 6.38/1.67  | | | | |   (64)  all_13_1 = 0
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | REDUCE: (41), (64) imply:
% 6.38/1.67  | | | | |   (65)  $false
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | | CLOSE: (65) is inconsistent.
% 6.38/1.67  | | | | | 
% 6.38/1.67  | | | | End of split
% 6.38/1.67  | | | | 
% 6.38/1.67  | | | End of split
% 6.38/1.67  | | | 
% 6.38/1.67  | | End of split
% 6.38/1.67  | | 
% 6.38/1.67  | End of split
% 6.38/1.67  | 
% 6.38/1.67  End of proof
% 6.38/1.67  % SZS output end Proof for theBenchmark
% 6.38/1.67  
% 6.38/1.67  1049ms
%------------------------------------------------------------------------------