%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI612_1 : TPTP v8.1.2. Released v5.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n005.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 17:48:34 EDT 2023 % Result : Theorem 3.10s 1.18s % Output : Proof 4.05s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : ARI612_1 : TPTP v8.1.2. Released v5.1.0. % 0.10/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n005.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.35 % DateTime : Tue Aug 29 17:50:23 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.13/0.97 Prover 1: Preprocessing ... % 2.13/0.97 Prover 4: Preprocessing ... % 2.38/1.02 Prover 0: Preprocessing ... % 2.38/1.02 Prover 5: Preprocessing ... % 2.38/1.02 Prover 3: Preprocessing ... % 2.38/1.02 Prover 6: Preprocessing ... % 2.38/1.02 Prover 2: Preprocessing ... % 2.53/1.10 Prover 2: Proving ... % 2.53/1.10 Prover 5: Proving ... % 2.53/1.10 Prover 1: Constructing countermodel ... % 2.53/1.10 Prover 4: Constructing countermodel ... % 2.53/1.10 Prover 3: Constructing countermodel ... % 2.53/1.10 Prover 0: Proving ... % 2.53/1.10 Prover 6: Proving ... % 3.10/1.17 Prover 0: proved (546ms) % 3.10/1.18 % 3.10/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.18 % 3.10/1.18 Prover 3: proved (544ms) % 3.10/1.18 % 3.10/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.18 % 3.10/1.18 Prover 5: stopped % 3.10/1.18 Prover 6: stopped % 3.10/1.18 Prover 2: stopped % 3.10/1.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.10/1.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.10/1.18 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.10/1.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.10/1.18 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.56/1.19 Prover 10: Preprocessing ... % 3.56/1.20 Prover 11: Preprocessing ... % 3.56/1.20 Prover 8: Preprocessing ... % 3.56/1.21 Prover 13: Preprocessing ... % 3.56/1.21 Prover 10: Warning: ignoring some quantifiers % 3.56/1.21 Prover 10: Constructing countermodel ... % 3.56/1.21 Prover 7: Preprocessing ... % 3.56/1.22 Prover 1: Found proof (size 14) % 3.56/1.22 Prover 1: proved (591ms) % 3.56/1.22 Prover 4: Found proof (size 13) % 3.56/1.22 Prover 4: proved (591ms) % 3.56/1.22 Prover 10: stopped % 3.56/1.23 Prover 7: Warning: ignoring some quantifiers % 3.56/1.23 Prover 7: Constructing countermodel ... % 3.56/1.23 Prover 7: stopped % 3.56/1.23 Prover 8: Warning: ignoring some quantifiers % 3.56/1.23 Prover 8: Constructing countermodel ... % 3.56/1.23 Prover 13: Warning: ignoring some quantifiers % 3.56/1.23 Prover 13: Constructing countermodel ... % 3.56/1.24 Prover 13: stopped % 3.56/1.24 Prover 8: stopped % 3.56/1.25 Prover 11: Constructing countermodel ... % 3.56/1.25 Prover 11: stopped % 3.56/1.25 % 3.56/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.56/1.25 % 3.56/1.25 % SZS output start Proof for theBenchmark % 3.56/1.25 Assumptions after simplification: % 3.56/1.25 --------------------------------- % 3.56/1.25 % 3.56/1.25 (interv_8_12_subset_5_15) % 4.05/1.28 ! [v0: int] : ! [v1: int] : (v1 = 0 | ~ ($lesseq(v0, 14)) | ~ ($lesseq(6, % 4.05/1.28 v0)) | ~ (p(v0) = v1)) & ! [v0: int] : ! [v1: int] : (v1 = 0 | ~ % 4.05/1.28 ($lesseq(v0, 11)) | ~ ($lesseq(9, v0)) | ~ (q(v0) = v1)) & ! [v0: int] : % 4.05/1.29 ( ~ (q(v0) = 0) | ($lesseq(v0, 11) & $lesseq(9, v0))) & ! [v0: int] : ( ~ % 4.05/1.29 (p(v0) = 0) | ($lesseq(v0, 14) & $lesseq(6, v0))) & ? [v0: int] : ? [v1: % 4.05/1.29 int] : ( ~ (v1 = 0) & q(v0) = 0 & p(v0) = v1) % 4.05/1.29 % 4.05/1.29 Those formulas are unsatisfiable: % 4.05/1.29 --------------------------------- % 4.05/1.29 % 4.05/1.29 Begin of proof % 4.05/1.29 | % 4.05/1.29 | ALPHA: (interv_8_12_subset_5_15) implies: % 4.05/1.29 | (1) ! [v0: int] : ( ~ (q(v0) = 0) | ($lesseq(v0, 11) & $lesseq(9, v0))) % 4.05/1.29 | (2) ! [v0: int] : ! [v1: int] : (v1 = 0 | ~ ($lesseq(v0, 14)) | ~ % 4.05/1.29 | ($lesseq(6, v0)) | ~ (p(v0) = v1)) % 4.05/1.29 | (3) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & q(v0) = 0 & p(v0) = v1) % 4.05/1.29 | % 4.05/1.29 | DELTA: instantiating (3) with fresh symbols all_4_0, all_4_1 gives: % 4.05/1.29 | (4) ~ (all_4_0 = 0) & q(all_4_1) = 0 & p(all_4_1) = all_4_0 % 4.05/1.29 | % 4.05/1.29 | ALPHA: (4) implies: % 4.05/1.29 | (5) ~ (all_4_0 = 0) % 4.05/1.30 | (6) p(all_4_1) = all_4_0 % 4.05/1.30 | (7) q(all_4_1) = 0 % 4.05/1.30 | % 4.05/1.30 | GROUND_INST: instantiating (2) with all_4_1, all_4_0, simplifying with (6) % 4.05/1.30 | gives: % 4.05/1.30 | (8) all_4_0 = 0 | ~ ($lesseq(all_4_1, 14)) | ~ ($lesseq(6, all_4_1)) % 4.05/1.30 | % 4.05/1.30 | GROUND_INST: instantiating (1) with all_4_1, simplifying with (7) gives: % 4.05/1.30 | (9) $lesseq(all_4_1, 11) & $lesseq(9, all_4_1) % 4.05/1.30 | % 4.05/1.30 | ALPHA: (9) implies: % 4.05/1.30 | (10) $lesseq(9, all_4_1) % 4.05/1.30 | (11) $lesseq(all_4_1, 11) % 4.05/1.30 | % 4.05/1.30 | BETA: splitting (8) gives: % 4.05/1.30 | % 4.05/1.30 | Case 1: % 4.05/1.30 | | % 4.05/1.30 | | (12) $lesseq(15, all_4_1) % 4.05/1.30 | | % 4.05/1.30 | | COMBINE_INEQS: (11), (12) imply: % 4.05/1.30 | | (13) $false % 4.05/1.30 | | % 4.05/1.30 | | CLOSE: (13) is inconsistent. % 4.05/1.30 | | % 4.05/1.30 | Case 2: % 4.05/1.30 | | % 4.05/1.30 | | (14) all_4_0 = 0 | ~ ($lesseq(6, all_4_1)) % 4.05/1.30 | | % 4.05/1.30 | | BETA: splitting (14) gives: % 4.05/1.30 | | % 4.05/1.30 | | Case 1: % 4.05/1.30 | | | % 4.05/1.30 | | | (15) $lesseq(all_4_1, 5) % 4.05/1.30 | | | % 4.05/1.30 | | | COMBINE_INEQS: (10), (15) imply: % 4.05/1.30 | | | (16) $false % 4.05/1.30 | | | % 4.05/1.30 | | | CLOSE: (16) is inconsistent. % 4.05/1.30 | | | % 4.05/1.30 | | Case 2: % 4.05/1.30 | | | % 4.05/1.30 | | | (17) all_4_0 = 0 % 4.05/1.30 | | | % 4.05/1.30 | | | REDUCE: (5), (17) imply: % 4.05/1.30 | | | (18) $false % 4.05/1.30 | | | % 4.05/1.30 | | | CLOSE: (18) is inconsistent. % 4.05/1.30 | | | % 4.05/1.30 | | End of split % 4.05/1.30 | | % 4.05/1.30 | End of split % 4.05/1.30 | % 4.05/1.30 End of proof % 4.05/1.30 % SZS output end Proof for theBenchmark % 4.05/1.30 % 4.05/1.30 694ms %------------------------------------------------------------------------------