TSTP Solution File: DAT070_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : DAT070_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 : n016.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:06 EDT 2023
% Result : Theorem 5.50s 1.55s
% Output : Proof 7.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT070_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.18/0.35 % Computer : n016.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 24 15:15:39 EDT 2023
% 0.18/0.35 % CPUTime :
% 0.21/0.60 ________ _____
% 0.21/0.60 ___ __ \_________(_)________________________________
% 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.60
% 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.60 (2023-06-19)
% 0.21/0.60
% 0.21/0.60 (c) Philipp Rümmer, 2009-2023
% 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.60 Amanda Stjerna.
% 0.21/0.60 Free software under BSD-3-Clause.
% 0.21/0.60
% 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.60
% 0.21/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.61 Running up to 7 provers in parallel.
% 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.69/1.09 Prover 4: Preprocessing ...
% 2.69/1.09 Prover 1: Preprocessing ...
% 3.19/1.15 Prover 2: Preprocessing ...
% 3.19/1.15 Prover 5: Preprocessing ...
% 3.19/1.15 Prover 0: Preprocessing ...
% 3.19/1.15 Prover 6: Preprocessing ...
% 3.19/1.16 Prover 3: Preprocessing ...
% 4.55/1.40 Prover 6: Constructing countermodel ...
% 4.55/1.41 Prover 4: Constructing countermodel ...
% 4.55/1.41 Prover 3: Constructing countermodel ...
% 4.55/1.41 Prover 1: Constructing countermodel ...
% 4.55/1.41 Prover 5: Proving ...
% 4.55/1.48 Prover 0: Proving ...
% 5.50/1.51 Prover 2: Proving ...
% 5.50/1.54 Prover 3: proved (910ms)
% 5.50/1.55
% 5.50/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.50/1.55
% 5.50/1.55 Prover 6: stopped
% 5.50/1.55 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.50/1.55 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.50/1.56 Prover 5: stopped
% 5.50/1.56 Prover 2: stopped
% 6.15/1.57 Prover 0: proved (939ms)
% 6.15/1.57
% 6.15/1.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.15/1.57
% 6.15/1.58 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.15/1.58 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.15/1.58 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.37/1.59 Prover 8: Preprocessing ...
% 6.37/1.61 Prover 7: Preprocessing ...
% 6.37/1.62 Prover 11: Preprocessing ...
% 6.37/1.63 Prover 4: Found proof (size 16)
% 6.37/1.63 Prover 4: proved (1001ms)
% 6.64/1.63 Prover 1: stopped
% 6.67/1.64 Prover 13: Preprocessing ...
% 6.67/1.64 Prover 10: Preprocessing ...
% 6.67/1.65 Prover 7: stopped
% 6.67/1.66 Prover 11: stopped
% 6.67/1.67 Prover 10: stopped
% 6.67/1.67 Prover 13: stopped
% 6.67/1.69 Prover 8: Warning: ignoring some quantifiers
% 6.67/1.69 Prover 8: Constructing countermodel ...
% 6.67/1.70 Prover 8: stopped
% 6.67/1.70
% 6.67/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.67/1.70
% 6.67/1.70 % SZS output start Proof for theBenchmark
% 7.08/1.70 Assumptions after simplification:
% 7.08/1.70 ---------------------------------
% 7.08/1.70
% 7.08/1.70 (ax_3)
% 7.08/1.73 ! [v0: int] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : ! [v4: int] : (
% 7.08/1.73 ~ (app(v1, v0) = v3) | ~ (sel(v3, v2) = v4) | ~ heap(v1) | ? [v5: int] :
% 7.08/1.73 ? [v6: int] : (length(v1) = v5 & sel(v1, v2) = v6 & (v6 = v4 |
% 7.08/1.73 $difference(v5, v2) = -1)))
% 7.08/1.73
% 7.08/1.73 (th_5)
% 7.08/1.73 ? [v0: int] : ? [v1: int] : ? [v2: heap] : ? [v3: heap] : ? [v4: int] :
% 7.08/1.73 ? [v5: int] : ? [v6: int] : ( ~ (v5 = v4) & $lesseq(v1, v6) & app(v2, v0) =
% 7.08/1.73 v3 & length(v2) = v6 & sel(v3, v1) = v4 & sel(v2, v1) = v5 & heap(v3) &
% 7.08/1.73 heap(v2))
% 7.08/1.73
% 7.08/1.73 (function-axioms)
% 7.08/1.73 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: heap] : !
% 7.08/1.73 [v3: heap] : (v1 = v0 | ~ (lsls(v3, v2) = v1) | ~ (lsls(v3, v2) = v0)) & !
% 7.08/1.73 [v0: heap] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~
% 7.08/1.73 (app(v3, v2) = v1) | ~ (app(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] :
% 7.08/1.73 ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~ (sel(v3, v2) = v1) | ~ (sel(v3,
% 7.08/1.73 v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~
% 7.08/1.73 (toop(v2) = v1) | ~ (toop(v2) = v0)) & ! [v0: heap] : ! [v1: heap] : !
% 7.08/1.73 [v2: heap] : (v1 = v0 | ~ (get(v2) = v1) | ~ (get(v2) = v0)) & ! [v0: int]
% 7.08/1.73 : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2) = v1) | ~
% 7.08/1.74 (length(v2) = v0))
% 7.08/1.74
% 7.08/1.74 Further assumptions not needed in the proof:
% 7.08/1.74 --------------------------------------------
% 7.08/1.74 ax_1, ax_2, ax_20, ax_21, ax_22, ax_23, ax_24, ax_25, ax_26, ax_27, ax_28,
% 7.08/1.74 ax_29, ax_30
% 7.08/1.74
% 7.08/1.74 Those formulas are unsatisfiable:
% 7.08/1.74 ---------------------------------
% 7.08/1.74
% 7.08/1.74 Begin of proof
% 7.08/1.74 |
% 7.08/1.74 | ALPHA: (function-axioms) implies:
% 7.08/1.74 | (1) ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2)
% 7.08/1.74 | = v1) | ~ (length(v2) = v0))
% 7.08/1.74 | (2) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: heap] : (v1 = v0 |
% 7.08/1.74 | ~ (sel(v3, v2) = v1) | ~ (sel(v3, v2) = v0))
% 7.08/1.74 |
% 7.08/1.74 | DELTA: instantiating (th_5) with fresh symbols all_19_0, all_19_1, all_19_2,
% 7.08/1.74 | all_19_3, all_19_4, all_19_5, all_19_6 gives:
% 7.08/1.74 | (3) ~ (all_19_1 = all_19_2) & $lesseq(all_19_5, all_19_0) & app(all_19_4,
% 7.08/1.74 | all_19_6) = all_19_3 & length(all_19_4) = all_19_0 & sel(all_19_3,
% 7.08/1.74 | all_19_5) = all_19_2 & sel(all_19_4, all_19_5) = all_19_1 &
% 7.08/1.74 | heap(all_19_3) & heap(all_19_4)
% 7.08/1.74 |
% 7.08/1.74 | ALPHA: (3) implies:
% 7.08/1.74 | (4) ~ (all_19_1 = all_19_2)
% 7.08/1.74 | (5) $lesseq(all_19_5, all_19_0)
% 7.08/1.74 | (6) heap(all_19_4)
% 7.08/1.74 | (7) sel(all_19_4, all_19_5) = all_19_1
% 7.08/1.74 | (8) sel(all_19_3, all_19_5) = all_19_2
% 7.08/1.74 | (9) length(all_19_4) = all_19_0
% 7.08/1.74 | (10) app(all_19_4, all_19_6) = all_19_3
% 7.08/1.74 |
% 7.08/1.75 | GROUND_INST: instantiating (ax_3) with all_19_6, all_19_4, all_19_5, all_19_3,
% 7.08/1.75 | all_19_2, simplifying with (6), (8), (10) gives:
% 7.08/1.75 | (11) ? [v0: int] : ? [v1: int] : (length(all_19_4) = v0 & sel(all_19_4,
% 7.08/1.75 | all_19_5) = v1 & (v1 = all_19_2 | $difference(v0, all_19_5) = -1))
% 7.08/1.75 |
% 7.08/1.75 | DELTA: instantiating (11) with fresh symbols all_33_0, all_33_1 gives:
% 7.08/1.75 | (12) length(all_19_4) = all_33_1 & sel(all_19_4, all_19_5) = all_33_0 &
% 7.08/1.75 | (all_33_0 = all_19_2 | $difference(all_33_1, all_19_5) = -1)
% 7.08/1.75 |
% 7.08/1.75 | ALPHA: (12) implies:
% 7.08/1.75 | (13) sel(all_19_4, all_19_5) = all_33_0
% 7.08/1.75 | (14) length(all_19_4) = all_33_1
% 7.08/1.75 | (15) all_33_0 = all_19_2 | $difference(all_33_1, all_19_5) = -1
% 7.08/1.75 |
% 7.08/1.75 | GROUND_INST: instantiating (2) with all_19_1, all_33_0, all_19_5, all_19_4,
% 7.08/1.75 | simplifying with (7), (13) gives:
% 7.08/1.75 | (16) all_33_0 = all_19_1
% 7.08/1.75 |
% 7.08/1.75 | GROUND_INST: instantiating (1) with all_19_0, all_33_1, all_19_4, simplifying
% 7.08/1.75 | with (9), (14) gives:
% 7.08/1.75 | (17) all_33_1 = all_19_0
% 7.08/1.75 |
% 7.08/1.75 | BETA: splitting (15) gives:
% 7.08/1.75 |
% 7.08/1.75 | Case 1:
% 7.08/1.75 | |
% 7.08/1.75 | | (18) all_33_0 = all_19_2
% 7.08/1.75 | |
% 7.08/1.75 | | COMBINE_EQS: (16), (18) imply:
% 7.08/1.75 | | (19) all_19_1 = all_19_2
% 7.08/1.75 | |
% 7.08/1.75 | | REDUCE: (4), (19) imply:
% 7.08/1.75 | | (20) $false
% 7.08/1.75 | |
% 7.08/1.75 | | CLOSE: (20) is inconsistent.
% 7.08/1.75 | |
% 7.08/1.75 | Case 2:
% 7.08/1.75 | |
% 7.08/1.75 | | (21) $difference(all_33_1, all_19_5) = -1
% 7.08/1.75 | |
% 7.08/1.75 | | COMBINE_EQS: (17), (21) imply:
% 7.08/1.75 | | (22) $difference(all_19_0, all_19_5) = -1
% 7.08/1.75 | |
% 7.08/1.75 | | SIMP: (22) implies:
% 7.08/1.75 | | (23) $difference(all_19_0, all_19_5) = -1
% 7.08/1.75 | |
% 7.08/1.75 | | REDUCE: (5), (23) imply:
% 7.08/1.75 | | (24) $false
% 7.08/1.75 | |
% 7.08/1.75 | | CLOSE: (24) is inconsistent.
% 7.08/1.75 | |
% 7.08/1.75 | End of split
% 7.08/1.75 |
% 7.08/1.75 End of proof
% 7.08/1.75 % SZS output end Proof for theBenchmark
% 7.08/1.75
% 7.08/1.75 1151ms
%------------------------------------------------------------------------------