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