↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWX000_1 : TPTP v9.1.0. Released v9.1.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n026.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 : Sun Apr  6 10:08:52 AM UTC 2025

% Result   : Theorem 7.72s 1.80s
% Output   : Proof 9.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWX000_1 : TPTP v9.1.0. Released v9.1.0.
% 0.14/0.14  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Sun Apr  6 03:03:08 EDT 2025
% 0.21/0.35  % CPUTime  : 
% 0.55/0.63  ________       _____
% 0.55/0.63  ___  __ \_________(_)________________________________
% 0.55/0.63  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.55/0.63  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.55/0.63  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.55/0.63  
% 0.55/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.55/0.63  (2023-06-19)
% 0.55/0.63  
% 0.55/0.63  (c) Philipp Rümmer, 2009-2023
% 0.55/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.55/0.63                Amanda Stjerna.
% 0.55/0.63  Free software under BSD-3-Clause.
% 0.55/0.63  
% 0.55/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.55/0.63  
% 0.55/0.63  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.68/0.64  Running up to 7 provers in parallel.
% 0.75/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.75/0.66  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.75/0.66  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.75/0.66  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.75/0.66  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.75/0.66  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.75/0.66  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.39/1.20  Prover 4: Preprocessing ...
% 3.39/1.20  Prover 1: Preprocessing ...
% 3.74/1.25  Prover 6: Preprocessing ...
% 3.74/1.25  Prover 2: Preprocessing ...
% 3.74/1.25  Prover 3: Preprocessing ...
% 3.74/1.25  Prover 5: Preprocessing ...
% 3.74/1.25  Prover 0: Preprocessing ...
% 6.43/1.62  Prover 5: Proving ...
% 6.43/1.62  Prover 6: Proving ...
% 6.43/1.62  Prover 2: Proving ...
% 6.43/1.65  Prover 0: Proving ...
% 6.43/1.65  Prover 3: Constructing countermodel ...
% 6.43/1.65  Prover 1: Constructing countermodel ...
% 6.84/1.67  Prover 4: Constructing countermodel ...
% 7.72/1.80  Prover 3: proved (1144ms)
% 7.72/1.80  
% 7.72/1.80  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.72/1.80  
% 7.72/1.80  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.72/1.80  Prover 2: stopped
% 7.72/1.80  Prover 6: stopped
% 7.72/1.81  Prover 0: stopped
% 7.72/1.82  Prover 5: stopped
% 7.72/1.82  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.72/1.82  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.72/1.82  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 7.94/1.83  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 8.00/1.87  Prover 4: Found proof (size 28)
% 8.00/1.87  Prover 4: proved (1214ms)
% 8.00/1.88  Prover 1: stopped
% 8.00/1.90  Prover 10: Preprocessing ...
% 8.00/1.90  Prover 7: Preprocessing ...
% 8.00/1.90  Prover 13: Preprocessing ...
% 8.52/1.91  Prover 8: Preprocessing ...
% 8.52/1.93  Prover 11: Preprocessing ...
% 8.52/1.94  Prover 7: stopped
% 8.52/1.94  Prover 10: stopped
% 8.52/1.96  Prover 13: stopped
% 9.00/1.98  Prover 11: stopped
% 9.00/2.04  Prover 8: Warning: ignoring some quantifiers
% 9.00/2.05  Prover 8: Constructing countermodel ...
% 9.47/2.06  Prover 8: stopped
% 9.47/2.06  
% 9.47/2.06  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.47/2.06  
% 9.47/2.07  % SZS output start Proof for theBenchmark
% 9.47/2.07  Assumptions after simplification:
% 9.47/2.07  ---------------------------------
% 9.47/2.07  
% 9.47/2.07    (f__integer__def_ax)
% 9.59/2.09     ! [v0: int] :  ! [v1: general] :  ! [v2: general] : (v2 = v1 |  ~
% 9.59/2.09      (f__integer__(v0) = v2) |  ~ (f__integer__(v0) = v1)) &  ! [v0: int] :  !
% 9.59/2.09    [v1: int] :  ! [v2: general] : (v1 = v0 |  ~ (f__integer__(v1) = v2) |  ~
% 9.59/2.09      (f__integer__(v0) = v2))
% 9.59/2.09  
% 9.59/2.09    (formula_2_left_0)
% 9.59/2.09     ! [v0: general] :  ! [v1: general] :  ! [v2: general] :  ! [v3: int] :  !
% 9.59/2.09    [v4: int] : (v3 = 0 |  ~ (tp(v0, v2) = 0) |  ~ (tq(v0, v1) = v3) |  ~
% 9.59/2.09      (f__integer__($sum(v4, 1)) = v1) |  ~ general(v2) |  ~ general(v1) |  ~
% 9.59/2.09      general(v0) |  ? [v5: general] : ( ~ (v5 = v2) & f__integer__(v4) = v5 &
% 9.59/2.09        general(v5))) &  ! [v0: general] :  ! [v1: general] :  ! [v2: general] : 
% 9.59/2.09    ! [v3: int] :  ! [v4: int] : (v3 = 0 |  ~ (hp(v0, v2) = 0) |  ~ (hq(v0, v1) =
% 9.59/2.09        v3) |  ~ (f__integer__($sum(v4, 1)) = v1) |  ~ general(v2) |  ~
% 9.59/2.09      general(v1) |  ~ general(v0) |  ? [v5: general] : ( ~ (v5 = v2) &
% 9.59/2.09        f__integer__(v4) = v5 & general(v5)))
% 9.59/2.09  
% 9.59/2.10    (formula_3_right_0)
% 9.59/2.10     ? [v0: general] :  ? [v1: general] :  ? [v2: any] :  ? [v3: any] :  ? [v4:
% 9.59/2.10      general] :  ? [v5: general] :  ? [v6: int] :  ? [v7: int] :  ? [v8: int] : 
% 9.59/2.10    ? [v9: general] :  ? [v10: general] :  ? [v11: general] :  ? [v12: general] : 
% 9.59/2.10    ? [v13: int] :  ? [v14: int] :  ? [v15: int] :  ? [v16: general] :  ? [v17:
% 9.59/2.10      general] : (tq(v0, v1) = v3 & hq(v0, v1) = v2 & general(v12) & general(v11)
% 9.59/2.10      & general(v5) & general(v4) & general(v1) & general(v0) & ((v17 = v1 & v16 =
% 9.59/2.10          v12 & v15 = 1 & v13 = 0 & v11 = v0 &  ~ (v2 = 0) & hp(v0, v12) = 0 &
% 9.59/2.10          f__integer__($sum(v14, -1)) = v12 & f__integer__(v14) = v1) | (v10 = v1
% 9.59/2.10          & v9 = v5 & v8 = 1 & v6 = 0 & v4 = v0 &  ~ (v3 = 0) & tp(v0, v5) = 0 &
% 9.59/2.10          f__integer__($sum(v7, -1)) = v5 & f__integer__(v7) = v1)))
% 9.59/2.10  
% 9.59/2.10  Further assumptions not needed in the proof:
% 9.59/2.10  --------------------------------------------
% 9.59/2.10  antisymmetric_ordering_ax, f__symbolic__def_ax, formula_0_transition_axiom_0,
% 9.59/2.10  formula_1_transition_axiom_1, general_universe_ax, maximal_element_ax,
% 9.59/2.10  minimal_element_ax, numeral_ordering_ax, numerals_less_than_symbols_ax,
% 9.59/2.10  p__greater__def_ax, p__greater_equal__def_ax, p__is_integer__def_ax,
% 9.59/2.10  p__is_symbolic__def_ax, p__less__def_ax, strongly_connected_ordering_ax,
% 9.59/2.10  transitive_ordering_ax
% 9.59/2.10  
% 9.59/2.10  Those formulas are unsatisfiable:
% 9.59/2.10  ---------------------------------
% 9.59/2.10  
% 9.59/2.10  Begin of proof
% 9.59/2.10  | 
% 9.59/2.10  | ALPHA: (f__integer__def_ax) implies:
% 9.59/2.10  |   (1)   ! [v0: int] :  ! [v1: general] :  ! [v2: general] : (v2 = v1 |  ~
% 9.59/2.10  |          (f__integer__(v0) = v2) |  ~ (f__integer__(v0) = v1))
% 9.59/2.10  | 
% 9.59/2.10  | ALPHA: (formula_2_left_0) implies:
% 9.59/2.10  |   (2)   ! [v0: general] :  ! [v1: general] :  ! [v2: general] :  ! [v3: int] :
% 9.59/2.10  |         ! [v4: int] : (v3 = 0 |  ~ (hp(v0, v2) = 0) |  ~ (hq(v0, v1) = v3) | 
% 9.59/2.10  |          ~ (f__integer__($sum(v4, 1)) = v1) |  ~ general(v2) |  ~ general(v1)
% 9.59/2.10  |          |  ~ general(v0) |  ? [v5: general] : ( ~ (v5 = v2) &
% 9.59/2.10  |            f__integer__(v4) = v5 & general(v5)))
% 9.59/2.11  |   (3)   ! [v0: general] :  ! [v1: general] :  ! [v2: general] :  ! [v3: int] :
% 9.59/2.11  |         ! [v4: int] : (v3 = 0 |  ~ (tp(v0, v2) = 0) |  ~ (tq(v0, v1) = v3) | 
% 9.59/2.11  |          ~ (f__integer__($sum(v4, 1)) = v1) |  ~ general(v2) |  ~ general(v1)
% 9.59/2.11  |          |  ~ general(v0) |  ? [v5: general] : ( ~ (v5 = v2) &
% 9.59/2.11  |            f__integer__(v4) = v5 & general(v5)))
% 9.59/2.11  | 
% 9.59/2.11  | DELTA: instantiating (formula_3_right_0) with fresh symbols all_26_0,
% 9.59/2.11  |        all_26_1, all_26_2, all_26_3, all_26_4, all_26_5, all_26_6, all_26_7,
% 9.59/2.11  |        all_26_8, all_26_9, all_26_10, all_26_11, all_26_12, all_26_13,
% 9.59/2.11  |        all_26_14, all_26_15, all_26_16, all_26_17 gives:
% 9.59/2.11  |   (4)  tq(all_26_17, all_26_16) = all_26_14 & hq(all_26_17, all_26_16) =
% 9.59/2.11  |        all_26_15 & general(all_26_5) & general(all_26_6) & general(all_26_12)
% 9.59/2.11  |        & general(all_26_13) & general(all_26_16) & general(all_26_17) &
% 9.59/2.11  |        ((all_26_0 = all_26_16 & all_26_1 = all_26_5 & all_26_2 = 1 & all_26_4
% 9.59/2.11  |            = 0 & all_26_6 = all_26_17 &  ~ (all_26_15 = 0) & hp(all_26_17,
% 9.59/2.11  |              all_26_5) = 0 & f__integer__($sum(all_26_3, -1)) = all_26_5 &
% 9.59/2.11  |            f__integer__(all_26_3) = all_26_16) | (all_26_7 = all_26_16 &
% 9.59/2.11  |            all_26_8 = all_26_12 & all_26_9 = 1 & all_26_11 = 0 & all_26_13 =
% 9.59/2.11  |            all_26_17 &  ~ (all_26_14 = 0) & tp(all_26_17, all_26_12) = 0 &
% 9.59/2.11  |            f__integer__($sum(all_26_10, -1)) = all_26_12 &
% 9.59/2.11  |            f__integer__(all_26_10) = all_26_16))
% 9.59/2.11  | 
% 9.59/2.11  | ALPHA: (4) implies:
% 9.59/2.11  |   (5)  general(all_26_16)
% 9.59/2.11  |   (6)  general(all_26_13)
% 9.59/2.11  |   (7)  general(all_26_12)
% 9.59/2.11  |   (8)  general(all_26_6)
% 9.59/2.11  |   (9)  general(all_26_5)
% 9.59/2.11  |   (10)  hq(all_26_17, all_26_16) = all_26_15
% 9.59/2.11  |   (11)  tq(all_26_17, all_26_16) = all_26_14
% 9.59/2.11  |   (12)  (all_26_0 = all_26_16 & all_26_1 = all_26_5 & all_26_2 = 1 & all_26_4
% 9.59/2.11  |           = 0 & all_26_6 = all_26_17 &  ~ (all_26_15 = 0) & hp(all_26_17,
% 9.59/2.11  |             all_26_5) = 0 & f__integer__($sum(all_26_3, -1)) = all_26_5 &
% 9.59/2.11  |           f__integer__(all_26_3) = all_26_16) | (all_26_7 = all_26_16 &
% 9.59/2.11  |           all_26_8 = all_26_12 & all_26_9 = 1 & all_26_11 = 0 & all_26_13 =
% 9.59/2.11  |           all_26_17 &  ~ (all_26_14 = 0) & tp(all_26_17, all_26_12) = 0 &
% 9.59/2.11  |           f__integer__($sum(all_26_10, -1)) = all_26_12 &
% 9.59/2.11  |           f__integer__(all_26_10) = all_26_16)
% 9.59/2.11  | 
% 9.59/2.11  | BETA: splitting (12) gives:
% 9.59/2.11  | 
% 9.59/2.11  | Case 1:
% 9.59/2.11  | | 
% 9.59/2.11  | |   (13)  all_26_0 = all_26_16 & all_26_1 = all_26_5 & all_26_2 = 1 & all_26_4
% 9.59/2.11  | |         = 0 & all_26_6 = all_26_17 &  ~ (all_26_15 = 0) & hp(all_26_17,
% 9.59/2.11  | |           all_26_5) = 0 & f__integer__($sum(all_26_3, -1)) = all_26_5 &
% 9.59/2.11  | |         f__integer__(all_26_3) = all_26_16
% 9.59/2.11  | | 
% 9.59/2.11  | | ALPHA: (13) implies:
% 9.59/2.11  | |   (14)  all_26_6 = all_26_17
% 9.59/2.11  | |   (15)   ~ (all_26_15 = 0)
% 9.59/2.11  | |   (16)  f__integer__(all_26_3) = all_26_16
% 9.59/2.11  | |   (17)  f__integer__($sum(all_26_3, -1)) = all_26_5
% 9.59/2.11  | |   (18)  hp(all_26_17, all_26_5) = 0
% 9.59/2.11  | | 
% 9.59/2.11  | | REDUCE: (8), (14) imply:
% 9.59/2.11  | |   (19)  general(all_26_17)
% 9.59/2.11  | | 
% 9.59/2.11  | | GROUND_INST: instantiating (2) with all_26_17, all_26_16, all_26_5,
% 9.59/2.11  | |              all_26_15, $sum(all_26_3, -1), simplifying with (5), (9), (10),
% 9.59/2.11  | |              (16), (18), (19) gives:
% 9.59/2.12  | |   (20)  all_26_15 = 0 |  ? [v0: any] : ( ~ (v0 = all_26_5) &
% 9.59/2.12  | |           f__integer__($sum(all_26_3, -1)) = v0 & general(v0))
% 9.59/2.12  | | 
% 9.59/2.12  | | BETA: splitting (20) gives:
% 9.59/2.12  | | 
% 9.59/2.12  | | Case 1:
% 9.59/2.12  | | | 
% 9.59/2.12  | | |   (21)  all_26_15 = 0
% 9.59/2.12  | | | 
% 9.59/2.12  | | | REDUCE: (15), (21) imply:
% 9.59/2.12  | | |   (22)  $false
% 9.59/2.12  | | | 
% 9.59/2.12  | | | CLOSE: (22) is inconsistent.
% 9.59/2.12  | | | 
% 9.59/2.12  | | Case 2:
% 9.59/2.12  | | | 
% 9.59/2.12  | | |   (23)   ? [v0: any] : ( ~ (v0 = all_26_5) & f__integer__($sum(all_26_3,
% 9.59/2.12  | | |               -1)) = v0 & general(v0))
% 9.59/2.12  | | | 
% 9.59/2.12  | | | DELTA: instantiating (23) with fresh symbol all_45_0 gives:
% 9.59/2.12  | | |   (24)   ~ (all_45_0 = all_26_5) & f__integer__($sum(all_26_3, -1)) =
% 9.59/2.12  | | |         all_45_0 & general(all_45_0)
% 9.59/2.12  | | | 
% 9.59/2.12  | | | ALPHA: (24) implies:
% 9.59/2.12  | | |   (25)   ~ (all_45_0 = all_26_5)
% 9.59/2.12  | | |   (26)  f__integer__($sum(all_26_3, -1)) = all_45_0
% 9.59/2.12  | | | 
% 9.59/2.12  | | | GROUND_INST: instantiating (1) with $sum(all_26_3, -1), all_26_5,
% 9.59/2.12  | | |              all_45_0, simplifying with (17), (26) gives:
% 9.59/2.12  | | |   (27)  all_45_0 = all_26_5
% 9.59/2.12  | | | 
% 9.59/2.12  | | | REDUCE: (25), (27) imply:
% 9.59/2.12  | | |   (28)  $false
% 9.59/2.12  | | | 
% 9.59/2.12  | | | CLOSE: (28) is inconsistent.
% 9.59/2.12  | | | 
% 9.59/2.12  | | End of split
% 9.59/2.12  | | 
% 9.59/2.12  | Case 2:
% 9.59/2.12  | | 
% 9.59/2.12  | |   (29)  all_26_7 = all_26_16 & all_26_8 = all_26_12 & all_26_9 = 1 &
% 9.59/2.12  | |         all_26_11 = 0 & all_26_13 = all_26_17 &  ~ (all_26_14 = 0) &
% 9.59/2.12  | |         tp(all_26_17, all_26_12) = 0 & f__integer__($sum(all_26_10, -1)) =
% 9.59/2.12  | |         all_26_12 & f__integer__(all_26_10) = all_26_16
% 9.59/2.12  | | 
% 9.59/2.12  | | ALPHA: (29) implies:
% 9.59/2.12  | |   (30)  all_26_13 = all_26_17
% 9.59/2.12  | |   (31)   ~ (all_26_14 = 0)
% 9.59/2.12  | |   (32)  f__integer__(all_26_10) = all_26_16
% 9.59/2.12  | |   (33)  f__integer__($sum(all_26_10, -1)) = all_26_12
% 9.59/2.12  | |   (34)  tp(all_26_17, all_26_12) = 0
% 9.59/2.12  | | 
% 9.59/2.12  | | REDUCE: (6), (30) imply:
% 9.59/2.12  | |   (35)  general(all_26_17)
% 9.59/2.12  | | 
% 9.59/2.12  | | GROUND_INST: instantiating (3) with all_26_17, all_26_16, all_26_12,
% 9.59/2.12  | |              all_26_14, $sum(all_26_10, -1), simplifying with (5), (7),
% 9.59/2.12  | |              (11), (32), (34), (35) gives:
% 9.59/2.12  | |   (36)  all_26_14 = 0 |  ? [v0: any] : ( ~ (v0 = all_26_12) &
% 9.59/2.12  | |           f__integer__($sum(all_26_10, -1)) = v0 & general(v0))
% 9.59/2.12  | | 
% 9.59/2.12  | | BETA: splitting (36) gives:
% 9.59/2.12  | | 
% 9.59/2.12  | | Case 1:
% 9.59/2.12  | | | 
% 9.59/2.12  | | |   (37)  all_26_14 = 0
% 9.76/2.12  | | | 
% 9.76/2.12  | | | REDUCE: (31), (37) imply:
% 9.76/2.12  | | |   (38)  $false
% 9.76/2.12  | | | 
% 9.76/2.12  | | | CLOSE: (38) is inconsistent.
% 9.76/2.12  | | | 
% 9.76/2.12  | | Case 2:
% 9.76/2.12  | | | 
% 9.76/2.12  | | |   (39)   ? [v0: any] : ( ~ (v0 = all_26_12) & f__integer__($sum(all_26_10,
% 9.76/2.12  | | |               -1)) = v0 & general(v0))
% 9.76/2.12  | | | 
% 9.76/2.12  | | | DELTA: instantiating (39) with fresh symbol all_55_0 gives:
% 9.76/2.12  | | |   (40)   ~ (all_55_0 = all_26_12) & f__integer__($sum(all_26_10, -1)) =
% 9.76/2.12  | | |         all_55_0 & general(all_55_0)
% 9.76/2.12  | | | 
% 9.76/2.12  | | | ALPHA: (40) implies:
% 9.76/2.12  | | |   (41)   ~ (all_55_0 = all_26_12)
% 9.76/2.12  | | |   (42)  f__integer__($sum(all_26_10, -1)) = all_55_0
% 9.76/2.12  | | | 
% 9.76/2.12  | | | GROUND_INST: instantiating (1) with $sum(all_26_10, -1), all_26_12,
% 9.76/2.12  | | |              all_55_0, simplifying with (33), (42) gives:
% 9.76/2.12  | | |   (43)  all_55_0 = all_26_12
% 9.76/2.12  | | | 
% 9.76/2.13  | | | REDUCE: (41), (43) imply:
% 9.76/2.13  | | |   (44)  $false
% 9.76/2.13  | | | 
% 9.76/2.13  | | | CLOSE: (44) is inconsistent.
% 9.76/2.13  | | | 
% 9.76/2.13  | | End of split
% 9.76/2.13  | | 
% 9.76/2.13  | End of split
% 9.76/2.13  | 
% 9.76/2.13  End of proof
% 9.76/2.13  % SZS output end Proof for theBenchmark
% 9.76/2.13  
% 9.76/2.13  1495ms
%------------------------------------------------------------------------------