TSTP Solution File: DAT059_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : DAT059_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 : 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 : Wed Aug 30 22:19:03 EDT 2023

% Result   : Theorem 4.34s 1.35s
% Output   : Proof 4.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : DAT059_1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n026.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 : Thu Aug 24 14:56:17 EDT 2023
% 0.13/0.34  % 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/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.63  Running up to 7 provers in parallel.
% 0.19/0.65  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.65  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.65  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.65  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.65  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.65  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.19/0.65  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 2.28/1.05  Prover 1: Preprocessing ...
% 2.28/1.05  Prover 4: Preprocessing ...
% 2.74/1.10  Prover 6: Preprocessing ...
% 2.74/1.10  Prover 2: Preprocessing ...
% 2.74/1.10  Prover 0: Preprocessing ...
% 2.74/1.10  Prover 5: Preprocessing ...
% 2.74/1.10  Prover 3: Preprocessing ...
% 3.71/1.22  Prover 1: Warning: ignoring some quantifiers
% 3.71/1.22  Prover 3: Warning: ignoring some quantifiers
% 3.82/1.23  Prover 4: Warning: ignoring some quantifiers
% 3.82/1.24  Prover 1: Constructing countermodel ...
% 3.82/1.24  Prover 4: Constructing countermodel ...
% 3.82/1.24  Prover 3: Constructing countermodel ...
% 3.82/1.25  Prover 0: Proving ...
% 3.82/1.25  Prover 6: Proving ...
% 3.82/1.27  Prover 5: Proving ...
% 3.82/1.31  Prover 2: Proving ...
% 4.34/1.35  Prover 3: proved (702ms)
% 4.34/1.35  
% 4.34/1.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.34/1.35  
% 4.34/1.35  Prover 5: stopped
% 4.34/1.35  Prover 6: stopped
% 4.34/1.35  Prover 2: stopped
% 4.34/1.35  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.34/1.35  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.34/1.35  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.34/1.36  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.34/1.36  Prover 0: proved (720ms)
% 4.34/1.36  
% 4.34/1.36  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.34/1.36  
% 4.34/1.36  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.34/1.36  Prover 1: Found proof (size 8)
% 4.34/1.36  Prover 1: proved (724ms)
% 4.34/1.36  Prover 4: Found proof (size 8)
% 4.34/1.36  Prover 4: proved (717ms)
% 4.82/1.39  Prover 7: Preprocessing ...
% 4.82/1.39  Prover 8: Preprocessing ...
% 4.82/1.40  Prover 10: Preprocessing ...
% 4.82/1.40  Prover 11: Preprocessing ...
% 4.82/1.40  Prover 13: Preprocessing ...
% 4.82/1.41  Prover 7: stopped
% 4.82/1.41  Prover 10: stopped
% 4.82/1.41  Prover 11: stopped
% 4.82/1.42  Prover 13: stopped
% 4.82/1.43  Prover 8: Warning: ignoring some quantifiers
% 4.82/1.44  Prover 8: Constructing countermodel ...
% 4.82/1.44  Prover 8: stopped
% 4.82/1.44  
% 4.82/1.44  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.82/1.44  
% 4.82/1.45  % SZS output start Proof for theBenchmark
% 4.82/1.45  Assumptions after simplification:
% 4.82/1.45  ---------------------------------
% 4.82/1.45  
% 4.82/1.45    (ax_20)
% 4.82/1.49     ! [v0: data] :  ! [v1: array] :  ! [v2: int] :  ! [v3: data] :  ! [v4: array]
% 4.82/1.49    :  ! [v5: array] : ( ~ (put(v4, v2, v3) = v5) |  ~ (put(v1, v2, v0) = v4) |  ~
% 4.82/1.49      array(v1) |  ~ data(v3) |  ~ data(v0) | (put(v1, v2, v3) = v5 & array(v5)))
% 4.82/1.49  
% 4.82/1.49    (th_lem_5)
% 4.82/1.49     ? [v0: data] :  ? [v1: array] :  ? [v2: int] :  ? [v3: data] :  ? [v4: array]
% 4.82/1.49    :  ? [v5: array] :  ? [v6: array] : ( ~ (v6 = v5) & put(v4, v2, v3) = v5 &
% 4.82/1.49      put(v1, v2, v3) = v6 & put(v1, v2, v0) = v4 & array(v6) & array(v5) &
% 4.82/1.49      array(v4) & array(v1) & data(v3) & data(v0))
% 4.82/1.49  
% 4.82/1.49    (function-axioms)
% 4.82/1.49     ! [v0: array] :  ! [v1: array] :  ! [v2: data] :  ! [v3: int] :  ! [v4:
% 4.82/1.49      array] : (v1 = v0 |  ~ (put(v4, v3, v2) = v1) |  ~ (put(v4, v3, v2) = v0)) &
% 4.82/1.49     ! [v0: data] :  ! [v1: data] :  ! [v2: int] :  ! [v3: array] : (v1 = v0 |  ~
% 4.82/1.49      (get(v3, v2) = v1) |  ~ (get(v3, v2) = v0))
% 4.82/1.49  
% 4.82/1.49  Further assumptions not needed in the proof:
% 4.82/1.49  --------------------------------------------
% 4.82/1.49  ax_17, ax_18, ax_19, ax_21
% 4.82/1.49  
% 4.82/1.49  Those formulas are unsatisfiable:
% 4.82/1.49  ---------------------------------
% 4.82/1.49  
% 4.82/1.49  Begin of proof
% 4.82/1.49  | 
% 4.82/1.49  | ALPHA: (function-axioms) implies:
% 4.82/1.50  |   (1)   ! [v0: array] :  ! [v1: array] :  ! [v2: data] :  ! [v3: int] :  !
% 4.82/1.50  |        [v4: array] : (v1 = v0 |  ~ (put(v4, v3, v2) = v1) |  ~ (put(v4, v3,
% 4.82/1.50  |              v2) = v0))
% 4.82/1.50  | 
% 4.82/1.50  | DELTA: instantiating (th_lem_5) with fresh symbols all_13_0, all_13_1,
% 4.82/1.50  |        all_13_2, all_13_3, all_13_4, all_13_5, all_13_6 gives:
% 4.82/1.50  |   (2)   ~ (all_13_0 = all_13_1) & put(all_13_2, all_13_4, all_13_3) = all_13_1
% 4.82/1.50  |        & put(all_13_5, all_13_4, all_13_3) = all_13_0 & put(all_13_5,
% 4.82/1.50  |          all_13_4, all_13_6) = all_13_2 & array(all_13_0) & array(all_13_1) &
% 4.82/1.50  |        array(all_13_2) & array(all_13_5) & data(all_13_3) & data(all_13_6)
% 4.82/1.50  | 
% 4.82/1.50  | ALPHA: (2) implies:
% 4.82/1.50  |   (3)   ~ (all_13_0 = all_13_1)
% 4.82/1.50  |   (4)  data(all_13_6)
% 4.82/1.50  |   (5)  data(all_13_3)
% 4.82/1.50  |   (6)  array(all_13_5)
% 4.82/1.50  |   (7)  put(all_13_5, all_13_4, all_13_6) = all_13_2
% 4.82/1.50  |   (8)  put(all_13_5, all_13_4, all_13_3) = all_13_0
% 4.82/1.50  |   (9)  put(all_13_2, all_13_4, all_13_3) = all_13_1
% 4.82/1.50  | 
% 4.82/1.51  | GROUND_INST: instantiating (ax_20) with all_13_6, all_13_5, all_13_4,
% 4.82/1.51  |              all_13_3, all_13_2, all_13_1, simplifying with (4), (5), (6),
% 4.82/1.51  |              (7), (9) gives:
% 4.82/1.51  |   (10)  put(all_13_5, all_13_4, all_13_3) = all_13_1 & array(all_13_1)
% 4.82/1.51  | 
% 4.82/1.51  | ALPHA: (10) implies:
% 4.82/1.51  |   (11)  put(all_13_5, all_13_4, all_13_3) = all_13_1
% 4.82/1.51  | 
% 4.82/1.51  | GROUND_INST: instantiating (1) with all_13_0, all_13_1, all_13_3, all_13_4,
% 4.82/1.51  |              all_13_5, simplifying with (8), (11) gives:
% 4.82/1.51  |   (12)  all_13_0 = all_13_1
% 4.82/1.51  | 
% 4.82/1.51  | REDUCE: (3), (12) imply:
% 4.82/1.51  |   (13)  $false
% 4.82/1.51  | 
% 4.82/1.51  | CLOSE: (13) is inconsistent.
% 4.82/1.51  | 
% 4.82/1.51  End of proof
% 4.82/1.51  % SZS output end Proof for theBenchmark
% 4.82/1.51  
% 4.82/1.51  891ms
%------------------------------------------------------------------------------