%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU150+3 : TPTP v8.1.2. Released v3.2.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 : Thu Aug 31 17:42:48 EDT 2023 % Result : Theorem 3.66s 1.24s % Output : Proof 4.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SEU150+3 : TPTP v8.1.2. Released v3.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n017.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.21/0.35 % CPULimit : 300 % 0.21/0.35 % WCLimit : 300 % 0.21/0.35 % DateTime : Wed Aug 23 16:43:38 EDT 2023 % 0.21/0.35 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.64 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.90/0.97 Prover 1: Preprocessing ... % 1.90/0.97 Prover 4: Preprocessing ... % 1.90/1.02 Prover 3: Preprocessing ... % 1.90/1.02 Prover 6: Preprocessing ... % 1.90/1.02 Prover 2: Preprocessing ... % 1.90/1.02 Prover 5: Preprocessing ... % 1.90/1.02 Prover 0: Preprocessing ... % 2.87/1.12 Prover 0: Proving ... % 2.87/1.12 Prover 4: Constructing countermodel ... % 2.87/1.12 Prover 5: Proving ... % 2.87/1.13 Prover 6: Constructing countermodel ... % 2.87/1.13 Prover 3: Constructing countermodel ... % 2.87/1.13 Prover 2: Proving ... % 2.87/1.13 Prover 1: Constructing countermodel ... % 3.66/1.24 Prover 3: proved (594ms) % 3.66/1.24 % 3.66/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.66/1.24 % 3.66/1.24 Prover 6: stopped % 3.66/1.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.94/1.24 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.94/1.25 Prover 2: proved (601ms) % 3.94/1.25 Prover 0: proved (604ms) % 3.94/1.25 % 3.94/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.94/1.25 % 3.94/1.25 Prover 5: proved (600ms) % 3.94/1.25 % 3.94/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.94/1.25 % 3.94/1.25 % 3.94/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.94/1.25 % 3.94/1.25 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.94/1.25 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.94/1.25 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.94/1.26 Prover 7: Preprocessing ... % 3.94/1.27 Prover 11: Preprocessing ... % 3.94/1.27 Prover 1: Found proof (size 11) % 3.94/1.27 Prover 1: proved (627ms) % 3.94/1.27 Prover 8: Preprocessing ... % 3.94/1.27 Prover 4: Found proof (size 12) % 3.94/1.27 Prover 4: proved (626ms) % 3.94/1.27 Prover 10: Preprocessing ... % 3.94/1.28 Prover 13: Preprocessing ... % 3.94/1.31 Prover 11: Constructing countermodel ... % 3.94/1.31 Prover 7: Constructing countermodel ... % 3.94/1.31 Prover 11: stopped % 3.94/1.31 Prover 10: Constructing countermodel ... % 3.94/1.31 Prover 10: stopped % 3.94/1.31 Prover 7: stopped % 3.94/1.32 Prover 13: Warning: ignoring some quantifiers % 3.94/1.32 Prover 8: Warning: ignoring some quantifiers % 3.94/1.32 Prover 13: Constructing countermodel ... % 3.94/1.32 Prover 8: Constructing countermodel ... % 3.94/1.32 Prover 13: stopped % 3.94/1.32 Prover 8: stopped % 3.94/1.32 % 3.94/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.94/1.32 % 3.94/1.33 % SZS output start Proof for theBenchmark % 3.94/1.33 Assumptions after simplification: % 3.94/1.33 --------------------------------- % 3.94/1.33 % 3.94/1.33 (commutativity_k2_tarski) % 4.49/1.36 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = v2) | % 4.49/1.36 ~ $i(v1) | ~ $i(v0) | (unordered_pair(v1, v0) = v2 & $i(v2))) % 4.49/1.36 % 4.49/1.36 (t8_zfmisc_1) % 4.49/1.36 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 4.49/1.36 (singleton(v0) = v3) | ~ (unordered_pair(v1, v2) = v3) | ~ $i(v2) | ~ % 4.49/1.36 $i(v1) | ~ $i(v0)) % 4.49/1.36 % 4.49/1.36 (t9_zfmisc_1) % 4.49/1.37 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v2 = v1) & % 4.49/1.37 singleton(v0) = v3 & unordered_pair(v1, v2) = v3 & $i(v3) & $i(v2) & $i(v1) % 4.49/1.37 & $i(v0)) % 4.49/1.37 % 4.49/1.37 Further assumptions not needed in the proof: % 4.49/1.37 -------------------------------------------- % 4.49/1.37 rc1_xboole_0, rc2_xboole_0 % 4.49/1.37 % 4.49/1.37 Those formulas are unsatisfiable: % 4.49/1.37 --------------------------------- % 4.49/1.37 % 4.49/1.37 Begin of proof % 4.49/1.37 | % 4.49/1.37 | DELTA: instantiating (t9_zfmisc_1) with fresh symbols all_9_0, all_9_1, % 4.49/1.37 | all_9_2, all_9_3 gives: % 4.49/1.37 | (1) ~ (all_9_1 = all_9_2) & singleton(all_9_3) = all_9_0 & % 4.49/1.37 | unordered_pair(all_9_2, all_9_1) = all_9_0 & $i(all_9_0) & $i(all_9_1) % 4.49/1.37 | & $i(all_9_2) & $i(all_9_3) % 4.49/1.37 | % 4.49/1.37 | ALPHA: (1) implies: % 4.49/1.37 | (2) ~ (all_9_1 = all_9_2) % 4.49/1.37 | (3) $i(all_9_3) % 4.49/1.37 | (4) $i(all_9_2) % 4.49/1.37 | (5) $i(all_9_1) % 4.49/1.37 | (6) unordered_pair(all_9_2, all_9_1) = all_9_0 % 4.49/1.37 | (7) singleton(all_9_3) = all_9_0 % 4.49/1.37 | % 4.49/1.38 | GROUND_INST: instantiating (commutativity_k2_tarski) with all_9_2, all_9_1, % 4.49/1.38 | all_9_0, simplifying with (4), (5), (6) gives: % 4.49/1.38 | (8) unordered_pair(all_9_1, all_9_2) = all_9_0 & $i(all_9_0) % 4.49/1.38 | % 4.49/1.38 | ALPHA: (8) implies: % 4.49/1.38 | (9) unordered_pair(all_9_1, all_9_2) = all_9_0 % 4.49/1.38 | % 4.49/1.38 | GROUND_INST: instantiating (t8_zfmisc_1) with all_9_3, all_9_2, all_9_1, % 4.49/1.38 | all_9_0, simplifying with (3), (4), (5), (6), (7) gives: % 4.49/1.38 | (10) all_9_2 = all_9_3 % 4.49/1.38 | % 4.49/1.38 | REDUCE: (2), (10) imply: % 4.49/1.38 | (11) ~ (all_9_1 = all_9_3) % 4.49/1.38 | % 4.49/1.38 | REDUCE: (9), (10) imply: % 4.49/1.38 | (12) unordered_pair(all_9_1, all_9_3) = all_9_0 % 4.49/1.38 | % 4.49/1.38 | GROUND_INST: instantiating (t8_zfmisc_1) with all_9_3, all_9_1, all_9_3, % 4.49/1.38 | all_9_0, simplifying with (3), (5), (7), (12) gives: % 4.49/1.38 | (13) all_9_1 = all_9_3 % 4.49/1.38 | % 4.49/1.38 | REDUCE: (11), (13) imply: % 4.49/1.38 | (14) $false % 4.49/1.38 | % 4.49/1.38 | CLOSE: (14) is inconsistent. % 4.49/1.38 | % 4.49/1.38 End of proof % 4.49/1.38 % SZS output end Proof for theBenchmark % 4.49/1.38 % 4.49/1.38 759ms %------------------------------------------------------------------------------