%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI312_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:40 EDT 2023 % Result : Theorem 5.77s 1.60s % Output : Proof 9.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : ARI312_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.12/0.32 % Computer : n032.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 300 % 0.12/0.32 % DateTime : Tue Aug 29 18:13:16 EDT 2023 % 0.12/0.32 % CPUTime : % 0.17/0.62 ________ _____ % 0.17/0.62 ___ __ \_________(_)________________________________ % 0.17/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.62 % 0.17/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.62 (2023-06-19) % 0.17/0.62 % 0.17/0.62 (c) Philipp Rümmer, 2009-2023 % 0.17/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.62 Amanda Stjerna. % 0.17/0.62 Free software under BSD-3-Clause. % 0.17/0.62 % 0.17/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.62 % 0.17/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.61/0.63 Running up to 7 provers in parallel. % 0.61/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.61/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.61/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.61/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.61/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.61/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.61/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.33/1.00 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.33/1.00 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.33/1.00 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.33/1.00 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.33/1.00 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.33/1.00 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.33/1.00 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.81/1.09 Prover 1: Preprocessing ... % 1.81/1.09 Prover 4: Preprocessing ... % 2.26/1.16 Prover 6: Preprocessing ... % 2.26/1.16 Prover 0: Preprocessing ... % 2.26/1.16 Prover 2: Preprocessing ... % 2.26/1.17 Prover 5: Preprocessing ... % 2.26/1.17 Prover 3: Preprocessing ... % 5.04/1.55 Prover 6: Constructing countermodel ... % 5.77/1.59 Prover 6: proved (943ms) % 5.77/1.59 % 5.77/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.77/1.60 % 5.77/1.60 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.77/1.60 Prover 0: Constructing countermodel ... % 5.77/1.60 Prover 0: stopped % 5.77/1.60 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.77/1.61 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 5.87/1.61 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 5.94/1.62 Prover 8: Preprocessing ... % 5.94/1.66 Prover 7: Preprocessing ... % 5.94/1.68 Prover 2: stopped % 5.94/1.70 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.94/1.70 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation % 6.56/1.75 Prover 10: Preprocessing ... % 6.56/1.78 Prover 5: Constructing countermodel ... % 6.56/1.78 Prover 5: stopped % 7.16/1.79 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.16/1.81 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation % 7.16/1.84 Prover 3: Constructing countermodel ... % 7.16/1.84 Prover 3: stopped % 7.16/1.85 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.16/1.85 Prover 1: Constructing countermodel ... % 7.16/1.85 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation % 7.16/1.86 Prover 1: Found proof (size 1) % 7.16/1.86 Prover 1: proved (1220ms) % 7.16/1.86 Prover 13: Preprocessing ... % 7.16/1.86 Prover 11: Preprocessing ... % 7.89/1.89 Prover 7: stopped % 7.89/1.93 Prover 13: stopped % 7.89/1.95 Prover 8: Warning: ignoring some quantifiers % 7.89/1.96 Prover 8: Constructing countermodel ... % 7.89/1.96 Prover 8: stopped % 7.89/1.97 Prover 4: Constructing countermodel ... % 7.89/1.97 Prover 4: stopped % 8.79/2.02 Prover 10: stopped % 8.84/2.10 Prover 11: stopped % 8.84/2.10 % 8.84/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.84/2.10 % 8.84/2.10 % SZS output start Proof for theBenchmark % 9.19/2.11 Assumptions after simplification: % 9.19/2.11 --------------------------------- % 9.19/2.11 % 9.19/2.11 (rat_uminus_problem_5) % 9.19/2.11 $false % 9.19/2.11 % 9.19/2.11 Those formulas are unsatisfiable: % 9.19/2.11 --------------------------------- % 9.19/2.11 % 9.19/2.11 Begin of proof % 9.19/2.12 | % 9.19/2.12 | CLOSE: (rat_uminus_problem_5) is inconsistent. % 9.19/2.12 | % 9.19/2.12 End of proof % 9.19/2.12 % SZS output end Proof for theBenchmark % 9.19/2.12 % 9.19/2.12 1498ms %------------------------------------------------------------------------------