0.00/0.06	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.06	% Command    : princess-casc +printProof -timeout=%d %s
0.03/0.34	% Computer   : n131.star.cs.uiowa.edu
0.03/0.34	% Model      : x86_64 x86_64
0.03/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.34	% Memory     : 32218.625MB
0.03/0.34	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.34	% CPULimit   : 300
0.03/0.34	% DateTime   : Fri Jul 13 15:56:56 CDT 2018
0.03/0.35	% CPUTime    : 
0.07/0.56	________       _____
0.07/0.56	___  __ \_________(_)________________________________
0.07/0.56	__  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
0.07/0.56	_  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
0.07/0.56	/_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
0.07/0.56	
0.07/0.56	A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
0.07/0.56	(CASC 2017-07-17)
0.07/0.56	
0.07/0.56	(c) Philipp Rümmer, 2009-2017
0.07/0.56	(contributions by Peter Backeman, Peter Baumgartner,
0.07/0.56	                  Angelo Brillout, Aleksandar Zeljic)
0.07/0.56	Free software under GNU Lesser General Public License (LGPL).
0.07/0.56	Bug reports to ph_r@gmx.net
0.07/0.56	
0.07/0.56	For more information, visit http://www.philipp.ruemmer.org/princess.shtml
0.07/0.56	
0.07/0.56	Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
0.07/0.60	Prover 0: Options:  +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
0.93/0.91	Prover 0: Preprocessing ...
1.10/0.96	Prover 0: Constructing countermodel ...
1.10/0.99	Prover 0: proved (390ms)
1.10/0.99	
1.10/0.99	VALID
1.10/0.99	% SZS status Theorem for theBenchmark
1.10/0.99	
1.10/0.99	Prover 1: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
1.19/1.01	Prover 1: Preprocessing ...
1.19/1.02	Prover 1: Constructing countermodel ...
1.19/1.03	Prover 1: Found proof (size 1)
1.19/1.03	Prover 1: proved (37ms)
1.19/1.03	
1.19/1.03	
1.31/1.03	% SZS output start Proof for theBenchmark
1.31/1.03	Assumptions after simplification:
1.31/1.03	---------------------------------
1.31/1.03	
1.31/1.03	  (exists_Y_between_Xplus2_and_3X)
1.31/1.04	  $false
1.31/1.04	
1.31/1.04	Those formulas are unsatisfiable:
1.31/1.04	---------------------------------
1.31/1.04	
1.31/1.04	Begin of proof
1.31/1.04	| 
1.31/1.04	| CLOSE: (exists_Y_between_Xplus2_and_3X) is inconsistent.
1.31/1.04	| 
1.31/1.04	End of proof
1.31/1.04	% SZS output end Proof for theBenchmark
1.31/1.04	
1.31/1.04	464ms
1.35/1.77	EOF