%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU295+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:43:54 EDT 2023 % Result : Theorem 8.69s 2.00s % Output : Proof 13.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SEU295+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n021.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 : Wed Aug 23 21:28:39 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/sandbox/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 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 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 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.98/1.13 Prover 4: Preprocessing ... % 2.98/1.13 Prover 1: Preprocessing ... % 2.98/1.17 Prover 0: Preprocessing ... % 2.98/1.17 Prover 2: Preprocessing ... % 2.98/1.17 Prover 6: Preprocessing ... % 2.98/1.17 Prover 3: Preprocessing ... % 2.98/1.17 Prover 5: Preprocessing ... % 6.56/1.66 Prover 1: Warning: ignoring some quantifiers % 6.56/1.69 Prover 5: Proving ... % 6.56/1.69 Prover 2: Proving ... % 6.56/1.70 Prover 1: Constructing countermodel ... % 7.27/1.77 Prover 3: Warning: ignoring some quantifiers % 7.27/1.78 Prover 4: Warning: ignoring some quantifiers % 7.84/1.80 Prover 3: Constructing countermodel ... % 7.84/1.82 Prover 4: Constructing countermodel ... % 7.84/1.83 Prover 6: Proving ... % 8.50/1.88 Prover 0: Proving ... % 8.69/2.00 Prover 3: proved (1366ms) % 8.69/2.00 % 8.69/2.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.69/2.00 % 8.69/2.00 Prover 0: stopped % 8.69/2.00 Prover 6: stopped % 8.69/2.02 Prover 5: stopped % 9.31/2.02 Prover 2: stopped % 9.31/2.02 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.31/2.02 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.31/2.02 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.31/2.02 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.31/2.02 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.31/2.11 Prover 10: Preprocessing ... % 10.15/2.14 Prover 11: Preprocessing ... % 10.15/2.14 Prover 13: Preprocessing ... % 10.15/2.14 Prover 8: Preprocessing ... % 10.15/2.15 Prover 7: Preprocessing ... % 10.78/2.26 Prover 7: Warning: ignoring some quantifiers % 10.78/2.28 Prover 10: Warning: ignoring some quantifiers % 11.47/2.29 Prover 7: Constructing countermodel ... % 11.47/2.29 Prover 10: Constructing countermodel ... % 11.47/2.29 Prover 13: Warning: ignoring some quantifiers % 11.61/2.31 Prover 13: Constructing countermodel ... % 11.74/2.39 Prover 8: Warning: ignoring some quantifiers % 12.49/2.42 Prover 8: Constructing countermodel ... % 12.49/2.48 Prover 11: Warning: ignoring some quantifiers % 13.12/2.49 Prover 11: Constructing countermodel ... % 13.12/2.50 Prover 10: Found proof (size 4) % 13.12/2.50 Prover 10: proved (486ms) % 13.12/2.50 Prover 7: stopped % 13.12/2.50 Prover 8: stopped % 13.12/2.50 Prover 13: Found proof (size 4) % 13.12/2.50 Prover 13: proved (482ms) % 13.12/2.51 Prover 4: stopped % 13.12/2.51 Prover 1: stopped % 13.12/2.52 Prover 11: stopped % 13.12/2.52 % 13.12/2.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.12/2.52 % 13.12/2.52 % SZS output start Proof for theBenchmark % 13.12/2.53 Assumptions after simplification: % 13.12/2.53 --------------------------------- % 13.12/2.53 % 13.12/2.53 (fc11_finset_1) % 13.12/2.55 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2) % 13.12/2.55 | ~ $i(v1) | ~ $i(v0) | ~ finite(v0) | finite(v2)) % 13.12/2.55 % 13.12/2.55 (t15_finset_1) % 13.12/2.55 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (set_intersection2(v0, v1) = v2 & % 13.12/2.55 $i(v2) & $i(v1) & $i(v0) & finite(v0) & ~ finite(v2)) % 13.12/2.55 % 13.12/2.55 Further assumptions not needed in the proof: % 13.12/2.55 -------------------------------------------- % 13.12/2.55 antisymmetry_r2_hidden, cc1_arytm_3, cc1_finset_1, cc1_funct_1, cc1_ordinal1, % 13.12/2.55 cc1_relat_1, cc2_arytm_3, cc2_finset_1, cc2_funct_1, cc2_ordinal1, cc3_ordinal1, % 13.12/2.55 commutativity_k3_xboole_0, dt_k1_xboole_0, dt_k1_zfmisc_1, dt_k3_xboole_0, % 13.12/2.55 dt_m1_subset_1, existence_m1_subset_1, fc10_finset_1, fc12_relat_1, fc1_relat_1, % 13.12/2.55 fc1_subset_1, fc1_xboole_0, fc2_ordinal1, fc4_relat_1, idempotence_k3_xboole_0, % 13.12/2.55 rc1_arytm_3, rc1_finset_1, rc1_funct_1, rc1_ordinal1, rc1_relat_1, rc1_subset_1, % 13.12/2.55 rc1_xboole_0, rc2_finset_1, rc2_funct_1, rc2_ordinal1, rc2_relat_1, % 13.12/2.55 rc2_subset_1, rc2_xboole_0, rc3_finset_1, rc3_funct_1, rc3_ordinal1, % 13.12/2.55 rc3_relat_1, rc4_funct_1, reflexivity_r1_tarski, t13_finset_1, t17_xboole_1, % 13.12/2.55 t1_subset, t2_boole, t2_subset, t3_subset, t4_subset, t5_subset, t6_boole, % 13.12/2.55 t7_boole, t8_boole % 13.12/2.55 % 13.12/2.55 Those formulas are unsatisfiable: % 13.12/2.55 --------------------------------- % 13.12/2.55 % 13.12/2.55 Begin of proof % 13.12/2.55 | % 13.12/2.56 | DELTA: instantiating (t15_finset_1) with fresh symbols all_62_0, all_62_1, % 13.12/2.56 | all_62_2 gives: % 13.12/2.56 | (1) set_intersection2(all_62_2, all_62_1) = all_62_0 & $i(all_62_0) & % 13.12/2.56 | $i(all_62_1) & $i(all_62_2) & finite(all_62_2) & ~ finite(all_62_0) % 13.12/2.56 | % 13.12/2.56 | ALPHA: (1) implies: % 13.12/2.56 | (2) ~ finite(all_62_0) % 13.12/2.56 | (3) finite(all_62_2) % 13.12/2.56 | (4) $i(all_62_2) % 13.12/2.56 | (5) $i(all_62_1) % 13.12/2.56 | (6) set_intersection2(all_62_2, all_62_1) = all_62_0 % 13.12/2.56 | % 13.12/2.56 | GROUND_INST: instantiating (fc11_finset_1) with all_62_2, all_62_1, all_62_0, % 13.12/2.56 | simplifying with (2), (3), (4), (5), (6) gives: % 13.12/2.56 | (7) $false % 13.12/2.56 | % 13.12/2.56 | CLOSE: (7) is inconsistent. % 13.12/2.56 | % 13.12/2.56 End of proof % 13.12/2.56 % SZS output end Proof for theBenchmark % 13.12/2.56 % 13.12/2.56 1964ms %------------------------------------------------------------------------------