%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT008+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 : n028.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 6.58s 1.64s % Output : Proof 10.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT008+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.07/0.35 % Computer : n028.cluster.edu % 0.07/0.35 % Model : x86_64 x86_64 % 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.35 % Memory : 8046.5625MB % 0.07/0.35 % OS : Linux 6.8.0-71-generic % 0.07/0.35 % CPULimit : 300 % 0.07/0.35 % WCLimit : 300 % 0.07/0.35 % DateTime : Mon Sep 7 11:47:17 UTC 2026 % 0.07/0.35 % CPUTime : % 0.12/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.54/0.68 ________ _____ % 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/sandbox/benchmark/theBenchmark.p ... % 0.68/0.71 Running up to 7 provers in parallel. % 0.68/0.72 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.72 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.72 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.72 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.72 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.72 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.72 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.19/1.11 Prover 1: Preprocessing ... % 2.19/1.11 Prover 4: Preprocessing ... % 2.97/1.16 Prover 2: Preprocessing ... % 2.97/1.16 Prover 5: Preprocessing ... % 2.97/1.16 Prover 6: Preprocessing ... % 2.97/1.16 Prover 3: Preprocessing ... % 2.97/1.17 Prover 0: Preprocessing ... % 4.18/1.37 Prover 2: Constructing countermodel ... % 4.18/1.40 Prover 5: Constructing countermodel ... % 4.98/1.48 Prover 3: Constructing countermodel ... % 4.98/1.48 Prover 6: Constructing countermodel ... % 4.98/1.49 Prover 1: Constructing countermodel ... % 6.58/1.63 Prover 2: proved (917ms) % 6.58/1.64 % 6.58/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.58/1.64 % 6.58/1.65 Prover 6: stopped % 6.58/1.65 Prover 5: stopped % 6.58/1.66 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.58/1.66 Prover 3: stopped % 6.58/1.66 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.58/1.66 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.58/1.66 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.58/1.69 Prover 7: Preprocessing ... % 7.34/1.71 Prover 11: Preprocessing ... % 7.34/1.71 Prover 8: Preprocessing ... % 7.34/1.72 Prover 10: Preprocessing ... % 7.34/1.77 Prover 10: Constructing countermodel ... % 7.34/1.77 Prover 7: Constructing countermodel ... % 8.12/1.87 Prover 8: Warning: ignoring some quantifiers % 8.12/1.88 Prover 8: Constructing countermodel ... % 8.12/1.89 Prover 10: Found proof (size 11) % 8.12/1.90 Prover 10: proved (229ms) % 8.12/1.90 Prover 7: stopped % 8.90/1.90 Prover 1: stopped % 8.90/1.90 Prover 8: stopped % 8.90/1.90 Prover 11: stopped % 9.68/2.09 Prover 4: Constructing countermodel ... % 9.68/2.11 Prover 4: stopped % 10.27/2.13 Prover 0: Proving ... % 10.27/2.14 Prover 0: stopped % 10.27/2.14 % 10.27/2.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.27/2.14 % 10.27/2.14 % SZS output start Proof for theBenchmark % 10.27/2.15 Assumptions after simplification: % 10.27/2.15 --------------------------------- % 10.27/2.15 % 10.27/2.15 (a5_FOL) % 10.27/2.17 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.27/2.17 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~ % 10.27/2.17 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 10.27/2.17 $i(v0) | ~ greater(v4, v3) | ~ size(v1, v4, v8) | ~ size(v0, v3, v7) | ~ % 10.27/2.17 class(v1, v2, v8) | ~ class(v0, v2, v7) | ~ inertia(v1, v6, v8) | ~ % 10.27/2.17 inertia(v0, v5, v7) | ~ organization(v1, v8) | ~ organization(v0, v7) | % 10.27/2.17 greater(v6, v5)) % 10.27/2.17 % 10.27/2.17 (mp5) % 10.27/2.17 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 10.27/2.17 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1))) % 10.27/2.17 % 10.27/2.17 (t1_FOL) % 10.27/2.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.27/2.18 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ % 10.27/2.18 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.27/2.18 survival_chance(v1, v7, v3) | ~ survival_chance(v0, v6, v2) | ~ % 10.27/2.18 reorganization_free(v1, v3, v3) | ~ reorganization_free(v0, v2, v2) | ~ % 10.27/2.18 greater(v5, v4) | ~ inertia(v1, v5, v3) | ~ inertia(v0, v4, v2) | ~ % 10.27/2.18 organization(v1, v3) | ~ organization(v0, v2) | greater(v7, v6)) % 10.27/2.18 % 10.27/2.18 (t8_FOL) % 10.27/2.19 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.27/2.19 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ($i(v8) & $i(v7) & $i(v6) & % 10.27/2.19 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & survival_chance(v1, % 10.27/2.19 v4, v8) & survival_chance(v0, v3, v7) & reorganization_free(v1, v8, v8) & % 10.27/2.19 reorganization_free(v0, v7, v7) & greater(v6, v5) & size(v1, v6, v8) & % 10.27/2.19 size(v0, v5, v7) & class(v1, v2, v8) & class(v0, v2, v7) & organization(v1, % 10.27/2.19 v8) & organization(v0, v7) & ~ greater(v4, v3)) % 10.27/2.19 % 10.27/2.19 Those formulas are unsatisfiable: % 10.27/2.19 --------------------------------- % 10.27/2.19 % 10.27/2.19 Begin of proof % 10.27/2.19 | % 10.27/2.19 | DELTA: instantiating (t8_FOL) with fresh symbols all_5_0, all_5_1, all_5_2, % 10.27/2.19 | all_5_3, all_5_4, all_5_5, all_5_6, all_5_7, all_5_8 gives: % 10.61/2.20 | (1) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) & % 10.61/2.20 | $i(all_5_5) & $i(all_5_6) & $i(all_5_7) & $i(all_5_8) & % 10.61/2.20 | survival_chance(all_5_7, all_5_4, all_5_0) & survival_chance(all_5_8, % 10.61/2.20 | all_5_5, all_5_1) & reorganization_free(all_5_7, all_5_0, all_5_0) & % 10.61/2.20 | reorganization_free(all_5_8, all_5_1, all_5_1) & greater(all_5_2, % 10.61/2.20 | all_5_3) & size(all_5_7, all_5_2, all_5_0) & size(all_5_8, all_5_3, % 10.61/2.20 | all_5_1) & class(all_5_7, all_5_6, all_5_0) & class(all_5_8, all_5_6, % 10.61/2.20 | all_5_1) & organization(all_5_7, all_5_0) & organization(all_5_8, % 10.61/2.20 | all_5_1) & ~ greater(all_5_4, all_5_5) % 10.61/2.20 | % 10.61/2.20 | ALPHA: (1) implies: % 10.61/2.20 | (2) ~ greater(all_5_4, all_5_5) % 10.61/2.20 | (3) organization(all_5_8, all_5_1) % 10.61/2.21 | (4) organization(all_5_7, all_5_0) % 10.61/2.21 | (5) class(all_5_8, all_5_6, all_5_1) % 10.61/2.21 | (6) class(all_5_7, all_5_6, all_5_0) % 10.61/2.21 | (7) size(all_5_8, all_5_3, all_5_1) % 10.61/2.21 | (8) size(all_5_7, all_5_2, all_5_0) % 10.61/2.21 | (9) greater(all_5_2, all_5_3) % 10.61/2.21 | (10) reorganization_free(all_5_8, all_5_1, all_5_1) % 10.61/2.21 | (11) reorganization_free(all_5_7, all_5_0, all_5_0) % 10.61/2.21 | (12) survival_chance(all_5_8, all_5_5, all_5_1) % 10.61/2.21 | (13) survival_chance(all_5_7, all_5_4, all_5_0) % 10.61/2.21 | (14) $i(all_5_8) % 10.61/2.21 | (15) $i(all_5_7) % 10.61/2.21 | (16) $i(all_5_6) % 10.61/2.21 | (17) $i(all_5_5) % 10.61/2.21 | (18) $i(all_5_4) % 10.61/2.21 | (19) $i(all_5_3) % 10.61/2.21 | (20) $i(all_5_2) % 10.61/2.21 | (21) $i(all_5_1) % 10.61/2.21 | (22) $i(all_5_0) % 10.61/2.21 | % 10.61/2.21 | GROUND_INST: instantiating (mp5) with all_5_8, all_5_1, simplifying with (3), % 10.61/2.21 | (14), (21) gives: % 10.61/2.21 | (23) ? [v0: $i] : ($i(v0) & inertia(all_5_8, v0, all_5_1)) % 10.61/2.21 | % 10.61/2.22 | GROUND_INST: instantiating (mp5) with all_5_7, all_5_0, simplifying with (4), % 10.61/2.22 | (15), (22) gives: % 10.61/2.22 | (24) ? [v0: $i] : ($i(v0) & inertia(all_5_7, v0, all_5_0)) % 10.61/2.22 | % 10.61/2.22 | DELTA: instantiating (24) with fresh symbol all_12_0 gives: % 10.61/2.22 | (25) $i(all_12_0) & inertia(all_5_7, all_12_0, all_5_0) % 10.61/2.22 | % 10.61/2.22 | ALPHA: (25) implies: % 10.61/2.22 | (26) inertia(all_5_7, all_12_0, all_5_0) % 10.61/2.22 | (27) $i(all_12_0) % 10.61/2.22 | % 10.61/2.22 | DELTA: instantiating (23) with fresh symbol all_14_0 gives: % 10.61/2.22 | (28) $i(all_14_0) & inertia(all_5_8, all_14_0, all_5_1) % 10.61/2.22 | % 10.61/2.22 | ALPHA: (28) implies: % 10.61/2.22 | (29) inertia(all_5_8, all_14_0, all_5_1) % 10.61/2.22 | (30) $i(all_14_0) % 10.61/2.22 | % 10.61/2.22 | GROUND_INST: instantiating (a5_FOL) with all_5_8, all_5_7, all_5_6, all_5_3, % 10.61/2.22 | all_5_2, all_14_0, all_12_0, all_5_1, all_5_0, simplifying with % 10.61/2.22 | (3), (4), (5), (6), (7), (8), (9), (14), (15), (16), (19), (20), % 10.61/2.22 | (21), (22), (26), (27), (29), (30) gives: % 10.61/2.22 | (31) greater(all_12_0, all_14_0) % 10.61/2.22 | % 10.61/2.23 | GROUND_INST: instantiating (t1_FOL) with all_5_8, all_5_7, all_5_1, all_5_0, % 10.61/2.23 | all_14_0, all_12_0, all_5_5, all_5_4, simplifying with (2), (3), % 10.61/2.23 | (4), (10), (11), (12), (13), (14), (15), (17), (18), (21), (22), % 10.61/2.23 | (26), (27), (29), (30), (31) gives: % 10.61/2.23 | (32) $false % 10.61/2.23 | % 10.61/2.23 | CLOSE: (32) is inconsistent. % 10.61/2.23 | % 10.61/2.23 End of proof % 10.61/2.23 % SZS output end Proof for theBenchmark % 10.61/2.23 % 10.61/2.23 1541ms %------------------------------------------------------------------------------