%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : CSR042+1 : TPTP v8.1.2. Released v3.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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 : Wed Aug 30 21:36:42 EDT 2023 % Result : Theorem 5.72s 1.51s % Output : Proof 7.67s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : CSR042+1 : TPTP v8.1.2. Released v3.4.0. % 0.08/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.36 % Computer : n016.cluster.edu % 0.16/0.36 % Model : x86_64 x86_64 % 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.36 % Memory : 8042.1875MB % 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.36 % CPULimit : 300 % 0.16/0.36 % WCLimit : 300 % 0.16/0.36 % DateTime : Mon Aug 28 12:55:14 EDT 2023 % 0.16/0.36 % CPUTime : % 0.22/0.63 ________ _____ % 0.22/0.63 ___ __ \_________(_)________________________________ % 0.22/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.63 % 0.22/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.63 (2023-06-19) % 0.22/0.63 % 0.22/0.63 (c) Philipp Rümmer, 2009-2023 % 0.22/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.63 Amanda Stjerna. % 0.22/0.63 Free software under BSD-3-Clause. % 0.22/0.63 % 0.22/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.63 % 0.22/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.22/0.64 Running up to 7 provers in parallel. % 0.22/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.22/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.57/1.07 Prover 1: Preprocessing ... % 2.57/1.08 Prover 4: Preprocessing ... % 2.57/1.11 Prover 0: Preprocessing ... % 2.57/1.11 Prover 5: Preprocessing ... % 2.57/1.11 Prover 2: Preprocessing ... % 2.57/1.11 Prover 6: Preprocessing ... % 2.57/1.12 Prover 3: Preprocessing ... % 4.90/1.39 Prover 2: Constructing countermodel ... % 4.90/1.41 Prover 5: Proving ... % 5.13/1.44 Prover 3: Warning: ignoring some quantifiers % 5.13/1.45 Prover 3: Constructing countermodel ... % 5.13/1.46 Prover 1: Warning: ignoring some quantifiers % 5.13/1.48 Prover 6: Proving ... % 5.13/1.48 Prover 1: Constructing countermodel ... % 5.72/1.50 Prover 2: proved (851ms) % 5.72/1.51 % 5.72/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.72/1.51 % 5.72/1.51 Prover 3: stopped % 5.72/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.72/1.51 Prover 6: stopped % 5.72/1.51 Prover 5: stopped % 5.72/1.52 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.72/1.52 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.72/1.52 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.72/1.56 Prover 4: Constructing countermodel ... % 5.72/1.56 Prover 7: Preprocessing ... % 5.72/1.56 Prover 11: Preprocessing ... % 5.72/1.58 Prover 10: Preprocessing ... % 6.29/1.58 Prover 8: Preprocessing ... % 6.29/1.61 Prover 7: Constructing countermodel ... % 6.29/1.65 Prover 10: Constructing countermodel ... % 6.29/1.65 Prover 4: Found proof (size 14) % 6.29/1.66 Prover 4: proved (999ms) % 6.29/1.66 Prover 7: Found proof (size 8) % 6.29/1.66 Prover 7: proved (148ms) % 6.29/1.66 Prover 10: stopped % 6.29/1.66 Prover 1: stopped % 6.98/1.68 Prover 0: Proving ... % 6.98/1.68 Prover 0: stopped % 7.12/1.72 Prover 8: Warning: ignoring some quantifiers % 7.27/1.73 Prover 8: Constructing countermodel ... % 7.27/1.73 Prover 8: stopped % 7.27/1.76 Prover 11: Constructing countermodel ... % 7.27/1.77 Prover 11: stopped % 7.27/1.77 % 7.27/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.27/1.77 % 7.27/1.77 % SZS output start Proof for theBenchmark % 7.27/1.78 Assumptions after simplification: % 7.27/1.78 --------------------------------- % 7.27/1.78 % 7.27/1.78 (just1) % 7.67/1.81 $i(c_georegion_l4_x27_y65) & $i(c_georegion_l4_x27_y64) & % 7.67/1.81 $i(c_tptpgeo_member7_mt) & ? [v0: any] : ? [v1: any] : % 7.67/1.81 (mtvisible(c_tptpgeo_member7_mt) = v0 & borderson(c_georegion_l4_x27_y64, % 7.67/1.81 c_georegion_l4_x27_y65) = v1 & ( ~ (v0 = 0) | v1 = 0)) % 7.67/1.81 % 7.67/1.81 (just28) % 7.67/1.81 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (borderson(v1, v0) = % 7.67/1.81 v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & borderson(v0, % 7.67/1.81 v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ (borderson(v0, v1) = 0) | % 7.67/1.81 ~ $i(v1) | ~ $i(v0) | borderson(v1, v0) = 0) % 7.67/1.81 % 7.67/1.81 (query42) % 7.67/1.81 mtvisible(c_tptpgeo_member7_mt) = 0 & $i(c_georegion_l4_x27_y64) & % 7.67/1.81 $i(c_tptpgeo_member7_mt) & ! [v0: $i] : ( ~ (borderson(v0, % 7.67/1.81 c_georegion_l4_x27_y64) = 0) | ~ $i(v0)) % 7.67/1.81 % 7.67/1.81 (function-axioms) % 7.67/1.82 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 7.67/1.82 [v3: $i] : (v1 = v0 | ~ (genls(v3, v2) = v1) | ~ (genls(v3, v2) = v0)) & ! % 7.67/1.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 7.67/1.82 $i] : (v1 = v0 | ~ (genlpreds(v3, v2) = v1) | ~ (genlpreds(v3, v2) = v0)) % 7.67/1.82 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 7.67/1.82 [v3: $i] : (v1 = v0 | ~ (genlinverse(v3, v2) = v1) | ~ (genlinverse(v3, v2) % 7.67/1.82 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 7.67/1.82 $i] : ! [v3: $i] : (v1 = v0 | ~ (disjointwith(v3, v2) = v1) | ~ % 7.67/1.82 (disjointwith(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.67/1.82 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, v2) % 7.67/1.82 = v1) | ~ (isa(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.67/1.82 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.67/1.82 (borderson(v3, v2) = v1) | ~ (borderson(v3, v2) = v0)) & ! [v0: % 7.67/1.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.67/1.82 ~ (geographicalregion(v2) = v1) | ~ (geographicalregion(v2) = v0)) & ! % 7.67/1.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 7.67/1.82 | ~ (thing(v2) = v1) | ~ (thing(v2) = v0)) & ! [v0: MultipleValueBool] : % 7.67/1.82 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (collection(v2) = v1) % 7.67/1.82 | ~ (collection(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.67/1.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (binarypredicate(v2) = v1) % 7.67/1.82 | ~ (binarypredicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.67/1.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (predicate(v2) = v1) | ~ % 7.67/1.82 (predicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.67/1.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (mtvisible(v2) = v1) | ~ % 7.67/1.82 (mtvisible(v2) = v0)) % 7.67/1.82 % 7.67/1.82 Further assumptions not needed in the proof: % 7.67/1.82 -------------------------------------------- % 7.67/1.82 just10, just11, just12, just13, just14, just15, just16, just17, just18, just19, % 7.67/1.82 just2, just20, just21, just22, just23, just24, just25, just26, just27, just29, % 7.67/1.82 just3, just4, just5, just6, just7, just8, just9 % 7.67/1.82 % 7.67/1.82 Those formulas are unsatisfiable: % 7.67/1.82 --------------------------------- % 7.67/1.82 % 7.67/1.82 Begin of proof % 7.67/1.83 | % 7.67/1.83 | ALPHA: (just1) implies: % 7.67/1.83 | (1) $i(c_georegion_l4_x27_y65) % 7.67/1.83 | (2) ? [v0: any] : ? [v1: any] : (mtvisible(c_tptpgeo_member7_mt) = v0 & % 7.67/1.83 | borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65) = v1 & ( ~ % 7.67/1.83 | (v0 = 0) | v1 = 0)) % 7.67/1.83 | % 7.67/1.83 | ALPHA: (just28) implies: % 7.67/1.83 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (borderson(v0, v1) = 0) | ~ $i(v1) | % 7.67/1.83 | ~ $i(v0) | borderson(v1, v0) = 0) % 7.67/1.83 | % 7.67/1.83 | ALPHA: (query42) implies: % 7.67/1.83 | (4) $i(c_georegion_l4_x27_y64) % 7.67/1.83 | (5) mtvisible(c_tptpgeo_member7_mt) = 0 % 7.67/1.83 | (6) ! [v0: $i] : ( ~ (borderson(v0, c_georegion_l4_x27_y64) = 0) | ~ % 7.67/1.83 | $i(v0)) % 7.67/1.83 | % 7.67/1.83 | ALPHA: (function-axioms) implies: % 7.67/1.83 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.67/1.83 | (v1 = v0 | ~ (mtvisible(v2) = v1) | ~ (mtvisible(v2) = v0)) % 7.67/1.83 | % 7.67/1.83 | DELTA: instantiating (2) with fresh symbols all_32_0, all_32_1 gives: % 7.67/1.83 | (8) mtvisible(c_tptpgeo_member7_mt) = all_32_1 & % 7.67/1.83 | borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65) = all_32_0 & % 7.67/1.83 | ( ~ (all_32_1 = 0) | all_32_0 = 0) % 7.67/1.83 | % 7.67/1.83 | ALPHA: (8) implies: % 7.67/1.83 | (9) borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65) = all_32_0 % 7.67/1.84 | (10) mtvisible(c_tptpgeo_member7_mt) = all_32_1 % 7.67/1.84 | (11) ~ (all_32_1 = 0) | all_32_0 = 0 % 7.67/1.84 | % 7.67/1.84 | GROUND_INST: instantiating (7) with 0, all_32_1, c_tptpgeo_member7_mt, % 7.67/1.84 | simplifying with (5), (10) gives: % 7.67/1.84 | (12) all_32_1 = 0 % 7.67/1.84 | % 7.67/1.84 | BETA: splitting (11) gives: % 7.67/1.84 | % 7.67/1.84 | Case 1: % 7.67/1.84 | | % 7.67/1.84 | | (13) ~ (all_32_1 = 0) % 7.67/1.84 | | % 7.67/1.84 | | REDUCE: (12), (13) imply: % 7.67/1.84 | | (14) $false % 7.67/1.84 | | % 7.67/1.84 | | CLOSE: (14) is inconsistent. % 7.67/1.84 | | % 7.67/1.84 | Case 2: % 7.67/1.84 | | % 7.67/1.84 | | (15) all_32_0 = 0 % 7.67/1.84 | | % 7.67/1.84 | | REDUCE: (9), (15) imply: % 7.67/1.84 | | (16) borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65) = 0 % 7.67/1.84 | | % 7.67/1.84 | | GROUND_INST: instantiating (3) with c_georegion_l4_x27_y64, % 7.67/1.84 | | c_georegion_l4_x27_y65, simplifying with (1), (4), (16) gives: % 7.67/1.84 | | (17) borderson(c_georegion_l4_x27_y65, c_georegion_l4_x27_y64) = 0 % 7.67/1.84 | | % 7.67/1.84 | | GROUND_INST: instantiating (6) with c_georegion_l4_x27_y65, simplifying with % 7.67/1.84 | | (1), (17) gives: % 7.67/1.84 | | (18) $false % 7.67/1.84 | | % 7.67/1.84 | | CLOSE: (18) is inconsistent. % 7.67/1.84 | | % 7.67/1.84 | End of split % 7.67/1.84 | % 7.67/1.84 End of proof % 7.67/1.84 % SZS output end Proof for theBenchmark % 7.67/1.84 % 7.67/1.84 1210ms %------------------------------------------------------------------------------