%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI287_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:34 EDT 2023 % Result : Theorem 4.25s 1.25s % Output : Proof 9.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.07 % Problem : ARI287_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:15:02 EDT 2023 % 0.07/0.27 % CPUTime : % 0.11/0.48 ________ _____ % 0.11/0.48 ___ __ \_________(_)________________________________ % 0.11/0.48 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.11/0.48 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.11/0.48 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.11/0.48 % 0.11/0.48 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.11/0.48 (2023-06-19) % 0.11/0.48 % 0.11/0.48 (c) Philipp Rümmer, 2009-2023 % 0.11/0.48 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.11/0.48 Amanda Stjerna. % 0.11/0.48 Free software under BSD-3-Clause. % 0.11/0.48 % 0.11/0.48 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.11/0.48 % 0.11/0.48 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.11/0.49 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.42/0.75 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.42/0.75 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.42/0.75 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.42/0.75 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.42/0.75 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.42/0.75 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.42/0.75 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.82/0.82 Prover 1: Preprocessing ... % 1.82/0.82 Prover 4: Preprocessing ... % 2.15/0.88 Prover 6: Preprocessing ... % 2.15/0.88 Prover 0: Preprocessing ... % 3.43/1.06 Prover 5: Preprocessing ... % 3.43/1.06 Prover 2: Preprocessing ... % 3.43/1.08 Prover 3: Preprocessing ... % 4.25/1.18 Prover 6: Constructing countermodel ... % 4.25/1.22 Prover 0: Constructing countermodel ... % 4.25/1.24 Prover 6: proved (731ms) % 4.25/1.24 % 4.25/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.25/1.25 % 4.25/1.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.25/1.25 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 4.25/1.26 Prover 0: proved (737ms) % 4.25/1.26 % 4.25/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.25/1.26 % 4.25/1.28 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.25/1.28 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 4.25/1.30 Prover 8: Preprocessing ... % 5.62/1.36 Prover 7: Preprocessing ... % 6.38/1.48 Prover 1: Constructing countermodel ... % 6.38/1.49 Prover 1: Found proof (size 1) % 6.38/1.49 Prover 1: proved (997ms) % 7.07/1.55 Prover 4: Constructing countermodel ... % 7.07/1.55 Prover 4: stopped % 7.40/1.59 Prover 8: Warning: ignoring some quantifiers % 7.40/1.59 Prover 8: Constructing countermodel ... % 7.40/1.59 Prover 8: stopped % 8.27/1.74 Prover 2: stopped % 8.59/1.84 Prover 7: stopped % 9.13/1.85 Prover 5: Constructing countermodel ... % 9.13/1.85 Prover 5: stopped % 9.13/1.87 Prover 3: Constructing countermodel ... % 9.13/1.87 Prover 3: stopped % 9.13/1.87 % 9.13/1.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.13/1.87 % 9.13/1.87 % SZS output start Proof for theBenchmark % 9.13/1.88 Assumptions after simplification: % 9.13/1.88 --------------------------------- % 9.13/1.88 % 9.13/1.88 (rat_product_problem_4) % 9.13/1.88 $false % 9.13/1.88 % 9.13/1.88 Those formulas are unsatisfiable: % 9.13/1.88 --------------------------------- % 9.13/1.88 % 9.13/1.88 Begin of proof % 9.13/1.89 | % 9.13/1.89 | CLOSE: (rat_product_problem_4) is inconsistent. % 9.13/1.89 | % 9.13/1.89 End of proof % 9.13/1.89 % SZS output end Proof for theBenchmark % 9.13/1.89 % 9.13/1.89 1410ms %------------------------------------------------------------------------------