0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.04 % Command : princess-casc +printProof -timeout=%d %s 0.03/0.25 % Computer : n184.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 05:11:55 CDT 2018 0.03/0.25 % CPUTime : 0.06/0.47 ________ _____ 0.06/0.47 ___ __ \_________(_)________________________________ 0.06/0.47 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ 0.06/0.47 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) 0.06/0.47 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ 0.06/0.47 0.06/0.47 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic 0.06/0.47 (CASC 2017-07-17) 0.06/0.47 0.06/0.47 (c) Philipp Rümmer, 2009-2017 0.06/0.47 (contributions by Peter Backeman, Peter Baumgartner, 0.06/0.47 Angelo Brillout, Aleksandar Zeljic) 0.06/0.47 Free software under GNU Lesser General Public License (LGPL). 0.06/0.47 Bug reports to ph_r@gmx.net 0.06/0.47 0.06/0.47 For more information, visit http://www.philipp.ruemmer.org/princess.shtml 0.06/0.47 0.06/0.47 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... 0.06/0.50 Prover 0: Options: +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 0.97/0.81 Prover 0: Preprocessing ... 1.13/0.90 Prover 0: Proving ... 1.29/1.00 Prover 0: proved (501ms) 1.29/1.00 1.29/1.00 VALID 1.29/1.00 % SZS status Theorem for theBenchmark 1.29/1.00 1.29/1.00 Prover 1: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.29/1.02 Prover 1: Preprocessing ... 1.47/1.04 Prover 1: Warning: ignoring some quantifiers 1.47/1.04 Prover 1: Constructing countermodel ... 1.47/1.07 Prover 1: gave up 1.47/1.08 Prover 4: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.66/1.09 Prover 4: Preprocessing ... 1.66/1.10 Prover 4: Warning: ignoring some quantifiers 1.66/1.11 Prover 4: Constructing countermodel ... 1.66/1.11 Prover 4: gave up 1.66/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.66/1.13 Prover 7: Preprocessing ... 1.66/1.14 Prover 7: Warning: ignoring some quantifiers 1.66/1.14 Prover 7: Constructing countermodel ... 1.66/1.15 Prover 7: gave up 1.66/1.15 Prover 8: Options: +triggersInConjecture -genTotalityAxioms=ctors -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.82/1.16 Prover 8: Preprocessing ... 1.82/1.18 Prover 8: Warning: ignoring some quantifiers 1.82/1.18 Prover 8: Constructing countermodel ... 1.87/1.18 Prover 8: gave up 1.87/1.19 Prover 10: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.87/1.19 Prover 10: Preprocessing ... 1.87/1.20 Prover 10: Warning: ignoring some quantifiers 1.87/1.20 Prover 10: Constructing countermodel ... 1.87/1.20 Prover 10: gave up 1.87/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.87/1.21 Prover 11: Preprocessing ... 1.97/1.22 Prover 11: Warning: ignoring some quantifiers 1.97/1.23 Prover 11: Constructing countermodel ... 2.02/1.23 Prover 11: gave up 2.02/1.23 Prover 13: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=off 2.02/1.24 Prover 13: Preprocessing ... 2.02/1.25 Prover 13: Warning: ignoring some quantifiers 2.02/1.25 Prover 13: Constructing countermodel ... 2.02/1.25 Prover 13: gave up 2.02/1.25 Prover 16: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=off 2.02/1.26 Prover 16: Preprocessing ... 2.02/1.27 Prover 16: Warning: ignoring some quantifiers 2.02/1.27 Prover 16: Constructing countermodel ... 2.02/1.27 Prover 16: gave up 2.02/1.28 Prover 19: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=off 2.02/1.28 Prover 19: Preprocessing ... 2.02/1.30 Prover 19: Warning: ignoring some quantifiers 2.02/1.30 Prover 19: Constructing countermodel ... 2.02/1.31 Prover 19: gave up 2.02/1.31 2.02/1.31 2.02/1.31 831ms 2.20/1.34 EOF