%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU196+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 : n028.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 9.37s 2.09s % Output : Proof 12.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU196+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.13/0.34 % Computer : n028.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Wed Aug 23 18:38:19 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.52/1.10 Prover 4: Preprocessing ... % 2.52/1.10 Prover 1: Preprocessing ... % 3.16/1.16 Prover 3: Preprocessing ... % 3.16/1.16 Prover 2: Preprocessing ... % 3.16/1.16 Prover 5: Preprocessing ... % 3.16/1.16 Prover 6: Preprocessing ... % 3.16/1.16 Prover 0: Preprocessing ... % 5.27/1.52 Prover 1: Warning: ignoring some quantifiers % 5.27/1.56 Prover 1: Constructing countermodel ... % 5.27/1.56 Prover 3: Warning: ignoring some quantifiers % 5.27/1.56 Prover 5: Proving ... % 5.27/1.56 Prover 6: Proving ... % 5.27/1.56 Prover 2: Proving ... % 5.27/1.57 Prover 3: Constructing countermodel ... % 6.47/1.68 Prover 4: Warning: ignoring some quantifiers % 6.73/1.69 Prover 4: Constructing countermodel ... % 6.73/1.71 Prover 0: Proving ... % 7.64/1.84 Prover 3: gave up % 7.64/1.85 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.97/1.89 Prover 7: Preprocessing ... % 8.81/1.98 Prover 7: Warning: ignoring some quantifiers % 8.81/2.01 Prover 1: gave up % 8.81/2.01 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.81/2.02 Prover 7: Constructing countermodel ... % 9.37/2.06 Prover 8: Preprocessing ... % 9.37/2.09 Prover 0: proved (1461ms) % 9.37/2.09 % 9.37/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.37/2.09 % 9.37/2.10 Prover 5: stopped % 9.37/2.12 Prover 6: stopped % 9.37/2.13 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.37/2.13 Prover 2: stopped % 9.37/2.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.37/2.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.37/2.14 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.37/2.16 Prover 10: Preprocessing ... % 9.37/2.17 Prover 11: Preprocessing ... % 9.37/2.20 Prover 13: Preprocessing ... % 9.37/2.20 Prover 8: Warning: ignoring some quantifiers % 9.37/2.20 Prover 16: Preprocessing ... % 9.37/2.20 Prover 8: Constructing countermodel ... % 9.37/2.21 Prover 10: Warning: ignoring some quantifiers % 9.37/2.24 Prover 10: Constructing countermodel ... % 9.37/2.29 Prover 16: Warning: ignoring some quantifiers % 10.69/2.31 Prover 16: Constructing countermodel ... % 10.69/2.31 Prover 13: Warning: ignoring some quantifiers % 10.69/2.32 Prover 10: gave up % 10.69/2.33 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 10.69/2.33 Prover 13: Constructing countermodel ... % 11.36/2.37 Prover 19: Preprocessing ... % 11.36/2.38 Prover 7: Found proof (size 10) % 11.36/2.38 Prover 7: proved (529ms) % 11.36/2.38 Prover 16: stopped % 11.36/2.38 Prover 8: stopped % 11.36/2.38 Prover 13: stopped % 11.36/2.39 Prover 4: stopped % 11.36/2.40 Prover 11: Warning: ignoring some quantifiers % 11.36/2.41 Prover 11: Constructing countermodel ... % 11.90/2.42 Prover 11: stopped % 11.90/2.44 Prover 19: Warning: ignoring some quantifiers % 11.90/2.45 Prover 19: Constructing countermodel ... % 11.90/2.46 Prover 19: stopped % 11.90/2.46 % 11.90/2.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.90/2.46 % 11.90/2.46 % SZS output start Proof for theBenchmark % 11.90/2.46 Assumptions after simplification: % 11.90/2.46 --------------------------------- % 11.90/2.46 % 11.90/2.46 (dt_k7_relat_1) % 12.19/2.48 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 12.19/2.48 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | relation(v2)) % 12.19/2.48 % 12.19/2.48 (t25_relat_1) % 12.19/2.50 ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | ~ % 12.19/2.50 relation(v0) | ? [v2: $i] : (relation_dom(v0) = v2 & $i(v2) & ! [v3: $i] : % 12.19/2.50 ! [v4: $i] : ( ~ (relation_rng(v3) = v4) | ~ $i(v3) | ~ subset(v0, v3) % 12.19/2.50 | ~ relation(v3) | subset(v1, v4)) & ! [v3: $i] : ! [v4: $i] : ( ~ % 12.19/2.50 (relation_rng(v3) = v4) | ~ $i(v3) | ~ subset(v0, v3) | ~ % 12.19/2.50 relation(v3) | ? [v5: $i] : (relation_dom(v3) = v5 & $i(v5) & % 12.19/2.50 subset(v2, v5))) & ! [v3: $i] : ! [v4: $i] : ( ~ (relation_dom(v3) = % 12.19/2.50 v4) | ~ $i(v3) | ~ subset(v0, v3) | ~ relation(v3) | subset(v2, % 12.19/2.50 v4)) & ! [v3: $i] : ! [v4: $i] : ( ~ (relation_dom(v3) = v4) | ~ % 12.19/2.50 $i(v3) | ~ subset(v0, v3) | ~ relation(v3) | ? [v5: $i] : % 12.19/2.50 (relation_rng(v3) = v5 & $i(v5) & subset(v1, v5))))) & ! [v0: $i] : ! % 12.19/2.50 [v1: $i] : ( ~ (relation_dom(v0) = v1) | ~ $i(v0) | ~ relation(v0) | ? [v2: % 12.19/2.50 $i] : (relation_rng(v0) = v2 & $i(v2) & ! [v3: $i] : ! [v4: $i] : ( ~ % 12.19/2.50 (relation_rng(v3) = v4) | ~ $i(v3) | ~ subset(v0, v3) | ~ % 12.19/2.50 relation(v3) | subset(v2, v4)) & ! [v3: $i] : ! [v4: $i] : ( ~ % 12.19/2.50 (relation_rng(v3) = v4) | ~ $i(v3) | ~ subset(v0, v3) | ~ % 12.19/2.50 relation(v3) | ? [v5: $i] : (relation_dom(v3) = v5 & $i(v5) & % 12.19/2.50 subset(v1, v5))) & ! [v3: $i] : ! [v4: $i] : ( ~ (relation_dom(v3) = % 12.19/2.50 v4) | ~ $i(v3) | ~ subset(v0, v3) | ~ relation(v3) | subset(v1, % 12.19/2.50 v4)) & ! [v3: $i] : ! [v4: $i] : ( ~ (relation_dom(v3) = v4) | ~ % 12.19/2.50 $i(v3) | ~ subset(v0, v3) | ~ relation(v3) | ? [v5: $i] : % 12.19/2.50 (relation_rng(v3) = v5 & $i(v5) & subset(v2, v5))))) % 12.19/2.50 % 12.19/2.50 (t88_relat_1) % 12.19/2.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v1, % 12.19/2.50 v0) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v1) | subset(v2, v1)) % 12.19/2.50 % 12.19/2.50 (t99_relat_1) % 12.19/2.50 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 12.19/2.50 (relation_rng(v2) = v3 & relation_rng(v1) = v4 & relation_dom_restriction(v1, % 12.19/2.50 v0) = v2 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & relation(v1) & ~ % 12.19/2.50 subset(v3, v4)) % 12.19/2.50 % 12.19/2.50 Further assumptions not needed in the proof: % 12.19/2.50 -------------------------------------------- % 12.19/2.51 antisymmetry_r2_hidden, cc1_relat_1, dt_k1_relat_1, dt_k1_xboole_0, % 12.19/2.51 dt_k1_zfmisc_1, dt_k2_relat_1, dt_m1_subset_1, existence_m1_subset_1, % 12.19/2.51 fc1_subset_1, fc1_xboole_0, fc4_relat_1, fc5_relat_1, fc6_relat_1, fc7_relat_1, % 12.19/2.51 fc8_relat_1, rc1_relat_1, rc1_subset_1, rc1_xboole_0, rc2_relat_1, rc2_subset_1, % 12.19/2.51 rc2_xboole_0, reflexivity_r1_tarski, t1_subset, t2_subset, t3_subset, t4_subset, % 12.19/2.51 t5_subset, t6_boole, t7_boole, t8_boole % 12.19/2.51 % 12.19/2.51 Those formulas are unsatisfiable: % 12.19/2.51 --------------------------------- % 12.19/2.51 % 12.19/2.51 Begin of proof % 12.19/2.51 | % 12.19/2.51 | ALPHA: (t25_relat_1) implies: % 12.19/2.51 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | % 12.19/2.51 | ~ relation(v0) | ? [v2: $i] : (relation_dom(v0) = v2 & $i(v2) & ! % 12.19/2.51 | [v3: $i] : ! [v4: $i] : ( ~ (relation_rng(v3) = v4) | ~ $i(v3) | % 12.19/2.51 | ~ subset(v0, v3) | ~ relation(v3) | subset(v1, v4)) & ! [v3: % 12.19/2.51 | $i] : ! [v4: $i] : ( ~ (relation_rng(v3) = v4) | ~ $i(v3) | ~ % 12.19/2.51 | subset(v0, v3) | ~ relation(v3) | ? [v5: $i] : % 12.19/2.51 | (relation_dom(v3) = v5 & $i(v5) & subset(v2, v5))) & ! [v3: $i] % 12.19/2.51 | : ! [v4: $i] : ( ~ (relation_dom(v3) = v4) | ~ $i(v3) | ~ % 12.19/2.51 | subset(v0, v3) | ~ relation(v3) | subset(v2, v4)) & ! [v3: $i] % 12.19/2.51 | : ! [v4: $i] : ( ~ (relation_dom(v3) = v4) | ~ $i(v3) | ~ % 12.19/2.51 | subset(v0, v3) | ~ relation(v3) | ? [v5: $i] : % 12.19/2.51 | (relation_rng(v3) = v5 & $i(v5) & subset(v1, v5))))) % 12.19/2.51 | % 12.19/2.51 | DELTA: instantiating (t99_relat_1) with fresh symbols all_34_0, all_34_1, % 12.19/2.51 | all_34_2, all_34_3, all_34_4 gives: % 12.19/2.51 | (2) relation_rng(all_34_2) = all_34_1 & relation_rng(all_34_3) = all_34_0 & % 12.19/2.51 | relation_dom_restriction(all_34_3, all_34_4) = all_34_2 & $i(all_34_0) % 12.19/2.51 | & $i(all_34_1) & $i(all_34_2) & $i(all_34_3) & $i(all_34_4) & % 12.19/2.51 | relation(all_34_3) & ~ subset(all_34_1, all_34_0) % 12.19/2.51 | % 12.19/2.51 | ALPHA: (2) implies: % 12.19/2.52 | (3) ~ subset(all_34_1, all_34_0) % 12.19/2.52 | (4) relation(all_34_3) % 12.19/2.52 | (5) $i(all_34_4) % 12.19/2.52 | (6) $i(all_34_3) % 12.19/2.52 | (7) $i(all_34_2) % 12.19/2.52 | (8) relation_dom_restriction(all_34_3, all_34_4) = all_34_2 % 12.19/2.52 | (9) relation_rng(all_34_3) = all_34_0 % 12.19/2.52 | (10) relation_rng(all_34_2) = all_34_1 % 12.19/2.52 | % 12.19/2.52 | GROUND_INST: instantiating (t88_relat_1) with all_34_4, all_34_3, all_34_2, % 12.19/2.52 | simplifying with (4), (5), (6), (8) gives: % 12.19/2.52 | (11) subset(all_34_2, all_34_3) % 12.19/2.52 | % 12.19/2.52 | GROUND_INST: instantiating (dt_k7_relat_1) with all_34_3, all_34_4, all_34_2, % 12.19/2.52 | simplifying with (4), (5), (6), (8) gives: % 12.19/2.52 | (12) relation(all_34_2) % 12.19/2.52 | % 12.19/2.52 | GROUND_INST: instantiating (1) with all_34_2, all_34_1, simplifying with (7), % 12.19/2.52 | (10), (12) gives: % 12.19/2.52 | (13) ? [v0: $i] : (relation_dom(all_34_2) = v0 & $i(v0) & ! [v1: $i] : ! % 12.19/2.52 | [v2: $i] : ( ~ (relation_rng(v1) = v2) | ~ $i(v1) | ~ % 12.19/2.52 | subset(all_34_2, v1) | ~ relation(v1) | subset(all_34_1, v2)) & % 12.19/2.52 | ! [v1: $i] : ! [v2: $i] : ( ~ (relation_rng(v1) = v2) | ~ $i(v1) | % 12.19/2.52 | ~ subset(all_34_2, v1) | ~ relation(v1) | ? [v3: $i] : % 12.19/2.52 | (relation_dom(v1) = v3 & $i(v3) & subset(v0, v3))) & ! [v1: $i] : % 12.19/2.52 | ! [v2: $i] : ( ~ (relation_dom(v1) = v2) | ~ $i(v1) | ~ % 12.19/2.52 | subset(all_34_2, v1) | ~ relation(v1) | subset(v0, v2)) & ! [v1: % 12.19/2.52 | $i] : ! [v2: $i] : ( ~ (relation_dom(v1) = v2) | ~ $i(v1) | ~ % 12.19/2.52 | subset(all_34_2, v1) | ~ relation(v1) | ? [v3: $i] : % 12.19/2.52 | (relation_rng(v1) = v3 & $i(v3) & subset(all_34_1, v3)))) % 12.19/2.52 | % 12.19/2.52 | DELTA: instantiating (13) with fresh symbol all_57_0 gives: % 12.19/2.53 | (14) relation_dom(all_34_2) = all_57_0 & $i(all_57_0) & ! [v0: $i] : ! % 12.19/2.53 | [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | ~ % 12.19/2.53 | subset(all_34_2, v0) | ~ relation(v0) | subset(all_34_1, v1)) & ! % 12.19/2.53 | [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | ~ % 12.19/2.53 | subset(all_34_2, v0) | ~ relation(v0) | ? [v2: $i] : % 12.19/2.53 | (relation_dom(v0) = v2 & $i(v2) & subset(all_57_0, v2))) & ! [v0: % 12.19/2.53 | $i] : ! [v1: $i] : ( ~ (relation_dom(v0) = v1) | ~ $i(v0) | ~ % 12.19/2.53 | subset(all_34_2, v0) | ~ relation(v0) | subset(all_57_0, v1)) & ! % 12.19/2.53 | [v0: $i] : ! [v1: $i] : ( ~ (relation_dom(v0) = v1) | ~ $i(v0) | ~ % 12.19/2.53 | subset(all_34_2, v0) | ~ relation(v0) | ? [v2: $i] : % 12.19/2.53 | (relation_rng(v0) = v2 & $i(v2) & subset(all_34_1, v2))) % 12.19/2.53 | % 12.19/2.53 | ALPHA: (14) implies: % 12.19/2.53 | (15) ! [v0: $i] : ! [v1: $i] : ( ~ (relation_rng(v0) = v1) | ~ $i(v0) | % 12.19/2.53 | ~ subset(all_34_2, v0) | ~ relation(v0) | subset(all_34_1, v1)) % 12.19/2.53 | % 12.19/2.53 | GROUND_INST: instantiating (15) with all_34_3, all_34_0, simplifying with (3), % 12.19/2.53 | (4), (6), (9), (11) gives: % 12.19/2.53 | (16) $false % 12.19/2.53 | % 12.19/2.53 | CLOSE: (16) is inconsistent. % 12.19/2.53 | % 12.19/2.53 End of proof % 12.19/2.53 % SZS output end Proof for theBenchmark % 12.19/2.53 % 12.19/2.53 1916ms %------------------------------------------------------------------------------