%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT011+1 : TPTP v9.3.0. Released v2.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n031.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:19 AM UTC 2026 % Result : Theorem 7.36s 1.73s % Output : Proof 12.09s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT011+1 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.02/0.36 % Computer : n031.cluster.edu % 0.02/0.36 % Model : x86_64 x86_64 % 0.02/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.02/0.36 % Memory : 8046.5625MB % 0.02/0.36 % OS : Linux 6.8.0-71-generic % 0.02/0.36 % CPULimit : 300 % 0.02/0.36 % WCLimit : 300 % 0.02/0.36 % DateTime : Mon Sep 7 11:51:41 UTC 2026 % 0.02/0.36 % CPUTime : % 0.02/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.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.68/0.71 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 % 2.29/1.09 Prover 4: Preprocessing ... % 2.29/1.14 Prover 1: Preprocessing ... % 3.09/1.18 Prover 6: Preprocessing ... % 3.09/1.18 Prover 2: Preprocessing ... % 3.09/1.18 Prover 3: Preprocessing ... % 3.09/1.18 Prover 5: Preprocessing ... % 3.09/1.18 Prover 0: Preprocessing ... % 5.00/1.45 Prover 5: Constructing countermodel ... % 5.00/1.45 Prover 2: Constructing countermodel ... % 5.00/1.47 Prover 6: Constructing countermodel ... % 5.80/1.50 Prover 1: Constructing countermodel ... % 5.80/1.53 Prover 3: Constructing countermodel ... % 7.36/1.73 Prover 5: proved (1001ms) % 7.36/1.73 % 7.36/1.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.36/1.73 % 7.36/1.73 Prover 2: stopped % 7.36/1.73 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.36/1.73 Prover 3: stopped % 7.36/1.74 Prover 6: stopped % 7.36/1.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.36/1.75 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.36/1.75 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.36/1.79 Prover 8: Preprocessing ... % 8.15/1.81 Prover 7: Preprocessing ... % 8.15/1.85 Prover 11: Preprocessing ... % 8.15/1.86 Prover 10: Preprocessing ... % 8.15/1.87 Prover 7: Constructing countermodel ... % 8.94/1.92 Prover 8: Warning: ignoring some quantifiers % 8.94/1.94 Prover 8: Constructing countermodel ... % 8.94/1.95 Prover 10: Constructing countermodel ... % 8.94/1.96 Prover 0: Proving ... % 8.94/1.96 Prover 4: Constructing countermodel ... % 8.94/2.01 Prover 0: stopped % 8.94/2.01 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.99/2.09 Prover 13: Preprocessing ... % 10.80/2.14 Prover 13: Constructing countermodel ... % 10.80/2.14 Prover 10: Found proof (size 21) % 10.80/2.14 Prover 10: proved (405ms) % 10.80/2.14 Prover 4: stopped % 10.80/2.15 Prover 13: stopped % 10.80/2.15 Prover 1: stopped % 10.80/2.15 Prover 8: stopped % 10.80/2.15 Prover 7: Found proof (size 23) % 10.80/2.15 Prover 7: proved (423ms) % 11.60/2.36 Prover 11: Constructing countermodel ... % 11.60/2.38 Prover 11: stopped % 11.60/2.38 % 11.60/2.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.60/2.38 % 11.60/2.39 % SZS output start Proof for theBenchmark % 11.60/2.39 Assumptions after simplification: % 11.60/2.39 --------------------------------- % 11.60/2.39 % 11.60/2.39 (a5_FOL) % 12.09/2.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 12.09/2.41 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~ % 12.09/2.41 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 12.09/2.41 $i(v0) | ~ size(v1, v4, v8) | ~ size(v0, v3, v7) | ~ class(v1, v2, v8) | % 12.09/2.41 ~ class(v0, v2, v7) | ~ greater(v4, v3) | ~ inertia(v1, v6, v8) | ~ % 12.09/2.41 inertia(v0, v5, v7) | ~ organization(v1, v8) | ~ organization(v0, v7) | % 12.09/2.41 greater(v6, v5)) % 12.09/2.41 % 12.09/2.41 (mp10) % 12.09/2.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v4 = v3 % 12.09/2.41 | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.09/2.41 reorganization_free(v0, v1, v2) | ~ class(v0, v4, v2) | ~ class(v0, v3, % 12.09/2.41 v1) | ~ organization(v0, v2) | ~ organization(v0, v1)) % 12.09/2.41 % 12.09/2.41 (mp5) % 12.09/2.42 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 12.09/2.42 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1))) % 12.09/2.42 % 12.09/2.42 (mp6_2) % 12.09/2.42 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ greater(v1, v0) | ~ % 12.09/2.42 greater(v0, v1)) % 12.09/2.42 % 12.09/2.42 (mp9) % 12.09/2.42 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 12.09/2.42 ? [v2: $i] : ($i(v2) & class(v0, v2, v1))) % 12.09/2.42 % 12.09/2.42 (t11_FOL) % 12.09/2.42 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ($i(v4) % 12.09/2.42 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & size(v0, v2, v4) & size(v0, v1, v3) & % 12.09/2.42 reorganization_free(v0, v3, v4) & greater(v4, v3) & greater(v1, v2) & % 12.09/2.42 organization(v0, v4) & organization(v0, v3)) % 12.09/2.42 % 12.09/2.43 (t2_FOL) % 12.09/2.43 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 12.09/2.43 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.09/2.43 reorganization_free(v0, v3, v4) | ~ greater(v4, v3) | ~ inertia(v0, v2, % 12.09/2.43 v4) | ~ inertia(v0, v1, v3) | ~ organization(v0, v4) | ~ % 12.09/2.43 organization(v0, v3) | greater(v2, v1)) % 12.09/2.43 % 12.09/2.43 Further assumptions not needed in the proof: % 12.09/2.43 -------------------------------------------- % 12.09/2.43 mp6_1 % 12.09/2.43 % 12.09/2.43 Those formulas are unsatisfiable: % 12.09/2.43 --------------------------------- % 12.09/2.43 % 12.09/2.43 Begin of proof % 12.09/2.43 | % 12.09/2.43 | DELTA: instantiating (t11_FOL) with fresh symbols all_9_0, all_9_1, all_9_2, % 12.09/2.43 | all_9_3, all_9_4 gives: % 12.09/2.44 | (1) $i(all_9_0) & $i(all_9_1) & $i(all_9_2) & $i(all_9_3) & $i(all_9_4) & % 12.09/2.44 | size(all_9_4, all_9_2, all_9_0) & size(all_9_4, all_9_3, all_9_1) & % 12.09/2.44 | reorganization_free(all_9_4, all_9_1, all_9_0) & greater(all_9_0, % 12.09/2.44 | all_9_1) & greater(all_9_3, all_9_2) & organization(all_9_4, all_9_0) % 12.09/2.44 | & organization(all_9_4, all_9_1) % 12.09/2.44 | % 12.09/2.44 | ALPHA: (1) implies: % 12.09/2.44 | (2) organization(all_9_4, all_9_1) % 12.09/2.44 | (3) organization(all_9_4, all_9_0) % 12.09/2.44 | (4) greater(all_9_3, all_9_2) % 12.09/2.44 | (5) greater(all_9_0, all_9_1) % 12.09/2.44 | (6) reorganization_free(all_9_4, all_9_1, all_9_0) % 12.09/2.44 | (7) size(all_9_4, all_9_3, all_9_1) % 12.09/2.44 | (8) size(all_9_4, all_9_2, all_9_0) % 12.09/2.44 | (9) $i(all_9_4) % 12.09/2.44 | (10) $i(all_9_3) % 12.09/2.44 | (11) $i(all_9_2) % 12.09/2.44 | (12) $i(all_9_1) % 12.09/2.44 | (13) $i(all_9_0) % 12.09/2.44 | % 12.09/2.45 | GROUND_INST: instantiating (mp9) with all_9_4, all_9_1, simplifying with (2), % 12.09/2.45 | (9), (12) gives: % 12.09/2.45 | (14) ? [v0: $i] : ($i(v0) & class(all_9_4, v0, all_9_1)) % 12.09/2.45 | % 12.09/2.45 | GROUND_INST: instantiating (mp5) with all_9_4, all_9_1, simplifying with (2), % 12.09/2.45 | (9), (12) gives: % 12.09/2.45 | (15) ? [v0: $i] : ($i(v0) & inertia(all_9_4, v0, all_9_1)) % 12.09/2.45 | % 12.09/2.45 | GROUND_INST: instantiating (mp9) with all_9_4, all_9_0, simplifying with (3), % 12.09/2.45 | (9), (13) gives: % 12.09/2.45 | (16) ? [v0: $i] : ($i(v0) & class(all_9_4, v0, all_9_0)) % 12.09/2.45 | % 12.09/2.45 | GROUND_INST: instantiating (mp5) with all_9_4, all_9_0, simplifying with (3), % 12.09/2.45 | (9), (13) gives: % 12.09/2.45 | (17) ? [v0: $i] : ($i(v0) & inertia(all_9_4, v0, all_9_0)) % 12.09/2.45 | % 12.09/2.45 | DELTA: instantiating (17) with fresh symbol all_16_0 gives: % 12.09/2.45 | (18) $i(all_16_0) & inertia(all_9_4, all_16_0, all_9_0) % 12.09/2.45 | % 12.09/2.45 | ALPHA: (18) implies: % 12.09/2.45 | (19) inertia(all_9_4, all_16_0, all_9_0) % 12.09/2.45 | (20) $i(all_16_0) % 12.09/2.45 | % 12.09/2.45 | DELTA: instantiating (15) with fresh symbol all_18_0 gives: % 12.09/2.45 | (21) $i(all_18_0) & inertia(all_9_4, all_18_0, all_9_1) % 12.09/2.45 | % 12.09/2.45 | ALPHA: (21) implies: % 12.09/2.45 | (22) inertia(all_9_4, all_18_0, all_9_1) % 12.09/2.45 | (23) $i(all_18_0) % 12.09/2.45 | % 12.09/2.45 | DELTA: instantiating (14) with fresh symbol all_20_0 gives: % 12.09/2.45 | (24) $i(all_20_0) & class(all_9_4, all_20_0, all_9_1) % 12.09/2.45 | % 12.09/2.45 | ALPHA: (24) implies: % 12.09/2.46 | (25) class(all_9_4, all_20_0, all_9_1) % 12.09/2.46 | (26) $i(all_20_0) % 12.09/2.46 | % 12.09/2.46 | DELTA: instantiating (16) with fresh symbol all_22_0 gives: % 12.09/2.46 | (27) $i(all_22_0) & class(all_9_4, all_22_0, all_9_0) % 12.09/2.46 | % 12.09/2.46 | ALPHA: (27) implies: % 12.09/2.46 | (28) class(all_9_4, all_22_0, all_9_0) % 12.09/2.46 | (29) $i(all_22_0) % 12.09/2.46 | % 12.09/2.46 | GROUND_INST: instantiating (t2_FOL) with all_9_4, all_18_0, all_16_0, all_9_1, % 12.09/2.46 | all_9_0, simplifying with (2), (3), (5), (6), (9), (12), (13), % 12.09/2.46 | (19), (20), (22), (23) gives: % 12.09/2.46 | (30) greater(all_16_0, all_18_0) % 12.09/2.46 | % 12.09/2.46 | GROUND_INST: instantiating (mp10) with all_9_4, all_9_1, all_9_0, all_20_0, % 12.09/2.46 | all_22_0, simplifying with (2), (3), (6), (9), (12), (13), (25), % 12.09/2.46 | (26), (28), (29) gives: % 12.09/2.46 | (31) all_22_0 = all_20_0 % 12.09/2.46 | % 12.09/2.46 | REDUCE: (28), (31) imply: % 12.09/2.46 | (32) class(all_9_4, all_20_0, all_9_0) % 12.09/2.46 | % 12.09/2.47 | GROUND_INST: instantiating (a5_FOL) with all_9_4, all_9_4, all_20_0, all_9_2, % 12.09/2.47 | all_9_3, all_16_0, all_18_0, all_9_0, all_9_1, simplifying with % 12.09/2.47 | (2), (3), (4), (7), (8), (9), (10), (11), (12), (13), (19), (20), % 12.09/2.47 | (22), (23), (25), (26), (32) gives: % 12.09/2.47 | (33) greater(all_18_0, all_16_0) % 12.09/2.47 | % 12.09/2.47 | GROUND_INST: instantiating (mp6_2) with all_16_0, all_18_0, simplifying with % 12.09/2.47 | (20), (23), (30), (33) gives: % 12.09/2.47 | (34) $false % 12.09/2.47 | % 12.09/2.47 | CLOSE: (34) is inconsistent. % 12.09/2.47 | % 12.09/2.47 End of proof % 12.09/2.47 % SZS output end Proof for theBenchmark % 12.09/2.47 % 12.09/2.47 1776ms %------------------------------------------------------------------------------