0.00/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : princess-casc +printProof -timeout=%d %s 0.02/0.37 % Computer : n162.star.cs.uiowa.edu 0.02/0.37 % Model : x86_64 x86_64 0.02/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.37 % Memory : 32218.625MB 0.02/0.37 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.37 % CPULimit : 300 0.02/0.37 % DateTime : Fri Jul 13 14:53:00 CDT 2018 0.07/0.37 % CPUTime : 0.29/0.58 ________ _____ 0.29/0.58 ___ __ \_________(_)________________________________ 0.29/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ 0.29/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) 0.29/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ 0.29/0.58 0.29/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic 0.29/0.58 (CASC 2017-07-17) 0.29/0.58 0.29/0.58 (c) Philipp Rümmer, 2009-2017 0.29/0.58 (contributions by Peter Backeman, Peter Baumgartner, 0.29/0.58 Angelo Brillout, Aleksandar Zeljic) 0.29/0.58 Free software under GNU Lesser General Public License (LGPL). 0.29/0.58 Bug reports to ph_r@gmx.net 0.29/0.58 0.29/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml 0.29/0.58 0.29/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... 0.46/0.62 Prover 0: Options: +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 0.87/0.91 Prover 0: Preprocessing ... 1.13/0.99 Prover 0: Proving ... 1.13/1.05 Prover 0: proved (438ms) 1.13/1.05 1.13/1.05 VALID 1.13/1.05 % SZS status Theorem for theBenchmark 1.13/1.05 1.13/1.06 Prover 1: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.32/1.07 Prover 1: Preprocessing ... 1.32/1.09 Prover 1: Warning: ignoring some quantifiers 1.32/1.09 Prover 1: Constructing countermodel ... 1.47/1.13 Prover 1: gave up 1.47/1.13 Prover 4: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.50/1.16 Prover 4: Preprocessing ... 1.50/1.16 Prover 4: Warning: ignoring some quantifiers 1.50/1.16 Prover 4: Constructing countermodel ... 1.50/1.17 Prover 4: gave up 1.50/1.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.50/1.19 Prover 7: Preprocessing ... 1.50/1.19 Prover 7: Warning: ignoring some quantifiers 1.50/1.19 Prover 7: Constructing countermodel ... 1.50/1.20 Prover 7: gave up 1.50/1.20 Prover 8: Options: +triggersInConjecture -genTotalityAxioms=ctors -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.73/1.21 Prover 8: Preprocessing ... 1.73/1.23 Prover 8: Warning: ignoring some quantifiers 1.73/1.23 Prover 8: Constructing countermodel ... 1.73/1.24 Prover 8: gave up 1.73/1.24 Prover 10: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.73/1.25 Prover 10: Preprocessing ... 1.73/1.25 Prover 10: Warning: ignoring some quantifiers 1.73/1.25 Prover 10: Constructing countermodel ... 1.73/1.25 Prover 10: gave up 1.73/1.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 1.73/1.26 Prover 11: Preprocessing ... 1.92/1.28 Prover 11: Warning: ignoring some quantifiers 1.92/1.28 Prover 11: Constructing countermodel ... 1.92/1.29 Prover 11: gave up 1.92/1.29 Prover 13: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=off 1.92/1.29 Prover 13: Preprocessing ... 1.92/1.30 Prover 13: Warning: ignoring some quantifiers 1.92/1.30 Prover 13: Constructing countermodel ... 1.92/1.31 Prover 13: gave up 1.92/1.31 Prover 16: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=off 1.92/1.32 Prover 16: Preprocessing ... 1.92/1.32 Prover 16: Warning: ignoring some quantifiers 1.92/1.32 Prover 16: Constructing countermodel ... 1.92/1.33 Prover 16: gave up 1.92/1.33 Prover 19: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=off 1.92/1.34 Prover 19: Preprocessing ... 1.92/1.35 Prover 19: Warning: ignoring some quantifiers 1.92/1.36 Prover 19: Constructing countermodel ... 2.13/1.37 Prover 19: gave up 2.13/1.37 2.13/1.37 2.13/1.37 775ms 2.17/1.54 EOF