%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI286_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 : n021.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 5.98s 1.72s % Output : Proof 12.89s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : ARI286_1 : TPTP v8.1.2. Released v5.0.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.33 % Computer : n021.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Tue Aug 29 18:20:44 EDT 2023 % 0.11/0.33 % CPUTime : % 0.50/0.62 ________ _____ % 0.50/0.62 ___ __ \_________(_)________________________________ % 0.50/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.50/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.50/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.50/0.62 % 0.50/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.50/0.62 (2023-06-19) % 0.50/0.62 % 0.50/0.62 (c) Philipp Rümmer, 2009-2023 % 0.50/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.50/0.62 Amanda Stjerna. % 0.50/0.62 Free software under BSD-3-Clause. % 0.50/0.62 % 0.50/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.50/0.62 % 0.50/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.50/0.64 Running up to 7 provers in parallel. % 0.50/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.50/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.50/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.50/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.50/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.50/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.50/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.62/1.04 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.04 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.04 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.04 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.04 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.04 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.04 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 2.32/1.15 Prover 1: Preprocessing ... % 2.32/1.17 Prover 4: Preprocessing ... % 2.62/1.28 Prover 0: Preprocessing ... % 2.62/1.28 Prover 6: Preprocessing ... % 3.83/1.42 Prover 5: Preprocessing ... % 3.83/1.43 Prover 3: Preprocessing ... % 3.83/1.43 Prover 2: Preprocessing ... % 5.50/1.61 Prover 6: Constructing countermodel ... % 5.98/1.71 Prover 6: proved (1051ms) % 5.98/1.72 % 5.98/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.98/1.72 % 5.98/1.72 Prover 0: Constructing countermodel ... % 5.98/1.72 Prover 0: stopped % 5.98/1.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.98/1.72 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.98/1.73 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 5.98/1.73 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 5.98/1.74 Prover 8: Preprocessing ... % 7.82/1.92 Prover 7: Preprocessing ... % 8.93/2.10 Prover 1: Constructing countermodel ... % 9.18/2.11 Prover 1: Found proof (size 1) % 9.18/2.11 Prover 1: proved (1464ms) % 9.38/2.14 Prover 4: Constructing countermodel ... % 9.38/2.14 Prover 4: stopped % 9.38/2.18 Prover 8: Warning: ignoring some quantifiers % 9.38/2.19 Prover 8: Constructing countermodel ... % 9.38/2.20 Prover 8: stopped % 11.08/2.40 Prover 2: stopped % 12.00/2.58 Prover 7: stopped % 12.00/2.58 Prover 5: Constructing countermodel ... % 12.00/2.58 Prover 5: stopped % 12.89/2.69 Prover 3: Constructing countermodel ... % 12.89/2.69 Prover 3: stopped % 12.89/2.69 % 12.89/2.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.89/2.69 % 12.89/2.70 % SZS output start Proof for theBenchmark % 12.89/2.70 Assumptions after simplification: % 12.89/2.70 --------------------------------- % 12.89/2.70 % 12.89/2.70 (rat_product_problem_3) % 12.89/2.70 $false % 12.89/2.70 % 12.89/2.70 Those formulas are unsatisfiable: % 12.89/2.70 --------------------------------- % 12.89/2.70 % 12.89/2.70 Begin of proof % 12.89/2.70 | % 12.89/2.70 | CLOSE: (rat_product_problem_3) is inconsistent. % 12.89/2.70 | % 12.89/2.70 End of proof % 12.89/2.70 % SZS output end Proof for theBenchmark % 12.89/2.70 % 12.89/2.70 2080ms %------------------------------------------------------------------------------