%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU295+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 : n009.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:55 EDT 2023 % Result : Theorem 9.05s 2.03s % Output : Proof 13.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SEU295+3 : TPTP v8.1.2. Released v3.2.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n009.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Wed Aug 23 18:27:51 EDT 2023 % 0.12/0.33 % CPUTime : % 0.18/0.58 ________ _____ % 0.18/0.58 ___ __ \_________(_)________________________________ % 0.18/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.58 (2023-06-19) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2023 % 0.18/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.58 Amanda Stjerna. % 0.18/0.58 Free software under BSD-3-Clause. % 0.18/0.58 % 0.18/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.59 Running up to 7 provers in parallel. % 0.18/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.01/1.13 Prover 1: Preprocessing ... % 3.01/1.13 Prover 4: Preprocessing ... % 3.64/1.17 Prover 6: Preprocessing ... % 3.64/1.17 Prover 2: Preprocessing ... % 3.64/1.17 Prover 0: Preprocessing ... % 3.64/1.17 Prover 3: Preprocessing ... % 3.64/1.17 Prover 5: Preprocessing ... % 6.84/1.64 Prover 5: Proving ... % 6.84/1.66 Prover 2: Proving ... % 7.12/1.71 Prover 1: Warning: ignoring some quantifiers % 7.66/1.73 Prover 3: Warning: ignoring some quantifiers % 7.66/1.75 Prover 3: Constructing countermodel ... % 7.66/1.75 Prover 6: Proving ... % 7.66/1.76 Prover 1: Constructing countermodel ... % 7.94/1.77 Prover 4: Warning: ignoring some quantifiers % 7.94/1.82 Prover 4: Constructing countermodel ... % 8.56/1.89 Prover 0: Proving ... % 9.05/2.03 Prover 3: proved (1428ms) % 9.05/2.03 % 9.05/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.05/2.03 % 9.05/2.03 Prover 6: stopped % 9.05/2.03 Prover 2: stopped % 9.05/2.04 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.05/2.04 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.05/2.04 Prover 0: stopped % 9.05/2.04 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.05/2.04 Prover 5: stopped % 9.05/2.06 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.05/2.06 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.71/2.14 Prover 11: Preprocessing ... % 9.71/2.14 Prover 7: Preprocessing ... % 10.73/2.16 Prover 10: Preprocessing ... % 10.73/2.16 Prover 8: Preprocessing ... % 10.73/2.17 Prover 13: Preprocessing ... % 11.40/2.24 Prover 7: Warning: ignoring some quantifiers % 11.40/2.25 Prover 10: Warning: ignoring some quantifiers % 11.40/2.25 Prover 7: Constructing countermodel ... % 11.40/2.27 Prover 10: Constructing countermodel ... % 11.88/2.33 Prover 13: Warning: ignoring some quantifiers % 11.88/2.34 Prover 13: Constructing countermodel ... % 12.30/2.37 Prover 8: Warning: ignoring some quantifiers % 12.30/2.39 Prover 8: Constructing countermodel ... % 12.30/2.44 Prover 10: Found proof (size 4) % 12.30/2.44 Prover 10: proved (399ms) % 12.30/2.44 Prover 8: stopped % 12.30/2.44 Prover 7: stopped % 12.30/2.44 Prover 4: stopped % 12.30/2.44 Prover 13: stopped % 12.30/2.44 Prover 1: stopped % 12.30/2.45 Prover 11: Warning: ignoring some quantifiers % 12.98/2.46 Prover 11: Constructing countermodel ... % 12.98/2.47 Prover 11: stopped % 12.98/2.47 % 12.98/2.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.98/2.47 % 12.98/2.47 % SZS output start Proof for theBenchmark % 12.98/2.48 Assumptions after simplification: % 12.98/2.48 --------------------------------- % 12.98/2.48 % 12.98/2.48 (fc11_finset_1) % 13.16/2.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2) % 13.16/2.50 | ~ $i(v1) | ~ $i(v0) | ~ finite(v0) | finite(v2)) % 13.16/2.50 % 13.16/2.50 (t15_finset_1) % 13.16/2.50 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (set_intersection2(v0, v1) = v2 & % 13.16/2.50 $i(v2) & $i(v1) & $i(v0) & finite(v0) & ~ finite(v2)) % 13.16/2.50 % 13.16/2.50 Further assumptions not needed in the proof: % 13.16/2.50 -------------------------------------------- % 13.16/2.50 antisymmetry_r2_hidden, cc1_arytm_3, cc1_finset_1, cc1_funct_1, cc1_ordinal1, % 13.16/2.50 cc1_relat_1, cc2_arytm_3, cc2_finset_1, cc2_funct_1, cc2_ordinal1, cc3_ordinal1, % 13.16/2.50 cc4_arytm_3, commutativity_k3_xboole_0, existence_m1_subset_1, fc10_finset_1, % 13.16/2.50 fc12_relat_1, fc1_relat_1, fc1_subset_1, fc1_xboole_0, fc2_ordinal1, % 13.16/2.51 fc4_relat_1, fc8_arytm_3, idempotence_k3_xboole_0, rc1_arytm_3, rc1_finset_1, % 13.16/2.51 rc1_funcop_1, rc1_funct_1, rc1_ordinal1, rc1_ordinal2, rc1_relat_1, % 13.16/2.51 rc1_subset_1, rc1_xboole_0, rc2_arytm_3, rc2_finset_1, rc2_funct_1, % 13.16/2.51 rc2_ordinal1, rc2_ordinal2, rc2_relat_1, rc2_subset_1, rc2_xboole_0, % 13.16/2.51 rc3_arytm_3, rc3_finset_1, rc3_funct_1, rc3_ordinal1, rc3_relat_1, rc4_funct_1, % 13.16/2.51 rc4_ordinal1, rc5_funct_1, reflexivity_r1_tarski, t13_finset_1, t17_xboole_1, % 13.16/2.51 t1_subset, t2_boole, t2_subset, t3_subset, t4_subset, t5_subset, t6_boole, % 13.16/2.51 t7_boole, t8_boole % 13.16/2.51 % 13.16/2.51 Those formulas are unsatisfiable: % 13.16/2.51 --------------------------------- % 13.16/2.51 % 13.16/2.51 Begin of proof % 13.16/2.51 | % 13.16/2.51 | DELTA: instantiating (t15_finset_1) with fresh symbols all_77_0, all_77_1, % 13.16/2.51 | all_77_2 gives: % 13.16/2.51 | (1) set_intersection2(all_77_2, all_77_1) = all_77_0 & $i(all_77_0) & % 13.16/2.51 | $i(all_77_1) & $i(all_77_2) & finite(all_77_2) & ~ finite(all_77_0) % 13.16/2.51 | % 13.16/2.51 | ALPHA: (1) implies: % 13.16/2.51 | (2) ~ finite(all_77_0) % 13.16/2.51 | (3) finite(all_77_2) % 13.16/2.51 | (4) $i(all_77_2) % 13.16/2.51 | (5) $i(all_77_1) % 13.16/2.51 | (6) set_intersection2(all_77_2, all_77_1) = all_77_0 % 13.16/2.51 | % 13.16/2.51 | GROUND_INST: instantiating (fc11_finset_1) with all_77_2, all_77_1, all_77_0, % 13.16/2.51 | simplifying with (2), (3), (4), (5), (6) gives: % 13.16/2.51 | (7) $false % 13.16/2.51 | % 13.16/2.51 | CLOSE: (7) is inconsistent. % 13.16/2.51 | % 13.16/2.51 End of proof % 13.16/2.51 % SZS output end Proof for theBenchmark % 13.16/2.51 % 13.16/2.51 1936ms %------------------------------------------------------------------------------