%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT113+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n007.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:17:32 AM UTC 2026 % Result : Theorem 11.13s 2.07s % Output : Proof 16.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT113+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.36 % Computer : n007.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 14:05:11 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.37 OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release. % 0.28/0.55 ________ _____ % 0.28/0.55 ___ __ \_________(_)________________________________ % 0.28/0.55 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.28/0.55 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.28/0.55 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.28/0.55 % 0.28/0.55 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.28/0.55 (2023-06-19) % 0.28/0.55 % 0.28/0.55 (c) Philipp Rümmer, 2009-2023 % 0.28/0.55 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.28/0.55 Amanda Stjerna. % 0.28/0.55 Free software under BSD-3-Clause. % 0.28/0.55 % 0.28/0.55 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.28/0.55 % 0.28/0.56 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.54/0.57 Running up to 7 provers in parallel. % 0.54/0.57 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.54/0.57 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.54/0.57 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.54/0.57 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.54/0.57 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.54/0.58 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.54/0.58 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.19/1.12 Prover 1: Preprocessing ... % 3.19/1.13 Prover 4: Preprocessing ... % 3.97/1.19 Prover 3: Preprocessing ... % 3.97/1.19 Prover 5: Preprocessing ... % 3.97/1.19 Prover 0: Preprocessing ... % 3.97/1.19 Prover 6: Preprocessing ... % 3.97/1.20 Prover 2: Preprocessing ... % 7.57/1.68 Prover 2: Proving ... % 8.35/1.70 Prover 5: Proving ... % 9.16/1.84 Prover 6: Proving ... % 9.16/1.88 Prover 3: Constructing countermodel ... % 9.16/1.88 Prover 1: Constructing countermodel ... % 11.13/2.07 Prover 2: proved (1491ms) % 11.13/2.07 % 11.13/2.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.13/2.07 % 11.13/2.07 Prover 3: stopped % 11.13/2.08 Prover 5: stopped % 11.13/2.08 Prover 6: stopped % 11.13/2.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.13/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.13/2.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.13/2.08 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.92/2.19 Prover 4: Constructing countermodel ... % 12.27/2.20 Prover 8: Preprocessing ... % 12.27/2.24 Prover 7: Preprocessing ... % 12.27/2.24 Prover 10: Preprocessing ... % 12.27/2.24 Prover 11: Preprocessing ... % 13.06/2.36 Prover 10: Constructing countermodel ... % 13.86/2.42 Prover 7: Constructing countermodel ... % 13.86/2.48 Prover 0: Proving ... % 13.86/2.48 Prover 0: stopped % 13.86/2.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 14.66/2.52 Prover 8: Warning: ignoring some quantifiers % 14.66/2.52 Prover 13: Preprocessing ... % 14.66/2.53 Prover 8: Constructing countermodel ... % 14.66/2.57 Prover 10: Found proof (size 17) % 14.66/2.57 Prover 10: proved (487ms) % 14.66/2.58 Prover 7: stopped % 14.66/2.58 Prover 13: stopped % 14.66/2.58 Prover 1: stopped % 14.66/2.58 Prover 4: stopped % 14.66/2.58 Prover 8: stopped % 16.38/2.82 Prover 11: Constructing countermodel ... % 16.38/2.84 Prover 11: stopped % 16.38/2.84 % 16.38/2.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 16.38/2.84 % 16.38/2.85 % SZS output start Proof for theBenchmark % 16.38/2.85 Assumptions after simplification: % 16.38/2.85 --------------------------------- % 16.38/2.85 % 16.38/2.85 (act_e1_f1) % 16.38/2.86 $i(e1) & $i(f1) & activates(e1, f1) % 16.38/2.86 % 16.38/2.86 (act_f1) % 16.38/2.86 $i(f1) & $i(distrib) & act(f1, distrib) % 16.38/2.86 % 16.38/2.86 (aee_f1) % 16.38/2.86 $i(f1) & $i(marketplace) & aee(f1, marketplace) % 16.38/2.86 % 16.38/2.86 (aer_f1) % 16.38/2.86 $i(f1) & $i(philharmonie) & aer(f1, philharmonie) % 16.38/2.86 % 16.38/2.86 (ax_B2) % 16.38/2.88 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 16.38/2.89 $i] : ! [v6: $i] : ( ~ (decl(v1) = v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) % 16.38/2.89 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ power(v0) | ~ founds_rem(v4, v3, % 16.38/2.89 v5) | ~ part_of(v0, v3) | ~ cnt(v0, v6, v2) | about_event(v0, v4)) % 16.38/2.89 % 16.38/2.89 (ax_B3) % 16.38/2.89 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 16.38/2.89 $i] : ! [v6: $i] : ( ~ (decl(v1) = v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) % 16.38/2.89 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ subjection(v0) | ~ founds_rem(v4, % 16.38/2.89 v3, v5) | ~ part_of(v0, v3) | ~ cnt(v0, v6, v2) | about_event(v0, v4)) % 16.38/2.89 % 16.38/2.89 (ax_proh_relator_remedy) % 16.38/2.89 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 16.38/2.89 $i] : ! [v6: $i] : ( ~ (decl(v3) = v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) % 16.38/2.89 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ has_rem(v0) | ~ activates(v5, v0) % 16.38/2.89 | ~ tgt(v0, v4) | ~ act(v0, v3) | ~ aer(v0, v2) | ~ aee(v0, v1) | ~ % 16.38/2.89 proh(v0) | ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v9) & $i(v8) & % 16.38/2.89 $i(v7) & subjection(v9) & power(v8) & founds_rem(v5, v7, v0) & part_of(v9, % 16.38/2.89 v7) & part_of(v8, v7) & cnt(v9, v6, v4) & cnt(v8, v6, v4) & bearer(v9, % 16.38/2.89 v1) & bearer(v8, v2))) % 16.38/2.89 % 16.38/2.89 (conjecture) % 16.87/2.90 $i(e1) & $i(f1) & $i(concert_ds) & $i(distrib) & $i(philharmonie) & % 16.87/2.90 $i(marketplace) & ? [v0: $i] : (decl(distrib) = v0 & $i(v0) & ! [v1: $i] : % 16.87/2.90 ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 16.87/2.90 about_event(v3, e1) | ~ about_event(v2, e1) | ~ subjection(v3) | ~ % 16.87/2.90 power(v2) | ~ founds_rem(e1, v1, f1) | ~ part_of(v3, v1) | ~ % 16.87/2.90 part_of(v2, v1) | ~ cnt(v3, v0, concert_ds) | ~ cnt(v2, v0, concert_ds) % 16.87/2.90 | ~ bearer(v3, marketplace) | ~ bearer(v2, philharmonie))) % 16.87/2.90 % 16.87/2.90 (proh_f1) % 16.87/2.90 $i(f1) & proh(f1) % 16.87/2.90 % 16.87/2.90 (rem_f1) % 16.87/2.90 $i(f1) & has_rem(f1) % 16.87/2.90 % 16.87/2.90 (tgt_f1) % 16.87/2.90 $i(f1) & $i(concert_ds) & tgt(f1, concert_ds) % 16.87/2.90 % 16.87/2.90 Further assumptions not needed in the proof: % 16.87/2.90 -------------------------------------------- % 16.87/2.90 action_distrib, agent_marketplace, agent_philharmonie, ax_A1, ax_A2, ax_A3, % 16.87/2.90 ax_B1, ax_proh_relator_conduct, event_e1, marketplace_does, rule_f1, % 16.87/2.90 target_concert % 16.87/2.90 % 16.87/2.90 Those formulas are unsatisfiable: % 16.87/2.90 --------------------------------- % 16.87/2.90 % 16.87/2.90 Begin of proof % 16.87/2.90 | % 16.87/2.90 | ALPHA: (proh_f1) implies: % 16.87/2.90 | (1) proh(f1) % 16.87/2.90 | % 16.87/2.90 | ALPHA: (rem_f1) implies: % 16.87/2.90 | (2) has_rem(f1) % 16.87/2.90 | % 16.87/2.90 | ALPHA: (aee_f1) implies: % 16.87/2.90 | (3) aee(f1, marketplace) % 16.87/2.90 | % 16.87/2.90 | ALPHA: (aer_f1) implies: % 16.87/2.90 | (4) aer(f1, philharmonie) % 16.87/2.90 | % 16.87/2.90 | ALPHA: (act_f1) implies: % 16.87/2.90 | (5) act(f1, distrib) % 16.87/2.90 | % 16.87/2.90 | ALPHA: (tgt_f1) implies: % 16.87/2.90 | (6) tgt(f1, concert_ds) % 16.87/2.90 | % 16.87/2.90 | ALPHA: (act_e1_f1) implies: % 16.87/2.90 | (7) activates(e1, f1) % 16.87/2.91 | % 16.87/2.91 | ALPHA: (conjecture) implies: % 16.87/2.91 | (8) $i(marketplace) % 16.87/2.91 | (9) $i(philharmonie) % 16.87/2.91 | (10) $i(distrib) % 16.87/2.91 | (11) $i(concert_ds) % 16.87/2.91 | (12) $i(f1) % 16.87/2.91 | (13) $i(e1) % 16.87/2.91 | (14) ? [v0: $i] : (decl(distrib) = v0 & $i(v0) & ! [v1: $i] : ! [v2: $i] % 16.87/2.91 | : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 16.87/2.91 | about_event(v3, e1) | ~ about_event(v2, e1) | ~ subjection(v3) | % 16.87/2.91 | ~ power(v2) | ~ founds_rem(e1, v1, f1) | ~ part_of(v3, v1) | ~ % 16.87/2.91 | part_of(v2, v1) | ~ cnt(v3, v0, concert_ds) | ~ cnt(v2, v0, % 16.87/2.91 | concert_ds) | ~ bearer(v3, marketplace) | ~ bearer(v2, % 16.87/2.91 | philharmonie))) % 16.87/2.91 | % 16.87/2.91 | DELTA: instantiating (14) with fresh symbol all_12_0 gives: % 16.87/2.91 | (15) decl(distrib) = all_12_0 & $i(all_12_0) & ! [v0: $i] : ! [v1: $i] : % 16.87/2.91 | ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ about_event(v2, % 16.87/2.91 | e1) | ~ about_event(v1, e1) | ~ subjection(v2) | ~ power(v1) | % 16.87/2.91 | ~ founds_rem(e1, v0, f1) | ~ part_of(v2, v0) | ~ part_of(v1, v0) | % 16.87/2.91 | ~ cnt(v2, all_12_0, concert_ds) | ~ cnt(v1, all_12_0, concert_ds) % 16.87/2.91 | | ~ bearer(v2, marketplace) | ~ bearer(v1, philharmonie)) % 16.87/2.91 | % 16.87/2.91 | ALPHA: (15) implies: % 16.87/2.91 | (16) decl(distrib) = all_12_0 % 16.87/2.92 | (17) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 16.87/2.92 | $i(v0) | ~ about_event(v2, e1) | ~ about_event(v1, e1) | ~ % 16.87/2.92 | subjection(v2) | ~ power(v1) | ~ founds_rem(e1, v0, f1) | ~ % 16.87/2.92 | part_of(v2, v0) | ~ part_of(v1, v0) | ~ cnt(v2, all_12_0, % 16.87/2.92 | concert_ds) | ~ cnt(v1, all_12_0, concert_ds) | ~ bearer(v2, % 16.87/2.92 | marketplace) | ~ bearer(v1, philharmonie)) % 16.87/2.92 | % 16.87/2.92 | GROUND_INST: instantiating (ax_proh_relator_remedy) with f1, marketplace, % 16.87/2.92 | philharmonie, distrib, concert_ds, e1, all_12_0, simplifying with % 16.87/2.92 | (1), (2), (3), (4), (5), (6), (7), (8), (9), (10), (11), (12), % 16.87/2.92 | (13), (16) gives: % 16.87/2.92 | (18) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 16.87/2.92 | subjection(v2) & power(v1) & founds_rem(e1, v0, f1) & part_of(v2, % 16.87/2.92 | v0) & part_of(v1, v0) & cnt(v2, all_12_0, concert_ds) & cnt(v1, % 16.87/2.92 | all_12_0, concert_ds) & bearer(v2, marketplace) & bearer(v1, % 16.87/2.92 | philharmonie)) % 16.87/2.92 | % 16.87/2.92 | DELTA: instantiating (18) with fresh symbols all_22_0, all_22_1, all_22_2 % 16.87/2.92 | gives: % 16.87/2.92 | (19) $i(all_22_0) & $i(all_22_1) & $i(all_22_2) & subjection(all_22_0) & % 16.87/2.92 | power(all_22_1) & founds_rem(e1, all_22_2, f1) & part_of(all_22_0, % 16.87/2.92 | all_22_2) & part_of(all_22_1, all_22_2) & cnt(all_22_0, all_12_0, % 16.87/2.92 | concert_ds) & cnt(all_22_1, all_12_0, concert_ds) & bearer(all_22_0, % 16.87/2.92 | marketplace) & bearer(all_22_1, philharmonie) % 16.87/2.92 | % 16.87/2.92 | ALPHA: (19) implies: % 16.87/2.92 | (20) bearer(all_22_1, philharmonie) % 16.87/2.92 | (21) bearer(all_22_0, marketplace) % 16.87/2.92 | (22) cnt(all_22_1, all_12_0, concert_ds) % 16.87/2.92 | (23) cnt(all_22_0, all_12_0, concert_ds) % 16.87/2.92 | (24) part_of(all_22_1, all_22_2) % 16.87/2.92 | (25) part_of(all_22_0, all_22_2) % 16.87/2.92 | (26) founds_rem(e1, all_22_2, f1) % 16.87/2.92 | (27) power(all_22_1) % 16.87/2.92 | (28) subjection(all_22_0) % 16.87/2.93 | (29) $i(all_22_2) % 16.87/2.93 | (30) $i(all_22_1) % 16.87/2.93 | (31) $i(all_22_0) % 16.87/2.93 | % 16.87/2.93 | GROUND_INST: instantiating (ax_B2) with all_22_1, distrib, concert_ds, % 16.87/2.93 | all_22_2, e1, f1, all_12_0, simplifying with (10), (11), (12), % 16.87/2.93 | (13), (16), (22), (24), (26), (27), (29), (30) gives: % 16.87/2.93 | (32) about_event(all_22_1, e1) % 16.87/2.93 | % 16.87/2.93 | GROUND_INST: instantiating (ax_B3) with all_22_0, distrib, concert_ds, % 16.87/2.93 | all_22_2, e1, f1, all_12_0, simplifying with (10), (11), (12), % 16.87/2.93 | (13), (16), (23), (25), (26), (28), (29), (31) gives: % 16.87/2.93 | (33) about_event(all_22_0, e1) % 16.87/2.93 | % 16.87/2.93 | GROUND_INST: instantiating (17) with all_22_2, all_22_1, all_22_0, simplifying % 16.87/2.93 | with (20), (21), (22), (23), (24), (25), (26), (27), (28), (29), % 16.87/2.93 | (30), (31), (32), (33) gives: % 16.87/2.93 | (34) $false % 16.87/2.93 | % 16.87/2.93 | CLOSE: (34) is inconsistent. % 16.87/2.93 | % 16.87/2.93 End of proof % 16.87/2.93 % SZS output end Proof for theBenchmark % 16.87/2.93 % 16.87/2.93 2377ms %------------------------------------------------------------------------------