%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI296_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 : n032.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:47:36 EDT 2023 % Result : Theorem 5.98s 1.48s % Output : Proof 11.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.07 % Problem : ARI296_1 : TPTP v8.1.2. Released v5.0.0. % 0.06/0.08 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.07/0.26 % Computer : n032.cluster.edu % 0.07/0.26 % Model : x86_64 x86_64 % 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.26 % Memory : 8042.1875MB % 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.26 % CPULimit : 300 % 0.07/0.26 % WCLimit : 300 % 0.07/0.26 % DateTime : Tue Aug 29 18:30:17 EDT 2023 % 0.07/0.26 % CPUTime : % 0.11/0.46 ________ _____ % 0.11/0.46 ___ __ \_________(_)________________________________ % 0.11/0.46 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.11/0.46 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.11/0.46 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.11/0.46 % 0.11/0.46 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.11/0.46 (2023-06-19) % 0.11/0.46 % 0.11/0.46 (c) Philipp Rümmer, 2009-2023 % 0.11/0.46 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.11/0.46 Amanda Stjerna. % 0.11/0.46 Free software under BSD-3-Clause. % 0.11/0.46 % 0.11/0.46 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.11/0.46 % 0.11/0.47 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.11/0.48 Running up to 7 provers in parallel. % 0.11/0.50 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.11/0.50 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.11/0.50 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.11/0.50 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.11/0.50 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.11/0.50 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.11/0.50 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.31/0.78 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.31/0.78 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.31/0.78 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.31/0.78 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.31/0.78 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.31/0.78 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.31/0.78 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.63/0.90 Prover 1: Preprocessing ... % 1.63/0.90 Prover 4: Preprocessing ... % 2.27/0.97 Prover 0: Preprocessing ... % 2.27/0.97 Prover 6: Preprocessing ... % 3.61/1.13 Prover 2: Preprocessing ... % 3.61/1.14 Prover 3: Preprocessing ... % 3.61/1.14 Prover 5: Preprocessing ... % 5.98/1.45 Prover 6: Constructing countermodel ... % 5.98/1.48 Prover 6: proved (976ms) % 5.98/1.48 % 5.98/1.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.98/1.48 % 5.98/1.48 Prover 1: Constructing countermodel ... % 5.98/1.48 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.98/1.48 Prover 1: Found proof (size 1) % 5.98/1.48 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 5.98/1.48 Prover 1: proved (990ms) % 5.98/1.49 Prover 0: Constructing countermodel ... % 5.98/1.49 Prover 0: stopped % 5.98/1.51 Prover 4: Constructing countermodel ... % 5.98/1.51 Prover 4: stopped % 6.65/1.56 Prover 7: Preprocessing ... % 7.96/1.78 Prover 2: stopped % 8.61/1.88 Prover 7: stopped % 11.23/2.28 Prover 3: Constructing countermodel ... % 11.23/2.28 Prover 3: stopped % 11.23/2.29 Prover 5: Constructing countermodel ... % 11.23/2.29 Prover 5: stopped % 11.23/2.29 % 11.23/2.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.23/2.29 % 11.23/2.29 % SZS output start Proof for theBenchmark % 11.23/2.29 Assumptions after simplification: % 11.23/2.29 --------------------------------- % 11.23/2.29 % 11.23/2.29 (rat_product_problem_13) % 11.23/2.30 $false % 11.23/2.30 % 11.23/2.30 Those formulas are unsatisfiable: % 11.23/2.30 --------------------------------- % 11.23/2.30 % 11.23/2.30 Begin of proof % 11.23/2.30 | % 11.23/2.30 | CLOSE: (rat_product_problem_13) is inconsistent. % 11.23/2.30 | % 11.23/2.30 End of proof % 11.23/2.30 % SZS output end Proof for theBenchmark % 11.23/2.30 % 11.23/2.30 1833ms %------------------------------------------------------------------------------