%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI303_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 : n002.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:38 EDT 2023 % Result : Theorem 5.49s 1.43s % Output : Proof 10.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : ARI303_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.15/0.34 % Computer : n002.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue Aug 29 18:47:50 EDT 2023 % 0.15/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.62/0.90 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.90 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.90 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.90 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.90 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.90 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/0.90 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 2.44/1.02 Prover 1: Preprocessing ... % 2.44/1.02 Prover 4: Preprocessing ... % 2.57/1.09 Prover 6: Preprocessing ... % 2.57/1.09 Prover 0: Preprocessing ... % 3.70/1.24 Prover 2: Preprocessing ... % 3.70/1.24 Prover 3: Preprocessing ... % 3.70/1.24 Prover 5: Preprocessing ... % 4.77/1.36 Prover 6: Constructing countermodel ... % 5.49/1.42 Prover 6: proved (784ms) % 5.49/1.43 % 5.49/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.49/1.43 % 5.49/1.43 Prover 0: Constructing countermodel ... % 5.49/1.43 Prover 0: stopped % 5.49/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.49/1.44 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 5.49/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.49/1.46 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 5.49/1.47 Prover 8: Preprocessing ... % 6.12/1.53 Prover 7: Preprocessing ... % 7.41/1.68 Prover 1: Constructing countermodel ... % 7.53/1.70 Prover 1: Found proof (size 1) % 7.53/1.70 Prover 1: proved (1070ms) % 7.78/1.73 Prover 4: Constructing countermodel ... % 7.78/1.73 Prover 4: stopped % 7.78/1.78 Prover 8: Warning: ignoring some quantifiers % 7.78/1.79 Prover 8: Constructing countermodel ... % 7.78/1.79 Prover 8: stopped % 9.42/1.99 Prover 2: stopped % 9.42/2.02 Prover 7: stopped % 10.05/2.09 Prover 5: Constructing countermodel ... % 10.05/2.09 Prover 5: stopped % 10.32/2.10 Prover 3: Constructing countermodel ... % 10.32/2.11 Prover 3: stopped % 10.32/2.11 % 10.32/2.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.32/2.11 % 10.32/2.11 % SZS output start Proof for theBenchmark % 10.32/2.11 Assumptions after simplification: % 10.32/2.11 --------------------------------- % 10.32/2.11 % 10.32/2.11 (rat_product_problem_20) % 10.32/2.11 $false % 10.32/2.11 % 10.32/2.11 Those formulas are unsatisfiable: % 10.32/2.11 --------------------------------- % 10.32/2.11 % 10.32/2.11 Begin of proof % 10.32/2.11 | % 10.32/2.11 | CLOSE: (rat_product_problem_20) is inconsistent. % 10.32/2.11 | % 10.32/2.11 End of proof % 10.32/2.12 % SZS output end Proof for theBenchmark % 10.32/2.12 % 10.32/2.12 1501ms %------------------------------------------------------------------------------