%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI652_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 : n028.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:42 EDT 2023 % Result : Theorem 2.54s 1.11s % Output : Proof 3.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : ARI652_1 : TPTP v8.1.2. Released v6.3.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n028.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:17:41 EDT 2023 % 0.13/0.34 % CPUTime : % 0.60/0.60 ________ _____ % 0.60/0.60 ___ __ \_________(_)________________________________ % 0.60/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.60 % 0.60/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.60 (2023-06-19) % 0.60/0.60 % 0.60/0.60 (c) Philipp Rümmer, 2009-2023 % 0.60/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.60 Amanda Stjerna. % 0.60/0.60 Free software under BSD-3-Clause. % 0.60/0.60 % 0.60/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.60 % 0.60/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.60/0.62 Running up to 7 provers in parallel. % 0.60/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.60/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.60/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.60/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.60/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.60/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.60/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.05/1.03 Prover 1: Preprocessing ... % 2.05/1.03 Prover 0: Preprocessing ... % 2.05/1.03 Prover 4: Preprocessing ... % 2.05/1.03 Prover 6: Preprocessing ... % 2.05/1.03 Prover 3: Preprocessing ... % 2.05/1.03 Prover 5: Preprocessing ... % 2.05/1.03 Prover 2: Preprocessing ... % 2.54/1.08 Prover 2: Constructing countermodel ... % 2.54/1.08 Prover 6: Constructing countermodel ... % 2.54/1.08 Prover 3: Constructing countermodel ... % 2.54/1.08 Prover 4: Constructing countermodel ... % 2.54/1.08 Prover 1: Constructing countermodel ... % 2.54/1.08 Prover 0: Constructing countermodel ... % 2.54/1.08 Prover 5: Constructing countermodel ... % 2.54/1.11 Prover 0: proved (474ms) % 2.54/1.11 Prover 3: proved (470ms) % 2.54/1.11 % 2.54/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.54/1.11 % 2.54/1.11 Prover 6: proved (468ms) % 2.54/1.11 % 2.54/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.54/1.11 % 2.54/1.11 Prover 5: proved (469ms) % 2.54/1.11 % 2.54/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.54/1.11 % 2.54/1.11 Prover 2: proved (471ms) % 2.54/1.11 % 2.54/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.54/1.11 % 2.54/1.11 % 2.54/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.54/1.11 % 2.54/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.54/1.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.54/1.11 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.54/1.12 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.54/1.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.54/1.12 Prover 7: Preprocessing ... % 2.85/1.13 Prover 11: Preprocessing ... % 2.85/1.13 Prover 13: Preprocessing ... % 2.85/1.13 Prover 7: Constructing countermodel ... % 2.85/1.14 Prover 13: Constructing countermodel ... % 2.85/1.14 Prover 8: Preprocessing ... % 2.85/1.14 Prover 10: Preprocessing ... % 2.85/1.14 Prover 11: Constructing countermodel ... % 2.85/1.15 Prover 8: Constructing countermodel ... % 2.85/1.15 Prover 10: Constructing countermodel ... % 2.85/1.20 Prover 8: Found proof (size 8) % 2.85/1.20 Prover 10: Found proof (size 8) % 2.85/1.20 Prover 1: Found proof (size 8) % 2.85/1.20 Prover 4: Found proof (size 8) % 2.85/1.20 Prover 11: Found proof (size 8) % 2.85/1.20 Prover 13: Found proof (size 8) % 2.85/1.20 Prover 7: Found proof (size 8) % 2.85/1.20 Prover 1: proved (566ms) % 2.85/1.20 Prover 11: proved (82ms) % 2.85/1.20 Prover 10: proved (87ms) % 2.85/1.20 Prover 7: proved (88ms) % 2.85/1.20 Prover 4: proved (563ms) % 2.85/1.20 Prover 13: proved (82ms) % 2.85/1.20 Prover 8: proved (88ms) % 2.85/1.20 % 2.85/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.85/1.20 % 2.85/1.20 % SZS output start Proof for theBenchmark % 2.85/1.21 Assumptions after simplification: % 2.85/1.21 --------------------------------- % 2.85/1.21 % 2.85/1.21 (conj) % 3.33/1.21 $lesseq(-1, a) % 3.33/1.21 % 3.33/1.21 (conj_001) % 3.33/1.21 $lesseq(a, -1) % 3.33/1.21 % 3.33/1.21 (conj_002) % 3.33/1.21 ? [v0: int] : ( ~ (v0 = 1) & $product(a, a) = v0) % 3.33/1.21 % 3.33/1.21 Those formulas are unsatisfiable: % 3.33/1.21 --------------------------------- % 3.33/1.21 % 3.33/1.21 Begin of proof % 3.33/1.21 | % 3.33/1.22 | ANTI_SYMM: (conj), (conj_001) imply: % 3.33/1.22 | (1) a = -1 % 3.33/1.22 | % 3.33/1.22 | DELTA: instantiating (conj_002) with fresh symbol all_3_0 gives: % 3.33/1.22 | (2) ~ (all_3_0 = 1) & $product(a, a) = all_3_0 % 3.33/1.22 | % 3.33/1.22 | ALPHA: (2) implies: % 3.33/1.22 | (3) ~ (all_3_0 = 1) % 3.33/1.22 | (4) $product(a, a) = all_3_0 % 3.33/1.22 | % 3.33/1.22 | REDUCE: (1), (4) imply: % 3.33/1.22 | (5) $product(-1, -1) = all_3_0 % 3.33/1.22 | % 3.33/1.22 | THEORY_AXIOM GroebnerMultiplication: % 3.33/1.22 | (6) ! [v0: int] : (v0 = 1 | ~ ($product(-1, -1) = v0)) % 3.33/1.22 | % 3.33/1.22 | GROUND_INST: instantiating (6) with all_3_0, simplifying with (5) gives: % 3.33/1.22 | (7) all_3_0 = 1 % 3.33/1.22 | % 3.33/1.22 | REDUCE: (3), (7) imply: % 3.33/1.22 | (8) $false % 3.33/1.22 | % 3.33/1.22 | CLOSE: (8) is inconsistent. % 3.33/1.22 | % 3.33/1.22 End of proof % 3.33/1.22 % SZS output end Proof for theBenchmark % 3.33/1.22 % 3.33/1.22 620ms %------------------------------------------------------------------------------