%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n031.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:29 AM UTC 2026 % Result : Theorem 15.78s 2.87s % Output : Proof 19.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.37 % Computer : n031.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Mon Sep 7 14:16:56 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.39 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.65/0.71 ________ _____ % 0.65/0.71 ___ __ \_________(_)________________________________ % 0.65/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.65/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.65/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.65/0.71 % 0.65/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.65/0.71 (2023-06-19) % 0.65/0.71 % 0.65/0.71 (c) Philipp Rümmer, 2009-2023 % 0.65/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.65/0.71 Amanda Stjerna. % 0.65/0.71 Free software under BSD-3-Clause. % 0.65/0.71 % 0.65/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.65/0.71 % 0.65/0.72 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.65/0.73 Running up to 7 provers in parallel. % 0.65/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.65/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.65/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.65/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.65/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.65/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.65/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.77/1.43 Prover 4: Preprocessing ... % 4.77/1.43 Prover 1: Preprocessing ... % 4.77/1.47 Prover 6: Preprocessing ... % 4.77/1.47 Prover 5: Preprocessing ... % 4.77/1.47 Prover 2: Preprocessing ... % 4.77/1.48 Prover 3: Preprocessing ... % 4.77/1.48 Prover 0: Preprocessing ... % 10.84/2.18 Prover 5: Proving ... % 11.02/2.21 Prover 2: Proving ... % 11.78/2.37 Prover 1: Constructing countermodel ... % 12.56/2.47 Prover 6: Proving ... % 12.56/2.48 Prover 3: Constructing countermodel ... % 13.36/2.53 Prover 4: Constructing countermodel ... % 14.14/2.61 Prover 0: Proving ... % 15.78/2.87 Prover 3: proved (2122ms) % 15.78/2.87 % 15.78/2.87 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.78/2.87 % 15.78/2.88 Prover 0: stopped % 15.78/2.88 Prover 2: stopped % 15.78/2.88 Prover 5: stopped % 15.78/2.88 Prover 6: stopped % 15.78/2.89 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 15.78/2.89 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 15.78/2.89 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 15.78/2.89 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 15.78/2.89 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.52/2.97 Prover 1: Found proof (size 11) % 16.52/2.97 Prover 1: proved (2228ms) % 16.52/2.97 Prover 4: stopped % 16.52/3.00 Prover 10: Preprocessing ... % 16.52/3.01 Prover 11: Preprocessing ... % 16.52/3.04 Prover 8: Preprocessing ... % 16.52/3.04 Prover 10: stopped % 16.52/3.04 Prover 13: Preprocessing ... % 16.52/3.05 Prover 7: Preprocessing ... % 17.89/3.09 Prover 13: stopped % 17.89/3.10 Prover 7: stopped % 17.89/3.10 Prover 11: stopped % 18.55/3.27 Prover 8: Warning: ignoring some quantifiers % 18.55/3.28 Prover 8: Constructing countermodel ... % 19.01/3.31 Prover 8: stopped % 19.01/3.31 % 19.01/3.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 19.01/3.31 % 19.01/3.32 % SZS output start Proof for theBenchmark % 19.01/3.33 Assumptions after simplification: % 19.01/3.33 --------------------------------- % 19.01/3.33 % 19.01/3.33 (in_lopen) % 19.01/3.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 19.01/3.39 (in_lopen(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 19.01/3.39 any] : ? [v5: any] : (leq(v0, v2) = v5 & less(v1, v0) = v4 & ( ~ (v5 = 0) % 19.01/3.39 | ~ (v4 = 0)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 19.01/3.39 (in_lopen(v0, v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v0, % 19.01/3.39 v2) = 0 & less(v1, v0) = 0)) % 19.01/3.39 % 19.01/3.39 (irreflexive) % 19.01/3.39 ! [v0: $i] : ( ~ (less(v0, v0) = 0) | ~ $i(v0)) % 19.01/3.39 % 19.01/3.39 (less_leq_trans) % 19.47/3.40 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (leq(v1, v2) = 0) | ~ (less(v0, % 19.47/3.40 v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | less(v0, v2) = 0) % 19.47/3.40 % 19.47/3.40 (odrl341) % 19.47/3.40 $i(v1200) & $i(v800) & $i(v600) & $i(v200) & $i(v32) & $i(v8) & $i(v0) & ? % 19.47/3.40 [v0: $i] : ? [v1: $i] : ? [v2: $i] : (in_lopen(v2, v0, v32) = 0 & % 19.47/3.40 in_lopen(v1, v0, v800) = 0 & in_lopen(v0, v0, v600) = 0 & leq(v1200, v0) = 0 % 19.47/3.40 & leq(v200, v1) = 0 & leq(v8, v2) = 0 & $i(v2) & $i(v1) & $i(v0)) % 19.47/3.40 % 19.47/3.40 (ord_v600_v1200) % 19.47/3.40 less(v600, v1200) = 0 & $i(v1200) & $i(v600) % 19.47/3.40 % 19.47/3.40 Further assumptions not needed in the proof: % 19.47/3.40 -------------------------------------------- % 19.47/3.40 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 19.47/3.40 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 19.47/3.41 conflict_is_verdict, distinct, in_closed, in_open, in_ropen, leq_antisym, % 19.47/3.41 leq_def, leq_less_trans, leq_trans, less_implies_leq, ord_v0_v1200, ord_v0_v200, % 19.47/3.41 ord_v0_v32, ord_v0_v600, ord_v0_v8, ord_v0_v800, ord_v200_v1200, ord_v200_v600, % 19.47/3.41 ord_v200_v800, ord_v32_v1200, ord_v32_v200, ord_v32_v600, ord_v32_v800, % 19.47/3.41 ord_v600_v800, ord_v800_v1200, ord_v8_v1200, ord_v8_v200, ord_v8_v32, % 19.47/3.41 ord_v8_v600, ord_v8_v800, transitive, trichotomy, unknown_is_verdict, val_v0, % 19.47/3.41 val_v1200, val_v200, val_v32, val_v600, val_v8, val_v800, verdict_enum, % 19.47/3.41 verdicts_distinct_cf_cp, verdicts_distinct_cf_un, verdicts_distinct_cp_un % 19.47/3.41 % 19.47/3.41 Those formulas are unsatisfiable: % 19.47/3.41 --------------------------------- % 19.47/3.41 % 19.47/3.41 Begin of proof % 19.47/3.41 | % 19.47/3.41 | ALPHA: (in_lopen) implies: % 19.47/3.41 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (in_lopen(v0, v1, v2) = % 19.47/3.41 | 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v0, v2) = 0 & % 19.47/3.41 | less(v1, v0) = 0)) % 19.47/3.41 | % 19.47/3.41 | ALPHA: (ord_v600_v1200) implies: % 19.47/3.41 | (2) less(v600, v1200) = 0 % 19.47/3.41 | % 19.47/3.41 | ALPHA: (odrl341) implies: % 19.47/3.42 | (3) $i(v0) % 19.47/3.42 | (4) $i(v600) % 19.47/3.42 | (5) $i(v1200) % 19.47/3.42 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (in_lopen(v2, v0, v32) = 0 & % 19.47/3.42 | in_lopen(v1, v0, v800) = 0 & in_lopen(v0, v0, v600) = 0 & leq(v1200, % 19.47/3.42 | v0) = 0 & leq(v200, v1) = 0 & leq(v8, v2) = 0 & $i(v2) & $i(v1) & % 19.47/3.42 | $i(v0)) % 19.47/3.42 | % 19.47/3.42 | DELTA: instantiating (6) with fresh symbols all_25_0, all_25_1, all_25_2 % 19.47/3.42 | gives: % 19.47/3.43 | (7) in_lopen(all_25_0, v0, v32) = 0 & in_lopen(all_25_1, v0, v800) = 0 & % 19.47/3.43 | in_lopen(all_25_2, v0, v600) = 0 & leq(v1200, all_25_2) = 0 & leq(v200, % 19.47/3.43 | all_25_1) = 0 & leq(v8, all_25_0) = 0 & $i(all_25_0) & $i(all_25_1) & % 19.47/3.43 | $i(all_25_2) % 19.47/3.43 | % 19.47/3.43 | ALPHA: (7) implies: % 19.47/3.43 | (8) $i(all_25_2) % 19.47/3.43 | (9) leq(v1200, all_25_2) = 0 % 19.47/3.43 | (10) in_lopen(all_25_2, v0, v600) = 0 % 19.47/3.43 | % 19.47/3.43 | GROUND_INST: instantiating (less_leq_trans) with v600, v1200, all_25_2, % 19.47/3.43 | simplifying with (2), (4), (5), (8), (9) gives: % 19.47/3.43 | (11) less(v600, all_25_2) = 0 % 19.47/3.43 | % 19.47/3.43 | GROUND_INST: instantiating (1) with all_25_2, v0, v600, simplifying with (3), % 19.47/3.43 | (4), (8), (10) gives: % 19.47/3.43 | (12) leq(all_25_2, v600) = 0 & less(v0, all_25_2) = 0 % 19.47/3.43 | % 19.47/3.43 | ALPHA: (12) implies: % 19.47/3.43 | (13) leq(all_25_2, v600) = 0 % 19.47/3.43 | % 19.47/3.43 | GROUND_INST: instantiating (less_leq_trans) with v600, all_25_2, v600, % 19.47/3.43 | simplifying with (4), (8), (11), (13) gives: % 19.47/3.43 | (14) less(v600, v600) = 0 % 19.47/3.43 | % 19.47/3.43 | GROUND_INST: instantiating (irreflexive) with v600, simplifying with (4), (14) % 19.47/3.43 | gives: % 19.47/3.43 | (15) $false % 19.47/3.44 | % 19.47/3.44 | CLOSE: (15) is inconsistent. % 19.47/3.44 | % 19.47/3.44 End of proof % 19.47/3.44 % SZS output end Proof for theBenchmark % 19.47/3.44 % 19.47/3.44 2720ms %------------------------------------------------------------------------------