%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI592_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 : n025.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:30 EDT 2023 % Result : Theorem 2.80s 1.08s % Output : Proof 3.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ARI592_1 : TPTP v8.1.2. Released v5.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n025.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 : Tue Aug 29 18:06:55 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.58 ________ _____ % 0.20/0.58 ___ __ \_________(_)________________________________ % 0.20/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.58 % 0.20/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.58 (2023-06-19) % 0.20/0.58 % 0.20/0.58 (c) Philipp Rümmer, 2009-2023 % 0.20/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.58 Amanda Stjerna. % 0.20/0.58 Free software under BSD-3-Clause. % 0.20/0.58 % 0.20/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.58 % 0.20/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.59 Running up to 7 provers in parallel. % 0.20/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.75/0.92 Prover 4: Preprocessing ... % 1.75/0.92 Prover 1: Preprocessing ... % 2.20/0.96 Prover 6: Preprocessing ... % 2.20/0.96 Prover 5: Preprocessing ... % 2.20/0.96 Prover 0: Preprocessing ... % 2.20/0.96 Prover 2: Preprocessing ... % 2.20/0.96 Prover 3: Preprocessing ... % 2.34/1.00 Prover 5: Proving ... % 2.34/1.00 Prover 0: Proving ... % 2.34/1.00 Prover 2: Proving ... % 2.34/1.00 Prover 6: Proving ... % 2.80/1.06 Prover 4: Warning: ignoring some quantifiers % 2.80/1.06 Prover 4: Constructing countermodel ... % 2.80/1.06 Prover 3: Warning: ignoring some quantifiers % 2.80/1.06 Prover 3: Constructing countermodel ... % 2.80/1.07 Prover 1: Warning: ignoring some quantifiers % 2.80/1.07 Prover 1: Constructing countermodel ... % 2.80/1.07 Prover 3: proved (477ms) % 2.80/1.08 % 2.80/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.80/1.08 % 2.80/1.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.80/1.08 Prover 6: proved (481ms) % 2.80/1.08 % 2.80/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.80/1.08 % 2.80/1.08 Prover 5: proved (484ms) % 2.80/1.08 % 2.80/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.80/1.08 % 2.80/1.08 Prover 2: proved (487ms) % 2.80/1.08 % 2.80/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.80/1.08 % 2.80/1.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.80/1.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.80/1.08 Prover 0: stopped % 2.80/1.10 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.80/1.10 Prover 7: Preprocessing ... % 2.80/1.10 Prover 8: Preprocessing ... % 2.80/1.10 Prover 11: Preprocessing ... % 2.80/1.10 Prover 10: Preprocessing ... % 2.80/1.10 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.80/1.10 Prover 13: Preprocessing ... % 2.80/1.12 Prover 4: Found proof (size 11) % 2.80/1.12 Prover 11: Warning: ignoring some quantifiers % 2.80/1.12 Prover 4: proved (522ms) % 2.80/1.12 Prover 11: Constructing countermodel ... % 3.36/1.12 Prover 10: Warning: ignoring some quantifiers % 3.36/1.12 Prover 10: Constructing countermodel ... % 3.36/1.12 Prover 11: stopped % 3.36/1.12 Prover 1: Found proof (size 11) % 3.36/1.12 Prover 1: proved (528ms) % 3.36/1.12 Prover 10: stopped % 3.36/1.12 Prover 7: Warning: ignoring some quantifiers % 3.36/1.12 Prover 7: Constructing countermodel ... % 3.36/1.13 Prover 7: stopped % 3.36/1.13 Prover 8: Warning: ignoring some quantifiers % 3.36/1.13 Prover 8: Constructing countermodel ... % 3.36/1.13 Prover 8: stopped % 3.36/1.14 Prover 13: Warning: ignoring some quantifiers % 3.36/1.14 Prover 13: Constructing countermodel ... % 3.36/1.14 Prover 13: stopped % 3.36/1.14 % 3.36/1.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.36/1.14 % 3.36/1.14 % SZS output start Proof for theBenchmark % 3.36/1.15 Assumptions after simplification: % 3.36/1.15 --------------------------------- % 3.36/1.15 % 3.36/1.15 (exists_X_0_Z_noteq_Y) % 3.36/1.15 ? [v0: int] : ? [v1: int] : ($lesseq(3, v1) & ( ~ ($lesseq(2, % 3.36/1.15 $difference(v1, v0))) | ~ ($lesseq(2, v1))) & ( ~ ($lesseq(2, v1)) | % 3.36/1.15 ~ ($lesseq(2, v0)))) % 3.36/1.15 % 3.36/1.15 Those formulas are unsatisfiable: % 3.36/1.15 --------------------------------- % 3.36/1.15 % 3.36/1.15 Begin of proof % 3.36/1.15 | % 3.36/1.15 | DELTA: instantiating (exists_X_0_Z_noteq_Y) with fresh symbols all_2_0, % 3.36/1.15 | all_2_1 gives: % 3.36/1.16 | (1) $lesseq(3, all_2_0) & ( ~ ($lesseq(2, $difference(all_2_0, all_2_1))) | % 3.36/1.16 | ~ ($lesseq(2, all_2_0))) & ( ~ ($lesseq(2, all_2_0)) | ~ % 3.36/1.16 | ($lesseq(2, all_2_1))) % 3.36/1.16 | % 3.36/1.16 | ALPHA: (1) implies: % 3.36/1.16 | (2) $lesseq(3, all_2_0) % 3.36/1.16 | (3) ~ ($lesseq(2, all_2_0)) | ~ ($lesseq(2, all_2_1)) % 3.36/1.16 | (4) ~ ($lesseq(2, $difference(all_2_0, all_2_1))) | ~ ($lesseq(2, % 3.36/1.16 | all_2_0)) % 3.36/1.16 | % 3.36/1.16 | BETA: splitting (3) gives: % 3.36/1.16 | % 3.36/1.16 | Case 1: % 3.36/1.16 | | % 3.36/1.16 | | (5) $lesseq(all_2_0, 1) % 3.36/1.16 | | % 3.36/1.16 | | COMBINE_INEQS: (2), (5) imply: % 3.36/1.16 | | (6) $false % 3.36/1.16 | | % 3.36/1.16 | | CLOSE: (6) is inconsistent. % 3.36/1.16 | | % 3.36/1.16 | Case 2: % 3.36/1.16 | | % 3.36/1.16 | | (7) $lesseq(all_2_1, 1) % 3.36/1.16 | | % 3.36/1.16 | | BETA: splitting (4) gives: % 3.36/1.16 | | % 3.36/1.16 | | Case 1: % 3.36/1.16 | | | % 3.36/1.16 | | | (8) $lesseq(all_2_0, 1) % 3.36/1.16 | | | % 3.36/1.16 | | | COMBINE_INEQS: (2), (8) imply: % 3.36/1.16 | | | (9) $false % 3.36/1.16 | | | % 3.36/1.16 | | | CLOSE: (9) is inconsistent. % 3.36/1.16 | | | % 3.36/1.16 | | Case 2: % 3.36/1.16 | | | % 3.36/1.16 | | | (10) $lesseq(-1, $difference(all_2_1, all_2_0)) % 3.36/1.16 | | | % 3.36/1.16 | | | COMBINE_INEQS: (2), (10) imply: % 3.36/1.16 | | | (11) $lesseq(2, all_2_1) % 3.36/1.16 | | | % 3.36/1.16 | | | COMBINE_INEQS: (7), (11) imply: % 3.36/1.16 | | | (12) $false % 3.36/1.16 | | | % 3.36/1.16 | | | CLOSE: (12) is inconsistent. % 3.36/1.16 | | | % 3.36/1.16 | | End of split % 3.36/1.16 | | % 3.36/1.16 | End of split % 3.36/1.16 | % 3.36/1.16 End of proof % 3.36/1.16 % SZS output end Proof for theBenchmark % 3.36/1.16 % 3.36/1.16 587ms %------------------------------------------------------------------------------