%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI460_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 : n023.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:48:07 EDT 2023 % Result : Theorem 5.02s 1.38s % Output : Proof 7.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ARI460_1 : TPTP v8.1.2. Released v5.0.0. % 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n023.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 18:12:55 EDT 2023 % 0.13/0.34 % CPUTime : % 0.53/0.60 ________ _____ % 0.53/0.60 ___ __ \_________(_)________________________________ % 0.53/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.53/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.53/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.53/0.60 % 0.53/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.53/0.60 (2023-06-19) % 0.53/0.60 % 0.53/0.60 (c) Philipp Rümmer, 2009-2023 % 0.53/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.53/0.60 Amanda Stjerna. % 0.53/0.60 Free software under BSD-3-Clause. % 0.53/0.60 % 0.53/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.53/0.60 % 0.53/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.53/0.61 Running up to 7 provers in parallel. % 0.53/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.53/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.53/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.53/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.53/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.53/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.53/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.59/0.89 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.59/0.89 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.59/0.89 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 1.59/0.89 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.59/0.89 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.59/0.89 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.59/0.89 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 2.09/0.96 Prover 1: Preprocessing ... % 2.32/0.97 Prover 4: Preprocessing ... % 2.32/1.01 Prover 0: Preprocessing ... % 2.32/1.01 Prover 6: Preprocessing ... % 2.32/1.02 Prover 2: Preprocessing ... % 2.32/1.03 Prover 3: Preprocessing ... % 2.32/1.03 Prover 5: Preprocessing ... % 4.72/1.32 Prover 6: Constructing countermodel ... % 4.72/1.35 Prover 0: Constructing countermodel ... % 5.02/1.38 Prover 6: proved (757ms) % 5.02/1.38 Prover 0: proved (761ms) % 5.02/1.38 % 5.02/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.02/1.38 % 5.02/1.38 % 5.02/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.02/1.38 % 5.02/1.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.02/1.39 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 5.02/1.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.02/1.40 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 5.02/1.41 Prover 2: Constructing countermodel ... % 5.02/1.41 Prover 2: stopped % 5.02/1.41 Prover 8: Preprocessing ... % 5.02/1.41 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.02/1.41 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation % 5.02/1.43 Prover 7: Preprocessing ... % 5.63/1.45 Prover 5: Constructing countermodel ... % 5.63/1.45 Prover 5: stopped % 5.63/1.46 Prover 3: Constructing countermodel ... % 5.63/1.46 Prover 3: stopped % 5.63/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.63/1.47 Prover 10: Preprocessing ... % 5.63/1.47 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation % 5.91/1.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.91/1.50 Prover 13: Warning: Problem contains reals, using incomplete axiomatisation % 5.91/1.50 Prover 13: Preprocessing ... % 5.91/1.52 Prover 11: Preprocessing ... % 5.91/1.53 Prover 1: Constructing countermodel ... % 6.37/1.55 Prover 1: Found proof (size 1) % 6.37/1.55 Prover 1: proved (929ms) % 6.37/1.55 Prover 13: stopped % 6.53/1.60 Prover 7: stopped % 6.53/1.60 Prover 4: Constructing countermodel ... % 6.53/1.60 Prover 4: stopped % 6.53/1.62 Prover 10: stopped % 7.04/1.63 Prover 8: Warning: ignoring some quantifiers % 7.04/1.63 Prover 8: Constructing countermodel ... % 7.04/1.64 Prover 8: stopped % 7.25/1.68 Prover 11: stopped % 7.25/1.68 % 7.25/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.25/1.68 % 7.25/1.68 % SZS output start Proof for theBenchmark % 7.25/1.68 Assumptions after simplification: % 7.25/1.68 --------------------------------- % 7.25/1.68 % 7.25/1.68 (real_uminus_problem_2) % 7.25/1.69 $false % 7.25/1.69 % 7.25/1.69 Those formulas are unsatisfiable: % 7.25/1.69 --------------------------------- % 7.25/1.69 % 7.25/1.69 Begin of proof % 7.25/1.69 | % 7.25/1.69 | CLOSE: (real_uminus_problem_2) is inconsistent. % 7.25/1.69 | % 7.25/1.69 End of proof % 7.25/1.69 % SZS output end Proof for theBenchmark % 7.25/1.69 % 7.25/1.69 1086ms %------------------------------------------------------------------------------