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