%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT006+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 7.20s 1.71s % Output : Proof 13.89s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT006+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.35 % Computer : n010.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 11:41:56 UTC 2026 % 0.09/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.68/0.71 ________ _____ % 0.68/0.71 ___ __ \_________(_)________________________________ % 0.68/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.68/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.68/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.68/0.71 % 0.68/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.68/0.71 (2023-06-19) % 0.68/0.71 % 0.68/0.71 (c) Philipp Rümmer, 2009-2023 % 0.68/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.68/0.71 Amanda Stjerna. % 0.68/0.71 Free software under BSD-3-Clause. % 0.68/0.71 % 0.68/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.68/0.72 % 0.68/0.72 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.74 Running up to 7 provers in parallel. % 0.68/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.78/1.13 Prover 1: Preprocessing ... % 2.78/1.13 Prover 4: Preprocessing ... % 2.78/1.19 Prover 0: Preprocessing ... % 2.78/1.19 Prover 5: Preprocessing ... % 2.78/1.19 Prover 2: Preprocessing ... % 2.78/1.19 Prover 3: Preprocessing ... % 2.78/1.19 Prover 6: Preprocessing ... % 4.83/1.41 Prover 5: Constructing countermodel ... % 4.83/1.41 Prover 2: Constructing countermodel ... % 4.83/1.47 Prover 1: Constructing countermodel ... % 4.83/1.49 Prover 6: Constructing countermodel ... % 5.61/1.51 Prover 3: Constructing countermodel ... % 7.20/1.70 Prover 5: proved (955ms) % 7.20/1.71 % 7.20/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.20/1.71 % 7.20/1.71 Prover 2: stopped % 7.20/1.71 Prover 6: stopped % 7.20/1.72 Prover 3: stopped % 7.20/1.73 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.20/1.73 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.20/1.73 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.20/1.73 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.20/1.76 Prover 8: Preprocessing ... % 7.20/1.76 Prover 7: Preprocessing ... % 7.20/1.79 Prover 11: Preprocessing ... % 7.98/1.80 Prover 10: Preprocessing ... % 7.98/1.90 Prover 7: Constructing countermodel ... % 8.79/1.91 Prover 8: Warning: ignoring some quantifiers % 8.79/1.91 Prover 10: Constructing countermodel ... % 8.79/1.92 Prover 8: Constructing countermodel ... % 9.96/2.12 Prover 10: Found proof (size 17) % 9.96/2.12 Prover 10: proved (403ms) % 9.96/2.12 Prover 1: stopped % 9.96/2.13 Prover 7: stopped % 9.96/2.13 Prover 8: stopped % 11.06/2.22 Prover 4: Constructing countermodel ... % 11.06/2.23 Prover 4: stopped % 12.88/2.51 Prover 0: Proving ... % 12.88/2.53 Prover 0: stopped % 12.88/2.58 Prover 11: Constructing countermodel ... % 12.88/2.60 Prover 11: stopped % 12.88/2.60 % 12.88/2.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.88/2.60 % 13.42/2.61 % SZS output start Proof for theBenchmark % 13.42/2.61 Assumptions after simplification: % 13.42/2.61 --------------------------------- % 13.42/2.61 % 13.42/2.61 (a2_FOL) % 13.42/2.64 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 13.42/2.64 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ( ~ $i(v9) | % 13.42/2.64 ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ % 13.42/2.64 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8) | ~ accountability(v1, % 13.42/2.65 v7, v3) | ~ accountability(v0, v6, v2) | ~ reliability(v1, v5, v3) | ~ % 13.42/2.65 reliability(v0, v4, v2) | ~ reproducibility(v1, v9, v3) | ~ % 13.42/2.65 reproducibility(v0, v8, v2) | ~ organization(v1, v3) | ~ organization(v0, % 13.42/2.65 v2) | greater(v7, v6)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 13.42/2.65 $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : % 13.42/2.65 ! [v9: $i] : ( ~ $i(v9) | ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ % 13.42/2.65 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8) % 13.42/2.65 | ~ accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~ % 13.42/2.65 reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~ % 13.42/2.65 reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~ % 13.42/2.65 organization(v1, v3) | ~ organization(v0, v2) | greater(v5, v4)) & ! [v0: % 13.42/2.65 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : % 13.42/2.65 ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ( ~ $i(v9) | ~ $i(v8) % 13.42/2.65 | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ % 13.42/2.65 $i(v1) | ~ $i(v0) | ~ greater(v7, v6) | ~ greater(v5, v4) | ~ % 13.42/2.65 accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~ % 13.42/2.65 reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~ % 13.42/2.65 reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~ % 13.42/2.65 organization(v1, v3) | ~ organization(v0, v2) | greater(v9, v8)) % 13.42/2.65 % 13.42/2.65 (a4_FOL) % 13.42/2.65 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 13.42/2.65 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 13.42/2.65 reorganization_free(v0, v3, v4) | ~ greater(v4, v3) | ~ % 13.42/2.65 reproducibility(v0, v2, v4) | ~ reproducibility(v0, v1, v3) | ~ % 13.42/2.65 organization(v0, v4) | ~ organization(v0, v3) | greater(v2, v1)) % 13.42/2.65 % 13.42/2.65 (mp3) % 13.42/2.65 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) | % 13.42/2.65 ? [v2: $i] : ($i(v2) & reproducibility(v0, v2, v1))) % 13.42/2.65 % 13.42/2.65 (t6_FOL) % 13.42/2.66 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 13.42/2.66 $i] : ? [v6: $i] : ($i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 13.42/2.66 $i(v0) & reorganization_free(v0, v5, v6) & greater(v6, v5) & % 13.42/2.66 accountability(v0, v4, v6) & accountability(v0, v3, v5) & reliability(v0, % 13.42/2.66 v2, v6) & reliability(v0, v1, v5) & organization(v0, v6) & % 13.42/2.66 organization(v0, v5) & ( ~ greater(v4, v3) | ~ greater(v2, v1))) % 13.42/2.66 % 13.42/2.66 Those formulas are unsatisfiable: % 13.42/2.66 --------------------------------- % 13.42/2.66 % 13.42/2.66 Begin of proof % 13.42/2.66 | % 13.42/2.66 | ALPHA: (a2_FOL) implies: % 13.42/2.67 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 13.42/2.67 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ( % 13.42/2.67 | ~ $i(v9) | ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) % 13.42/2.67 | | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8) % 13.42/2.67 | | ~ accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~ % 13.42/2.67 | reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~ % 13.42/2.67 | reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~ % 13.42/2.67 | organization(v1, v3) | ~ organization(v0, v2) | greater(v5, v4)) % 13.42/2.67 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 13.42/2.67 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ( % 13.42/2.67 | ~ $i(v9) | ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) % 13.42/2.67 | | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8) % 13.42/2.67 | | ~ accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~ % 13.42/2.67 | reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~ % 13.42/2.67 | reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~ % 13.42/2.67 | organization(v1, v3) | ~ organization(v0, v2) | greater(v7, v6)) % 13.42/2.67 | % 13.42/2.67 | DELTA: instantiating (t6_FOL) with fresh symbols all_5_0, all_5_1, all_5_2, % 13.42/2.67 | all_5_3, all_5_4, all_5_5, all_5_6 gives: % 13.42/2.67 | (3) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) & % 13.42/2.67 | $i(all_5_5) & $i(all_5_6) & reorganization_free(all_5_6, all_5_1, % 13.42/2.67 | all_5_0) & greater(all_5_0, all_5_1) & accountability(all_5_6, % 13.42/2.67 | all_5_2, all_5_0) & accountability(all_5_6, all_5_3, all_5_1) & % 13.42/2.67 | reliability(all_5_6, all_5_4, all_5_0) & reliability(all_5_6, all_5_5, % 13.42/2.67 | all_5_1) & organization(all_5_6, all_5_0) & organization(all_5_6, % 13.42/2.67 | all_5_1) & ( ~ greater(all_5_2, all_5_3) | ~ greater(all_5_4, % 13.42/2.67 | all_5_5)) % 13.42/2.67 | % 13.42/2.67 | ALPHA: (3) implies: % 13.42/2.68 | (4) organization(all_5_6, all_5_1) % 13.42/2.68 | (5) organization(all_5_6, all_5_0) % 13.42/2.68 | (6) reliability(all_5_6, all_5_5, all_5_1) % 13.42/2.68 | (7) reliability(all_5_6, all_5_4, all_5_0) % 13.42/2.68 | (8) accountability(all_5_6, all_5_3, all_5_1) % 13.42/2.68 | (9) accountability(all_5_6, all_5_2, all_5_0) % 13.42/2.68 | (10) greater(all_5_0, all_5_1) % 13.42/2.68 | (11) reorganization_free(all_5_6, all_5_1, all_5_0) % 13.42/2.68 | (12) $i(all_5_6) % 13.42/2.68 | (13) $i(all_5_5) % 13.42/2.68 | (14) $i(all_5_4) % 13.42/2.68 | (15) $i(all_5_3) % 13.42/2.68 | (16) $i(all_5_2) % 13.42/2.68 | (17) $i(all_5_1) % 13.42/2.68 | (18) $i(all_5_0) % 13.42/2.68 | (19) ~ greater(all_5_2, all_5_3) | ~ greater(all_5_4, all_5_5) % 13.42/2.68 | % 13.42/2.68 | GROUND_INST: instantiating (mp3) with all_5_6, all_5_1, simplifying with (4), % 13.42/2.68 | (12), (17) gives: % 13.42/2.68 | (20) ? [v0: $i] : ($i(v0) & reproducibility(all_5_6, v0, all_5_1)) % 13.42/2.68 | % 13.42/2.68 | GROUND_INST: instantiating (mp3) with all_5_6, all_5_0, simplifying with (5), % 13.42/2.68 | (12), (18) gives: % 13.42/2.69 | (21) ? [v0: $i] : ($i(v0) & reproducibility(all_5_6, v0, all_5_0)) % 13.42/2.69 | % 13.42/2.69 | DELTA: instantiating (21) with fresh symbol all_12_0 gives: % 13.42/2.69 | (22) $i(all_12_0) & reproducibility(all_5_6, all_12_0, all_5_0) % 13.42/2.69 | % 13.42/2.69 | ALPHA: (22) implies: % 13.42/2.69 | (23) reproducibility(all_5_6, all_12_0, all_5_0) % 13.42/2.69 | (24) $i(all_12_0) % 13.42/2.69 | % 13.42/2.69 | DELTA: instantiating (20) with fresh symbol all_14_0 gives: % 13.42/2.69 | (25) $i(all_14_0) & reproducibility(all_5_6, all_14_0, all_5_1) % 13.42/2.69 | % 13.42/2.69 | ALPHA: (25) implies: % 13.42/2.69 | (26) reproducibility(all_5_6, all_14_0, all_5_1) % 13.42/2.69 | (27) $i(all_14_0) % 13.42/2.69 | % 13.42/2.69 | GROUND_INST: instantiating (a4_FOL) with all_5_6, all_14_0, all_12_0, all_5_1, % 13.42/2.69 | all_5_0, simplifying with (4), (5), (10), (11), (12), (17), (18), % 13.42/2.69 | (23), (24), (26), (27) gives: % 13.42/2.69 | (28) greater(all_12_0, all_14_0) % 13.42/2.69 | % 13.42/2.69 | GROUND_INST: instantiating (2) with all_5_6, all_5_6, all_5_1, all_5_0, % 13.42/2.69 | all_5_5, all_5_4, all_5_3, all_5_2, all_14_0, all_12_0, % 13.42/2.69 | simplifying with (4), (5), (6), (7), (8), (9), (12), (13), (14), % 13.42/2.69 | (15), (16), (17), (18), (23), (24), (26), (27), (28) gives: % 13.42/2.70 | (29) greater(all_5_2, all_5_3) % 13.42/2.70 | % 13.89/2.70 | GROUND_INST: instantiating (1) with all_5_6, all_5_6, all_5_1, all_5_0, % 13.89/2.70 | all_5_5, all_5_4, all_5_3, all_5_2, all_14_0, all_12_0, % 13.89/2.70 | simplifying with (4), (5), (6), (7), (8), (9), (12), (13), (14), % 13.89/2.70 | (15), (16), (17), (18), (23), (24), (26), (27), (28) gives: % 13.89/2.70 | (30) greater(all_5_4, all_5_5) % 13.89/2.70 | % 13.89/2.70 | BETA: splitting (19) gives: % 13.89/2.70 | % 13.89/2.70 | Case 1: % 13.89/2.70 | | % 13.89/2.70 | | (31) ~ greater(all_5_2, all_5_3) % 13.89/2.70 | | % 13.89/2.70 | | PRED_UNIFY: (29), (31) imply: % 13.89/2.70 | | (32) $false % 13.89/2.70 | | % 13.89/2.70 | | CLOSE: (32) is inconsistent. % 13.89/2.70 | | % 13.89/2.70 | Case 2: % 13.89/2.70 | | % 13.89/2.70 | | (33) ~ greater(all_5_4, all_5_5) % 13.89/2.70 | | % 13.89/2.70 | | PRED_UNIFY: (30), (33) imply: % 13.89/2.70 | | (34) $false % 13.89/2.70 | | % 13.89/2.70 | | CLOSE: (34) is inconsistent. % 13.89/2.70 | | % 13.89/2.70 | End of split % 13.89/2.70 | % 13.89/2.70 End of proof % 13.89/2.70 % SZS output end Proof for theBenchmark % 13.89/2.71 % 13.89/2.71 1987ms %------------------------------------------------------------------------------