%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT052+1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n010.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:26 AM UTC 2026 % Result : Theorem 5.66s 1.54s % Output : Proof 8.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT052+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.35 % Computer : n010.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 13:20:56 UTC 2026 % 0.09/0.35 % 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.70/0.70 ________ _____ % 0.70/0.70 ___ __ \_________(_)________________________________ % 0.70/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.70 % 0.70/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.70 (2023-06-19) % 0.70/0.70 % 0.70/0.70 (c) Philipp Rümmer, 2009-2023 % 0.70/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.70 Amanda Stjerna. % 0.70/0.70 Free software under BSD-3-Clause. % 0.70/0.70 % 0.70/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.70 % 0.70/0.71 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.72 Running up to 7 provers in parallel. % 0.70/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.05/1.11 Prover 4: Preprocessing ... % 2.05/1.11 Prover 1: Preprocessing ... % 2.81/1.15 Prover 3: Preprocessing ... % 2.81/1.15 Prover 6: Preprocessing ... % 2.81/1.16 Prover 2: Preprocessing ... % 2.81/1.16 Prover 0: Preprocessing ... % 2.81/1.16 Prover 5: Preprocessing ... % 4.85/1.40 Prover 5: Proving ... % 4.85/1.45 Prover 2: Proving ... % 4.85/1.50 Prover 3: Constructing countermodel ... % 5.66/1.50 Prover 6: Constructing countermodel ... % 5.66/1.52 Prover 1: Constructing countermodel ... % 5.66/1.53 Prover 5: proved (798ms) % 5.66/1.54 % 5.66/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.66/1.54 % 5.66/1.54 Prover 2: stopped % 5.66/1.54 Prover 3: stopped % 5.66/1.55 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.66/1.55 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.66/1.55 Prover 6: stopped % 5.66/1.55 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.66/1.55 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.66/1.58 Prover 4: Constructing countermodel ... % 5.66/1.58 Prover 7: Preprocessing ... % 6.40/1.60 Prover 8: Preprocessing ... % 6.40/1.60 Prover 11: Preprocessing ... % 6.40/1.61 Prover 10: Preprocessing ... % 6.40/1.64 Prover 7: Warning: ignoring some quantifiers % 6.40/1.64 Prover 0: Proving ... % 6.40/1.66 Prover 7: Constructing countermodel ... % 6.40/1.67 Prover 0: stopped % 6.40/1.67 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.21/1.70 Prover 10: Warning: ignoring some quantifiers % 7.21/1.71 Prover 10: Constructing countermodel ... % 7.21/1.72 Prover 4: Found proof (size 19) % 7.21/1.72 Prover 1: Found proof (size 19) % 7.21/1.72 Prover 4: proved (986ms) % 7.21/1.72 Prover 1: proved (987ms) % 7.21/1.72 Prover 10: stopped % 7.21/1.72 Prover 13: Preprocessing ... % 7.21/1.73 Prover 7: stopped % 7.21/1.73 Prover 11: stopped % 7.21/1.74 Prover 13: stopped % 7.21/1.78 Prover 8: Warning: ignoring some quantifiers % 7.21/1.79 Prover 8: Constructing countermodel ... % 7.79/1.80 Prover 8: stopped % 7.79/1.80 % 7.79/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.79/1.80 % 7.79/1.81 % SZS output start Proof for theBenchmark % 7.79/1.82 Assumptions after simplification: % 7.79/1.82 --------------------------------- % 7.79/1.82 % 7.79/1.82 (background_assumption_1) % 7.79/1.87 ? [v0: $i] : ? [v1: $i] : (dissimilar(v0, v1, v1) = 0 & $i(v1) & $i(v0)) % 7.79/1.87 % 7.79/1.87 (definition_2) % 7.79/1.88 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 7.79/1.88 (dissimilar(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 7.79/1.88 any] : ? [v5: any] : ? [v6: any] : (organization(v0) = v4 & % 7.79/1.88 is_aligned(v0, v2) = v6 & is_aligned(v0, v1) = v5 & ( ~ (v4 = 0) | (( ~ % 7.79/1.88 (v6 = 0) | v5 = 0) & ( ~ (v5 = 0) | v6 = 0))))) & ! [v0: $i] : ! % 7.79/1.88 [v1: $i] : ! [v2: $i] : ( ~ (dissimilar(v0, v1, v2) = 0) | ~ $i(v2) | ~ % 7.79/1.89 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : (organization(v0) = 0 & % 7.79/1.89 is_aligned(v0, v2) = v4 & is_aligned(v0, v1) = v3 & ( ~ (v4 = 0) | ~ (v3 % 7.79/1.89 = 0)) & (v4 = 0 | v3 = 0))) % 7.79/1.89 % 7.79/1.89 (function-axioms) % 8.29/1.90 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.29/1.90 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (dissimilar(v4, v3, v2) = v1) | ~ % 8.29/1.90 (dissimilar(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.29/1.90 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 8.29/1.90 (is_aligned(v3, v2) = v1) | ~ (is_aligned(v3, v2) = v0)) & ! [v0: % 8.29/1.90 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.29/1.90 : (v1 = v0 | ~ (greater(v3, v2) = v1) | ~ (greater(v3, v2) = v0)) & ! [v0: % 8.29/1.90 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.29/1.90 : (v1 = v0 | ~ (greater_or_equal(v3, v2) = v1) | ~ (greater_or_equal(v3, v2) % 8.29/1.90 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 8.29/1.90 $i] : ! [v3: $i] : (v1 = v0 | ~ (smaller(v3, v2) = v1) | ~ (smaller(v3, % 8.29/1.90 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 8.29/1.90 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (smaller_or_equal(v3, v2) = v1) | ~ % 8.29/1.90 (smaller_or_equal(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.29/1.90 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (organization(v2) = v1) | % 8.29/1.90 ~ (organization(v2) = v0)) % 8.29/1.90 % 8.29/1.90 Further assumptions not needed in the proof: % 8.29/1.90 -------------------------------------------- % 8.29/1.90 definition_greater_or_equal, definition_smaller, definition_smaller_or_equal, % 8.29/1.90 meaning_postulate_greater_comparable, meaning_postulate_greater_strict, % 8.29/1.90 meaning_postulate_greater_transitive % 8.29/1.90 % 8.29/1.90 Those formulas are unsatisfiable: % 8.29/1.90 --------------------------------- % 8.29/1.90 % 8.29/1.90 Begin of proof % 8.29/1.90 | % 8.29/1.91 | ALPHA: (definition_2) implies: % 8.29/1.91 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (dissimilar(v0, v1, v2) = % 8.29/1.91 | 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: % 8.29/1.91 | any] : (organization(v0) = 0 & is_aligned(v0, v2) = v4 & % 8.29/1.91 | is_aligned(v0, v1) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0)) & (v4 = 0 | % 8.29/1.91 | v3 = 0))) % 8.29/1.91 | % 8.29/1.91 | ALPHA: (function-axioms) implies: % 8.29/1.91 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 8.29/1.91 | ! [v3: $i] : (v1 = v0 | ~ (is_aligned(v3, v2) = v1) | ~ % 8.29/1.91 | (is_aligned(v3, v2) = v0)) % 8.29/1.91 | % 8.29/1.92 | DELTA: instantiating (background_assumption_1) with fresh symbols all_10_0, % 8.29/1.92 | all_10_1 gives: % 8.29/1.92 | (3) dissimilar(all_10_1, all_10_0, all_10_0) = 0 & $i(all_10_0) & % 8.29/1.92 | $i(all_10_1) % 8.29/1.92 | % 8.29/1.92 | ALPHA: (3) implies: % 8.29/1.92 | (4) $i(all_10_1) % 8.29/1.92 | (5) $i(all_10_0) % 8.29/1.92 | (6) dissimilar(all_10_1, all_10_0, all_10_0) = 0 % 8.29/1.92 | % 8.29/1.92 | GROUND_INST: instantiating (1) with all_10_1, all_10_0, all_10_0, simplifying % 8.29/1.92 | with (4), (5), (6) gives: % 8.29/1.93 | (7) ? [v0: any] : ? [v1: any] : (organization(all_10_1) = 0 & % 8.29/1.93 | is_aligned(all_10_1, all_10_0) = v1 & is_aligned(all_10_1, all_10_0) % 8.29/1.93 | = v0 & ( ~ (v1 = 0) | ~ (v0 = 0)) & (v1 = 0 | v0 = 0)) % 8.29/1.93 | % 8.29/1.93 | DELTA: instantiating (7) with fresh symbols all_17_0, all_17_1 gives: % 8.29/1.93 | (8) organization(all_10_1) = 0 & is_aligned(all_10_1, all_10_0) = all_17_0 % 8.29/1.93 | & is_aligned(all_10_1, all_10_0) = all_17_1 & ( ~ (all_17_0 = 0) | ~ % 8.29/1.93 | (all_17_1 = 0)) & (all_17_0 = 0 | all_17_1 = 0) % 8.29/1.93 | % 8.29/1.93 | ALPHA: (8) implies: % 8.29/1.93 | (9) is_aligned(all_10_1, all_10_0) = all_17_1 % 8.29/1.93 | (10) is_aligned(all_10_1, all_10_0) = all_17_0 % 8.29/1.93 | (11) all_17_0 = 0 | all_17_1 = 0 % 8.29/1.93 | (12) ~ (all_17_0 = 0) | ~ (all_17_1 = 0) % 8.29/1.93 | % 8.29/1.93 | GROUND_INST: instantiating (2) with all_17_1, all_17_0, all_10_0, all_10_1, % 8.29/1.93 | simplifying with (9), (10) gives: % 8.29/1.93 | (13) all_17_0 = all_17_1 % 8.29/1.93 | % 8.29/1.93 | BETA: splitting (11) gives: % 8.29/1.93 | % 8.29/1.93 | Case 1: % 8.29/1.93 | | % 8.29/1.93 | | (14) all_17_0 = 0 % 8.29/1.93 | | % 8.29/1.93 | | COMBINE_EQS: (13), (14) imply: % 8.29/1.93 | | (15) all_17_1 = 0 % 8.29/1.93 | | % 8.29/1.93 | | BETA: splitting (12) gives: % 8.29/1.93 | | % 8.29/1.93 | | Case 1: % 8.29/1.93 | | | % 8.29/1.94 | | | (16) ~ (all_17_0 = 0) % 8.29/1.94 | | | % 8.29/1.94 | | | REDUCE: (14), (16) imply: % 8.29/1.94 | | | (17) $false % 8.29/1.94 | | | % 8.29/1.94 | | | CLOSE: (17) is inconsistent. % 8.29/1.94 | | | % 8.29/1.94 | | Case 2: % 8.29/1.94 | | | % 8.29/1.94 | | | (18) ~ (all_17_1 = 0) % 8.29/1.94 | | | % 8.29/1.94 | | | REDUCE: (15), (18) imply: % 8.29/1.94 | | | (19) $false % 8.29/1.94 | | | % 8.29/1.94 | | | CLOSE: (19) is inconsistent. % 8.29/1.94 | | | % 8.29/1.94 | | End of split % 8.29/1.94 | | % 8.29/1.94 | Case 2: % 8.29/1.94 | | % 8.29/1.94 | | (20) all_17_1 = 0 % 8.29/1.94 | | (21) ~ (all_17_0 = 0) % 8.29/1.94 | | % 8.29/1.94 | | COMBINE_EQS: (13), (20) imply: % 8.29/1.94 | | (22) all_17_0 = 0 % 8.29/1.94 | | % 8.29/1.94 | | REDUCE: (21), (22) imply: % 8.29/1.94 | | (23) $false % 8.29/1.94 | | % 8.29/1.94 | | CLOSE: (23) is inconsistent. % 8.29/1.94 | | % 8.29/1.94 | End of split % 8.29/1.94 | % 8.29/1.94 End of proof % 8.29/1.94 % SZS output end Proof for theBenchmark % 8.29/1.94 % 8.29/1.94 1236ms %------------------------------------------------------------------------------