TSTP Solution File: DAT066_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : DAT066_1 : TPTP v8.1.2. Released v5.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 : Wed Aug 30 22:19:05 EDT 2023

% Result   : Theorem 6.10s 1.57s
% Output   : Proof 8.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : DAT066_1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.10  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Thu Aug 24 14:37:27 EDT 2023
% 0.10/0.29  % CPUTime  : 
% 0.13/0.51  ________       _____
% 0.13/0.51  ___  __ \_________(_)________________________________
% 0.13/0.51  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.13/0.51  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.13/0.51  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.13/0.51  
% 0.13/0.51  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.13/0.51  (2023-06-19)
% 0.13/0.51  
% 0.13/0.51  (c) Philipp Rümmer, 2009-2023
% 0.13/0.51  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.13/0.51                Amanda Stjerna.
% 0.13/0.51  Free software under BSD-3-Clause.
% 0.13/0.51  
% 0.13/0.51  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.13/0.51  
% 0.13/0.51  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.13/0.52  Running up to 7 provers in parallel.
% 0.13/0.54  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.13/0.54  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.13/0.54  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.13/0.54  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.13/0.54  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.13/0.54  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.13/0.54  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.45/1.00  Prover 4: Preprocessing ...
% 2.45/1.01  Prover 1: Preprocessing ...
% 2.45/1.04  Prover 6: Preprocessing ...
% 2.45/1.04  Prover 0: Preprocessing ...
% 2.45/1.04  Prover 5: Preprocessing ...
% 2.45/1.04  Prover 2: Preprocessing ...
% 2.94/1.05  Prover 3: Preprocessing ...
% 5.01/1.36  Prover 6: Constructing countermodel ...
% 5.01/1.37  Prover 3: Constructing countermodel ...
% 5.01/1.37  Prover 1: Constructing countermodel ...
% 5.01/1.42  Prover 4: Constructing countermodel ...
% 5.01/1.42  Prover 5: Proving ...
% 5.01/1.48  Prover 0: Proving ...
% 5.01/1.50  Prover 2: Proving ...
% 6.10/1.57  Prover 3: proved (1030ms)
% 6.10/1.57  
% 6.10/1.57  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.10/1.57  
% 6.10/1.57  Prover 6: stopped
% 6.10/1.57  Prover 2: stopped
% 6.10/1.57  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.10/1.57  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.10/1.58  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.10/1.58  Prover 5: stopped
% 6.50/1.58  Prover 0: stopped
% 6.50/1.59  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.50/1.59  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.78/1.63  Prover 8: Preprocessing ...
% 6.78/1.66  Prover 10: Preprocessing ...
% 6.78/1.67  Prover 11: Preprocessing ...
% 6.78/1.67  Prover 7: Preprocessing ...
% 6.78/1.68  Prover 13: Preprocessing ...
% 6.78/1.68  Prover 4: Found proof (size 24)
% 6.78/1.68  Prover 4: proved (1139ms)
% 6.78/1.68  Prover 1: Found proof (size 24)
% 6.78/1.68  Prover 1: proved (1154ms)
% 6.78/1.69  Prover 10: stopped
% 6.78/1.71  Prover 7: stopped
% 7.38/1.72  Prover 11: stopped
% 7.38/1.73  Prover 13: stopped
% 7.38/1.75  Prover 8: Warning: ignoring some quantifiers
% 7.38/1.76  Prover 8: Constructing countermodel ...
% 7.38/1.77  Prover 8: stopped
% 7.38/1.77  
% 7.38/1.77  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.38/1.77  
% 7.38/1.77  % SZS output start Proof for theBenchmark
% 7.38/1.78  Assumptions after simplification:
% 7.38/1.78  ---------------------------------
% 7.38/1.78  
% 7.38/1.78    (ax_2)
% 7.76/1.82     ! [v0: heap] :  ! [v1: int] :  ! [v2: int] :  ! [v3: heap] :  ! [v4: int] :
% 7.76/1.82    (v4 = v2 |  ~ (app(v0, v2) = v3) |  ~ (sel(v3, v1) = v4) |  ~ heap(v0) |  ?
% 7.76/1.82      [v5: int] : ( ~ ($difference(v5, v1) = -1) & length(v0) = v5))
% 7.76/1.82  
% 7.76/1.82    (ax_26)
% 7.76/1.83     ! [v0: int] :  ! [v1: heap] :  ! [v2: heap] : ( ~ (app(v1, v0) = v2) |  ~
% 7.76/1.83      heap(v1) |  ? [v3: int] : (length(v2) = v3 & length(v1) = $sum(v3, -1)))
% 7.76/1.83  
% 7.76/1.83    (ax_3)
% 7.76/1.83     ! [v0: int] :  ! [v1: heap] :  ! [v2: int] :  ! [v3: heap] :  ! [v4: int] : (
% 7.76/1.83      ~ (app(v1, v0) = v3) |  ~ (sel(v3, v2) = v4) |  ~ heap(v1) |  ? [v5: int] : 
% 7.76/1.83      ? [v6: int] : (length(v1) = v5 & sel(v1, v2) = v6 & (v6 = v4 |
% 7.76/1.83          $difference(v5, v2) = -1)))
% 7.76/1.83  
% 7.76/1.83    (th_1)
% 7.76/1.83     ? [v0: int] :  ? [v1: int] :  ? [v2: heap] :  ? [v3: heap] :  ? [v4: int] : (
% 7.76/1.83      ~ (v4 = v0) & app(v2, v0) = v3 & length(v2) = $sum(v1, -1) & sel(v3, v1) =
% 7.76/1.83      v4 & heap(v3) & heap(v2))
% 7.76/1.83  
% 7.76/1.83    (function-axioms)
% 7.76/1.84     ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: heap] :  !
% 7.76/1.84    [v3: heap] : (v1 = v0 |  ~ (lsls(v3, v2) = v1) |  ~ (lsls(v3, v2) = v0)) &  !
% 7.76/1.84    [v0: heap] :  ! [v1: heap] :  ! [v2: int] :  ! [v3: heap] : (v1 = v0 |  ~
% 7.76/1.84      (app(v3, v2) = v1) |  ~ (app(v3, v2) = v0)) &  ! [v0: int] :  ! [v1: int] : 
% 7.76/1.84    ! [v2: int] :  ! [v3: heap] : (v1 = v0 |  ~ (sel(v3, v2) = v1) |  ~ (sel(v3,
% 7.76/1.84          v2) = v0)) &  ! [v0: int] :  ! [v1: int] :  ! [v2: heap] : (v1 = v0 |  ~
% 7.76/1.84      (toop(v2) = v1) |  ~ (toop(v2) = v0)) &  ! [v0: heap] :  ! [v1: heap] :  !
% 7.76/1.84    [v2: heap] : (v1 = v0 |  ~ (get(v2) = v1) |  ~ (get(v2) = v0)) &  ! [v0: int]
% 7.76/1.84    :  ! [v1: int] :  ! [v2: heap] : (v1 = v0 |  ~ (length(v2) = v1) |  ~
% 7.76/1.84      (length(v2) = v0))
% 7.76/1.84  
% 7.76/1.84  Further assumptions not needed in the proof:
% 7.76/1.84  --------------------------------------------
% 7.76/1.84  ax_1, ax_20, ax_21, ax_22, ax_23, ax_24, ax_25, ax_27, ax_28, ax_29, ax_30
% 7.76/1.84  
% 7.76/1.84  Those formulas are unsatisfiable:
% 7.76/1.84  ---------------------------------
% 7.76/1.84  
% 7.76/1.84  Begin of proof
% 7.76/1.84  | 
% 7.76/1.84  | ALPHA: (function-axioms) implies:
% 7.76/1.85  |   (1)   ! [v0: int] :  ! [v1: int] :  ! [v2: heap] : (v1 = v0 |  ~ (length(v2)
% 7.76/1.85  |            = v1) |  ~ (length(v2) = v0))
% 7.76/1.85  | 
% 7.76/1.85  | DELTA: instantiating (th_1) with fresh symbols all_19_0, all_19_1, all_19_2,
% 7.76/1.85  |        all_19_3, all_19_4 gives:
% 7.76/1.85  |   (2)   ~ (all_19_0 = all_19_4) & app(all_19_2, all_19_4) = all_19_1 &
% 7.76/1.85  |        length(all_19_2) = $sum(all_19_3, -1) & sel(all_19_1, all_19_3) =
% 7.76/1.85  |        all_19_0 & heap(all_19_1) & heap(all_19_2)
% 7.76/1.85  | 
% 7.76/1.85  | ALPHA: (2) implies:
% 7.76/1.85  |   (3)   ~ (all_19_0 = all_19_4)
% 7.76/1.85  |   (4)  heap(all_19_2)
% 7.76/1.85  |   (5)  sel(all_19_1, all_19_3) = all_19_0
% 7.76/1.85  |   (6)  length(all_19_2) = $sum(all_19_3, -1)
% 7.76/1.85  |   (7)  app(all_19_2, all_19_4) = all_19_1
% 7.76/1.85  | 
% 7.76/1.86  | GROUND_INST: instantiating (ax_2) with all_19_2, all_19_3, all_19_4, all_19_1,
% 7.76/1.86  |              all_19_0, simplifying with (4), (5), (7) gives:
% 7.76/1.86  |   (8)  all_19_0 = all_19_4 |  ? [v0: int] : ( ~ ($difference(v0, all_19_3) =
% 7.76/1.86  |            -1) & length(all_19_2) = v0)
% 7.76/1.86  | 
% 7.76/1.86  | GROUND_INST: instantiating (ax_3) with all_19_4, all_19_2, all_19_3, all_19_1,
% 7.76/1.86  |              all_19_0, simplifying with (4), (5), (7) gives:
% 7.76/1.86  |   (9)   ? [v0: int] :  ? [v1: int] : (length(all_19_2) = v0 & sel(all_19_2,
% 7.76/1.86  |            all_19_3) = v1 & (v1 = all_19_0 | $difference(v0, all_19_3) = -1))
% 7.76/1.86  | 
% 7.76/1.86  | GROUND_INST: instantiating (ax_26) with all_19_4, all_19_2, all_19_1,
% 7.76/1.86  |              simplifying with (4), (7) gives:
% 7.76/1.86  |   (10)   ? [v0: int] : (length(all_19_1) = v0 & length(all_19_2) = $sum(v0,
% 7.76/1.86  |             -1))
% 7.76/1.86  | 
% 7.76/1.86  | DELTA: instantiating (10) with fresh symbol all_27_0 gives:
% 7.76/1.86  |   (11)  length(all_19_1) = all_27_0 & length(all_19_2) = $sum(all_27_0, -1)
% 7.76/1.86  | 
% 7.76/1.86  | ALPHA: (11) implies:
% 7.76/1.86  |   (12)  length(all_19_2) = $sum(all_27_0, -1)
% 7.76/1.86  | 
% 7.76/1.86  | DELTA: instantiating (9) with fresh symbols all_29_0, all_29_1 gives:
% 7.76/1.87  |   (13)  length(all_19_2) = all_29_1 & sel(all_19_2, all_19_3) = all_29_0 &
% 7.76/1.87  |         (all_29_0 = all_19_0 | $difference(all_29_1, all_19_3) = -1)
% 7.76/1.87  | 
% 7.76/1.87  | ALPHA: (13) implies:
% 7.76/1.87  |   (14)  length(all_19_2) = all_29_1
% 7.76/1.87  | 
% 7.76/1.87  | BETA: splitting (8) gives:
% 7.76/1.87  | 
% 7.76/1.87  | Case 1:
% 7.76/1.87  | | 
% 7.76/1.87  | |   (15)  all_19_0 = all_19_4
% 7.76/1.87  | | 
% 7.76/1.87  | | REDUCE: (3), (15) imply:
% 7.76/1.87  | |   (16)  $false
% 7.76/1.87  | | 
% 7.76/1.87  | | CLOSE: (16) is inconsistent.
% 7.76/1.87  | | 
% 7.76/1.87  | Case 2:
% 7.76/1.87  | | 
% 7.76/1.87  | |   (17)   ? [v0: int] : ( ~ ($difference(v0, all_19_3) = -1) &
% 7.76/1.87  | |           length(all_19_2) = v0)
% 8.16/1.87  | | 
% 8.16/1.87  | | DELTA: instantiating (17) with fresh symbol all_35_0 gives:
% 8.16/1.87  | |   (18)   ~ ($difference(all_35_0, all_19_3) = -1) & length(all_19_2) =
% 8.16/1.87  | |         all_35_0
% 8.16/1.87  | | 
% 8.16/1.87  | | ALPHA: (18) implies:
% 8.16/1.87  | |   (19)   ~ ($difference(all_35_0, all_19_3) = -1)
% 8.16/1.87  | |   (20)  length(all_19_2) = all_35_0
% 8.16/1.87  | | 
% 8.16/1.88  | | GROUND_INST: instantiating (1) with $sum(all_19_3, -1), all_29_1, all_19_2,
% 8.16/1.88  | |              simplifying with (6), (14) gives:
% 8.16/1.88  | |   (21)  $difference(all_29_1, all_19_3) = -1
% 8.16/1.88  | | 
% 8.16/1.88  | | GROUND_INST: instantiating (1) with all_29_1, all_35_0, all_19_2,
% 8.16/1.88  | |              simplifying with (14), (20) gives:
% 8.16/1.88  | |   (22)  all_35_0 = all_29_1
% 8.16/1.88  | | 
% 8.16/1.88  | | GROUND_INST: instantiating (1) with $sum(all_27_0, -1), all_35_0, all_19_2,
% 8.16/1.88  | |              simplifying with (12), (20) gives:
% 8.16/1.88  | |   (23)  $difference(all_35_0, all_27_0) = -1
% 8.16/1.88  | | 
% 8.16/1.88  | | COMBINE_EQS: (22), (23) imply:
% 8.20/1.88  | |   (24)  $difference(all_29_1, all_27_0) = -1
% 8.20/1.88  | | 
% 8.20/1.88  | | SIMP: (24) implies:
% 8.20/1.88  | |   (25)  $difference(all_29_1, all_27_0) = -1
% 8.20/1.88  | | 
% 8.20/1.88  | | COMBINE_EQS: (21), (25) imply:
% 8.20/1.88  | |   (26)  all_27_0 = all_19_3
% 8.20/1.88  | | 
% 8.20/1.88  | | COMBINE_EQS: (23), (26) imply:
% 8.20/1.88  | |   (27)  $difference(all_35_0, all_19_3) = -1
% 8.20/1.88  | | 
% 8.20/1.88  | | REDUCE: (19), (27) imply:
% 8.20/1.88  | |   (28)  $false
% 8.20/1.88  | | 
% 8.20/1.88  | | CLOSE: (28) is inconsistent.
% 8.20/1.88  | | 
% 8.20/1.88  | End of split
% 8.20/1.88  | 
% 8.20/1.88  End of proof
% 8.20/1.88  % SZS output end Proof for theBenchmark
% 8.20/1.88  
% 8.20/1.88  1373ms
%------------------------------------------------------------------------------