%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWX144_1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n009.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 : Tue May 5 07:05:40 PM UTC 2026 % Result : Timeout 300.16s 43.34s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.14 % Problem : SWX144_1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.36 % Computer : n009.cluster.edu % 0.16/0.36 % Model : x86_64 x86_64 % 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.36 % Memory : 8042.1875MB % 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.36 % CPULimit : 300 % 0.16/0.36 % WCLimit : 300 % 0.16/0.36 % DateTime : Tue May 5 08:48:26 EDT 2026 % 0.16/0.37 % CPUTime : % 0.59/0.67 ________ _____ % 0.59/0.67 ___ __ \_________(_)________________________________ % 0.59/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.59/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.59/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.59/0.67 % 0.59/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.59/0.67 (2023-06-19) % 0.59/0.67 % 0.59/0.67 (c) Philipp Rümmer, 2009-2023 % 0.59/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.59/0.67 Amanda Stjerna. % 0.59/0.67 Free software under BSD-3-Clause. % 0.59/0.67 % 0.59/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.59/0.67 % 0.59/0.67 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.59/0.68 Running up to 7 provers in parallel. % 0.59/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.59/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.59/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.59/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.59/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.59/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.59/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.05/1.04 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 2.05/1.04 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 2.05/1.04 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 2.05/1.06 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 2.05/1.07 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 2.05/1.07 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 2.05/1.07 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation %------------------------------------------------------------------------------