%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT009+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:19 AM UTC 2026 % Result : Theorem 7.12s 1.74s % Output : Proof 11.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT009+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.09/0.36 % Computer : n016.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 11:50:47 UTC 2026 % 0.13/0.36 % CPUTime : % 0.13/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.70/0.72 ________ _____ % 0.70/0.72 ___ __ \_________(_)________________________________ % 0.70/0.72 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.72 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.72 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.72 % 0.70/0.72 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.72 (2023-06-19) % 0.70/0.72 % 0.70/0.72 (c) Philipp Rümmer, 2009-2023 % 0.70/0.72 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.72 Amanda Stjerna. % 0.70/0.72 Free software under BSD-3-Clause. % 0.70/0.72 % 0.70/0.72 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.72 % 0.70/0.72 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.74 Running up to 7 provers in parallel. % 0.70/0.76 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.76 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.76 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.76 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.76 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.76 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.76 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.72/1.16 Prover 1: Preprocessing ... % 2.72/1.16 Prover 4: Preprocessing ... % 3.17/1.22 Prover 0: Preprocessing ... % 3.17/1.22 Prover 6: Preprocessing ... % 3.17/1.22 Prover 3: Preprocessing ... % 3.17/1.22 Prover 5: Preprocessing ... % 3.17/1.22 Prover 2: Preprocessing ... % 4.73/1.41 Prover 5: Constructing countermodel ... % 4.73/1.44 Prover 2: Constructing countermodel ... % 4.73/1.49 Prover 1: Constructing countermodel ... % 5.53/1.54 Prover 6: Constructing countermodel ... % 5.53/1.54 Prover 3: Constructing countermodel ... % 7.12/1.73 Prover 2: proved (976ms) % 7.12/1.74 % 7.12/1.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.12/1.74 % 7.12/1.74 Prover 6: stopped % 7.12/1.74 Prover 3: stopped % 7.12/1.74 Prover 5: stopped % 7.12/1.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.12/1.75 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.12/1.75 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.12/1.75 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.12/1.79 Prover 8: Preprocessing ... % 7.90/1.81 Prover 10: Preprocessing ... % 7.90/1.81 Prover 11: Preprocessing ... % 7.90/1.82 Prover 7: Preprocessing ... % 7.90/1.87 Prover 10: Constructing countermodel ... % 7.90/1.89 Prover 7: Constructing countermodel ... % 8.68/1.99 Prover 8: Warning: ignoring some quantifiers % 8.68/2.00 Prover 8: Constructing countermodel ... % 9.69/2.03 Prover 10: Found proof (size 12) % 9.69/2.04 Prover 10: proved (293ms) % 9.69/2.04 Prover 11: stopped % 9.69/2.04 Prover 1: stopped % 9.69/2.04 Prover 7: stopped % 9.69/2.04 Prover 8: stopped % 10.72/2.20 Prover 4: Constructing countermodel ... % 10.72/2.23 Prover 4: stopped % 10.72/2.28 Prover 0: Proving ... % 10.72/2.30 Prover 0: stopped % 11.24/2.30 % 11.24/2.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.24/2.30 % 11.24/2.30 % SZS output start Proof for theBenchmark % 11.24/2.30 Assumptions after simplification: % 11.24/2.30 --------------------------------- % 11.24/2.30 % 11.24/2.30 (a3_FOL) % 11.24/2.31 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 11.24/2.31 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ % 11.24/2.32 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v7, v6) % 11.24/2.32 | ~ reproducibility(v1, v5, v3) | ~ reproducibility(v0, v4, v2) | ~ % 11.24/2.32 reorganization_free(v1, v3, v3) | ~ reorganization_free(v0, v2, v2) | ~ % 11.24/2.32 inertia(v1, v7, v3) | ~ inertia(v0, v6, v2) | ~ organization(v1, v3) | ~ % 11.24/2.32 organization(v0, v2) | greater(v5, v4)) & ! [v0: $i] : ! [v1: $i] : ! % 11.24/2.32 [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] % 11.24/2.32 : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ % 11.24/2.32 $i(v1) | ~ $i(v0) | ~ greater(v5, v4) | ~ reproducibility(v1, v5, v3) | % 11.24/2.32 ~ reproducibility(v0, v4, v2) | ~ reorganization_free(v1, v3, v3) | ~ % 11.24/2.32 reorganization_free(v0, v2, v2) | ~ inertia(v1, v7, v3) | ~ inertia(v0, % 11.24/2.32 v6, v2) | ~ organization(v1, v3) | ~ organization(v0, v2) | greater(v7, % 11.24/2.32 v6)) % 11.24/2.32 % 11.24/2.32 (a5_FOL) % 11.24/2.32 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 11.24/2.32 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~ % 11.24/2.32 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 11.24/2.32 $i(v0) | ~ size(v1, v4, v8) | ~ size(v0, v3, v7) | ~ class(v1, v2, v8) | % 11.24/2.32 ~ class(v0, v2, v7) | ~ greater(v4, v3) | ~ inertia(v1, v6, v8) | ~ % 11.24/2.32 inertia(v0, v5, v7) | ~ organization(v1, v8) | ~ organization(v0, v7) | % 11.24/2.32 greater(v6, v5)) % 11.24/2.32 % 11.24/2.32 (mp5) % 11.24/2.32 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 11.24/2.32 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1))) % 11.24/2.32 % 11.24/2.32 (t9_FOL) % 11.24/2.33 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 11.24/2.33 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ($i(v8) & $i(v7) & $i(v6) & % 11.24/2.33 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & size(v1, v6, v8) & % 11.24/2.33 size(v0, v5, v7) & class(v1, v2, v8) & class(v0, v2, v7) & greater(v6, v5) & % 11.24/2.33 reproducibility(v1, v4, v8) & reproducibility(v0, v3, v7) & % 11.24/2.33 reorganization_free(v1, v8, v8) & reorganization_free(v0, v7, v7) & % 11.24/2.33 organization(v1, v8) & organization(v0, v7) & ~ greater(v4, v3)) % 11.24/2.33 % 11.24/2.33 Those formulas are unsatisfiable: % 11.24/2.33 --------------------------------- % 11.24/2.33 % 11.24/2.33 Begin of proof % 11.24/2.33 | % 11.24/2.33 | ALPHA: (a3_FOL) implies: % 11.24/2.33 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 11.24/2.33 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ % 11.24/2.33 | $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 11.24/2.33 | ~ greater(v7, v6) | ~ reproducibility(v1, v5, v3) | ~ % 11.24/2.33 | reproducibility(v0, v4, v2) | ~ reorganization_free(v1, v3, v3) | ~ % 11.24/2.33 | reorganization_free(v0, v2, v2) | ~ inertia(v1, v7, v3) | ~ % 11.24/2.33 | inertia(v0, v6, v2) | ~ organization(v1, v3) | ~ organization(v0, % 11.24/2.33 | v2) | greater(v5, v4)) % 11.24/2.33 | % 11.24/2.33 | DELTA: instantiating (t9_FOL) with fresh symbols all_5_0, all_5_1, all_5_2, % 11.24/2.33 | all_5_3, all_5_4, all_5_5, all_5_6, all_5_7, all_5_8 gives: % 11.24/2.34 | (2) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) & % 11.24/2.34 | $i(all_5_5) & $i(all_5_6) & $i(all_5_7) & $i(all_5_8) & size(all_5_7, % 11.24/2.34 | all_5_2, all_5_0) & size(all_5_8, all_5_3, all_5_1) & class(all_5_7, % 11.24/2.34 | all_5_6, all_5_0) & class(all_5_8, all_5_6, all_5_1) & % 11.24/2.34 | greater(all_5_2, all_5_3) & reproducibility(all_5_7, all_5_4, all_5_0) % 11.24/2.34 | & reproducibility(all_5_8, all_5_5, all_5_1) & % 11.24/2.34 | reorganization_free(all_5_7, all_5_0, all_5_0) & % 11.24/2.34 | reorganization_free(all_5_8, all_5_1, all_5_1) & organization(all_5_7, % 11.24/2.34 | all_5_0) & organization(all_5_8, all_5_1) & ~ greater(all_5_4, % 11.24/2.34 | all_5_5) % 11.24/2.34 | % 11.24/2.34 | ALPHA: (2) implies: % 11.24/2.34 | (3) ~ greater(all_5_4, all_5_5) % 11.24/2.34 | (4) organization(all_5_8, all_5_1) % 11.24/2.34 | (5) organization(all_5_7, all_5_0) % 11.24/2.34 | (6) reorganization_free(all_5_8, all_5_1, all_5_1) % 11.24/2.34 | (7) reorganization_free(all_5_7, all_5_0, all_5_0) % 11.24/2.34 | (8) reproducibility(all_5_8, all_5_5, all_5_1) % 11.24/2.34 | (9) reproducibility(all_5_7, all_5_4, all_5_0) % 11.24/2.34 | (10) greater(all_5_2, all_5_3) % 11.24/2.34 | (11) class(all_5_8, all_5_6, all_5_1) % 11.24/2.34 | (12) class(all_5_7, all_5_6, all_5_0) % 11.24/2.34 | (13) size(all_5_8, all_5_3, all_5_1) % 11.24/2.34 | (14) size(all_5_7, all_5_2, all_5_0) % 11.24/2.34 | (15) $i(all_5_8) % 11.24/2.34 | (16) $i(all_5_7) % 11.24/2.34 | (17) $i(all_5_6) % 11.24/2.34 | (18) $i(all_5_5) % 11.24/2.34 | (19) $i(all_5_4) % 11.24/2.34 | (20) $i(all_5_3) % 11.24/2.34 | (21) $i(all_5_2) % 11.24/2.35 | (22) $i(all_5_1) % 11.24/2.35 | (23) $i(all_5_0) % 11.24/2.35 | % 11.24/2.35 | GROUND_INST: instantiating (mp5) with all_5_8, all_5_1, simplifying with (4), % 11.24/2.35 | (15), (22) gives: % 11.24/2.35 | (24) ? [v0: $i] : ($i(v0) & inertia(all_5_8, v0, all_5_1)) % 11.24/2.35 | % 11.24/2.35 | GROUND_INST: instantiating (mp5) with all_5_7, all_5_0, simplifying with (5), % 11.24/2.35 | (16), (23) gives: % 11.24/2.35 | (25) ? [v0: $i] : ($i(v0) & inertia(all_5_7, v0, all_5_0)) % 11.24/2.35 | % 11.24/2.35 | DELTA: instantiating (25) with fresh symbol all_12_0 gives: % 11.24/2.35 | (26) $i(all_12_0) & inertia(all_5_7, all_12_0, all_5_0) % 11.24/2.35 | % 11.24/2.35 | ALPHA: (26) implies: % 11.24/2.35 | (27) inertia(all_5_7, all_12_0, all_5_0) % 11.24/2.35 | (28) $i(all_12_0) % 11.24/2.35 | % 11.24/2.35 | DELTA: instantiating (24) with fresh symbol all_14_0 gives: % 11.24/2.35 | (29) $i(all_14_0) & inertia(all_5_8, all_14_0, all_5_1) % 11.24/2.35 | % 11.24/2.35 | ALPHA: (29) implies: % 11.24/2.35 | (30) inertia(all_5_8, all_14_0, all_5_1) % 11.24/2.35 | (31) $i(all_14_0) % 11.24/2.35 | % 11.24/2.35 | GROUND_INST: instantiating (a5_FOL) with all_5_8, all_5_7, all_5_6, all_5_3, % 11.24/2.35 | all_5_2, all_14_0, all_12_0, all_5_1, all_5_0, simplifying with % 11.24/2.35 | (4), (5), (10), (11), (12), (13), (14), (15), (16), (17), (20), % 11.24/2.35 | (21), (22), (23), (27), (28), (30), (31) gives: % 11.24/2.35 | (32) greater(all_12_0, all_14_0) % 11.24/2.35 | % 11.24/2.35 | GROUND_INST: instantiating (1) with all_5_8, all_5_7, all_5_1, all_5_0, % 11.24/2.35 | all_5_5, all_5_4, all_14_0, all_12_0, simplifying with (3), (4), % 11.24/2.35 | (5), (6), (7), (8), (9), (15), (16), (18), (19), (22), (23), % 11.24/2.35 | (27), (28), (30), (31), (32) gives: % 11.24/2.35 | (33) $false % 11.24/2.36 | % 11.24/2.36 | CLOSE: (33) is inconsistent. % 11.24/2.36 | % 11.24/2.36 End of proof % 11.24/2.36 % SZS output end Proof for theBenchmark % 11.24/2.36 % 11.24/2.36 1634ms %------------------------------------------------------------------------------