%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT112+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 : n019.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 : Unsatisfiable 5.53s 1.56s % Output : Proof 8.38s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT112+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.10/0.36 % Computer : n019.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 14:07:07 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.38 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.70/0.72 ________ _____ % 0.70/0.72 ___ __ \_________(_)________________________________ % 0.70/0.72 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.72 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.72 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.72 % 0.70/0.72 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.72 (2023-06-19) % 0.70/0.72 % 0.70/0.72 (c) Philipp Rümmer, 2009-2023 % 0.70/0.72 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.72 Amanda Stjerna. % 0.70/0.72 Free software under BSD-3-Clause. % 0.70/0.72 % 0.70/0.72 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.72 % 0.70/0.72 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.74 Running up to 7 provers in parallel. % 0.70/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.13/1.12 Prover 1: Preprocessing ... % 2.13/1.12 Prover 4: Preprocessing ... % 3.20/1.20 Prover 5: Preprocessing ... % 3.20/1.20 Prover 2: Preprocessing ... % 3.20/1.20 Prover 0: Preprocessing ... % 3.20/1.20 Prover 6: Preprocessing ... % 3.20/1.21 Prover 3: Preprocessing ... % 4.77/1.40 Prover 2: Constructing countermodel ... % 4.77/1.40 Prover 5: Constructing countermodel ... % 4.77/1.49 Prover 3: Constructing countermodel ... % 5.53/1.55 Prover 2: proved (804ms) % 5.53/1.55 % 5.53/1.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.53/1.56 % 5.53/1.56 Prover 3: stopped % 5.53/1.56 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.53/1.56 Prover 5: stopped % 5.53/1.56 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.53/1.57 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.53/1.57 Prover 6: Proving ... % 5.53/1.57 Prover 6: stopped % 5.53/1.57 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.31/1.62 Prover 0: Proving ... % 6.31/1.62 Prover 10: Preprocessing ... % 6.31/1.62 Prover 7: Preprocessing ... % 6.31/1.62 Prover 0: stopped % 6.31/1.63 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.31/1.64 Prover 1: Constructing countermodel ... % 6.31/1.65 Prover 8: Preprocessing ... % 6.31/1.66 Prover 4: Constructing countermodel ... % 6.31/1.66 Prover 13: Preprocessing ... % 6.31/1.67 Prover 11: Preprocessing ... % 6.31/1.69 Prover 10: Constructing countermodel ... % 7.10/1.72 Prover 7: Constructing countermodel ... % 7.10/1.77 Prover 7: Found proof (size 16) % 7.10/1.77 Prover 10: Found proof (size 16) % 7.10/1.77 Prover 7: proved (208ms) % 7.10/1.77 Prover 10: proved (207ms) % 7.10/1.77 Prover 1: stopped % 7.10/1.78 Prover 13: Constructing countermodel ... % 7.10/1.78 Prover 4: stopped % 7.10/1.79 Prover 13: stopped % 7.87/1.80 Prover 8: Warning: ignoring some quantifiers % 7.87/1.81 Prover 8: Constructing countermodel ... % 7.87/1.82 Prover 8: stopped % 8.38/1.92 Prover 11: Constructing countermodel ... % 8.38/1.94 Prover 11: stopped % 8.38/1.94 % 8.38/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.38/1.95 % 8.38/1.95 % SZS output start Proof for theBenchmark % 8.38/1.96 Assumptions after simplification: % 8.38/1.96 --------------------------------- % 8.38/1.96 % 8.38/1.96 (act_f2) % 8.38/1.97 $i(f2) & $i(read) & act(f2, read) % 8.38/1.97 % 8.38/1.97 (action_read) % 8.38/1.97 $i(read) & action(read) % 8.38/1.97 % 8.38/1.97 (aee_f2) % 8.38/1.97 $i(f2) & $i(bibliothek) & aee(f2, bibliothek) % 8.38/1.97 % 8.38/1.97 (aer_f2) % 8.38/1.97 $i(f2) & $i(museen) & aer(f2, museen) % 8.38/1.97 % 8.38/1.98 (agent_bibliothek) % 8.38/1.98 $i(bibliothek) & agent(bibliothek) % 8.38/1.98 % 8.38/1.98 (agent_museen) % 8.38/1.98 $i(museen) & agent(museen) % 8.38/1.98 % 8.38/1.98 (ax_disability_block) % 8.38/1.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 8.38/1.98 $i] : ( ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 8.38/1.98 | ~ cnt(v5, v3, v4) | ~ bearer(v5, v2) | ~ disability(v5) | ~ tgt(v0, % 8.38/1.98 v4) | ~ act(v0, v3) | ~ aer(v0, v2) | ~ aee(v0, v1) | ~ proh(v0)) % 8.38/1.98 % 8.38/1.98 (bearer_db) % 8.38/1.99 $i(db) & $i(museen) & bearer(db, museen) % 8.38/1.99 % 8.38/1.99 (cnt_db) % 8.38/1.99 $i(db) & $i(museum_api) & $i(read) & cnt(db, read, museum_api) % 8.38/1.99 % 8.38/1.99 (disability_db) % 8.38/1.99 $i(db) & disability(db) % 8.38/1.99 % 8.38/1.99 (pos_db) % 8.38/1.99 $i(db) & position(db) % 8.38/1.99 % 8.38/1.99 (proh_f2) % 8.38/1.99 $i(f2) & proh(f2) % 8.38/1.99 % 8.38/1.99 (rule_f2) % 8.38/1.99 $i(f2) & rule(f2) % 8.38/1.99 % 8.38/1.99 (target_museum) % 8.38/1.99 $i(museum_api) & target(museum_api) % 8.38/1.99 % 8.38/1.99 (tgt_f2) % 8.38/1.99 $i(f2) & $i(museum_api) & tgt(f2, museum_api) % 8.38/1.99 % 8.38/1.99 Further assumptions not needed in the proof: % 8.38/1.99 -------------------------------------------- % 8.38/1.99 bearer_im, bearer_l, bearer_n, cnt_im, cnt_l, cnt_n, immunity_im, no_right_n, % 8.38/1.99 odrl_rho1, permission_l, pos_im, pos_l, pos_n, rel_rho1 % 8.38/1.99 % 8.38/1.99 Those formulas are unsatisfiable: % 8.38/1.99 --------------------------------- % 8.38/1.99 % 8.38/1.99 Begin of proof % 8.38/2.00 | % 8.38/2.00 | ALPHA: (tgt_f2) implies: % 8.38/2.00 | (1) tgt(f2, museum_api) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (act_f2) implies: % 8.38/2.00 | (2) act(f2, read) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (aer_f2) implies: % 8.38/2.00 | (3) aer(f2, museen) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (aee_f2) implies: % 8.38/2.00 | (4) aee(f2, bibliothek) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (proh_f2) implies: % 8.38/2.00 | (5) proh(f2) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (rule_f2) implies: % 8.38/2.00 | (6) $i(f2) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (cnt_db) implies: % 8.38/2.00 | (7) cnt(db, read, museum_api) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (bearer_db) implies: % 8.38/2.00 | (8) bearer(db, museen) % 8.38/2.00 | % 8.38/2.00 | ALPHA: (disability_db) implies: % 8.38/2.01 | (9) disability(db) % 8.38/2.01 | % 8.38/2.01 | ALPHA: (pos_db) implies: % 8.38/2.01 | (10) $i(db) % 8.38/2.01 | % 8.38/2.01 | ALPHA: (target_museum) implies: % 8.38/2.01 | (11) $i(museum_api) % 8.38/2.01 | % 8.38/2.01 | ALPHA: (action_read) implies: % 8.38/2.01 | (12) $i(read) % 8.38/2.01 | % 8.38/2.01 | ALPHA: (agent_museen) implies: % 8.38/2.01 | (13) $i(museen) % 8.38/2.01 | % 8.38/2.01 | ALPHA: (agent_bibliothek) implies: % 8.38/2.01 | (14) $i(bibliothek) % 8.38/2.01 | % 8.38/2.02 | GROUND_INST: instantiating (ax_disability_block) with f2, bibliothek, museen, % 8.38/2.02 | read, museum_api, db, simplifying with (1), (2), (3), (4), (5), % 8.38/2.02 | (6), (7), (8), (9), (10), (11), (12), (13), (14) gives: % 8.38/2.02 | (15) $false % 8.38/2.02 | % 8.38/2.02 | CLOSE: (15) is inconsistent. % 8.38/2.02 | % 8.38/2.02 End of proof % 8.38/2.02 % SZS output end Proof for theBenchmark % 8.38/2.02 % 8.38/2.02 1301ms %------------------------------------------------------------------------------