%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT117+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 : n005.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.59s 1.68s % Output : Proof 8.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT117+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.35 % Computer : n005.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Mon Sep 7 14:09:35 UTC 2026 % 0.10/0.36 % CPUTime : % 0.14/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.54/0.69 ________ _____ % 0.54/0.69 ___ __ \_________(_)________________________________ % 0.54/0.69 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.54/0.69 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.54/0.69 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.54/0.69 % 0.54/0.69 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.54/0.69 (2023-06-19) % 0.54/0.69 % 0.54/0.69 (c) Philipp Rümmer, 2009-2023 % 0.54/0.69 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.54/0.69 Amanda Stjerna. % 0.54/0.69 Free software under BSD-3-Clause. % 0.54/0.69 % 0.54/0.69 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.54/0.69 % 0.54/0.69 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.66/0.71 Running up to 7 provers in parallel. % 0.66/0.72 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.66/0.72 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.66/0.72 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.66/0.72 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.66/0.72 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.66/0.72 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.66/0.72 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.49/1.24 Prover 1: Preprocessing ... % 2.49/1.25 Prover 4: Preprocessing ... % 2.49/1.29 Prover 0: Preprocessing ... % 2.49/1.29 Prover 3: Preprocessing ... % 2.49/1.29 Prover 5: Preprocessing ... % 2.49/1.29 Prover 6: Preprocessing ... % 2.49/1.29 Prover 2: Preprocessing ... % 4.04/1.50 Prover 5: Constructing countermodel ... % 4.80/1.50 Prover 2: Constructing countermodel ... % 5.59/1.60 Prover 4: Constructing countermodel ... % 5.59/1.61 Prover 3: Constructing countermodel ... % 5.59/1.62 Prover 6: Proving ... % 5.59/1.63 Prover 0: Proving ... % 5.59/1.65 Prover 1: Constructing countermodel ... % 5.59/1.67 Prover 5: proved (952ms) % 5.59/1.68 % 5.59/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.59/1.68 % 5.59/1.68 Prover 2: proved (954ms) % 5.59/1.68 % 5.59/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.59/1.68 % 5.59/1.68 Prover 3: stopped % 5.59/1.69 Prover 6: stopped % 5.59/1.69 Prover 0: stopped % 6.34/1.70 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.34/1.70 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.34/1.70 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.34/1.70 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.34/1.70 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.34/1.73 Prover 8: Preprocessing ... % 6.34/1.75 Prover 11: Preprocessing ... % 6.34/1.75 Prover 10: Preprocessing ... % 6.34/1.76 Prover 7: Preprocessing ... % 6.34/1.77 Prover 13: Preprocessing ... % 7.12/1.83 Prover 10: Constructing countermodel ... % 7.12/1.84 Prover 13: Constructing countermodel ... % 7.12/1.84 Prover 7: Constructing countermodel ... % 7.12/1.87 Prover 10: Found proof (size 19) % 7.12/1.87 Prover 10: proved (183ms) % 7.12/1.87 Prover 1: stopped % 7.12/1.87 Prover 4: stopped % 7.12/1.87 Prover 7: stopped % 7.12/1.87 Prover 13: stopped % 7.86/1.92 Prover 8: Warning: ignoring some quantifiers % 7.86/1.94 Prover 8: Constructing countermodel ... % 7.86/1.96 Prover 11: Constructing countermodel ... % 7.86/1.96 Prover 8: stopped % 7.86/1.97 Prover 11: stopped % 7.86/1.97 % 7.86/1.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.86/1.97 % 7.86/1.98 % SZS output start Proof for theBenchmark % 7.86/1.99 Assumptions after simplification: % 7.86/1.99 --------------------------------- % 7.86/1.99 % 7.86/1.99 (act_e1_p1) % 7.86/2.00 $i(e1) & $i(p1) & activates(e1, p1) % 7.86/2.00 % 7.86/2.00 (act_p1) % 7.86/2.00 $i(p1) & $i(read) & act(p1, read) % 7.86/2.00 % 7.86/2.00 (action_read) % 7.86/2.00 $i(read) & action(read) % 7.86/2.00 % 7.86/2.00 (aee_p1) % 7.86/2.00 $i(p1) & $i(bibliothek) & aee(p1, bibliothek) % 7.86/2.00 % 7.86/2.00 (aer_p1) % 7.86/2.00 $i(p1) & $i(museen) & aer(p1, museen) % 7.86/2.00 % 7.86/2.00 (agent_bibliothek) % 7.86/2.00 $i(bibliothek) & agent(bibliothek) % 7.86/2.00 % 7.86/2.00 (agent_museen) % 7.86/2.00 $i(museen) & agent(museen) % 7.86/2.00 % 7.86/2.00 (ax_perm_relator_strong) % 7.86/2.01 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 7.86/2.01 $i] : ( ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 7.86/2.01 | ~ activates(v5, v0) | ~ tgt(v0, v4) | ~ act(v0, v3) | ~ aer(v0, v2) | % 7.86/2.01 ~ aee(v0, v1) | ~ strong(v0) | ~ perm(v0) | ? [v6: $i] : ? [v7: $i] : ? % 7.86/2.01 [v8: $i] : ($i(v8) & $i(v7) & $i(v6) & disability(v8) & part_of(v8, v6) & % 7.86/2.02 part_of(v7, v6) & cnt(v8, v3, v4) & cnt(v7, v3, v4) & bearer(v8, v2) & % 7.86/2.02 bearer(v7, v1) & immunity(v7) & founds_imm(v5, v6, v0))) % 7.86/2.02 % 7.86/2.02 (conjecture) % 7.86/2.02 $i(e1) & $i(p1) & $i(museum_api) & $i(read) & $i(museen) & ! [v0: $i] : ! % 7.86/2.02 [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ disability(v1) | ~ part_of(v1, v0) | % 7.86/2.02 ~ cnt(v1, read, museum_api) | ~ bearer(v1, museen) | ~ founds_imm(e1, v0, % 7.86/2.02 p1)) % 7.86/2.02 % 7.86/2.02 (event_e1) % 7.86/2.02 $i(e1) & event(e1) % 7.86/2.02 % 7.86/2.02 (perm_p1) % 7.86/2.02 $i(p1) & perm(p1) % 7.86/2.02 % 7.86/2.02 (rule_p1) % 7.86/2.02 $i(p1) & rule(p1) % 7.86/2.02 % 7.86/2.02 (strong_p1) % 7.86/2.02 $i(p1) & strong(p1) % 7.86/2.02 % 7.86/2.03 (target_museum) % 7.86/2.03 $i(museum_api) & target(museum_api) % 7.86/2.03 % 7.86/2.03 (tgt_p1) % 7.86/2.03 $i(p1) & $i(museum_api) & tgt(p1, museum_api) % 7.86/2.03 % 7.86/2.03 Those formulas are unsatisfiable: % 7.86/2.03 --------------------------------- % 7.86/2.03 % 7.86/2.03 Begin of proof % 8.55/2.03 | % 8.55/2.03 | ALPHA: (conjecture) implies: % 8.55/2.03 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ disability(v1) % 8.55/2.03 | | ~ part_of(v1, v0) | ~ cnt(v1, read, museum_api) | ~ bearer(v1, % 8.55/2.03 | museen) | ~ founds_imm(e1, v0, p1)) % 8.55/2.03 | % 8.55/2.03 | ALPHA: (act_e1_p1) implies: % 8.55/2.03 | (2) activates(e1, p1) % 8.55/2.03 | % 8.55/2.03 | ALPHA: (tgt_p1) implies: % 8.55/2.04 | (3) tgt(p1, museum_api) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (act_p1) implies: % 8.55/2.04 | (4) act(p1, read) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (aer_p1) implies: % 8.55/2.04 | (5) aer(p1, museen) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (aee_p1) implies: % 8.55/2.04 | (6) aee(p1, bibliothek) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (strong_p1) implies: % 8.55/2.04 | (7) strong(p1) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (perm_p1) implies: % 8.55/2.04 | (8) perm(p1) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (event_e1) implies: % 8.55/2.04 | (9) $i(e1) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (rule_p1) implies: % 8.55/2.04 | (10) $i(p1) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (target_museum) implies: % 8.55/2.04 | (11) $i(museum_api) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (action_read) implies: % 8.55/2.04 | (12) $i(read) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (agent_museen) implies: % 8.55/2.04 | (13) $i(museen) % 8.55/2.04 | % 8.55/2.04 | ALPHA: (agent_bibliothek) implies: % 8.55/2.04 | (14) $i(bibliothek) % 8.55/2.04 | % 8.55/2.05 | GROUND_INST: instantiating (ax_perm_relator_strong) with p1, bibliothek, % 8.55/2.05 | museen, read, museum_api, e1, simplifying with (2), (3), (4), % 8.55/2.05 | (5), (6), (7), (8), (9), (10), (11), (12), (13), (14) gives: % 8.55/2.05 | (15) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 8.55/2.05 | disability(v2) & part_of(v2, v0) & part_of(v1, v0) & cnt(v2, read, % 8.55/2.05 | museum_api) & cnt(v1, read, museum_api) & bearer(v2, museen) & % 8.55/2.05 | bearer(v1, bibliothek) & immunity(v1) & founds_imm(e1, v0, p1)) % 8.55/2.05 | % 8.55/2.05 | DELTA: instantiating (15) with fresh symbols all_10_0, all_10_1, all_10_2 % 8.55/2.05 | gives: % 8.55/2.05 | (16) $i(all_10_0) & $i(all_10_1) & $i(all_10_2) & disability(all_10_0) & % 8.55/2.05 | part_of(all_10_0, all_10_2) & part_of(all_10_1, all_10_2) & % 8.55/2.05 | cnt(all_10_0, read, museum_api) & cnt(all_10_1, read, museum_api) & % 8.55/2.05 | bearer(all_10_0, museen) & bearer(all_10_1, bibliothek) & % 8.55/2.05 | immunity(all_10_1) & founds_imm(e1, all_10_2, p1) % 8.55/2.05 | % 8.55/2.05 | ALPHA: (16) implies: % 8.55/2.06 | (17) founds_imm(e1, all_10_2, p1) % 8.55/2.06 | (18) bearer(all_10_0, museen) % 8.55/2.06 | (19) cnt(all_10_0, read, museum_api) % 8.55/2.06 | (20) part_of(all_10_0, all_10_2) % 8.55/2.06 | (21) disability(all_10_0) % 8.55/2.06 | (22) $i(all_10_2) % 8.55/2.06 | (23) $i(all_10_0) % 8.55/2.06 | % 8.55/2.06 | GROUND_INST: instantiating (1) with all_10_2, all_10_0, simplifying with (17), % 8.55/2.06 | (18), (19), (20), (21), (22), (23) gives: % 8.55/2.06 | (24) $false % 8.55/2.06 | % 8.55/2.06 | CLOSE: (24) is inconsistent. % 8.55/2.06 | % 8.55/2.06 End of proof % 8.55/2.06 % SZS output end Proof for theBenchmark % 8.55/2.06 % 8.55/2.06 1372ms %------------------------------------------------------------------------------