%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT116+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 : n028.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 4.91s 1.45s % Output : Proof 6.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT116+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 : n028.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:11:47 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.68/0.71 ________ _____ % 0.68/0.71 ___ __ \_________(_)________________________________ % 0.68/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.68/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.68/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.68/0.71 % 0.68/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.68/0.71 (2023-06-19) % 0.68/0.71 % 0.68/0.71 (c) Philipp Rümmer, 2009-2023 % 0.68/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.68/0.71 Amanda Stjerna. % 0.68/0.71 Free software under BSD-3-Clause. % 0.68/0.71 % 0.68/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.68/0.71 % 0.68/0.71 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.73 Running up to 7 provers in parallel. % 0.68/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.04/1.04 Prover 4: Preprocessing ... % 2.04/1.05 Prover 1: Preprocessing ... % 2.04/1.09 Prover 3: Preprocessing ... % 2.04/1.09 Prover 6: Preprocessing ... % 2.04/1.09 Prover 5: Preprocessing ... % 2.04/1.09 Prover 2: Preprocessing ... % 2.04/1.09 Prover 0: Preprocessing ... % 4.11/1.30 Prover 2: Proving ... % 4.11/1.30 Prover 5: Proving ... % 4.11/1.30 Prover 3: Constructing countermodel ... % 4.11/1.33 Prover 6: Constructing countermodel ... % 4.11/1.35 Prover 1: Constructing countermodel ... % 4.11/1.37 Prover 0: Proving ... % 4.11/1.38 Prover 4: Constructing countermodel ... % 4.91/1.45 Prover 2: proved (710ms) % 4.91/1.45 % 4.91/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.91/1.45 % 4.91/1.45 Prover 5: proved (708ms) % 4.91/1.45 % 4.91/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.91/1.45 % 4.91/1.45 Prover 6: stopped % 4.91/1.46 Prover 0: stopped % 4.91/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.91/1.46 Prover 3: stopped % 4.91/1.47 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.91/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.91/1.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.91/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.91/1.48 Prover 7: Preprocessing ... % 5.66/1.50 Prover 8: Preprocessing ... % 5.66/1.50 Prover 13: Preprocessing ... % 5.66/1.52 Prover 11: Preprocessing ... % 5.66/1.53 Prover 10: Preprocessing ... % 5.66/1.54 Prover 7: Constructing countermodel ... % 5.66/1.55 Prover 13: Warning: ignoring some quantifiers % 5.66/1.56 Prover 13: Constructing countermodel ... % 5.66/1.56 Prover 7: Found proof (size 9) % 5.66/1.57 Prover 7: proved (112ms) % 5.66/1.57 Prover 4: stopped % 5.66/1.57 Prover 10: Constructing countermodel ... % 5.66/1.57 Prover 1: stopped % 5.66/1.57 Prover 13: stopped % 5.66/1.58 Prover 10: stopped % 6.41/1.61 Prover 11: Constructing countermodel ... % 6.41/1.61 Prover 8: Warning: ignoring some quantifiers % 6.41/1.61 Prover 11: stopped % 6.41/1.62 Prover 8: Constructing countermodel ... % 6.41/1.63 Prover 8: stopped % 6.41/1.63 % 6.41/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.41/1.63 % 6.41/1.64 % SZS output start Proof for theBenchmark % 6.41/1.64 Assumptions after simplification: % 6.41/1.64 --------------------------------- % 6.41/1.64 % 6.41/1.64 (ax_B3) % 6.93/1.70 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 6.93/1.70 $i] : ! [v6: $i] : ( ~ (decl(v1) = v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) % 6.93/1.70 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ founds_rem(v4, v3, v5) | ~ % 6.93/1.70 part_of(v0, v3) | ~ cnt(v0, v6, v2) | ~ subjection(v0) | about_event(v0, % 6.93/1.70 v4)) % 6.93/1.70 % 6.93/1.70 (cnt_s) % 6.93/1.70 $i(some_target) & $i(some_action) & $i(s) & ? [v0: $i] : (decl(some_action) = % 6.93/1.70 v0 & $i(v0) & cnt(s, v0, some_target)) % 6.93/1.70 % 6.93/1.70 (conjecture) % 6.93/1.71 $i(e1) & $i(s) & ~ about_event(s, e1) % 6.93/1.71 % 6.93/1.71 (founds_rem1) % 6.93/1.71 $i(e1) & $i(f1) & $i(rho_r) & founds_rem(e1, rho_r, f1) % 6.93/1.71 % 6.93/1.71 (partof_s) % 6.93/1.71 $i(rho_r) & $i(s) & part_of(s, rho_r) % 6.93/1.71 % 6.93/1.71 (subj_s) % 6.93/1.71 $i(s) & subjection(s) % 6.93/1.71 % 6.93/1.71 Further assumptions not needed in the proof: % 6.93/1.71 -------------------------------------------- % 6.93/1.71 action_a, event_e1, pos_s, rel_rho_r, rule_f1, target_t % 6.93/1.71 % 6.93/1.71 Those formulas are unsatisfiable: % 6.93/1.71 --------------------------------- % 6.93/1.71 % 6.93/1.71 Begin of proof % 6.93/1.71 | % 6.93/1.71 | ALPHA: (subj_s) implies: % 6.93/1.72 | (1) subjection(s) % 6.93/1.72 | % 6.93/1.72 | ALPHA: (cnt_s) implies: % 6.93/1.72 | (2) $i(some_action) % 6.93/1.72 | (3) $i(some_target) % 6.93/1.72 | (4) ? [v0: $i] : (decl(some_action) = v0 & $i(v0) & cnt(s, v0, % 6.93/1.72 | some_target)) % 6.93/1.72 | % 6.93/1.72 | ALPHA: (partof_s) implies: % 6.93/1.72 | (5) part_of(s, rho_r) % 6.93/1.72 | % 6.93/1.72 | ALPHA: (founds_rem1) implies: % 6.93/1.72 | (6) founds_rem(e1, rho_r, f1) % 6.93/1.72 | (7) $i(rho_r) % 6.93/1.72 | (8) $i(f1) % 6.93/1.72 | % 6.93/1.72 | ALPHA: (conjecture) implies: % 6.93/1.73 | (9) ~ about_event(s, e1) % 6.93/1.73 | (10) $i(s) % 6.93/1.73 | (11) $i(e1) % 6.93/1.73 | % 6.93/1.73 | DELTA: instantiating (4) with fresh symbol all_5_0 gives: % 6.93/1.73 | (12) decl(some_action) = all_5_0 & $i(all_5_0) & cnt(s, all_5_0, % 6.93/1.73 | some_target) % 6.93/1.73 | % 6.93/1.73 | ALPHA: (12) implies: % 6.93/1.73 | (13) cnt(s, all_5_0, some_target) % 6.93/1.73 | (14) decl(some_action) = all_5_0 % 6.93/1.73 | % 6.93/1.74 | GROUND_INST: instantiating (ax_B3) with s, some_action, some_target, rho_r, % 6.93/1.74 | e1, f1, all_5_0, simplifying with (1), (2), (3), (5), (6), (7), % 6.93/1.74 | (8), (9), (10), (11), (13), (14) gives: % 6.93/1.74 | (15) $false % 6.93/1.74 | % 6.93/1.74 | CLOSE: (15) is inconsistent. % 6.93/1.74 | % 6.93/1.74 End of proof % 6.93/1.74 % SZS output end Proof for theBenchmark % 6.93/1.74 % 6.93/1.74 1030ms %------------------------------------------------------------------------------