%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT003+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 : n010.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 5.80s 1.58s % Output : Proof 9.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT003+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.35 % Computer : n010.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Mon Sep 7 11:34:11 UTC 2026 % 0.10/0.35 % 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.58/0.68 ________ _____ % 0.58/0.68 ___ __ \_________(_)________________________________ % 0.58/0.68 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.58/0.68 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.58/0.68 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.58/0.68 % 0.58/0.68 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.58/0.69 (2023-06-19) % 0.58/0.69 % 0.58/0.69 (c) Philipp Rümmer, 2009-2023 % 0.58/0.69 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.58/0.69 Amanda Stjerna. % 0.58/0.69 Free software under BSD-3-Clause. % 0.58/0.69 % 0.58/0.69 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.58/0.69 % 0.58/0.69 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.73/0.71 Running up to 7 provers in parallel. % 0.73/0.72 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.73/0.72 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.73/0.72 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.73/0.72 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.73/0.72 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.73/0.72 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.73/0.72 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.38/1.09 Prover 1: Preprocessing ... % 2.38/1.09 Prover 4: Preprocessing ... % 2.38/1.15 Prover 5: Preprocessing ... % 2.38/1.15 Prover 0: Preprocessing ... % 2.38/1.15 Prover 6: Preprocessing ... % 2.38/1.15 Prover 2: Preprocessing ... % 2.38/1.16 Prover 3: Preprocessing ... % 4.23/1.40 Prover 2: Constructing countermodel ... % 4.23/1.40 Prover 5: Constructing countermodel ... % 5.03/1.45 Prover 1: Constructing countermodel ... % 5.03/1.47 Prover 3: Constructing countermodel ... % 5.03/1.49 Prover 6: Constructing countermodel ... % 5.80/1.58 Prover 5: proved (862ms) % 5.80/1.58 % 5.80/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.80/1.58 % 5.80/1.59 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.80/1.59 Prover 2: stopped % 5.80/1.59 Prover 3: stopped % 5.80/1.60 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.57/1.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.57/1.60 Prover 6: stopped % 6.57/1.60 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.57/1.65 Prover 10: Preprocessing ... % 6.57/1.65 Prover 8: Preprocessing ... % 6.57/1.67 Prover 7: Preprocessing ... % 6.57/1.69 Prover 11: Preprocessing ... % 7.38/1.70 Prover 10: Constructing countermodel ... % 7.38/1.76 Prover 7: Constructing countermodel ... % 7.38/1.79 Prover 8: Warning: ignoring some quantifiers % 8.15/1.80 Prover 8: Constructing countermodel ... % 8.15/1.84 Prover 10: Found proof (size 14) % 8.15/1.84 Prover 10: proved (242ms) % 8.15/1.84 Prover 1: stopped % 8.15/1.84 Prover 8: stopped % 8.15/1.85 Prover 7: stopped % 8.15/1.85 Prover 11: stopped % 8.84/1.93 Prover 4: Constructing countermodel ... % 8.84/1.96 Prover 4: stopped % 8.84/2.02 Prover 0: Proving ... % 8.84/2.04 Prover 0: stopped % 8.84/2.04 % 8.84/2.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.84/2.04 % 9.64/2.05 % SZS output start Proof for theBenchmark % 9.64/2.05 Assumptions after simplification: % 9.64/2.05 --------------------------------- % 9.64/2.05 % 9.64/2.05 (mp4) % 9.64/2.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 9.64/2.07 ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v2)) & ! % 9.64/2.07 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 9.64/2.07 reorganization_free(v0, v1, v2) | reorganization_free(v0, v1, v1)) % 9.64/2.07 % 9.64/2.07 (mp5) % 9.64/2.07 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 9.64/2.07 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1))) % 9.64/2.07 % 9.64/2.07 (t1_FOL) % 9.64/2.08 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 9.64/2.08 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ % 9.64/2.08 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v5, v4) % 9.64/2.08 | ~ survival_chance(v1, v7, v3) | ~ survival_chance(v0, v6, v2) | ~ % 9.64/2.08 inertia(v1, v5, v3) | ~ inertia(v0, v4, v2) | ~ organization(v1, v3) | ~ % 9.64/2.08 organization(v0, v2) | ~ reorganization_free(v1, v3, v3) | ~ % 9.64/2.08 reorganization_free(v0, v2, v2) | greater(v7, v6)) % 9.64/2.08 % 9.64/2.08 (t2_FOL) % 9.64/2.08 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 9.64/2.08 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v4, v3) % 9.64/2.08 | ~ inertia(v0, v2, v4) | ~ inertia(v0, v1, v3) | ~ organization(v0, v4) % 9.64/2.08 | ~ organization(v0, v3) | ~ reorganization_free(v0, v3, v4) | greater(v2, % 9.64/2.08 v1)) % 9.64/2.08 % 9.64/2.08 (t3_FOL) % 9.64/2.09 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ($i(v4) % 9.64/2.09 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & greater(v4, v3) & survival_chance(v0, % 9.64/2.09 v2, v4) & survival_chance(v0, v1, v3) & organization(v0, v4) & % 9.64/2.09 organization(v0, v3) & reorganization_free(v0, v3, v4) & ~ greater(v2, v1)) % 9.64/2.09 % 9.64/2.09 Those formulas are unsatisfiable: % 9.64/2.09 --------------------------------- % 9.64/2.09 % 9.64/2.09 Begin of proof % 9.64/2.09 | % 9.64/2.09 | ALPHA: (mp4) implies: % 9.64/2.10 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 9.64/2.10 | $i(v0) | ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, % 9.64/2.10 | v1, v1)) % 9.64/2.10 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 9.64/2.10 | $i(v0) | ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, % 9.64/2.10 | v2, v2)) % 9.64/2.10 | % 9.64/2.10 | DELTA: instantiating (t3_FOL) with fresh symbols all_6_0, all_6_1, all_6_2, % 9.64/2.10 | all_6_3, all_6_4 gives: % 9.64/2.10 | (3) $i(all_6_0) & $i(all_6_1) & $i(all_6_2) & $i(all_6_3) & $i(all_6_4) & % 9.64/2.10 | greater(all_6_0, all_6_1) & survival_chance(all_6_4, all_6_2, all_6_0) % 9.64/2.10 | & survival_chance(all_6_4, all_6_3, all_6_1) & organization(all_6_4, % 9.64/2.10 | all_6_0) & organization(all_6_4, all_6_1) & % 9.64/2.10 | reorganization_free(all_6_4, all_6_1, all_6_0) & ~ greater(all_6_2, % 9.64/2.10 | all_6_3) % 9.64/2.10 | % 9.64/2.10 | ALPHA: (3) implies: % 9.64/2.11 | (4) ~ greater(all_6_2, all_6_3) % 9.64/2.11 | (5) reorganization_free(all_6_4, all_6_1, all_6_0) % 9.64/2.11 | (6) organization(all_6_4, all_6_1) % 9.64/2.11 | (7) organization(all_6_4, all_6_0) % 9.64/2.11 | (8) survival_chance(all_6_4, all_6_3, all_6_1) % 9.64/2.11 | (9) survival_chance(all_6_4, all_6_2, all_6_0) % 9.64/2.11 | (10) greater(all_6_0, all_6_1) % 9.64/2.11 | (11) $i(all_6_4) % 9.64/2.11 | (12) $i(all_6_3) % 9.64/2.11 | (13) $i(all_6_2) % 9.64/2.11 | (14) $i(all_6_1) % 9.64/2.11 | (15) $i(all_6_0) % 9.64/2.11 | % 9.64/2.11 | GROUND_INST: instantiating (2) with all_6_4, all_6_1, all_6_0, simplifying % 9.64/2.11 | with (5), (11), (14), (15) gives: % 9.64/2.11 | (16) reorganization_free(all_6_4, all_6_0, all_6_0) % 9.64/2.11 | % 9.64/2.11 | GROUND_INST: instantiating (1) with all_6_4, all_6_1, all_6_0, simplifying % 9.64/2.11 | with (5), (11), (14), (15) gives: % 9.64/2.11 | (17) reorganization_free(all_6_4, all_6_1, all_6_1) % 9.64/2.12 | % 9.64/2.12 | GROUND_INST: instantiating (mp5) with all_6_4, all_6_1, simplifying with (6), % 9.64/2.12 | (11), (14) gives: % 9.64/2.12 | (18) ? [v0: $i] : ($i(v0) & inertia(all_6_4, v0, all_6_1)) % 9.64/2.12 | % 9.64/2.12 | GROUND_INST: instantiating (mp5) with all_6_4, all_6_0, simplifying with (7), % 9.64/2.12 | (11), (15) gives: % 9.64/2.12 | (19) ? [v0: $i] : ($i(v0) & inertia(all_6_4, v0, all_6_0)) % 9.64/2.12 | % 9.64/2.12 | DELTA: instantiating (19) with fresh symbol all_14_0 gives: % 9.64/2.12 | (20) $i(all_14_0) & inertia(all_6_4, all_14_0, all_6_0) % 9.64/2.12 | % 9.64/2.12 | ALPHA: (20) implies: % 9.64/2.12 | (21) inertia(all_6_4, all_14_0, all_6_0) % 9.64/2.12 | (22) $i(all_14_0) % 9.64/2.12 | % 9.64/2.12 | DELTA: instantiating (18) with fresh symbol all_16_0 gives: % 9.64/2.12 | (23) $i(all_16_0) & inertia(all_6_4, all_16_0, all_6_1) % 9.64/2.12 | % 9.64/2.12 | ALPHA: (23) implies: % 9.64/2.12 | (24) inertia(all_6_4, all_16_0, all_6_1) % 9.64/2.12 | (25) $i(all_16_0) % 9.64/2.12 | % 9.64/2.12 | GROUND_INST: instantiating (t2_FOL) with all_6_4, all_16_0, all_14_0, all_6_1, % 9.64/2.12 | all_6_0, simplifying with (5), (6), (7), (10), (11), (14), (15), % 9.64/2.12 | (21), (22), (24), (25) gives: % 9.64/2.12 | (26) greater(all_14_0, all_16_0) % 9.64/2.12 | % 9.64/2.13 | GROUND_INST: instantiating (t1_FOL) with all_6_4, all_6_4, all_6_1, all_6_0, % 9.64/2.13 | all_16_0, all_14_0, all_6_3, all_6_2, simplifying with (4), (6), % 9.64/2.13 | (7), (8), (9), (11), (12), (13), (14), (15), (16), (17), (21), % 9.64/2.13 | (22), (24), (25), (26) gives: % 9.64/2.13 | (27) $false % 9.64/2.13 | % 9.64/2.13 | CLOSE: (27) is inconsistent. % 9.64/2.13 | % 9.64/2.13 End of proof % 9.64/2.13 % SZS output end Proof for theBenchmark % 9.64/2.13 % 9.64/2.13 1443ms %------------------------------------------------------------------------------