%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET876+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:52 EDT 2023 % Result : Theorem 3.67s 1.31s % Output : Proof 5.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET876+1 : TPTP v8.1.2. Released v3.2.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sat Aug 26 15:44:11 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.80/0.94 Prover 4: Preprocessing ... % 1.80/0.94 Prover 1: Preprocessing ... % 2.26/0.98 Prover 0: Preprocessing ... % 2.26/0.98 Prover 6: Preprocessing ... % 2.26/0.98 Prover 5: Preprocessing ... % 2.26/0.98 Prover 2: Preprocessing ... % 2.26/0.99 Prover 3: Preprocessing ... % 3.16/1.14 Prover 1: Warning: ignoring some quantifiers % 3.16/1.14 Prover 3: Warning: ignoring some quantifiers % 3.16/1.15 Prover 4: Warning: ignoring some quantifiers % 3.16/1.15 Prover 2: Proving ... % 3.16/1.15 Prover 3: Constructing countermodel ... % 3.16/1.15 Prover 4: Constructing countermodel ... % 3.16/1.16 Prover 5: Proving ... % 3.16/1.16 Prover 6: Proving ... % 3.16/1.16 Prover 1: Constructing countermodel ... % 3.16/1.19 Prover 0: Proving ... % 3.67/1.31 Prover 3: proved (694ms) % 3.67/1.31 % 3.67/1.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.67/1.31 % 3.67/1.32 Prover 6: stopped % 3.67/1.32 Prover 2: stopped % 3.67/1.32 Prover 0: stopped % 3.67/1.33 Prover 5: stopped % 3.67/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.67/1.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.67/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.67/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.67/1.34 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.51/1.36 Prover 13: Preprocessing ... % 4.51/1.36 Prover 1: Found proof (size 12) % 4.51/1.36 Prover 10: Preprocessing ... % 4.51/1.36 Prover 1: proved (749ms) % 4.51/1.36 Prover 4: stopped % 4.51/1.36 Prover 11: Preprocessing ... % 4.51/1.36 Prover 8: Preprocessing ... % 4.51/1.37 Prover 7: Preprocessing ... % 4.51/1.38 Prover 13: stopped % 4.51/1.38 Prover 11: stopped % 4.51/1.39 Prover 10: Warning: ignoring some quantifiers % 4.51/1.39 Prover 7: Warning: ignoring some quantifiers % 4.51/1.39 Prover 10: Constructing countermodel ... % 4.51/1.39 Prover 7: Constructing countermodel ... % 4.51/1.40 Prover 10: stopped % 4.51/1.40 Prover 7: stopped % 4.51/1.41 Prover 8: Warning: ignoring some quantifiers % 4.51/1.41 Prover 8: Constructing countermodel ... % 4.51/1.41 Prover 8: stopped % 4.51/1.42 % 4.51/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.51/1.42 % 4.51/1.42 % SZS output start Proof for theBenchmark % 4.51/1.42 Assumptions after simplification: % 4.51/1.42 --------------------------------- % 4.51/1.42 % 4.51/1.42 (d1_tarski) % 5.19/1.45 ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v1) = v2) | % 5.19/1.45 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: any] : (in(v3, v0) = v4 & % 5.19/1.45 $i(v3) & ( ~ (v4 = 0) | ~ (v3 = v1)) & (v4 = 0 | v3 = v1))) & ! [v0: $i] % 5.19/1.45 : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ( ! [v2: % 5.19/1.45 $i] : (v2 = v0 | ~ (in(v2, v1) = 0) | ~ $i(v2)) & ! [v2: int] : (v2 = % 5.19/1.45 0 | ~ (in(v0, v1) = v2)))) % 5.19/1.45 % 5.19/1.45 (l28_zfmisc_1) % 5.19/1.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 5.19/1.46 (disjoint(v2, v1) = v3) | ~ (singleton(v0) = v2) | ~ $i(v1) | ~ $i(v0) | % 5.19/1.46 in(v0, v1) = 0) % 5.19/1.46 % 5.19/1.46 (t17_zfmisc_1) % 5.19/1.46 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 5.19/1.46 = 0) & ~ (v1 = v0) & disjoint(v2, v3) = v4 & singleton(v1) = v3 & % 5.19/1.46 singleton(v0) = v2 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 5.19/1.46 % 5.19/1.46 Further assumptions not needed in the proof: % 5.19/1.46 -------------------------------------------- % 5.19/1.46 antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, symmetry_r1_xboole_0 % 5.19/1.46 % 5.19/1.46 Those formulas are unsatisfiable: % 5.19/1.46 --------------------------------- % 5.19/1.46 % 5.19/1.46 Begin of proof % 5.19/1.46 | % 5.28/1.46 | ALPHA: (d1_tarski) implies: % 5.28/1.46 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ % 5.28/1.46 | $i(v0) | ( ! [v2: $i] : (v2 = v0 | ~ (in(v2, v1) = 0) | ~ $i(v2)) & % 5.28/1.46 | ! [v2: int] : (v2 = 0 | ~ (in(v0, v1) = v2)))) % 5.28/1.46 | % 5.28/1.46 | DELTA: instantiating (t17_zfmisc_1) with fresh symbols all_11_0, all_11_1, % 5.28/1.46 | all_11_2, all_11_3, all_11_4 gives: % 5.28/1.47 | (2) ~ (all_11_0 = 0) & ~ (all_11_3 = all_11_4) & disjoint(all_11_2, % 5.28/1.47 | all_11_1) = all_11_0 & singleton(all_11_3) = all_11_1 & % 5.28/1.47 | singleton(all_11_4) = all_11_2 & $i(all_11_1) & $i(all_11_2) & % 5.28/1.47 | $i(all_11_3) & $i(all_11_4) % 5.28/1.47 | % 5.28/1.47 | ALPHA: (2) implies: % 5.28/1.47 | (3) ~ (all_11_3 = all_11_4) % 5.28/1.47 | (4) ~ (all_11_0 = 0) % 5.28/1.47 | (5) $i(all_11_4) % 5.28/1.47 | (6) $i(all_11_3) % 5.28/1.47 | (7) $i(all_11_1) % 5.28/1.47 | (8) singleton(all_11_4) = all_11_2 % 5.28/1.47 | (9) singleton(all_11_3) = all_11_1 % 5.28/1.47 | (10) disjoint(all_11_2, all_11_1) = all_11_0 % 5.28/1.47 | % 5.28/1.47 | GROUND_INST: instantiating (1) with all_11_3, all_11_1, simplifying with (6), % 5.28/1.47 | (7), (9) gives: % 5.28/1.47 | (11) ! [v0: any] : (v0 = all_11_3 | ~ (in(v0, all_11_1) = 0) | ~ $i(v0)) % 5.28/1.47 | & ! [v0: int] : (v0 = 0 | ~ (in(all_11_3, all_11_1) = v0)) % 5.28/1.47 | % 5.28/1.47 | ALPHA: (11) implies: % 5.28/1.47 | (12) ! [v0: any] : (v0 = all_11_3 | ~ (in(v0, all_11_1) = 0) | ~ $i(v0)) % 5.28/1.47 | % 5.28/1.47 | GROUND_INST: instantiating (l28_zfmisc_1) with all_11_4, all_11_1, all_11_2, % 5.28/1.47 | all_11_0, simplifying with (5), (7), (8), (10) gives: % 5.28/1.48 | (13) all_11_0 = 0 | in(all_11_4, all_11_1) = 0 % 5.28/1.48 | % 5.28/1.48 | BETA: splitting (13) gives: % 5.28/1.48 | % 5.28/1.48 | Case 1: % 5.28/1.48 | | % 5.28/1.48 | | (14) in(all_11_4, all_11_1) = 0 % 5.28/1.48 | | % 5.28/1.48 | | GROUND_INST: instantiating (12) with all_11_4, simplifying with (5), (14) % 5.28/1.48 | | gives: % 5.28/1.48 | | (15) all_11_3 = all_11_4 % 5.28/1.48 | | % 5.28/1.48 | | REDUCE: (3), (15) imply: % 5.28/1.48 | | (16) $false % 5.28/1.48 | | % 5.28/1.48 | | CLOSE: (16) is inconsistent. % 5.28/1.48 | | % 5.28/1.48 | Case 2: % 5.28/1.48 | | % 5.28/1.48 | | (17) all_11_0 = 0 % 5.28/1.48 | | % 5.28/1.48 | | REDUCE: (4), (17) imply: % 5.28/1.48 | | (18) $false % 5.28/1.48 | | % 5.28/1.48 | | CLOSE: (18) is inconsistent. % 5.28/1.48 | | % 5.28/1.48 | End of split % 5.28/1.48 | % 5.28/1.48 End of proof % 5.28/1.48 % SZS output end Proof for theBenchmark % 5.28/1.48 % 5.28/1.48 885ms %------------------------------------------------------------------------------