%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI702_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 : n009.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:52 EDT 2023 % Result : Theorem 3.67s 1.31s % Output : Proof 4.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ARI702_1 : TPTP v8.1.2. Released v6.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n009.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:07:35 EDT 2023 % 0.13/0.34 % CPUTime : % 0.49/0.62 ________ _____ % 0.49/0.62 ___ __ \_________(_)________________________________ % 0.49/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.49/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.49/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.49/0.63 % 0.49/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.49/0.63 (2023-06-19) % 0.49/0.63 % 0.49/0.63 (c) Philipp Rümmer, 2009-2023 % 0.49/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.49/0.63 Amanda Stjerna. % 0.49/0.63 Free software under BSD-3-Clause. % 0.49/0.63 % 0.49/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.49/0.63 % 0.49/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.64 Running up to 7 provers in parallel. % 0.69/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.69/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.69/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.69/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.69/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.69/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.69/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.25/1.06 Prover 0: Preprocessing ... % 2.25/1.06 Prover 1: Preprocessing ... % 2.25/1.06 Prover 6: Preprocessing ... % 2.25/1.06 Prover 5: Preprocessing ... % 2.25/1.06 Prover 2: Preprocessing ... % 2.25/1.06 Prover 3: Preprocessing ... % 2.25/1.06 Prover 4: Preprocessing ... % 2.42/1.12 Prover 1: Constructing countermodel ... % 2.42/1.12 Prover 2: Constructing countermodel ... % 2.42/1.12 Prover 6: Constructing countermodel ... % 2.42/1.12 Prover 4: Constructing countermodel ... % 2.42/1.12 Prover 0: Constructing countermodel ... % 2.42/1.12 Prover 3: Constructing countermodel ... % 2.42/1.12 Prover 5: Constructing countermodel ... % 3.67/1.30 Prover 3: proved (658ms) % 3.67/1.30 Prover 0: proved (658ms) % 3.67/1.31 % 3.67/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.67/1.31 % 3.67/1.31 Prover 2: proved (659ms) % 3.67/1.31 % 3.67/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.67/1.31 % 3.67/1.31 Prover 6: proved (655ms) % 3.67/1.31 % 3.67/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.67/1.31 % 3.67/1.31 Prover 5: proved (654ms) % 3.67/1.31 % 3.67/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.67/1.31 % 3.67/1.31 % 3.67/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.67/1.31 % 3.67/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.67/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.67/1.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.67/1.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.67/1.33 Prover 8: Preprocessing ... % 3.67/1.33 Prover 10: Preprocessing ... % 3.67/1.33 Prover 1: Found proof (size 6) % 3.67/1.33 Prover 1: proved (677ms) % 3.67/1.33 Prover 4: Found proof (size 6) % 3.67/1.33 Prover 4: proved (677ms) % 3.67/1.33 Prover 7: Preprocessing ... % 3.67/1.33 Prover 11: Preprocessing ... % 3.67/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.08/1.33 Prover 10: Constructing countermodel ... % 4.08/1.33 Prover 8: Constructing countermodel ... % 4.08/1.33 Prover 8: stopped % 4.08/1.33 Prover 10: stopped % 4.08/1.34 Prover 13: Preprocessing ... % 4.08/1.34 Prover 7: Constructing countermodel ... % 4.08/1.34 Prover 7: stopped % 4.08/1.34 Prover 11: Constructing countermodel ... % 4.08/1.34 Prover 11: stopped % 4.08/1.35 Prover 13: Constructing countermodel ... % 4.08/1.35 Prover 13: stopped % 4.08/1.35 % 4.08/1.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.08/1.35 % 4.08/1.35 % SZS output start Proof for theBenchmark % 4.08/1.36 Assumptions after simplification: % 4.08/1.36 --------------------------------- % 4.08/1.36 % 4.08/1.36 (conj) % 4.24/1.36 ? [v0: int] : ? [v1: int] : ( ~ (v1 = 1) & $product(v0, z) = v1 & % 4.24/1.36 $product(x, y) = v0) % 4.24/1.36 % 4.24/1.36 (eq1) % 4.24/1.36 $product($product(2, x), y) = a % 4.24/1.36 % 4.24/1.37 (eq3) % 4.24/1.37 $product(a, z) = 2 % 4.24/1.37 % 4.24/1.37 Further assumptions not needed in the proof: % 4.24/1.37 -------------------------------------------- % 4.24/1.37 eq2 % 4.24/1.37 % 4.24/1.37 Those formulas are unsatisfiable: % 4.24/1.37 --------------------------------- % 4.24/1.37 % 4.24/1.37 Begin of proof % 4.24/1.37 | % 4.24/1.37 | DELTA: instantiating (conj) with fresh symbols all_3_0, all_3_1 gives: % 4.24/1.37 | (1) ~ (all_3_0 = 1) & $product(all_3_1, z) = all_3_0 & $product(x, y) = % 4.24/1.37 | all_3_1 % 4.24/1.37 | % 4.24/1.37 | ALPHA: (1) implies: % 4.24/1.37 | (2) ~ (all_3_0 = 1) % 4.24/1.37 | (3) $product(x, y) = all_3_1 % 4.24/1.37 | (4) $product(all_3_1, z) = all_3_0 % 4.24/1.37 | % 4.24/1.37 | THEORY_AXIOM GroebnerMultiplication: % 4.24/1.37 | (5) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: % 4.24/1.37 | int] : ! [v5: int] : (v5 = 1 | ~ ($product(v4, v3) = v5) | ~ % 4.24/1.37 | ($product(v2, v3) = 2) | ~ ($product($product(2, v0), v1) = v2) | ~ % 4.24/1.37 | ($product(v0, v1) = v4)) % 4.24/1.37 | % 4.24/1.37 | GROUND_INST: instantiating (5) with x, y, a, z, all_3_1, all_3_0, simplifying % 4.24/1.37 | with (3), (4), (eq1), (eq3) gives: % 4.24/1.38 | (6) all_3_0 = 1 % 4.24/1.38 | % 4.24/1.38 | REDUCE: (2), (6) imply: % 4.24/1.38 | (7) $false % 4.24/1.38 | % 4.24/1.38 | CLOSE: (7) is inconsistent. % 4.24/1.38 | % 4.24/1.38 End of proof % 4.24/1.38 % SZS output end Proof for theBenchmark % 4.24/1.38 % 4.24/1.38 750ms %------------------------------------------------------------------------------