%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT069_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 : n012.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.90s 1.52s % Output : Proof 6.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : DAT069_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.13/0.35 % Computer : n012.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Thu Aug 24 14:16:57 EDT 2023 % 0.13/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.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.19/1.07 Prover 1: Preprocessing ... % 2.19/1.07 Prover 4: Preprocessing ... % 3.11/1.12 Prover 5: Preprocessing ... % 3.11/1.12 Prover 2: Preprocessing ... % 3.11/1.12 Prover 0: Preprocessing ... % 3.11/1.12 Prover 6: Preprocessing ... % 3.11/1.12 Prover 3: Preprocessing ... % 4.28/1.37 Prover 1: Constructing countermodel ... % 4.98/1.38 Prover 4: Constructing countermodel ... % 4.98/1.39 Prover 3: Constructing countermodel ... % 4.98/1.39 Prover 6: Constructing countermodel ... % 4.98/1.42 Prover 5: Proving ... % 4.98/1.44 Prover 0: Proving ... % 4.98/1.46 Prover 2: Proving ... % 5.90/1.52 Prover 6: proved (856ms) % 5.90/1.52 % 5.90/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.90/1.52 % 5.90/1.52 Prover 5: stopped % 5.90/1.53 Prover 0: stopped % 5.90/1.53 Prover 3: stopped % 5.90/1.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.90/1.53 Prover 2: stopped % 5.90/1.54 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.90/1.54 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.90/1.54 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.90/1.54 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.90/1.57 Prover 7: Preprocessing ... % 5.90/1.57 Prover 8: Preprocessing ... % 5.90/1.57 Prover 10: Preprocessing ... % 5.90/1.57 Prover 11: Preprocessing ... % 5.90/1.58 Prover 13: Preprocessing ... % 5.90/1.59 Prover 1: Found proof (size 16) % 5.90/1.59 Prover 1: proved (952ms) % 5.90/1.60 Prover 4: Found proof (size 16) % 5.90/1.60 Prover 4: proved (936ms) % 6.51/1.60 Prover 11: stopped % 6.51/1.61 Prover 13: stopped % 6.51/1.63 Prover 8: Warning: ignoring some quantifiers % 6.51/1.63 Prover 7: Constructing countermodel ... % 6.51/1.63 Prover 10: Constructing countermodel ... % 6.51/1.63 Prover 8: Constructing countermodel ... % 6.51/1.63 Prover 7: stopped % 6.51/1.64 Prover 10: stopped % 6.51/1.64 Prover 8: stopped % 6.51/1.64 % 6.51/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.51/1.64 % 6.51/1.64 % SZS output start Proof for theBenchmark % 6.51/1.65 Assumptions after simplification: % 6.51/1.65 --------------------------------- % 6.51/1.65 % 6.51/1.65 (ax_3) % 6.51/1.67 ! [v0: int] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : ! [v4: int] : ( % 6.51/1.67 ~ (app(v1, v0) = v3) | ~ (sel(v3, v2) = v4) | ~ heap(v1) | ? [v5: int] : % 6.51/1.67 ? [v6: int] : (length(v1) = v5 & sel(v1, v2) = v6 & (v6 = v4 | % 6.51/1.67 $difference(v5, v2) = -1))) % 6.51/1.67 % 6.51/1.67 (th_4) % 6.51/1.67 ? [v0: int] : ? [v1: heap] : ? [v2: int] : ? [v3: heap] : ? [v4: int] : % 6.51/1.67 ? [v5: int] : ? [v6: int] : ( ~ (v5 = v4) & $lesseq(v2, v6) & app(v1, v0) = % 6.51/1.67 v3 & length(v1) = v6 & sel(v3, v2) = v4 & sel(v1, v2) = v5 & heap(v3) & % 6.51/1.67 heap(v1)) % 6.51/1.67 % 6.51/1.67 (function-axioms) % 6.51/1.68 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: heap] : ! % 6.51/1.68 [v3: heap] : (v1 = v0 | ~ (lsls(v3, v2) = v1) | ~ (lsls(v3, v2) = v0)) & ! % 6.51/1.68 [v0: heap] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~ % 6.51/1.68 (app(v3, v2) = v1) | ~ (app(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] : % 6.51/1.68 ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~ (sel(v3, v2) = v1) | ~ (sel(v3, % 6.51/1.68 v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ % 6.51/1.68 (toop(v2) = v1) | ~ (toop(v2) = v0)) & ! [v0: heap] : ! [v1: heap] : ! % 6.51/1.68 [v2: heap] : (v1 = v0 | ~ (get(v2) = v1) | ~ (get(v2) = v0)) & ! [v0: int] % 6.51/1.68 : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2) = v1) | ~ % 6.51/1.68 (length(v2) = v0)) % 6.98/1.68 % 6.98/1.68 Further assumptions not needed in the proof: % 6.98/1.68 -------------------------------------------- % 6.98/1.68 ax_1, ax_2, ax_20, ax_21, ax_22, ax_23, ax_24, ax_25, ax_26, ax_27, ax_28, % 6.98/1.68 ax_29, ax_30 % 6.98/1.68 % 6.98/1.68 Those formulas are unsatisfiable: % 6.98/1.68 --------------------------------- % 6.98/1.68 % 6.98/1.68 Begin of proof % 6.98/1.68 | % 6.98/1.68 | ALPHA: (function-axioms) implies: % 6.98/1.68 | (1) ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2) % 6.98/1.68 | = v1) | ~ (length(v2) = v0)) % 6.98/1.69 | (2) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: heap] : (v1 = v0 | % 6.98/1.69 | ~ (sel(v3, v2) = v1) | ~ (sel(v3, v2) = v0)) % 6.98/1.69 | % 6.98/1.69 | DELTA: instantiating (th_4) with fresh symbols all_19_0, all_19_1, all_19_2, % 6.98/1.69 | all_19_3, all_19_4, all_19_5, all_19_6 gives: % 6.98/1.69 | (3) ~ (all_19_1 = all_19_2) & $lesseq(all_19_4, all_19_0) & app(all_19_5, % 6.98/1.69 | all_19_6) = all_19_3 & length(all_19_5) = all_19_0 & sel(all_19_3, % 6.98/1.69 | all_19_4) = all_19_2 & sel(all_19_5, all_19_4) = all_19_1 & % 6.98/1.69 | heap(all_19_3) & heap(all_19_5) % 6.98/1.69 | % 6.98/1.69 | ALPHA: (3) implies: % 6.98/1.69 | (4) ~ (all_19_1 = all_19_2) % 6.98/1.69 | (5) $lesseq(all_19_4, all_19_0) % 6.98/1.69 | (6) heap(all_19_5) % 6.98/1.69 | (7) sel(all_19_5, all_19_4) = all_19_1 % 6.98/1.69 | (8) sel(all_19_3, all_19_4) = all_19_2 % 6.98/1.69 | (9) length(all_19_5) = all_19_0 % 6.98/1.69 | (10) app(all_19_5, all_19_6) = all_19_3 % 6.98/1.69 | % 6.98/1.69 | GROUND_INST: instantiating (ax_3) with all_19_6, all_19_5, all_19_4, all_19_3, % 6.98/1.69 | all_19_2, simplifying with (6), (8), (10) gives: % 6.98/1.69 | (11) ? [v0: int] : ? [v1: int] : (length(all_19_5) = v0 & sel(all_19_5, % 6.98/1.69 | all_19_4) = v1 & (v1 = all_19_2 | $difference(v0, all_19_4) = -1)) % 6.98/1.69 | % 6.98/1.69 | DELTA: instantiating (11) with fresh symbols all_33_0, all_33_1 gives: % 6.98/1.69 | (12) length(all_19_5) = all_33_1 & sel(all_19_5, all_19_4) = all_33_0 & % 6.98/1.69 | (all_33_0 = all_19_2 | $difference(all_33_1, all_19_4) = -1) % 6.98/1.69 | % 6.98/1.69 | ALPHA: (12) implies: % 6.98/1.69 | (13) sel(all_19_5, all_19_4) = all_33_0 % 6.98/1.69 | (14) length(all_19_5) = all_33_1 % 6.98/1.69 | (15) all_33_0 = all_19_2 | $difference(all_33_1, all_19_4) = -1 % 6.98/1.69 | % 6.98/1.70 | GROUND_INST: instantiating (2) with all_19_1, all_33_0, all_19_4, all_19_5, % 6.98/1.70 | simplifying with (7), (13) gives: % 6.98/1.70 | (16) all_33_0 = all_19_1 % 6.98/1.70 | % 6.98/1.70 | GROUND_INST: instantiating (1) with all_19_0, all_33_1, all_19_5, simplifying % 6.98/1.70 | with (9), (14) gives: % 6.98/1.70 | (17) all_33_1 = all_19_0 % 6.98/1.70 | % 6.98/1.70 | BETA: splitting (15) gives: % 6.98/1.70 | % 6.98/1.70 | Case 1: % 6.98/1.70 | | % 6.98/1.70 | | (18) all_33_0 = all_19_2 % 6.98/1.70 | | % 6.98/1.70 | | COMBINE_EQS: (16), (18) imply: % 6.98/1.70 | | (19) all_19_1 = all_19_2 % 6.98/1.70 | | % 6.98/1.70 | | REDUCE: (4), (19) imply: % 6.98/1.70 | | (20) $false % 6.98/1.70 | | % 6.98/1.70 | | CLOSE: (20) is inconsistent. % 6.98/1.70 | | % 6.98/1.70 | Case 2: % 6.98/1.70 | | % 6.98/1.70 | | (21) $difference(all_33_1, all_19_4) = -1 % 6.98/1.70 | | % 6.98/1.70 | | COMBINE_EQS: (17), (21) imply: % 6.98/1.70 | | (22) $difference(all_19_0, all_19_4) = -1 % 6.98/1.70 | | % 6.98/1.70 | | SIMP: (22) implies: % 6.98/1.70 | | (23) $difference(all_19_0, all_19_4) = -1 % 6.98/1.70 | | % 6.98/1.70 | | REDUCE: (5), (23) imply: % 6.98/1.70 | | (24) $false % 6.98/1.70 | | % 6.98/1.70 | | CLOSE: (24) is inconsistent. % 6.98/1.70 | | % 6.98/1.70 | End of split % 6.98/1.70 | % 6.98/1.70 End of proof % 6.98/1.70 % SZS output end Proof for theBenchmark % 6.98/1.70 % 6.98/1.70 1076ms %------------------------------------------------------------------------------