%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT002+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 : n016.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:18 AM UTC 2026 % Result : Theorem 6.85s 1.74s % Output : Proof 10.91s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT002+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.09/0.39 % Computer : n016.cluster.edu % 0.09/0.39 % Model : x86_64 x86_64 % 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.39 % Memory : 8046.5625MB % 0.09/0.39 % OS : Linux 6.8.0-71-generic % 0.09/0.39 % CPULimit : 300 % 0.09/0.39 % WCLimit : 300 % 0.09/0.39 % DateTime : Mon Sep 7 11:37:02 UTC 2026 % 0.09/0.39 % CPUTime : % 0.09/0.41 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.60/0.75 ________ _____ % 0.60/0.75 ___ __ \_________(_)________________________________ % 0.60/0.75 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.75 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.75 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.75 % 0.60/0.75 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.75 (2023-06-19) % 0.60/0.75 % 0.60/0.75 (c) Philipp Rümmer, 2009-2023 % 0.60/0.75 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.75 Amanda Stjerna. % 0.60/0.75 Free software under BSD-3-Clause. % 0.60/0.75 % 0.60/0.75 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.75 % 0.60/0.75 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.60/0.77 Running up to 7 provers in parallel. % 0.60/0.79 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.60/0.79 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.60/0.79 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.60/0.79 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.60/0.79 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.60/0.79 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.60/0.79 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.52/1.17 Prover 4: Preprocessing ... % 2.52/1.17 Prover 1: Preprocessing ... % 2.95/1.24 Prover 2: Preprocessing ... % 2.95/1.24 Prover 6: Preprocessing ... % 2.95/1.24 Prover 0: Preprocessing ... % 2.95/1.24 Prover 3: Preprocessing ... % 2.95/1.24 Prover 5: Preprocessing ... % 4.47/1.45 Prover 5: Constructing countermodel ... % 4.47/1.47 Prover 2: Constructing countermodel ... % 5.25/1.51 Prover 6: Constructing countermodel ... % 5.25/1.52 Prover 1: Constructing countermodel ... % 5.25/1.56 Prover 3: Constructing countermodel ... % 6.85/1.73 Prover 2: proved (948ms) % 6.85/1.74 % 6.85/1.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.85/1.74 % 6.85/1.74 Prover 5: stopped % 6.85/1.74 Prover 6: stopped % 6.85/1.74 Prover 3: stopped % 6.85/1.75 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.85/1.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.85/1.75 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.85/1.75 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.85/1.79 Prover 8: Preprocessing ... % 6.85/1.79 Prover 11: Preprocessing ... % 7.62/1.80 Prover 10: Preprocessing ... % 7.62/1.81 Prover 7: Preprocessing ... % 7.62/1.86 Prover 7: Constructing countermodel ... % 7.62/1.89 Prover 10: Constructing countermodel ... % 8.40/1.93 Prover 8: Warning: ignoring some quantifiers % 8.40/1.94 Prover 8: Constructing countermodel ... % 8.40/2.00 Prover 10: Found proof (size 15) % 8.40/2.00 Prover 10: proved (254ms) % 8.40/2.01 Prover 1: stopped % 8.40/2.01 Prover 11: stopped % 8.40/2.01 Prover 8: stopped % 8.40/2.01 Prover 7: stopped % 10.02/2.16 Prover 4: Constructing countermodel ... % 10.02/2.18 Prover 4: stopped % 10.41/2.24 Prover 0: Proving ... % 10.41/2.26 Prover 0: stopped % 10.41/2.26 % 10.41/2.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.41/2.26 % 10.41/2.26 % SZS output start Proof for theBenchmark % 10.41/2.26 Assumptions after simplification: % 10.41/2.26 --------------------------------- % 10.41/2.26 % 10.41/2.26 (a3_FOL) % 10.41/2.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.41/2.28 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ % 10.41/2.28 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v7, v6) % 10.41/2.28 | ~ inertia(v1, v7, v3) | ~ inertia(v0, v6, v2) | ~ % 10.41/2.28 reorganization_free(v1, v3, v3) | ~ reorganization_free(v0, v2, v2) | ~ % 10.41/2.28 reproducibility(v1, v5, v3) | ~ reproducibility(v0, v4, v2) | ~ % 10.41/2.28 organization(v1, v3) | ~ organization(v0, v2) | greater(v5, v4)) & ! [v0: % 10.41/2.28 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : % 10.41/2.28 ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ % 10.41/2.28 $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v5, v4) | ~ % 10.41/2.28 inertia(v1, v7, v3) | ~ inertia(v0, v6, v2) | ~ reorganization_free(v1, % 10.41/2.28 v3, v3) | ~ reorganization_free(v0, v2, v2) | ~ reproducibility(v1, v5, % 10.41/2.28 v3) | ~ reproducibility(v0, v4, v2) | ~ organization(v1, v3) | ~ % 10.41/2.28 organization(v0, v2) | greater(v7, v6)) % 10.41/2.28 % 10.41/2.28 (a4_FOL) % 10.41/2.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 10.41/2.28 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v4, v3) % 10.41/2.28 | ~ reorganization_free(v0, v3, v4) | ~ reproducibility(v0, v2, v4) | ~ % 10.41/2.28 reproducibility(v0, v1, v3) | ~ organization(v0, v4) | ~ organization(v0, % 10.41/2.28 v3) | greater(v2, v1)) % 10.41/2.28 % 10.41/2.28 (mp3) % 10.41/2.28 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 10.41/2.28 ? [v2: $i] : ($i(v2) & reproducibility(v0, v2, v1))) % 10.41/2.28 % 10.41/2.28 (mp4) % 10.41/2.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.41/2.28 ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v2)) & ! % 10.41/2.28 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.41/2.28 reorganization_free(v0, v1, v2) | reorganization_free(v0, v1, v1)) % 10.41/2.28 % 10.41/2.28 (t2_FOL) % 10.41/2.29 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ($i(v4) % 10.41/2.29 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & greater(v4, v3) & inertia(v0, v2, v4) % 10.41/2.29 & inertia(v0, v1, v3) & reorganization_free(v0, v3, v4) & organization(v0, % 10.41/2.29 v4) & organization(v0, v3) & ~ greater(v2, v1)) % 10.41/2.29 % 10.41/2.29 Those formulas are unsatisfiable: % 10.41/2.29 --------------------------------- % 10.41/2.29 % 10.41/2.29 Begin of proof % 10.41/2.29 | % 10.41/2.29 | ALPHA: (a3_FOL) implies: % 10.41/2.29 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 10.41/2.29 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ % 10.41/2.29 | $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.41/2.29 | ~ greater(v5, v4) | ~ inertia(v1, v7, v3) | ~ inertia(v0, v6, v2) | % 10.41/2.29 | ~ reorganization_free(v1, v3, v3) | ~ reorganization_free(v0, v2, % 10.41/2.29 | v2) | ~ reproducibility(v1, v5, v3) | ~ reproducibility(v0, v4, % 10.41/2.29 | v2) | ~ organization(v1, v3) | ~ organization(v0, v2) | % 10.41/2.29 | greater(v7, v6)) % 10.41/2.29 | % 10.41/2.29 | ALPHA: (mp4) implies: % 10.41/2.29 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.41/2.29 | $i(v0) | ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, % 10.41/2.29 | v1, v1)) % 10.41/2.29 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.41/2.29 | $i(v0) | ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, % 10.41/2.29 | v2, v2)) % 10.41/2.29 | % 10.41/2.30 | DELTA: instantiating (t2_FOL) with fresh symbols all_6_0, all_6_1, all_6_2, % 10.41/2.30 | all_6_3, all_6_4 gives: % 10.41/2.30 | (4) $i(all_6_0) & $i(all_6_1) & $i(all_6_2) & $i(all_6_3) & $i(all_6_4) & % 10.41/2.30 | greater(all_6_0, all_6_1) & inertia(all_6_4, all_6_2, all_6_0) & % 10.41/2.30 | inertia(all_6_4, all_6_3, all_6_1) & reorganization_free(all_6_4, % 10.41/2.30 | all_6_1, all_6_0) & organization(all_6_4, all_6_0) & % 10.41/2.30 | organization(all_6_4, all_6_1) & ~ greater(all_6_2, all_6_3) % 10.41/2.30 | % 10.41/2.30 | ALPHA: (4) implies: % 10.41/2.30 | (5) ~ greater(all_6_2, all_6_3) % 10.41/2.30 | (6) organization(all_6_4, all_6_1) % 10.91/2.30 | (7) organization(all_6_4, all_6_0) % 10.91/2.30 | (8) reorganization_free(all_6_4, all_6_1, all_6_0) % 10.91/2.30 | (9) inertia(all_6_4, all_6_3, all_6_1) % 10.91/2.30 | (10) inertia(all_6_4, all_6_2, all_6_0) % 10.91/2.30 | (11) greater(all_6_0, all_6_1) % 10.91/2.30 | (12) $i(all_6_4) % 10.91/2.30 | (13) $i(all_6_3) % 10.91/2.30 | (14) $i(all_6_2) % 10.91/2.30 | (15) $i(all_6_1) % 10.91/2.30 | (16) $i(all_6_0) % 10.91/2.30 | % 10.91/2.30 | GROUND_INST: instantiating (mp3) with all_6_4, all_6_1, simplifying with (6), % 10.91/2.30 | (12), (15) gives: % 10.91/2.30 | (17) ? [v0: $i] : ($i(v0) & reproducibility(all_6_4, v0, all_6_1)) % 10.91/2.30 | % 10.91/2.30 | GROUND_INST: instantiating (mp3) with all_6_4, all_6_0, simplifying with (7), % 10.91/2.30 | (12), (16) gives: % 10.91/2.30 | (18) ? [v0: $i] : ($i(v0) & reproducibility(all_6_4, v0, all_6_0)) % 10.91/2.30 | % 10.91/2.30 | GROUND_INST: instantiating (3) with all_6_4, all_6_1, all_6_0, simplifying % 10.91/2.30 | with (8), (12), (15), (16) gives: % 10.91/2.30 | (19) reorganization_free(all_6_4, all_6_0, all_6_0) % 10.91/2.30 | % 10.91/2.30 | GROUND_INST: instantiating (2) with all_6_4, all_6_1, all_6_0, simplifying % 10.91/2.30 | with (8), (12), (15), (16) gives: % 10.91/2.30 | (20) reorganization_free(all_6_4, all_6_1, all_6_1) % 10.91/2.30 | % 10.91/2.30 | DELTA: instantiating (18) with fresh symbol all_14_0 gives: % 10.91/2.30 | (21) $i(all_14_0) & reproducibility(all_6_4, all_14_0, all_6_0) % 10.91/2.30 | % 10.91/2.30 | ALPHA: (21) implies: % 10.91/2.31 | (22) reproducibility(all_6_4, all_14_0, all_6_0) % 10.91/2.31 | (23) $i(all_14_0) % 10.91/2.31 | % 10.91/2.31 | DELTA: instantiating (17) with fresh symbol all_16_0 gives: % 10.91/2.31 | (24) $i(all_16_0) & reproducibility(all_6_4, all_16_0, all_6_1) % 10.91/2.31 | % 10.91/2.31 | ALPHA: (24) implies: % 10.91/2.31 | (25) reproducibility(all_6_4, all_16_0, all_6_1) % 10.91/2.31 | (26) $i(all_16_0) % 10.91/2.31 | % 10.91/2.31 | GROUND_INST: instantiating (a4_FOL) with all_6_4, all_16_0, all_14_0, all_6_1, % 10.91/2.31 | all_6_0, simplifying with (6), (7), (8), (11), (12), (15), (16), % 10.91/2.31 | (22), (23), (25), (26) gives: % 10.91/2.31 | (27) greater(all_14_0, all_16_0) % 10.91/2.31 | % 10.91/2.31 | GROUND_INST: instantiating (1) with all_6_4, all_6_4, all_6_1, all_6_0, % 10.91/2.31 | all_16_0, all_14_0, all_6_3, all_6_2, simplifying with (5), (6), % 10.91/2.31 | (7), (9), (10), (12), (13), (14), (15), (16), (19), (20), (22), % 10.91/2.31 | (23), (25), (26), (27) gives: % 10.91/2.31 | (28) $false % 10.91/2.31 | % 10.91/2.31 | CLOSE: (28) is inconsistent. % 10.91/2.31 | % 10.91/2.31 End of proof % 10.91/2.31 % SZS output end Proof for theBenchmark % 10.91/2.31 % 10.91/2.31 1557ms %------------------------------------------------------------------------------