TSTP Solution File: DAT061_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : DAT061_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 : n017.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:04 EDT 2023
% Result : Theorem 4.21s 1.31s
% Output : Proof 5.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT061_1 : TPTP v8.1.2. Released v5.5.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n017.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 13:49:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.63 ________ _____
% 0.20/0.63 ___ __ \_________(_)________________________________
% 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.63
% 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.63 (2023-06-19)
% 0.20/0.63
% 0.20/0.63 (c) Philipp Rümmer, 2009-2023
% 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.63 Amanda Stjerna.
% 0.20/0.63 Free software under BSD-3-Clause.
% 0.20/0.63
% 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.63
% 0.20/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.64 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 2.35/1.03 Prover 4: Preprocessing ...
% 2.35/1.03 Prover 1: Preprocessing ...
% 2.77/1.07 Prover 0: Preprocessing ...
% 2.77/1.07 Prover 2: Preprocessing ...
% 2.77/1.07 Prover 5: Preprocessing ...
% 2.77/1.07 Prover 3: Preprocessing ...
% 2.77/1.07 Prover 6: Preprocessing ...
% 3.54/1.19 Prover 3: Warning: ignoring some quantifiers
% 3.54/1.20 Prover 3: Constructing countermodel ...
% 3.54/1.20 Prover 1: Warning: ignoring some quantifiers
% 3.54/1.20 Prover 6: Proving ...
% 3.54/1.20 Prover 0: Proving ...
% 3.54/1.20 Prover 4: Warning: ignoring some quantifiers
% 3.54/1.21 Prover 4: Constructing countermodel ...
% 3.54/1.21 Prover 1: Constructing countermodel ...
% 3.54/1.23 Prover 5: Proving ...
% 4.21/1.25 Prover 2: Proving ...
% 4.21/1.31 Prover 0: proved (660ms)
% 4.21/1.31
% 4.21/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.21/1.31
% 4.21/1.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.21/1.31 Prover 3: stopped
% 4.21/1.32 Prover 6: stopped
% 4.21/1.32 Prover 2: stopped
% 4.21/1.32 Prover 5: stopped
% 4.21/1.32 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.21/1.32 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.21/1.32 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.21/1.32 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.21/1.33 Prover 7: Preprocessing ...
% 4.21/1.35 Prover 13: Preprocessing ...
% 4.21/1.35 Prover 8: Preprocessing ...
% 4.21/1.36 Prover 11: Preprocessing ...
% 4.21/1.36 Prover 4: Found proof (size 11)
% 4.21/1.36 Prover 4: proved (704ms)
% 4.21/1.36 Prover 10: Preprocessing ...
% 4.21/1.36 Prover 7: stopped
% 4.21/1.37 Prover 1: stopped
% 4.60/1.37 Prover 10: stopped
% 4.60/1.37 Prover 11: stopped
% 4.60/1.38 Prover 13: stopped
% 4.60/1.39 Prover 8: Warning: ignoring some quantifiers
% 4.60/1.39 Prover 8: Constructing countermodel ...
% 4.60/1.40 Prover 8: stopped
% 4.60/1.40
% 4.60/1.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.60/1.40
% 4.60/1.40 % SZS output start Proof for theBenchmark
% 4.60/1.40 Assumptions after simplification:
% 4.60/1.40 ---------------------------------
% 4.60/1.40
% 4.60/1.40 (ax_19)
% 5.34/1.43 ! [v0: int] : ! [v1: data] : ! [v2: array] : ! [v3: int] : ! [v4: array]
% 5.34/1.43 : ! [v5: data] : (v3 = v0 | ~ (put(v2, v0, v1) = v4) | ~ (get(v4, v3) = v5)
% 5.34/1.43 | ~ array(v2) | ~ data(v1) | (get(v2, v3) = v5 & data(v5)))
% 5.34/1.43
% 5.38/1.43 (th_lem_7)
% 5.38/1.43 ? [v0: data] : ? [v1: array] : ? [v2: int] : ? [v3: int] : ? [v4: array]
% 5.38/1.43 : ? [v5: data] : ? [v6: data] : ( ~ (v6 = v5) & $lesseq(1, $difference(v3,
% 5.38/1.43 v2)) & put(v1, v2, v0) = v4 & get(v4, v3) = v5 & get(v1, v3) = v6 &
% 5.38/1.43 array(v4) & array(v1) & data(v6) & data(v5) & data(v0))
% 5.38/1.43
% 5.38/1.43 (function-axioms)
% 5.38/1.43 ! [v0: array] : ! [v1: array] : ! [v2: data] : ! [v3: int] : ! [v4:
% 5.38/1.43 array] : (v1 = v0 | ~ (put(v4, v3, v2) = v1) | ~ (put(v4, v3, v2) = v0)) &
% 5.38/1.43 ! [v0: data] : ! [v1: data] : ! [v2: int] : ! [v3: array] : (v1 = v0 | ~
% 5.38/1.43 (get(v3, v2) = v1) | ~ (get(v3, v2) = v0))
% 5.38/1.43
% 5.38/1.43 Further assumptions not needed in the proof:
% 5.38/1.43 --------------------------------------------
% 5.38/1.43 ax_17, ax_18, ax_20, ax_21
% 5.38/1.43
% 5.38/1.43 Those formulas are unsatisfiable:
% 5.38/1.43 ---------------------------------
% 5.38/1.43
% 5.38/1.43 Begin of proof
% 5.38/1.43 |
% 5.38/1.43 | ALPHA: (function-axioms) implies:
% 5.38/1.44 | (1) ! [v0: data] : ! [v1: data] : ! [v2: int] : ! [v3: array] : (v1 =
% 5.38/1.44 | v0 | ~ (get(v3, v2) = v1) | ~ (get(v3, v2) = v0))
% 5.38/1.44 |
% 5.38/1.44 | DELTA: instantiating (th_lem_7) with fresh symbols all_13_0, all_13_1,
% 5.38/1.44 | all_13_2, all_13_3, all_13_4, all_13_5, all_13_6 gives:
% 5.38/1.44 | (2) ~ (all_13_0 = all_13_1) & $lesseq(1, $difference(all_13_3, all_13_4))
% 5.38/1.44 | & put(all_13_5, all_13_4, all_13_6) = all_13_2 & get(all_13_2,
% 5.38/1.44 | all_13_3) = all_13_1 & get(all_13_5, all_13_3) = all_13_0 &
% 5.38/1.44 | array(all_13_2) & array(all_13_5) & data(all_13_0) & data(all_13_1) &
% 5.38/1.44 | data(all_13_6)
% 5.38/1.44 |
% 5.38/1.44 | ALPHA: (2) implies:
% 5.38/1.44 | (3) ~ (all_13_0 = all_13_1)
% 5.38/1.44 | (4) $lesseq(1, $difference(all_13_3, all_13_4))
% 5.38/1.44 | (5) data(all_13_6)
% 5.38/1.44 | (6) array(all_13_5)
% 5.38/1.44 | (7) get(all_13_5, all_13_3) = all_13_0
% 5.38/1.44 | (8) get(all_13_2, all_13_3) = all_13_1
% 5.38/1.44 | (9) put(all_13_5, all_13_4, all_13_6) = all_13_2
% 5.38/1.44 |
% 5.38/1.44 | GROUND_INST: instantiating (ax_19) with all_13_4, all_13_6, all_13_5,
% 5.38/1.44 | all_13_3, all_13_2, all_13_1, simplifying with (5), (6), (8), (9)
% 5.38/1.44 | gives:
% 5.38/1.44 | (10) all_13_3 = all_13_4 | (get(all_13_5, all_13_3) = all_13_1 &
% 5.38/1.44 | data(all_13_1))
% 5.38/1.44 |
% 5.38/1.44 | BETA: splitting (10) gives:
% 5.38/1.44 |
% 5.38/1.44 | Case 1:
% 5.38/1.44 | |
% 5.38/1.44 | | (11) all_13_3 = all_13_4
% 5.38/1.44 | |
% 5.38/1.44 | | REDUCE: (4), (11) imply:
% 5.38/1.44 | | (12) $false
% 5.38/1.44 | |
% 5.38/1.44 | | CLOSE: (12) is inconsistent.
% 5.38/1.44 | |
% 5.38/1.44 | Case 2:
% 5.38/1.44 | |
% 5.38/1.44 | | (13) get(all_13_5, all_13_3) = all_13_1 & data(all_13_1)
% 5.38/1.44 | |
% 5.38/1.44 | | ALPHA: (13) implies:
% 5.38/1.45 | | (14) get(all_13_5, all_13_3) = all_13_1
% 5.38/1.45 | |
% 5.38/1.45 | | GROUND_INST: instantiating (1) with all_13_0, all_13_1, all_13_3, all_13_5,
% 5.38/1.45 | | simplifying with (7), (14) gives:
% 5.38/1.45 | | (15) all_13_0 = all_13_1
% 5.38/1.45 | |
% 5.38/1.45 | | REDUCE: (3), (15) imply:
% 5.38/1.45 | | (16) $false
% 5.38/1.45 | |
% 5.38/1.45 | | CLOSE: (16) is inconsistent.
% 5.38/1.45 | |
% 5.38/1.45 | End of split
% 5.38/1.45 |
% 5.38/1.45 End of proof
% 5.38/1.45 % SZS output end Proof for theBenchmark
% 5.38/1.45
% 5.38/1.45 818ms
%------------------------------------------------------------------------------