%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : COM020+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 : n019.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 137.01s 19.05s % Output : Proof 137.26s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : COM020+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.16/0.34 % Computer : n019.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Aug 29 13:31:58 EDT 2023 % 0.16/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.51/1.09 Prover 1: Preprocessing ... % 2.51/1.09 Prover 4: Preprocessing ... % 3.05/1.13 Prover 3: Preprocessing ... % 3.05/1.13 Prover 0: Preprocessing ... % 3.05/1.13 Prover 2: Preprocessing ... % 3.05/1.13 Prover 5: Preprocessing ... % 3.05/1.13 Prover 6: Preprocessing ... % 5.23/1.46 Prover 5: Constructing countermodel ... % 5.23/1.47 Prover 2: Constructing countermodel ... % 5.23/1.60 Prover 1: Constructing countermodel ... % 6.63/1.67 Prover 6: Proving ... % 6.63/1.69 Prover 3: Constructing countermodel ... % 9.78/2.06 Prover 4: Constructing countermodel ... % 10.38/2.15 Prover 0: Proving ... % 72.27/10.32 Prover 2: stopped % 72.27/10.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 73.03/10.44 Prover 7: Preprocessing ... % 73.03/10.48 Prover 7: Constructing countermodel ... % 99.40/13.97 Prover 5: stopped % 99.40/13.97 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 99.65/14.01 Prover 8: Preprocessing ... % 100.62/14.15 Prover 8: Warning: ignoring some quantifiers % 100.62/14.15 Prover 8: Constructing countermodel ... % 114.07/15.97 Prover 1: stopped % 114.07/15.97 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 114.46/16.05 Prover 9: Preprocessing ... % 116.27/16.23 Prover 9: Constructing countermodel ... % 128.46/17.90 Prover 6: stopped % 128.46/17.91 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 128.46/17.96 Prover 10: Preprocessing ... % 128.46/18.00 Prover 10: Constructing countermodel ... % 137.01/19.04 Prover 10: Found proof (size 21) % 137.01/19.04 Prover 10: proved (1128ms) % 137.01/19.04 Prover 3: stopped % 137.01/19.04 Prover 0: stopped % 137.01/19.04 Prover 9: stopped % 137.01/19.04 Prover 8: stopped % 137.01/19.05 Prover 7: stopped % 137.01/19.05 Prover 4: stopped % 137.01/19.05 % 137.01/19.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 137.01/19.05 % 137.01/19.06 % SZS output start Proof for theBenchmark % 137.01/19.06 Assumptions after simplification: % 137.01/19.06 --------------------------------- % 137.01/19.06 % 137.01/19.06 (mNFRDef) % 137.01/19.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 137.01/19.07 | ~ $i(v1) | ~ $i(v0) | ~ aNormalFormOfIn0(v2, v0, v1) | ~ % 137.01/19.07 aReductOfIn0(v3, v2, v1) | ~ aRewritingSystem0(v1) | ~ aElement0(v0)) & ! % 137.01/19.07 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 137.01/19.07 aNormalFormOfIn0(v2, v0, v1) | ~ aRewritingSystem0(v1) | ~ aElement0(v0) | % 137.01/19.07 sdtmndtasgtdt0(v0, v1, v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 137.01/19.07 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aNormalFormOfIn0(v2, v0, v1) | ~ % 137.01/19.07 aRewritingSystem0(v1) | ~ aElement0(v0) | aElement0(v2)) & ! [v0: $i] : ! % 137.01/19.07 [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 137.01/19.07 sdtmndtasgtdt0(v0, v1, v2) | ~ aRewritingSystem0(v1) | ~ aElement0(v2) | % 137.01/19.07 ~ aElement0(v0) | aNormalFormOfIn0(v2, v0, v1) | ? [v3: $i] : ($i(v3) & % 137.01/19.07 aReductOfIn0(v3, v2, v1))) % 137.01/19.07 % 137.01/19.07 (mTCDef) % 137.01/19.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 137.01/19.07 | ~ $i(v1) | ~ $i(v0) | ~ sdtmndtplgtdt0(v3, v1, v2) | ~ % 137.01/19.07 aReductOfIn0(v3, v0, v1) | ~ aRewritingSystem0(v1) | ~ aElement0(v3) | ~ % 137.01/19.07 aElement0(v2) | ~ aElement0(v0) | sdtmndtplgtdt0(v0, v1, v2)) & ! [v0: $i] % 137.01/19.07 : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 137.01/19.07 sdtmndtplgtdt0(v0, v1, v2) | ~ aRewritingSystem0(v1) | ~ aElement0(v2) | % 137.01/19.07 ~ aElement0(v0) | aReductOfIn0(v2, v0, v1) | ? [v3: $i] : ($i(v3) & % 137.01/19.07 sdtmndtplgtdt0(v3, v1, v2) & aReductOfIn0(v3, v0, v1) & aElement0(v3))) & % 137.01/19.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 137.01/19.07 ~ aReductOfIn0(v2, v0, v1) | ~ aRewritingSystem0(v1) | ~ aElement0(v2) | % 137.01/19.07 ~ aElement0(v0) | sdtmndtplgtdt0(v0, v1, v2)) % 137.01/19.07 % 137.01/19.07 (mTCRTrans) % 137.01/19.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 137.01/19.07 | ~ $i(v1) | ~ $i(v0) | ~ sdtmndtasgtdt0(v2, v1, v3) | ~ % 137.01/19.07 sdtmndtasgtdt0(v0, v1, v2) | ~ aRewritingSystem0(v1) | ~ aElement0(v3) | % 137.01/19.07 ~ aElement0(v2) | ~ aElement0(v0) | sdtmndtasgtdt0(v0, v1, v3)) % 137.01/19.07 % 137.01/19.07 (mTermin) % 137.01/19.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 137.01/19.07 ~ isTerminating0(v0) | ~ sdtmndtplgtdt0(v1, v0, v2) | ~ % 137.01/19.07 aRewritingSystem0(v0) | ~ aElement0(v2) | ~ aElement0(v1) | iLess0(v2, % 137.01/19.07 v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ aRewritingSystem0(v0) | % 137.01/19.07 isTerminating0(v0) | ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & % 137.01/19.07 sdtmndtplgtdt0(v1, v0, v2) & aElement0(v2) & aElement0(v1) & ~ iLess0(v2, % 137.01/19.07 v1))) % 137.01/19.07 % 137.01/19.08 (m__) % 137.01/19.08 $i(xd) & $i(xb) & $i(xR) & ! [v0: $i] : ( ~ $i(v0) | ~ sdtmndtasgtdt0(xd, % 137.01/19.08 xR, v0) | ~ sdtmndtasgtdt0(xb, xR, v0) | ~ aElement0(v0)) % 137.01/19.08 % 137.01/19.08 (m__656) % 137.01/19.08 $i(xR) & aRewritingSystem0(xR) % 137.01/19.08 % 137.01/19.08 (m__656_01) % 137.01/19.08 $i(xR) & isTerminating0(xR) & isLocallyConfluent0(xR) % 137.01/19.08 % 137.01/19.08 (m__715) % 137.01/19.08 $i(xa) & $i(xR) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ % 137.01/19.08 $i(v1) | ~ $i(v0) | ~ sdtmndtasgtdt0(v0, xR, v2) | ~ sdtmndtasgtdt0(v0, % 137.01/19.08 xR, v1) | ~ iLess0(v0, xa) | ~ aElement0(v2) | ~ aElement0(v1) | ~ % 137.01/19.08 aElement0(v0) | ? [v3: $i] : ($i(v3) & sdtmndtasgtdt0(v2, xR, v3) & % 137.01/19.08 sdtmndtasgtdt0(v1, xR, v3) & aElement0(v3))) % 137.01/19.08 % 137.01/19.08 (m__731) % 137.01/19.08 $i(xc) & $i(xb) & $i(xa) & aElement0(xc) & aElement0(xb) & aElement0(xa) % 137.01/19.08 % 137.01/19.08 (m__755) % 137.01/19.08 $i(xu) & $i(xb) & $i(xa) & $i(xR) & sdtmndtasgtdt0(xu, xR, xb) & % 137.01/19.08 aReductOfIn0(xu, xa, xR) & aElement0(xu) % 137.01/19.08 % 137.01/19.08 (m__799) % 137.01/19.08 $i(xw) & $i(xv) & $i(xu) & $i(xR) & sdtmndtasgtdt0(xv, xR, xw) & % 137.01/19.08 sdtmndtasgtdt0(xu, xR, xw) & aElement0(xw) % 137.01/19.08 % 137.01/19.08 (m__818) % 137.01/19.08 $i(xd) & $i(xw) & $i(xR) & aNormalFormOfIn0(xd, xw, xR) % 137.01/19.08 % 137.01/19.08 Further assumptions not needed in the proof: % 137.01/19.08 -------------------------------------------- % 137.01/19.08 mCRDef, mElmSort, mReduct, mRelSort, mTCRDef, mTCTrans, mTCbr, mTermNF, mWCRDef, % 137.01/19.08 mWFOrd, m__731_02, m__779 % 137.01/19.08 % 137.01/19.08 Those formulas are unsatisfiable: % 137.01/19.08 --------------------------------- % 137.01/19.08 % 137.01/19.08 Begin of proof % 137.01/19.08 | % 137.01/19.08 | ALPHA: (m__) implies: % 137.26/19.08 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ sdtmndtasgtdt0(xd, xR, v0) | ~ % 137.26/19.08 | sdtmndtasgtdt0(xb, xR, v0) | ~ aElement0(v0)) % 137.26/19.08 | % 137.26/19.08 | ALPHA: (m__818) implies: % 137.26/19.08 | (2) aNormalFormOfIn0(xd, xw, xR) % 137.26/19.08 | (3) $i(xd) % 137.26/19.08 | % 137.26/19.08 | ALPHA: (m__799) implies: % 137.26/19.08 | (4) aElement0(xw) % 137.26/19.08 | (5) sdtmndtasgtdt0(xu, xR, xw) % 137.26/19.08 | (6) $i(xw) % 137.26/19.08 | % 137.26/19.08 | ALPHA: (m__755) implies: % 137.26/19.08 | (7) aElement0(xu) % 137.26/19.09 | (8) aReductOfIn0(xu, xa, xR) % 137.26/19.09 | (9) sdtmndtasgtdt0(xu, xR, xb) % 137.26/19.09 | (10) $i(xu) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (m__715) implies: % 137.26/19.09 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 137.26/19.09 | $i(v0) | ~ sdtmndtasgtdt0(v0, xR, v2) | ~ sdtmndtasgtdt0(v0, xR, % 137.26/19.09 | v1) | ~ iLess0(v0, xa) | ~ aElement0(v2) | ~ aElement0(v1) | ~ % 137.26/19.09 | aElement0(v0) | ? [v3: $i] : ($i(v3) & sdtmndtasgtdt0(v2, xR, v3) & % 137.26/19.09 | sdtmndtasgtdt0(v1, xR, v3) & aElement0(v3))) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (m__731) implies: % 137.26/19.09 | (12) aElement0(xa) % 137.26/19.09 | (13) aElement0(xb) % 137.26/19.09 | (14) $i(xa) % 137.26/19.09 | (15) $i(xb) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (m__656_01) implies: % 137.26/19.09 | (16) isTerminating0(xR) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (m__656) implies: % 137.26/19.09 | (17) aRewritingSystem0(xR) % 137.26/19.09 | (18) $i(xR) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (mNFRDef) implies: % 137.26/19.09 | (19) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 137.26/19.09 | $i(v0) | ~ aNormalFormOfIn0(v2, v0, v1) | ~ aRewritingSystem0(v1) % 137.26/19.09 | | ~ aElement0(v0) | aElement0(v2)) % 137.26/19.09 | (20) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 137.26/19.09 | $i(v0) | ~ aNormalFormOfIn0(v2, v0, v1) | ~ aRewritingSystem0(v1) % 137.26/19.09 | | ~ aElement0(v0) | sdtmndtasgtdt0(v0, v1, v2)) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (mTermin) implies: % 137.26/19.09 | (21) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 137.26/19.09 | $i(v0) | ~ isTerminating0(v0) | ~ sdtmndtplgtdt0(v1, v0, v2) | ~ % 137.26/19.09 | aRewritingSystem0(v0) | ~ aElement0(v2) | ~ aElement0(v1) | % 137.26/19.09 | iLess0(v2, v1)) % 137.26/19.09 | % 137.26/19.09 | ALPHA: (mTCDef) implies: % 137.26/19.09 | (22) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 137.26/19.09 | $i(v0) | ~ aReductOfIn0(v2, v0, v1) | ~ aRewritingSystem0(v1) | ~ % 137.26/19.09 | aElement0(v2) | ~ aElement0(v0) | sdtmndtplgtdt0(v0, v1, v2)) % 137.26/19.09 | % 137.26/19.09 | GROUND_INST: instantiating (22) with xa, xR, xu, simplifying with (7), (8), % 137.26/19.09 | (10), (12), (14), (17), (18) gives: % 137.26/19.09 | (23) sdtmndtplgtdt0(xa, xR, xu) % 137.26/19.09 | % 137.26/19.09 | GROUND_INST: instantiating (20) with xw, xR, xd, simplifying with (2), (3), % 137.26/19.09 | (4), (6), (17), (18) gives: % 137.26/19.09 | (24) sdtmndtasgtdt0(xw, xR, xd) % 137.26/19.09 | % 137.26/19.09 | GROUND_INST: instantiating (19) with xw, xR, xd, simplifying with (2), (3), % 137.26/19.09 | (4), (6), (17), (18) gives: % 137.26/19.09 | (25) aElement0(xd) % 137.26/19.09 | % 137.26/19.10 | GROUND_INST: instantiating (21) with xR, xa, xu, simplifying with (7), (10), % 137.26/19.10 | (12), (14), (16), (17), (18), (23) gives: % 137.26/19.10 | (26) iLess0(xu, xa) % 137.26/19.10 | % 137.26/19.10 | GROUND_INST: instantiating (mTCRTrans) with xu, xR, xw, xd, simplifying with % 137.26/19.10 | (3), (4), (5), (6), (7), (10), (17), (18), (24), (25) gives: % 137.26/19.10 | (27) sdtmndtasgtdt0(xu, xR, xd) % 137.26/19.10 | % 137.26/19.10 | GROUND_INST: instantiating (11) with xu, xb, xd, simplifying with (3), (7), % 137.26/19.10 | (9), (10), (13), (15), (25), (26), (27) gives: % 137.26/19.10 | (28) ? [v0: $i] : ($i(v0) & sdtmndtasgtdt0(xd, xR, v0) & % 137.26/19.10 | sdtmndtasgtdt0(xb, xR, v0) & aElement0(v0)) % 137.26/19.10 | % 137.26/19.10 | DELTA: instantiating (28) with fresh symbol all_157_0 gives: % 137.26/19.10 | (29) $i(all_157_0) & sdtmndtasgtdt0(xd, xR, all_157_0) & sdtmndtasgtdt0(xb, % 137.26/19.10 | xR, all_157_0) & aElement0(all_157_0) % 137.26/19.10 | % 137.26/19.10 | ALPHA: (29) implies: % 137.26/19.10 | (30) aElement0(all_157_0) % 137.26/19.10 | (31) sdtmndtasgtdt0(xb, xR, all_157_0) % 137.26/19.10 | (32) sdtmndtasgtdt0(xd, xR, all_157_0) % 137.26/19.10 | (33) $i(all_157_0) % 137.26/19.10 | % 137.26/19.10 | GROUND_INST: instantiating (1) with all_157_0, simplifying with (30), (31), % 137.26/19.10 | (32), (33) gives: % 137.26/19.10 | (34) $false % 137.26/19.10 | % 137.26/19.10 | CLOSE: (34) is inconsistent. % 137.26/19.10 | % 137.26/19.10 End of proof % 137.26/19.10 % SZS output end Proof for theBenchmark % 137.26/19.10 % 137.26/19.10 18494ms %------------------------------------------------------------------------------