%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI674_1 : TPTP v8.1.2. Released v6.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n008.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:46 EDT 2023 % Result : Theorem 2.91s 1.26s % Output : Proof 3.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ARI674_1 : TPTP v8.1.2. Released v6.3.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n008.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 18:26:02 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.69 ________ _____ % 0.19/0.69 ___ __ \_________(_)________________________________ % 0.19/0.69 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.69 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.69 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.69 % 0.19/0.69 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.69 (2023-06-19) % 0.19/0.69 % 0.19/0.69 (c) Philipp Rümmer, 2009-2023 % 0.19/0.69 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.69 Amanda Stjerna. % 0.19/0.69 Free software under BSD-3-Clause. % 0.19/0.69 % 0.19/0.69 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.69 % 0.19/0.69 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.71 Running up to 7 provers in parallel. % 0.19/0.73 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.73 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.73 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.73 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.73 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.73 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.19/0.73 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.22/1.11 Prover 6: Preprocessing ... % 2.22/1.11 Prover 3: Preprocessing ... % 2.22/1.11 Prover 1: Preprocessing ... % 2.22/1.11 Prover 0: Preprocessing ... % 2.22/1.11 Prover 5: Preprocessing ... % 2.22/1.11 Prover 2: Preprocessing ... % 2.22/1.11 Prover 4: Preprocessing ... % 2.22/1.15 Prover 6: Constructing countermodel ... % 2.22/1.15 Prover 3: Constructing countermodel ... % 2.22/1.15 Prover 2: Constructing countermodel ... % 2.22/1.15 Prover 0: Constructing countermodel ... % 2.22/1.15 Prover 1: Constructing countermodel ... % 2.22/1.15 Prover 4: Constructing countermodel ... % 2.22/1.15 Prover 5: Constructing countermodel ... % 2.91/1.25 Prover 2: proved (533ms) % 2.91/1.25 Prover 6: proved (527ms) % 2.91/1.26 % 2.91/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.91/1.26 % 2.91/1.26 Prover 3: proved (530ms) % 2.91/1.26 % 2.91/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.91/1.26 % 2.91/1.26 Prover 0: proved (535ms) % 2.91/1.26 % 2.91/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.91/1.26 % 2.91/1.26 Prover 5: proved (526ms) % 2.91/1.26 % 2.91/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.91/1.26 % 2.91/1.26 % 2.91/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.91/1.26 % 2.91/1.27 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.91/1.27 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.91/1.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.91/1.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.91/1.27 Prover 7: Preprocessing ... % 2.91/1.27 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.91/1.27 Prover 10: Preprocessing ... % 2.91/1.27 Prover 4: Found proof (size 13) % 2.91/1.27 Prover 8: Preprocessing ... % 2.91/1.27 Prover 4: proved (550ms) % 2.91/1.28 Prover 1: Found proof (size 13) % 2.91/1.28 Prover 1: proved (558ms) % 2.91/1.28 Prover 7: Constructing countermodel ... % 2.91/1.28 Prover 10: Constructing countermodel ... % 2.91/1.28 Prover 11: Preprocessing ... % 2.91/1.28 Prover 7: stopped % 2.91/1.28 Prover 10: stopped % 2.91/1.28 Prover 8: Constructing countermodel ... % 2.91/1.28 Prover 8: stopped % 2.91/1.28 Prover 13: Preprocessing ... % 2.91/1.29 Prover 11: Constructing countermodel ... % 2.91/1.29 Prover 11: stopped % 2.91/1.29 Prover 13: Constructing countermodel ... % 2.91/1.29 Prover 13: stopped % 2.91/1.29 % 2.91/1.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.91/1.29 % 2.91/1.29 % SZS output start Proof for theBenchmark % 2.91/1.30 Assumptions after simplification: % 2.91/1.30 --------------------------------- % 2.91/1.30 % 2.91/1.30 (conj) % 2.91/1.30 ? [v0: int] : ($lesseq(4, v0) & $product(a, a) = v0) % 2.91/1.30 % 2.91/1.30 (conj_001) % 2.91/1.30 $lesseq(a, 1) & $lesseq(-1, a) % 2.91/1.30 % 2.91/1.30 Those formulas are unsatisfiable: % 2.91/1.30 --------------------------------- % 2.91/1.30 % 2.91/1.30 Begin of proof % 2.91/1.31 | % 2.91/1.31 | ALPHA: (conj_001) implies: % 3.48/1.31 | (1) $lesseq(-1, a) % 3.48/1.31 | (2) $lesseq(a, 1) % 3.48/1.31 | % 3.48/1.31 | DELTA: instantiating (conj) with fresh symbol all_3_0 gives: % 3.48/1.31 | (3) $lesseq(4, all_3_0) & $product(a, a) = all_3_0 % 3.48/1.31 | % 3.48/1.31 | ALPHA: (3) implies: % 3.48/1.31 | (4) $lesseq(4, all_3_0) % 3.48/1.31 | (5) $product(a, a) = all_3_0 % 3.48/1.31 | % 3.48/1.31 | THEORY_AXIOM GroebnerMultiplication: % 3.48/1.31 | (6) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(2, v1)) | ~ ($lesseq(v0, % 3.48/1.31 | 1)) | ~ ($lesseq(-1, v0)) | ~ ($product(v0, v0) = v1)) % 3.48/1.31 | % 3.48/1.31 | GROUND_INST: instantiating (6) with a, all_3_0, simplifying with (5) gives: % 3.48/1.31 | (7) ~ ($lesseq(2, all_3_0)) | ~ ($lesseq(a, 1)) | ~ ($lesseq(-1, a)) % 3.48/1.31 | % 3.48/1.31 | BETA: splitting (7) gives: % 3.48/1.31 | % 3.48/1.31 | Case 1: % 3.48/1.31 | | % 3.48/1.32 | | (8) $lesseq(2, a) % 3.48/1.32 | | % 3.48/1.32 | | COMBINE_INEQS: (2), (8) imply: % 3.48/1.32 | | (9) $false % 3.48/1.32 | | % 3.48/1.32 | | CLOSE: (9) is inconsistent. % 3.48/1.32 | | % 3.48/1.32 | Case 2: % 3.48/1.32 | | % 3.48/1.32 | | (10) ~ ($lesseq(2, all_3_0)) | ~ ($lesseq(-1, a)) % 3.48/1.32 | | % 3.48/1.32 | | BETA: splitting (10) gives: % 3.48/1.32 | | % 3.48/1.32 | | Case 1: % 3.48/1.32 | | | % 3.48/1.32 | | | (11) $lesseq(a, -2) % 3.48/1.32 | | | % 3.48/1.32 | | | COMBINE_INEQS: (1), (11) imply: % 3.48/1.32 | | | (12) $false % 3.48/1.32 | | | % 3.48/1.32 | | | CLOSE: (12) is inconsistent. % 3.48/1.32 | | | % 3.48/1.32 | | Case 2: % 3.48/1.32 | | | % 3.48/1.32 | | | (13) $lesseq(all_3_0, 1) % 3.48/1.32 | | | % 3.48/1.32 | | | COMBINE_INEQS: (4), (13) imply: % 3.48/1.32 | | | (14) $false % 3.48/1.32 | | | % 3.48/1.32 | | | CLOSE: (14) is inconsistent. % 3.48/1.32 | | | % 3.48/1.32 | | End of split % 3.48/1.32 | | % 3.48/1.32 | End of split % 3.48/1.32 | % 3.48/1.32 End of proof % 3.48/1.32 % SZS output end Proof for theBenchmark % 3.48/1.32 % 3.48/1.32 629ms %------------------------------------------------------------------------------