%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ALG198+1 : TPTP v8.1.2. Released v2.7.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n017.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Aug 30 16:39:51 EDT 2023 % Result : Theorem 13.71s 2.57s % Output : Proof 20.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : ALG198+1 : TPTP v8.1.2. Released v2.7.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Mon Aug 28 04:14:57 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.57 ________ _____ % 0.20/0.57 ___ __ \_________(_)________________________________ % 0.20/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.57 % 0.20/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.57 (2023-06-19) % 0.20/0.57 % 0.20/0.57 (c) Philipp Rümmer, 2009-2023 % 0.20/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.57 Amanda Stjerna. % 0.20/0.57 Free software under BSD-3-Clause. % 0.20/0.57 % 0.20/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.58 % 0.20/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.59 Running up to 7 provers in parallel. % 0.20/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.89/1.70 Prover 1: Preprocessing ... % 8.21/1.85 Prover 4: Preprocessing ... % 8.21/1.86 Prover 5: Preprocessing ... % 8.21/1.86 Prover 2: Preprocessing ... % 8.21/1.86 Prover 3: Preprocessing ... % 8.21/1.86 Prover 6: Preprocessing ... % 8.21/1.86 Prover 0: Preprocessing ... % 12.93/2.54 Prover 3: Constructing countermodel ... % 13.71/2.56 Prover 0: Constructing countermodel ... % 13.71/2.56 Prover 6: Constructing countermodel ... % 13.71/2.57 Prover 0: proved (1973ms) % 13.71/2.57 % 13.71/2.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.71/2.57 % 13.71/2.57 Prover 6: proved (1974ms) % 13.71/2.57 % 13.71/2.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.71/2.57 % 13.71/2.58 Prover 3: proved (1976ms) % 13.71/2.58 % 13.71/2.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.71/2.58 % 13.71/2.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 13.71/2.58 Prover 2: Constructing countermodel ... % 13.71/2.58 Prover 2: stopped % 13.71/2.59 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.71/2.59 Prover 4: Constructing countermodel ... % 13.71/2.59 Prover 1: Constructing countermodel ... % 13.71/2.59 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 13.71/2.59 Prover 4: Found proof (size 1) % 13.71/2.59 Prover 1: Found proof (size 1) % 13.71/2.59 Prover 1: proved (1993ms) % 13.71/2.59 Prover 4: proved (1992ms) % 13.71/2.59 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 17.18/2.98 Prover 5: Constructing countermodel ... % 17.18/2.98 Prover 5: stopped % 17.92/3.19 Prover 8: Preprocessing ... % 18.66/3.21 Prover 11: Preprocessing ... % 18.66/3.21 Prover 7: Preprocessing ... % 18.66/3.22 Prover 10: Preprocessing ... % 20.14/3.36 Prover 8: Constructing countermodel ... % 20.14/3.36 Prover 8: stopped % 20.14/3.37 Prover 10: stopped % 20.14/3.37 Prover 7: stopped % 20.14/3.37 Prover 11: stopped % 20.14/3.37 % 20.14/3.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.14/3.37 % 20.14/3.38 % SZS output start Proof for theBenchmark % 20.14/3.38 Assumptions after simplification: % 20.14/3.38 --------------------------------- % 20.14/3.38 % 20.14/3.38 (co1) % 20.14/3.38 $false % 20.14/3.38 % 20.14/3.38 Further assumptions not needed in the proof: % 20.14/3.38 -------------------------------------------- % 20.14/3.38 ax1, ax2, ax3, ax4, ax5, ax6 % 20.14/3.38 % 20.14/3.38 Those formulas are unsatisfiable: % 20.14/3.38 --------------------------------- % 20.14/3.38 % 20.14/3.38 Begin of proof % 20.14/3.38 | % 20.14/3.38 | CLOSE: (co1) is inconsistent. % 20.14/3.38 | % 20.14/3.38 End of proof % 20.14/3.38 % SZS output end Proof for theBenchmark % 20.14/3.38 % 20.14/3.38 2807ms %------------------------------------------------------------------------------