%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI278_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 : n008.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:32 EDT 2023 % Result : Theorem 8.81s 2.10s % Output : Proof 15.03s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ARI278_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.33 % Computer : n008.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Tue Aug 29 18:27:47 EDT 2023 % 0.15/0.34 % CPUTime : % 0.19/0.70 ________ _____ % 0.19/0.70 ___ __ \_________(_)________________________________ % 0.19/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.70 % 0.19/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.70 (2023-06-19) % 0.19/0.70 % 0.19/0.70 (c) Philipp Rümmer, 2009-2023 % 0.19/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.70 Amanda Stjerna. % 0.19/0.70 Free software under BSD-3-Clause. % 0.19/0.70 % 0.19/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.70 % 0.19/0.70 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.72 Running up to 7 provers in parallel. % 0.19/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.62/1.06 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.06 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.06 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.06 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.06 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.06 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.62/1.06 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 2.48/1.22 Prover 4: Preprocessing ... % 2.48/1.23 Prover 1: Preprocessing ... % 3.11/1.28 Prover 0: Preprocessing ... % 3.11/1.28 Prover 6: Preprocessing ... % 3.61/1.57 Prover 5: Preprocessing ... % 3.61/1.57 Prover 2: Preprocessing ... % 3.61/1.59 Prover 3: Preprocessing ... % 8.24/2.04 Prover 6: Constructing countermodel ... % 8.24/2.05 Prover 0: Constructing countermodel ... % 8.81/2.09 Prover 1: Constructing countermodel ... % 8.81/2.10 Prover 6: proved (1342ms) % 8.81/2.10 Prover 0: proved (1359ms) % 8.81/2.10 % 8.81/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.81/2.10 % 9.06/2.11 % 9.06/2.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.06/2.11 % 9.06/2.13 Prover 1: Found proof (size 1) % 9.06/2.13 Prover 1: proved (1366ms) % 9.06/2.13 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.06/2.13 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 9.06/2.13 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.06/2.13 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 9.06/2.14 Prover 4: Constructing countermodel ... % 9.06/2.14 Prover 4: stopped % 9.06/2.16 Prover 8: Preprocessing ... % 9.06/2.24 Prover 7: Preprocessing ... % 9.06/2.29 Prover 2: stopped % 9.06/2.39 Prover 8: Warning: ignoring some quantifiers % 9.06/2.40 Prover 8: Constructing countermodel ... % 9.06/2.40 Prover 8: stopped % 12.59/2.61 Prover 7: stopped % 15.03/3.13 Prover 5: Constructing countermodel ... % 15.03/3.13 Prover 5: stopped % 15.03/3.18 Prover 3: Constructing countermodel ... % 15.03/3.18 Prover 3: stopped % 15.03/3.18 % 15.03/3.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.03/3.18 % 15.03/3.19 % SZS output start Proof for theBenchmark % 15.03/3.19 Assumptions after simplification: % 15.03/3.19 --------------------------------- % 15.03/3.19 % 15.03/3.19 (rat_difference_problem_6) % 15.03/3.19 $false % 15.03/3.19 % 15.03/3.19 Those formulas are unsatisfiable: % 15.03/3.19 --------------------------------- % 15.03/3.19 % 15.03/3.19 Begin of proof % 15.03/3.19 | % 15.03/3.20 | CLOSE: (rat_difference_problem_6) is inconsistent. % 15.03/3.20 | % 15.03/3.20 End of proof % 15.03/3.20 % SZS output end Proof for theBenchmark % 15.03/3.20 % 15.03/3.20 2498ms %------------------------------------------------------------------------------