%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI261_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 : n014.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:29 EDT 2023 % Result : Theorem 4.59s 1.37s % Output : Proof 10.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : ARI261_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n014.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 18:34:15 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.67 ________ _____ % 0.20/0.67 ___ __ \_________(_)________________________________ % 0.20/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.67 % 0.20/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.67 (2023-06-19) % 0.20/0.67 % 0.20/0.67 (c) Philipp Rümmer, 2009-2023 % 0.20/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.67 Amanda Stjerna. % 0.20/0.67 Free software under BSD-3-Clause. % 0.20/0.67 % 0.20/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.67 % 0.20/0.67 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.68 Running up to 7 provers in parallel. % 0.20/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.62/0.96 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.96 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.96 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.96 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.96 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.97 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.97 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 2.11/1.04 Prover 4: Preprocessing ... % 2.11/1.04 Prover 1: Preprocessing ... % 2.63/1.11 Prover 6: Preprocessing ... % 2.63/1.11 Prover 0: Preprocessing ... % 3.81/1.25 Prover 2: Preprocessing ... % 3.81/1.25 Prover 5: Preprocessing ... % 3.81/1.26 Prover 3: Preprocessing ... % 4.59/1.33 Prover 6: Constructing countermodel ... % 4.59/1.37 Prover 6: proved (673ms) % 4.59/1.37 % 4.59/1.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.59/1.37 % 4.59/1.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.59/1.38 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 4.59/1.42 Prover 0: Constructing countermodel ... % 4.59/1.42 Prover 0: stopped % 4.59/1.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.59/1.45 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 4.59/1.45 Prover 8: Preprocessing ... % 4.59/1.48 Prover 7: Preprocessing ... % 6.43/1.68 Prover 1: Constructing countermodel ... % 6.43/1.68 Prover 1: Found proof (size 1) % 6.43/1.68 Prover 1: proved (995ms) % 7.30/1.72 Prover 4: Constructing countermodel ... % 7.30/1.72 Prover 4: stopped % 7.30/1.76 Prover 8: Warning: ignoring some quantifiers % 7.30/1.78 Prover 8: Constructing countermodel ... % 7.30/1.78 Prover 8: stopped % 9.38/2.01 Prover 2: stopped % 9.38/2.05 Prover 7: stopped % 9.99/2.09 Prover 5: Constructing countermodel ... % 9.99/2.09 Prover 5: stopped % 10.11/2.19 Prover 3: Constructing countermodel ... % 10.11/2.19 Prover 3: stopped % 10.11/2.19 % 10.11/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.11/2.19 % 10.11/2.19 % SZS output start Proof for theBenchmark % 10.11/2.20 Assumptions after simplification: % 10.11/2.20 --------------------------------- % 10.11/2.20 % 10.11/2.20 (rat_sum_problem_16) % 10.11/2.20 $false % 10.11/2.20 % 10.11/2.20 Those formulas are unsatisfiable: % 10.11/2.20 --------------------------------- % 10.11/2.20 % 10.11/2.20 Begin of proof % 10.11/2.20 | % 10.11/2.20 | CLOSE: (rat_sum_problem_16) is inconsistent. % 10.11/2.20 | % 10.11/2.20 End of proof % 10.11/2.20 % SZS output end Proof for theBenchmark % 10.11/2.20 % 10.11/2.20 1531ms %------------------------------------------------------------------------------