%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI568_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:48:25 EDT 2023 % Result : Theorem 5.34s 1.42s % Output : Proof 10.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : ARI568_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.13/0.33 % Computer : n016.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 18:22:01 EDT 2023 % 0.13/0.33 % CPUTime : % 0.59/0.59 ________ _____ % 0.59/0.59 ___ __ \_________(_)________________________________ % 0.59/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.59/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.59/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.59/0.59 % 0.59/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.59/0.59 (2023-06-19) % 0.59/0.59 % 0.59/0.59 (c) Philipp Rümmer, 2009-2023 % 0.59/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.59/0.59 Amanda Stjerna. % 0.59/0.59 Free software under BSD-3-Clause. % 0.59/0.59 % 0.59/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.59/0.59 % 0.59/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.63/0.60 Running up to 7 provers in parallel. % 0.63/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.63/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.63/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.63/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.63/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.63/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.63/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.67/0.89 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.67/0.89 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.67/0.89 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 1.67/0.89 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.67/0.89 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.67/0.89 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.67/0.89 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 2.14/0.96 Prover 1: Preprocessing ... % 2.14/0.97 Prover 4: Preprocessing ... % 2.64/1.02 Prover 0: Preprocessing ... % 2.64/1.02 Prover 6: Preprocessing ... % 3.88/1.20 Prover 3: Preprocessing ... % 3.88/1.20 Prover 2: Preprocessing ... % 4.13/1.20 Prover 5: Preprocessing ... % 4.29/1.32 Prover 6: Constructing countermodel ... % 4.91/1.35 Prover 0: Constructing countermodel ... % 4.91/1.39 Prover 0: proved (776ms) % 5.34/1.40 % 5.34/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.34/1.42 % 5.34/1.42 Prover 6: proved (774ms) % 5.34/1.42 % 5.34/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.34/1.42 % 5.34/1.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.34/1.43 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.34/1.44 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 5.34/1.44 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 5.34/1.45 Prover 8: Preprocessing ... % 6.19/1.57 Prover 7: Preprocessing ... % 7.44/1.73 Prover 1: Constructing countermodel ... % 7.44/1.75 Prover 1: Found proof (size 1) % 7.44/1.75 Prover 1: proved (1140ms) % 8.04/1.80 Prover 4: Constructing countermodel ... % 8.04/1.80 Prover 4: stopped % 8.34/1.84 Prover 8: Warning: ignoring some quantifiers % 8.34/1.85 Prover 8: Constructing countermodel ... % 8.34/1.85 Prover 8: stopped % 9.07/1.95 Prover 2: stopped % 9.07/1.99 Prover 7: stopped % 9.60/2.01 Prover 5: Constructing countermodel ... % 9.60/2.02 Prover 5: stopped % 9.60/2.07 Prover 3: Constructing countermodel ... % 9.60/2.07 Prover 3: stopped % 9.60/2.07 % 9.60/2.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.60/2.07 % 9.60/2.07 % SZS output start Proof for theBenchmark % 10.00/2.07 Assumptions after simplification: % 10.00/2.07 --------------------------------- % 10.00/2.07 % 10.00/2.07 (real_combined_problem_19) % 10.00/2.08 $false % 10.00/2.08 % 10.00/2.08 Those formulas are unsatisfiable: % 10.00/2.08 --------------------------------- % 10.00/2.08 % 10.00/2.08 Begin of proof % 10.00/2.08 | % 10.00/2.08 | CLOSE: (real_combined_problem_19) is inconsistent. % 10.00/2.08 | % 10.00/2.08 End of proof % 10.00/2.08 % SZS output end Proof for theBenchmark % 10.03/2.08 % 10.03/2.08 1488ms %------------------------------------------------------------------------------