%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ALG200+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 : n014.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:52 EDT 2023 % Result : Theorem 18.03s 3.20s % Output : Proof 21.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ALG200+1 : TPTP v8.1.2. Released v2.7.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n014.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 03:18:16 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 9.60/2.06 Prover 2: Preprocessing ... % 9.60/2.06 Prover 0: Preprocessing ... % 9.60/2.23 Prover 3: Preprocessing ... % 9.60/2.24 Prover 6: Preprocessing ... % 10.90/2.27 Prover 1: Preprocessing ... % 10.90/2.27 Prover 5: Preprocessing ... % 10.90/2.28 Prover 4: Preprocessing ... % 18.03/3.16 Prover 3: Constructing countermodel ... % 18.03/3.16 Prover 0: Constructing countermodel ... % 18.03/3.17 Prover 4: Constructing countermodel ... % 18.03/3.19 Prover 1: Constructing countermodel ... % 18.03/3.19 Prover 6: Constructing countermodel ... % 18.03/3.19 Prover 6: proved (2556ms) % 18.03/3.19 Prover 0: proved (2565ms) % 18.03/3.19 % 18.03/3.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.03/3.20 % 18.03/3.20 % 18.03/3.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.03/3.20 % 18.41/3.21 Prover 4: Found proof (size 1) % 18.41/3.21 Prover 4: proved (2562ms) % 18.41/3.21 Prover 3: proved (2566ms) % 18.41/3.21 Prover 1: Found proof (size 1) % 18.41/3.21 Prover 1: proved (2568ms) % 18.41/3.21 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 18.41/3.21 Prover 2: Constructing countermodel ... % 18.41/3.21 Prover 2: stopped % 18.41/3.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 20.15/3.53 Prover 5: Constructing countermodel ... % 20.15/3.53 Prover 5: stopped % 20.15/3.55 Prover 7: Preprocessing ... % 20.15/3.55 Prover 8: Preprocessing ... % 20.75/3.65 Prover 7: stopped % 20.75/3.68 Prover 8: Constructing countermodel ... % 20.75/3.68 Prover 8: stopped % 21.43/3.68 % 21.43/3.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.43/3.68 % 21.43/3.68 % SZS output start Proof for theBenchmark % 21.43/3.68 Assumptions after simplification: % 21.43/3.68 --------------------------------- % 21.43/3.68 % 21.43/3.68 (co1) % 21.43/3.69 $false % 21.43/3.69 % 21.43/3.69 Further assumptions not needed in the proof: % 21.43/3.69 -------------------------------------------- % 21.43/3.69 ax1, ax2, ax3, ax4, ax5, ax6 % 21.43/3.69 % 21.43/3.69 Those formulas are unsatisfiable: % 21.43/3.69 --------------------------------- % 21.43/3.69 % 21.43/3.69 Begin of proof % 21.43/3.69 | % 21.43/3.69 | CLOSE: (co1) is inconsistent. % 21.43/3.69 | % 21.43/3.69 End of proof % 21.43/3.69 % SZS output end Proof for theBenchmark % 21.43/3.69 % 21.43/3.69 3081ms %------------------------------------------------------------------------------