%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT115+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 : n009.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 3.77s 1.46s % Output : Proof 5.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT115+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 : n009.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:08:52 UTC 2026 % 0.13/0.36 % CPUTime : % 0.13/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.68/0.70 ________ _____ % 0.68/0.70 ___ __ \_________(_)________________________________ % 0.68/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.68/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.68/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.68/0.70 % 0.68/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.68/0.70 (2023-06-19) % 0.68/0.70 % 0.68/0.70 (c) Philipp Rümmer, 2009-2023 % 0.68/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.68/0.70 Amanda Stjerna. % 0.68/0.70 Free software under BSD-3-Clause. % 0.68/0.70 % 0.68/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.68/0.70 % 0.68/0.70 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.72 Running up to 7 provers in parallel. % 0.68/0.73 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.73 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.73 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.73 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.73 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.73 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.73 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.87/1.18 Prover 1: Preprocessing ... % 1.87/1.18 Prover 4: Preprocessing ... % 2.36/1.25 Prover 0: Preprocessing ... % 2.36/1.25 Prover 5: Preprocessing ... % 2.36/1.25 Prover 3: Preprocessing ... % 2.36/1.25 Prover 2: Preprocessing ... % 2.36/1.25 Prover 6: Preprocessing ... % 3.11/1.34 Prover 1: Constructing countermodel ... % 3.11/1.34 Prover 6: Constructing countermodel ... % 3.11/1.34 Prover 4: Constructing countermodel ... % 3.11/1.34 Prover 3: Constructing countermodel ... % 3.11/1.35 Prover 2: Proving ... % 3.11/1.35 Prover 5: Proving ... % 3.11/1.35 Prover 0: Proving ... % 3.77/1.45 Prover 6: proved (720ms) % 3.77/1.45 % 3.77/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.77/1.46 % 3.77/1.46 Prover 3: proved (725ms) % 3.77/1.46 % 3.77/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.77/1.46 % 3.77/1.46 Prover 2: stopped % 3.77/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.77/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.77/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.77/1.47 Prover 0: proved (736ms) % 3.77/1.47 Prover 5: proved (735ms) % 3.77/1.47 % 3.77/1.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.77/1.47 % 3.77/1.47 % 3.77/1.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.77/1.47 % 3.77/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.77/1.47 Prover 8: Preprocessing ... % 3.77/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.77/1.48 Prover 7: Preprocessing ... % 3.77/1.48 Prover 1: Found proof (size 7) % 3.77/1.48 Prover 4: Found proof (size 7) % 3.77/1.48 Prover 4: proved (748ms) % 3.77/1.48 Prover 1: proved (748ms) % 3.77/1.49 Prover 10: Preprocessing ... % 3.77/1.49 Prover 13: Preprocessing ... % 3.77/1.49 Prover 11: Preprocessing ... % 3.77/1.49 Prover 8: Warning: ignoring some quantifiers % 3.77/1.50 Prover 8: Constructing countermodel ... % 4.53/1.51 Prover 8: stopped % 4.53/1.51 Prover 7: Constructing countermodel ... % 4.53/1.51 Prover 7: stopped % 4.53/1.52 Prover 10: Constructing countermodel ... % 4.53/1.53 Prover 10: stopped % 4.53/1.53 Prover 11: Constructing countermodel ... % 4.53/1.53 Prover 13: Warning: ignoring some quantifiers % 4.53/1.54 Prover 13: Constructing countermodel ... % 4.53/1.54 Prover 11: stopped % 4.53/1.54 Prover 13: stopped % 4.53/1.54 % 4.53/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.53/1.55 % 4.53/1.55 % SZS output start Proof for theBenchmark % 4.53/1.55 Assumptions after simplification: % 4.53/1.55 --------------------------------- % 4.53/1.56 % 4.53/1.56 (conjecture) % 5.02/1.61 $i(pi2) & $i(pi1) & ? [v0: $i] : (issue(pi2) = v0 & issue(pi1) = v0 & $i(v0)) % 5.02/1.61 % 5.02/1.61 (issue_injective) % 5.02/1.62 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (issue(v1) = v2) | ~ % 5.02/1.62 (issue(v0) = v2) | ~ $i(v1) | ~ $i(v0)) % 5.02/1.62 % 5.02/1.62 (pi1_neq_pi2) % 5.02/1.62 ~ (pi2 = pi1) & $i(pi2) & $i(pi1) % 5.02/1.62 % 5.02/1.62 Further assumptions not needed in the proof: % 5.02/1.62 -------------------------------------------- % 5.02/1.62 rule_pi1, rule_pi2 % 5.02/1.62 % 5.02/1.62 Those formulas are unsatisfiable: % 5.02/1.62 --------------------------------- % 5.02/1.62 % 5.02/1.62 Begin of proof % 5.02/1.62 | % 5.02/1.62 | ALPHA: (pi1_neq_pi2) implies: % 5.02/1.62 | (1) ~ (pi2 = pi1) % 5.02/1.62 | % 5.02/1.62 | ALPHA: (conjecture) implies: % 5.02/1.63 | (2) $i(pi1) % 5.02/1.63 | (3) $i(pi2) % 5.02/1.63 | (4) ? [v0: $i] : (issue(pi2) = v0 & issue(pi1) = v0 & $i(v0)) % 5.02/1.63 | % 5.02/1.63 | DELTA: instantiating (4) with fresh symbol all_5_0 gives: % 5.02/1.63 | (5) issue(pi2) = all_5_0 & issue(pi1) = all_5_0 & $i(all_5_0) % 5.02/1.63 | % 5.02/1.63 | ALPHA: (5) implies: % 5.02/1.63 | (6) issue(pi1) = all_5_0 % 5.02/1.63 | (7) issue(pi2) = all_5_0 % 5.02/1.64 | % 5.02/1.64 | GROUND_INST: instantiating (issue_injective) with pi1, pi2, all_5_0, % 5.02/1.64 | simplifying with (2), (3), (6), (7) gives: % 5.02/1.64 | (8) pi2 = pi1 % 5.02/1.64 | % 5.02/1.64 | REDUCE: (1), (8) imply: % 5.02/1.64 | (9) $false % 5.02/1.64 | % 5.02/1.64 | CLOSE: (9) is inconsistent. % 5.02/1.64 | % 5.02/1.64 End of proof % 5.02/1.64 % SZS output end Proof for theBenchmark % 5.02/1.64 % 5.02/1.64 940ms %------------------------------------------------------------------------------