0.00/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.06 % Command : princess-casc +printProof -timeout=%d %s 0.03/0.35 % Computer : n018.star.cs.uiowa.edu 0.03/0.35 % Model : x86_64 x86_64 0.03/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.35 % Memory : 32218.625MB 0.03/0.35 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.35 % CPULimit : 300 0.03/0.35 % DateTime : Sat Jul 14 04:16:43 CDT 2018 0.03/0.35 % CPUTime : 0.06/0.55 ________ _____ 0.06/0.55 ___ __ \_________(_)________________________________ 0.06/0.55 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ 0.06/0.55 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) 0.06/0.55 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ 0.06/0.55 0.06/0.55 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic 0.06/0.56 (CASC 2017-07-17) 0.06/0.56 0.06/0.56 (c) Philipp Rümmer, 2009-2017 0.06/0.56 (contributions by Peter Backeman, Peter Baumgartner, 0.06/0.56 Angelo Brillout, Aleksandar Zeljic) 0.06/0.56 Free software under GNU Lesser General Public License (LGPL). 0.06/0.56 Bug reports to ph_r@gmx.net 0.06/0.56 0.06/0.56 For more information, visit http://www.philipp.ruemmer.org/princess.shtml 0.06/0.56 0.06/0.56 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... 0.48/0.60 Prover 0: Options: +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 0.81/0.87 Prover 0: Preprocessing ... 1.00/0.91 Prover 0: Constructing countermodel ... 1.05/0.93 Prover 0: proved (344ms) 1.05/0.93 1.05/0.93 VALID 1.05/0.93 % SZS status Theorem for theBenchmark 1.05/0.93 1.05/0.93 Prover 1: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.05/0.95 Prover 1: Preprocessing ... 1.05/0.96 Prover 1: Constructing countermodel ... 1.05/0.96 Prover 1: Found proof (size 1) 1.05/0.96 Prover 1: proved (29ms) 1.05/0.96 1.05/0.96 1.05/0.97 % SZS output start Proof for theBenchmark 1.05/0.97 Assumptions after simplification: 1.05/0.97 --------------------------------- 1.05/0.97 1.05/0.97 (mix_quant_ineq_sys_solvable_1) 1.05/0.97 $false 1.05/0.97 1.05/0.97 Those formulas are unsatisfiable: 1.05/0.97 --------------------------------- 1.05/0.97 1.05/0.97 Begin of proof 1.05/0.97 | 1.05/0.97 | CLOSE: (mix_quant_ineq_sys_solvable_1) is inconsistent. 1.05/0.97 | 1.05/0.97 End of proof 1.05/0.97 % SZS output end Proof for theBenchmark 1.05/0.97 1.05/0.97 410ms 1.24/1.14 EOF