%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI706_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 : n010.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:53 EDT 2023 % Result : Theorem 3.36s 1.20s % Output : Proof 3.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ARI706_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.12/0.34 % Computer : n010.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Tue Aug 29 18:06:18 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.62 ________ _____ % 0.19/0.62 ___ __ \_________(_)________________________________ % 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.62 % 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.62 (2023-06-19) % 0.19/0.62 % 0.19/0.62 (c) Philipp Rümmer, 2009-2023 % 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.62 Amanda Stjerna. % 0.19/0.62 Free software under BSD-3-Clause. % 0.19/0.62 % 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.62 % 0.19/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.57/0.63 Running up to 7 provers in parallel. % 0.57/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.57/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.57/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.57/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.57/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.57/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.57/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.98/0.99 Prover 5: Preprocessing ... % 1.98/0.99 Prover 3: Preprocessing ... % 1.98/0.99 Prover 2: Preprocessing ... % 1.98/0.99 Prover 6: Preprocessing ... % 1.98/0.99 Prover 0: Preprocessing ... % 1.98/0.99 Prover 1: Preprocessing ... % 1.98/0.99 Prover 4: Preprocessing ... % 2.27/1.05 Prover 4: Constructing countermodel ... % 2.27/1.05 Prover 1: Constructing countermodel ... % 2.27/1.05 Prover 2: Constructing countermodel ... % 2.27/1.05 Prover 5: Constructing countermodel ... % 2.27/1.05 Prover 0: Constructing countermodel ... % 2.27/1.05 Prover 6: Constructing countermodel ... % 2.27/1.05 Prover 3: Constructing countermodel ... % 3.36/1.20 Prover 5: proved (559ms) % 3.36/1.20 Prover 2: proved (562ms) % 3.36/1.20 % 3.36/1.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.36/1.20 % 3.36/1.20 Prover 6: proved (559ms) % 3.36/1.20 Prover 0: proved (561ms) % 3.36/1.20 % 3.36/1.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.36/1.20 % 3.36/1.20 Prover 3: proved (561ms) % 3.36/1.20 % 3.36/1.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.36/1.20 % 3.36/1.21 % 3.36/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.36/1.21 % 3.36/1.21 % 3.36/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.36/1.21 % 3.36/1.21 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.36/1.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.36/1.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.36/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.36/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.36/1.21 Prover 8: Preprocessing ... % 3.36/1.21 Prover 7: Preprocessing ... % 3.36/1.21 Prover 10: Preprocessing ... % 3.36/1.21 Prover 1: Found proof (size 10) % 3.36/1.21 Prover 4: Found proof (size 10) % 3.36/1.22 Prover 1: proved (582ms) % 3.36/1.22 Prover 4: proved (580ms) % 3.36/1.22 Prover 13: Preprocessing ... % 3.36/1.22 Prover 8: Constructing countermodel ... % 3.36/1.22 Prover 11: Preprocessing ... % 3.36/1.22 Prover 8: stopped % 3.36/1.22 Prover 10: Constructing countermodel ... % 3.36/1.22 Prover 10: stopped % 3.36/1.23 Prover 7: Constructing countermodel ... % 3.36/1.23 Prover 7: stopped % 3.36/1.23 Prover 13: Constructing countermodel ... % 3.36/1.23 Prover 11: Constructing countermodel ... % 3.36/1.23 Prover 13: stopped % 3.36/1.23 Prover 11: stopped % 3.36/1.23 % 3.36/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.36/1.23 % 3.36/1.23 % SZS output start Proof for theBenchmark % 3.36/1.23 Assumptions after simplification: % 3.36/1.23 --------------------------------- % 3.36/1.23 % 3.36/1.24 (conj) % 3.36/1.24 ? [v0: int] : ? [v1: int] : ( ~ (v1 = v0) & $product($product(3, d), d) = v1 % 3.36/1.24 & $product(d, d) = v0) % 3.36/1.24 % 3.36/1.24 (eq) % 3.36/1.24 ? [v0: int] : ($product($product(2, d), d) = v0 & $product(d, d) = v0) % 3.36/1.24 % 3.36/1.24 Those formulas are unsatisfiable: % 3.36/1.24 --------------------------------- % 3.36/1.24 % 3.36/1.24 Begin of proof % 3.36/1.24 | % 3.36/1.25 | DELTA: instantiating (eq) with fresh symbol all_2_0 gives: % 3.36/1.25 | (1) $product($product(2, d), d) = all_2_0 & $product(d, d) = all_2_0 % 3.36/1.25 | % 3.36/1.25 | ALPHA: (1) implies: % 3.36/1.25 | (2) $product(d, d) = all_2_0 % 3.36/1.25 | (3) $product($product(2, d), d) = all_2_0 % 3.36/1.25 | % 3.36/1.25 | DELTA: instantiating (conj) with fresh symbols all_4_0, all_4_1 gives: % 3.36/1.25 | (4) ~ (all_4_0 = all_4_1) & $product($product(3, d), d) = all_4_0 & % 3.36/1.25 | $product(d, d) = all_4_1 % 3.36/1.25 | % 3.36/1.25 | ALPHA: (4) implies: % 3.36/1.25 | (5) ~ (all_4_0 = all_4_1) % 3.36/1.25 | (6) $product(d, d) = all_4_1 % 3.36/1.25 | (7) $product($product(3, d), d) = all_4_0 % 3.36/1.25 | % 3.36/1.25 | THEORY_AXIOM GroebnerMultiplication: % 3.36/1.25 | (8) ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = 0 | ~ % 3.36/1.25 | ($product($product(3, v0), v0) = v2) | ~ ($product($product(2, v0), % 3.36/1.26 | v0) = v1) | ~ ($product(v0, v0) = v1)) % 3.36/1.26 | % 3.36/1.26 | GROUND_INST: instantiating (8) with d, all_2_0, all_4_0, simplifying with (2), % 3.36/1.26 | (3), (7) gives: % 3.36/1.26 | (9) all_4_0 = 0 % 3.36/1.26 | % 3.36/1.26 | THEORY_AXIOM GroebnerMultiplication: % 3.36/1.26 | (10) ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = 0 | ~ % 3.36/1.26 | ($product($product(2, v0), v0) = v1) | ~ ($product(v0, v0) = v2) | % 3.36/1.26 | ~ ($product(v0, v0) = v1)) % 3.36/1.26 | % 3.36/1.26 | GROUND_INST: instantiating (10) with d, all_2_0, all_4_1, simplifying with % 3.36/1.26 | (2), (3), (6) gives: % 3.36/1.26 | (11) all_4_1 = 0 % 3.36/1.26 | % 3.36/1.26 | REDUCE: (5), (9), (11) imply: % 3.36/1.26 | (12) $false % 3.36/1.26 | % 3.36/1.26 | CLOSE: (12) is inconsistent. % 3.36/1.26 | % 3.36/1.26 End of proof % 3.36/1.26 % SZS output end Proof for theBenchmark % 3.36/1.26 % 3.36/1.26 645ms %------------------------------------------------------------------------------