0.02/0.07 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.11 % Command : princess-casc +printProof -timeout=%d %s 0.10/0.31 % Computer : n119.star.cs.uiowa.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.10/0.31 % Memory : 32218.625MB 0.10/0.31 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.13/0.31 % CPULimit : 300 0.13/0.31 % DateTime : Sat Jul 14 05:24:40 CDT 2018 0.13/0.31 % CPUTime : 0.14/0.52 ________ _____ 0.14/0.52 ___ __ \_________(_)________________________________ 0.14/0.52 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ 0.14/0.52 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) 0.14/0.52 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ 0.14/0.52 0.14/0.52 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic 0.14/0.52 (CASC 2017-07-17) 0.14/0.52 0.14/0.52 (c) Philipp Rümmer, 2009-2017 0.14/0.52 (contributions by Peter Backeman, Peter Baumgartner, 0.14/0.52 Angelo Brillout, Aleksandar Zeljic) 0.14/0.52 Free software under GNU Lesser General Public License (LGPL). 0.14/0.52 Bug reports to ph_r@gmx.net 0.14/0.52 0.14/0.52 For more information, visit http://www.philipp.ruemmer.org/princess.shtml 0.14/0.52 0.14/0.52 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... 0.14/0.55 Prover 0: Options: +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 300.26/104.88 EOF