%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET907+1 : 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 15:26:58 EDT 2023 % Result : Theorem 5.22s 1.39s % Output : Proof 6.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET907+1 : TPTP v8.1.2. Released v3.2.0. % 0.11/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n017.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sat Aug 26 08:49:40 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.61 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 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 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 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.23/0.97 Prover 4: Preprocessing ... % 2.23/0.97 Prover 1: Preprocessing ... % 2.23/1.01 Prover 6: Preprocessing ... % 2.23/1.01 Prover 5: Preprocessing ... % 2.23/1.01 Prover 0: Preprocessing ... % 2.23/1.01 Prover 2: Preprocessing ... % 2.23/1.01 Prover 3: Preprocessing ... % 3.69/1.22 Prover 1: Warning: ignoring some quantifiers % 3.69/1.22 Prover 3: Warning: ignoring some quantifiers % 3.69/1.23 Prover 6: Proving ... % 3.69/1.23 Prover 0: Proving ... % 3.69/1.23 Prover 1: Constructing countermodel ... % 3.69/1.23 Prover 5: Proving ... % 3.69/1.23 Prover 2: Proving ... % 3.69/1.23 Prover 3: Constructing countermodel ... % 3.69/1.23 Prover 4: Constructing countermodel ... % 5.22/1.39 Prover 5: proved (767ms) % 5.22/1.39 % 5.22/1.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.22/1.39 % 5.22/1.39 Prover 3: stopped % 5.22/1.39 Prover 2: stopped % 5.22/1.39 Prover 0: stopped % 5.22/1.39 Prover 6: stopped % 5.22/1.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.22/1.39 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.22/1.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.22/1.39 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.22/1.39 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.22/1.41 Prover 13: Preprocessing ... % 5.22/1.42 Prover 11: Preprocessing ... % 5.49/1.42 Prover 10: Preprocessing ... % 5.56/1.44 Prover 8: Preprocessing ... % 5.56/1.44 Prover 7: Preprocessing ... % 5.56/1.47 Prover 13: Warning: ignoring some quantifiers % 5.56/1.47 Prover 10: Warning: ignoring some quantifiers % 5.56/1.48 Prover 10: Constructing countermodel ... % 5.56/1.48 Prover 13: Constructing countermodel ... % 5.56/1.48 Prover 7: Warning: ignoring some quantifiers % 5.56/1.48 Prover 7: Constructing countermodel ... % 5.56/1.50 Prover 11: Constructing countermodel ... % 6.14/1.52 Prover 10: Found proof (size 9) % 6.14/1.52 Prover 10: proved (124ms) % 6.14/1.52 Prover 11: stopped % 6.14/1.52 Prover 7: stopped % 6.14/1.52 Prover 1: stopped % 6.14/1.52 Prover 8: Warning: ignoring some quantifiers % 6.14/1.52 Prover 13: stopped % 6.14/1.52 Prover 4: stopped % 6.14/1.53 Prover 8: Constructing countermodel ... % 6.14/1.53 Prover 8: stopped % 6.14/1.53 % 6.14/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.14/1.53 % 6.14/1.53 % SZS output start Proof for theBenchmark % 6.14/1.54 Assumptions after simplification: % 6.14/1.54 --------------------------------- % 6.14/1.54 % 6.14/1.54 (commutativity_k2_tarski) % 6.14/1.56 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = v2) | % 6.14/1.56 ~ $i(v1) | ~ $i(v0) | (unordered_pair(v1, v0) = v2 & $i(v2))) % 6.14/1.56 % 6.14/1.56 (t12_xboole_1) % 6.14/1.56 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (set_union2(v0, v1) = % 6.14/1.56 v2) | ~ $i(v1) | ~ $i(v0) | ~ subset(v0, v1)) % 6.14/1.57 % 6.14/1.57 (t38_zfmisc_1) % 6.14/1.57 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 6.14/1.57 (unordered_pair(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 6.14/1.57 subset(v3, v2) | in(v1, v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 6.14/1.57 [v3: $i] : ( ~ (unordered_pair(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 6.14/1.57 $i(v0) | ~ subset(v3, v2) | in(v0, v2)) & ! [v0: $i] : ! [v1: $i] : ! % 6.14/1.57 [v2: $i] : ! [v3: $i] : ( ~ (unordered_pair(v0, v1) = v3) | ~ $i(v2) | ~ % 6.14/1.57 $i(v1) | ~ $i(v0) | ~ in(v1, v2) | ~ in(v0, v2) | subset(v3, v2)) % 6.14/1.57 % 6.14/1.57 (t48_zfmisc_1) % 6.49/1.57 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ( ~ (v4 % 6.49/1.57 = v1) & set_union2(v3, v1) = v4 & unordered_pair(v0, v2) = v3 & $i(v4) & % 6.49/1.57 $i(v3) & $i(v2) & $i(v1) & $i(v0) & in(v2, v1) & in(v0, v1)) % 6.49/1.57 % 6.49/1.57 Further assumptions not needed in the proof: % 6.49/1.57 -------------------------------------------- % 6.49/1.57 antisymmetry_r2_hidden, commutativity_k2_xboole_0, fc2_xboole_0, fc3_xboole_0, % 6.49/1.57 idempotence_k2_xboole_0, rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski % 6.49/1.57 % 6.49/1.57 Those formulas are unsatisfiable: % 6.49/1.57 --------------------------------- % 6.49/1.57 % 6.49/1.57 Begin of proof % 6.49/1.57 | % 6.49/1.58 | ALPHA: (t38_zfmisc_1) implies: % 6.49/1.58 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 6.49/1.58 | (unordered_pair(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 6.49/1.58 | ~ in(v1, v2) | ~ in(v0, v2) | subset(v3, v2)) % 6.49/1.58 | % 6.49/1.58 | DELTA: instantiating (t48_zfmisc_1) with fresh symbols all_16_0, all_16_1, % 6.49/1.58 | all_16_2, all_16_3, all_16_4 gives: % 6.49/1.58 | (2) ~ (all_16_0 = all_16_3) & set_union2(all_16_1, all_16_3) = all_16_0 & % 6.49/1.58 | unordered_pair(all_16_4, all_16_2) = all_16_1 & $i(all_16_0) & % 6.49/1.58 | $i(all_16_1) & $i(all_16_2) & $i(all_16_3) & $i(all_16_4) & % 6.49/1.58 | in(all_16_2, all_16_3) & in(all_16_4, all_16_3) % 6.49/1.58 | % 6.49/1.58 | ALPHA: (2) implies: % 6.49/1.58 | (3) ~ (all_16_0 = all_16_3) % 6.49/1.58 | (4) in(all_16_4, all_16_3) % 6.49/1.58 | (5) in(all_16_2, all_16_3) % 6.49/1.58 | (6) $i(all_16_4) % 6.49/1.58 | (7) $i(all_16_3) % 6.49/1.58 | (8) $i(all_16_2) % 6.49/1.58 | (9) unordered_pair(all_16_4, all_16_2) = all_16_1 % 6.49/1.58 | (10) set_union2(all_16_1, all_16_3) = all_16_0 % 6.49/1.58 | % 6.49/1.59 | GROUND_INST: instantiating (1) with all_16_4, all_16_2, all_16_3, all_16_1, % 6.49/1.59 | simplifying with (4), (5), (6), (7), (8), (9) gives: % 6.49/1.59 | (11) subset(all_16_1, all_16_3) % 6.49/1.59 | % 6.49/1.59 | GROUND_INST: instantiating (commutativity_k2_tarski) with all_16_4, all_16_2, % 6.49/1.59 | all_16_1, simplifying with (6), (8), (9) gives: % 6.49/1.59 | (12) unordered_pair(all_16_2, all_16_4) = all_16_1 & $i(all_16_1) % 6.49/1.59 | % 6.49/1.59 | ALPHA: (12) implies: % 6.49/1.59 | (13) $i(all_16_1) % 6.49/1.59 | % 6.49/1.59 | GROUND_INST: instantiating (t12_xboole_1) with all_16_1, all_16_3, all_16_0, % 6.49/1.59 | simplifying with (7), (10), (11), (13) gives: % 6.49/1.59 | (14) all_16_0 = all_16_3 % 6.49/1.59 | % 6.49/1.59 | REDUCE: (3), (14) imply: % 6.49/1.59 | (15) $false % 6.49/1.59 | % 6.49/1.59 | CLOSE: (15) is inconsistent. % 6.49/1.59 | % 6.49/1.59 End of proof % 6.49/1.59 % SZS output end Proof for theBenchmark % 6.49/1.59 % 6.49/1.59 993ms %------------------------------------------------------------------------------