%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : COM018+1 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n012.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 18:44:17 EDT 2023 % Result : Theorem 16.17s 2.93s % Output : Proof 19.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : COM018+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n012.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Aug 29 12:57:54 EDT 2023 % 0.14/0.34 % CPUTime : % 0.19/0.55 ________ _____ % 0.19/0.55 ___ __ \_________(_)________________________________ % 0.19/0.55 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.55 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.55 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.55 % 0.19/0.55 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.55 (2023-06-19) % 0.19/0.55 % 0.19/0.55 (c) Philipp Rümmer, 2009-2023 % 0.19/0.55 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.55 Amanda Stjerna. % 0.19/0.55 Free software under BSD-3-Clause. % 0.19/0.55 % 0.19/0.55 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.55 % 0.19/0.55 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.56 Running up to 7 provers in parallel. % 0.19/0.57 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.57 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.57 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.57 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.57 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.57 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.57 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.56/1.10 Prover 1: Preprocessing ... % 2.56/1.10 Prover 4: Preprocessing ... % 3.16/1.14 Prover 5: Preprocessing ... % 3.16/1.14 Prover 6: Preprocessing ... % 3.16/1.14 Prover 3: Preprocessing ... % 3.16/1.14 Prover 2: Preprocessing ... % 3.16/1.14 Prover 0: Preprocessing ... % 5.36/1.48 Prover 2: Constructing countermodel ... % 5.36/1.48 Prover 5: Constructing countermodel ... % 6.45/1.64 Prover 1: Constructing countermodel ... % 6.45/1.65 Prover 3: Constructing countermodel ... % 6.45/1.65 Prover 6: Proving ... % 8.73/1.96 Prover 4: Constructing countermodel ... % 10.80/2.18 Prover 0: Proving ... % 16.17/2.93 Prover 2: proved (2362ms) % 16.17/2.93 % 16.17/2.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 16.17/2.93 % 16.17/2.93 Prover 3: stopped % 16.17/2.94 Prover 5: stopped % 16.17/2.95 Prover 6: stopped % 16.17/2.95 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 16.17/2.95 Prover 0: stopped % 16.17/2.96 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 16.17/2.96 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 16.17/2.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 16.17/2.96 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.97/3.00 Prover 7: Preprocessing ... % 16.97/3.00 Prover 8: Preprocessing ... % 17.19/3.02 Prover 11: Preprocessing ... % 17.19/3.03 Prover 10: Preprocessing ... % 17.19/3.03 Prover 13: Preprocessing ... % 17.19/3.06 Prover 10: Constructing countermodel ... % 17.19/3.07 Prover 7: Constructing countermodel ... % 17.19/3.08 Prover 13: Constructing countermodel ... % 17.19/3.08 Prover 8: Warning: ignoring some quantifiers % 17.19/3.09 Prover 8: Constructing countermodel ... % 19.13/3.27 Prover 10: Found proof (size 9) % 19.13/3.27 Prover 13: Found proof (size 9) % 19.13/3.27 Prover 13: proved (320ms) % 19.13/3.27 Prover 10: proved (327ms) % 19.13/3.27 Prover 4: stopped % 19.13/3.28 Prover 8: stopped % 19.13/3.28 Prover 7: stopped % 19.13/3.28 Prover 1: stopped % 19.21/3.34 Prover 11: Constructing countermodel ... % 19.21/3.35 Prover 11: stopped % 19.21/3.35 % 19.21/3.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.21/3.35 % 19.21/3.36 % SZS output start Proof for theBenchmark % 19.21/3.36 Assumptions after simplification: % 19.21/3.36 --------------------------------- % 19.21/3.36 % 19.21/3.36 (mTermNF) % 19.21/3.36 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ isTerminating0(v0) | % 19.21/3.36 ~ aRewritingSystem0(v0) | ~ aElement0(v1) | ? [v2: $i] : ($i(v2) & % 19.21/3.36 aNormalFormOfIn0(v2, v1, v0))) % 19.21/3.36 % 19.21/3.36 (m__) % 19.21/3.36 $i(xw) & $i(xR) & ! [v0: $i] : ( ~ $i(v0) | ~ aNormalFormOfIn0(v0, xw, xR)) % 19.21/3.36 % 19.21/3.36 (m__656) % 19.21/3.37 $i(xR) & aRewritingSystem0(xR) % 19.21/3.37 % 19.21/3.37 (m__656_01) % 19.21/3.37 $i(xR) & isTerminating0(xR) & isLocallyConfluent0(xR) % 19.21/3.37 % 19.21/3.37 (m__799) % 19.21/3.37 $i(xw) & $i(xv) & $i(xu) & $i(xR) & sdtmndtasgtdt0(xv, xR, xw) & % 19.21/3.37 sdtmndtasgtdt0(xu, xR, xw) & aElement0(xw) % 19.21/3.37 % 19.21/3.37 Further assumptions not needed in the proof: % 19.21/3.37 -------------------------------------------- % 19.21/3.37 mCRDef, mElmSort, mNFRDef, mReduct, mRelSort, mTCDef, mTCRDef, mTCRTrans, % 19.21/3.37 mTCTrans, mTCbr, mTermin, mWCRDef, mWFOrd, m__715, m__731, m__731_02, m__755, % 19.21/3.37 m__779 % 19.21/3.37 % 19.21/3.37 Those formulas are unsatisfiable: % 19.21/3.37 --------------------------------- % 19.21/3.37 % 19.21/3.37 Begin of proof % 19.21/3.37 | % 19.21/3.37 | ALPHA: (m__) implies: % 19.21/3.37 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ aNormalFormOfIn0(v0, xw, xR)) % 19.21/3.37 | % 19.21/3.37 | ALPHA: (m__799) implies: % 19.21/3.37 | (2) aElement0(xw) % 19.21/3.37 | (3) $i(xw) % 19.21/3.37 | % 19.21/3.37 | ALPHA: (m__656_01) implies: % 19.21/3.37 | (4) isTerminating0(xR) % 19.21/3.37 | % 19.21/3.37 | ALPHA: (m__656) implies: % 19.21/3.37 | (5) aRewritingSystem0(xR) % 19.21/3.37 | (6) $i(xR) % 19.21/3.37 | % 19.21/3.37 | GROUND_INST: instantiating (mTermNF) with xR, xw, simplifying with (2), (3), % 19.21/3.37 | (4), (5), (6) gives: % 19.21/3.38 | (7) ? [v0: $i] : ($i(v0) & aNormalFormOfIn0(v0, xw, xR)) % 19.21/3.38 | % 19.21/3.38 | DELTA: instantiating (7) with fresh symbol all_31_0 gives: % 19.21/3.38 | (8) $i(all_31_0) & aNormalFormOfIn0(all_31_0, xw, xR) % 19.21/3.38 | % 19.21/3.38 | ALPHA: (8) implies: % 19.21/3.38 | (9) aNormalFormOfIn0(all_31_0, xw, xR) % 19.21/3.38 | (10) $i(all_31_0) % 19.21/3.38 | % 19.21/3.38 | GROUND_INST: instantiating (1) with all_31_0, simplifying with (9), (10) % 19.21/3.38 | gives: % 19.21/3.38 | (11) $false % 19.21/3.38 | % 19.21/3.38 | CLOSE: (11) is inconsistent. % 19.21/3.38 | % 19.21/3.38 End of proof % 19.21/3.38 % SZS output end Proof for theBenchmark % 19.21/3.38 % 19.21/3.38 2831ms %------------------------------------------------------------------------------