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

View Problem - Process Solution

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

% Computer : n032.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 : Fri Sep  1 03:28:41 EDT 2023

% Result   : Theorem 3.50s 1.08s
% Output   : Proof 4.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SYN722+1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.10  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Sat Aug 26 17:33:59 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 0.15/0.50  ________       _____
% 0.15/0.50  ___  __ \_________(_)________________________________
% 0.15/0.50  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.15/0.50  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.15/0.50  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.15/0.50  
% 0.15/0.50  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.15/0.50  (2023-06-19)
% 0.15/0.50  
% 0.15/0.50  (c) Philipp Rümmer, 2009-2023
% 0.15/0.50  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.15/0.50                Amanda Stjerna.
% 0.15/0.50  Free software under BSD-3-Clause.
% 0.15/0.50  
% 0.15/0.50  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.15/0.50  
% 0.15/0.50  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.15/0.51  Running up to 7 provers in parallel.
% 0.15/0.52  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.15/0.52  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.15/0.52  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.15/0.52  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.15/0.52  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.15/0.52  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.15/0.52  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.99/0.80  Prover 4: Preprocessing ...
% 0.99/0.80  Prover 1: Preprocessing ...
% 0.99/0.84  Prover 2: Preprocessing ...
% 0.99/0.84  Prover 6: Preprocessing ...
% 0.99/0.84  Prover 3: Preprocessing ...
% 0.99/0.84  Prover 0: Preprocessing ...
% 0.99/0.84  Prover 5: Preprocessing ...
% 1.91/0.91  Prover 5: Proving ...
% 1.91/0.91  Prover 2: Proving ...
% 2.37/0.93  Prover 1: Constructing countermodel ...
% 2.37/0.94  Prover 4: Constructing countermodel ...
% 2.37/0.94  Prover 0: Proving ...
% 2.37/0.94  Prover 6: Proving ...
% 2.37/0.94  Prover 3: Constructing countermodel ...
% 3.50/1.08  Prover 3: proved (555ms)
% 3.50/1.08  
% 3.50/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.50/1.08  
% 3.50/1.08  Prover 2: stopped
% 3.50/1.08  Prover 5: stopped
% 3.50/1.09  Prover 0: stopped
% 3.50/1.09  Prover 6: stopped
% 3.50/1.09  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.50/1.09  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.50/1.09  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.50/1.09  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.50/1.10  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.50/1.10  Prover 7: Preprocessing ...
% 3.50/1.10  Prover 13: Preprocessing ...
% 3.50/1.11  Prover 11: Preprocessing ...
% 3.50/1.11  Prover 7: Warning: ignoring some quantifiers
% 3.50/1.11  Prover 7: Constructing countermodel ...
% 3.50/1.11  Prover 13: Warning: ignoring some quantifiers
% 3.50/1.11  Prover 13: Constructing countermodel ...
% 3.50/1.12  Prover 10: Preprocessing ...
% 3.50/1.12  Prover 8: Preprocessing ...
% 3.89/1.13  Prover 10: Warning: ignoring some quantifiers
% 3.89/1.13  Prover 10: Constructing countermodel ...
% 3.89/1.14  Prover 13: gave up
% 3.89/1.14  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 3.89/1.15  Prover 1: Found proof (size 48)
% 3.89/1.15  Prover 1: proved (628ms)
% 3.89/1.15  Prover 7: stopped
% 3.89/1.15  Prover 4: stopped
% 3.89/1.15  Prover 10: stopped
% 4.05/1.15  Prover 11: Constructing countermodel ...
% 4.05/1.15  Prover 8: Warning: ignoring some quantifiers
% 4.05/1.15  Prover 16: Preprocessing ...
% 4.05/1.15  Prover 11: stopped
% 4.05/1.15  Prover 8: Constructing countermodel ...
% 4.05/1.16  Prover 8: stopped
% 4.05/1.16  Prover 16: Warning: ignoring some quantifiers
% 4.05/1.16  Prover 16: Constructing countermodel ...
% 4.05/1.16  Prover 16: stopped
% 4.05/1.17  
% 4.05/1.17  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.05/1.17  
% 4.05/1.18  % SZS output start Proof for theBenchmark
% 4.05/1.18  Assumptions after simplification:
% 4.05/1.18  ---------------------------------
% 4.05/1.18  
% 4.05/1.18    (thm119)
% 4.05/1.22    $i(b) & $i(a) & $i(d) & $i(c) &  ? [v0: any] :  ? [v1: any] :  ? [v2: any] : 
% 4.05/1.22    ? [v3: any] : (q(d) = v1 & q(c) = v0 & p(b) = v3 & p(a) = v2 &  ! [v4: $i] : 
% 4.05/1.22      ! [v5: int] : (v5 = 0 |  ~ (q(v4) = v5) |  ~ $i(v4)) &  ! [v4: $i] :  ! [v5:
% 4.05/1.22        int] : (v5 = 0 |  ~ (r(v4) = v5) |  ~ $i(v4) | p(v4) = 0) &  ! [v4: $i] : 
% 4.05/1.22      ! [v5: any] : ( ~ (p(v4) = v5) |  ~ $i(v4) |  ? [v6: any] : (q(v4) = v6 &  ?
% 4.05/1.22          [v7: $i] :  ? [v8: any] : (q(v7) = v8 & $i(v7) & ( ~ (v8 = 0) |  ~ (v6 =
% 4.05/1.22                0) |  ~ (v1 = 0) |  ~ (v0 = 0) | v5 = 0)))) & ( ~ (v3 = 0) |  ~
% 4.05/1.22        (v2 = 0)))
% 4.05/1.22  
% 4.05/1.22  Those formulas are unsatisfiable:
% 4.05/1.22  ---------------------------------
% 4.05/1.22  
% 4.05/1.22  Begin of proof
% 4.05/1.22  | 
% 4.36/1.22  | ALPHA: (thm119) implies:
% 4.36/1.22  |   (1)  $i(c)
% 4.36/1.22  |   (2)  $i(d)
% 4.36/1.22  |   (3)  $i(a)
% 4.36/1.22  |   (4)  $i(b)
% 4.36/1.22  |   (5)   ? [v0: any] :  ? [v1: any] :  ? [v2: any] :  ? [v3: any] : (q(d) = v1
% 4.36/1.23  |          & q(c) = v0 & p(b) = v3 & p(a) = v2 &  ! [v4: $i] :  ! [v5: int] :
% 4.36/1.23  |          (v5 = 0 |  ~ (q(v4) = v5) |  ~ $i(v4)) &  ! [v4: $i] :  ! [v5: int] :
% 4.36/1.23  |          (v5 = 0 |  ~ (r(v4) = v5) |  ~ $i(v4) | p(v4) = 0) &  ! [v4: $i] :  !
% 4.36/1.23  |          [v5: any] : ( ~ (p(v4) = v5) |  ~ $i(v4) |  ? [v6: any] : (q(v4) = v6
% 4.36/1.23  |              &  ? [v7: $i] :  ? [v8: any] : (q(v7) = v8 & $i(v7) & ( ~ (v8 =
% 4.36/1.23  |                    0) |  ~ (v6 = 0) |  ~ (v1 = 0) |  ~ (v0 = 0) | v5 = 0)))) &
% 4.36/1.23  |          ( ~ (v3 = 0) |  ~ (v2 = 0)))
% 4.36/1.23  | 
% 4.36/1.23  | DELTA: instantiating (5) with fresh symbols all_4_0, all_4_1, all_4_2, all_4_3
% 4.36/1.23  |        gives:
% 4.36/1.23  |   (6)  q(d) = all_4_2 & q(c) = all_4_3 & p(b) = all_4_0 & p(a) = all_4_1 &  !
% 4.36/1.23  |        [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (q(v0) = v1) |  ~ $i(v0)) &  !
% 4.36/1.23  |        [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (r(v0) = v1) |  ~ $i(v0) | p(v0)
% 4.36/1.23  |          = 0) &  ! [v0: $i] :  ! [v1: any] : ( ~ (p(v0) = v1) |  ~ $i(v0) |  ?
% 4.36/1.23  |          [v2: any] : (q(v0) = v2 &  ? [v3: $i] :  ? [v4: any] : (q(v3) = v4 &
% 4.36/1.23  |              $i(v3) & ( ~ (v4 = 0) |  ~ (v2 = 0) |  ~ (all_4_2 = 0) |  ~
% 4.36/1.23  |                (all_4_3 = 0) | v1 = 0)))) & ( ~ (all_4_0 = 0) |  ~ (all_4_1 =
% 4.36/1.23  |            0))
% 4.36/1.23  | 
% 4.36/1.23  | ALPHA: (6) implies:
% 4.36/1.23  |   (7)  p(a) = all_4_1
% 4.36/1.23  |   (8)  p(b) = all_4_0
% 4.36/1.23  |   (9)  q(c) = all_4_3
% 4.36/1.23  |   (10)  q(d) = all_4_2
% 4.36/1.23  |   (11)   ~ (all_4_0 = 0) |  ~ (all_4_1 = 0)
% 4.36/1.23  |   (12)   ! [v0: $i] :  ! [v1: any] : ( ~ (p(v0) = v1) |  ~ $i(v0) |  ? [v2:
% 4.36/1.23  |             any] : (q(v0) = v2 &  ? [v3: $i] :  ? [v4: any] : (q(v3) = v4 &
% 4.36/1.24  |               $i(v3) & ( ~ (v4 = 0) |  ~ (v2 = 0) |  ~ (all_4_2 = 0) |  ~
% 4.36/1.24  |                 (all_4_3 = 0) | v1 = 0))))
% 4.36/1.24  |   (13)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (q(v0) = v1) |  ~ $i(v0))
% 4.36/1.24  | 
% 4.36/1.24  | GROUND_INST: instantiating (12) with a, all_4_1, simplifying with (3), (7)
% 4.36/1.24  |              gives:
% 4.36/1.24  |   (14)   ? [v0: any] : (q(a) = v0 &  ? [v1: $i] :  ? [v2: any] : (q(v1) = v2 &
% 4.36/1.24  |             $i(v1) & ( ~ (v2 = 0) |  ~ (v0 = 0) |  ~ (all_4_2 = 0) |  ~
% 4.36/1.24  |               (all_4_3 = 0) | all_4_1 = 0)))
% 4.36/1.24  | 
% 4.36/1.24  | GROUND_INST: instantiating (12) with b, all_4_0, simplifying with (4), (8)
% 4.36/1.24  |              gives:
% 4.36/1.24  |   (15)   ? [v0: any] : (q(b) = v0 &  ? [v1: $i] :  ? [v2: any] : (q(v1) = v2 &
% 4.36/1.24  |             $i(v1) & ( ~ (v2 = 0) |  ~ (v0 = 0) |  ~ (all_4_2 = 0) |  ~
% 4.36/1.24  |               (all_4_3 = 0) | all_4_0 = 0)))
% 4.36/1.24  | 
% 4.36/1.24  | GROUND_INST: instantiating (13) with c, all_4_3, simplifying with (1), (9)
% 4.36/1.24  |              gives:
% 4.36/1.24  |   (16)  all_4_3 = 0
% 4.36/1.24  | 
% 4.36/1.24  | GROUND_INST: instantiating (13) with d, all_4_2, simplifying with (2), (10)
% 4.36/1.24  |              gives:
% 4.36/1.24  |   (17)  all_4_2 = 0
% 4.36/1.24  | 
% 4.36/1.24  | DELTA: instantiating (14) with fresh symbol all_13_0 gives:
% 4.36/1.24  |   (18)  q(a) = all_13_0 &  ? [v0: $i] :  ? [v1: any] : (q(v0) = v1 & $i(v0) &
% 4.36/1.24  |           ( ~ (v1 = 0) |  ~ (all_13_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 =
% 4.36/1.24  |               0) | all_4_1 = 0))
% 4.36/1.24  | 
% 4.36/1.24  | ALPHA: (18) implies:
% 4.36/1.24  |   (19)  q(a) = all_13_0
% 4.36/1.24  |   (20)   ? [v0: $i] :  ? [v1: any] : (q(v0) = v1 & $i(v0) & ( ~ (v1 = 0) |  ~
% 4.36/1.24  |             (all_13_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_1 =
% 4.36/1.24  |             0))
% 4.36/1.24  | 
% 4.36/1.24  | DELTA: instantiating (15) with fresh symbol all_15_0 gives:
% 4.36/1.24  |   (21)  q(b) = all_15_0 &  ? [v0: $i] :  ? [v1: any] : (q(v0) = v1 & $i(v0) &
% 4.36/1.24  |           ( ~ (v1 = 0) |  ~ (all_15_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 =
% 4.36/1.24  |               0) | all_4_0 = 0))
% 4.36/1.25  | 
% 4.36/1.25  | ALPHA: (21) implies:
% 4.36/1.25  |   (22)  q(b) = all_15_0
% 4.36/1.25  |   (23)   ? [v0: $i] :  ? [v1: any] : (q(v0) = v1 & $i(v0) & ( ~ (v1 = 0) |  ~
% 4.36/1.25  |             (all_15_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_0 =
% 4.36/1.25  |             0))
% 4.36/1.25  | 
% 4.36/1.25  | DELTA: instantiating (20) with fresh symbols all_17_0, all_17_1 gives:
% 4.36/1.25  |   (24)  q(all_17_1) = all_17_0 & $i(all_17_1) & ( ~ (all_17_0 = 0) |  ~
% 4.36/1.25  |           (all_13_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_1 = 0)
% 4.36/1.25  | 
% 4.36/1.25  | ALPHA: (24) implies:
% 4.36/1.25  |   (25)  $i(all_17_1)
% 4.36/1.25  |   (26)  q(all_17_1) = all_17_0
% 4.36/1.25  |   (27)   ~ (all_17_0 = 0) |  ~ (all_13_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3
% 4.36/1.25  |           = 0) | all_4_1 = 0
% 4.36/1.25  | 
% 4.36/1.25  | DELTA: instantiating (23) with fresh symbols all_19_0, all_19_1 gives:
% 4.36/1.25  |   (28)  q(all_19_1) = all_19_0 & $i(all_19_1) & ( ~ (all_19_0 = 0) |  ~
% 4.36/1.25  |           (all_15_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_0 = 0)
% 4.36/1.25  | 
% 4.36/1.25  | ALPHA: (28) implies:
% 4.36/1.25  |   (29)  $i(all_19_1)
% 4.36/1.25  |   (30)  q(all_19_1) = all_19_0
% 4.36/1.25  |   (31)   ~ (all_19_0 = 0) |  ~ (all_15_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3
% 4.36/1.25  |           = 0) | all_4_0 = 0
% 4.36/1.25  | 
% 4.36/1.25  | GROUND_INST: instantiating (13) with a, all_13_0, simplifying with (3), (19)
% 4.36/1.25  |              gives:
% 4.36/1.25  |   (32)  all_13_0 = 0
% 4.36/1.25  | 
% 4.36/1.25  | GROUND_INST: instantiating (13) with b, all_15_0, simplifying with (4), (22)
% 4.36/1.25  |              gives:
% 4.36/1.25  |   (33)  all_15_0 = 0
% 4.36/1.25  | 
% 4.36/1.25  | GROUND_INST: instantiating (13) with all_17_1, all_17_0, simplifying with
% 4.36/1.25  |              (25), (26) gives:
% 4.36/1.25  |   (34)  all_17_0 = 0
% 4.36/1.25  | 
% 4.36/1.25  | GROUND_INST: instantiating (13) with all_19_1, all_19_0, simplifying with
% 4.36/1.25  |              (29), (30) gives:
% 4.36/1.25  |   (35)  all_19_0 = 0
% 4.36/1.25  | 
% 4.36/1.25  | BETA: splitting (27) gives:
% 4.36/1.25  | 
% 4.36/1.25  | Case 1:
% 4.36/1.25  | | 
% 4.36/1.25  | |   (36)   ~ (all_17_0 = 0)
% 4.36/1.25  | | 
% 4.36/1.25  | | REDUCE: (34), (36) imply:
% 4.36/1.25  | |   (37)  $false
% 4.36/1.25  | | 
% 4.36/1.25  | | CLOSE: (37) is inconsistent.
% 4.36/1.25  | | 
% 4.36/1.25  | Case 2:
% 4.36/1.25  | | 
% 4.36/1.25  | |   (38)   ~ (all_13_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_1 =
% 4.36/1.25  | |         0
% 4.36/1.25  | | 
% 4.36/1.25  | | BETA: splitting (31) gives:
% 4.36/1.25  | | 
% 4.36/1.25  | | Case 1:
% 4.36/1.25  | | | 
% 4.36/1.25  | | |   (39)   ~ (all_19_0 = 0)
% 4.36/1.25  | | | 
% 4.36/1.25  | | | REDUCE: (35), (39) imply:
% 4.36/1.25  | | |   (40)  $false
% 4.36/1.25  | | | 
% 4.36/1.25  | | | CLOSE: (40) is inconsistent.
% 4.36/1.25  | | | 
% 4.36/1.25  | | Case 2:
% 4.36/1.25  | | | 
% 4.36/1.26  | | |   (41)   ~ (all_15_0 = 0) |  ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_0
% 4.36/1.26  | | |         = 0
% 4.36/1.26  | | | 
% 4.36/1.26  | | | BETA: splitting (38) gives:
% 4.36/1.26  | | | 
% 4.36/1.26  | | | Case 1:
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | |   (42)   ~ (all_13_0 = 0)
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | | REDUCE: (32), (42) imply:
% 4.36/1.26  | | | |   (43)  $false
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | | CLOSE: (43) is inconsistent.
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | Case 2:
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | |   (44)   ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_1 = 0
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | | BETA: splitting (44) gives:
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | | Case 1:
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | |   (45)   ~ (all_4_2 = 0)
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | | REDUCE: (17), (45) imply:
% 4.36/1.26  | | | | |   (46)  $false
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | | CLOSE: (46) is inconsistent.
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | Case 2:
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | |   (47)   ~ (all_4_3 = 0) | all_4_1 = 0
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | | BETA: splitting (47) gives:
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | | Case 1:
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | |   (48)   ~ (all_4_3 = 0)
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | | REDUCE: (16), (48) imply:
% 4.36/1.26  | | | | | |   (49)  $false
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | | CLOSE: (49) is inconsistent.
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | Case 2:
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | |   (50)  all_4_1 = 0
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | | BETA: splitting (11) gives:
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | | Case 1:
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | |   (51)   ~ (all_4_0 = 0)
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | | BETA: splitting (41) gives:
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | | Case 1:
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | |   (52)   ~ (all_15_0 = 0)
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | | REDUCE: (33), (52) imply:
% 4.36/1.26  | | | | | | | |   (53)  $false
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | | CLOSE: (53) is inconsistent.
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | Case 2:
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | |   (54)   ~ (all_4_2 = 0) |  ~ (all_4_3 = 0) | all_4_0 = 0
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | | BETA: splitting (54) gives:
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | | Case 1:
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | |   (55)   ~ (all_4_2 = 0)
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | REDUCE: (17), (55) imply:
% 4.36/1.26  | | | | | | | | |   (56)  $false
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | CLOSE: (56) is inconsistent.
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | Case 2:
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | |   (57)   ~ (all_4_3 = 0) | all_4_0 = 0
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | BETA: splitting (57) gives:
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | Case 1:
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | |   (58)   ~ (all_4_3 = 0)
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | | REDUCE: (16), (58) imply:
% 4.36/1.26  | | | | | | | | | |   (59)  $false
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | | CLOSE: (59) is inconsistent.
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | Case 2:
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | |   (60)  all_4_0 = 0
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | | REDUCE: (51), (60) imply:
% 4.36/1.26  | | | | | | | | | |   (61)  $false
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | | CLOSE: (61) is inconsistent.
% 4.36/1.26  | | | | | | | | | | 
% 4.36/1.26  | | | | | | | | | End of split
% 4.36/1.26  | | | | | | | | | 
% 4.36/1.26  | | | | | | | | End of split
% 4.36/1.26  | | | | | | | | 
% 4.36/1.26  | | | | | | | End of split
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | Case 2:
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | |   (62)   ~ (all_4_1 = 0)
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | | REDUCE: (50), (62) imply:
% 4.36/1.26  | | | | | | |   (63)  $false
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | | CLOSE: (63) is inconsistent.
% 4.36/1.26  | | | | | | | 
% 4.36/1.26  | | | | | | End of split
% 4.36/1.26  | | | | | | 
% 4.36/1.26  | | | | | End of split
% 4.36/1.26  | | | | | 
% 4.36/1.26  | | | | End of split
% 4.36/1.26  | | | | 
% 4.36/1.26  | | | End of split
% 4.36/1.26  | | | 
% 4.36/1.26  | | End of split
% 4.36/1.26  | | 
% 4.36/1.26  | End of split
% 4.36/1.26  | 
% 4.36/1.26  End of proof
% 4.36/1.26  % SZS output end Proof for theBenchmark
% 4.36/1.26  
% 4.36/1.26  758ms
%------------------------------------------------------------------------------