0.02/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.04	% Command    : princess-casc +printProof -timeout=%d %s
0.03/0.25	% Computer   : n059.star.cs.uiowa.edu
0.03/0.25	% Model      : x86_64 x86_64
0.03/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.25	% Memory     : 32218.625MB
0.03/0.25	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.25	% CPULimit   : 300
0.03/0.25	% DateTime   : Sat Jul 14 04:33:40 CDT 2018
0.03/0.25	% CPUTime    : 
0.07/0.46	________       _____
0.07/0.46	___  __ \_________(_)________________________________
0.07/0.46	__  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
0.07/0.46	_  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
0.07/0.46	/_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
0.07/0.46	
0.07/0.46	A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
0.07/0.46	(CASC 2017-07-17)
0.07/0.46	
0.07/0.46	(c) Philipp Rümmer, 2009-2017
0.07/0.46	(contributions by Peter Backeman, Peter Baumgartner,
0.07/0.46	                  Angelo Brillout, Aleksandar Zeljic)
0.07/0.46	Free software under GNU Lesser General Public License (LGPL).
0.07/0.46	Bug reports to ph_r@gmx.net
0.07/0.46	
0.07/0.46	For more information, visit http://www.philipp.ruemmer.org/princess.shtml
0.07/0.46	
0.07/0.47	Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
0.07/0.49	Prover 0: Options:  +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
1.00/0.78	Prover 0: Preprocessing ...
1.00/0.83	Prover 0: Constructing countermodel ...
1.00/0.85	Prover 0: proved (352ms)
1.00/0.85	
1.00/0.85	VALID
1.00/0.85	% SZS status Theorem for theBenchmark
1.00/0.85	
1.00/0.85	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.87	Prover 1: Preprocessing ...
1.24/0.88	Prover 1: Constructing countermodel ...
1.24/0.89	Prover 1: Found proof (size 1)
1.24/0.89	Prover 1: proved (38ms)
1.24/0.89	
1.24/0.89	
1.24/0.89	% SZS output start Proof for theBenchmark
1.24/0.89	Assumptions after simplification:
1.24/0.89	---------------------------------
1.24/0.90	
1.24/0.90	  (associative_sum_forall)
1.24/0.90	  $false
1.24/0.90	
1.24/0.90	Those formulas are unsatisfiable:
1.24/0.90	---------------------------------
1.24/0.90	
1.24/0.90	Begin of proof
1.24/0.90	| 
1.24/0.90	| CLOSE: (associative_sum_forall) is inconsistent.
1.24/0.90	| 
1.24/0.90	End of proof
1.24/0.90	% SZS output end Proof for theBenchmark
1.24/0.90	
1.24/0.90	424ms
1.29/0.93	EOF