%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI450_1 : TPTP v8.1.2. Released v5.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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:05 EDT 2023 % Result : Theorem 5.94s 1.51s % Output : Proof 10.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.11 % Problem : ARI450_1 : TPTP v8.1.2. Released v5.0.0. % 0.09/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.31 % Computer : n016.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:27:16 EDT 2023 % 0.16/0.32 % CPUTime : % 0.16/0.58 ________ _____ % 0.16/0.58 ___ __ \_________(_)________________________________ % 0.16/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.16/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.16/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.16/0.58 % 0.16/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.16/0.58 (2023-06-19) % 0.16/0.58 % 0.16/0.58 (c) Philipp Rümmer, 2009-2023 % 0.16/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.16/0.58 Amanda Stjerna. % 0.16/0.58 Free software under BSD-3-Clause. % 0.16/0.58 % 0.16/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.16/0.58 % 0.16/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.16/0.60 Running up to 7 provers in parallel. % 0.60/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.60/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.60/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.60/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.60/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.60/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.60/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.53/0.91 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.53/0.91 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.53/0.91 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 1.53/0.91 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.53/0.91 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 1.53/0.91 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.53/0.91 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.73/1.00 Prover 4: Preprocessing ... % 1.73/1.00 Prover 1: Preprocessing ... % 2.26/1.05 Prover 6: Preprocessing ... % 2.26/1.06 Prover 0: Preprocessing ... % 3.88/1.31 Prover 3: Preprocessing ... % 3.88/1.32 Prover 5: Preprocessing ... % 3.88/1.32 Prover 2: Preprocessing ... % 5.05/1.43 Prover 6: Constructing countermodel ... % 5.05/1.44 Prover 0: Constructing countermodel ... % 5.65/1.50 Prover 0: proved (886ms) % 5.65/1.50 % 5.94/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.94/1.51 % 5.94/1.51 Prover 6: proved (884ms) % 5.94/1.51 % 5.94/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.94/1.51 % 5.94/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.94/1.51 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 5.94/1.52 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.94/1.52 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 6.16/1.55 Prover 8: Preprocessing ... % 7.34/1.69 Prover 7: Preprocessing ... % 7.34/1.73 Prover 1: Constructing countermodel ... % 7.34/1.76 Prover 1: Found proof (size 1) % 7.34/1.76 Prover 1: proved (1151ms) % 7.94/1.78 Prover 4: Constructing countermodel ... % 7.94/1.79 Prover 4: stopped % 8.43/1.86 Prover 8: Warning: ignoring some quantifiers % 8.43/1.88 Prover 8: Constructing countermodel ... % 8.43/1.88 Prover 8: stopped % 8.43/1.92 Prover 2: stopped % 9.48/2.05 Prover 5: Constructing countermodel ... % 9.48/2.05 Prover 5: stopped % 10.07/2.12 Prover 3: Constructing countermodel ... % 10.30/2.12 Prover 3: stopped % 10.30/2.13 Prover 7: stopped % 10.30/2.13 % 10.30/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.30/2.13 % 10.30/2.13 % SZS output start Proof for theBenchmark % 10.30/2.13 Assumptions after simplification: % 10.30/2.13 --------------------------------- % 10.30/2.13 % 10.30/2.13 (real_product_problem_15) % 10.30/2.14 $false % 10.30/2.14 % 10.30/2.14 Those formulas are unsatisfiable: % 10.30/2.14 --------------------------------- % 10.30/2.14 % 10.30/2.14 Begin of proof % 10.30/2.14 | % 10.41/2.14 | CLOSE: (real_product_problem_15) is inconsistent. % 10.41/2.14 | % 10.41/2.14 End of proof % 10.41/2.14 % SZS output end Proof for theBenchmark % 10.41/2.14 % 10.41/2.14 1555ms %------------------------------------------------------------------------------