%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI288_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 : n012.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:35 EDT 2023 % Result : Theorem 5.36s 1.51s % Output : Proof 11.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ARI288_1 : TPTP v8.1.2. Released v5.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n012.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:46:53 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.65 ________ _____ % 0.19/0.65 ___ __ \_________(_)________________________________ % 0.19/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.65 % 0.19/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.65 (2023-06-19) % 0.19/0.65 % 0.19/0.65 (c) Philipp Rümmer, 2009-2023 % 0.19/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.65 Amanda Stjerna. % 0.19/0.65 Free software under BSD-3-Clause. % 0.19/0.65 % 0.19/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.65 % 0.19/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.67 Running up to 7 provers in parallel. % 0.19/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.65/1.02 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.65/1.02 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.65/1.02 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.65/1.02 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.65/1.02 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.65/1.02 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.65/1.02 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 2.42/1.09 Prover 1: Preprocessing ... % 2.42/1.10 Prover 4: Preprocessing ... % 3.03/1.17 Prover 0: Preprocessing ... % 3.03/1.17 Prover 6: Preprocessing ... % 3.95/1.31 Prover 2: Preprocessing ... % 3.95/1.31 Prover 5: Preprocessing ... % 3.95/1.32 Prover 3: Preprocessing ... % 4.92/1.46 Prover 6: Constructing countermodel ... % 5.36/1.50 Prover 0: Constructing countermodel ... % 5.36/1.51 Prover 6: proved (814ms) % 5.36/1.51 % 5.36/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.36/1.51 % 5.36/1.51 Prover 0: proved (822ms) % 5.36/1.51 % 5.36/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.36/1.51 % 5.36/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.36/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.36/1.51 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 5.36/1.52 Prover 8: Preprocessing ... % 5.36/1.53 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 6.16/1.61 Prover 7: Preprocessing ... % 7.17/1.73 Prover 1: Constructing countermodel ... % 7.17/1.76 Prover 1: Found proof (size 1) % 7.17/1.76 Prover 1: proved (1076ms) % 7.56/1.82 Prover 4: Constructing countermodel ... % 7.56/1.82 Prover 4: stopped % 7.56/1.85 Prover 8: Warning: ignoring some quantifiers % 8.18/1.86 Prover 8: Constructing countermodel ... % 8.18/1.86 Prover 8: stopped % 9.33/2.10 Prover 2: stopped % 10.04/2.19 Prover 7: stopped % 10.54/2.22 Prover 5: Constructing countermodel ... % 10.54/2.22 Prover 5: stopped % 10.94/2.29 Prover 3: Constructing countermodel ... % 10.94/2.29 Prover 3: stopped % 10.94/2.29 % 10.94/2.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.94/2.29 % 10.94/2.29 % SZS output start Proof for theBenchmark % 10.94/2.30 Assumptions after simplification: % 10.94/2.30 --------------------------------- % 10.94/2.30 % 10.94/2.30 (rat_product_problem_5) % 11.02/2.30 $false % 11.02/2.30 % 11.02/2.30 Those formulas are unsatisfiable: % 11.02/2.30 --------------------------------- % 11.02/2.30 % 11.02/2.30 Begin of proof % 11.02/2.30 | % 11.02/2.30 | CLOSE: (rat_product_problem_5) is inconsistent. % 11.02/2.30 | % 11.02/2.30 End of proof % 11.02/2.31 % SZS output end Proof for theBenchmark % 11.02/2.31 % 11.02/2.31 1652ms %------------------------------------------------------------------------------