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.24 % Computer : n008.star.cs.uiowa.edu 0.03/0.24 % Model : x86_64 x86_64 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.24 % Memory : 32218.625MB 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Sat Jul 14 04:38:40 CDT 2018 0.03/0.24 % 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.83/0.71 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation 0.83/0.75 Prover 0: Preprocessing ... 0.98/0.78 Prover 0: Constructing countermodel ... 0.98/0.81 Prover 0: proved (324ms) 0.98/0.81 0.98/0.81 VALID 0.98/0.81 % SZS status Theorem for theBenchmark 0.98/0.81 0.98/0.81 Prover 1: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 0.98/0.81 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation 1.07/0.82 Prover 1: Preprocessing ... 1.11/0.83 Prover 1: Constructing countermodel ... 1.11/0.84 Prover 1: Found proof (size 1) 1.11/0.84 Prover 1: proved (29ms) 1.11/0.84 1.11/0.84 1.11/0.84 % SZS output start Proof for theBenchmark 1.11/0.85 Assumptions after simplification: 1.11/0.85 --------------------------------- 1.11/0.85 1.11/0.85 (real_not_equal_problem_2) 1.11/0.85 $false 1.11/0.85 1.11/0.85 Those formulas are unsatisfiable: 1.11/0.85 --------------------------------- 1.11/0.85 1.11/0.85 Begin of proof 1.11/0.85 | 1.11/0.85 | CLOSE: (real_not_equal_problem_2) is inconsistent. 1.11/0.85 | 1.11/0.85 End of proof 1.11/0.85 % SZS output end Proof for theBenchmark 1.11/0.85 1.11/0.85 388ms 1.11/0.88 EOF