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