%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT111+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 : n020.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 5.02s 1.45s % Output : Proof 7.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT111+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.03 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.07/0.34 % Computer : n020.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 14:06:43 UTC 2026 % 0.07/0.34 % CPUTime : % 0.07/0.36 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.54/0.68 ________ _____ % 0.54/0.68 ___ __ \_________(_)________________________________ % 0.54/0.68 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.54/0.68 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.54/0.68 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.54/0.68 % 0.54/0.68 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.54/0.68 (2023-06-19) % 0.54/0.68 % 0.54/0.68 (c) Philipp Rümmer, 2009-2023 % 0.54/0.68 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.54/0.68 Amanda Stjerna. % 0.54/0.68 Free software under BSD-3-Clause. % 0.54/0.68 % 0.54/0.68 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.54/0.68 % 0.54/0.68 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.66/0.70 Running up to 7 provers in parallel. % 0.66/0.71 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.66/0.71 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.66/0.71 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.66/0.71 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.66/0.71 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.66/0.71 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.66/0.71 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.37/1.06 Prover 4: Preprocessing ... % 2.37/1.06 Prover 1: Preprocessing ... % 2.37/1.13 Prover 0: Preprocessing ... % 2.37/1.13 Prover 2: Preprocessing ... % 2.37/1.13 Prover 3: Preprocessing ... % 2.37/1.13 Prover 6: Preprocessing ... % 2.37/1.13 Prover 5: Preprocessing ... % 3.44/1.28 Prover 5: Constructing countermodel ... % 3.44/1.28 Prover 2: Constructing countermodel ... % 4.22/1.34 Prover 3: Constructing countermodel ... % 4.22/1.35 Prover 1: Constructing countermodel ... % 4.22/1.35 Prover 6: Proving ... % 4.22/1.37 Prover 4: Constructing countermodel ... % 5.02/1.42 Prover 0: Proving ... % 5.02/1.44 Prover 5: proved (730ms) % 5.02/1.45 % 5.02/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.02/1.45 % 5.02/1.45 Prover 2: stopped % 5.02/1.45 Prover 0: stopped % 5.02/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.02/1.46 Prover 6: stopped % 5.02/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.02/1.46 Prover 3: stopped % 5.02/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.02/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.02/1.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.02/1.49 Prover 7: Preprocessing ... % 5.02/1.50 Prover 8: Preprocessing ... % 5.81/1.50 Prover 13: Preprocessing ... % 5.81/1.51 Prover 11: Preprocessing ... % 5.81/1.52 Prover 10: Preprocessing ... % 5.81/1.53 Prover 7: Constructing countermodel ... % 5.81/1.56 Prover 10: Constructing countermodel ... % 5.81/1.56 Prover 13: Constructing countermodel ... % 6.58/1.63 Prover 8: Warning: ignoring some quantifiers % 6.58/1.63 Prover 13: Found proof (size 15) % 6.58/1.63 Prover 7: Found proof (size 15) % 6.58/1.63 Prover 13: proved (169ms) % 6.58/1.64 Prover 7: proved (181ms) % 6.58/1.64 Prover 8: Constructing countermodel ... % 6.58/1.64 Prover 10: stopped % 6.58/1.64 Prover 1: stopped % 6.58/1.64 Prover 4: stopped % 6.58/1.65 Prover 8: stopped % 6.58/1.67 Prover 11: Constructing countermodel ... % 6.58/1.68 Prover 11: stopped % 6.58/1.68 % 6.58/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.58/1.68 % 6.58/1.69 % SZS output start Proof for theBenchmark % 6.58/1.69 Assumptions after simplification: % 6.58/1.69 --------------------------------- % 6.58/1.69 % 6.58/1.69 (action_modify) % 7.14/1.70 $i(modify_act) & action(modify_act) % 7.14/1.70 % 7.14/1.70 (agent_portal) % 7.14/1.70 $i(portal) & agent(portal) % 7.14/1.70 % 7.14/1.70 (conjecture) % 7.14/1.70 $i(theater_ds) & $i(modify_act) & $i(portal) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.14/1.70 cnt(v0, modify_act, theater_ds) | ~ bearer(v0, portal) | ~ permission(v0)) % 7.14/1.70 % 7.14/1.70 (no_proh_modify) % 7.14/1.70 $i(modify_act) & $i(portal) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 7.14/1.70 $i(v0) | ~ activates(v1, v0) | ~ act(v0, modify_act) | ~ aee(v0, portal) % 7.14/1.70 | ~ proh(v0)) % 7.14/1.70 % 7.14/1.70 (open_world_closure) % 7.14/1.71 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 7.14/1.71 ~ target(v2) | ~ action(v1) | ~ agent(v0) | ? [v3: $i] : ? [v4: $i] : % 7.14/1.71 ($i(v4) & $i(v3) & ((cnt(v3, v1, v2) & bearer(v3, v0) & permission(v3)) | % 7.14/1.71 (activates(v4, v3) & act(v3, v1) & aee(v3, v0) & proh(v3))))) % 7.14/1.71 % 7.14/1.71 (target_theater) % 7.14/1.71 $i(theater_ds) & target(theater_ds) % 7.14/1.71 % 7.14/1.71 Further assumptions not needed in the proof: % 7.14/1.71 -------------------------------------------- % 7.14/1.71 agent_ensemble % 7.14/1.71 % 7.14/1.71 Those formulas are unsatisfiable: % 7.14/1.71 --------------------------------- % 7.14/1.71 % 7.14/1.71 Begin of proof % 7.14/1.71 | % 7.14/1.71 | ALPHA: (conjecture) implies: % 7.14/1.71 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ cnt(v0, modify_act, theater_ds) | ~ % 7.14/1.71 | bearer(v0, portal) | ~ permission(v0)) % 7.14/1.71 | % 7.14/1.71 | ALPHA: (no_proh_modify) implies: % 7.14/1.71 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ activates(v1, % 7.14/1.71 | v0) | ~ act(v0, modify_act) | ~ aee(v0, portal) | ~ proh(v0)) % 7.14/1.71 | % 7.14/1.71 | ALPHA: (target_theater) implies: % 7.14/1.72 | (3) target(theater_ds) % 7.14/1.72 | (4) $i(theater_ds) % 7.14/1.72 | % 7.14/1.72 | ALPHA: (action_modify) implies: % 7.14/1.72 | (5) action(modify_act) % 7.14/1.72 | (6) $i(modify_act) % 7.14/1.72 | % 7.14/1.72 | ALPHA: (agent_portal) implies: % 7.14/1.72 | (7) agent(portal) % 7.14/1.72 | (8) $i(portal) % 7.14/1.72 | % 7.14/1.72 | GROUND_INST: instantiating (open_world_closure) with portal, modify_act, % 7.14/1.72 | theater_ds, simplifying with (3), (4), (5), (6), (7), (8) gives: % 7.14/1.72 | (9) ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & ((cnt(v0, modify_act, % 7.14/1.72 | theater_ds) & bearer(v0, portal) & permission(v0)) | % 7.14/1.72 | (activates(v1, v0) & act(v0, modify_act) & aee(v0, portal) & % 7.14/1.72 | proh(v0)))) % 7.14/1.72 | % 7.14/1.72 | DELTA: instantiating (9) with fresh symbols all_11_0, all_11_1 gives: % 7.14/1.72 | (10) $i(all_11_0) & $i(all_11_1) & ((cnt(all_11_1, modify_act, theater_ds) % 7.14/1.72 | & bearer(all_11_1, portal) & permission(all_11_1)) | % 7.14/1.72 | (activates(all_11_0, all_11_1) & act(all_11_1, modify_act) & % 7.14/1.72 | aee(all_11_1, portal) & proh(all_11_1))) % 7.14/1.72 | % 7.14/1.72 | ALPHA: (10) implies: % 7.14/1.72 | (11) $i(all_11_1) % 7.14/1.72 | (12) $i(all_11_0) % 7.14/1.72 | (13) (cnt(all_11_1, modify_act, theater_ds) & bearer(all_11_1, portal) & % 7.14/1.72 | permission(all_11_1)) | (activates(all_11_0, all_11_1) & % 7.14/1.72 | act(all_11_1, modify_act) & aee(all_11_1, portal) & proh(all_11_1)) % 7.14/1.72 | % 7.14/1.72 | BETA: splitting (13) gives: % 7.14/1.72 | % 7.14/1.73 | Case 1: % 7.14/1.73 | | % 7.14/1.73 | | (14) cnt(all_11_1, modify_act, theater_ds) & bearer(all_11_1, portal) & % 7.14/1.73 | | permission(all_11_1) % 7.14/1.73 | | % 7.14/1.73 | | ALPHA: (14) implies: % 7.14/1.73 | | (15) permission(all_11_1) % 7.14/1.73 | | (16) bearer(all_11_1, portal) % 7.14/1.73 | | (17) cnt(all_11_1, modify_act, theater_ds) % 7.14/1.73 | | % 7.14/1.73 | | GROUND_INST: instantiating (1) with all_11_1, simplifying with (11), (15), % 7.14/1.73 | | (16), (17) gives: % 7.14/1.73 | | (18) $false % 7.14/1.73 | | % 7.14/1.73 | | CLOSE: (18) is inconsistent. % 7.14/1.73 | | % 7.14/1.73 | Case 2: % 7.14/1.73 | | % 7.14/1.73 | | (19) activates(all_11_0, all_11_1) & act(all_11_1, modify_act) & % 7.14/1.73 | | aee(all_11_1, portal) & proh(all_11_1) % 7.14/1.73 | | % 7.14/1.73 | | ALPHA: (19) implies: % 7.14/1.73 | | (20) proh(all_11_1) % 7.14/1.73 | | (21) aee(all_11_1, portal) % 7.14/1.73 | | (22) act(all_11_1, modify_act) % 7.14/1.73 | | (23) activates(all_11_0, all_11_1) % 7.14/1.73 | | % 7.14/1.73 | | GROUND_INST: instantiating (2) with all_11_1, all_11_0, simplifying with % 7.14/1.73 | | (11), (12), (20), (21), (22), (23) gives: % 7.14/1.73 | | (24) $false % 7.14/1.73 | | % 7.14/1.73 | | CLOSE: (24) is inconsistent. % 7.14/1.73 | | % 7.14/1.73 | End of split % 7.14/1.73 | % 7.14/1.73 End of proof % 7.14/1.73 % SZS output end Proof for theBenchmark % 7.14/1.73 % 7.14/1.73 1049ms %------------------------------------------------------------------------------