%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT013+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 : 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:19 AM UTC 2026 % Result : Theorem 7.53s 1.63s % Output : Proof 12.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT013+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.10/0.36 % Computer : n009.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 11:51:07 UTC 2026 % 0.10/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.32/0.55 ________ _____ % 0.32/0.55 ___ __ \_________(_)________________________________ % 0.32/0.55 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.32/0.55 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.32/0.55 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.32/0.55 % 0.32/0.55 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.32/0.55 (2023-06-19) % 0.32/0.55 % 0.32/0.55 (c) Philipp Rümmer, 2009-2023 % 0.32/0.55 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.32/0.55 Amanda Stjerna. % 0.32/0.55 Free software under BSD-3-Clause. % 0.32/0.55 % 0.32/0.55 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.32/0.55 % 0.32/0.55 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.32/0.56 Running up to 7 provers in parallel. % 0.32/0.57 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.32/0.57 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.32/0.58 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.32/0.58 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.32/0.58 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.32/0.58 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.32/0.58 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.15/0.96 Prover 1: Preprocessing ... % 2.15/0.97 Prover 4: Preprocessing ... % 3.11/1.06 Prover 5: Preprocessing ... % 3.11/1.06 Prover 3: Preprocessing ... % 3.11/1.06 Prover 2: Preprocessing ... % 3.11/1.06 Prover 0: Preprocessing ... % 3.11/1.06 Prover 6: Preprocessing ... % 5.18/1.31 Prover 2: Constructing countermodel ... % 5.18/1.32 Prover 5: Constructing countermodel ... % 5.18/1.37 Prover 1: Constructing countermodel ... % 5.18/1.38 Prover 6: Constructing countermodel ... % 5.98/1.44 Prover 3: Constructing countermodel ... % 7.53/1.62 Prover 2: proved (1048ms) % 7.53/1.62 % 7.53/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.53/1.63 % 7.53/1.63 Prover 6: stopped % 7.53/1.63 Prover 5: stopped % 7.53/1.64 Prover 3: stopped % 7.53/1.64 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.53/1.64 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.53/1.64 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.53/1.65 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.32/1.70 Prover 4: Constructing countermodel ... % 8.32/1.71 Prover 7: Preprocessing ... % 8.32/1.73 Prover 10: Preprocessing ... % 8.32/1.74 Prover 11: Preprocessing ... % 8.32/1.75 Prover 8: Preprocessing ... % 8.32/1.77 Prover 7: Constructing countermodel ... % 9.13/1.84 Prover 10: Constructing countermodel ... % 9.13/1.86 Prover 0: Proving ... % 9.13/1.89 Prover 0: stopped % 9.13/1.90 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.91/1.93 Prover 13: Preprocessing ... % 9.91/1.95 Prover 8: Warning: ignoring some quantifiers % 9.91/1.96 Prover 8: Constructing countermodel ... % 9.91/1.99 Prover 13: Constructing countermodel ... % 11.12/2.08 Prover 10: Found proof (size 20) % 11.12/2.08 Prover 10: proved (446ms) % 11.12/2.08 Prover 4: stopped % 11.12/2.09 Prover 8: stopped % 11.12/2.09 Prover 7: Found proof (size 20) % 11.12/2.09 Prover 7: proved (456ms) % 11.12/2.09 Prover 13: stopped % 11.12/2.10 Prover 1: stopped % 11.93/2.23 Prover 11: Constructing countermodel ... % 11.93/2.24 Prover 11: stopped % 11.93/2.24 % 11.93/2.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.93/2.24 % 11.93/2.25 % SZS output start Proof for theBenchmark % 11.93/2.26 Assumptions after simplification: % 11.93/2.26 --------------------------------- % 11.93/2.26 % 11.93/2.26 (mp15) % 11.93/2.27 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 11.93/2.27 time(v1)) % 11.93/2.27 % 11.93/2.27 (mp16) % 11.93/2.27 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ time(v1) | % 11.93/2.27 ~ time(v0) | greater(v1, v0) | greater(v0, v1)) % 11.93/2.27 % 11.93/2.27 (mp17) % 11.93/2.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 11.93/2.28 ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v1)) % 11.93/2.28 % 11.93/2.28 (mp18) % 11.93/2.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v2 = v1 | ~ $i(v3) | % 11.93/2.28 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ complexity(v0, v2, v3) | ~ % 11.93/2.28 complexity(v0, v1, v3) | ~ organization(v0, v3)) % 11.93/2.28 % 11.93/2.28 (mp6_2) % 11.93/2.28 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ greater(v1, v0) | ~ % 11.93/2.28 greater(v0, v1)) % 11.93/2.28 % 11.93/2.28 (t11_FOL) % 11.93/2.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 11.93/2.28 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ size(v0, v2, v4) % 11.93/2.28 | ~ size(v0, v1, v3) | ~ reorganization_free(v0, v3, v4) | ~ % 11.93/2.28 organization(v0, v4) | ~ organization(v0, v3) | ~ greater(v4, v3) | ~ % 11.93/2.28 greater(v1, v2)) % 11.93/2.28 % 11.93/2.29 (t12_FOL) % 11.93/2.29 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 11.93/2.29 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ complexity(v0, % 11.93/2.29 v2, v4) | ~ complexity(v0, v1, v3) | ~ reorganization_free(v0, v3, v4) | % 11.93/2.29 ~ organization(v0, v4) | ~ organization(v0, v3) | ~ greater(v4, v3) | ~ % 11.93/2.29 greater(v1, v2)) % 11.93/2.29 % 11.93/2.29 (t13_FOL) % 11.93/2.29 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 11.93/2.29 $i] : ? [v6: $i] : ($i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 11.93/2.29 $i(v0) & size(v0, v4, v6) & size(v0, v3, v5) & complexity(v0, v2, v6) & % 11.93/2.29 complexity(v0, v1, v5) & reorganization_free(v0, v5, v6) & organization(v0, % 11.93/2.29 v6) & organization(v0, v5) & greater(v3, v4) & greater(v2, v1)) % 11.93/2.29 % 11.93/2.29 Further assumptions not needed in the proof: % 11.93/2.29 -------------------------------------------- % 11.93/2.29 mp6_1 % 11.93/2.29 % 11.93/2.29 Those formulas are unsatisfiable: % 11.93/2.29 --------------------------------- % 11.93/2.29 % 11.93/2.29 Begin of proof % 11.93/2.29 | % 11.93/2.29 | DELTA: instantiating (t13_FOL) with fresh symbols all_10_0, all_10_1, % 11.93/2.29 | all_10_2, all_10_3, all_10_4, all_10_5, all_10_6 gives: % 12.41/2.30 | (1) $i(all_10_0) & $i(all_10_1) & $i(all_10_2) & $i(all_10_3) & % 12.41/2.30 | $i(all_10_4) & $i(all_10_5) & $i(all_10_6) & size(all_10_6, all_10_2, % 12.41/2.30 | all_10_0) & size(all_10_6, all_10_3, all_10_1) & complexity(all_10_6, % 12.41/2.30 | all_10_4, all_10_0) & complexity(all_10_6, all_10_5, all_10_1) & % 12.41/2.30 | reorganization_free(all_10_6, all_10_1, all_10_0) & % 12.41/2.30 | organization(all_10_6, all_10_0) & organization(all_10_6, all_10_1) & % 12.41/2.30 | greater(all_10_3, all_10_2) & greater(all_10_4, all_10_5) % 12.41/2.30 | % 12.41/2.30 | ALPHA: (1) implies: % 12.41/2.30 | (2) greater(all_10_4, all_10_5) % 12.41/2.30 | (3) greater(all_10_3, all_10_2) % 12.41/2.30 | (4) organization(all_10_6, all_10_1) % 12.41/2.30 | (5) organization(all_10_6, all_10_0) % 12.41/2.30 | (6) reorganization_free(all_10_6, all_10_1, all_10_0) % 12.41/2.30 | (7) complexity(all_10_6, all_10_5, all_10_1) % 12.41/2.30 | (8) complexity(all_10_6, all_10_4, all_10_0) % 12.41/2.30 | (9) size(all_10_6, all_10_3, all_10_1) % 12.41/2.30 | (10) size(all_10_6, all_10_2, all_10_0) % 12.41/2.30 | (11) $i(all_10_6) % 12.41/2.30 | (12) $i(all_10_5) % 12.41/2.30 | (13) $i(all_10_4) % 12.41/2.30 | (14) $i(all_10_3) % 12.41/2.30 | (15) $i(all_10_2) % 12.41/2.30 | (16) $i(all_10_1) % 12.41/2.31 | (17) $i(all_10_0) % 12.41/2.31 | % 12.41/2.31 | GROUND_INST: instantiating (mp15) with all_10_6, all_10_1, simplifying with % 12.41/2.31 | (4), (11), (16) gives: % 12.41/2.31 | (18) time(all_10_1) % 12.41/2.31 | % 12.41/2.31 | GROUND_INST: instantiating (mp15) with all_10_6, all_10_0, simplifying with % 12.41/2.31 | (5), (11), (17) gives: % 12.41/2.31 | (19) time(all_10_0) % 12.41/2.31 | % 12.41/2.31 | GROUND_INST: instantiating (mp17) with all_10_6, all_10_1, all_10_0, % 12.41/2.31 | simplifying with (6), (11), (16), (17) gives: % 12.41/2.31 | (20) reorganization_free(all_10_6, all_10_0, all_10_1) % 12.41/2.31 | % 12.41/2.31 | GROUND_INST: instantiating (mp16) with all_10_1, all_10_0, simplifying with % 12.41/2.31 | (16), (17), (18), (19) gives: % 12.41/2.31 | (21) all_10_0 = all_10_1 | greater(all_10_0, all_10_1) | greater(all_10_1, % 12.41/2.31 | all_10_0) % 12.41/2.31 | % 12.41/2.31 | BETA: splitting (21) gives: % 12.41/2.31 | % 12.41/2.31 | Case 1: % 12.41/2.31 | | % 12.41/2.31 | | (22) greater(all_10_0, all_10_1) % 12.41/2.31 | | % 12.41/2.31 | | GROUND_INST: instantiating (t11_FOL) with all_10_6, all_10_3, all_10_2, % 12.41/2.31 | | all_10_1, all_10_0, simplifying with (3), (4), (5), (6), (9), % 12.41/2.31 | | (10), (11), (14), (15), (16), (17), (22) gives: % 12.41/2.31 | | (23) $false % 12.41/2.32 | | % 12.41/2.32 | | CLOSE: (23) is inconsistent. % 12.41/2.32 | | % 12.41/2.32 | Case 2: % 12.41/2.32 | | % 12.41/2.32 | | (24) all_10_0 = all_10_1 | greater(all_10_1, all_10_0) % 12.41/2.32 | | % 12.41/2.32 | | BETA: splitting (24) gives: % 12.41/2.32 | | % 12.41/2.32 | | Case 1: % 12.41/2.32 | | | % 12.41/2.32 | | | (25) greater(all_10_1, all_10_0) % 12.41/2.32 | | | % 12.41/2.32 | | | GROUND_INST: instantiating (t12_FOL) with all_10_6, all_10_4, all_10_5, % 12.41/2.32 | | | all_10_0, all_10_1, simplifying with (2), (4), (5), (7), (8), % 12.41/2.32 | | | (11), (12), (13), (16), (17), (20), (25) gives: % 12.41/2.32 | | | (26) $false % 12.41/2.32 | | | % 12.41/2.32 | | | CLOSE: (26) is inconsistent. % 12.41/2.32 | | | % 12.41/2.32 | | Case 2: % 12.41/2.32 | | | % 12.41/2.32 | | | (27) all_10_0 = all_10_1 % 12.41/2.32 | | | % 12.41/2.32 | | | REDUCE: (8), (27) imply: % 12.41/2.32 | | | (28) complexity(all_10_6, all_10_4, all_10_1) % 12.41/2.32 | | | % 12.41/2.32 | | | GROUND_INST: instantiating (mp18) with all_10_6, all_10_5, all_10_4, % 12.41/2.32 | | | all_10_1, simplifying with (4), (7), (11), (12), (13), (16), % 12.41/2.32 | | | (28) gives: % 12.41/2.32 | | | (29) all_10_4 = all_10_5 % 12.41/2.32 | | | % 12.41/2.32 | | | REDUCE: (2), (29) imply: % 12.41/2.32 | | | (30) greater(all_10_5, all_10_5) % 12.41/2.32 | | | % 12.41/2.32 | | | GROUND_INST: instantiating (mp6_2) with all_10_5, all_10_5, simplifying % 12.41/2.32 | | | with (12), (30) gives: % 12.41/2.32 | | | (31) $false % 12.41/2.32 | | | % 12.41/2.32 | | | CLOSE: (31) is inconsistent. % 12.41/2.32 | | | % 12.41/2.32 | | End of split % 12.41/2.32 | | % 12.41/2.32 | End of split % 12.41/2.32 | % 12.41/2.32 End of proof % 12.41/2.33 % SZS output end Proof for theBenchmark % 12.41/2.33 % 12.41/2.33 1772ms %------------------------------------------------------------------------------