%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT015+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 : n017.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:20 AM UTC 2026 % Result : Theorem 7.12s 1.77s % Output : Proof 12.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT015+1 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.03 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.34 % Computer : n017.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 11:49:09 UTC 2026 % 0.08/0.34 % CPUTime : % 0.12/0.36 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.71 ________ _____ % 0.70/0.71 ___ __ \_________(_)________________________________ % 0.70/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.71 % 0.70/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.71 (2023-06-19) % 0.70/0.71 % 0.70/0.71 (c) Philipp Rümmer, 2009-2023 % 0.70/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.71 Amanda Stjerna. % 0.70/0.71 Free software under BSD-3-Clause. % 0.70/0.71 % 0.70/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.71 % 0.70/0.71 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.73 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.78/1.15 Prover 1: Preprocessing ... % 2.78/1.17 Prover 4: Preprocessing ... % 3.26/1.25 Prover 6: Preprocessing ... % 3.26/1.25 Prover 5: Preprocessing ... % 3.26/1.25 Prover 2: Preprocessing ... % 3.26/1.25 Prover 3: Preprocessing ... % 3.26/1.25 Prover 0: Preprocessing ... % 4.79/1.48 Prover 2: Constructing countermodel ... % 4.79/1.48 Prover 5: Constructing countermodel ... % 5.56/1.59 Prover 1: Constructing countermodel ... % 5.56/1.59 Prover 3: Constructing countermodel ... % 6.38/1.61 Prover 6: Constructing countermodel ... % 7.12/1.77 Prover 5: proved (1027ms) % 7.12/1.77 % 7.12/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.12/1.77 % 7.12/1.77 Prover 2: stopped % 7.12/1.77 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.12/1.78 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.12/1.78 Prover 6: stopped % 7.12/1.78 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.12/1.78 Prover 3: stopped % 7.12/1.79 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.92/1.81 Prover 0: stopped % 7.92/1.81 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.92/1.84 Prover 8: Preprocessing ... % 7.92/1.85 Prover 7: Preprocessing ... % 7.92/1.87 Prover 11: Preprocessing ... % 7.92/1.87 Prover 10: Preprocessing ... % 8.71/1.91 Prover 13: Preprocessing ... % 8.71/1.97 Prover 10: Constructing countermodel ... % 8.71/1.97 Prover 7: Constructing countermodel ... % 8.71/2.01 Prover 8: Warning: ignoring some quantifiers % 8.71/2.03 Prover 13: Constructing countermodel ... % 8.71/2.03 Prover 8: Constructing countermodel ... % 10.76/2.17 Prover 10: Found proof (size 11) % 10.76/2.17 Prover 13: Found proof (size 11) % 10.76/2.18 Prover 10: proved (397ms) % 10.76/2.18 Prover 1: stopped % 10.76/2.18 Prover 7: stopped % 10.76/2.18 Prover 8: stopped % 10.76/2.18 Prover 13: proved (370ms) % 11.00/2.24 Prover 11: stopped % 11.52/2.33 Prover 4: Constructing countermodel ... % 11.52/2.36 Prover 4: stopped % 11.52/2.36 % 11.52/2.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.52/2.36 % 11.52/2.36 % SZS output start Proof for theBenchmark % 11.52/2.37 Assumptions after simplification: % 11.52/2.37 --------------------------------- % 11.52/2.37 % 11.52/2.37 (a12_FOL) % 11.52/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 11.52/2.39 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~ % 11.52/2.39 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 11.52/2.39 $i(v0) | ~ greater(v4, v3) | ~ complexity(v1, v4, v8) | ~ complexity(v0, % 11.52/2.39 v3, v7) | ~ class(v1, v2, v8) | ~ class(v0, v2, v7) | ~ inertia(v1, v6, % 11.52/2.39 v8) | ~ inertia(v0, v5, v7) | ~ organization(v1, v8) | ~ % 11.52/2.39 organization(v0, v7) | greater(v6, v5)) % 11.52/2.39 % 11.52/2.39 (a13_FOL) % 11.52/2.40 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 11.52/2.40 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~ % 11.52/2.40 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 11.52/2.40 $i(v0) | ~ reorganization_type(v1, v2, v6) | ~ reorganization_type(v0, v2, % 11.52/2.40 v6) | ~ reorganization(v1, v6, v8) | ~ reorganization(v0, v6, v7) | ~ % 11.52/2.40 greater(v5, v4) | ~ class(v1, v3, v6) | ~ class(v0, v3, v6) | ~ % 11.52/2.40 inertia(v1, v5, v6) | ~ inertia(v0, v4, v6) | ~ organization(v1, v8) | ~ % 12.01/2.40 organization(v1, v6) | ~ organization(v0, v6) | greater(v8, v7)) % 12.01/2.40 % 12.01/2.40 (mp5) % 12.01/2.40 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 12.01/2.40 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1))) % 12.01/2.40 % 12.01/2.40 (t15_FOL) % 12.01/2.41 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 12.01/2.41 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ($i(v8) & $i(v7) & $i(v6) & % 12.01/2.41 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 12.01/2.41 reorganization_type(v1, v2, v6) & reorganization_type(v0, v2, v6) & % 12.01/2.41 reorganization(v1, v6, v8) & reorganization(v0, v6, v7) & greater(v5, v4) & % 12.01/2.41 complexity(v1, v5, v6) & complexity(v0, v4, v6) & class(v1, v3, v6) & % 12.01/2.41 class(v0, v3, v6) & organization(v1, v8) & organization(v1, v6) & % 12.01/2.41 organization(v0, v6) & ~ greater(v8, v7)) % 12.01/2.41 % 12.01/2.41 Those formulas are unsatisfiable: % 12.01/2.41 --------------------------------- % 12.01/2.41 % 12.01/2.41 Begin of proof % 12.01/2.41 | % 12.01/2.41 | DELTA: instantiating (t15_FOL) with fresh symbols all_5_0, all_5_1, all_5_2, % 12.01/2.41 | all_5_3, all_5_4, all_5_5, all_5_6, all_5_7, all_5_8 gives: % 12.01/2.42 | (1) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) & % 12.01/2.42 | $i(all_5_5) & $i(all_5_6) & $i(all_5_7) & $i(all_5_8) & % 12.01/2.42 | reorganization_type(all_5_7, all_5_6, all_5_2) & % 12.01/2.42 | reorganization_type(all_5_8, all_5_6, all_5_2) & % 12.01/2.42 | reorganization(all_5_7, all_5_2, all_5_0) & reorganization(all_5_8, % 12.01/2.42 | all_5_2, all_5_1) & greater(all_5_3, all_5_4) & complexity(all_5_7, % 12.01/2.42 | all_5_3, all_5_2) & complexity(all_5_8, all_5_4, all_5_2) & % 12.01/2.42 | class(all_5_7, all_5_5, all_5_2) & class(all_5_8, all_5_5, all_5_2) & % 12.01/2.42 | organization(all_5_7, all_5_0) & organization(all_5_7, all_5_2) & % 12.01/2.42 | organization(all_5_8, all_5_2) & ~ greater(all_5_0, all_5_1) % 12.01/2.42 | % 12.01/2.42 | ALPHA: (1) implies: % 12.01/2.43 | (2) ~ greater(all_5_0, all_5_1) % 12.01/2.43 | (3) organization(all_5_8, all_5_2) % 12.01/2.43 | (4) organization(all_5_7, all_5_2) % 12.01/2.43 | (5) organization(all_5_7, all_5_0) % 12.01/2.43 | (6) class(all_5_8, all_5_5, all_5_2) % 12.01/2.43 | (7) class(all_5_7, all_5_5, all_5_2) % 12.01/2.43 | (8) complexity(all_5_8, all_5_4, all_5_2) % 12.01/2.43 | (9) complexity(all_5_7, all_5_3, all_5_2) % 12.01/2.43 | (10) greater(all_5_3, all_5_4) % 12.01/2.43 | (11) reorganization(all_5_8, all_5_2, all_5_1) % 12.01/2.43 | (12) reorganization(all_5_7, all_5_2, all_5_0) % 12.01/2.43 | (13) reorganization_type(all_5_8, all_5_6, all_5_2) % 12.01/2.43 | (14) reorganization_type(all_5_7, all_5_6, all_5_2) % 12.01/2.43 | (15) $i(all_5_8) % 12.01/2.43 | (16) $i(all_5_7) % 12.01/2.43 | (17) $i(all_5_6) % 12.01/2.43 | (18) $i(all_5_5) % 12.01/2.43 | (19) $i(all_5_4) % 12.01/2.43 | (20) $i(all_5_3) % 12.01/2.43 | (21) $i(all_5_2) % 12.01/2.43 | (22) $i(all_5_1) % 12.01/2.43 | (23) $i(all_5_0) % 12.01/2.43 | % 12.01/2.44 | GROUND_INST: instantiating (mp5) with all_5_8, all_5_2, simplifying with (3), % 12.01/2.44 | (15), (21) gives: % 12.01/2.44 | (24) ? [v0: $i] : ($i(v0) & inertia(all_5_8, v0, all_5_2)) % 12.01/2.44 | % 12.01/2.44 | GROUND_INST: instantiating (mp5) with all_5_7, all_5_2, simplifying with (4), % 12.01/2.44 | (16), (21) gives: % 12.01/2.44 | (25) ? [v0: $i] : ($i(v0) & inertia(all_5_7, v0, all_5_2)) % 12.01/2.44 | % 12.01/2.44 | DELTA: instantiating (25) with fresh symbol all_14_0 gives: % 12.01/2.44 | (26) $i(all_14_0) & inertia(all_5_7, all_14_0, all_5_2) % 12.01/2.44 | % 12.01/2.44 | ALPHA: (26) implies: % 12.01/2.44 | (27) inertia(all_5_7, all_14_0, all_5_2) % 12.01/2.44 | (28) $i(all_14_0) % 12.01/2.44 | % 12.01/2.44 | DELTA: instantiating (24) with fresh symbol all_16_0 gives: % 12.01/2.44 | (29) $i(all_16_0) & inertia(all_5_8, all_16_0, all_5_2) % 12.01/2.44 | % 12.01/2.44 | ALPHA: (29) implies: % 12.01/2.44 | (30) inertia(all_5_8, all_16_0, all_5_2) % 12.01/2.44 | (31) $i(all_16_0) % 12.01/2.44 | % 12.01/2.44 | GROUND_INST: instantiating (a12_FOL) with all_5_8, all_5_7, all_5_5, all_5_4, % 12.01/2.44 | all_5_3, all_16_0, all_14_0, all_5_2, all_5_2, simplifying with % 12.01/2.44 | (3), (4), (6), (7), (8), (9), (10), (15), (16), (18), (19), (20), % 12.01/2.44 | (21), (27), (28), (30), (31) gives: % 12.01/2.45 | (32) greater(all_14_0, all_16_0) % 12.01/2.45 | % 12.01/2.45 | GROUND_INST: instantiating (a13_FOL) with all_5_8, all_5_7, all_5_6, all_5_5, % 12.01/2.45 | all_16_0, all_14_0, all_5_2, all_5_1, all_5_0, simplifying with % 12.01/2.45 | (2), (3), (4), (5), (6), (7), (11), (12), (13), (14), (15), (16), % 12.01/2.45 | (17), (18), (21), (22), (23), (27), (28), (30), (31), (32) gives: % 12.01/2.45 | (33) $false % 12.01/2.45 | % 12.01/2.45 | CLOSE: (33) is inconsistent. % 12.01/2.45 | % 12.01/2.45 End of proof % 12.01/2.45 % SZS output end Proof for theBenchmark % 12.01/2.45 % 12.01/2.45 1742ms %------------------------------------------------------------------------------