%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT077+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 : n020.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 23.52s 3.97s % Output : Proof 30.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT077+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.10/0.36 % Computer : n020.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 14:13:28 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/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.69/0.71 ________ _____ % 0.69/0.71 ___ __ \_________(_)________________________________ % 0.69/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.69/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.69/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.69/0.71 % 0.69/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.69/0.71 (2023-06-19) % 0.69/0.71 % 0.69/0.71 (c) Philipp Rümmer, 2009-2023 % 0.69/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.69/0.71 Amanda Stjerna. % 0.69/0.71 Free software under BSD-3-Clause. % 0.69/0.71 % 0.69/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.69/0.71 % 0.69/0.71 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.73 Running up to 7 provers in parallel. % 0.69/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.69/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.69/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.69/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.69/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.69/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.69/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.72/1.52 Prover 1: Preprocessing ... % 4.72/1.52 Prover 4: Preprocessing ... % 4.72/1.56 Prover 0: Preprocessing ... % 4.72/1.56 Prover 2: Preprocessing ... % 4.72/1.56 Prover 6: Preprocessing ... % 4.72/1.57 Prover 5: Preprocessing ... % 4.72/1.57 Prover 3: Preprocessing ... % 9.97/2.19 Prover 5: Proving ... % 10.17/2.21 Prover 2: Proving ... % 10.17/2.29 Prover 6: Proving ... % 10.94/2.37 Prover 3: Constructing countermodel ... % 10.94/2.37 Prover 4: Constructing countermodel ... % 10.94/2.38 Prover 1: Constructing countermodel ... % 13.33/2.63 Prover 0: Proving ... % 23.52/3.97 Prover 2: proved (3228ms) % 23.52/3.97 % 23.52/3.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.52/3.97 % 23.52/3.97 Prover 0: stopped % 23.52/3.97 Prover 6: stopped % 23.52/3.97 Prover 5: stopped % 23.52/3.99 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 23.52/3.99 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 23.52/3.99 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 23.52/3.99 Prover 3: stopped % 23.52/3.99 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 23.52/3.99 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 24.69/4.11 Prover 11: Preprocessing ... % 24.69/4.12 Prover 7: Preprocessing ... % 24.69/4.12 Prover 13: Preprocessing ... % 24.69/4.14 Prover 10: Preprocessing ... % 25.53/4.16 Prover 8: Preprocessing ... % 25.82/4.27 Prover 10: Warning: ignoring some quantifiers % 25.82/4.27 Prover 7: Warning: ignoring some quantifiers % 25.82/4.28 Prover 10: Constructing countermodel ... % 25.82/4.29 Prover 7: Constructing countermodel ... % 26.65/4.33 Prover 13: Warning: ignoring some quantifiers % 26.65/4.35 Prover 13: Constructing countermodel ... % 26.65/4.36 Prover 11: Constructing countermodel ... % 28.22/4.54 Prover 8: Warning: ignoring some quantifiers % 28.22/4.56 Prover 8: Constructing countermodel ... % 29.81/4.76 Prover 10: Found proof (size 11) % 29.81/4.76 Prover 10: proved (785ms) % 29.81/4.76 Prover 7: stopped % 29.81/4.76 Prover 11: stopped % 29.81/4.76 Prover 13: stopped % 29.81/4.76 Prover 8: stopped % 29.81/4.76 Prover 4: stopped % 29.81/4.76 Prover 1: stopped % 29.81/4.76 % 29.81/4.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 29.81/4.76 % 29.81/4.77 % SZS output start Proof for theBenchmark % 29.81/4.78 Assumptions after simplification: % 29.81/4.78 --------------------------------- % 29.81/4.78 % 29.81/4.78 (in_open) % 29.81/4.79 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 29.81/4.79 ~ in_open(v0, v1, v2) | less(v1, v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 29.81/4.79 $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in_open(v0, v1, v2) | less(v0, % 29.81/4.79 v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | % 29.81/4.79 ~ $i(v0) | ~ less(v1, v0) | ~ less(v0, v2) | in_open(v0, v1, v2)) % 29.81/4.79 % 29.81/4.79 (odrl327) % 29.81/4.80 $i(v800) & $i(v500) & $i(v200) & $i(v100) & $i(v0) & ! [v0: $i] : ! [v1: $i] % 29.81/4.80 : ( ~ $i(v1) | ~ $i(v0) | ~ in_open(v1, v0, v500) | ~ in_open(v0, v0, v800) % 29.81/4.80 | ~ less(v200, v0) | ~ less(v100, v1)) % 29.81/4.80 % 29.81/4.80 (ord_v0_v200) % 29.81/4.80 $i(v200) & $i(v0) & less(v0, v200) % 29.81/4.80 % 29.81/4.80 (ord_v0_v500) % 30.52/4.80 $i(v500) & $i(v0) & less(v0, v500) % 30.52/4.80 % 30.52/4.80 (ord_v100_v200) % 30.52/4.80 $i(v200) & $i(v100) & less(v100, v200) % 30.52/4.80 % 30.52/4.80 (ord_v200_v500) % 30.52/4.80 $i(v500) & $i(v200) & less(v200, v500) % 30.52/4.80 % 30.52/4.80 (ord_v500_v800) % 30.52/4.80 $i(v800) & $i(v500) & less(v500, v800) % 30.52/4.80 % 30.52/4.80 Further assumptions not needed in the proof: % 30.52/4.80 -------------------------------------------- % 30.52/4.81 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 30.52/4.81 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 30.52/4.81 conflict_is_verdict, dense, distinct, in_closed, in_lopen, in_ropen, % 30.52/4.81 irreflexive, leq_antisym, leq_def, leq_less_trans, leq_trans, less_implies_leq, % 30.52/4.81 less_leq_trans, ord_v0_v100, ord_v0_v800, ord_v100_v500, ord_v100_v800, % 30.52/4.81 ord_v200_v800, transitive, trichotomy, unknown_is_verdict, val_v0, val_v100, % 30.52/4.81 val_v200, val_v500, val_v800, verdict_enum, verdicts_distinct_cf_cp, % 30.52/4.81 verdicts_distinct_cf_un, verdicts_distinct_cp_un % 30.52/4.81 % 30.52/4.81 Those formulas are unsatisfiable: % 30.52/4.81 --------------------------------- % 30.52/4.81 % 30.52/4.81 Begin of proof % 30.52/4.81 | % 30.52/4.81 | ALPHA: (in_open) implies: % 30.52/4.81 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 30.52/4.81 | $i(v0) | ~ less(v1, v0) | ~ less(v0, v2) | in_open(v0, v1, v2)) % 30.52/4.81 | % 30.52/4.81 | ALPHA: (ord_v0_v200) implies: % 30.52/4.81 | (2) less(v0, v200) % 30.52/4.81 | % 30.52/4.81 | ALPHA: (ord_v0_v500) implies: % 30.52/4.81 | (3) less(v0, v500) % 30.52/4.81 | % 30.52/4.81 | ALPHA: (ord_v100_v200) implies: % 30.52/4.81 | (4) less(v100, v200) % 30.52/4.81 | % 30.52/4.81 | ALPHA: (ord_v200_v500) implies: % 30.52/4.81 | (5) less(v200, v500) % 30.52/4.81 | % 30.52/4.81 | ALPHA: (ord_v500_v800) implies: % 30.52/4.82 | (6) less(v500, v800) % 30.52/4.82 | % 30.52/4.82 | ALPHA: (odrl327) implies: % 30.52/4.82 | (7) $i(v0) % 30.52/4.82 | (8) $i(v200) % 30.52/4.82 | (9) $i(v500) % 30.52/4.82 | (10) $i(v800) % 30.52/4.82 | (11) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ in_open(v1, % 30.52/4.82 | v0, v500) | ~ in_open(v0, v0, v800) | ~ less(v200, v0) | ~ % 30.52/4.82 | less(v100, v1)) % 30.52/4.82 | % 30.52/4.82 | GROUND_INST: instantiating (1) with v200, v0, v500, simplifying with (2), (5), % 30.52/4.82 | (7), (8), (9) gives: % 30.52/4.82 | (12) in_open(v200, v0, v500) % 30.52/4.82 | % 30.52/4.82 | GROUND_INST: instantiating (1) with v500, v0, v800, simplifying with (3), (6), % 30.52/4.82 | (7), (9), (10) gives: % 30.52/4.82 | (13) in_open(v500, v0, v800) % 30.52/4.82 | % 30.52/4.83 | GROUND_INST: instantiating (11) with v500, v200, simplifying with (4), (5), % 30.52/4.83 | (8), (9), (12), (13) gives: % 30.52/4.83 | (14) $false % 30.52/4.83 | % 30.52/4.83 | CLOSE: (14) is inconsistent. % 30.52/4.83 | % 30.52/4.83 End of proof % 30.52/4.83 % SZS output end Proof for theBenchmark % 30.52/4.83 % 30.52/4.83 4117ms %------------------------------------------------------------------------------