%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n023.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 : Thu Aug 31 11:48:25 EDT 2023 % Result : Theorem 3.85s 1.21s % Output : Proof 4.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n023.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 : Fri Aug 25 15:04:42 EDT 2023 % 0.14/0.34 % CPUTime : % 0.60/0.62 ________ _____ % 0.60/0.62 ___ __ \_________(_)________________________________ % 0.60/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.62 % 0.60/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.62 (2023-06-19) % 0.60/0.62 % 0.60/0.62 (c) Philipp Rümmer, 2009-2023 % 0.60/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.62 Amanda Stjerna. % 0.60/0.62 Free software under BSD-3-Clause. % 0.60/0.62 % 0.60/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.62 % 0.60/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.60/0.63 Running up to 7 provers in parallel. % 0.74/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.74/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.74/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.74/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.74/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.74/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.74/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.04/0.97 Prover 1: Preprocessing ... % 2.04/0.98 Prover 4: Preprocessing ... % 2.49/1.02 Prover 0: Preprocessing ... % 2.49/1.02 Prover 3: Preprocessing ... % 2.49/1.02 Prover 6: Preprocessing ... % 2.49/1.02 Prover 2: Preprocessing ... % 2.49/1.02 Prover 5: Preprocessing ... % 2.94/1.12 Prover 5: Constructing countermodel ... % 2.94/1.12 Prover 2: Constructing countermodel ... % 2.94/1.13 Prover 1: Constructing countermodel ... % 2.94/1.14 Prover 3: Constructing countermodel ... % 2.94/1.15 Prover 6: Proving ... % 2.94/1.15 Prover 4: Constructing countermodel ... % 2.94/1.16 Prover 0: Proving ... % 3.85/1.21 Prover 2: proved (570ms) % 3.85/1.21 % 3.85/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.85/1.21 % 3.85/1.21 Prover 5: proved (569ms) % 3.85/1.21 % 3.85/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.85/1.21 % 3.85/1.21 Prover 3: stopped % 3.85/1.21 Prover 0: stopped % 3.85/1.21 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.85/1.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.85/1.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.85/1.21 Prover 6: stopped % 3.85/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.85/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.07/1.23 Prover 7: Preprocessing ... % 4.07/1.24 Prover 10: Preprocessing ... % 4.07/1.24 Prover 13: Preprocessing ... % 4.07/1.24 Prover 11: Preprocessing ... % 4.07/1.25 Prover 8: Preprocessing ... % 4.07/1.26 Prover 7: Constructing countermodel ... % 4.07/1.26 Prover 10: Constructing countermodel ... % 4.07/1.27 Prover 13: Constructing countermodel ... % 4.07/1.29 Prover 10: Found proof (size 5) % 4.07/1.29 Prover 13: Found proof (size 5) % 4.07/1.29 Prover 13: proved (76ms) % 4.07/1.29 Prover 10: proved (77ms) % 4.07/1.29 Prover 1: stopped % 4.07/1.29 Prover 4: stopped % 4.07/1.29 Prover 7: Found proof (size 5) % 4.07/1.29 Prover 7: proved (81ms) % 4.07/1.30 Prover 8: Warning: ignoring some quantifiers % 4.07/1.30 Prover 8: Constructing countermodel ... % 4.07/1.31 Prover 8: stopped % 4.07/1.32 Prover 11: Constructing countermodel ... % 4.07/1.32 Prover 11: stopped % 4.07/1.32 % 4.07/1.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.07/1.32 % 4.07/1.32 % SZS output start Proof for theBenchmark % 4.07/1.33 Assumptions after simplification: % 4.07/1.33 --------------------------------- % 4.07/1.33 % 4.07/1.33 (mCountNFin) % 4.70/1.33 ! [v0: $i] : ( ~ $i(v0) | ~ isCountable0(v0) | ~ isFinite0(v0) | ~ % 4.70/1.33 aSet0(v0)) % 4.70/1.33 % 4.70/1.33 (mDefEmp) % 4.70/1.33 $i(slcrc0) & aSet0(slcrc0) & ! [v0: $i] : (v0 = slcrc0 | ~ $i(v0) | ~ % 4.70/1.33 aSet0(v0) | ? [v1: $i] : ($i(v1) & aElementOf0(v1, v0))) & ! [v0: $i] : ( % 4.70/1.33 ~ $i(v0) | ~ aElementOf0(v0, slcrc0)) % 4.70/1.33 % 4.70/1.33 (mEmpFin) % 4.70/1.34 $i(slcrc0) & isFinite0(slcrc0) % 4.70/1.34 % 4.70/1.34 (m__) % 4.70/1.34 $i(slcrc0) & isCountable0(slcrc0) & aSet0(slcrc0) & ! [v0: $i] : ( ~ $i(v0) | % 4.70/1.34 ~ aElementOf0(v0, slcrc0)) % 4.70/1.34 % 4.70/1.34 Further assumptions not needed in the proof: % 4.70/1.34 -------------------------------------------- % 4.70/1.34 mCntRel, mEOfElem, mElmSort, mFinRel, mSetSort % 4.70/1.34 % 4.70/1.34 Those formulas are unsatisfiable: % 4.70/1.34 --------------------------------- % 4.70/1.34 % 4.70/1.34 Begin of proof % 4.70/1.34 | % 4.70/1.34 | ALPHA: (m__) implies: % 4.70/1.34 | (1) isCountable0(slcrc0) % 4.70/1.34 | % 4.70/1.34 | ALPHA: (mEmpFin) implies: % 4.70/1.34 | (2) isFinite0(slcrc0) % 4.70/1.34 | % 4.70/1.34 | ALPHA: (mDefEmp) implies: % 4.70/1.34 | (3) aSet0(slcrc0) % 4.70/1.34 | (4) $i(slcrc0) % 4.70/1.34 | % 4.70/1.34 | GROUND_INST: instantiating (mCountNFin) with slcrc0, simplifying with (1), % 4.70/1.34 | (2), (3), (4) gives: % 4.70/1.34 | (5) $false % 4.70/1.34 | % 4.70/1.34 | CLOSE: (5) is inconsistent. % 4.70/1.34 | % 4.70/1.35 End of proof % 4.70/1.35 % SZS output end Proof for theBenchmark % 4.70/1.35 % 4.70/1.35 728ms %------------------------------------------------------------------------------