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.02/0.25	% Computer   : n140.star.cs.uiowa.edu
0.02/0.25	% Model      : x86_64 x86_64
0.02/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.25	% Memory     : 32218.625MB
0.02/0.25	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.25	% CPULimit   : 300
0.02/0.25	% DateTime   : Fri Jul 13 14:53:56 CDT 2018
0.06/0.26	% CPUTime    : 
0.06/0.46	________       _____
0.06/0.46	___  __ \_________(_)________________________________
0.06/0.46	__  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
0.06/0.46	_  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
0.06/0.46	/_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
0.06/0.46	
0.06/0.46	A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
0.06/0.46	(CASC 2017-07-17)
0.06/0.46	
0.06/0.46	(c) Philipp Rümmer, 2009-2017
0.06/0.46	(contributions by Peter Backeman, Peter Baumgartner,
0.06/0.46	                  Angelo Brillout, Aleksandar Zeljic)
0.06/0.46	Free software under GNU Lesser General Public License (LGPL).
0.06/0.46	Bug reports to ph_r@gmx.net
0.06/0.46	
0.06/0.46	For more information, visit http://www.philipp.ruemmer.org/princess.shtml
0.06/0.46	
0.06/0.46	Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
0.06/0.49	Prover 0: Options:  +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
0.89/0.78	Prover 0: Preprocessing ...
0.99/0.83	Prover 0: Proving ...
1.31/0.92	Prover 0: proved (425ms)
1.31/0.92	
1.31/0.92	VALID
1.31/0.92	% SZS status Theorem for theBenchmark
1.31/0.92	
1.31/0.92	Prover 1: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
1.31/0.94	Prover 1: Preprocessing ...
1.43/0.97	Prover 1: Warning: ignoring some quantifiers
1.43/0.97	Prover 1: Constructing countermodel ...
1.43/0.98	Prover 1: Found proof (size 1)
1.43/0.98	Prover 1: proved (57ms)
1.43/0.98	
1.43/0.98	
1.43/0.98	% SZS output start Proof for theBenchmark
1.43/0.98	Assumptions after simplification:
1.43/0.98	---------------------------------
1.43/0.98	
1.43/0.98	  (interv_4_can_cover_interv_3)
1.43/0.98	  $false
1.43/0.98	
1.43/0.98	Those formulas are unsatisfiable:
1.43/0.98	---------------------------------
1.43/0.98	
1.43/0.98	Begin of proof
1.43/0.99	| 
1.43/0.99	| CLOSE: (interv_4_can_cover_interv_3) is inconsistent.
1.43/0.99	| 
1.43/0.99	End of proof
1.43/0.99	% SZS output end Proof for theBenchmark
1.43/0.99	
1.43/0.99	515ms
1.53/1.29	EOF