%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI709_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:54 EDT 2023 % Result : Theorem 2.40s 1.05s % Output : Proof 2.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : ARI709_1 : TPTP v8.1.2. Released v6.3.0. % 0.04/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n003.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Aug 29 18:03:56 EDT 2023 % 0.14/0.34 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.03/0.99 Prover 0: Preprocessing ... % 2.03/0.99 Prover 4: Preprocessing ... % 2.03/0.99 Prover 5: Preprocessing ... % 2.03/0.99 Prover 2: Preprocessing ... % 2.03/0.99 Prover 6: Preprocessing ... % 2.03/0.99 Prover 1: Preprocessing ... % 2.03/1.00 Prover 3: Preprocessing ... % 2.03/1.02 Prover 0: Constructing countermodel ... % 2.03/1.02 Prover 6: Constructing countermodel ... % 2.03/1.02 Prover 5: Constructing countermodel ... % 2.03/1.02 Prover 1: Constructing countermodel ... % 2.03/1.02 Prover 4: Constructing countermodel ... % 2.03/1.02 Prover 3: Constructing countermodel ... % 2.03/1.02 Prover 2: Constructing countermodel ... % 2.40/1.05 Prover 3: proved (413ms) % 2.40/1.05 Prover 5: proved (411ms) % 2.40/1.05 Prover 6: proved (410ms) % 2.40/1.05 % 2.40/1.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.40/1.05 % 2.40/1.05 % 2.40/1.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.40/1.06 % 2.40/1.06 Prover 2: proved (414ms) % 2.40/1.06 % 2.40/1.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.40/1.06 % 2.40/1.06 % 2.40/1.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.40/1.06 % 2.40/1.06 Prover 0: proved (414ms) % 2.40/1.06 % 2.40/1.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.40/1.06 % 2.40/1.06 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.40/1.06 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.40/1.06 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.40/1.06 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.55/1.06 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.55/1.07 Prover 7: Preprocessing ... % 2.55/1.07 Prover 10: Preprocessing ... % 2.55/1.08 Prover 11: Preprocessing ... % 2.55/1.08 Prover 10: Constructing countermodel ... % 2.55/1.08 Prover 8: Preprocessing ... % 2.55/1.08 Prover 7: Constructing countermodel ... % 2.55/1.08 Prover 11: Constructing countermodel ... % 2.55/1.08 Prover 4: Found proof (size 2) % 2.55/1.08 Prover 1: Found proof (size 2) % 2.55/1.08 Prover 4: proved (444ms) % 2.55/1.08 Prover 1: proved (447ms) % 2.55/1.08 Prover 10: stopped % 2.55/1.08 Prover 11: stopped % 2.55/1.09 Prover 7: stopped % 2.55/1.09 Prover 13: Preprocessing ... % 2.55/1.10 Prover 8: Constructing countermodel ... % 2.55/1.10 Prover 8: stopped % 2.55/1.10 Prover 13: Constructing countermodel ... % 2.55/1.10 Prover 13: stopped % 2.55/1.10 % 2.55/1.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.55/1.10 % 2.55/1.10 % SZS output start Proof for theBenchmark % 2.55/1.11 Assumptions after simplification: % 2.55/1.11 --------------------------------- % 2.55/1.11 % 2.55/1.11 (conj) % 2.55/1.11 ~ (a = 3) % 2.55/1.11 % 2.55/1.11 (eq) % 2.55/1.11 a = 3 % 2.55/1.11 % 2.55/1.11 Those formulas are unsatisfiable: % 2.55/1.11 --------------------------------- % 2.55/1.11 % 2.55/1.11 Begin of proof % 2.55/1.11 | % 2.55/1.11 | REDUCE: (conj), (eq) imply: % 2.55/1.11 | (1) $false % 2.55/1.11 | % 2.55/1.11 | CLOSE: (1) is inconsistent. % 2.55/1.11 | % 2.55/1.11 End of proof % 2.55/1.11 % SZS output end Proof for theBenchmark % 2.55/1.11 % 2.55/1.11 496ms %------------------------------------------------------------------------------