%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU193+2 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n018.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:10 EDT 2023 % Result : Theorem 26.11s 4.31s % Output : Proof 35.03s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SEU193+2 : TPTP v8.1.2. Released v3.3.0. % 0.12/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n018.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Wed Aug 23 14:01:57 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.60 ________ _____ % 0.21/0.60 ___ __ \_________(_)________________________________ % 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.60 (2023-06-19) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2023 % 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.60 Amanda Stjerna. % 0.21/0.60 Free software under BSD-3-Clause. % 0.21/0.60 % 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.60 % 0.21/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.61 Running up to 7 provers in parallel. % 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.64/1.39 Prover 1: Preprocessing ... % 4.64/1.41 Prover 4: Preprocessing ... % 4.64/1.45 Prover 0: Preprocessing ... % 4.64/1.45 Prover 3: Preprocessing ... % 4.64/1.45 Prover 5: Preprocessing ... % 4.64/1.45 Prover 6: Preprocessing ... % 4.64/1.47 Prover 2: Preprocessing ... % 15.48/2.87 Prover 1: Warning: ignoring some quantifiers % 16.80/3.02 Prover 1: Constructing countermodel ... % 17.02/3.06 Prover 3: Warning: ignoring some quantifiers % 17.02/3.07 Prover 6: Proving ... % 17.02/3.09 Prover 3: Constructing countermodel ... % 17.02/3.12 Prover 5: Proving ... % 18.89/3.30 Prover 4: Warning: ignoring some quantifiers % 18.89/3.31 Prover 2: Proving ... % 18.89/3.43 Prover 4: Constructing countermodel ... % 18.89/3.49 Prover 0: Proving ... % 26.11/4.30 Prover 3: proved (3675ms) % 26.11/4.30 % 26.11/4.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 26.11/4.31 % 26.11/4.31 Prover 6: stopped % 26.11/4.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 26.11/4.31 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 26.32/4.31 Prover 2: stopped % 26.32/4.31 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 26.32/4.32 Prover 5: stopped % 26.32/4.32 Prover 0: stopped % 26.46/4.34 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 26.46/4.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 27.72/4.56 Prover 10: Preprocessing ... % 28.43/4.58 Prover 13: Preprocessing ... % 28.65/4.62 Prover 8: Preprocessing ... % 28.81/4.67 Prover 7: Preprocessing ... % 28.81/4.71 Prover 11: Preprocessing ... % 31.06/4.95 Prover 10: Warning: ignoring some quantifiers % 31.06/5.00 Prover 10: Constructing countermodel ... % 32.21/5.16 Prover 13: Warning: ignoring some quantifiers % 32.21/5.16 Prover 7: Warning: ignoring some quantifiers % 32.83/5.19 Prover 8: Warning: ignoring some quantifiers % 33.13/5.21 Prover 13: Constructing countermodel ... % 33.13/5.23 Prover 8: Constructing countermodel ... % 33.36/5.24 Prover 7: Constructing countermodel ... % 34.05/5.37 Prover 11: Warning: ignoring some quantifiers % 35.03/5.46 Prover 10: Found proof (size 10) % 35.03/5.46 Prover 11: Constructing countermodel ... % 35.03/5.46 Prover 10: proved (1153ms) % 35.03/5.47 Prover 8: stopped % 35.03/5.47 Prover 4: stopped % 35.03/5.47 Prover 1: stopped % 35.03/5.47 Prover 13: stopped % 35.03/5.48 Prover 7: stopped % 35.03/5.49 Prover 11: stopped % 35.03/5.50 % 35.03/5.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 35.03/5.50 % 35.03/5.50 % SZS output start Proof for theBenchmark % 35.03/5.51 Assumptions after simplification: % 35.03/5.51 --------------------------------- % 35.03/5.51 % 35.03/5.51 (d11_relat_1) % 35.03/5.54 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 35.03/5.54 $i] : ( ~ (relation_dom_restriction(v0, v1) = v2) | ~ (ordered_pair(v3, v4) % 35.03/5.54 = v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 35.03/5.54 relation(v2) | ~ relation(v0) | ~ in(v5, v2) | in(v5, v0)) & ! [v0: $i] : % 35.03/5.54 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ % 35.03/5.54 (relation_dom_restriction(v0, v1) = v2) | ~ (ordered_pair(v3, v4) = v5) | % 35.03/5.54 ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v2) | % 35.03/5.54 ~ relation(v0) | ~ in(v5, v2) | in(v3, v1)) & ! [v0: $i] : ! [v1: $i] : % 35.03/5.54 ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ % 35.03/5.54 (relation_dom_restriction(v0, v1) = v2) | ~ (ordered_pair(v3, v4) = v5) | % 35.03/5.54 ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v2) | % 35.03/5.54 ~ relation(v0) | ~ in(v5, v0) | ~ in(v3, v1) | in(v5, v2)) & ! [v0: $i] % 35.03/5.54 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v2 | ~ % 35.03/5.54 (relation_dom_restriction(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 35.03/5.54 | ~ relation(v2) | ~ relation(v0) | ? [v4: $i] : ? [v5: $i] : ? [v6: % 35.03/5.54 $i] : (ordered_pair(v4, v5) = v6 & $i(v6) & $i(v5) & $i(v4) & ( ~ in(v6, % 35.03/5.54 v2) | ~ in(v6, v0) | ~ in(v4, v1)) & (in(v6, v2) | (in(v6, v0) & % 35.03/5.54 in(v4, v1))))) % 35.03/5.54 % 35.03/5.54 (d3_relat_1) % 35.03/5.54 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 35.03/5.54 (ordered_pair(v2, v3) = v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 35.03/5.54 | ~ subset(v0, v1) | ~ relation(v1) | ~ relation(v0) | ~ in(v4, v0) | % 35.03/5.54 in(v4, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 35.03/5.54 relation(v1) | ~ relation(v0) | subset(v0, v1) | ? [v2: $i] : ? [v3: $i] % 35.03/5.54 : ? [v4: $i] : (ordered_pair(v2, v3) = v4 & $i(v4) & $i(v3) & $i(v2) & % 35.03/5.54 in(v4, v0) & ~ in(v4, v1))) % 35.03/5.54 % 35.03/5.54 (dt_k7_relat_1) % 35.03/5.54 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 35.03/5.54 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | relation(v2)) % 35.03/5.54 % 35.03/5.54 (t88_relat_1) % 35.03/5.54 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (relation_dom_restriction(v1, v0) = % 35.03/5.54 v2 & $i(v2) & $i(v1) & $i(v0) & relation(v1) & ~ subset(v2, v1)) % 35.03/5.54 % 35.03/5.54 Further assumptions not needed in the proof: % 35.03/5.54 -------------------------------------------- % 35.03/5.54 antisymmetry_r2_hidden, antisymmetry_r2_xboole_0, cc1_relat_1, % 35.03/5.54 commutativity_k2_tarski, commutativity_k2_xboole_0, commutativity_k3_xboole_0, % 35.03/5.54 d10_relat_1, d10_xboole_0, d1_relat_1, d1_setfam_1, d1_tarski, d1_xboole_0, % 35.03/5.54 d1_zfmisc_1, d2_subset_1, d2_tarski, d2_xboole_0, d2_zfmisc_1, d3_tarski, % 35.03/5.54 d3_xboole_0, d4_relat_1, d4_subset_1, d4_tarski, d4_xboole_0, d5_relat_1, % 35.03/5.54 d5_subset_1, d5_tarski, d6_relat_1, d7_relat_1, d7_xboole_0, d8_relat_1, % 35.03/5.54 d8_setfam_1, d8_xboole_0, dt_k1_relat_1, dt_k1_setfam_1, dt_k1_tarski, % 35.03/5.54 dt_k1_xboole_0, dt_k1_zfmisc_1, dt_k2_relat_1, dt_k2_subset_1, dt_k2_tarski, % 35.03/5.54 dt_k2_xboole_0, dt_k2_zfmisc_1, dt_k3_relat_1, dt_k3_subset_1, dt_k3_tarski, % 35.03/5.54 dt_k3_xboole_0, dt_k4_relat_1, dt_k4_tarski, dt_k4_xboole_0, dt_k5_relat_1, % 35.03/5.54 dt_k5_setfam_1, dt_k6_relat_1, dt_k6_setfam_1, dt_k6_subset_1, dt_k7_setfam_1, % 35.03/5.54 dt_m1_subset_1, existence_m1_subset_1, fc10_relat_1, fc1_subset_1, fc1_xboole_0, % 35.03/5.54 fc1_zfmisc_1, fc2_relat_1, fc2_subset_1, fc2_xboole_0, fc3_subset_1, % 35.03/5.54 fc3_xboole_0, fc4_relat_1, fc4_subset_1, fc5_relat_1, fc6_relat_1, fc7_relat_1, % 35.03/5.54 fc8_relat_1, fc9_relat_1, idempotence_k2_xboole_0, idempotence_k3_xboole_0, % 35.03/5.54 involutiveness_k3_subset_1, involutiveness_k4_relat_1, % 35.03/5.54 involutiveness_k7_setfam_1, irreflexivity_r2_xboole_0, l1_zfmisc_1, % 35.03/5.54 l23_zfmisc_1, l25_zfmisc_1, l28_zfmisc_1, l2_zfmisc_1, l32_xboole_1, % 35.03/5.54 l3_subset_1, l3_zfmisc_1, l4_zfmisc_1, l50_zfmisc_1, l55_zfmisc_1, l71_subset_1, % 35.03/5.54 rc1_relat_1, rc1_subset_1, rc1_xboole_0, rc2_relat_1, rc2_subset_1, % 35.03/5.54 rc2_xboole_0, redefinition_k5_setfam_1, redefinition_k6_setfam_1, % 35.03/5.54 redefinition_k6_subset_1, reflexivity_r1_tarski, symmetry_r1_xboole_0, % 35.03/5.54 t106_zfmisc_1, t10_zfmisc_1, t118_zfmisc_1, t119_zfmisc_1, t12_xboole_1, % 35.03/5.54 t136_zfmisc_1, t17_xboole_1, t19_xboole_1, t1_boole, t1_subset, t1_xboole_1, % 35.03/5.54 t1_zfmisc_1, t20_relat_1, t21_relat_1, t25_relat_1, t26_xboole_1, t28_xboole_1, % 35.03/5.54 t2_boole, t2_subset, t2_tarski, t2_xboole_1, t30_relat_1, t33_xboole_1, % 35.03/5.55 t33_zfmisc_1, t36_xboole_1, t37_relat_1, t37_xboole_1, t37_zfmisc_1, % 35.03/5.55 t38_zfmisc_1, t39_xboole_1, t39_zfmisc_1, t3_boole, t3_subset, t3_xboole_0, % 35.03/5.55 t3_xboole_1, t40_xboole_1, t43_subset_1, t44_relat_1, t45_relat_1, t45_xboole_1, % 35.03/5.55 t46_relat_1, t46_setfam_1, t46_zfmisc_1, t47_relat_1, t47_setfam_1, % 35.03/5.55 t48_setfam_1, t48_xboole_1, t4_boole, t4_subset, t4_xboole_0, t50_subset_1, % 35.03/5.55 t54_subset_1, t56_relat_1, t5_subset, t60_relat_1, t60_xboole_1, t63_xboole_1, % 35.03/5.55 t64_relat_1, t65_relat_1, t65_zfmisc_1, t69_enumset1, t6_boole, t6_zfmisc_1, % 35.03/5.55 t71_relat_1, t74_relat_1, t7_boole, t7_xboole_1, t83_xboole_1, t86_relat_1, % 35.03/5.55 t8_boole, t8_xboole_1, t8_zfmisc_1, t92_zfmisc_1, t99_zfmisc_1, t9_tarski, % 35.03/5.55 t9_zfmisc_1 % 35.03/5.55 % 35.03/5.55 Those formulas are unsatisfiable: % 35.03/5.55 --------------------------------- % 35.03/5.55 % 35.03/5.55 Begin of proof % 35.03/5.55 | % 35.03/5.55 | ALPHA: (d11_relat_1) implies: % 35.03/5.55 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 35.03/5.55 | ! [v5: $i] : ( ~ (relation_dom_restriction(v0, v1) = v2) | ~ % 35.03/5.55 | (ordered_pair(v3, v4) = v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ % 35.03/5.55 | $i(v1) | ~ $i(v0) | ~ relation(v2) | ~ relation(v0) | ~ in(v5, % 35.03/5.55 | v2) | in(v5, v0)) % 35.03/5.55 | % 35.03/5.55 | ALPHA: (d3_relat_1) implies: % 35.03/5.55 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ relation(v1) | % 35.03/5.55 | ~ relation(v0) | subset(v0, v1) | ? [v2: $i] : ? [v3: $i] : ? [v4: % 35.03/5.55 | $i] : (ordered_pair(v2, v3) = v4 & $i(v4) & $i(v3) & $i(v2) & % 35.03/5.55 | in(v4, v0) & ~ in(v4, v1))) % 35.03/5.55 | % 35.03/5.55 | DELTA: instantiating (t88_relat_1) with fresh symbols all_170_0, all_170_1, % 35.03/5.55 | all_170_2 gives: % 35.03/5.55 | (3) relation_dom_restriction(all_170_1, all_170_2) = all_170_0 & % 35.03/5.55 | $i(all_170_0) & $i(all_170_1) & $i(all_170_2) & relation(all_170_1) & % 35.03/5.55 | ~ subset(all_170_0, all_170_1) % 35.03/5.55 | % 35.03/5.55 | ALPHA: (3) implies: % 35.03/5.55 | (4) ~ subset(all_170_0, all_170_1) % 35.03/5.55 | (5) relation(all_170_1) % 35.03/5.55 | (6) $i(all_170_2) % 35.03/5.55 | (7) $i(all_170_1) % 35.03/5.55 | (8) $i(all_170_0) % 35.03/5.55 | (9) relation_dom_restriction(all_170_1, all_170_2) = all_170_0 % 35.03/5.55 | % 35.03/5.55 | GROUND_INST: instantiating (dt_k7_relat_1) with all_170_1, all_170_2, % 35.03/5.55 | all_170_0, simplifying with (5), (6), (7), (9) gives: % 35.03/5.55 | (10) relation(all_170_0) % 35.03/5.55 | % 35.03/5.55 | GROUND_INST: instantiating (2) with all_170_0, all_170_1, simplifying with % 35.03/5.55 | (4), (5), (7), (8), (10) gives: % 35.03/5.55 | (11) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (ordered_pair(v0, v1) = v2 & % 35.03/5.55 | $i(v2) & $i(v1) & $i(v0) & in(v2, all_170_0) & ~ in(v2, all_170_1)) % 35.03/5.55 | % 35.03/5.55 | DELTA: instantiating (11) with fresh symbols all_233_0, all_233_1, all_233_2 % 35.03/5.55 | gives: % 35.03/5.55 | (12) ordered_pair(all_233_2, all_233_1) = all_233_0 & $i(all_233_0) & % 35.03/5.55 | $i(all_233_1) & $i(all_233_2) & in(all_233_0, all_170_0) & ~ % 35.03/5.55 | in(all_233_0, all_170_1) % 35.03/5.55 | % 35.03/5.55 | ALPHA: (12) implies: % 35.03/5.55 | (13) ~ in(all_233_0, all_170_1) % 35.03/5.55 | (14) in(all_233_0, all_170_0) % 35.03/5.55 | (15) $i(all_233_2) % 35.03/5.56 | (16) $i(all_233_1) % 35.03/5.56 | (17) ordered_pair(all_233_2, all_233_1) = all_233_0 % 35.03/5.56 | % 35.03/5.56 | GROUND_INST: instantiating (1) with all_170_1, all_170_2, all_170_0, % 35.03/5.56 | all_233_2, all_233_1, all_233_0, simplifying with (5), (6), (7), % 35.03/5.56 | (8), (9), (10), (13), (14), (15), (16), (17) gives: % 35.03/5.56 | (18) $false % 35.03/5.56 | % 35.03/5.56 | CLOSE: (18) is inconsistent. % 35.03/5.56 | % 35.03/5.56 End of proof % 35.03/5.56 % SZS output end Proof for theBenchmark % 35.03/5.56 % 35.03/5.56 4954ms %------------------------------------------------------------------------------