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.03/0.23	% Computer   : n151.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 04:20:11 CDT 2018
0.03/0.23	% CPUTime    : 
0.07/0.45	________       _____
0.07/0.45	___  __ \_________(_)________________________________
0.07/0.45	__  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
0.07/0.45	_  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
0.07/0.45	/_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
0.07/0.45	
0.07/0.45	A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
0.07/0.45	(CASC 2017-07-17)
0.07/0.45	
0.07/0.45	(c) Philipp Rümmer, 2009-2017
0.07/0.45	(contributions by Peter Backeman, Peter Baumgartner,
0.07/0.45	                  Angelo Brillout, Aleksandar Zeljic)
0.07/0.45	Free software under GNU Lesser General Public License (LGPL).
0.07/0.45	Bug reports to ph_r@gmx.net
0.07/0.45	
0.07/0.45	For more information, visit http://www.philipp.ruemmer.org/princess.shtml
0.07/0.45	
0.07/0.45	Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
0.07/0.48	Prover 0: Options:  +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
0.88/0.77	Prover 0: Preprocessing ...
1.01/0.80	Prover 0: Constructing countermodel ...
1.01/0.82	Prover 0: proved (346ms)
1.01/0.83	
1.01/0.83	VALID
1.01/0.83	% SZS status Theorem for theBenchmark
1.01/0.83	
1.01/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.01/0.84	Prover 1: Preprocessing ...
1.01/0.85	Prover 1: Constructing countermodel ...
1.01/0.85	Prover 1: Found proof (size 1)
1.01/0.85	Prover 1: proved (26ms)
1.01/0.85	
1.01/0.85	
1.01/0.86	% SZS output start Proof for theBenchmark
1.01/0.86	Assumptions after simplification:
1.01/0.86	---------------------------------
1.01/0.86	
1.01/0.86	  (int_combined_problem_14)
1.01/0.86	  $false
1.01/0.86	
1.01/0.86	Those formulas are unsatisfiable:
1.01/0.86	---------------------------------
1.01/0.86	
1.01/0.86	Begin of proof
1.01/0.86	| 
1.01/0.87	| CLOSE: (int_combined_problem_14) is inconsistent.
1.01/0.87	| 
1.01/0.87	End of proof
1.01/0.87	% SZS output end Proof for theBenchmark
1.01/0.87	
1.01/0.87	408ms
1.21/0.90	EOF