%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI701_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 : n003.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 4.02s 1.43s % Output : Proof 4.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.10 % Problem : ARI701_1 : TPTP v8.1.2. Released v6.3.0. % 0.06/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.31 % Computer : n003.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 300 % 0.11/0.31 % DateTime : Tue Aug 29 18:12:11 EDT 2023 % 0.11/0.32 % CPUTime : % 0.50/0.60 ________ _____ % 0.50/0.60 ___ __ \_________(_)________________________________ % 0.50/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.50/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.50/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.50/0.60 % 0.50/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.50/0.60 (2023-06-19) % 0.50/0.60 % 0.50/0.60 (c) Philipp Rümmer, 2009-2023 % 0.50/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.50/0.60 Amanda Stjerna. % 0.50/0.60 Free software under BSD-3-Clause. % 0.50/0.60 % 0.50/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.50/0.60 % 0.50/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.50/0.61 Running up to 7 provers in parallel. % 0.67/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.21/1.10 Prover 6: Preprocessing ... % 2.21/1.10 Prover 1: Preprocessing ... % 2.21/1.10 Prover 0: Preprocessing ... % 2.21/1.10 Prover 5: Preprocessing ... % 2.21/1.10 Prover 3: Preprocessing ... % 2.21/1.10 Prover 2: Preprocessing ... % 2.21/1.10 Prover 4: Preprocessing ... % 2.70/1.19 Prover 2: Constructing countermodel ... % 2.70/1.19 Prover 1: Constructing countermodel ... % 2.70/1.19 Prover 4: Constructing countermodel ... % 2.70/1.19 Prover 3: Constructing countermodel ... % 2.70/1.19 Prover 5: Constructing countermodel ... % 2.70/1.19 Prover 0: Constructing countermodel ... % 2.70/1.19 Prover 6: Constructing countermodel ... % 4.02/1.43 Prover 3: proved (801ms) % 4.02/1.43 Prover 2: proved (802ms) % 4.02/1.43 % 4.02/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.02/1.43 % 4.02/1.43 Prover 6: proved (798ms) % 4.02/1.43 % 4.02/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.02/1.43 % 4.02/1.43 Prover 0: proved (803ms) % 4.02/1.43 % 4.02/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.02/1.43 % 4.02/1.43 % 4.02/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.02/1.43 % 4.02/1.43 Prover 5: proved (799ms) % 4.02/1.43 % 4.02/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.02/1.43 % 4.02/1.43 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.02/1.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.02/1.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.02/1.44 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.02/1.44 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.02/1.45 Prover 1: Found proof (size 6) % 4.02/1.45 Prover 4: Found proof (size 6) % 4.02/1.45 Prover 4: proved (826ms) % 4.02/1.45 Prover 1: proved (828ms) % 4.02/1.45 Prover 10: Preprocessing ... % 4.02/1.45 Prover 8: Preprocessing ... % 4.02/1.46 Prover 7: Preprocessing ... % 4.02/1.46 Prover 13: Preprocessing ... % 4.02/1.48 Prover 11: Preprocessing ... % 4.02/1.48 Prover 10: Constructing countermodel ... % 4.02/1.48 Prover 13: Constructing countermodel ... % 4.02/1.48 Prover 10: stopped % 4.02/1.48 Prover 13: stopped % 4.02/1.48 Prover 8: Constructing countermodel ... % 4.02/1.48 Prover 8: stopped % 4.02/1.48 Prover 7: Constructing countermodel ... % 4.40/1.48 Prover 7: stopped % 4.40/1.49 Prover 11: Constructing countermodel ... % 4.40/1.49 Prover 11: stopped % 4.40/1.49 % 4.40/1.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.40/1.49 % 4.40/1.49 % SZS output start Proof for theBenchmark % 4.40/1.50 Assumptions after simplification: % 4.40/1.50 --------------------------------- % 4.40/1.50 % 4.40/1.50 (conj) % 4.40/1.51 ? [v0: int] : ? [v1: int] : ( ~ (v1 = 1) & $product(v0, x) = v1 & % 4.40/1.51 $product(z, y) = v0) % 4.40/1.51 % 4.40/1.51 (eq1) % 4.40/1.51 $product(x, y) = a % 4.40/1.51 % 4.40/1.51 (eq3) % 4.40/1.51 $product(a, z) = 1 % 4.40/1.51 % 4.40/1.51 Further assumptions not needed in the proof: % 4.40/1.51 -------------------------------------------- % 4.40/1.51 eq2 % 4.40/1.51 % 4.40/1.51 Those formulas are unsatisfiable: % 4.40/1.51 --------------------------------- % 4.40/1.51 % 4.40/1.51 Begin of proof % 4.40/1.51 | % 4.40/1.52 | DELTA: instantiating (conj) with fresh symbols all_3_0, all_3_1 gives: % 4.40/1.52 | (1) ~ (all_3_0 = 1) & $product(all_3_1, x) = all_3_0 & $product(z, y) = % 4.40/1.52 | all_3_1 % 4.40/1.52 | % 4.40/1.52 | ALPHA: (1) implies: % 4.40/1.52 | (2) ~ (all_3_0 = 1) % 4.40/1.52 | (3) $product(z, y) = all_3_1 % 4.40/1.52 | (4) $product(all_3_1, x) = all_3_0 % 4.40/1.52 | % 4.40/1.52 | THEORY_AXIOM GroebnerMultiplication: % 4.40/1.52 | (5) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: % 4.40/1.52 | int] : ! [v5: int] : (v5 = 1 | ~ ($product(v4, v0) = v5) | ~ % 4.40/1.52 | ($product(v3, v1) = v4) | ~ ($product(v2, v3) = 1) | ~ % 4.40/1.52 | ($product(v0, v1) = v2)) % 4.40/1.52 | % 4.40/1.53 | GROUND_INST: instantiating (5) with x, y, a, z, all_3_1, all_3_0, simplifying % 4.40/1.53 | with (3), (4), (eq1), (eq3) gives: % 4.40/1.53 | (6) all_3_0 = 1 % 4.40/1.53 | % 4.40/1.53 | REDUCE: (2), (6) imply: % 4.40/1.53 | (7) $false % 4.40/1.53 | % 4.40/1.53 | CLOSE: (7) is inconsistent. % 4.40/1.53 | % 4.40/1.53 End of proof % 4.40/1.53 % SZS output end Proof for theBenchmark % 4.40/1.53 % 4.40/1.53 930ms %------------------------------------------------------------------------------