%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU196+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:11 EDT 2023 % Result : Theorem 23.86s 3.95s % Output : Proof 34.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU196+2 : 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 : n018.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 15:50:41 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.79/1.45 Prover 4: Preprocessing ... % 4.79/1.45 Prover 1: Preprocessing ... % 4.79/1.48 Prover 0: Preprocessing ... % 4.79/1.48 Prover 2: Preprocessing ... % 4.79/1.48 Prover 5: Preprocessing ... % 4.79/1.48 Prover 6: Preprocessing ... % 4.79/1.48 Prover 3: Preprocessing ... % 14.86/2.80 Prover 1: Warning: ignoring some quantifiers % 14.86/2.94 Prover 1: Constructing countermodel ... % 15.66/3.00 Prover 5: Proving ... % 17.38/3.05 Prover 6: Proving ... % 17.54/3.09 Prover 3: Warning: ignoring some quantifiers % 17.91/3.13 Prover 3: Constructing countermodel ... % 18.71/3.25 Prover 4: Warning: ignoring some quantifiers % 18.71/3.25 Prover 2: Proving ... % 19.78/3.40 Prover 4: Constructing countermodel ... % 20.37/3.52 Prover 0: Proving ... % 23.86/3.94 Prover 3: proved (3314ms) % 23.86/3.95 % 23.86/3.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.86/3.95 % 23.86/3.95 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 23.86/3.96 Prover 0: stopped % 23.86/3.96 Prover 5: stopped % 23.86/3.97 Prover 6: stopped % 23.86/3.97 Prover 2: stopped % 23.86/3.97 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 23.86/3.97 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 23.86/3.97 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.86/3.98 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 25.54/4.34 Prover 7: Preprocessing ... % 25.54/4.34 Prover 8: Preprocessing ... % 25.54/4.34 Prover 10: Preprocessing ... % 27.00/4.38 Prover 13: Preprocessing ... % 27.00/4.38 Prover 11: Preprocessing ... % 29.36/4.71 Prover 10: Warning: ignoring some quantifiers % 29.84/4.75 Prover 7: Warning: ignoring some quantifiers % 30.01/4.77 Prover 10: Constructing countermodel ... % 30.01/4.78 Prover 8: Warning: ignoring some quantifiers % 30.43/4.82 Prover 8: Constructing countermodel ... % 30.43/4.82 Prover 13: Warning: ignoring some quantifiers % 30.43/4.83 Prover 7: Constructing countermodel ... % 30.43/4.92 Prover 13: Constructing countermodel ... % 33.72/5.26 Prover 10: Found proof (size 9) % 33.72/5.26 Prover 10: proved (1288ms) % 33.72/5.26 Prover 13: stopped % 33.72/5.26 Prover 7: stopped % 33.72/5.26 Prover 1: stopped % 33.72/5.26 Prover 4: stopped % 33.72/5.27 Prover 8: stopped % 33.72/5.28 Prover 11: Warning: ignoring some quantifiers % 33.99/5.32 Prover 11: Constructing countermodel ... % 33.99/5.35 Prover 11: stopped % 33.99/5.35 % 33.99/5.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 33.99/5.35 % 34.19/5.35 % SZS output start Proof for theBenchmark % 34.19/5.36 Assumptions after simplification: % 34.19/5.36 --------------------------------- % 34.19/5.36 % 34.19/5.36 (dt_k7_relat_1) % 34.19/5.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 34.19/5.38 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | relation(v2)) % 34.19/5.38 % 34.19/5.38 (t25_relat_1) % 34.19/5.38 ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | ~ % 34.19/5.38 relation(v0) | ? [v2: $i] : (relation_dom(v0) = v2 & $i(v2) & ! [v3: $i] : % 34.19/5.38 ! [v4: $i] : ( ~ (relation_rng(v3) = v4) | ~ $i(v3) | ~ subset(v0, v3) % 34.19/5.39 | ~ relation(v3) | subset(v1, v4)) & ! [v3: $i] : ! [v4: $i] : ( ~ % 34.19/5.39 (relation_rng(v3) = v4) | ~ $i(v3) | ~ subset(v0, v3) | ~ % 34.19/5.39 relation(v3) | ? [v5: $i] : (relation_dom(v3) = v5 & $i(v5) & % 34.19/5.39 subset(v2, v5))))) % 34.19/5.39 % 34.19/5.39 (t88_relat_1) % 34.19/5.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v1, % 34.19/5.39 v0) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v1) | subset(v2, v1)) % 34.19/5.39 % 34.19/5.39 (t99_relat_1) % 34.19/5.39 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 34.19/5.39 (relation_rng(v2) = v3 & relation_rng(v1) = v4 & relation_dom_restriction(v1, % 34.19/5.39 v0) = v2 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & relation(v1) & ~ % 34.19/5.39 subset(v3, v4)) % 34.19/5.39 % 34.19/5.39 Further assumptions not needed in the proof: % 34.19/5.39 -------------------------------------------- % 34.19/5.39 antisymmetry_r2_hidden, antisymmetry_r2_xboole_0, cc1_relat_1, % 34.19/5.39 commutativity_k2_tarski, commutativity_k2_xboole_0, commutativity_k3_xboole_0, % 34.19/5.39 d10_relat_1, d10_xboole_0, d11_relat_1, d1_relat_1, d1_setfam_1, d1_tarski, % 34.19/5.39 d1_xboole_0, d1_zfmisc_1, d2_relat_1, d2_subset_1, d2_tarski, d2_xboole_0, % 34.19/5.39 d2_zfmisc_1, d3_relat_1, d3_tarski, d3_xboole_0, d4_relat_1, d4_subset_1, % 34.19/5.39 d4_tarski, d4_xboole_0, d5_relat_1, d5_subset_1, d5_tarski, d6_relat_1, % 34.19/5.39 d7_relat_1, d7_xboole_0, d8_relat_1, d8_setfam_1, d8_xboole_0, dt_k1_relat_1, % 34.19/5.39 dt_k1_setfam_1, dt_k1_tarski, dt_k1_xboole_0, dt_k1_zfmisc_1, dt_k2_relat_1, % 34.19/5.39 dt_k2_subset_1, dt_k2_tarski, dt_k2_xboole_0, dt_k2_zfmisc_1, dt_k3_relat_1, % 34.19/5.39 dt_k3_subset_1, dt_k3_tarski, dt_k3_xboole_0, dt_k4_relat_1, dt_k4_tarski, % 34.19/5.39 dt_k4_xboole_0, dt_k5_relat_1, dt_k5_setfam_1, dt_k6_relat_1, dt_k6_setfam_1, % 34.19/5.39 dt_k6_subset_1, dt_k7_setfam_1, dt_m1_subset_1, existence_m1_subset_1, % 34.19/5.39 fc10_relat_1, fc1_relat_1, fc1_subset_1, fc1_xboole_0, fc1_zfmisc_1, % 34.19/5.39 fc2_relat_1, fc2_subset_1, fc2_xboole_0, fc3_subset_1, fc3_xboole_0, % 34.19/5.39 fc4_relat_1, fc4_subset_1, fc5_relat_1, fc6_relat_1, fc7_relat_1, fc8_relat_1, % 34.19/5.39 fc9_relat_1, idempotence_k2_xboole_0, idempotence_k3_xboole_0, % 34.19/5.39 involutiveness_k3_subset_1, involutiveness_k4_relat_1, % 34.19/5.39 involutiveness_k7_setfam_1, irreflexivity_r2_xboole_0, l1_zfmisc_1, % 34.19/5.39 l23_zfmisc_1, l25_zfmisc_1, l28_zfmisc_1, l2_zfmisc_1, l32_xboole_1, % 34.19/5.39 l3_subset_1, l3_zfmisc_1, l4_zfmisc_1, l50_zfmisc_1, l55_zfmisc_1, l71_subset_1, % 34.19/5.39 rc1_relat_1, rc1_subset_1, rc1_xboole_0, rc2_relat_1, rc2_subset_1, % 34.19/5.39 rc2_xboole_0, redefinition_k5_setfam_1, redefinition_k6_setfam_1, % 34.19/5.39 redefinition_k6_subset_1, reflexivity_r1_tarski, symmetry_r1_xboole_0, % 34.19/5.39 t106_zfmisc_1, t10_zfmisc_1, t118_zfmisc_1, t119_zfmisc_1, t12_xboole_1, % 34.19/5.39 t136_zfmisc_1, t17_xboole_1, t19_xboole_1, t1_boole, t1_subset, t1_xboole_1, % 34.19/5.39 t1_zfmisc_1, t20_relat_1, t21_relat_1, t26_xboole_1, t28_xboole_1, t2_boole, % 34.19/5.39 t2_subset, t2_tarski, t2_xboole_1, t30_relat_1, t33_xboole_1, t33_zfmisc_1, % 34.19/5.39 t36_xboole_1, t37_relat_1, t37_xboole_1, t37_zfmisc_1, t38_zfmisc_1, % 34.19/5.39 t39_xboole_1, t39_zfmisc_1, t3_boole, t3_subset, t3_xboole_0, t3_xboole_1, % 34.19/5.39 t40_xboole_1, t43_subset_1, t44_relat_1, t45_relat_1, t45_xboole_1, t46_relat_1, % 34.19/5.39 t46_setfam_1, t46_zfmisc_1, t47_relat_1, t47_setfam_1, t48_setfam_1, % 34.19/5.39 t48_xboole_1, t4_boole, t4_subset, t4_xboole_0, t50_subset_1, t54_subset_1, % 34.19/5.39 t56_relat_1, t5_subset, t60_relat_1, t60_xboole_1, t63_xboole_1, t64_relat_1, % 34.19/5.39 t65_relat_1, t65_zfmisc_1, t69_enumset1, t6_boole, t6_zfmisc_1, t71_relat_1, % 34.19/5.39 t74_relat_1, t7_boole, t7_xboole_1, t83_xboole_1, t86_relat_1, t8_boole, % 34.19/5.39 t8_xboole_1, t8_zfmisc_1, t90_relat_1, t92_zfmisc_1, t94_relat_1, t99_zfmisc_1, % 34.19/5.39 t9_tarski, t9_zfmisc_1 % 34.19/5.39 % 34.19/5.39 Those formulas are unsatisfiable: % 34.19/5.39 --------------------------------- % 34.19/5.39 % 34.19/5.39 Begin of proof % 34.19/5.39 | % 34.19/5.39 | DELTA: instantiating (t99_relat_1) with fresh symbols all_187_0, all_187_1, % 34.19/5.39 | all_187_2, all_187_3, all_187_4 gives: % 34.19/5.39 | (1) relation_rng(all_187_2) = all_187_1 & relation_rng(all_187_3) = % 34.19/5.39 | all_187_0 & relation_dom_restriction(all_187_3, all_187_4) = all_187_2 % 34.19/5.39 | & $i(all_187_0) & $i(all_187_1) & $i(all_187_2) & $i(all_187_3) & % 34.19/5.39 | $i(all_187_4) & relation(all_187_3) & ~ subset(all_187_1, all_187_0) % 34.19/5.39 | % 34.19/5.39 | ALPHA: (1) implies: % 34.19/5.40 | (2) ~ subset(all_187_1, all_187_0) % 34.19/5.40 | (3) relation(all_187_3) % 34.19/5.40 | (4) $i(all_187_4) % 34.19/5.40 | (5) $i(all_187_3) % 34.19/5.40 | (6) $i(all_187_2) % 34.19/5.40 | (7) relation_dom_restriction(all_187_3, all_187_4) = all_187_2 % 34.19/5.40 | (8) relation_rng(all_187_3) = all_187_0 % 34.19/5.40 | (9) relation_rng(all_187_2) = all_187_1 % 34.19/5.40 | % 34.19/5.40 | GROUND_INST: instantiating (t88_relat_1) with all_187_4, all_187_3, all_187_2, % 34.19/5.40 | simplifying with (3), (4), (5), (7) gives: % 34.19/5.40 | (10) subset(all_187_2, all_187_3) % 34.19/5.40 | % 34.19/5.40 | GROUND_INST: instantiating (dt_k7_relat_1) with all_187_3, all_187_4, % 34.19/5.40 | all_187_2, simplifying with (3), (4), (5), (7) gives: % 34.19/5.40 | (11) relation(all_187_2) % 34.19/5.40 | % 34.19/5.40 | GROUND_INST: instantiating (t25_relat_1) with all_187_2, all_187_1, % 34.19/5.40 | simplifying with (6), (9), (11) gives: % 34.19/5.40 | (12) ? [v0: $i] : (relation_dom(all_187_2) = v0 & $i(v0) & ! [v1: $i] : % 34.19/5.40 | ! [v2: $i] : ( ~ (relation_rng(v1) = v2) | ~ $i(v1) | ~ % 34.19/5.40 | subset(all_187_2, v1) | ~ relation(v1) | subset(all_187_1, v2)) & % 34.19/5.40 | ! [v1: $i] : ! [v2: $i] : ( ~ (relation_rng(v1) = v2) | ~ $i(v1) % 34.19/5.40 | | ~ subset(all_187_2, v1) | ~ relation(v1) | ? [v3: $i] : % 34.19/5.40 | (relation_dom(v1) = v3 & $i(v3) & subset(v0, v3)))) % 34.19/5.40 | % 34.19/5.40 | DELTA: instantiating (12) with fresh symbol all_257_0 gives: % 34.19/5.40 | (13) relation_dom(all_187_2) = all_257_0 & $i(all_257_0) & ! [v0: $i] : ! % 34.19/5.40 | [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | ~ % 34.19/5.40 | subset(all_187_2, v0) | ~ relation(v0) | subset(all_187_1, v1)) & % 34.19/5.40 | ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | % 34.19/5.40 | ~ subset(all_187_2, v0) | ~ relation(v0) | ? [v2: $i] : % 34.19/5.40 | (relation_dom(v0) = v2 & $i(v2) & subset(all_257_0, v2))) % 34.19/5.40 | % 34.19/5.40 | ALPHA: (13) implies: % 34.19/5.40 | (14) ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | % 34.19/5.40 | ~ subset(all_187_2, v0) | ~ relation(v0) | subset(all_187_1, v1)) % 34.19/5.40 | % 34.19/5.40 | GROUND_INST: instantiating (14) with all_187_3, all_187_0, simplifying with % 34.19/5.40 | (2), (3), (5), (8), (10) gives: % 34.19/5.40 | (15) $false % 34.19/5.40 | % 34.19/5.41 | CLOSE: (15) is inconsistent. % 34.19/5.41 | % 34.19/5.41 End of proof % 34.19/5.41 % SZS output end Proof for theBenchmark % 34.19/5.41 % 34.19/5.41 4801ms %------------------------------------------------------------------------------