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.24 % Computer : n031.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 05:04:54 CDT 2018 0.03/0.24 % CPUTime : 0.08/0.46 ________ _____ 0.08/0.46 ___ __ \_________(_)________________________________ 0.08/0.46 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ 0.08/0.46 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) 0.08/0.46 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ 0.08/0.46 0.08/0.46 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic 0.08/0.46 (CASC 2017-07-17) 0.08/0.46 0.08/0.46 (c) Philipp Rümmer, 2009-2017 0.08/0.46 (contributions by Peter Backeman, Peter Baumgartner, 0.08/0.46 Angelo Brillout, Aleksandar Zeljic) 0.08/0.46 Free software under GNU Lesser General Public License (LGPL). 0.08/0.46 Bug reports to ph_r@gmx.net 0.08/0.46 0.08/0.46 For more information, visit http://www.philipp.ruemmer.org/princess.shtml 0.08/0.46 0.08/0.46 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... 0.08/0.50 Prover 0: Options: +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 1.96/1.10 Prover 0: Warning: using theory to encode multiplication: GroebnerMultiplication 1.96/1.11 Prover 0: Preprocessing ... 4.46/1.84 Prover 0: Proving ... 12.38/4.34 Prover 1: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 12.90/4.49 Prover 1: Warning: using theory to encode multiplication: GroebnerMultiplication 12.90/4.49 Prover 1: Preprocessing ... 13.23/4.60 Prover 1: Warning: ignoring some quantifiers 13.52/4.67 Prover 1: Constructing countermodel ... 38.53/16.68 Prover 2: Options: +triggersInConjecture -genTotalityAxioms=all -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 38.86/16.82 Prover 2: Warning: using theory to encode multiplication: GroebnerMultiplication 38.86/16.83 Prover 2: Preprocessing ... 39.46/16.96 Prover 2: Proving ... 61.85/28.38 Prover 1: stopped 62.09/28.58 Prover 3: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 62.37/28.66 Prover 3: Warning: using theory to encode multiplication: GroebnerMultiplication 62.37/28.66 Prover 3: Preprocessing ... 62.66/28.74 Prover 3: Warning: ignoring some quantifiers 62.66/28.75 Prover 3: Constructing countermodel ... 80.44/41.69 Prover 2: stopped 80.76/41.89 Prover 4: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 80.96/41.98 Prover 4: Warning: using theory to encode multiplication: GroebnerMultiplication 80.96/41.98 Prover 4: Preprocessing ... 81.40/42.13 Prover 4: Warning: ignoring some quantifiers 81.64/42.17 Prover 4: Constructing countermodel ... 98.80/58.13 Prover 0: gave up 98.80/58.13 Prover 5: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=off 98.96/58.21 Prover 5: Warning: using theory to encode multiplication: GroebnerMultiplication 98.96/58.21 Prover 5: Preprocessing ... 99.30/58.29 Prover 5: Proving ... 107.23/64.09 Prover 5: stopped 107.41/64.29 Prover 6: Options: -triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 107.68/64.39 Prover 6: Warning: using theory to encode multiplication: GroebnerMultiplication 107.68/64.39 Prover 6: Preprocessing ... 107.90/64.45 Prover 6: Proving ... 119.07/72.32 Prover 6: stopped 119.30/72.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 119.40/72.59 Prover 7: Warning: using theory to encode multiplication: GroebnerMultiplication 119.40/72.59 Prover 7: Preprocessing ... 119.40/72.63 Prover 7: Warning: ignoring some quantifiers 119.40/72.65 Prover 7: Constructing countermodel ... 129.90/80.53 Prover 4: stopped 130.06/80.74 Prover 8: Options: +triggersInConjecture -genTotalityAxioms=ctors -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 130.16/80.80 Prover 8: Warning: using theory to encode multiplication: GroebnerMultiplication 130.16/80.80 Prover 8: Preprocessing ... 130.33/80.85 Prover 8: Warning: ignoring some quantifiers 130.33/80.87 Prover 8: Constructing countermodel ... 182.67/130.19 Prover 7: stopped 183.49/130.96 Prover 9: Options: +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off 183.61/131.02 Prover 9: Warning: using theory to encode multiplication: GroebnerMultiplication 183.61/131.02 Prover 9: Preprocessing ... 183.79/131.10 Prover 9: Warning: ignoring some quantifiers 183.79/131.10 Prover 9: Constructing countermodel ... 219.19/165.94 Prover 9: stopped 219.42/166.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 219.53/166.22 Prover 10: Warning: using theory to encode multiplication: GroebnerMultiplication 219.53/166.22 Prover 10: Preprocessing ... 219.53/166.26 Prover 10: Warning: ignoring some quantifiers 219.53/166.27 Prover 10: Constructing countermodel ... 273.11/219.34 Prover 10: stopped 273.32/219.55 Prover 11: Options: +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off 273.50/219.66 Prover 11: Warning: using theory to encode multiplication: GroebnerMultiplication 273.50/219.66 Prover 11: Preprocessing ... 273.76/219.72 Prover 11: Warning: ignoring some quantifiers 273.76/219.75 Prover 11: Constructing countermodel ... 298.21/243.71 Prover 11: stopped 298.40/243.91 Prover 12: Options: -triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=off 298.63/244.00 Prover 12: Warning: using theory to encode multiplication: GroebnerMultiplication 298.63/244.00 Prover 12: Preprocessing ... 298.72/244.10 Prover 12: Proving ... 299.92/245.04 Prover 12: stopped 300.08/245.26 EOF