%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI310_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 : n005.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.24s 1.56s % Output : Proof 9.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.11 % Problem : ARI310_1 : TPTP v8.1.2. Released v5.0.0. % 0.08/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.10/0.32 % Computer : n005.cluster.edu % 0.10/0.32 % Model : x86_64 x86_64 % 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.32 % Memory : 8042.1875MB % 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.32 % CPULimit : 300 % 0.10/0.32 % WCLimit : 300 % 0.10/0.32 % DateTime : Tue Aug 29 18:40:07 EDT 2023 % 0.10/0.32 % CPUTime : % 0.17/0.59 ________ _____ % 0.17/0.59 ___ __ \_________(_)________________________________ % 0.17/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.59 % 0.17/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.59 (2023-06-19) % 0.17/0.59 % 0.17/0.59 (c) Philipp Rümmer, 2009-2023 % 0.17/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.59 Amanda Stjerna. % 0.17/0.59 Free software under BSD-3-Clause. % 0.17/0.59 % 0.17/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.59 % 0.17/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.17/0.61 Running up to 7 provers in parallel. % 0.17/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.17/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.28/0.98 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.28/0.98 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.28/0.98 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.28/0.98 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.28/0.98 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.28/0.98 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.28/0.98 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.89/1.06 Prover 4: Preprocessing ... % 1.89/1.06 Prover 1: Preprocessing ... % 2.54/1.13 Prover 0: Preprocessing ... % 2.54/1.13 Prover 6: Preprocessing ... % 2.54/1.14 Prover 5: Preprocessing ... % 2.54/1.15 Prover 2: Preprocessing ... % 2.54/1.15 Prover 3: Preprocessing ... % 4.70/1.48 Prover 6: Constructing countermodel ... % 5.24/1.54 Prover 0: Constructing countermodel ... % 5.24/1.55 Prover 0: proved (933ms) % 5.24/1.55 % 5.24/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.24/1.56 % 5.24/1.56 Prover 6: stopped % 5.24/1.56 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.24/1.56 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.24/1.56 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 5.24/1.57 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 5.24/1.58 Prover 8: Preprocessing ... % 5.24/1.58 Prover 2: stopped % 5.24/1.58 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.24/1.59 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation % 5.99/1.64 Prover 10: Preprocessing ... % 5.99/1.64 Prover 7: Preprocessing ... % 6.73/1.73 Prover 5: Constructing countermodel ... % 6.73/1.75 Prover 5: stopped % 6.73/1.76 Prover 3: Constructing countermodel ... % 6.73/1.76 Prover 3: stopped % 6.73/1.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.73/1.77 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation % 6.73/1.78 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.73/1.79 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation % 7.47/1.81 Prover 11: Preprocessing ... % 7.47/1.81 Prover 13: Preprocessing ... % 7.47/1.88 Prover 8: Warning: ignoring some quantifiers % 7.47/1.89 Prover 8: Constructing countermodel ... % 8.22/1.90 Prover 8: Found proof (size 1) % 8.22/1.90 Prover 8: proved (338ms) % 8.22/1.90 Prover 1: Constructing countermodel ... % 8.22/1.90 Prover 1: stopped % 8.22/1.91 Prover 4: Constructing countermodel ... % 8.22/1.91 Prover 4: stopped % 8.22/1.91 Prover 10: stopped % 8.22/1.94 Prover 13: stopped % 8.88/2.07 Prover 11: stopped % 9.16/2.16 Prover 7: Warning: ignoring some quantifiers % 9.16/2.17 Prover 7: Constructing countermodel ... % 9.16/2.17 Prover 7: stopped % 9.16/2.17 % 9.16/2.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.16/2.17 % 9.16/2.18 % SZS output start Proof for theBenchmark % 9.16/2.18 Assumptions after simplification: % 9.16/2.18 --------------------------------- % 9.16/2.18 % 9.16/2.18 (rat_uminus_problem_3) % 9.16/2.18 $false % 9.16/2.18 % 9.16/2.18 Those formulas are unsatisfiable: % 9.16/2.18 --------------------------------- % 9.16/2.18 % 9.16/2.18 Begin of proof % 9.16/2.18 | % 9.16/2.19 | CLOSE: (rat_uminus_problem_3) is inconsistent. % 9.16/2.19 | % 9.16/2.19 End of proof % 9.16/2.19 % SZS output end Proof for theBenchmark % 9.16/2.19 % 9.16/2.19 1589ms %------------------------------------------------------------------------------