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.26	% Computer   : n153.star.cs.uiowa.edu
0.03/0.26	% Model      : x86_64 x86_64
0.03/0.26	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.26	% Memory     : 32218.625MB
0.03/0.26	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.26	% CPULimit   : 300
0.03/0.26	% DateTime   : Sat Jul 14 04:22:10 CDT 2018
0.03/0.26	% CPUTime    : 
0.07/0.48	________       _____
0.07/0.48	___  __ \_________(_)________________________________
0.07/0.48	__  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
0.07/0.48	_  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
0.07/0.48	/_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
0.07/0.48	
0.07/0.48	A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
0.07/0.48	(CASC 2017-07-17)
0.07/0.48	
0.07/0.48	(c) Philipp Rümmer, 2009-2017
0.07/0.48	(contributions by Peter Backeman, Peter Baumgartner,
0.07/0.48	                  Angelo Brillout, Aleksandar Zeljic)
0.07/0.48	Free software under GNU Lesser General Public License (LGPL).
0.07/0.48	Bug reports to ph_r@gmx.net
0.07/0.48	
0.07/0.48	For more information, visit http://www.philipp.ruemmer.org/princess.shtml
0.07/0.48	
0.07/0.48	Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
0.07/0.51	Prover 0: Options:  +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
0.83/0.76	Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
0.97/0.81	Prover 0: Preprocessing ...
0.97/0.86	Prover 0: Constructing countermodel ...
1.12/0.88	Prover 0: proved (374ms)
1.12/0.88	
1.12/0.88	VALID
1.12/0.88	% SZS status Theorem for theBenchmark
1.12/0.88	
1.14/0.89	Prover 1: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
1.14/0.89	Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
1.14/0.90	Prover 1: Preprocessing ...
1.23/0.91	Prover 1: Constructing countermodel ...
1.23/0.92	Prover 1: Found proof (size 1)
1.23/0.92	Prover 1: proved (35ms)
1.23/0.92	
1.23/0.92	
1.23/0.93	% SZS output start Proof for theBenchmark
1.23/0.93	Assumptions after simplification:
1.23/0.93	---------------------------------
1.23/0.93	
1.23/0.93	  (real_product_problem_20)
1.23/0.93	  $false
1.23/0.93	
1.23/0.93	Those formulas are unsatisfiable:
1.23/0.93	---------------------------------
1.23/0.93	
1.23/0.93	Begin of proof
1.23/0.93	| 
1.23/0.93	| CLOSE: (real_product_problem_20) is inconsistent.
1.23/0.93	| 
1.23/0.93	End of proof
1.23/0.93	% SZS output end Proof for theBenchmark
1.23/0.93	
1.23/0.93	446ms
1.23/1.00	EOF