%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI409_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 : n016.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:56 EDT 2023 % Result : Theorem 6.60s 1.64s % Output : Proof 11.68s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : ARI409_1 : TPTP v8.1.2. Released v5.0.0. % 0.11/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n016.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Tue Aug 29 18:23:01 EDT 2023 % 0.12/0.33 % CPUTime : % 0.61/0.60 ________ _____ % 0.61/0.60 ___ __ \_________(_)________________________________ % 0.61/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.61/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.61/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.61/0.60 % 0.61/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.61/0.60 (2023-06-19) % 0.61/0.60 % 0.61/0.60 (c) Philipp Rümmer, 2009-2023 % 0.61/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.61/0.60 Amanda Stjerna. % 0.61/0.60 Free software under BSD-3-Clause. % 0.61/0.60 % 0.61/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.61/0.60 % 0.61/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.67/0.62 Running up to 7 provers in parallel. % 0.67/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.58/0.90 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.90 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.90 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.90 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.90 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.90 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.90 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.85/1.01 Prover 4: Preprocessing ... % 2.47/1.01 Prover 1: Preprocessing ... % 3.00/1.11 Prover 0: Preprocessing ... % 3.00/1.11 Prover 6: Preprocessing ... % 4.02/1.23 Prover 5: Preprocessing ... % 4.02/1.23 Prover 2: Preprocessing ... % 4.02/1.23 Prover 3: Preprocessing ... % 6.60/1.61 Prover 6: Constructing countermodel ... % 6.60/1.63 Prover 6: proved (994ms) % 6.60/1.64 % 6.60/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.60/1.64 % 6.60/1.64 Prover 0: Constructing countermodel ... % 6.60/1.65 Prover 0: stopped % 6.60/1.65 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.60/1.65 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 6.60/1.66 Prover 1: Constructing countermodel ... % 6.60/1.67 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.60/1.68 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 7.16/1.69 Prover 4: Constructing countermodel ... % 7.16/1.69 Prover 8: Preprocessing ... % 7.16/1.71 Prover 4: Found proof (size 1) % 7.16/1.71 Prover 1: Found proof (size 1) % 7.16/1.71 Prover 4: proved (1070ms) % 7.16/1.71 Prover 1: proved (1074ms) % 7.16/1.75 Prover 7: Preprocessing ... % 8.82/1.91 Prover 2: stopped % 8.82/1.92 Prover 8: Warning: ignoring some quantifiers % 8.82/1.92 Prover 8: Constructing countermodel ... % 8.82/1.92 Prover 8: stopped % 9.33/2.07 Prover 7: stopped % 11.17/2.37 Prover 5: Constructing countermodel ... % 11.17/2.37 Prover 5: stopped % 11.17/2.39 Prover 3: Constructing countermodel ... % 11.17/2.39 Prover 3: stopped % 11.17/2.39 % 11.17/2.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.17/2.39 % 11.65/2.39 % SZS output start Proof for theBenchmark % 11.65/2.40 Assumptions after simplification: % 11.65/2.40 --------------------------------- % 11.65/2.40 % 11.65/2.40 (real_sum_problem_9) % 11.68/2.40 $false % 11.68/2.40 % 11.68/2.40 Those formulas are unsatisfiable: % 11.68/2.40 --------------------------------- % 11.68/2.40 % 11.68/2.40 Begin of proof % 11.68/2.40 | % 11.68/2.40 | CLOSE: (real_sum_problem_9) is inconsistent. % 11.68/2.40 | % 11.68/2.40 End of proof % 11.68/2.40 % SZS output end Proof for theBenchmark % 11.68/2.40 % 11.68/2.40 1797ms %------------------------------------------------------------------------------