%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI684_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 : n002.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:48 EDT 2023 % Result : Theorem 3.28s 1.43s % Output : Proof 4.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : ARI684_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 : n002.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.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 19:05:35 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.66 ________ _____ % 0.20/0.66 ___ __ \_________(_)________________________________ % 0.20/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.66 % 0.20/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.66 (2023-06-19) % 0.20/0.66 % 0.20/0.66 (c) Philipp Rümmer, 2009-2023 % 0.20/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.66 Amanda Stjerna. % 0.20/0.66 Free software under BSD-3-Clause. % 0.20/0.66 % 0.20/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.66 % 0.20/0.66 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.67 Running up to 7 provers in parallel. % 0.20/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.35/1.12 Prover 4: Preprocessing ... % 2.35/1.12 Prover 5: Preprocessing ... % 2.35/1.12 Prover 1: Preprocessing ... % 2.35/1.13 Prover 6: Preprocessing ... % 2.35/1.13 Prover 3: Preprocessing ... % 2.35/1.13 Prover 0: Preprocessing ... % 2.35/1.13 Prover 2: Preprocessing ... % 2.39/1.20 Prover 0: Constructing countermodel ... % 2.39/1.20 Prover 3: Constructing countermodel ... % 2.39/1.20 Prover 2: Constructing countermodel ... % 2.39/1.20 Prover 1: Constructing countermodel ... % 2.39/1.20 Prover 5: Constructing countermodel ... % 2.39/1.20 Prover 6: Constructing countermodel ... % 2.39/1.20 Prover 4: Constructing countermodel ... % 3.28/1.42 Prover 2: proved (746ms) % 3.28/1.42 Prover 6: proved (742ms) % 3.28/1.42 Prover 0: proved (747ms) % 3.28/1.43 % 3.28/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.28/1.43 % 3.28/1.43 % 3.28/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.28/1.43 % 3.28/1.44 Prover 5: proved (743ms) % 3.28/1.44 % 3.28/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.28/1.44 % 3.28/1.44 % 3.28/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.28/1.44 % 3.28/1.44 Prover 3: proved (750ms) % 3.28/1.44 % 3.28/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.28/1.44 % 3.28/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.28/1.44 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.28/1.44 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.28/1.44 Prover 7: Preprocessing ... % 3.28/1.45 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.00/1.45 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.00/1.46 Prover 4: Found proof (size 6) % 4.00/1.46 Prover 1: Found proof (size 6) % 4.00/1.46 Prover 4: proved (776ms) % 4.00/1.46 Prover 1: proved (779ms) % 4.00/1.46 Prover 7: Constructing countermodel ... % 4.00/1.46 Prover 7: stopped % 4.00/1.46 Prover 10: Preprocessing ... % 4.00/1.46 Prover 8: Preprocessing ... % 4.00/1.46 Prover 13: Preprocessing ... % 4.00/1.47 Prover 11: Preprocessing ... % 4.00/1.47 Prover 8: Constructing countermodel ... % 4.00/1.47 Prover 10: Constructing countermodel ... % 4.00/1.47 Prover 8: stopped % 4.00/1.47 Prover 10: stopped % 4.00/1.47 Prover 13: Constructing countermodel ... % 4.40/1.47 Prover 13: stopped % 4.40/1.48 Prover 11: Constructing countermodel ... % 4.40/1.48 Prover 11: stopped % 4.40/1.48 % 4.40/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.40/1.48 % 4.40/1.48 % SZS output start Proof for theBenchmark % 4.40/1.49 Assumptions after simplification: % 4.40/1.49 --------------------------------- % 4.40/1.49 % 4.40/1.49 (conj) % 4.40/1.49 ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ? [v4: int] : ? % 4.40/1.49 [v5: int] : ( ~ ($sum(v5, v3) = v1) & $product(v4, c) = v5 & $product(v2, c) = % 4.40/1.49 v3 & $product(v0, c) = v1 & $product(a, $sum(b, a)) = v0 & $product(a, b) = % 4.40/1.49 v4 & $product(a, a) = v2) % 4.40/1.49 % 4.40/1.49 Those formulas are unsatisfiable: % 4.40/1.49 --------------------------------- % 4.40/1.49 % 4.40/1.49 Begin of proof % 4.40/1.50 | % 4.40/1.50 | DELTA: instantiating (conj) with fresh symbols all_2_0, all_2_1, all_2_2, % 4.40/1.50 | all_2_3, all_2_4, all_2_5 gives: % 4.40/1.50 | (1) ~ ($sum(all_2_0, all_2_2) = all_2_4) & $product(all_2_1, c) = all_2_0 % 4.40/1.50 | & $product(all_2_3, c) = all_2_2 & $product(all_2_5, c) = all_2_4 & % 4.40/1.50 | $product(a, $sum(b, a)) = all_2_5 & $product(a, b) = all_2_1 & % 4.40/1.50 | $product(a, a) = all_2_3 % 4.40/1.50 | % 4.40/1.50 | ALPHA: (1) implies: % 4.40/1.50 | (2) ~ ($sum(all_2_0, all_2_2) = all_2_4) % 4.40/1.50 | (3) $product(a, a) = all_2_3 % 4.40/1.50 | (4) $product(a, b) = all_2_1 % 4.53/1.50 | (5) $product(a, $sum(b, a)) = all_2_5 % 4.53/1.50 | (6) $product(all_2_5, c) = all_2_4 % 4.53/1.50 | (7) $product(all_2_3, c) = all_2_2 % 4.53/1.50 | (8) $product(all_2_1, c) = all_2_0 % 4.53/1.51 | % 4.53/1.51 | THEORY_AXIOM GroebnerMultiplication: % 4.53/1.51 | (9) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: % 4.53/1.51 | int] : ! [v5: int] : ! [v6: int] : ! [v7: int] : ! [v8: int] : % 4.53/1.51 | ($sum(v8, v6) = v4 | ~ ($product(v7, v2) = v8) | ~ ($product(v5, v2) % 4.53/1.51 | = v6) | ~ ($product(v3, v2) = v4) | ~ ($product(v0, $sum(v1, v0)) % 4.53/1.51 | = v3) | ~ ($product(v0, v1) = v7) | ~ ($product(v0, v0) = v5)) % 4.53/1.51 | % 4.53/1.51 | GROUND_INST: instantiating (9) with a, b, c, all_2_5, all_2_4, all_2_3, % 4.53/1.51 | all_2_2, all_2_1, all_2_0, simplifying with (3), (4), (5), (6), % 4.53/1.51 | (7), (8) gives: % 4.53/1.51 | (10) $sum(all_2_0, all_2_2) = all_2_4 % 4.53/1.51 | % 4.53/1.51 | REDUCE: (2), (10) imply: % 4.53/1.51 | (11) $false % 4.53/1.51 | % 4.53/1.51 | CLOSE: (11) is inconsistent. % 4.53/1.51 | % 4.53/1.51 End of proof % 4.53/1.51 % SZS output end Proof for theBenchmark % 4.53/1.51 % 4.53/1.51 853ms %------------------------------------------------------------------------------