%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU148+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n021.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:47 EDT 2023 % Result : Theorem 4.45s 1.45s % Output : Proof 6.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU148+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n021.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 : Wed Aug 23 16:48:54 EDT 2023 % 0.14/0.34 % CPUTime : % 0.21/0.64 ________ _____ % 0.21/0.64 ___ __ \_________(_)________________________________ % 0.21/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.64 % 0.21/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.64 (2023-06-19) % 0.21/0.64 % 0.21/0.64 (c) Philipp Rümmer, 2009-2023 % 0.21/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.64 Amanda Stjerna. % 0.21/0.64 Free software under BSD-3-Clause. % 0.21/0.64 % 0.21/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.64 % 0.21/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.66 Running up to 7 provers in parallel. % 0.21/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.67/1.06 Prover 4: Preprocessing ... % 1.67/1.06 Prover 1: Preprocessing ... % 2.52/1.10 Prover 3: Preprocessing ... % 2.52/1.10 Prover 2: Preprocessing ... % 2.52/1.10 Prover 5: Preprocessing ... % 2.52/1.10 Prover 0: Preprocessing ... % 2.52/1.11 Prover 6: Preprocessing ... % 3.29/1.26 Prover 4: Warning: ignoring some quantifiers % 3.29/1.26 Prover 1: Warning: ignoring some quantifiers % 3.77/1.28 Prover 3: Warning: ignoring some quantifiers % 3.77/1.28 Prover 1: Constructing countermodel ... % 3.77/1.29 Prover 4: Constructing countermodel ... % 3.77/1.29 Prover 6: Proving ... % 3.77/1.29 Prover 0: Proving ... % 3.77/1.29 Prover 5: Proving ... % 3.77/1.29 Prover 3: Constructing countermodel ... % 3.77/1.29 Prover 2: Proving ... % 4.45/1.44 Prover 5: proved (775ms) % 4.45/1.44 Prover 2: proved (778ms) % 4.45/1.45 % 4.45/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.45/1.45 % 4.45/1.45 % 4.45/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.45/1.45 % 4.45/1.45 Prover 3: stopped % 4.45/1.45 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.45/1.45 Prover 6: stopped % 4.45/1.45 Prover 0: stopped % 4.45/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.45/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.45/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.45/1.46 Prover 7: Preprocessing ... % 4.45/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.45/1.47 Prover 11: Preprocessing ... % 4.45/1.47 Prover 8: Preprocessing ... % 4.45/1.48 Prover 13: Preprocessing ... % 4.45/1.48 Prover 10: Preprocessing ... % 4.45/1.51 Prover 10: Warning: ignoring some quantifiers % 4.45/1.51 Prover 10: Constructing countermodel ... % 4.45/1.51 Prover 13: Warning: ignoring some quantifiers % 5.16/1.52 Prover 13: Constructing countermodel ... % 5.16/1.53 Prover 7: Warning: ignoring some quantifiers % 5.16/1.53 Prover 7: Constructing countermodel ... % 5.16/1.53 Prover 11: Warning: ignoring some quantifiers % 5.16/1.54 Prover 11: Constructing countermodel ... % 5.16/1.54 Prover 1: gave up % 5.16/1.55 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.16/1.55 Prover 8: Warning: ignoring some quantifiers % 5.80/1.56 Prover 16: Preprocessing ... % 5.83/1.56 Prover 8: Constructing countermodel ... % 5.83/1.57 Prover 4: gave up % 5.83/1.57 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 5.83/1.58 Prover 19: Preprocessing ... % 5.83/1.59 Prover 7: Found proof (size 17) % 5.83/1.59 Prover 7: proved (149ms) % 5.83/1.60 Prover 8: stopped % 5.83/1.60 Prover 11: stopped % 5.83/1.60 Prover 10: stopped % 5.83/1.60 Prover 13: stopped % 6.15/1.60 Prover 16: Warning: ignoring some quantifiers % 6.15/1.61 Prover 16: Constructing countermodel ... % 6.15/1.61 Prover 16: stopped % 6.15/1.63 Prover 19: Warning: ignoring some quantifiers % 6.15/1.64 Prover 19: Constructing countermodel ... % 6.36/1.64 Prover 19: stopped % 6.36/1.64 % 6.36/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.36/1.64 % 6.36/1.65 % SZS output start Proof for theBenchmark % 6.36/1.65 Assumptions after simplification: % 6.36/1.65 --------------------------------- % 6.36/1.65 % 6.36/1.65 (d1_tarski) % 6.36/1.68 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v0) = v1) | % 6.36/1.68 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v2, v1)) & ? [v0: $i] : ! [v1: % 6.36/1.68 $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v1) = v2) | ~ $i(v1) | ~ % 6.36/1.68 $i(v0) | ? [v3: $i] : ($i(v3) & ( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | % 6.36/1.68 in(v3, v0)))) & ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | % 6.36/1.68 ~ $i(v1) | ~ $i(v0) | in(v0, v1)) % 6.36/1.68 % 6.36/1.68 (l1_zfmisc_1) % 6.36/1.68 $i(empty_set) & ! [v0: $i] : ( ~ (singleton(v0) = empty_set) | ~ $i(v0)) % 6.36/1.68 % 6.36/1.68 (l4_zfmisc_1) % 6.36/1.69 $i(empty_set) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | v0 = % 6.36/1.69 empty_set | ~ (singleton(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ subset(v0, % 6.36/1.69 v2)) & ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v1) = v0) | ~ $i(v1) | % 6.36/1.69 ~ $i(v0) | subset(v0, v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) % 6.36/1.69 = v1) | ~ $i(v0) | subset(empty_set, v1)) % 6.36/1.69 % 6.36/1.69 (t6_zfmisc_1) % 6.36/1.69 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v1 = v0) & % 6.36/1.69 singleton(v1) = v3 & singleton(v0) = v2 & $i(v3) & $i(v2) & $i(v1) & $i(v0) % 6.36/1.69 & subset(v2, v3)) % 6.36/1.69 % 6.36/1.69 Further assumptions not needed in the proof: % 6.36/1.69 -------------------------------------------- % 6.36/1.69 antisymmetry_r2_hidden, dt_k1_tarski, dt_k1_xboole_0, fc1_xboole_0, % 6.36/1.69 rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski % 6.36/1.69 % 6.36/1.69 Those formulas are unsatisfiable: % 6.36/1.69 --------------------------------- % 6.36/1.69 % 6.36/1.69 Begin of proof % 6.36/1.69 | % 6.36/1.69 | ALPHA: (d1_tarski) implies: % 6.36/1.69 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ % 6.36/1.69 | $i(v0) | in(v0, v1)) % 6.36/1.70 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v0) % 6.36/1.70 | = v1) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v2, v1)) % 6.36/1.70 | % 6.36/1.70 | ALPHA: (l1_zfmisc_1) implies: % 6.36/1.70 | (3) ! [v0: $i] : ( ~ (singleton(v0) = empty_set) | ~ $i(v0)) % 6.36/1.70 | % 6.36/1.70 | ALPHA: (l4_zfmisc_1) implies: % 6.36/1.70 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | v0 = empty_set | % 6.36/1.70 | ~ (singleton(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ subset(v0, v2)) % 6.36/1.70 | % 6.36/1.70 | DELTA: instantiating (t6_zfmisc_1) with fresh symbols all_13_0, all_13_1, % 6.36/1.70 | all_13_2, all_13_3 gives: % 6.36/1.70 | (5) ~ (all_13_2 = all_13_3) & singleton(all_13_2) = all_13_0 & % 6.36/1.70 | singleton(all_13_3) = all_13_1 & $i(all_13_0) & $i(all_13_1) & % 6.36/1.70 | $i(all_13_2) & $i(all_13_3) & subset(all_13_1, all_13_0) % 6.36/1.70 | % 6.36/1.70 | ALPHA: (5) implies: % 6.36/1.70 | (6) ~ (all_13_2 = all_13_3) % 6.36/1.70 | (7) subset(all_13_1, all_13_0) % 6.36/1.70 | (8) $i(all_13_3) % 6.36/1.70 | (9) $i(all_13_2) % 6.36/1.70 | (10) $i(all_13_1) % 6.36/1.70 | (11) $i(all_13_0) % 6.36/1.70 | (12) singleton(all_13_3) = all_13_1 % 6.36/1.70 | (13) singleton(all_13_2) = all_13_0 % 6.36/1.70 | % 6.36/1.70 | GROUND_INST: instantiating (3) with all_13_3, simplifying with (8) gives: % 6.36/1.70 | (14) ~ (singleton(all_13_3) = empty_set) % 6.36/1.70 | % 6.36/1.70 | GROUND_INST: instantiating (1) with all_13_3, all_13_1, simplifying with (8), % 6.36/1.70 | (10), (12) gives: % 6.36/1.70 | (15) in(all_13_3, all_13_1) % 6.36/1.70 | % 6.36/1.71 | GROUND_INST: instantiating (4) with all_13_1, all_13_2, all_13_0, simplifying % 6.36/1.71 | with (7), (9), (10), (13) gives: % 6.36/1.71 | (16) all_13_0 = all_13_1 | all_13_1 = empty_set % 6.36/1.71 | % 6.36/1.71 | PRED_UNIFY: (12), (14) imply: % 6.36/1.71 | (17) ~ (all_13_1 = empty_set) % 6.36/1.71 | % 6.36/1.71 | BETA: splitting (16) gives: % 6.36/1.71 | % 6.36/1.71 | Case 1: % 6.36/1.71 | | % 6.36/1.71 | | (18) all_13_1 = empty_set % 6.36/1.71 | | % 6.36/1.71 | | REDUCE: (17), (18) imply: % 6.36/1.71 | | (19) $false % 6.36/1.71 | | % 6.36/1.71 | | CLOSE: (19) is inconsistent. % 6.36/1.71 | | % 6.36/1.71 | Case 2: % 6.36/1.71 | | % 6.36/1.71 | | (20) all_13_0 = all_13_1 % 6.36/1.71 | | % 6.36/1.71 | | REDUCE: (13), (20) imply: % 6.36/1.71 | | (21) singleton(all_13_2) = all_13_1 % 6.36/1.71 | | % 6.36/1.71 | | GROUND_INST: instantiating (2) with all_13_2, all_13_1, all_13_3, % 6.36/1.71 | | simplifying with (8), (9), (10), (15), (21) gives: % 6.36/1.71 | | (22) all_13_2 = all_13_3 % 6.36/1.71 | | % 6.36/1.71 | | REDUCE: (6), (22) imply: % 6.36/1.71 | | (23) $false % 6.36/1.71 | | % 6.36/1.71 | | CLOSE: (23) is inconsistent. % 6.36/1.71 | | % 6.36/1.71 | End of split % 6.36/1.71 | % 6.36/1.71 End of proof % 6.36/1.71 % SZS output end Proof for theBenchmark % 6.36/1.71 % 6.36/1.71 1066ms %------------------------------------------------------------------------------