TSTP Solution File: DAT068_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : DAT068_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 : n006.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 5.94s 1.58s
% Output : Proof 6.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT068_1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n006.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 : Thu Aug 24 14:11:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.62 ________ _____
% 0.21/0.62 ___ __ \_________(_)________________________________
% 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.62
% 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.62 (2023-06-19)
% 0.21/0.62
% 0.21/0.62 (c) Philipp Rümmer, 2009-2023
% 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.62 Amanda Stjerna.
% 0.21/0.62 Free software under BSD-3-Clause.
% 0.21/0.62
% 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.62
% 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.64 Running up to 7 provers in parallel.
% 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.73/1.12 Prover 4: Preprocessing ...
% 2.73/1.12 Prover 1: Preprocessing ...
% 2.73/1.15 Prover 0: Preprocessing ...
% 2.73/1.15 Prover 2: Preprocessing ...
% 2.73/1.15 Prover 3: Preprocessing ...
% 2.73/1.15 Prover 6: Preprocessing ...
% 2.73/1.15 Prover 5: Preprocessing ...
% 4.23/1.41 Prover 1: Constructing countermodel ...
% 4.23/1.43 Prover 4: Constructing countermodel ...
% 4.23/1.44 Prover 3: Constructing countermodel ...
% 4.23/1.44 Prover 6: Constructing countermodel ...
% 4.23/1.46 Prover 5: Proving ...
% 4.23/1.48 Prover 0: Proving ...
% 5.20/1.51 Prover 2: Proving ...
% 5.94/1.58 Prover 3: proved (932ms)
% 5.94/1.58
% 5.94/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.94/1.58
% 5.94/1.58 Prover 6: stopped
% 5.94/1.59 Prover 2: stopped
% 5.94/1.59 Prover 5: stopped
% 5.94/1.59 Prover 0: proved (940ms)
% 5.94/1.59
% 5.94/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.94/1.59
% 5.94/1.59 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.94/1.59 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.94/1.59 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.94/1.59 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.94/1.59 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.37/1.64 Prover 13: Preprocessing ...
% 6.37/1.64 Prover 8: Preprocessing ...
% 6.37/1.65 Prover 11: Preprocessing ...
% 6.37/1.65 Prover 10: Preprocessing ...
% 6.37/1.65 Prover 7: Preprocessing ...
% 6.37/1.66 Prover 4: Found proof (size 16)
% 6.37/1.66 Prover 4: proved (1018ms)
% 6.37/1.67 Prover 1: stopped
% 6.37/1.67 Prover 7: stopped
% 6.37/1.67 Prover 11: stopped
% 6.37/1.68 Prover 13: stopped
% 6.37/1.68 Prover 10: stopped
% 6.37/1.71 Prover 8: Warning: ignoring some quantifiers
% 6.37/1.71 Prover 8: Constructing countermodel ...
% 6.37/1.72 Prover 8: stopped
% 6.37/1.72
% 6.37/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.37/1.72
% 6.37/1.72 % SZS output start Proof for theBenchmark
% 6.97/1.73 Assumptions after simplification:
% 6.97/1.73 ---------------------------------
% 6.97/1.73
% 6.97/1.73 (ax_3)
% 6.97/1.75 ! [v0: int] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : ! [v4: int] : (
% 6.97/1.75 ~ (app(v1, v0) = v3) | ~ (sel(v3, v2) = v4) | ~ heap(v1) | ? [v5: int] :
% 6.97/1.75 ? [v6: int] : (length(v1) = v5 & sel(v1, v2) = v6 & (v6 = v4 |
% 6.97/1.75 $difference(v5, v2) = -1)))
% 6.97/1.75
% 6.97/1.75 (th_3)
% 6.97/1.75 ? [v0: int] : ? [v1: int] : ? [v2: heap] : ? [v3: heap] : ? [v4: int] :
% 6.97/1.75 ? [v5: int] : ? [v6: int] : ( ~ (v5 = v4) & $lesseq(1, $difference(v6, v1)) &
% 6.97/1.75 app(v2, v0) = v3 & length(v2) = v6 & sel(v3, v1) = v4 & sel(v2, v1) = v5 &
% 6.97/1.75 heap(v3) & heap(v2))
% 6.97/1.75
% 6.97/1.75 (function-axioms)
% 6.97/1.76 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: heap] : !
% 6.97/1.76 [v3: heap] : (v1 = v0 | ~ (lsls(v3, v2) = v1) | ~ (lsls(v3, v2) = v0)) & !
% 6.97/1.76 [v0: heap] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~
% 6.97/1.76 (app(v3, v2) = v1) | ~ (app(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] :
% 6.97/1.76 ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~ (sel(v3, v2) = v1) | ~ (sel(v3,
% 6.97/1.76 v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~
% 6.97/1.76 (toop(v2) = v1) | ~ (toop(v2) = v0)) & ! [v0: heap] : ! [v1: heap] : !
% 6.97/1.76 [v2: heap] : (v1 = v0 | ~ (get(v2) = v1) | ~ (get(v2) = v0)) & ! [v0: int]
% 6.97/1.76 : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2) = v1) | ~
% 6.97/1.76 (length(v2) = v0))
% 6.97/1.76
% 6.97/1.76 Further assumptions not needed in the proof:
% 6.97/1.76 --------------------------------------------
% 6.97/1.76 ax_1, ax_2, ax_20, ax_21, ax_22, ax_23, ax_24, ax_25, ax_26, ax_27, ax_28,
% 6.97/1.76 ax_29, ax_30
% 6.97/1.76
% 6.97/1.76 Those formulas are unsatisfiable:
% 6.97/1.76 ---------------------------------
% 6.97/1.76
% 6.97/1.76 Begin of proof
% 6.97/1.76 |
% 6.97/1.76 | ALPHA: (function-axioms) implies:
% 6.97/1.76 | (1) ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2)
% 6.97/1.76 | = v1) | ~ (length(v2) = v0))
% 6.97/1.76 | (2) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: heap] : (v1 = v0 |
% 6.97/1.76 | ~ (sel(v3, v2) = v1) | ~ (sel(v3, v2) = v0))
% 6.97/1.76 |
% 6.97/1.76 | DELTA: instantiating (th_3) with fresh symbols all_19_0, all_19_1, all_19_2,
% 6.97/1.76 | all_19_3, all_19_4, all_19_5, all_19_6 gives:
% 6.97/1.77 | (3) ~ (all_19_1 = all_19_2) & $lesseq(1, $difference(all_19_0, all_19_5))
% 6.97/1.77 | & app(all_19_4, all_19_6) = all_19_3 & length(all_19_4) = all_19_0 &
% 6.97/1.77 | sel(all_19_3, all_19_5) = all_19_2 & sel(all_19_4, all_19_5) = all_19_1
% 6.97/1.77 | & heap(all_19_3) & heap(all_19_4)
% 6.97/1.77 |
% 6.97/1.77 | ALPHA: (3) implies:
% 6.97/1.77 | (4) ~ (all_19_1 = all_19_2)
% 6.97/1.77 | (5) $lesseq(1, $difference(all_19_0, all_19_5))
% 6.97/1.77 | (6) heap(all_19_4)
% 6.97/1.77 | (7) sel(all_19_4, all_19_5) = all_19_1
% 6.97/1.77 | (8) sel(all_19_3, all_19_5) = all_19_2
% 6.97/1.77 | (9) length(all_19_4) = all_19_0
% 6.97/1.77 | (10) app(all_19_4, all_19_6) = all_19_3
% 6.97/1.77 |
% 6.97/1.77 | GROUND_INST: instantiating (ax_3) with all_19_6, all_19_4, all_19_5, all_19_3,
% 6.97/1.77 | all_19_2, simplifying with (6), (8), (10) gives:
% 6.97/1.77 | (11) ? [v0: int] : ? [v1: int] : (length(all_19_4) = v0 & sel(all_19_4,
% 6.97/1.77 | all_19_5) = v1 & (v1 = all_19_2 | $difference(v0, all_19_5) = -1))
% 6.97/1.77 |
% 6.97/1.77 | DELTA: instantiating (11) with fresh symbols all_33_0, all_33_1 gives:
% 6.97/1.77 | (12) length(all_19_4) = all_33_1 & sel(all_19_4, all_19_5) = all_33_0 &
% 6.97/1.77 | (all_33_0 = all_19_2 | $difference(all_33_1, all_19_5) = -1)
% 6.97/1.77 |
% 6.97/1.77 | ALPHA: (12) implies:
% 6.97/1.77 | (13) sel(all_19_4, all_19_5) = all_33_0
% 6.97/1.77 | (14) length(all_19_4) = all_33_1
% 6.97/1.77 | (15) all_33_0 = all_19_2 | $difference(all_33_1, all_19_5) = -1
% 6.97/1.77 |
% 6.97/1.77 | GROUND_INST: instantiating (2) with all_19_1, all_33_0, all_19_5, all_19_4,
% 6.97/1.77 | simplifying with (7), (13) gives:
% 6.97/1.77 | (16) all_33_0 = all_19_1
% 6.97/1.77 |
% 6.97/1.77 | GROUND_INST: instantiating (1) with all_19_0, all_33_1, all_19_4, simplifying
% 6.97/1.77 | with (9), (14) gives:
% 6.97/1.77 | (17) all_33_1 = all_19_0
% 6.97/1.77 |
% 6.97/1.77 | BETA: splitting (15) gives:
% 6.97/1.77 |
% 6.97/1.77 | Case 1:
% 6.97/1.77 | |
% 6.97/1.77 | | (18) all_33_0 = all_19_2
% 6.97/1.77 | |
% 6.97/1.78 | | COMBINE_EQS: (16), (18) imply:
% 6.97/1.78 | | (19) all_19_1 = all_19_2
% 6.97/1.78 | |
% 6.97/1.78 | | REDUCE: (4), (19) imply:
% 6.97/1.78 | | (20) $false
% 6.97/1.78 | |
% 6.97/1.78 | | CLOSE: (20) is inconsistent.
% 6.97/1.78 | |
% 6.97/1.78 | Case 2:
% 6.97/1.78 | |
% 6.97/1.78 | | (21) $difference(all_33_1, all_19_5) = -1
% 6.97/1.78 | |
% 6.97/1.78 | | COMBINE_EQS: (17), (21) imply:
% 6.97/1.78 | | (22) $difference(all_19_0, all_19_5) = -1
% 6.97/1.78 | |
% 6.97/1.78 | | SIMP: (22) implies:
% 6.97/1.78 | | (23) $difference(all_19_0, all_19_5) = -1
% 6.97/1.78 | |
% 6.97/1.78 | | REDUCE: (5), (23) imply:
% 6.97/1.78 | | (24) $false
% 6.97/1.78 | |
% 6.97/1.78 | | CLOSE: (24) is inconsistent.
% 6.97/1.78 | |
% 6.97/1.78 | End of split
% 6.97/1.78 |
% 6.97/1.78 End of proof
% 6.97/1.78 % SZS output end Proof for theBenchmark
% 6.97/1.78
% 6.97/1.78 1154ms
%------------------------------------------------------------------------------