%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT062_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 : n010.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 6.01s 1.52s % Output : Proof 7.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : DAT062_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 : n010.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:19:06 EDT 2023 % 0.20/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.51/1.05 Prover 4: Preprocessing ... % 2.51/1.05 Prover 1: Preprocessing ... % 2.51/1.08 Prover 2: Preprocessing ... % 2.51/1.08 Prover 3: Preprocessing ... % 2.51/1.08 Prover 5: Preprocessing ... % 2.51/1.08 Prover 6: Preprocessing ... % 2.51/1.08 Prover 0: Preprocessing ... % 4.63/1.32 Prover 5: Proving ... % 4.63/1.32 Prover 1: Constructing countermodel ... % 4.63/1.33 Prover 3: Constructing countermodel ... % 4.63/1.33 Prover 6: Proving ... % 4.63/1.34 Prover 4: Constructing countermodel ... % 4.63/1.37 Prover 0: Proving ... % 4.63/1.40 Prover 2: Proving ... % 6.01/1.52 Prover 3: proved (879ms) % 6.01/1.52 % 6.01/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.01/1.52 % 6.01/1.52 Prover 6: stopped % 6.01/1.52 Prover 5: stopped % 6.01/1.53 Prover 2: stopped % 6.01/1.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.01/1.53 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.01/1.53 Prover 0: proved (893ms) % 6.01/1.53 % 6.01/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.01/1.53 % 6.01/1.54 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.01/1.54 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.01/1.55 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.01/1.56 Prover 8: Preprocessing ... % 6.01/1.56 Prover 7: Preprocessing ... % 6.01/1.56 Prover 11: Preprocessing ... % 6.01/1.57 Prover 10: Preprocessing ... % 6.01/1.58 Prover 13: Preprocessing ... % 6.70/1.61 Prover 4: Found proof (size 29) % 6.70/1.61 Prover 4: proved (974ms) % 6.70/1.62 Prover 13: stopped % 6.70/1.62 Prover 1: stopped % 6.70/1.63 Prover 8: Warning: ignoring some quantifiers % 6.70/1.63 Prover 10: Constructing countermodel ... % 6.70/1.64 Prover 8: Constructing countermodel ... % 6.70/1.64 Prover 10: stopped % 6.70/1.64 Prover 7: Constructing countermodel ... % 6.70/1.64 Prover 8: stopped % 6.70/1.64 Prover 7: stopped % 6.70/1.66 Prover 11: Constructing countermodel ... % 6.70/1.66 Prover 11: stopped % 6.70/1.66 % 6.70/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.70/1.66 % 6.70/1.67 % SZS output start Proof for theBenchmark % 6.70/1.67 Assumptions after simplification: % 6.70/1.67 --------------------------------- % 6.70/1.67 % 6.70/1.67 (ax_23) % 7.31/1.69 ! [v0: int] : ! [v1: heap] : ! [v2: heap] : ( ~ (app(v1, v0) = v2) | ~ % 7.31/1.69 heap(v1) | ? [v3: int] : (length(v2) = v3 & length(v1) = $sum(v3, -1))) % 7.31/1.69 % 7.31/1.69 (ax_27) % 7.34/1.70 ! [v0: int] : ! [v1: heap] : ! [v2: heap] : ! [v3: heap] : ! [v4: int] : % 7.34/1.70 (v4 = 0 | ~ (lsls(v1, v3) = v4) | ~ (app(v2, v0) = v3) | ~ heap(v2) | ~ % 7.34/1.70 heap(v1) | ? [v5: int] : ( ~ (v5 = 0) & lsls(v1, v2) = v5)) & ! [v0: int] % 7.34/1.70 : ! [v1: heap] : ! [v2: heap] : ! [v3: int] : (v3 = 0 | ~ (lsls(v1, v2) = % 7.34/1.70 v3) | ~ (app(v1, v0) = v2) | ~ heap(v1)) & ! [v0: int] : ! [v1: heap] % 7.34/1.70 : ! [v2: heap] : ! [v3: heap] : (v2 = v1 | ~ (lsls(v1, v3) = 0) | ~ % 7.34/1.70 (app(v2, v0) = v3) | ~ heap(v2) | ~ heap(v1) | lsls(v1, v2) = 0) % 7.34/1.70 % 7.34/1.70 (th_lem_1a) % 7.37/1.70 ? [v0: heap] : ? [v1: int] : ? [v2: int] : ? [v3: heap] : ? [v4: int] : % 7.37/1.70 ? [v5: heap] : ? [v6: int] : ($lesseq(v4, v6) & lsls(v5, v3) = 0 & length(v5) % 7.37/1.70 = v6 & length(v3) = v4 & length(v0) = v2 & app(v0, v1) = v3 & heap(v5) & % 7.37/1.70 heap(v3) & heap(v0) & ! [v7: heap] : ! [v8: int] : ( ~ ($lesseq(v2, v8)) | % 7.37/1.70 ~ (length(v7) = v8) | ~ heap(v7) | ? [v9: int] : ( ~ (v9 = 0) & % 7.37/1.70 lsls(v7, v0) = v9)) & ! [v7: heap] : ( ~ (lsls(v7, v0) = 0) | ~ % 7.37/1.70 heap(v7) | ? [v8: int] : ($lesseq(1, $difference(v2, v8)) & length(v7) = % 7.37/1.70 v8))) % 7.37/1.70 % 7.37/1.70 (function-axioms) % 7.37/1.71 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: heap] : ! % 7.37/1.71 [v3: heap] : (v1 = v0 | ~ (lsls(v3, v2) = v1) | ~ (lsls(v3, v2) = v0)) & ! % 7.37/1.71 [v0: heap] : ! [v1: heap] : ! [v2: int] : ! [v3: heap] : (v1 = v0 | ~ % 7.37/1.71 (app(v3, v2) = v1) | ~ (app(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] : % 7.37/1.71 ! [v2: heap] : (v1 = v0 | ~ (length(v2) = v1) | ~ (length(v2) = v0)) & ! % 7.37/1.71 [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (toop(v2) = v1) | ~ % 7.37/1.71 (toop(v2) = v0)) & ! [v0: heap] : ! [v1: heap] : ! [v2: heap] : (v1 = v0 % 7.37/1.71 | ~ (get(v2) = v1) | ~ (get(v2) = v0)) % 7.37/1.71 % 7.37/1.71 Further assumptions not needed in the proof: % 7.37/1.71 -------------------------------------------- % 7.37/1.71 ax_17, ax_18, ax_19, ax_20, ax_21, ax_22, ax_24, ax_25, ax_26 % 7.37/1.71 % 7.37/1.71 Those formulas are unsatisfiable: % 7.37/1.71 --------------------------------- % 7.37/1.71 % 7.37/1.71 Begin of proof % 7.37/1.71 | % 7.37/1.71 | ALPHA: (ax_27) implies: % 7.37/1.71 | (1) ! [v0: int] : ! [v1: heap] : ! [v2: heap] : ! [v3: heap] : (v2 = v1 % 7.37/1.71 | | ~ (lsls(v1, v3) = 0) | ~ (app(v2, v0) = v3) | ~ heap(v2) | ~ % 7.37/1.71 | heap(v1) | lsls(v1, v2) = 0) % 7.37/1.71 | % 7.37/1.71 | ALPHA: (function-axioms) implies: % 7.37/1.71 | (2) ! [v0: int] : ! [v1: int] : ! [v2: heap] : (v1 = v0 | ~ (length(v2) % 7.37/1.71 | = v1) | ~ (length(v2) = v0)) % 7.37/1.71 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: heap] % 7.37/1.71 | : ! [v3: heap] : (v1 = v0 | ~ (lsls(v3, v2) = v1) | ~ (lsls(v3, v2) % 7.37/1.71 | = v0)) % 7.37/1.71 | % 7.37/1.71 | DELTA: instantiating (th_lem_1a) with fresh symbols all_16_0, all_16_1, % 7.37/1.71 | all_16_2, all_16_3, all_16_4, all_16_5, all_16_6 gives: % 7.37/1.72 | (4) $lesseq(all_16_2, all_16_0) & lsls(all_16_1, all_16_3) = 0 & % 7.37/1.72 | length(all_16_1) = all_16_0 & length(all_16_3) = all_16_2 & % 7.37/1.72 | length(all_16_6) = all_16_4 & app(all_16_6, all_16_5) = all_16_3 & % 7.37/1.72 | heap(all_16_1) & heap(all_16_3) & heap(all_16_6) & ! [v0: heap] : ! % 7.37/1.72 | [v1: int] : ( ~ ($lesseq(all_16_4, v1)) | ~ (length(v0) = v1) | ~ % 7.37/1.72 | heap(v0) | ? [v2: int] : ( ~ (v2 = 0) & lsls(v0, all_16_6) = v2)) & % 7.37/1.72 | ! [v0: heap] : ( ~ (lsls(v0, all_16_6) = 0) | ~ heap(v0) | ? [v1: % 7.37/1.72 | int] : ($lesseq(1, $difference(all_16_4, v1)) & length(v0) = v1)) % 7.37/1.72 | % 7.37/1.72 | ALPHA: (4) implies: % 7.37/1.72 | (5) $lesseq(all_16_2, all_16_0) % 7.37/1.72 | (6) heap(all_16_6) % 7.37/1.72 | (7) heap(all_16_1) % 7.37/1.72 | (8) app(all_16_6, all_16_5) = all_16_3 % 7.37/1.72 | (9) length(all_16_6) = all_16_4 % 7.37/1.72 | (10) length(all_16_3) = all_16_2 % 7.37/1.72 | (11) length(all_16_1) = all_16_0 % 7.37/1.72 | (12) lsls(all_16_1, all_16_3) = 0 % 7.37/1.72 | (13) ! [v0: heap] : ! [v1: int] : ( ~ ($lesseq(all_16_4, v1)) | ~ % 7.37/1.72 | (length(v0) = v1) | ~ heap(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 7.37/1.72 | lsls(v0, all_16_6) = v2)) % 7.37/1.72 | % 7.37/1.72 | GROUND_INST: instantiating (ax_23) with all_16_5, all_16_6, all_16_3, % 7.37/1.72 | simplifying with (6), (8) gives: % 7.37/1.72 | (14) ? [v0: int] : (length(all_16_3) = v0 & length(all_16_6) = $sum(v0, % 7.37/1.72 | -1)) % 7.37/1.72 | % 7.37/1.72 | GROUND_INST: instantiating (13) with all_16_1, all_16_0, simplifying with (7), % 7.37/1.72 | (11) gives: % 7.37/1.72 | (15) ~ ($lesseq(all_16_4, all_16_0)) | ? [v0: int] : ( ~ (v0 = 0) & % 7.37/1.72 | lsls(all_16_1, all_16_6) = v0) % 7.37/1.72 | % 7.37/1.73 | GROUND_INST: instantiating (1) with all_16_5, all_16_1, all_16_6, all_16_3, % 7.37/1.73 | simplifying with (6), (7), (8), (12) gives: % 7.37/1.73 | (16) all_16_1 = all_16_6 | lsls(all_16_1, all_16_6) = 0 % 7.37/1.73 | % 7.37/1.73 | DELTA: instantiating (14) with fresh symbol all_28_0 gives: % 7.37/1.73 | (17) length(all_16_3) = all_28_0 & length(all_16_6) = $sum(all_28_0, -1) % 7.37/1.73 | % 7.37/1.73 | ALPHA: (17) implies: % 7.37/1.73 | (18) length(all_16_6) = $sum(all_28_0, -1) % 7.37/1.73 | (19) length(all_16_3) = all_28_0 % 7.37/1.73 | % 7.37/1.73 | GROUND_INST: instantiating (2) with all_16_4, $sum(all_28_0, -1), all_16_6, % 7.37/1.73 | simplifying with (9), (18) gives: % 7.37/1.73 | (20) $difference(all_28_0, all_16_4) = 1 % 7.37/1.73 | % 7.37/1.73 | GROUND_INST: instantiating (2) with all_16_2, all_28_0, all_16_3, simplifying % 7.37/1.73 | with (10), (19) gives: % 7.37/1.73 | (21) all_28_0 = all_16_2 % 7.37/1.73 | % 7.37/1.73 | COMBINE_EQS: (20), (21) imply: % 7.37/1.73 | (22) $difference(all_16_2, all_16_4) = 1 % 7.37/1.73 | % 7.37/1.73 | REDUCE: (5), (22) imply: % 7.37/1.73 | (23) $lesseq(1, $difference(all_16_0, all_16_4)) % 7.37/1.73 | % 7.37/1.73 | BETA: splitting (15) gives: % 7.37/1.73 | % 7.37/1.73 | Case 1: % 7.37/1.73 | | % 7.37/1.73 | | (24) $lesseq(1, $difference(all_16_4, all_16_0)) % 7.37/1.73 | | % 7.37/1.73 | | COMBINE_INEQS: (23), (24) imply: % 7.37/1.73 | | (25) $false % 7.37/1.73 | | % 7.37/1.73 | | CLOSE: (25) is inconsistent. % 7.37/1.73 | | % 7.37/1.73 | Case 2: % 7.37/1.73 | | % 7.37/1.73 | | (26) ? [v0: int] : ( ~ (v0 = 0) & lsls(all_16_1, all_16_6) = v0) % 7.37/1.73 | | % 7.37/1.73 | | DELTA: instantiating (26) with fresh symbol all_41_0 gives: % 7.37/1.73 | | (27) ~ (all_41_0 = 0) & lsls(all_16_1, all_16_6) = all_41_0 % 7.37/1.73 | | % 7.37/1.73 | | ALPHA: (27) implies: % 7.37/1.73 | | (28) ~ (all_41_0 = 0) % 7.37/1.73 | | (29) lsls(all_16_1, all_16_6) = all_41_0 % 7.37/1.73 | | % 7.37/1.73 | | BETA: splitting (16) gives: % 7.37/1.73 | | % 7.37/1.73 | | Case 1: % 7.37/1.73 | | | % 7.37/1.73 | | | (30) lsls(all_16_1, all_16_6) = 0 % 7.37/1.73 | | | % 7.37/1.73 | | | GROUND_INST: instantiating (3) with 0, all_41_0, all_16_6, all_16_1, % 7.37/1.73 | | | simplifying with (29), (30) gives: % 7.37/1.73 | | | (31) all_41_0 = 0 % 7.37/1.73 | | | % 7.37/1.73 | | | REDUCE: (28), (31) imply: % 7.37/1.73 | | | (32) $false % 7.37/1.73 | | | % 7.37/1.73 | | | CLOSE: (32) is inconsistent. % 7.37/1.73 | | | % 7.37/1.73 | | Case 2: % 7.37/1.73 | | | % 7.37/1.73 | | | (33) all_16_1 = all_16_6 % 7.37/1.73 | | | % 7.37/1.73 | | | REDUCE: (11), (33) imply: % 7.37/1.73 | | | (34) length(all_16_6) = all_16_0 % 7.37/1.73 | | | % 7.37/1.73 | | | GROUND_INST: instantiating (2) with all_16_4, all_16_0, all_16_6, % 7.37/1.73 | | | simplifying with (9), (34) gives: % 7.37/1.73 | | | (35) all_16_0 = all_16_4 % 7.37/1.73 | | | % 7.37/1.73 | | | REDUCE: (23), (35) imply: % 7.37/1.73 | | | (36) $false % 7.37/1.73 | | | % 7.37/1.73 | | | CLOSE: (36) is inconsistent. % 7.37/1.73 | | | % 7.37/1.73 | | End of split % 7.37/1.73 | | % 7.37/1.73 | End of split % 7.37/1.73 | % 7.37/1.73 End of proof % 7.37/1.73 % SZS output end Proof for theBenchmark % 7.37/1.73 % 7.37/1.73 1120ms %------------------------------------------------------------------------------